From d9ec475d945d3035377a0d89ed42e382d8988891 Mon Sep 17 00:00:00 2001 From: DongHun Kwak Date: Thu, 6 Oct 2016 10:33:54 +0900 Subject: Imported Upstream version 1.60.0 Change-Id: Ie709530d6d5841088ceaba025cbe175a4ef43050 Signed-off-by: DongHun Kwak --- doc/html/boost/CV/constrained_value.html | 46 +- doc/html/boost/CV/simple_exception_policy.html | 24 +- .../simple_exception_policy/exception_wrapper.html | 18 +- doc/html/boost/accumulators/absolute.html | 52 - doc/html/boost/accumulators/accumulator_base.html | 24 +- .../boost/accumulators/accumulator_concept.html | 12 +- doc/html/boost/accumulators/accumulator_set.html | 42 +- .../accumulators/as_featu_idm45507139496800.html | 54 + .../accumulators/as_feature_tag_idp64779136.html | 54 - .../accumulators/as_feature_tag_idp64932064.html | 54 - .../accumulators/as_feature_tag_idp64963952.html | 54 - .../accumulators/as_feature_tag_idp64966064.html | 54 - .../accumulators/as_feature_tag_idp64968208.html | 54 - .../accumulators/as_feature_tag_idp64970352.html | 54 - .../accumulators/as_feature_tag_idp65024544.html | 54 - .../accumulators/as_feature_tag_idp65026624.html | 54 - .../accumulators/as_feature_tag_idp65028704.html | 54 - .../accumulators/as_feature_tag_idp65032400.html | 54 - .../accumulators/as_feature_tag_idp65036080.html | 54 - .../accumulators/as_feature_tag_idp65038192.html | 54 - .../accumulators/as_feature_tag_idp65081440.html | 54 - .../accumulators/as_feature_tag_idp65083552.html | 54 - .../accumulators/as_feature_tag_idp65085696.html | 54 - .../accumulators/as_feature_tag_idp65158224.html | 54 - .../accumulators/as_feature_tag_idp65161088.html | 54 - .../accumulators/as_feature_tag_idp65283264.html | 54 - .../accumulators/as_feature_tag_idp65286112.html | 54 - .../accumulators/as_feature_tag_idp65288944.html | 54 - .../accumulators/as_feature_tag_idp65291808.html | 54 - .../accumulators/as_feature_tag_idp65313104.html | 54 - .../accumulators/as_feature_tag_idp65315952.html | 54 - .../accumulators/as_feature_tag_idp65318784.html | 54 - .../accumulators/as_feature_tag_idp65321648.html | 54 - .../accumulators/as_feature_tag_idp65351376.html | 54 - .../accumulators/as_feature_tag_idp65353488.html | 54 - .../accumulators/as_feature_tag_idp65421120.html | 54 - .../accumulators/as_feature_tag_idp65423232.html | 54 - .../accumulators/as_feature_tag_idp65572848.html | 54 - .../accumulators/as_feature_tag_idp65574928.html | 54 - .../accumulators/as_feature_tag_idp65660848.html | 54 - .../accumulators/as_feature_tag_idp65665392.html | 54 - .../accumulators/as_feature_tag_idp65706992.html | 54 - .../accumulators/as_feature_tag_idp65709088.html | 54 - .../accumulators/as_feature_tag_idp65768368.html | 54 - .../accumulators/as_feature_tag_idp65770480.html | 54 - .../accumulators/as_feature_tag_idp65772576.html | 54 - .../accumulators/as_feature_tag_idp65776304.html | 54 - .../accumulators/as_feature_tag_idp65787952.html | 54 - .../accumulators/as_feature_tag_idp65790064.html | 54 - .../accumulators/as_feature_tag_idp65792240.html | 54 - .../accumulators/as_feature_tag_idp65830272.html | 54 - .../accumulators/as_feature_tag_idp65833152.html | 54 - .../accumulators/as_feature_tag_idp65861648.html | 54 - .../accumulators/as_feature_tag_idp65889776.html | 54 - .../accumulators/as_feature_tag_idp65894352.html | 54 - .../accumulators/as_feature_tag_idp65910400.html | 54 - .../accumulators/as_feature_tag_idp65912496.html | 54 - .../accumulators/as_weigh_idm45507139493536.html | 54 + .../accumulators/as_weighted_fe_idp64782400.html | 54 - .../accumulators/as_weighted_fe_idp64882688.html | 54 - .../accumulators/as_weighted_fe_idp64917456.html | 54 - .../accumulators/as_weighted_fe_idp64935328.html | 54 - .../accumulators/as_weighted_fe_idp64949968.html | 54 - .../accumulators/as_weighted_fe_idp64972496.html | 54 - .../accumulators/as_weighted_fe_idp64974624.html | 54 - .../accumulators/as_weighted_fe_idp65006928.html | 54 - .../accumulators/as_weighted_fe_idp65040288.html | 54 - .../accumulators/as_weighted_fe_idp65042384.html | 54 - .../accumulators/as_weighted_fe_idp65046112.html | 54 - .../accumulators/as_weighted_fe_idp65048192.html | 54 - .../accumulators/as_weighted_fe_idp65087792.html | 54 - .../accumulators/as_weighted_fe_idp65089872.html | 54 - .../accumulators/as_weighted_fe_idp65091984.html | 54 - .../accumulators/as_weighted_fe_idp65121904.html | 54 - .../accumulators/as_weighted_fe_idp65132624.html | 54 - .../accumulators/as_weighted_fe_idp65144848.html | 54 - .../accumulators/as_weighted_fe_idp65163952.html | 54 - .../accumulators/as_weighted_fe_idp65166784.html | 54 - .../accumulators/as_weighted_fe_idp65294672.html | 54 - .../accumulators/as_weighted_fe_idp65297504.html | 54 - .../accumulators/as_weighted_fe_idp65324512.html | 54 - .../accumulators/as_weighted_fe_idp65327344.html | 54 - .../accumulators/as_weighted_fe_idp65539840.html | 54 - .../accumulators/as_weighted_fe_idp65553024.html | 54 - .../accumulators/as_weighted_fe_idp65577040.html | 54 - .../accumulators/as_weighted_fe_idp65613072.html | 54 - .../accumulators/as_weighted_fe_idp65631344.html | 54 - .../accumulators/as_weighted_fe_idp65669936.html | 54 - .../accumulators/as_weighted_fe_idp65674512.html | 54 - .../accumulators/as_weighted_fe_idp65711168.html | 54 - .../accumulators/as_weighted_fe_idp65713264.html | 54 - doc/html/boost/accumulators/covariate1.html | 50 - doc/html/boost/accumulators/covariate2.html | 50 - doc/html/boost/accumulators/dont_care.html | 8 +- .../boost/accumulators/droppable_accumulator.html | 12 +- .../accumulators/droppable_accumulator_base.html | 34 +- .../accumulators/extract/coherent_tail_mean.html | 50 - doc/html/boost/accumulators/extract/count.html | 50 - .../boost/accumulators/extract/covariance.html | 50 - doc/html/boost/accumulators/extract/density.html | 50 - .../extract/extended_p_squ_idp64985888.html | 50 - .../accumulators/extract/extended_p_square.html | 50 - .../extract/extended_p_square_quantile.html | 50 - .../extract/immediate_rolling_mean.html | 50 - .../extract/immediate_rolling_variance.html | 50 - doc/html/boost/accumulators/extract/kurtosis.html | 50 - .../accumulators/extract/lazy_rolling_mean.html | 50 - .../extract/lazy_rolling_variance.html | 50 - .../boost/accumulators/extract/lazy_variance.html | 50 - .../extract/lazy_weighted_variance.html | 50 - doc/html/boost/accumulators/extract/max.html | 50 - doc/html/boost/accumulators/extract/mean.html | 50 - .../accumulators/extract/mean_of_weights.html | 50 - doc/html/boost/accumulators/extract/median.html | 50 - doc/html/boost/accumulators/extract/min.html | 50 - .../extract/non_coherent_tail_mean.html | 50 - .../extract/non_coherent_w_idp65878400.html | 50 - .../extract/p_square_cumul_idp65137072.html | 50 - .../extract/p_square_quant_idp65150816.html | 50 - .../accumulators/extract/p_square_quantile.html | 50 - .../accumulators/extract/peaks_over_threshold.html | 50 - doc/html/boost/accumulators/extract/quantile.html | 50 - .../extract/relative_tail__idp65697392.html | 50 - .../extract/relative_weigh_idp65901120.html | 50 - .../boost/accumulators/extract/rolling_count.html | 50 - .../boost/accumulators/extract/rolling_mean.html | 50 - .../boost/accumulators/extract/rolling_sum.html | 50 - .../accumulators/extract/rolling_variance.html | 50 - .../boost/accumulators/extract/rolling_window.html | 50 - .../accumulators/extract/rolling_window_plus1.html | 50 - doc/html/boost/accumulators/extract/skewness.html | 50 - doc/html/boost/accumulators/extract/sum.html | 50 - doc/html/boost/accumulators/extract/sum_kahan.html | 50 - .../accumulators/extract/sum_of_variates.html | 50 - .../extract/sum_of_variates_kahan.html | 50 - .../boost/accumulators/extract/sum_of_weights.html | 50 - .../accumulators/extract/sum_of_weights_kahan.html | 50 - doc/html/boost/accumulators/extract/tail.html | 50 - doc/html/boost/accumulators/extract/tail_mean.html | 50 - .../boost/accumulators/extract/tail_quantile.html | 50 - .../boost/accumulators/extract/tail_variate.html | 50 - .../accumulators/extract/tail_variate_means.html | 50 - .../boost/accumulators/extract/tail_weights.html | 50 - doc/html/boost/accumulators/extract/variance.html | 50 - .../accumulators/extract/weighted_covariance.html | 50 - .../accumulators/extract/weighted_density.html | 50 - .../extract/weighted_exten_idp64987520.html | 50 - .../extract/weighted_exten_idp64989152.html | 50 - .../extract/weighted_extended_p_square.html | 50 - .../accumulators/extract/weighted_kurtosis.html | 50 - .../boost/accumulators/extract/weighted_mean.html | 50 - .../accumulators/extract/weighted_median.html | 50 - .../extract/weighted_p_squ_idp65808320.html | 50 - .../extract/weighted_p_squ_idp65819552.html | 50 - .../extract/weighted_p_square_quantile.html | 50 - .../extract/weighted_peaks_idp65836576.html | 50 - .../accumulators/extract/weighted_skewness.html | 50 - .../boost/accumulators/extract/weighted_sum.html | 50 - .../accumulators/extract/weighted_sum_kahan.html | 50 - .../extract/weighted_sum_o_idp65869056.html | 50 - .../extract/weighted_sum_of_variates.html | 50 - .../extract/weighted_tail__idp65899488.html | 50 - .../extract/weighted_tail_quantile.html | 50 - .../accumulators/extract/weighted_variance.html | 50 - .../accumulators/extract/with_density_median.html | 50 - .../extract/with_p_square__idp65106528.html | 50 - doc/html/boost/accumulators/extractor.html | 20 +- .../accumulators/feature__idm45507139452704.html | 54 + .../accumulators/feature__idm45507139467936.html | 54 + .../accumulators/feature__idm45507139479888.html | 52 + .../accumulators/feature__idm45507139490272.html | 52 + .../accumulators/feature_of_tag_idp64785664.html | 52 - .../accumulators/feature_of_tag_idp64796048.html | 52 - .../accumulators/feature_of_tag_idp64808000.html | 54 - .../accumulators/feature_of_tag_idp64823232.html | 54 - .../accumulators/feature_of_tag_idp64886384.html | 54 - .../accumulators/feature_of_tag_idp64889520.html | 53 - .../accumulators/feature_of_tag_idp64919536.html | 52 - .../accumulators/feature_of_tag_idp64952064.html | 54 - .../accumulators/feature_of_tag_idp64976768.html | 52 - .../accumulators/feature_of_tag_idp64978480.html | 52 - .../accumulators/feature_of_tag_idp64980208.html | 54 - .../accumulators/feature_of_tag_idp64981952.html | 53 - .../accumulators/feature_of_tag_idp65009008.html | 52 - .../accumulators/feature_of_tag_idp65051888.html | 52 - .../accumulators/feature_of_tag_idp65053584.html | 53 - .../accumulators/feature_of_tag_idp65056752.html | 54 - .../accumulators/feature_of_tag_idp65058464.html | 54 - .../accumulators/feature_of_tag_idp65060176.html | 53 - .../accumulators/feature_of_tag_idp65063360.html | 52 - .../accumulators/feature_of_tag_idp65065056.html | 53 - .../accumulators/feature_of_tag_idp65094144.html | 52 - .../accumulators/feature_of_tag_idp65095840.html | 52 - .../accumulators/feature_of_tag_idp65097552.html | 54 - .../accumulators/feature_of_tag_idp65099280.html | 52 - .../accumulators/feature_of_tag_idp65101008.html | 53 - .../accumulators/feature_of_tag_idp65124992.html | 54 - .../accumulators/feature_of_tag_idp65134752.html | 53 - .../accumulators/feature_of_tag_idp65146944.html | 54 - .../accumulators/feature_of_tag_idp65169632.html | 53 - .../accumulators/feature_of_tag_idp65171920.html | 53 - .../accumulators/feature_of_tag_idp65174224.html | 53 - .../accumulators/feature_of_tag_idp65176544.html | 53 - .../accumulators/feature_of_tag_idp65300336.html | 52 - .../accumulators/feature_of_tag_idp65302608.html | 52 - .../accumulators/feature_of_tag_idp65304880.html | 54 - .../accumulators/feature_of_tag_idp65307168.html | 53 - .../accumulators/feature_of_tag_idp65330176.html | 52 - .../accumulators/feature_of_tag_idp65332448.html | 52 - .../accumulators/feature_of_tag_idp65334720.html | 54 - .../accumulators/feature_of_tag_idp65337024.html | 53 - .../accumulators/feature_of_tag_idp65355568.html | 54 - .../accumulators/feature_of_tag_idp65357280.html | 54 - .../accumulators/feature_of_tag_idp65425344.html | 54 - .../accumulators/feature_of_tag_idp65427072.html | 54 - .../accumulators/feature_of_tag_idp65541920.html | 52 - .../accumulators/feature_of_tag_idp65555104.html | 54 - .../accumulators/feature_of_tag_idp65558240.html | 52 - .../accumulators/feature_of_tag_idp65579120.html | 52 - .../accumulators/feature_of_tag_idp65580816.html | 54 - .../accumulators/feature_of_tag_idp65583952.html | 54 - .../accumulators/feature_of_tag_idp65585664.html | 52 - .../accumulators/feature_of_tag_idp65599280.html | 54 - .../accumulators/feature_of_tag_idp65615920.html | 52 - .../accumulators/feature_of_tag_idp65618192.html | 53 - .../accumulators/feature_of_tag_idp65620496.html | 53 - .../accumulators/feature_of_tag_idp65634176.html | 52 - .../accumulators/feature_of_tag_idp65636448.html | 54 - .../accumulators/feature_of_tag_idp65644688.html | 54 - .../accumulators/feature_of_tag_idp65648672.html | 54 - .../accumulators/feature_of_tag_idp65679088.html | 53 - .../accumulators/feature_of_tag_idp65683104.html | 53 - .../accumulators/feature_of_tag_idp65687152.html | 53 - .../accumulators/feature_of_tag_idp65691168.html | 53 - .../accumulators/feature_of_tag_idp65715344.html | 52 - .../accumulators/feature_of_tag_idp65717040.html | 54 - .../accumulators/feature_of_tag_idp65718752.html | 52 - .../accumulators/feature_of_tag_idp65848960.html | 53 - .../accumulators/feature_of_tag_idp65863744.html | 53 - doc/html/boost/accumulators/for_median.html | 52 - doc/html/boost/accumulators/immediate.html | 52 - .../accumulators/impl/coherent_tail_mean_impl.html | 83 - doc/html/boost/accumulators/impl/count_impl.html | 79 - .../boost/accumulators/impl/covariance_impl.html | 83 - doc/html/boost/accumulators/impl/density_impl.html | 93 - .../accumulators/impl/error_of_mean_impl.html | 72 - .../impl/extended_p_squ_idp66039568.html | 75 - .../accumulators/impl/extended_p_square_impl.html | 83 - .../accumulators/impl/immediate_mean_impl.html | 76 - .../impl/immediate_roll_idp65365024.html | 79 - .../impl/immediate_roll_idp65434880.html | 131 - .../impl/immediate_weig_idp66062928.html | 76 - .../boost/accumulators/impl/kurtosis_impl.html | 79 - .../accumulators/impl/lazy_rolling_mean_impl.html | 75 - .../impl/lazy_rolling_variance_impl.html | 86 - .../accumulators/impl/lazy_variance_impl.html | 83 - .../impl/lazy_weighted__idp66114016.html | 78 - doc/html/boost/accumulators/impl/max_impl.html | 76 - doc/html/boost/accumulators/impl/mean_impl.html | 72 - doc/html/boost/accumulators/impl/median_impl.html | 73 - doc/html/boost/accumulators/impl/min_impl.html | 76 - doc/html/boost/accumulators/impl/moment_impl.html | 78 - .../impl/non_coherent_t_idp66180304.html | 86 - .../impl/non_coherent_w_idp66212144.html | 97 - .../impl/p_square_cumul_idp66248320.html | 82 - .../accumulators/impl/p_square_quantile_impl.html | 81 - .../impl/peaks_over_thr_idp66288512.html | 81 - .../impl/peaks_over_threshold_impl.html | 118 - .../boost/accumulators/impl/pot_quantile_impl.html | 78 - .../accumulators/impl/pot_tail_mean_impl.html | 78 - .../impl/reference_accumulator_impl.html | 26 +- .../accumulators/impl/rolling_count_impl.html | 72 - .../boost/accumulators/impl/rolling_mean_impl.html | 52 - .../accumulators/impl/rolling_moment_impl.html | 81 - .../boost/accumulators/impl/rolling_sum_impl.html | 76 - .../accumulators/impl/rolling_window_impl.html | 72 - .../impl/rolling_window_plus1_impl.html | 84 - .../boost/accumulators/impl/skewness_impl.html | 79 - doc/html/boost/accumulators/impl/sum_impl.html | 76 - .../boost/accumulators/impl/sum_kahan_impl.html | 78 - doc/html/boost/accumulators/impl/tail_impl.html | 90 - .../accumulators/impl/tail_quantile_impl.html | 80 - .../boost/accumulators/impl/tail_variate_impl.html | 84 - .../accumulators/impl/tail_variate_means_impl.html | 94 - .../accumulators/impl/value_accumulator_impl.html | 26 +- .../boost/accumulators/impl/variance_impl.html | 99 - .../impl/weighted_covariance_impl.html | 84 - .../accumulators/impl/weighted_density_impl.html | 79 - .../impl/weighted_exten_idp66592512.html | 83 - .../accumulators/impl/weighted_kurtosis_impl.html | 80 - .../accumulators/impl/weighted_mean_impl.html | 72 - .../accumulators/impl/weighted_median_impl.html | 73 - .../accumulators/impl/weighted_moment_impl.html | 78 - .../impl/weighted_p_squ_idp66685360.html | 86 - .../impl/weighted_p_squ_idp66702800.html | 81 - .../impl/weighted_peaks_idp66732176.html | 81 - .../impl/weighted_peaks_idp66744912.html | 83 - .../accumulators/impl/weighted_skewness_impl.html | 80 - .../boost/accumulators/impl/weighted_sum_impl.html | 76 - .../accumulators/impl/weighted_sum_kahan_impl.html | 76 - .../impl/weighted_tail__idp66800032.html | 87 - .../impl/weighted_tail__idp66832368.html | 106 - .../accumulators/impl/weighted_variance_impl.html | 82 - .../impl/with_density_median_impl.html | 77 - .../impl/with_density_w_idp66912192.html | 77 - .../impl/with_p_square__idp66926624.html | 79 - .../impl/with_p_square__idp66937776.html | 79 - doc/html/boost/accumulators/kahan.html | 52 - doc/html/boost/accumulators/lazy.html | 52 - doc/html/boost/accumulators/left.html | 52 - doc/html/boost/accumulators/linear.html | 52 - doc/html/boost/accumulators/quadratic.html | 52 - doc/html/boost/accumulators/regular.html | 52 - doc/html/boost/accumulators/relative.html | 52 - doc/html/boost/accumulators/right.html | 52 - doc/html/boost/accumulators/stats.html | 52 - .../tag/absolute_tail__idp66950400.html | 53 - .../tag/absolute_weigh_idp66953456.html | 53 - .../tag/abstract_absol_idp65700464.html | 54 - .../accumulators/tag/abstract_covariance.html | 52 - .../tag/abstract_non_c_idp65628000.html | 54 - .../tag/abstract_peaks_idp65279920.html | 54 - .../tag/abstract_relat_idp65701456.html | 54 - .../accumulators/tag/abstract_sum_of_variates.html | 52 - doc/html/boost/accumulators/tag/abstract_tail.html | 52 - .../accumulators/tag/abstract_tail_variate.html | 52 - .../accumulators/tag/abstract_tail_weights.html | 52 - .../tag/abstract_weigh_idp65857328.html | 54 - .../tag/as_dropp_idm45507139485056.html | 54 + doc/html/boost/accumulators/tag/as_droppable.html | 6 +- .../tag/as_droppable_d_idp64790880.html | 54 - .../boost/accumulators/tag/coherent_tail_mean.html | 53 - doc/html/boost/accumulators/tag/count.html | 52 - doc/html/boost/accumulators/tag/covariance.html | 53 - doc/html/boost/accumulators/tag/covariate1.html | 52 - doc/html/boost/accumulators/tag/covariate2.html | 52 - doc/html/boost/accumulators/tag/density.html | 72 - doc/html/boost/accumulators/tag/error_of.html | 52 - .../tag/error_of_immed_idp64944224.html | 52 - .../tag/error_of_mean_idp64945920.html | 54 - .../tag/extended_p_squ_idp64995312.html | 56 - .../boost/accumulators/tag/extended_p_square.html | 59 - .../tag/extended_p_square_quantile.html | 56 - .../tag/external_Featu_idp64801280.html | 54 - .../tag/external_idm45507139474656.html | 54 + .../boost/accumulators/tag/immediate_mean.html | 52 - .../tag/immediate_mean_of_variates.html | 54 - .../tag/immediate_mean_of_weights.html | 56 - .../accumulators/tag/immediate_rolling_mean.html | 56 - .../tag/immediate_rolling_variance.html | 56 - .../tag/immediate_weig_idp66965120.html | 54 - .../accumulators/tag/immediate_weighted_mean.html | 54 - doc/html/boost/accumulators/tag/kurtosis.html | 53 - .../boost/accumulators/tag/lazy_rolling_mean.html | 57 - .../accumulators/tag/lazy_rolling_variance.html | 56 - doc/html/boost/accumulators/tag/lazy_variance.html | 54 - .../accumulators/tag/lazy_weighted_variance.html | 53 - .../boost/accumulators/tag/left_tail_variate.html | 52 - doc/html/boost/accumulators/tag/max.html | 52 - doc/html/boost/accumulators/tag/mean.html | 52 - .../boost/accumulators/tag/mean_of_variates.html | 53 - .../boost/accumulators/tag/mean_of_weights.html | 56 - doc/html/boost/accumulators/tag/median.html | 54 - doc/html/boost/accumulators/tag/min.html | 52 - doc/html/boost/accumulators/tag/moment.html | 52 - .../accumulators/tag/non_coherent_tail_mean.html | 54 - .../tag/non_coherent_w_idp66976320.html | 53 - .../tag/p_square_cumul_idp65140128.html | 54 - .../tag/p_square_quant_idp65154864.html | 54 - .../boost/accumulators/tag/p_square_quantile.html | 52 - .../accumulators/tag/peaks_over_threshold.html | 54 - .../tag/peaks_over_threshold_prob.html | 54 - doc/html/boost/accumulators/tag/pot_quantile.html | 54 - .../boost/accumulators/tag/pot_quantile_prob.html | 53 - doc/html/boost/accumulators/tag/pot_tail_mean.html | 53 - .../boost/accumulators/tag/pot_tail_mean_prob.html | 53 - doc/html/boost/accumulators/tag/quantile.html | 54 - .../tag/relative_tail__idp66992464.html | 53 - .../tag/relative_weigh_idp66995520.html | 53 - .../boost/accumulators/tag/right_tail_variate.html | 52 - doc/html/boost/accumulators/tag/rolling_count.html | 57 - doc/html/boost/accumulators/tag/rolling_mean.html | 52 - .../boost/accumulators/tag/rolling_moment.html | 56 - doc/html/boost/accumulators/tag/rolling_sum.html | 57 - .../boost/accumulators/tag/rolling_variance.html | 54 - .../boost/accumulators/tag/rolling_window.html | 57 - .../accumulators/tag/rolling_window_plus1.html | 57 - doc/html/boost/accumulators/tag/skewness.html | 54 - doc/html/boost/accumulators/tag/sum.html | 52 - doc/html/boost/accumulators/tag/sum_kahan.html | 52 - .../boost/accumulators/tag/sum_of_variates.html | 52 - .../accumulators/tag/sum_of_variates_kahan.html | 52 - .../boost/accumulators/tag/sum_of_weights.html | 54 - .../accumulators/tag/sum_of_weights_kahan.html | 54 - doc/html/boost/accumulators/tag/tail.html | 54 - doc/html/boost/accumulators/tag/tail_mean.html | 54 - doc/html/boost/accumulators/tag/tail_quantile.html | 54 - doc/html/boost/accumulators/tag/tail_variate.html | 54 - .../boost/accumulators/tag/tail_variate_means.html | 52 - doc/html/boost/accumulators/tag/tail_weights.html | 54 - doc/html/boost/accumulators/tag/variance.html | 54 - .../accumulators/tag/weighted_covariance.html | 53 - .../boost/accumulators/tag/weighted_density.html | 59 - .../tag/weighted_exten_idp64998384.html | 56 - .../tag/weighted_exten_idp65001472.html | 56 - .../tag/weighted_extended_p_square.html | 56 - .../boost/accumulators/tag/weighted_kurtosis.html | 53 - doc/html/boost/accumulators/tag/weighted_mean.html | 54 - .../tag/weighted_mean_of_variates.html | 53 - .../boost/accumulators/tag/weighted_median.html | 53 - .../boost/accumulators/tag/weighted_moment.html | 54 - .../tag/weighted_p_squ_idp65811408.html | 56 - .../tag/weighted_p_squ_idp65825264.html | 56 - .../tag/weighted_p_square_quantile.html | 56 - .../tag/weighted_peaks_idp67026176.html | 54 - .../tag/weighted_peaks_idp67028592.html | 54 - .../accumulators/tag/weighted_pot_quantile.html | 53 - .../tag/weighted_pot_quantile_prob.html | 53 - .../tag/weighted_pot_t_idp67036720.html | 53 - .../accumulators/tag/weighted_pot_tail_mean.html | 53 - .../boost/accumulators/tag/weighted_skewness.html | 53 - doc/html/boost/accumulators/tag/weighted_sum.html | 52 - .../boost/accumulators/tag/weighted_sum_kahan.html | 52 - .../tag/weighted_sum_o_idp65873088.html | 54 - .../accumulators/tag/weighted_sum_of_variates.html | 52 - .../tag/weighted_tail__idp67042928.html | 52 - .../accumulators/tag/weighted_tail_quantile.html | 53 - .../boost/accumulators/tag/weighted_variance.html | 54 - .../accumulators/tag/with_density_median.html | 54 - .../tag/with_density_w_idp65798960.html | 54 - .../tag/with_p_square__idp65111616.html | 54 - .../tag/with_p_square__idp65799984.html | 53 - .../accumulators/tail_cache_siz_idp65602800.html | 52 - .../accumulators/tail_cache_siz_idp65604480.html | 52 - .../accumulators/tail_cache_size_named_arg.html | 52 - doc/html/boost/accumulators/unweighted.html | 52 - doc/html/boost/accumulators/weighted.html | 52 - doc/html/boost/accumulators/weights.html | 6 +- .../boost/accumulators/with_cached_result.html | 52 +- doc/html/boost/accumulators/with_density.html | 52 - doc/html/boost/accumulators/with_error.html | 52 - .../accumulators/with_p_square__idp65938128.html | 52 - .../boost/accumulators/with_p_square_quantile.html | 52 - .../accumulators/with_threshold_probability.html | 52 - .../boost/accumulators/with_threshold_value.html | 52 - doc/html/boost/adl_move_swap.html | 8 +- doc/html/boost/algorithm/FinderConcept.html | 12 +- doc/html/boost/algorithm/FormatterConcept.html | 12 +- doc/html/boost/algorithm/all.html | 2 +- doc/html/boost/algorithm/const_formatter.html | 2 +- doc/html/boost/algorithm/contains.html | 2 +- doc/html/boost/algorithm/dissect_formatter.html | 2 +- doc/html/boost/algorithm/empty_formatter.html | 2 +- doc/html/boost/algorithm/ends_with.html | 2 +- doc/html/boost/algorithm/equals.html | 2 +- doc/html/boost/algorithm/erase_all.html | 2 +- doc/html/boost/algorithm/erase_all_copy.html | 2 +- doc/html/boost/algorithm/erase_all_regex.html | 2 +- doc/html/boost/algorithm/erase_all_regex_copy.html | 2 +- doc/html/boost/algorithm/erase_first.html | 2 +- doc/html/boost/algorithm/erase_first_copy.html | 2 +- doc/html/boost/algorithm/erase_head.html | 2 +- doc/html/boost/algorithm/erase_head_copy.html | 2 +- doc/html/boost/algorithm/erase_last.html | 2 +- doc/html/boost/algorithm/erase_last_copy.html | 2 +- doc/html/boost/algorithm/erase_nth.html | 2 +- doc/html/boost/algorithm/erase_nth_copy.html | 2 +- doc/html/boost/algorithm/erase_range.html | 2 +- doc/html/boost/algorithm/erase_range_copy.html | 2 +- doc/html/boost/algorithm/erase_regex.html | 2 +- doc/html/boost/algorithm/erase_regex_copy.html | 2 +- doc/html/boost/algorithm/erase_tail.html | 2 +- doc/html/boost/algorithm/erase_tail_copy.html | 2 +- doc/html/boost/algorithm/find.html | 2 +- doc/html/boost/algorithm/find_all.html | 2 +- doc/html/boost/algorithm/find_all_regex.html | 2 +- doc/html/boost/algorithm/find_first.html | 2 +- doc/html/boost/algorithm/find_format.html | 2 +- doc/html/boost/algorithm/find_format_all.html | 2 +- doc/html/boost/algorithm/find_format_all_copy.html | 2 +- doc/html/boost/algorithm/find_format_copy.html | 2 +- doc/html/boost/algorithm/find_head.html | 2 +- doc/html/boost/algorithm/find_iterator.html | 48 +- doc/html/boost/algorithm/find_last.html | 2 +- doc/html/boost/algorithm/find_nth.html | 2 +- doc/html/boost/algorithm/find_regex.html | 2 +- doc/html/boost/algorithm/find_tail.html | 2 +- doc/html/boost/algorithm/find_token.html | 2 +- doc/html/boost/algorithm/first_finder.html | 2 +- doc/html/boost/algorithm/has_const_time_erase.html | 2 +- .../boost/algorithm/has_const_time_insert.html | 2 +- doc/html/boost/algorithm/has_native_replace.html | 2 +- doc/html/boost/algorithm/has_stable_iterators.html | 2 +- doc/html/boost/algorithm/head_finder.html | 2 +- doc/html/boost/algorithm/icontains.html | 2 +- doc/html/boost/algorithm/identity_formatter.html | 2 +- doc/html/boost/algorithm/iends_with.html | 2 +- doc/html/boost/algorithm/iequals.html | 2 +- doc/html/boost/algorithm/ierase_all.html | 2 +- doc/html/boost/algorithm/ierase_all_copy.html | 2 +- doc/html/boost/algorithm/ierase_first.html | 2 +- doc/html/boost/algorithm/ierase_first_copy.html | 2 +- doc/html/boost/algorithm/ierase_last.html | 2 +- doc/html/boost/algorithm/ierase_last_copy.html | 2 +- doc/html/boost/algorithm/ierase_nth.html | 2 +- doc/html/boost/algorithm/ierase_nth_copy.html | 2 +- doc/html/boost/algorithm/ifind_all.html | 8 +- doc/html/boost/algorithm/ifind_first.html | 2 +- doc/html/boost/algorithm/ifind_last.html | 2 +- doc/html/boost/algorithm/ifind_nth.html | 2 +- .../boost/algorithm/ilexicographical_compare.html | 2 +- doc/html/boost/algorithm/ireplace_all.html | 2 +- doc/html/boost/algorithm/ireplace_all_copy.html | 2 +- doc/html/boost/algorithm/ireplace_first.html | 2 +- doc/html/boost/algorithm/ireplace_first_copy.html | 2 +- doc/html/boost/algorithm/ireplace_last.html | 2 +- doc/html/boost/algorithm/ireplace_last_copy.html | 2 +- doc/html/boost/algorithm/ireplace_nth.html | 2 +- doc/html/boost/algorithm/ireplace_nth_copy.html | 2 +- doc/html/boost/algorithm/is_alnum.html | 2 +- doc/html/boost/algorithm/is_alpha.html | 2 +- doc/html/boost/algorithm/is_any_of.html | 2 +- doc/html/boost/algorithm/is_classified.html | 2 +- doc/html/boost/algorithm/is_cntrl.html | 2 +- doc/html/boost/algorithm/is_digit.html | 2 +- doc/html/boost/algorithm/is_equal.html | 18 +- doc/html/boost/algorithm/is_from_range.html | 8 +- doc/html/boost/algorithm/is_graph.html | 2 +- doc/html/boost/algorithm/is_iequal.html | 18 +- doc/html/boost/algorithm/is_iless.html | 18 +- doc/html/boost/algorithm/is_less.html | 12 +- doc/html/boost/algorithm/is_lower.html | 2 +- doc/html/boost/algorithm/is_not_greater.html | 12 +- doc/html/boost/algorithm/is_not_igreater.html | 18 +- doc/html/boost/algorithm/is_print.html | 2 +- doc/html/boost/algorithm/is_punct.html | 2 +- doc/html/boost/algorithm/is_space.html | 2 +- doc/html/boost/algorithm/is_upper.html | 2 +- doc/html/boost/algorithm/is_xdigit.html | 2 +- doc/html/boost/algorithm/istarts_with.html | 2 +- doc/html/boost/algorithm/iter_find.html | 2 +- doc/html/boost/algorithm/iter_split.html | 2 +- doc/html/boost/algorithm/join.html | 8 +- .../boost/algorithm/join_if_idm45506997401056.html | 112 + .../boost/algorithm/join_if_idm45507095260992.html | 105 + doc/html/boost/algorithm/join_if_idp102602880.html | 105 - doc/html/boost/algorithm/join_if_idp214569568.html | 112 - doc/html/boost/algorithm/last_finder.html | 2 +- .../boost/algorithm/lexicographical_compare.html | 2 +- doc/html/boost/algorithm/make_find_iterator.html | 2 +- doc/html/boost/algorithm/make_split_iterator.html | 2 +- doc/html/boost/algorithm/nth_finder.html | 2 +- .../boost/algorithm/operator___idp97198576.html | 91 - .../boost/algorithm/operator__idp99169024.html | 84 - .../algorithm/operator_idm45506971184944.html | 91 + .../algorithm/operator_idm45507049375408.html | 91 + .../algorithm/operator_idm45507108212576.html | 84 + .../boost/algorithm/operator_idp162356144.html | 91 - doc/html/boost/algorithm/range_finder.html | 2 +- doc/html/boost/algorithm/regex_finder.html | 8 +- doc/html/boost/algorithm/regex_formatter.html | 2 +- doc/html/boost/algorithm/replace_all.html | 2 +- doc/html/boost/algorithm/replace_all_copy.html | 2 +- doc/html/boost/algorithm/replace_all_regex.html | 2 +- .../boost/algorithm/replace_all_regex_copy.html | 2 +- doc/html/boost/algorithm/replace_first.html | 2 +- doc/html/boost/algorithm/replace_first_copy.html | 2 +- doc/html/boost/algorithm/replace_head.html | 2 +- doc/html/boost/algorithm/replace_head_copy.html | 2 +- doc/html/boost/algorithm/replace_last.html | 2 +- doc/html/boost/algorithm/replace_last_copy.html | 2 +- doc/html/boost/algorithm/replace_nth.html | 2 +- doc/html/boost/algorithm/replace_nth_copy.html | 2 +- doc/html/boost/algorithm/replace_range.html | 2 +- doc/html/boost/algorithm/replace_range_copy.html | 2 +- doc/html/boost/algorithm/replace_regex.html | 2 +- doc/html/boost/algorithm/replace_regex_copy.html | 2 +- doc/html/boost/algorithm/replace_tail.html | 2 +- doc/html/boost/algorithm/replace_tail_copy.html | 2 +- .../boost/algorithm/split_idm45506997439552.html | 119 + doc/html/boost/algorithm/split_idp159921872.html | 119 - doc/html/boost/algorithm/split_iterator.html | 48 +- doc/html/boost/algorithm/split_regex.html | 8 +- doc/html/boost/algorithm/starts_with.html | 8 +- doc/html/boost/algorithm/tail_finder.html | 2 +- doc/html/boost/algorithm/to_lower.html | 2 +- doc/html/boost/algorithm/to_lower_copy.html | 2 +- doc/html/boost/algorithm/to_upper.html | 2 +- doc/html/boost/algorithm/to_upper_copy.html | 2 +- .../boost/algorithm/token_compress_mode_type.html | 2 +- doc/html/boost/algorithm/token_finder.html | 2 +- doc/html/boost/algorithm/trim.html | 2 +- doc/html/boost/algorithm/trim_all.html | 2 +- doc/html/boost/algorithm/trim_all_copy.html | 2 +- doc/html/boost/algorithm/trim_all_copy_if.html | 2 +- doc/html/boost/algorithm/trim_all_if.html | 2 +- doc/html/boost/algorithm/trim_copy.html | 2 +- doc/html/boost/algorithm/trim_copy_if.html | 2 +- doc/html/boost/algorithm/trim_fill.html | 2 +- doc/html/boost/algorithm/trim_fill_copy.html | 2 +- doc/html/boost/algorithm/trim_fill_copy_if.html | 2 +- doc/html/boost/algorithm/trim_fill_if.html | 2 +- doc/html/boost/algorithm/trim_if.html | 2 +- doc/html/boost/algorithm/trim_left.html | 2 +- doc/html/boost/algorithm/trim_left_copy.html | 2 +- doc/html/boost/algorithm/trim_left_copy_if.html | 8 +- doc/html/boost/algorithm/trim_left_if.html | 2 +- doc/html/boost/algorithm/trim_right.html | 2 +- doc/html/boost/algorithm/trim_right_copy.html | 2 +- doc/html/boost/algorithm/trim_right_copy_if.html | 2 +- doc/html/boost/algorithm/trim_right_if.html | 2 +- doc/html/boost/any.html | 84 +- doc/html/boost/any_cast_idm45507162615824.html | 86 + doc/html/boost/any_cast_idp45214624.html | 86 - doc/html/boost/apply_vi_idm45507085892176.html | 104 + doc/html/boost/apply_vi_idm45507092235520.html | 73 + doc/html/boost/apply_visitor.html | 12 +- doc/html/boost/apply_visitor_delayed_t.html | 34 +- doc/html/boost/apply_visitor_idp313712304.html | 104 - doc/html/boost/apply_visitor_idp353473104.html | 73 - doc/html/boost/array.html | 182 +- doc/html/boost/back_move_insert_iterator.html | 34 +- doc/html/boost/back_move_inserter.html | 2 +- doc/html/boost/bad_any_cast.html | 8 +- doc/html/boost/bad_function_call.html | 8 +- doc/html/boost/bad_get.html | 14 +- doc/html/boost/bad_polymorphic_get.html | 12 +- doc/html/boost/bad_visit.html | 6 +- doc/html/boost/circular_buffe_idp24914528.html | 2828 -------------------- doc/html/boost/circular_buffer.html | 578 ++-- doc/html/boost/circular_idm45713141954256.html | 2828 ++++++++++++++++++++ doc/html/boost/container/adaptive_pool.html | 120 +- doc/html/boost/container/adaptive_pool/rebind.html | 10 +- doc/html/boost/container/allocator.html | 106 +- doc/html/boost/container/allocator/rebind.html | 10 +- doc/html/boost/container/allocator_arg.html | 14 +- doc/html/boost/container/allocator_arg_t.html | 16 +- doc/html/boost/container/allocator_traits.html | 60 +- .../allocator_traits/portable_rebind_alloc.html | 10 +- doc/html/boost/container/basic_string.html | 592 ++-- .../container/construc_idm46583867843104.html | 66 + .../container/construc_idm46583867853472.html | 68 + .../container/constructible__idp59903648.html | 68 - .../container/constructible__idp59914016.html | 66 - doc/html/boost/container/default_init.html | 4 +- doc/html/boost/container/default_init_t.html | 4 +- doc/html/boost/container/deque.html | 342 +-- doc/html/boost/container/erased_type.html | 56 + doc/html/boost/container/flat_map.html | 360 +-- doc/html/boost/container/flat_multimap.html | 330 +-- doc/html/boost/container/flat_multiset.html | 335 +-- doc/html/boost/container/flat_set.html | 322 +-- doc/html/boost/container/list.html | 373 +-- doc/html/boost/container/map.html | 326 +-- doc/html/boost/container/multimap.html | 306 +-- doc/html/boost/container/multiset.html | 307 ++- .../container/new_allo_idm46583871819392.html | 117 + .../new_allo_idm46583871819392/rebind.html | 59 + doc/html/boost/container/new_allocator.html | 66 +- doc/html/boost/container/new_allocator/rebind.html | 12 +- .../container/new_allocator__idp59775248.html | 117 - .../new_allocator__idp59775248/rebind.html | 59 - doc/html/boost/container/new_allocator_bool.html | 55 - doc/html/boost/container/node_allocator.html | 120 +- .../boost/container/node_allocator/rebind.html | 10 +- .../boost/container/operator___idp62323648.html | 93 - .../boost/container/operator___idp62333664.html | 93 - .../boost/container/operator___idp62363664.html | 93 - .../boost/container/operator___idp62373648.html | 93 - .../container/operator_idm46583868786816.html | 93 + .../container/operator_idm46583868796800.html | 93 + .../container/operator_idm46583868806784.html | 93 + .../container/operator_idm46583868816768.html | 93 + .../container/operator_idm46583868826800.html | 93 + .../container/operator_idm46583868836816.html | 93 + doc/html/boost/container/operator_idp62343696.html | 93 - doc/html/boost/container/operator_idp62353680.html | 93 - doc/html/boost/container/optimize_size.html | 4 +- doc/html/boost/container/ordered_range.html | 4 +- doc/html/boost/container/ordered_range_t.html | 4 +- doc/html/boost/container/ordered_unique_range.html | 4 +- .../boost/container/ordered_unique_range_t.html | 4 +- doc/html/boost/container/pmr/basic_string_of.html | 54 + doc/html/boost/container/pmr/deque_of.html | 54 + doc/html/boost/container/pmr/flat_map_of.html | 55 + doc/html/boost/container/pmr/flat_multimap_of.html | 55 + doc/html/boost/container/pmr/flat_multiset_of.html | 55 + doc/html/boost/container/pmr/flat_set_of.html | 55 + .../boost/container/pmr/get_default_resource.html | 55 + doc/html/boost/container/pmr/list_of.html | 54 + doc/html/boost/container/pmr/map_of.html | 55 + doc/html/boost/container/pmr/memory_resource.html | 142 + .../container/pmr/monotonic_buffer_resource.html | 193 ++ doc/html/boost/container/pmr/multimap_of.html | 55 + doc/html/boost/container/pmr/multiset_of.html | 55 + .../boost/container/pmr/new_delete_resource.html | 55 + .../boost/container/pmr/null_memory_resource.html | 55 + .../container/pmr/operator_idm46583871486800.html | 57 + .../container/pmr/operator_idm46583871492768.html | 57 + .../boost/container/pmr/polymorphic_allocator.html | 141 + doc/html/boost/container/pmr/pool_options.html | 75 + doc/html/boost/container/pmr/resource_adaptor.html | 55 + .../boost/container/pmr/resource_adaptor_imp.html | 153 ++ .../boost/container/pmr/set_default_resource.html | 58 + doc/html/boost/container/pmr/set_of.html | 55 + doc/html/boost/container/pmr/slist_of.html | 54 + doc/html/boost/container/pmr/small_vector_of.html | 54 + doc/html/boost/container/pmr/stable_vector_of.html | 54 + .../container/pmr/synchronized_pool_resource.html | 194 ++ .../container/pmr/unsynchr_idm46583871327984.html | 194 ++ doc/html/boost/container/pmr/vector_of.html | 54 + .../container/scoped_allocat_idp60083856.html | 71 - .../container/scoped_allocat_idp60096720.html | 67 - .../boost/container/scoped_allocator_adaptor.html | 174 +- .../container/scoped_allocator_adaptor/rebind.html | 12 +- doc/html/boost/container/set.html | 306 +-- doc/html/boost/container/slist.html | 400 +-- doc/html/boost/container/small_vector.html | 68 +- .../boost/container/small_vector_allocator.html | 96 +- .../container/small_vector_allocator/rebind.html | 10 +- doc/html/boost/container/small_vector_base.html | 44 +- doc/html/boost/container/stable_vector.html | 336 +-- doc/html/boost/container/static_vector.html | 343 +-- doc/html/boost/container/string.html | 4 +- .../boost/container/swap_idm46583868776832.html | 86 + doc/html/boost/container/swap_idp62383632.html | 86 - doc/html/boost/container/throw_bad_alloc.html | 10 +- doc/html/boost/container/throw_length_error.html | 4 +- doc/html/boost/container/throw_logic_error.html | 4 +- doc/html/boost/container/throw_out_of_range.html | 4 +- doc/html/boost/container/throw_runtime_error.html | 10 +- doc/html/boost/container/tree_assoc_defaults.html | 4 +- doc/html/boost/container/tree_assoc_options.html | 4 +- doc/html/boost/container/tree_type.html | 10 +- doc/html/boost/container/tree_type_enum.html | 4 +- doc/html/boost/container/uses_allocator.html | 20 +- doc/html/boost/container/vector.html | 362 +-- doc/html/boost/container/wstring.html | 10 +- doc/html/boost/copy_or_move.html | 8 +- doc/html/boost/date_time/acst_dst_trait.html | 44 +- doc/html/boost/date_time/all_date_names_put.html | 76 +- doc/html/boost/date_time/bad_field_count.html | 8 +- doc/html/boost/date_time/base_time.html | 108 +- doc/html/boost/date_time/c_local_adjustor.html | 12 +- doc/html/boost/date_time/c_time.html | 24 +- doc/html/boost/date_time/convert_string_type.html | 2 +- doc/html/boost/date_time/convert_to_lower.html | 2 +- doc/html/boost/date_time/counted_time_rep.html | 74 +- doc/html/boost/date_time/counted_time_system.html | 60 +- doc/html/boost/date_time/data_not_accessible.html | 12 +- doc/html/boost/date_time/date.html | 102 +- doc/html/boost/date_time/date_duration.html | 72 +- doc/html/boost/date_time/date_facet.html | 142 +- doc/html/boost/date_time/date_formatter.html | 22 +- .../boost/date_time/date_generator_formatter.html | 56 +- .../boost/date_time/date_generator_parser.html | 60 +- doc/html/boost/date_time/date_input_facet.html | 130 +- doc/html/boost/date_time/date_itr.html | 22 +- doc/html/boost/date_time/date_itr_base.html | 66 +- doc/html/boost/date_time/date_names_put.html | 120 +- doc/html/boost/date_time/day_calc_dst_rule.html | 30 +- doc/html/boost/date_time/day_clock.html | 38 +- doc/html/boost/date_time/day_functor.html | 22 +- doc/html/boost/date_time/days_before_weekday.html | 2 +- doc/html/boost/date_time/days_until_weekday.html | 2 +- .../boost/date_time/dst_adjustment_offsets.html | 8 +- doc/html/boost/date_time/dst_calc_engine.html | 34 +- doc/html/boost/date_time/dst_calculator.html | 24 +- doc/html/boost/date_time/dst_day_calc_rule.html | 30 +- .../boost/date_time/duration_traits_adapted.html | 12 +- doc/html/boost/date_time/duration_traits_long.html | 12 +- .../date_time/dynamic__idm45507110490096.html | 76 + .../date_time/dynamic_local_idp103052208.html | 76 - doc/html/boost/date_time/eu_dst_trait.html | 44 +- doc/html/boost/date_time/find_match.html | 2 +- doc/html/boost/date_time/first_kday_after.html | 22 +- doc/html/boost/date_time/first_kday_before.html | 22 +- doc/html/boost/date_time/first_kday_of_month.html | 30 +- .../date_time/fixed_st_idm45507094246048.html | 57 + .../date_time/fixed_st_idm45507095938400.html | 57 + .../date_time/fixed_string__idp103198160.html | 57 - .../date_time/fixed_string_t_idp96468336.html | 57 - doc/html/boost/date_time/format_date_parser.html | 96 +- .../date_time/from_str_idm45507086264992.html | 55 + .../date_time/from_str_idm45507108860000.html | 55 + .../date_time/from_str_idm45507110254160.html | 55 + .../date_time/from_str_idm45507131471248.html | 55 + .../date_time/from_stream_t_idp102084000.html | 55 - .../date_time/from_stream_t_idp103304976.html | 55 - .../date_time/from_stream_ty_idp73045008.html | 55 - .../date_time/from_stream_ty_idp94879648.html | 55 - doc/html/boost/date_time/gather_month_strings.html | 2 +- .../boost/date_time/gather_weekday_strings.html | 2 +- .../boost/date_time/gregorian_calendar_base.html | 56 +- doc/html/boost/date_time/int_adapter.html | 192 +- doc/html/boost/date_time/iso_extended_format.html | 18 +- .../date_time/iso_form_idm45507101202000.html | 118 + doc/html/boost/date_time/iso_format.html | 12 +- .../date_time/iso_format_ba_idp104759696.html | 118 - doc/html/boost/date_time/iso_format_base.html | 98 +- doc/html/boost/date_time/last_kday_of_month.html | 30 +- doc/html/boost/date_time/local_adjustor.html | 22 +- doc/html/boost/date_time/microsec_clock.html | 30 +- doc/html/boost/date_time/month_formatter.html | 16 +- doc/html/boost/date_time/month_functor.html | 22 +- doc/html/boost/date_time/months_duration.html | 86 +- doc/html/boost/date_time/next_weekday.html | 2 +- doc/html/boost/date_time/nth_kday_of_month.html | 38 +- doc/html/boost/date_time/null_dst_rules.html | 24 +- .../date_time/operator_idm45507093183424.html | 57 + .../boost/date_time/operator_idp102086480.html | 57 - .../date_time/ostream__idm45507093288816.html | 66 + .../date_time/ostream__idm45507132748752.html | 67 + .../boost/date_time/ostream_date_formatter.html | 16 +- .../boost/date_time/ostream_month_formatter.html | 12 +- .../date_time/ostream_time_d_idp75152960.html | 66 - .../boost/date_time/ostream_time_formatter.html | 22 +- .../date_time/ostream_time_p_idp94853696.html | 67 - .../boost/date_time/ostream_weekday_formatter.html | 12 +- .../boost/date_time/ostream_ymd_formatter.html | 12 +- doc/html/boost/date_time/parse_date.html | 8 +- .../date_time/parse_de_idm45507103907392.html | 55 + .../date_time/parse_delimit_idp112715600.html | 55 - doc/html/boost/date_time/parse_match_result.html | 26 +- doc/html/boost/date_time/partial_date.html | 46 +- doc/html/boost/date_time/period.html | 90 +- doc/html/boost/date_time/period_formatter.html | 42 +- doc/html/boost/date_time/period_parser.html | 48 +- doc/html/boost/date_time/previous_weekday.html | 2 +- doc/html/boost/date_time/second_clock.html | 30 +- .../date_time/simple_f_idm45507093224352.html | 97 + doc/html/boost/date_time/simple_format.html | 66 +- .../date_time/simple_format__idp39965872.html | 97 - .../boost/date_time/special_values_formatter.html | 26 +- .../boost/date_time/special_values_parser.html | 34 +- .../boost/date_time/split_timedate_system.html | 66 +- .../date_time/static_local_time_adjustor.html | 16 +- .../date_time/str_from_delim_idp99809040.html | 56 - .../date_time/str_from_idm45507164216160.html | 56 + doc/html/boost/date_time/string_parse_tree.html | 42 +- doc/html/boost/date_time/subsecond_duration.html | 22 +- doc/html/boost/date_time/time_duration.html | 162 +- doc/html/boost/date_time/time_facet.html | 70 +- doc/html/boost/date_time/time_from_ftime.html | 2 +- doc/html/boost/date_time/time_input_facet.html | 84 +- doc/html/boost/date_time/time_itr.html | 62 +- .../date_time/time_res_idm45507110033680.html | 69 + .../date_time/time_res_idm45507130513984.html | 69 + .../date_time/time_res_idm45507155150400.html | 69 + .../date_time/time_res_idm45507162469520.html | 69 + .../date_time/time_resoluti_idp110216112.html | 69 - .../date_time/time_resoluti_idp112449952.html | 69 - .../date_time/time_resolutio_idp37920384.html | 69 - .../date_time/time_resolutio_idp95321136.html | 69 - .../boost/date_time/time_resolution_traits.html | 54 +- doc/html/boost/date_time/time_zone_base.html | 58 +- doc/html/boost/date_time/time_zone_names_base.html | 34 +- doc/html/boost/date_time/tz_db_base.html | 56 +- doc/html/boost/date_time/uk_dst_trait.html | 20 +- doc/html/boost/date_time/us_dst_rules.html | 28 +- doc/html/boost/date_time/us_dst_trait.html | 44 +- doc/html/boost/date_time/utc_adjustment.html | 16 +- doc/html/boost/date_time/var_string_to_int.html | 8 +- doc/html/boost/date_time/week_functor.html | 22 +- doc/html/boost/date_time/weeks_duration.html | 12 +- .../winapi/file_time_to_microseconds.html | 2 +- doc/html/boost/date_time/wrapping_int.html | 50 +- doc/html/boost/date_time/wrapping_int2.html | 54 +- doc/html/boost/date_time/year_based_generator.html | 26 +- doc/html/boost/date_time/year_functor.html | 22 +- doc/html/boost/date_time/year_month_day_base.html | 8 +- doc/html/boost/date_time/years_duration.html | 78 +- doc/html/boost/date_time/ymd_formatter.html | 16 +- doc/html/boost/date_time/ymd_order_spec.html | 2 +- doc/html/boost/enable_m_idm45506990224064.html | 60 + doc/html/boost/enable_move_u_idp163645968.html | 60 - doc/html/boost/environment_iterator.html | 22 +- doc/html/boost/eof_iterator.html | 40 +- doc/html/boost/forward.html | 10 +- doc/html/boost/front_move_insert_iterator.html | 34 +- doc/html/boost/front_move_inserter.html | 2 +- doc/html/boost/function.html | 210 +- doc/html/boost/function/sig.html | 6 +- doc/html/boost/functionN.html | 186 +- doc/html/boost/functionN/sig.html | 6 +- doc/html/boost/function_base.html | 38 +- doc/html/boost/function_equal.html | 2 +- doc/html/boost/get_idm45507165650576.html | 70 + doc/html/boost/get_idp351465872.html | 70 - doc/html/boost/graph_tr_idm45507045405248.html | 79 + doc/html/boost/graph_traits__idp106738368.html | 79 - doc/html/boost/gregorian/bad_day_of_month.html | 12 +- doc/html/boost/gregorian/bad_day_of_year.html | 8 +- doc/html/boost/gregorian/bad_month.html | 14 +- doc/html/boost/gregorian/bad_weekday.html | 14 +- doc/html/boost/gregorian/bad_year.html | 8 +- doc/html/boost/gregorian/date.html | 58 +- doc/html/boost/gregorian/date_duration.html | 76 +- doc/html/boost/gregorian/greg_day.html | 22 +- doc/html/boost/gregorian/greg_facet_config.html | 6 +- doc/html/boost/gregorian/greg_month.html | 78 +- doc/html/boost/gregorian/greg_weekday.html | 38 +- doc/html/boost/gregorian/greg_year.html | 18 +- .../gregorian/operator_idm45507086143184.html | 56 + .../gregorian/operator_idm45507108910016.html | 55 + .../gregorian/operator_idm45507108917616.html | 63 + .../gregorian/operator_idm45507110309184.html | 55 + .../boost/gregorian/operator_idp102151328.html | 55 - .../boost/gregorian/operator_idp102157104.html | 56 - .../boost/gregorian/operator_idp114794880.html | 55 - doc/html/boost/gregorian/operator_idp37883696.html | 63 - .../boost/gregorian/special_value_from_string.html | 2 +- doc/html/boost/gregorian/weeks_duration.html | 12 +- doc/html/boost/gregorian/year_based_generator.html | 2 +- doc/html/boost/has_move_emul_idp106862080.html | 55 - doc/html/boost/has_move_emulation_enabled.html | 10 +- doc/html/boost/has_move_idm45506979323984.html | 55 + doc/html/boost/has_nothrow_move.html | 10 +- doc/html/boost/has_triv_idm45507104705360.html | 57 + doc/html/boost/has_trivial_d_idp221516000.html | 57 - doc/html/boost/hash.html | 18 +- doc/html/boost/hash_T_idm45507162576784.html | 74 + doc/html/boost/hash_T_idp31087024.html | 74 - doc/html/boost/hash_boo_idm45507130924768.html | 77 + doc/html/boost/hash_bool_idp39904160.html | 77 - doc/html/boost/hash_cha_idm45507155605728.html | 77 + doc/html/boost/hash_char_idp115269568.html | 77 - doc/html/boost/hash_dou_idm45507091796448.html | 77 + doc/html/boost/hash_double_idp47931856.html | 77 - doc/html/boost/hash_flo_idm45507151806784.html | 77 + doc/html/boost/hash_float_idp94718704.html | 77 - doc/html/boost/hash_int_idm45507129209328.html | 77 + doc/html/boost/hash_int_idp44717040.html | 77 - doc/html/boost/hash_lon_idm45507135588752.html | 77 + doc/html/boost/hash_lon_idm45507152187984.html | 77 + doc/html/boost/hash_lon_idm45507161501456.html | 77 + doc/html/boost/hash_long_doub_idp75363296.html | 77 - doc/html/boost/hash_long_idp112322912.html | 77 - doc/html/boost/hash_long_long_idp37021984.html | 77 - doc/html/boost/hash_sho_idm45507086428944.html | 77 + doc/html/boost/hash_short_idp108298208.html | 77 - doc/html/boost/hash_sig_idm45507154819552.html | 77 + doc/html/boost/hash_signed_c_idp108738576.html | 77 - doc/html/boost/hash_std_idm45507089085408.html | 77 + doc/html/boost/hash_std_idm45507150036736.html | 77 + doc/html/boost/hash_std_idm45507162771328.html | 74 + doc/html/boost/hash_std_strin_idp49656032.html | 77 - doc/html/boost/hash_std_type__idp71799568.html | 74 - doc/html/boost/hash_std_wstri_idp47982592.html | 77 - doc/html/boost/hash_uns_idm45507098692080.html | 77 + doc/html/boost/hash_uns_idm45507103921888.html | 77 + doc/html/boost/hash_uns_idm45507132092672.html | 77 + doc/html/boost/hash_uns_idm45507132564400.html | 77 + doc/html/boost/hash_uns_idm45507151120816.html | 77 + doc/html/boost/hash_unsigned__idp36145056.html | 77 - doc/html/boost/hash_unsigned__idp43866112.html | 77 - doc/html/boost/hash_unsigned__idp73029472.html | 77 - doc/html/boost/hash_unsigned__idp93655040.html | 77 - doc/html/boost/hash_unsigned_idp102966432.html | 77 - doc/html/boost/hash_val_idm45507037969264.html | 82 + doc/html/boost/hash_value_idp307613776.html | 82 - doc/html/boost/hash_wch_idm45507163052656.html | 77 + doc/html/boost/hash_wchar_t_idp51592560.html | 77 - doc/html/boost/heap/MergablePriorityQueue.html | 16 +- doc/html/boost/heap/MutablePriorityQueue.html | 16 +- doc/html/boost/heap/PriorityQueue.html | 12 +- doc/html/boost/heap/arity.html | 2 +- doc/html/boost/heap/binomial_heap.html | 162 +- doc/html/boost/heap/constant_time_size.html | 2 +- doc/html/boost/heap/d_ary_heap.html | 166 +- doc/html/boost/heap/fibonacci_heap.html | 170 +- doc/html/boost/heap/heap_merge.html | 2 +- doc/html/boost/heap/mutable_.html | 2 +- doc/html/boost/heap/pairing_heap.html | 162 +- doc/html/boost/heap/priority_queue.html | 112 +- doc/html/boost/heap/skew_heap.html | 162 +- .../heap/skew_heap/implementation_defined.html | 6 +- doc/html/boost/heap/stable.html | 2 +- doc/html/boost/heap/store_parent_pointer.html | 2 +- doc/html/boost/interprocess/accept_ownership.html | 2 +- .../boost/interprocess/accept_ownership_type.html | 6 +- doc/html/boost/interprocess/adaptive_pool.html | 108 +- .../boost/interprocess/adaptive_pool/rebind.html | 10 +- doc/html/boost/interprocess/allocator.html | 106 +- doc/html/boost/interprocess/allocator/rebind.html | 10 +- .../interprocess/anonymous_shared_memory.html | 8 +- doc/html/boost/interprocess/bad_alloc.html | 18 +- doc/html/boost/interprocess/basic_bufferbuf.html | 30 +- .../boost/interprocess/basic_bufferstream.html | 34 +- .../boost/interprocess/basic_ibufferstream.html | 34 +- .../boost/interprocess/basic_ivectorstream.html | 38 +- .../interprocess/basic_ma_idm45879391291904.html | 150 ++ .../interprocess/basic_ma_idm45879391340624.html | 143 + .../interprocess/basic_ma_idm45879391398368.html | 156 ++ .../interprocess/basic_ma_idm45879391506880.html | 103 + .../interprocess/basic_managed__idp35237824.html | 103 - .../interprocess/basic_managed__idp35346336.html | 156 -- .../interprocess/basic_managed__idp35404080.html | 143 - .../interprocess/basic_managed__idp35452800.html | 150 -- .../interprocess/basic_managed_heap_memory.html | 38 +- .../interprocess/basic_managed_mapped_file.html | 70 +- .../boost/interprocess/basic_obufferstream.html | 34 +- .../boost/interprocess/basic_ovectorstream.html | 34 +- doc/html/boost/interprocess/basic_vectorbuf.html | 34 +- .../boost/interprocess/basic_vectorstream.html | 38 +- .../boost/interprocess/cached_adaptive_pool.html | 134 +- .../interprocess/cached_adaptive_pool/rebind.html | 10 +- .../boost/interprocess/cached_node_allocator.html | 134 +- .../interprocess/cached_node_allocator/rebind.html | 10 +- doc/html/boost/interprocess/create_only.html | 2 +- doc/html/boost/interprocess/create_only_t.html | 2 +- doc/html/boost/interprocess/defer_lock.html | 2 +- doc/html/boost/interprocess/deleter.html | 18 +- .../interprocess/enable_shared_from_this.html | 22 +- doc/html/boost/interprocess/file_lock.html | 66 +- doc/html/boost/interprocess/file_mapping.html | 56 +- .../interprocess/fixed_ma_idm45879391350304.html | 55 + .../interprocess/fixed_managed__idp35394400.html | 55 - doc/html/boost/interprocess/flat_map_index.html | 22 +- .../interprocess/interpro_idm45879390017344.html | 190 ++ .../interprocess/interpro_idm45879390048160.html | 128 + .../interprocess/interpro_idm45879390093552.html | 104 + .../boost/interprocess/interprocess_condition.html | 42 +- .../interprocess/interprocess_condition_any.html | 42 +- .../boost/interprocess/interprocess_exception.html | 34 +- .../boost/interprocess/interprocess_mutex.html | 40 +- .../interprocess/interprocess_r_idp36585488.html | 104 - .../interprocess/interprocess_s_idp36630880.html | 128 - .../boost/interprocess/interprocess_semaphore.html | 42 +- .../interprocess/interprocess_u_idp36661696.html | 190 -- doc/html/boost/interprocess/intrusive_ptr.html | 80 +- doc/html/boost/interprocess/iset_index.html | 34 +- .../boost/interprocess/iunordered_set_index.html | 42 +- doc/html/boost/interprocess/lock_exception.html | 18 +- .../interprocess/make_man_idm45879390476912.html | 59 + .../interprocess/make_man_idm45879390481424.html | 58 + .../interprocess/make_managed_s_idp36242448.html | 58 - .../interprocess/make_managed_s_idp36246960.html | 59 - .../interprocess/make_managed_unique_ptr.html | 2 +- .../boost/interprocess/make_managed_weak_ptr.html | 8 +- .../interprocess/managed__idm45879391301552.html | 55 + .../interprocess/managed_external_buffer.html | 12 +- .../boost/interprocess/managed_heap_memory.html | 2 +- .../boost/interprocess/managed_mapped_file.html | 2 +- .../boost/interprocess/managed_shared_memory.html | 12 +- .../boost/interprocess/managed_shared_ptr.html | 2 +- .../boost/interprocess/managed_unique_ptr.html | 8 +- doc/html/boost/interprocess/managed_weak_ptr.html | 10 +- .../interprocess/managed_window_idp35443152.html | 55 - .../interprocess/managed_xsi_shared_memory.html | 12 +- doc/html/boost/interprocess/map_index.html | 22 +- doc/html/boost/interprocess/mapped_region.html | 68 +- .../interprocess/mapped_region/advice_types.html | 8 +- doc/html/boost/interprocess/message_queue.html | 8 +- doc/html/boost/interprocess/message_queue_t.html | 72 +- doc/html/boost/interprocess/mutex_family.html | 4 +- doc/html/boost/interprocess/named_condition.html | 60 +- .../boost/interprocess/named_condition_any.html | 60 +- doc/html/boost/interprocess/named_mutex.html | 52 +- .../boost/interprocess/named_recursive_mutex.html | 52 +- doc/html/boost/interprocess/named_semaphore.html | 52 +- .../boost/interprocess/named_sharable_mutex.html | 68 +- .../boost/interprocess/named_upgradable_mutex.html | 116 +- doc/html/boost/interprocess/node_allocator.html | 122 +- .../boost/interprocess/node_allocator/rebind.html | 10 +- doc/html/boost/interprocess/null_index.html | 30 +- doc/html/boost/interprocess/null_mutex.html | 98 +- doc/html/boost/interprocess/null_mutex_family.html | 2 +- doc/html/boost/interprocess/offset_ptr.html | 199 +- doc/html/boost/interprocess/offset_ptr/rebind.html | 10 +- .../boost/interprocess/open_copy_on_write.html | 2 +- .../boost/interprocess/open_copy_on_write_t.html | 2 +- doc/html/boost/interprocess/open_only.html | 2 +- doc/html/boost/interprocess/open_only_t.html | 2 +- doc/html/boost/interprocess/open_or_create.html | 2 +- doc/html/boost/interprocess/open_or_create_t.html | 2 +- doc/html/boost/interprocess/open_read_only.html | 2 +- doc/html/boost/interprocess/open_read_only_t.html | 2 +- .../boost/interprocess/open_read_private_t.html | 2 +- .../boost/interprocess/operator___idp34259840.html | 58 - .../boost/interprocess/operator___idp34268112.html | 58 - .../boost/interprocess/operator___idp34348368.html | 57 - .../boost/interprocess/operator___idp34353344.html | 57 - .../boost/interprocess/operator___idp34455312.html | 58 - .../boost/interprocess/operator___idp34463600.html | 58 - .../boost/interprocess/operator___idp34562560.html | 57 - .../boost/interprocess/operator___idp34569120.html | 57 - .../boost/interprocess/operator___idp34662480.html | 57 - .../boost/interprocess/operator___idp34669024.html | 57 - .../boost/interprocess/operator___idp34768432.html | 58 - .../boost/interprocess/operator___idp34776720.html | 58 - .../boost/interprocess/operator___idp34873552.html | 58 - .../boost/interprocess/operator___idp34881840.html | 58 - .../boost/interprocess/operator___idp36012240.html | 57 - .../boost/interprocess/operator___idp36017456.html | 57 - .../boost/interprocess/operator___idp36022672.html | 57 - .../boost/interprocess/operator___idp36027472.html | 57 - .../boost/interprocess/operator___idp36032272.html | 57 - .../boost/interprocess/operator___idp36037072.html | 57 - .../interprocess/operator_idm45879390682704.html | 57 + .../interprocess/operator_idm45879390687504.html | 57 + .../interprocess/operator_idm45879390692304.html | 57 + .../interprocess/operator_idm45879390697104.html | 57 + .../interprocess/operator_idm45879390701904.html | 57 + .../interprocess/operator_idm45879390707120.html | 57 + .../interprocess/operator_idm45879390712336.html | 57 + .../interprocess/operator_idm45879391003744.html | 58 + .../interprocess/operator_idm45879391010656.html | 59 + .../interprocess/operator_idm45879391863280.html | 58 + .../interprocess/operator_idm45879391871568.html | 58 + .../interprocess/operator_idm45879391968400.html | 58 + .../interprocess/operator_idm45879391976688.html | 58 + .../interprocess/operator_idm45879392076096.html | 57 + .../interprocess/operator_idm45879392082640.html | 57 + .../interprocess/operator_idm45879392176000.html | 57 + .../interprocess/operator_idm45879392182560.html | 57 + .../interprocess/operator_idm45879392281520.html | 58 + .../interprocess/operator_idm45879392289808.html | 58 + .../interprocess/operator_idm45879392391776.html | 57 + .../interprocess/operator_idm45879392396752.html | 57 + .../interprocess/operator_idm45879392477104.html | 58 + .../interprocess/operator_idm45879392485376.html | 58 + .../boost/interprocess/operator_idp35714560.html | 59 - .../boost/interprocess/operator_idp35721472.html | 58 - .../boost/interprocess/operator_idp36041872.html | 57 - doc/html/boost/interprocess/permissions.html | 40 +- .../boost/interprocess/private_adaptive_pool.html | 126 +- .../interprocess/private_adaptive_pool/rebind.html | 10 +- .../boost/interprocess/private_node_allocator.html | 126 +- .../private_node_allocator/rebind.html | 10 +- doc/html/boost/interprocess/rbtree_best_fit.html | 80 +- doc/html/boost/interprocess/scoped_lock.html | 98 +- doc/html/boost/interprocess/scoped_ptr.html | 70 +- doc/html/boost/interprocess/segment_manager.html | 136 +- .../interprocess/segment_manager/allocator.html | 8 +- .../interprocess/segment_manager/deleter.html | 8 +- .../boost/interprocess/segment_manager_base.html | 78 +- doc/html/boost/interprocess/sharable_lock.html | 90 +- .../boost/interprocess/shared_memory_object.html | 72 +- doc/html/boost/interprocess/shared_ptr.html | 98 +- doc/html/boost/interprocess/simple_seq_fit.html | 8 +- .../boost/interprocess/swap_idm45879390627728.html | 56 + .../boost/interprocess/swap_idm45879390678048.html | 56 + doc/html/boost/interprocess/swap_idp36046528.html | 56 - doc/html/boost/interprocess/swap_idp36096848.html | 56 - .../interprocess/to_raw_p_idm45879390622336.html | 56 + .../interprocess/to_raw_p_idm45879390668304.html | 57 + .../interprocess/to_raw_pointer_idp36056272.html | 57 - .../interprocess/to_raw_pointer_idp36102240.html | 56 - doc/html/boost/interprocess/try_to_lock.html | 2 +- .../boost/interprocess/unordered_map_index.html | 22 +- doc/html/boost/interprocess/upgradable_lock.html | 90 +- doc/html/boost/interprocess/weak_ptr.html | 145 + .../interprocess/wfixed_m_idm45879391346576.html | 55 + .../interprocess/wfixed_managed_idp35398128.html | 55 - .../boost/interprocess/windows_shared_memory.html | 58 +- .../interprocess/wmanaged_external_buffer.html | 6 +- .../boost/interprocess/wmanaged_heap_memory.html | 2 +- .../interprocess/wmanaged_idm45879391297840.html | 55 + .../boost/interprocess/wmanaged_mapped_file.html | 8 +- .../boost/interprocess/wmanaged_shared_memory.html | 12 +- .../interprocess/wmanaged_windo_idp35446864.html | 55 - .../interprocess/wmanaged_xsi_shared_memory.html | 6 +- doc/html/boost/interprocess/xsi_key.html | 22 +- doc/html/boost/interprocess/xsi_shared_memory.html | 64 +- doc/html/boost/intrusive/any_base_hook.html | 30 +- doc/html/boost/intrusive/any_member_hook.html | 30 +- doc/html/boost/intrusive/any_to_avl_set_hook.html | 2 +- doc/html/boost/intrusive/any_to_bs_set_hook.html | 2 +- doc/html/boost/intrusive/any_to_list_hook.html | 2 +- doc/html/boost/intrusive/any_to_set_hook.html | 2 +- doc/html/boost/intrusive/any_to_slist_hook.html | 2 +- .../boost/intrusive/any_to_unordered_set_hook.html | 2 +- doc/html/boost/intrusive/avl_multiset.html | 347 +-- doc/html/boost/intrusive/avl_set.html | 359 +-- doc/html/boost/intrusive/avl_set_base_hook.html | 38 +- doc/html/boost/intrusive/avl_set_member_hook.html | 38 +- doc/html/boost/intrusive/avltree.html | 371 +-- doc/html/boost/intrusive/avltree_algorithms.html | 150 +- doc/html/boost/intrusive/base_hook.html | 2 +- doc/html/boost/intrusive/bs_multiset.html | 347 +-- doc/html/boost/intrusive/bs_set.html | 359 +-- doc/html/boost/intrusive/bs_set_base_hook.html | 38 +- doc/html/boost/intrusive/bs_set_member_hook.html | 38 +- doc/html/boost/intrusive/bstree.html | 387 +-- doc/html/boost/intrusive/bstree_algorithms.html | 296 +- doc/html/boost/intrusive/bucket_traits.html | 2 +- doc/html/boost/intrusive/cache_begin.html | 2 +- doc/html/boost/intrusive/cache_last.html | 2 +- .../boost/intrusive/circular_list_algorithms.html | 90 +- .../stable_partition_info.html | 6 +- .../boost/intrusive/circular_slist_algorithms.html | 84 +- doc/html/boost/intrusive/compare.html | 2 +- doc/html/boost/intrusive/compare_hash.html | 2 +- doc/html/boost/intrusive/constant_time_size.html | 2 +- .../boost/intrusive/derivation_value_traits.html | 24 +- doc/html/boost/intrusive/equal.html | 2 +- doc/html/boost/intrusive/floating_point.html | 2 +- doc/html/boost/intrusive/function_hook.html | 2 +- .../intrusive/get_pare_idm46322884338032.html | 58 + .../intrusive/get_pare_idm46322884342304.html | 57 + .../intrusive/get_parent_fro_idp48890800.html | 57 - .../intrusive/get_parent_fro_idp48895072.html | 58 - doc/html/boost/intrusive/hash.html | 2 +- doc/html/boost/intrusive/hashtable.html | 284 +- doc/html/boost/intrusive/incremental.html | 2 +- doc/html/boost/intrusive/key_of_value.html | 2 +- doc/html/boost/intrusive/linear.html | 2 +- .../boost/intrusive/linear_slist_algorithms.html | 64 +- doc/html/boost/intrusive/link_mode.html | 2 +- doc/html/boost/intrusive/link_mode_type.html | 2 +- doc/html/boost/intrusive/list.html | 292 +- doc/html/boost/intrusive/list_base_hook.html | 38 +- doc/html/boost/intrusive/list_member_hook.html | 38 +- doc/html/boost/intrusive/make_any_base_hook.html | 2 +- doc/html/boost/intrusive/make_any_member_hook.html | 2 +- doc/html/boost/intrusive/make_avl_multiset.html | 2 +- doc/html/boost/intrusive/make_avl_set.html | 2 +- .../boost/intrusive/make_avl_set_base_hook.html | 2 +- .../boost/intrusive/make_avl_set_member_hook.html | 2 +- doc/html/boost/intrusive/make_avltree.html | 2 +- doc/html/boost/intrusive/make_bs_multiset.html | 2 +- doc/html/boost/intrusive/make_bs_set.html | 2 +- .../boost/intrusive/make_bs_set_base_hook.html | 2 +- .../boost/intrusive/make_bs_set_member_hook.html | 2 +- doc/html/boost/intrusive/make_bstree.html | 2 +- doc/html/boost/intrusive/make_hashtable.html | 2 +- doc/html/boost/intrusive/make_list.html | 2 +- doc/html/boost/intrusive/make_list_base_hook.html | 2 +- .../boost/intrusive/make_list_member_hook.html | 2 +- doc/html/boost/intrusive/make_multiset.html | 2 +- doc/html/boost/intrusive/make_rbtree.html | 2 +- doc/html/boost/intrusive/make_set.html | 2 +- doc/html/boost/intrusive/make_set_base_hook.html | 2 +- doc/html/boost/intrusive/make_set_member_hook.html | 2 +- doc/html/boost/intrusive/make_sg_multiset.html | 2 +- doc/html/boost/intrusive/make_sg_set.html | 2 +- doc/html/boost/intrusive/make_sgtree.html | 2 +- doc/html/boost/intrusive/make_slist.html | 2 +- doc/html/boost/intrusive/make_slist_base_hook.html | 2 +- .../boost/intrusive/make_slist_member_hook.html | 2 +- doc/html/boost/intrusive/make_splay_multiset.html | 2 +- doc/html/boost/intrusive/make_splay_set.html | 2 +- doc/html/boost/intrusive/make_splaytree.html | 2 +- doc/html/boost/intrusive/make_treap.html | 2 +- doc/html/boost/intrusive/make_treap_multiset.html | 2 +- doc/html/boost/intrusive/make_treap_set.html | 2 +- .../intrusive/make_uno_idm46322874274752.html | 58 + .../intrusive/make_uno_idm46322874278544.html | 58 + .../intrusive/make_unordered_idp58605632.html | 58 - .../intrusive/make_unordered_idp58609424.html | 58 - .../boost/intrusive/make_unordered_multiset.html | 2 +- doc/html/boost/intrusive/make_unordered_set.html | 2 +- .../intrusive/max_poin_idm46322884327776.html | 59 + .../intrusive/max_pointer_pl_idp48905328.html | 59 - .../boost/intrusive/max_pointer_plus_bits.html | 10 +- doc/html/boost/intrusive/member_hook.html | 2 +- doc/html/boost/intrusive/member_value_traits.html | 24 +- doc/html/boost/intrusive/multiset.html | 347 +-- doc/html/boost/intrusive/optimize_multikey.html | 2 +- doc/html/boost/intrusive/optimize_size.html | 2 +- doc/html/boost/intrusive/pack_options.html | 2 +- .../intrusive/pointer__idm46322884203360.html | 109 + .../pointer__idm46322884203360/rebind_pointer.html | 55 + .../intrusive/pointer__idm46322884251312.html | 55 + .../intrusive/pointer__idm46322884255808.html | 54 + .../intrusive/pointer__idm46322884259472.html | 54 + .../intrusive/pointer__idm46322884263136.html | 54 + .../intrusive/pointer__idm46322884274320.html | 54 + .../intrusive/pointer__idm46322884320704.html | 77 + doc/html/boost/intrusive/pointer_has_rebind.html | 24 +- .../boost/intrusive/pointer_has_rebind/any.html | 14 +- .../boost/intrusive/pointer_has_rebind_other.html | 18 +- .../intrusive/pointer_has_rebind_other/any.html | 14 +- .../intrusive/pointer_plus_b_idp48912400.html | 77 - doc/html/boost/intrusive/pointer_plus_bits.html | 10 +- doc/html/boost/intrusive/pointer_rebind.html | 6 +- .../intrusive/pointer_rebind_idp48958784.html | 54 - .../intrusive/pointer_rebind_idp48969968.html | 54 - .../intrusive/pointer_rebind_idp48973632.html | 54 - .../intrusive/pointer_rebind_idp48977296.html | 54 - .../intrusive/pointer_rebind_idp48981792.html | 55 - doc/html/boost/intrusive/pointer_rebind_mode.html | 6 +- doc/html/boost/intrusive/pointer_rebinder.html | 6 +- doc/html/boost/intrusive/pointer_traits.html | 34 +- .../intrusive/pointer_traits_idp49029744.html | 109 - .../pointer_traits_idp49029744/rebind_pointer.html | 55 - doc/html/boost/intrusive/power_2_buckets.html | 2 +- doc/html/boost/intrusive/priority.html | 2 +- doc/html/boost/intrusive/priority_compare.html | 18 +- doc/html/boost/intrusive/rbtree.html | 375 +-- doc/html/boost/intrusive/rbtree_algorithms.html | 150 +- doc/html/boost/intrusive/set.html | 359 +-- doc/html/boost/intrusive/set_base_hook.html | 38 +- doc/html/boost/intrusive/set_member_hook.html | 38 +- doc/html/boost/intrusive/sg_multiset.html | 363 +-- doc/html/boost/intrusive/sg_set.html | 375 +-- doc/html/boost/intrusive/sgtree.html | 387 +-- doc/html/boost/intrusive/sgtree_algorithms.html | 148 +- .../sgtree_algorithms/insert_commit_data.html | 8 +- doc/html/boost/intrusive/size_type.html | 2 +- doc/html/boost/intrusive/slist.html | 404 +-- doc/html/boost/intrusive/slist_base_hook.html | 38 +- doc/html/boost/intrusive/slist_member_hook.html | 38 +- doc/html/boost/intrusive/splay_multiset.html | 367 +-- doc/html/boost/intrusive/splay_set.html | 388 +-- doc/html/boost/intrusive/splaytree.html | 400 +-- doc/html/boost/intrusive/splaytree_algorithms.html | 198 +- doc/html/boost/intrusive/store_hash.html | 2 +- doc/html/boost/intrusive/tag.html | 2 +- doc/html/boost/intrusive/treap.html | 413 +-- doc/html/boost/intrusive/treap_algorithms.html | 148 +- .../treap_algorithms/insert_commit_data.html | 8 +- doc/html/boost/intrusive/treap_multiset.html | 373 +-- doc/html/boost/intrusive/treap_set.html | 385 +-- doc/html/boost/intrusive/trivial_value_traits.html | 24 +- doc/html/boost/intrusive/unordered_multiset.html | 268 +- doc/html/boost/intrusive/unordered_set.html | 282 +- .../boost/intrusive/unordered_set_base_hook.html | 44 +- .../boost/intrusive/unordered_set_member_hook.html | 38 +- doc/html/boost/intrusive/value_traits.html | 2 +- doc/html/boost/intrusive/void_pointer.html | 2 +- doc/html/boost/is_recursive_wrapper.html | 2 +- .../boost/lambda/plain_re_idm45506851725664.html | 59 + .../boost/lambda/plain_re_idm45506851731488.html | 59 + .../boost/lambda/plain_re_idm45506851738592.html | 59 + .../boost/lambda/plain_re_idm45506851745680.html | 59 + .../boost/lambda/plain_re_idm45506851751520.html | 59 + .../boost/lambda/plain_re_idm45506851755408.html | 59 + .../boost/lambda/plain_re_idm45506851761152.html | 59 + .../boost/lambda/plain_re_idm45506851766352.html | 59 + .../boost/lambda/plain_re_idm45506851772560.html | 59 + .../boost/lambda/plain_re_idm45506851779664.html | 59 + .../boost/lambda/plain_re_idm45506851786752.html | 59 + .../boost/lambda/plain_re_idm45506851792512.html | 59 + .../boost/lambda/plain_re_idm45506851799616.html | 59 + .../boost/lambda/plain_re_idm45506851806704.html | 59 + .../boost/lambda/plain_re_idm45506851811904.html | 59 + .../boost/lambda/plain_re_idm45506851818112.html | 59 + .../boost/lambda/plain_re_idm45506851823936.html | 59 + .../boost/lambda/plain_re_idm45506851831040.html | 59 + .../boost/lambda/plain_re_idm45506851838128.html | 59 + .../boost/lambda/plain_re_idm45506851843968.html | 59 + .../boost/lambda/plain_re_idm45506851847856.html | 59 + .../boost/lambda/plain_re_idm45506851851472.html | 59 + .../boost/lambda/plain_re_idm45506851857216.html | 59 + .../boost/lambda/plain_re_idm45506851862416.html | 59 + .../boost/lambda/plain_re_idm45506851869520.html | 59 + .../boost/lambda/plain_re_idm45506851876608.html | 59 + .../boost/lambda/plain_re_idm45506851882368.html | 59 + .../boost/lambda/plain_re_idm45506851889472.html | 59 + .../boost/lambda/plain_re_idm45506851896560.html | 59 + .../boost/lambda/plain_re_idm45506851901760.html | 59 + .../boost/lambda/plain_re_idm45506851906656.html | 59 + .../boost/lambda/plain_re_idm45506851911568.html | 59 + .../boost/lambda/plain_re_idm45506851916464.html | 59 + .../boost/lambda/plain_re_idm45506851921376.html | 59 + .../boost/lambda/plain_return__idp347042880.html | 59 - .../boost/lambda/plain_return__idp347047792.html | 59 - .../boost/lambda/plain_return__idp347052688.html | 59 - .../boost/lambda/plain_return__idp347057600.html | 59 - .../boost/lambda/plain_return__idp347062496.html | 59 - .../boost/lambda/plain_return__idp347067696.html | 59 - .../boost/lambda/plain_return__idp347074784.html | 59 - .../boost/lambda/plain_return__idp347081888.html | 59 - .../boost/lambda/plain_return__idp347087648.html | 59 - .../boost/lambda/plain_return__idp347094736.html | 59 - .../boost/lambda/plain_return__idp347101840.html | 59 - .../boost/lambda/plain_return__idp347107040.html | 59 - .../boost/lambda/plain_return__idp347112784.html | 59 - .../boost/lambda/plain_return__idp347116400.html | 59 - .../boost/lambda/plain_return__idp347120288.html | 59 - .../boost/lambda/plain_return__idp347126128.html | 59 - .../boost/lambda/plain_return__idp347133216.html | 59 - .../boost/lambda/plain_return__idp347140320.html | 59 - .../boost/lambda/plain_return__idp347146144.html | 59 - .../boost/lambda/plain_return__idp347152352.html | 59 - .../boost/lambda/plain_return__idp347157552.html | 59 - .../boost/lambda/plain_return__idp347164640.html | 59 - .../boost/lambda/plain_return__idp347171744.html | 59 - .../boost/lambda/plain_return__idp347177504.html | 59 - .../boost/lambda/plain_return__idp347184592.html | 59 - .../boost/lambda/plain_return__idp347191696.html | 59 - .../boost/lambda/plain_return__idp347197904.html | 59 - .../boost/lambda/plain_return__idp347203104.html | 59 - .../boost/lambda/plain_return__idp347208848.html | 59 - .../boost/lambda/plain_return__idp347212736.html | 59 - .../boost/lambda/plain_return__idp347218576.html | 59 - .../boost/lambda/plain_return__idp347225664.html | 59 - .../boost/lambda/plain_return__idp347232768.html | 59 - .../boost/lambda/plain_return__idp347238592.html | 59 - doc/html/boost/last_val_idm45507100097776.html | 79 + doc/html/boost/last_value.html | 22 +- doc/html/boost/last_value_vo_idp110570544.html | 79 - doc/html/boost/local_time/ambiguous_result.html | 8 +- doc/html/boost/local_time/bad_adjustment.html | 8 +- doc/html/boost/local_time/bad_offset.html | 8 +- .../boost/local_time/custom_time_zone_base.html | 66 +- doc/html/boost/local_time/dst_not_valid.html | 8 +- .../boost/local_time/first_last_rule_spec.html | 6 +- .../boost/local_time/local_date_time_base.html | 154 +- .../boost/local_time/operator-__idp112002944.html | 54 - .../boost/local_time/operator-__idp112016272.html | 54 - .../boost/local_time/operator-_idp112012848.html | 54 - .../boost/local_time/operator-_idp38322288.html | 54 - .../boost/local_time/operator___idp112009600.html | 54 - .../boost/local_time/operator___idp38319040.html | 54 - .../boost/local_time/operator__idp112006192.html | 54 - .../boost/local_time/operator__idp38315632.html | 54 - .../local_time/operator_idm45507089108976.html | 54 + .../local_time/operator_idm45507089112224.html | 54 + .../local_time/operator_idm45507089115632.html | 54 + .../local_time/operator_idm45507089118880.html | 54 + .../local_time/operator_idm45507089122288.html | 54 + .../local_time/operator_idm45507092037088.html | 54 + .../local_time/operator_idm45507092040512.html | 54 + .../local_time/operator_idm45507092043760.html | 54 + .../boost/local_time/posix_time_zone_base.html | 94 +- doc/html/boost/local_time/time_label_invalid.html | 8 +- doc/html/boost/local_time/tz_database.html | 2 +- doc/html/boost/lockfree/allocator.html | 2 +- doc/html/boost/lockfree/capacity.html | 2 +- doc/html/boost/lockfree/fixed_sized.html | 2 +- doc/html/boost/lockfree/queue.html | 94 +- doc/html/boost/lockfree/spsc_queue.html | 106 +- doc/html/boost/lockfree/stack.html | 154 +- .../lockfree/stack/implementation_defined.html | 6 +- doc/html/boost/lockfree/stack/node.html | 14 +- .../boost/logic/get_defa_idm45507104701424.html | 54 + .../boost/logic/get_default_i_idp154719632.html | 54 - doc/html/boost/logic/indeterminate.html | 8 +- doc/html/boost/logic/indeterminate_name.html | 28 +- doc/html/boost/logic/operator___idp38768448.html | 114 - doc/html/boost/logic/operator___idp51294368.html | 114 - doc/html/boost/logic/operator___idp96741552.html | 114 - doc/html/boost/logic/operator__idp45706720.html | 100 - .../boost/logic/operator_idm45506983089584.html | 69 + .../boost/logic/operator_idm45506993963376.html | 114 + .../boost/logic/operator_idm45507041012704.html | 71 + .../boost/logic/operator_idm45507048922256.html | 68 + .../boost/logic/operator_idm45507093800208.html | 114 + .../boost/logic/operator_idm45507093816016.html | 114 + .../boost/logic/operator_idm45507099076384.html | 100 + .../boost/logic/operator_idm45507104075136.html | 114 + doc/html/boost/logic/operator_idp104323600.html | 114 - doc/html/boost/logic/operator_idp154599264.html | 71 - doc/html/boost/logic/operator_idp158797600.html | 69 - doc/html/boost/logic/operator_idp48877552.html | 68 - doc/html/boost/logic/tribool.html | 26 +- doc/html/boost/logic/tribool/value_t.html | 8 +- doc/html/boost/make_move_iterator.html | 2 +- doc/html/boost/make_rec_idm45507101497936.html | 76 + doc/html/boost/make_recursiv_idp352653296.html | 76 - doc/html/boost/make_recursive_variant.html | 8 +- doc/html/boost/make_variant_over.html | 8 +- doc/html/boost/move_backward.html | 8 +- doc/html/boost/move_idm45507105093488.html | 55 + doc/html/boost/move_idm45507111136736.html | 58 + doc/html/boost/move_idp106413712.html | 55 - doc/html/boost/move_idp207498784.html | 58 - doc/html/boost/move_if__idm45507039180160.html | 56 + doc/html/boost/move_if_noexcept.html | 10 +- doc/html/boost/move_insert_iterator.html | 34 +- doc/html/boost/move_inserter.html | 8 +- doc/html/boost/move_iterator.html | 70 +- doc/html/boost/move_upd/bool_conversion.html | 66 - .../boost/move_upd/def_del_compatible_cond.html | 54 - doc/html/boost/move_upd/deleter_types.html | 57 - doc/html/boost/move_upd/enable_def_del.html | 53 - doc/html/boost/move_upd/enable_defdel_call.html | 54 - .../boost/move_upd/enable_up_moveconv_assign.html | 54 - .../boost/move_upd/enable_up_moveconv_constr.html | 54 - doc/html/boost/move_upd/enable_up_ptr.html | 54 - doc/html/boost/move_upd/get_cvelement.html | 54 - .../boost/move_upd/get_element_t_idp214518816.html | 54 - doc/html/boost/move_upd/get_element_type.html | 79 - .../move_upd/get_element_type/DefaultWrap.html | 55 - doc/html/boost/move_upd/is_rvalue_convertible.html | 77 - .../move_upd/is_rvalue_convertible/false_t.html | 53 - .../boost/move_upd/is_same_cvele_idp214489504.html | 59 - .../boost/move_upd/is_unique_ptr_convertible.html | 53 - .../boost/move_upd/is_unique_ptr_idp207464816.html | 54 - doc/html/boost/move_upd/nullptr_type.html | 50 - .../boost/move_upd/unique_delete_idp207431200.html | 55 - .../boost/move_upd/unique_delete_idp207468160.html | 55 - .../boost/move_upd/unique_moveco_idp207435136.html | 56 - .../boost/move_upd/unique_ptr_da_idp203566208.html | 96 - doc/html/boost/move_upd/unique_ptr_data.html | 98 - doc/html/boost/movelib/default_delete.html | 52 +- .../boost/movelib/make_uni_idm45507091094560.html | 56 + .../boost/movelib/make_uni_idm45507091099536.html | 56 + .../boost/movelib/make_uni_idm45507091739024.html | 56 + .../boost/movelib/make_uni_idm45507091743264.html | 56 + .../boost/movelib/make_uni_idm45507097741232.html | 56 + .../boost/movelib/make_uni_idm45507098189296.html | 57 + .../boost/movelib/make_uni_idm45507102529152.html | 57 + .../boost/movelib/make_uni_idm45507103445360.html | 56 + .../boost/movelib/make_uni_idm45507103449648.html | 55 + .../boost/movelib/make_uni_idm45507104315232.html | 57 + .../boost/movelib/make_uni_idm45507110937472.html | 56 + .../boost/movelib/make_uni_idm45507110955264.html | 56 + .../boost/movelib/make_unique_d_idp101273888.html | 56 - .../boost/movelib/make_unique_d_idp224536720.html | 56 - .../boost/movelib/make_unique_d_idp226298144.html | 56 - .../boost/movelib/make_unique_idp151938176.html | 56 - .../boost/movelib/make_unique_idp201646016.html | 57 - .../boost/movelib/make_unique_idp224573072.html | 55 - .../boost/movelib/make_unique_n_idp101278080.html | 56 - .../boost/movelib/make_unique_n_idp154420480.html | 57 - .../boost/movelib/make_unique_n_idp224504784.html | 56 - .../boost/movelib/make_unique_n_idp224541008.html | 56 - .../boost/movelib/make_unique_n_idp226228752.html | 57 - .../boost/movelib/make_unique_n_idp226293136.html | 56 - .../boost/movelib/operator___idp102237008.html | 56 - .../boost/movelib/operator___idp102242064.html | 56 - .../boost/movelib/operator___idp108149184.html | 56 - .../boost/movelib/operator___idp111132784.html | 57 - .../boost/movelib/operator___idp114161104.html | 56 - .../boost/movelib/operator___idp154397872.html | 57 - .../boost/movelib/operator___idp154412416.html | 57 - doc/html/boost/movelib/operator___idp68030480.html | 56 - doc/html/boost/movelib/operator___idp68035984.html | 56 - doc/html/boost/movelib/operator___idp92661952.html | 56 - doc/html/boost/movelib/operator___idp93814816.html | 56 - doc/html/boost/movelib/operator___idp95378464.html | 57 - .../boost/movelib/operator_idm45507039736960.html | 58 + .../boost/movelib/operator_idm45507043441072.html | 56 + .../boost/movelib/operator_idm45507043992192.html | 57 + .../boost/movelib/operator_idm45507045351216.html | 57 + .../boost/movelib/operator_idm45507048472480.html | 56 + .../boost/movelib/operator_idm45507048477536.html | 56 + .../boost/movelib/operator_idm45507088427888.html | 57 + .../boost/movelib/operator_idm45507094562544.html | 57 + .../boost/movelib/operator_idm45507094681568.html | 57 + .../boost/movelib/operator_idm45507096735552.html | 56 + .../boost/movelib/operator_idm45507096741056.html | 56 + .../boost/movelib/operator_idm45507098051056.html | 56 + .../boost/movelib/operator_idm45507101134656.html | 56 + .../boost/movelib/operator_idm45507104752784.html | 57 + .../boost/movelib/operator_idm45507107568208.html | 56 + .../boost/movelib/operator_idm45507109686992.html | 56 + .../boost/movelib/operator_idm45507109692496.html | 56 + .../boost/movelib/operator_idm45507163238016.html | 57 + doc/html/boost/movelib/operator_idp101104320.html | 57 - doc/html/boost/movelib/operator_idp105771664.html | 56 - doc/html/boost/movelib/operator_idp151794496.html | 56 - doc/html/boost/movelib/operator_idp154404928.html | 58 - doc/html/boost/movelib/operator_idp92667008.html | 57 - doc/html/boost/movelib/operator_idp96679536.html | 57 - doc/html/boost/movelib/swap_idm45507037906240.html | 56 + doc/html/boost/movelib/swap_idp95372832.html | 56 - doc/html/boost/movelib/unique_ptr.html | 130 +- doc/html/boost/mpi/all_gather.html | 8 +- doc/html/boost/mpi/all_reduce.html | 2 +- doc/html/boost/mpi/all_to_all.html | 2 +- doc/html/boost/mpi/allocato_idm45506984689984.html | 70 + .../mpi/allocato_idm45506984689984/rebind.html | 57 + doc/html/boost/mpi/allocator.html | 58 +- doc/html/boost/mpi/allocator/rebind.html | 8 +- doc/html/boost/mpi/allocator_voi_idp114760400.html | 70 - .../mpi/allocator_voi_idp114760400/rebind.html | 57 - doc/html/boost/mpi/any_source.html | 2 +- doc/html/boost/mpi/any_tag.html | 8 +- doc/html/boost/mpi/bitwise_and.html | 12 +- doc/html/boost/mpi/bitwise_or.html | 12 +- doc/html/boost/mpi/bitwise_xor.html | 12 +- doc/html/boost/mpi/broadcast.html | 2 +- doc/html/boost/mpi/comm_create_kind.html | 2 +- doc/html/boost/mpi/communicator.html | 146 +- doc/html/boost/mpi/content.html | 30 +- doc/html/boost/mpi/environment.html | 76 +- doc/html/boost/mpi/exception.html | 34 +- doc/html/boost/mpi/gather.html | 2 +- doc/html/boost/mpi/gatherv.html | 2 +- doc/html/boost/mpi/get_content.html | 2 +- doc/html/boost/mpi/get_idm45507160469824.html | 57 + doc/html/boost/mpi/get_idm45507160473392.html | 57 + doc/html/boost/mpi/get_idp110722032.html | 57 - doc/html/boost/mpi/get_idp224410352.html | 57 - doc/html/boost/mpi/get_mpi__idm45507086028144.html | 87 + doc/html/boost/mpi/get_mpi_datat_idp216170320.html | 87 - doc/html/boost/mpi/graph_communicator.html | 22 +- doc/html/boost/mpi/group.html | 54 +- doc/html/boost/mpi/inplace.html | 8 +- doc/html/boost/mpi/inplace__idm45506988730224.html | 69 + doc/html/boost/mpi/inplace_t.html | 16 +- doc/html/boost/mpi/inplace_t_T_idp205769904.html | 69 - doc/html/boost/mpi/intercommunicator.html | 42 +- doc/html/boost/mpi/is_commutative.html | 2 +- doc/html/boost/mpi/is_mpi_builtin_datatype.html | 4 +- doc/html/boost/mpi/is_mpi_byte_datatype.html | 2 +- doc/html/boost/mpi/is_mpi_complex_datatype.html | 2 +- doc/html/boost/mpi/is_mpi_datatype.html | 8 +- doc/html/boost/mpi/is_mpi_f_idm45507104405744.html | 58 + doc/html/boost/mpi/is_mpi_floati_idp216202464.html | 58 - doc/html/boost/mpi/is_mpi_integer_datatype.html | 8 +- doc/html/boost/mpi/is_mpi_logical_datatype.html | 8 +- doc/html/boost/mpi/is_mpi_op.html | 2 +- doc/html/boost/mpi/logical_xor.html | 12 +- doc/html/boost/mpi/maximum.html | 12 +- doc/html/boost/mpi/minimum.html | 12 +- doc/html/boost/mpi/operator-_idp207337216.html | 57 - doc/html/boost/mpi/operator___idp209197264.html | 69 - doc/html/boost/mpi/operator___idp214478720.html | 69 - doc/html/boost/mpi/operator___idp226217008.html | 70 - doc/html/boost/mpi/operator___idp226222384.html | 68 - doc/html/boost/mpi/operator___idp92471168.html | 70 - doc/html/boost/mpi/operator___idp92477408.html | 70 - doc/html/boost/mpi/operator__idp207491760.html | 57 - doc/html/boost/mpi/operator_idm45506986350816.html | 70 + doc/html/boost/mpi/operator_idm45506986357056.html | 70 + doc/html/boost/mpi/operator_idm45507038807728.html | 69 + doc/html/boost/mpi/operator_idm45507042831024.html | 68 + doc/html/boost/mpi/operator_idm45507042836400.html | 70 + doc/html/boost/mpi/operator_idm45507094512656.html | 57 + doc/html/boost/mpi/operator_idm45507094518064.html | 69 + doc/html/boost/mpi/operator_idm45507102919600.html | 57 + doc/html/boost/mpi/operator_idm45507106437360.html | 57 + doc/html/boost/mpi/operator_idp209202672.html | 57 - doc/html/boost/mpi/packed_iarchive.html | 50 +- doc/html/boost/mpi/packed_oarchive.html | 46 +- doc/html/boost/mpi/packed_skeleton_iarchive.html | 26 +- doc/html/boost/mpi/packed_skeleton_oarchive.html | 22 +- .../mpi/python/register_idm45507048514256.html | 86 + doc/html/boost/mpi/python/register_serialized.html | 8 +- .../mpi/python/register_skel_idp114524160.html | 86 - doc/html/boost/mpi/reduce.html | 2 +- doc/html/boost/mpi/request.html | 32 +- doc/html/boost/mpi/scan.html | 2 +- doc/html/boost/mpi/scatter.html | 2 +- doc/html/boost/mpi/scatterv.html | 2 +- doc/html/boost/mpi/skeleton.html | 2 +- doc/html/boost/mpi/skeleton_proxy.html | 8 +- doc/html/boost/mpi/status.html | 46 +- doc/html/boost/mpi/test_all.html | 2 +- doc/html/boost/mpi/test_any.html | 2 +- doc/html/boost/mpi/test_some.html | 2 +- doc/html/boost/mpi/threading/level.html | 8 +- .../mpi/threading/operator_idm45507037552864.html | 57 + .../mpi/threading/operator_idm45507098853648.html | 57 + .../boost/mpi/threading/operator_idp203436240.html | 57 - .../boost/mpi/threading/operator_idp203438896.html | 57 - doc/html/boost/mpi/timer.html | 40 +- doc/html/boost/mpi/wait_all.html | 2 +- doc/html/boost/mpi/wait_any.html | 2 +- doc/html/boost/mpi/wait_some.html | 2 +- doc/html/boost/numeric/default_.html | 12 +- doc/html/boost/numeric/functional/as_max.html | 6 +- .../functional/as_max_T__std__idp67419120.html | 63 - .../functional/as_max_T__std__idp67495600.html | 63 - .../functional/as_max_T_idm45507138916016.html | 63 + .../functional/as_max_T_idm45507138992496.html | 63 + doc/html/boost/numeric/functional/as_max_base.html | 16 +- .../functional/as_min_T__std__idp67424192.html | 63 - .../functional/as_min_T__std__idp67500672.html | 63 - .../functional/as_min_T_idm45507138910944.html | 63 + .../functional/as_min_T_idm45507138987424.html | 63 + .../functional/as_min_b_idm45507139322576.html | 69 + doc/html/boost/numeric/functional/as_min_base.html | 22 +- .../functional/as_min_base_Ar_idp67089040.html | 69 - doc/html/boost/numeric/functional/as_one.html | 6 +- .../functional/as_one_T__std__idp67429264.html | 63 - .../functional/as_one_T__std__idp67505744.html | 63 - .../functional/as_one_T_idm45507138905872.html | 63 + .../functional/as_one_T_idm45507138982352.html | 63 + doc/html/boost/numeric/functional/as_one_base.html | 12 +- .../functional/as_zero_T__std_idp67434336.html | 63 - .../functional/as_zero_T__std_idp67510816.html | 63 - .../functional/as_zero__idm45507138900800.html | 63 + .../functional/as_zero__idm45507138977280.html | 63 + .../boost/numeric/functional/as_zero_base.html | 12 +- doc/html/boost/numeric/functional/assign_base.html | 12 +- .../boost/numeric/functional/complement_base.html | 12 +- .../numeric/functional/divides_assign_base.html | 12 +- .../boost/numeric/functional/divides_base.html | 12 +- .../boost/numeric/functional/equal_to_base.html | 12 +- .../functional/fdiv_Lef_idm45507138895728.html | 53 + .../functional/fdiv_Lef_idm45507138972208.html | 53 + .../functional/fdiv_Left__Rig_idp67439408.html | 53 - .../functional/fdiv_Left__Rig_idp67515888.html | 53 - .../functional/fdiv_bas_idm45507139240192.html | 54 + doc/html/boost/numeric/functional/fdiv_base.html | 6 +- .../functional/fdiv_base_Left_idp67171424.html | 54 - doc/html/boost/numeric/functional/greater.html | 6 +- .../boost/numeric/functional/greater_base.html | 12 +- .../numeric/functional/greater_equal_base.html | 12 +- doc/html/boost/numeric/functional/less_base.html | 12 +- .../boost/numeric/functional/less_equal_base.html | 12 +- .../boost/numeric/functional/logical_not_base.html | 12 +- .../functional/max_assi_idm45507138891984.html | 63 + .../functional/max_assi_idm45507138967904.html | 63 + .../functional/max_assign_Lef_idp67443712.html | 63 - .../functional/max_assign_Lef_idp67519632.html | 63 - .../boost/numeric/functional/max_assign_base.html | 12 +- .../functional/min_assi_idm45507138885088.html | 63 + .../functional/min_assi_idm45507138961008.html | 63 + .../functional/min_assign_Lef_idp67450608.html | 63 - .../functional/min_assign_Lef_idp67526528.html | 63 - .../boost/numeric/functional/min_assign_base.html | 12 +- .../numeric/functional/minus_assign_base.html | 12 +- doc/html/boost/numeric/functional/minus_base.html | 12 +- .../numeric/functional/modulus_assign_base.html | 12 +- .../boost/numeric/functional/modulus_base.html | 12 +- .../numeric/functional/multiplies_assign_base.html | 12 +- .../boost/numeric/functional/multiplies_base.html | 12 +- .../functional/multiply_and_p_idp65905632.html | 54 - .../numeric/functional/not_equal_to_base.html | 12 +- .../boost/numeric/functional/outer_product.html | 56 - .../functional/outer_product__idp64902832.html | 66 - .../numeric/functional/outer_product_base.html | 52 - .../boost/numeric/functional/plus_assign_base.html | 12 +- doc/html/boost/numeric/functional/plus_base.html | 12 +- .../functional/promote_ToFrom_idp67472480.html | 63 - .../functional/promote_ToFrom_idp67539616.html | 63 - .../functional/promote_To__Fr_idp67466288.html | 63 - .../functional/promote_To__Fr_idp67533424.html | 63 - .../functional/promote__idm45507138872000.html | 63 + .../functional/promote__idm45507138878192.html | 63 + .../functional/promote__idm45507138939136.html | 63 + .../functional/promote__idm45507138945328.html | 63 + .../functional/promote__idm45507138950960.html | 63 + .../functional/promote__idm45507138954112.html | 53 + .../functional/promote__idm45507139047504.html | 63 + .../boost/numeric/functional/promote_base.html | 18 +- .../functional/promote_base_T_idp67364112.html | 63 - .../functional/promote_bool___idp67460656.html | 63 - .../functional/promote_bool_c_idp67457504.html | 53 - .../functional/tag_std__idm45507138866368.html | 54 + .../functional/tag_std__idm45507138933504.html | 54 + .../functional/tag_std_valarr_idp67478112.html | 54 - .../functional/tag_std_vector_idp67545248.html | 54 - doc/html/boost/numeric/functional/unary_minus.html | 6 +- .../boost/numeric/functional/unary_minus_base.html | 12 +- .../boost/numeric/functional/unary_plus_base.html | 12 +- doc/html/boost/numeric/one.html | 12 +- doc/html/boost/numeric/op/outer_product.html | 52 - doc/html/boost/numeric/zero.html | 12 +- doc/html/boost/numeric/zero_or_default.html | 6 +- doc/html/boost/operator___idp24809744.html | 101 - doc/html/boost/operator___idp24836512.html | 105 - doc/html/boost/operator___idp24864848.html | 105 - doc/html/boost/operator___idp24879024.html | 105 - doc/html/boost/operator_idm45506846622160.html | 83 + doc/html/boost/operator_idm45713141989760.html | 105 + doc/html/boost/operator_idm45713142003936.html | 105 + doc/html/boost/operator_idm45713142018112.html | 105 + doc/html/boost/operator_idm45713142032272.html | 105 + doc/html/boost/operator_idm45713142045616.html | 101 + doc/html/boost/operator_idm45713142059040.html | 101 + doc/html/boost/operator_idp24823168.html | 101 - doc/html/boost/operator_idp24850672.html | 105 - doc/html/boost/operator_idp312686896.html | 83 - doc/html/boost/polymorphic_get.html | 2 +- doc/html/boost/polymorphic_relaxed_get.html | 2 +- doc/html/boost/polymorphic_strict_get.html | 2 +- .../boost/posix_time/duration_from_string.html | 8 +- doc/html/boost/posix_time/from_ftime.html | 8 +- doc/html/boost/posix_time/hours.html | 8 +- .../posix_time/millisec_idm45507135057104.html | 70 + .../posix_time/millisec_posi_idp112084736.html | 70 - doc/html/boost/posix_time/minutes.html | 8 +- .../boost/posix_time/operator-__idp101451904.html | 53 - .../boost/posix_time/operator-__idp111954528.html | 53 - .../boost/posix_time/operator-_idp101448512.html | 53 - .../boost/posix_time/operator-_idp111951120.html | 53 - .../boost/posix_time/operator___idp101445280.html | 53 - .../boost/posix_time/operator___idp111947888.html | 53 - .../boost/posix_time/operator__idp101441888.html | 53 - .../boost/posix_time/operator__idp111944496.html | 53 - .../posix_time/operator_idm45507094493328.html | 53 + .../posix_time/operator_idm45507094496736.html | 53 + .../posix_time/operator_idm45507094499968.html | 53 + .../posix_time/operator_idm45507107058896.html | 55 + .../posix_time/operator_idm45507110093456.html | 53 + .../posix_time/operator_idm45507110096688.html | 53 + .../posix_time/operator_idm45507110100080.html | 53 + .../posix_time/operator_idm45507110103312.html | 53 + .../posix_time/operator_idm45507154023312.html | 53 + .../boost/posix_time/operator_idp43055264.html | 55 - .../boost/posix_time/posix_time_system_config.html | 18 +- doc/html/boost/posix_time/ptime.html | 30 +- doc/html/boost/posix_time/seconds.html | 8 +- doc/html/boost/posix_time/simple_time_rep.html | 30 +- doc/html/boost/posix_time/time_duration.html | 20 +- doc/html/boost/posix_time/wtime_facet.html | 8 +- .../program_options/abstract_variables_map.html | 40 +- .../boost/program_options/ambiguous_option.html | 32 +- .../program_options/basic_command_line_parser.html | 54 +- doc/html/boost/program_options/basic_option.html | 14 +- .../basic_pa_idm45507044853824.html | 97 + .../basic_parsed__idp152015376.html | 97 - .../program_options/basic_parsed_options.html | 96 + doc/html/boost/program_options/bool_switch.html | 2 +- .../program_options/collect_unrecognized.html | 10 +- .../program_options/collect_unrecognized_mode.html | 8 +- .../command_line_style/style_t.html | 2 +- .../program_options/duplicate_option_error.html | 8 +- doc/html/boost/program_options/error.html | 8 +- .../program_options/error_with_no_option_name.html | 22 +- .../program_options/error_with_option_name.html | 74 +- doc/html/boost/program_options/ext_parser.html | 4 +- .../invalid__idm45507161390480.html | 75 + .../boost/program_options/invalid_bool_value.html | 8 +- .../invalid_comma_idp163674448.html | 75 - .../invalid_command_line_style.html | 14 +- .../invalid_config_file_syntax.html | 28 +- .../program_options/invalid_option_value.html | 12 +- doc/html/boost/program_options/invalid_syntax.html | 36 +- .../program_options/multiple_occurrences.html | 12 +- .../boost/program_options/multiple_values.html | 12 +- doc/html/boost/program_options/notify.html | 8 +- .../boost/program_options/option_description.html | 68 +- .../options__idm45506977779488.html | 86 + .../options_descr_idp214375408.html | 86 - .../boost/program_options/options_description.html | 66 +- .../parse_co_idm45507043055104.html | 59 + .../parse_co_idm45507106389456.html | 60 + .../boost/program_options/parse_command_line.html | 10 +- .../parse_config__idp203490384.html | 59 - .../parse_config__idp206025792.html | 60 - .../parse_en_idm45506972428912.html | 59 + .../parse_en_idm45506995617728.html | 56 + .../parse_en_idm45507039007472.html | 57 + .../parse_environ_idp154393360.html | 57 - .../parse_environ_idp224270416.html | 59 - .../parse_environm_idp75334496.html | 56 - .../position_idm45507094291136.html | 92 + .../positional_op_idp150873344.html | 92 - doc/html/boost/program_options/reading_file.html | 8 +- .../boost/program_options/required_option.html | 18 +- doc/html/boost/program_options/split_unix.html | 10 +- .../program_options/store_idm45507045051456.html | 57 + .../program_options/store_idm45507086881680.html | 56 + .../boost/program_options/store_idp104980944.html | 56 - .../boost/program_options/store_idp219446064.html | 57 - .../too_many_idm45507093966064.html | 68 + .../too_many_posi_idp112496320.html | 68 - doc/html/boost/program_options/typed_value.html | 100 +- .../boost/program_options/typed_value_base.html | 18 +- doc/html/boost/program_options/unknown_option.html | 18 +- doc/html/boost/program_options/untyped_value.html | 50 +- .../boost/program_options/validation_error.html | 22 +- .../program_options/value_idm45507036651984.html | 56 + .../boost/program_options/value_idp109113408.html | 56 - .../value_se_idm45507037570000.html | 84 + .../value_se_idm45507102986880.html | 63 + .../value_se_idm45507132697440.html | 84 + .../value_semanti_idp103539104.html | 84 - .../value_semanti_idp207166032.html | 63 - doc/html/boost/program_options/value_semantic.html | 56 +- .../value_semantic_idp99204112.html | 84 - doc/html/boost/program_options/variable_value.html | 52 +- doc/html/boost/program_options/variables_map.html | 56 +- doc/html/boost/program_options/wvalue.html | 8 +- doc/html/boost/property_tree/basic_ptree.html | 348 +-- .../property_tree/customiz_idm45506971496960.html | 68 + .../property_tree/customiz_idm45507087332800.html | 68 + .../property_tree/customiz_idm45507095445648.html | 68 + .../property_tree/customiz_idm45507101050960.html | 68 + .../property_tree/customiz_idm45507104805872.html | 68 + .../property_tree/customize_str_idp158967040.html | 68 - .../property_tree/customize_str_idp160898256.html | 68 - .../property_tree/customize_str_idp224460896.html | 68 - .../property_tree/customize_str_idp229460720.html | 68 - .../property_tree/customize_stre_idp95731648.html | 68 - doc/html/boost/property_tree/customize_stream.html | 24 +- doc/html/boost/property_tree/id_translator.html | 22 +- .../info_parser/read_inf_idm45507037423408.html | 77 + .../info_parser/read_inf_idm45507037753408.html | 78 + .../info_parser/read_inf_idm45507039400208.html | 87 + .../info_parser/read_inf_idm45507043140816.html | 88 + .../info_parser/read_info_idp104306320.html | 77 - .../info_parser/read_info_idp156124912.html | 88 - .../info_parser/read_info_idp212307632.html | 78 - .../info_parser/read_info_idp99726240.html | 87 - .../info_parser/write_in_idm45506993828208.html | 86 + .../info_parser/write_in_idm45507043418960.html | 85 + .../info_parser/write_info_idp205409920.html | 85 - .../info_parser/write_info_idp217672016.html | 86 - .../property_tree/ini_parser/ini_parser_error.html | 14 +- .../ini_parser/read_ini_idm45507095400496.html | 105 + .../ini_parser/read_ini_idm45507111553808.html | 101 + .../ini_parser/read_ini_idp101407088.html | 101 - .../ini_parser/read_ini_idp230717168.html | 105 - .../property_tree/ini_parser/validate_flags.html | 8 +- .../ini_parser/write_in_idm45506981221152.html | 116 + .../ini_parser/write_in_idm45507103416992.html | 124 + .../ini_parser/write_ini_idp155201728.html | 116 - .../ini_parser/write_ini_idp205666256.html | 124 - doc/html/boost/property_tree/iptree.html | 2 +- .../json_parser/read_jso_idm45506991936080.html | 122 + .../json_parser/read_jso_idm45507048694352.html | 118 + .../json_parser/read_json_idp110658880.html | 118 - .../json_parser/read_json_idp205445056.html | 122 - .../json_parser/write_js_idm45506991747200.html | 109 + .../json_parser/write_js_idm45507045482448.html | 114 + .../json_parser/write_json_idp106721152.html | 114 - .../json_parser/write_json_idp214458256.html | 109 - .../property_tree/load_idm45507150470080.html | 104 + .../boost/property_tree/load_idp205463792.html | 104 - doc/html/boost/property_tree/path.html | 4 +- .../property_tree/path_of__idm45507049288992.html | 56 + .../property_tree/path_of_std_b_idp106753552.html | 56 - doc/html/boost/property_tree/ptree.html | 2 +- doc/html/boost/property_tree/ptree_bad_data.html | 22 +- doc/html/boost/property_tree/ptree_bad_path.html | 22 +- doc/html/boost/property_tree/ptree_error.html | 12 +- .../property_tree/save_idm45507111019696.html | 104 + .../boost/property_tree/save_idp154187280.html | 104 - .../property_tree/serializ_idm45506988487232.html | 88 + .../boost/property_tree/serialize_idp98162352.html | 88 - .../boost/property_tree/stream_translator.html | 30 +- doc/html/boost/property_tree/string_path.html | 214 ++ .../property_tree/swap_idm45507111027024.html | 57 + doc/html/boost/property_tree/swap_idp92371152.html | 57 - .../property_tree/translat_idm45506990189296.html | 55 + .../property_tree/translat_idm45507038344480.html | 55 + .../property_tree/translat_idm45507040148096.html | 55 + .../property_tree/translator_be_idp205820704.html | 55 - .../property_tree/translator_be_idp207680880.html | 55 - .../property_tree/translator_be_idp215878496.html | 55 - doc/html/boost/property_tree/wiptree.html | 8 +- doc/html/boost/property_tree/wpath.html | 4 +- doc/html/boost/property_tree/wptree.html | 2 +- .../xml_parser/read_xml_idm45506995203264.html | 122 + .../xml_parser/read_xml_idm45507044821152.html | 125 + .../xml_parser/read_xml_idp150019456.html | 122 - .../xml_parser/read_xml_idp205787136.html | 125 - .../xml_parser/write_xm_idm45506983166032.html | 100 + .../xml_parser/write_xm_idm45507092216384.html | 96 + .../xml_parser/write_xml_idp157243712.html | 96 - .../xml_parser/write_xml_idp163670112.html | 100 - doc/html/boost/proto/N.html | 2 +- doc/html/boost/proto/_.html | 12 +- doc/html/boost/proto/_/impl.html | 18 +- doc/html/boost/proto/_byref.html | 30 +- .../proto/_byref/result_T_idm45506990745920.html | 55 + .../proto/_byref/result_T_idm45506990750288.html | 55 + .../proto/_byref/result_This_T_idp212547664.html | 55 - .../proto/_byref/result_This_T_idp212552032.html | 55 - doc/html/boost/proto/_byval.html | 32 +- .../proto/_byval/result_T_idm45506990714496.html | 55 + .../proto/_byval/result_T_idm45506990718128.html | 53 + .../proto/_byval/result_T_idm45506990721776.html | 53 + .../proto/_byval/result_This_T_idp212579824.html | 53 - .../proto/_byval/result_This_T_idp212583456.html | 55 - .../proto/_byval/result_This_b_idp212576176.html | 53 - doc/html/boost/proto/_child_c.html | 6 +- doc/html/boost/proto/_child_c/impl.html | 20 +- doc/html/boost/proto/_data.html | 2 +- doc/html/boost/proto/_data/impl.html | 6 +- doc/html/boost/proto/_default.html | 6 +- doc/html/boost/proto/_default/impl.html | 68 +- doc/html/boost/proto/_env.html | 6 +- doc/html/boost/proto/_env/impl.html | 18 +- doc/html/boost/proto/_env_var.html | 12 +- doc/html/boost/proto/_env_var/impl.html | 20 +- doc/html/boost/proto/_expr.html | 12 +- doc/html/boost/proto/_expr/impl.html | 18 +- doc/html/boost/proto/_state.html | 6 +- doc/html/boost/proto/_state/impl.html | 18 +- doc/html/boost/proto/_value.html | 6 +- doc/html/boost/proto/_value/impl.html | 20 +- doc/html/boost/proto/_void.html | 6 +- doc/html/boost/proto/_void/impl.html | 18 +- doc/html/boost/proto/address_of.html | 2 +- doc/html/boost/proto/address_of/impl.html | 6 +- doc/html/boost/proto/and_.html | 6 +- doc/html/boost/proto/and_/impl.html | 18 +- doc/html/boost/proto/arity_of.html | 6 +- .../boost/proto/as_child_idm45506990983408.html | 88 + doc/html/boost/proto/as_child_idp227418704.html | 88 - doc/html/boost/proto/as_env_idm45506990359280.html | 79 + doc/html/boost/proto/as_env_idp212938672.html | 79 - .../boost/proto/as_expr_idm45506991005376.html | 88 + doc/html/boost/proto/as_expr_idp227396736.html | 88 - doc/html/boost/proto/assert_matches.html | 8 +- doc/html/boost/proto/assert_matches_not.html | 2 +- doc/html/boost/proto/assign.html | 2 +- doc/html/boost/proto/assign/impl.html | 6 +- doc/html/boost/proto/basic_default_generator.html | 6 +- doc/html/boost/proto/basic_expr.html | 32 +- doc/html/boost/proto/binary_expr.html | 2 +- doc/html/boost/proto/binary_expr/impl.html | 6 +- doc/html/boost/proto/bitwise_and.html | 2 +- doc/html/boost/proto/bitwise_and/impl.html | 6 +- doc/html/boost/proto/bitwise_and_assign.html | 2 +- doc/html/boost/proto/bitwise_and_assign/impl.html | 6 +- doc/html/boost/proto/bitwise_or.html | 2 +- doc/html/boost/proto/bitwise_or/impl.html | 6 +- doc/html/boost/proto/bitwise_or_assign.html | 2 +- doc/html/boost/proto/bitwise_or_assign/impl.html | 6 +- doc/html/boost/proto/bitwise_xor.html | 2 +- doc/html/boost/proto/bitwise_xor/impl.html | 6 +- doc/html/boost/proto/bitwise_xor_assign.html | 2 +- doc/html/boost/proto/bitwise_xor_assign/impl.html | 6 +- doc/html/boost/proto/by_value_generator.html | 26 +- .../result_T_idm45506975265200.html | 55 + .../result_This_E_idp204758176.html | 55 - doc/html/boost/proto/call.html | 12 +- doc/html/boost/proto/call/impl.html | 20 +- doc/html/boost/proto/callable.html | 2 +- .../boost/proto/child_c_idm45506990932896.html | 92 + doc/html/boost/proto/child_c_idp227469216.html | 92 - doc/html/boost/proto/child_idm45506990961392.html | 114 + doc/html/boost/proto/child_idp227440720.html | 114 - doc/html/boost/proto/comma.html | 2 +- doc/html/boost/proto/comma/impl.html | 6 +- doc/html/boost/proto/complement.html | 2 +- doc/html/boost/proto/complement/impl.html | 6 +- doc/html/boost/proto/compose_generators.html | 22 +- .../result_T_idm45506975247184.html | 57 + .../result_This_E_idp224772464.html | 57 - doc/html/boost/proto/context/callable_context.html | 2 +- .../boost/proto/context/callable_context/eval.html | 8 +- doc/html/boost/proto/context/callable_eval.html | 18 +- doc/html/boost/proto/context/default_context.html | 2 +- .../boost/proto/context/default_context/eval.html | 6 +- doc/html/boost/proto/context/default_eval.html | 62 +- doc/html/boost/proto/context/null_context.html | 4 +- .../boost/proto/context/null_context/eval.html | 6 +- doc/html/boost/proto/context/null_eval.html | 14 +- doc/html/boost/proto/convertible_to.html | 2 +- doc/html/boost/proto/data.html | 8 +- doc/html/boost/proto/data_type.html | 18 +- doc/html/boost/proto/deduce_domain.html | 6 +- .../boost/proto/deep_cop_idm45506996666736.html | 77 + doc/html/boost/proto/deep_copy_idp215592560.html | 77 - doc/html/boost/proto/default_generator.html | 24 +- .../result_T_idm45506975321328.html | 55 + .../result_This_E_idp204702048.html | 55 - doc/html/boost/proto/dereference.html | 2 +- doc/html/boost/proto/dereference/impl.html | 6 +- .../boost/proto/display__idm45506996767344.html | 91 + .../boost/proto/display_expr_idp215492336.html | 91 - doc/html/boost/proto/divides.html | 2 +- doc/html/boost/proto/divides/impl.html | 6 +- doc/html/boost/proto/divides_assign.html | 2 +- doc/html/boost/proto/divides_assign/impl.html | 6 +- doc/html/boost/proto/domain.html | 16 +- doc/html/boost/proto/domain/as_child.html | 18 +- doc/html/boost/proto/domain/as_expr.html | 18 +- doc/html/boost/proto/domain_of.html | 2 +- doc/html/boost/proto/empty_env.html | 12 +- doc/html/boost/proto/env.html | 18 +- .../boost/proto/env_var_idm45506984357536.html | 77 + doc/html/boost/proto/env_var_idp212966112.html | 77 - doc/html/boost/proto/equal_to.html | 2 +- doc/html/boost/proto/equal_to/impl.html | 6 +- doc/html/boost/proto/eval_idm45506996501744.html | 92 + doc/html/boost/proto/eval_idp203813264.html | 92 - doc/html/boost/proto/exact.html | 2 +- doc/html/boost/proto/expr.html | 66 +- doc/html/boost/proto/expr/result.html | 8 +- doc/html/boost/proto/extends.html | 80 +- doc/html/boost/proto/extends/result.html | 8 +- doc/html/boost/proto/external_transform.html | 2 +- doc/html/boost/proto/external_transforms.html | 2 +- doc/html/boost/proto/external_transforms/when.html | 6 +- .../boost/proto/flatten_idm45506975343680.html | 69 + doc/html/boost/proto/flatten_idp204679696.html | 69 - doc/html/boost/proto/fold.html | 6 +- doc/html/boost/proto/fold/impl.html | 18 +- doc/html/boost/proto/fold_tree.html | 2 +- doc/html/boost/proto/fold_tree/impl.html | 6 +- doc/html/boost/proto/function.html | 2 +- doc/html/boost/proto/function/impl.html | 6 +- doc/html/boost/proto/functional/advance.html | 18 +- doc/html/boost/proto/functional/as_child.html | 30 +- .../as_child/result_T_idm45506973673760.html | 55 + .../as_child/result_This_T_idp208626464.html | 55 - doc/html/boost/proto/functional/as_env.html | 18 +- doc/html/boost/proto/functional/as_env/result.html | 14 +- doc/html/boost/proto/functional/as_expr.html | 28 +- .../as_expr/result_T_idm45506973695920.html | 55 + .../as_expr/result_This_T_idp208604304.html | 55 - doc/html/boost/proto/functional/at.html | 24 +- .../functional/at/result_T_idm45506975827424.html | 57 + .../functional/at/result_This_S_idp204195952.html | 57 - doc/html/boost/proto/functional/begin.html | 26 +- .../begin/result_T_idm45506975669312.html | 56 + .../begin/result_This_R_idp204354064.html | 56 - doc/html/boost/proto/functional/child.html | 32 +- .../child/result_T_idm45506973622592.html | 53 + .../child/result_This_E_idp208677632.html | 53 - doc/html/boost/proto/functional/child_c.html | 30 +- .../child_c/result_T_idm45506973651728.html | 53 + .../child_c/result_This_E_idp208648496.html | 53 - doc/html/boost/proto/functional/deep_copy.html | 20 +- .../deep_copy/result_T_idm45506996676928.html | 53 + .../deep_copy/result_This_E_idp215582368.html | 53 - doc/html/boost/proto/functional/display_expr.html | 24 +- doc/html/boost/proto/functional/distance.html | 22 +- .../distance/result_T_idm45506975522832.html | 59 + .../distance/result_This_I_idp204500544.html | 59 - doc/html/boost/proto/functional/empty.html | 18 +- doc/html/boost/proto/functional/end.html | 24 +- .../functional/end/result_T_idm45506975629344.html | 56 + .../functional/end/result_This_R_idp204394032.html | 56 - doc/html/boost/proto/functional/env_var.html | 14 +- .../boost/proto/functional/env_var/result.html | 14 +- doc/html/boost/proto/functional/eval.html | 24 +- .../eval/result_T_idm45506996531472.html | 58 + .../eval/result_This_E_idp215726640.html | 58 - doc/html/boost/proto/functional/first.html | 36 +- .../first/result_T_idm45506975424160.html | 55 + .../first/result_T_idm45506975428480.html | 55 + .../first/result_T_idm45506975432800.html | 55 + .../first/result_This_P_idp204590576.html | 55 - .../first/result_This_P_idp204594896.html | 55 - .../first/result_This_P_idp204599216.html | 55 - doc/html/boost/proto/functional/flatten.html | 28 +- .../flatten/result_T_idm45506975366000.html | 53 + .../flatten/result_T_idm45506975370048.html | 53 + .../flatten/result_This_E_idp204653328.html | 53 - .../flatten/result_This_E_idp204657376.html | 53 - doc/html/boost/proto/functional/has_env_var.html | 14 +- .../boost/proto/functional/has_env_var/result.html | 14 +- doc/html/boost/proto/functional/left.html | 30 +- .../left/result_T_idm45506973573376.html | 53 + .../left/result_This_E_idp226498320.html | 53 - doc/html/boost/proto/functional/make_expr.html | 28 +- .../make_expr/result_T_idm45506975157536.html | 54 + .../make_expr/result_This_A_idp224862112.html | 54 - doc/html/boost/proto/functional/make_pair.html | 24 +- .../make_pair/result_T_idm45506975449936.html | 58 + .../make_pair/result_This_F_idp204573440.html | 58 - doc/html/boost/proto/functional/next.html | 32 +- .../next/result_T_idm45506975502464.html | 57 + .../next/result_T_idm45506975506896.html | 57 + .../next/result_This_F_idp204516480.html | 57 - .../next/result_This_F_idp204520912.html | 57 - doc/html/boost/proto/functional/pop_back.html | 28 +- .../pop_back/result_T_idm45506975795264.html | 53 + .../pop_back/result_T_idm45506975799312.html | 53 + .../pop_back/result_This_S_idp204224064.html | 53 - .../pop_back/result_This_S_idp204228112.html | 53 - doc/html/boost/proto/functional/pop_front.html | 28 +- .../pop_front/result_T_idm45506975765328.html | 53 + .../pop_front/result_T_idm45506975769376.html | 53 + .../pop_front/result_This_S_idp204254000.html | 53 - .../pop_front/result_This_S_idp204258048.html | 53 - doc/html/boost/proto/functional/prior.html | 32 +- .../prior/result_T_idm45506975476896.html | 57 + .../prior/result_T_idm45506975481312.html | 57 + .../prior/result_This_B_idp204542064.html | 57 - .../prior/result_This_B_idp204546480.html | 57 - doc/html/boost/proto/functional/push_back.html | 22 +- .../push_back/result_T_idm45506975741456.html | 57 + .../push_back/result_This_S_idp204281920.html | 57 - doc/html/boost/proto/functional/push_front.html | 22 +- .../push_front/result_T_idm45506975719776.html | 57 + .../push_front/result_This_S_idp204303600.html | 57 - doc/html/boost/proto/functional/rbegin.html | 26 +- .../rbegin/result_T_idm45506975605520.html | 56 + .../rbegin/result_This_R_idp204417856.html | 56 - doc/html/boost/proto/functional/rend.html | 26 +- .../rend/result_T_idm45506975581680.html | 56 + .../rend/result_This_R_idp204441696.html | 56 - doc/html/boost/proto/functional/reverse.html | 28 +- .../reverse/result_T_idm45506975693040.html | 53 + .../reverse/result_T_idm45506975697088.html | 53 + .../reverse/result_This_S_idp204326288.html | 53 - .../reverse/result_This_S_idp204330336.html | 53 - doc/html/boost/proto/functional/right.html | 30 +- .../right/result_T_idm45506973548368.html | 53 + .../right/result_This_E_idp226523328.html | 53 - doc/html/boost/proto/functional/second.html | 36 +- .../second/result_T_idm45506975395760.html | 55 + .../second/result_T_idm45506975400080.html | 55 + .../second/result_T_idm45506975404400.html | 55 + .../second/result_This_P_idp204618976.html | 55 - .../second/result_This_P_idp204623296.html | 55 - .../second/result_This_P_idp204627616.html | 55 - doc/html/boost/proto/functional/size.html | 22 +- .../size/result_T_idm45506975557840.html | 57 + .../size/result_This_R_idp204465536.html | 57 - doc/html/boost/proto/functional/unpack_expr.html | 30 +- .../unpack_expr/result_T_idm45506975133408.html | 59 + .../unpack_expr/result_This_S_idp224886240.html | 59 - doc/html/boost/proto/functional/value.html | 30 +- .../value/result_T_idm45506973597312.html | 53 + .../value/result_This_E_idp208702912.html | 53 - doc/html/boost/proto/generator.html | 22 +- .../generator/result_T_idm45506975300688.html | 55 + .../generator/result_This_E_idp204722688.html | 55 - doc/html/boost/proto/greater.html | 2 +- doc/html/boost/proto/greater/impl.html | 6 +- doc/html/boost/proto/greater_equal.html | 2 +- doc/html/boost/proto/greater_equal/impl.html | 6 +- .../boost/proto/has_env__idm45506984371088.html | 78 + doc/html/boost/proto/has_env_var_idp212952560.html | 78 - doc/html/boost/proto/if_.html | 6 +- doc/html/boost/proto/if_/impl.html | 18 +- doc/html/boost/proto/if_else_.html | 2 +- doc/html/boost/proto/if_else_/impl.html | 6 +- doc/html/boost/proto/integral_c.html | 6 +- doc/html/boost/proto/integral_c/impl.html | 18 +- doc/html/boost/proto/is_aggregate.html | 2 +- doc/html/boost/proto/is_callable.html | 2 +- doc/html/boost/proto/is_domain.html | 2 +- doc/html/boost/proto/is_env.html | 2 +- doc/html/boost/proto/is_expr.html | 2 +- doc/html/boost/proto/is_proto_expr.html | 2 +- doc/html/boost/proto/is_transform.html | 2 +- doc/html/boost/proto/lazy.html | 6 +- doc/html/boost/proto/lazy/impl.html | 20 +- doc/html/boost/proto/left_idm45506990901376.html | 88 + doc/html/boost/proto/left_idp227500736.html | 88 - doc/html/boost/proto/less.html | 2 +- doc/html/boost/proto/less/impl.html | 6 +- doc/html/boost/proto/less_equal.html | 2 +- doc/html/boost/proto/less_equal/impl.html | 6 +- doc/html/boost/proto/listN.html | 2 +- doc/html/boost/proto/lit.html | 2 +- doc/html/boost/proto/literal.html | 38 +- doc/html/boost/proto/logical_and.html | 2 +- doc/html/boost/proto/logical_and/impl.html | 6 +- doc/html/boost/proto/logical_not.html | 2 +- doc/html/boost/proto/logical_not/impl.html | 6 +- doc/html/boost/proto/logical_or.html | 2 +- doc/html/boost/proto/logical_or/impl.html | 6 +- doc/html/boost/proto/make.html | 6 +- doc/html/boost/proto/make/impl.html | 20 +- .../boost/proto/make_exp_idm45506975053600.html | 104 + doc/html/boost/proto/make_expr_idp224966048.html | 104 - doc/html/boost/proto/matches.html | 2 +- doc/html/boost/proto/mem_ptr.html | 2 +- doc/html/boost/proto/mem_ptr/impl.html | 6 +- doc/html/boost/proto/minus.html | 2 +- doc/html/boost/proto/minus/impl.html | 6 +- doc/html/boost/proto/minus_assign.html | 2 +- doc/html/boost/proto/minus_assign/impl.html | 6 +- doc/html/boost/proto/modulus.html | 2 +- doc/html/boost/proto/modulus/impl.html | 6 +- doc/html/boost/proto/modulus_assign.html | 2 +- doc/html/boost/proto/modulus_assign/impl.html | 6 +- doc/html/boost/proto/multiplies.html | 2 +- doc/html/boost/proto/multiplies/impl.html | 6 +- doc/html/boost/proto/multiplies_assign.html | 2 +- doc/html/boost/proto/multiplies_assign/impl.html | 6 +- doc/html/boost/proto/nary_expr.html | 2 +- doc/html/boost/proto/nary_expr/impl.html | 6 +- doc/html/boost/proto/negate.html | 2 +- doc/html/boost/proto/negate/impl.html | 6 +- doc/html/boost/proto/noinvoke.html | 2 +- doc/html/boost/proto/not_.html | 6 +- doc/html/boost/proto/not_/impl.html | 18 +- doc/html/boost/proto/not_equal_to.html | 2 +- doc/html/boost/proto/not_equal_to/impl.html | 6 +- doc/html/boost/proto/nullary_expr.html | 6 +- doc/html/boost/proto/nullary_expr/impl.html | 18 +- doc/html/boost/proto/operator__idp212979632.html | 118 - .../boost/proto/operator_idm45506984344016.html | 118 + doc/html/boost/proto/or_.html | 6 +- doc/html/boost/proto/or_/impl.html | 18 +- doc/html/boost/proto/otherwise.html | 8 +- doc/html/boost/proto/pack.html | 2 +- doc/html/boost/proto/pass_through.html | 6 +- doc/html/boost/proto/pass_through/impl.html | 22 +- doc/html/boost/proto/plus.html | 2 +- doc/html/boost/proto/plus/impl.html | 6 +- doc/html/boost/proto/plus_assign.html | 2 +- doc/html/boost/proto/plus_assign/impl.html | 6 +- doc/html/boost/proto/pod_generator.html | 24 +- .../pod_generator/result_T_idm45506975282944.html | 55 + .../pod_generator/result_This_E_idp204740432.html | 55 - doc/html/boost/proto/post_dec.html | 2 +- doc/html/boost/proto/post_dec/impl.html | 6 +- doc/html/boost/proto/post_inc.html | 2 +- doc/html/boost/proto/post_inc/impl.html | 6 +- doc/html/boost/proto/pre_dec.html | 2 +- doc/html/boost/proto/pre_dec/impl.html | 6 +- doc/html/boost/proto/pre_inc.html | 2 +- doc/html/boost/proto/pre_inc/impl.html | 6 +- doc/html/boost/proto/protect.html | 2 +- doc/html/boost/proto/protect/impl.html | 6 +- doc/html/boost/proto/result_of/as_child.html | 4 +- doc/html/boost/proto/result_of/as_env.html | 2 +- doc/html/boost/proto/result_of/as_expr.html | 12 +- doc/html/boost/proto/result_of/child.html | 2 +- doc/html/boost/proto/result_of/child_c.html | 4 +- doc/html/boost/proto/result_of/deep_copy.html | 6 +- doc/html/boost/proto/result_of/env_var.html | 2 +- doc/html/boost/proto/result_of/eval.html | 10 +- doc/html/boost/proto/result_of/flatten.html | 10 +- doc/html/boost/proto/result_of/has_env_var.html | 2 +- doc/html/boost/proto/result_of/left.html | 2 +- .../result_of/make_exp_idm45506975105632.html | 110 + doc/html/boost/proto/result_of/make_expr.html | 16 +- .../result_of/make_expr_Tag_idp224914016.html | 110 - doc/html/boost/proto/result_of/right.html | 2 +- .../result_of/unpack_e_idm45506975065392.html | 73 + doc/html/boost/proto/result_of/unpack_expr.html | 14 +- .../result_of/unpack_expr_T_idp224954256.html | 73 - doc/html/boost/proto/result_of/value.html | 4 +- doc/html/boost/proto/reverse_fold_tree.html | 2 +- doc/html/boost/proto/reverse_fold_tree/impl.html | 6 +- doc/html/boost/proto/right_idm45506990886896.html | 102 + doc/html/boost/proto/right_idp227515216.html | 102 - doc/html/boost/proto/shift_left.html | 2 +- doc/html/boost/proto/shift_left/impl.html | 6 +- doc/html/boost/proto/shift_left_assign.html | 2 +- doc/html/boost/proto/shift_left_assign/impl.html | 6 +- doc/html/boost/proto/shift_right.html | 2 +- doc/html/boost/proto/shift_right/impl.html | 6 +- doc/html/boost/proto/shift_right_assign.html | 2 +- doc/html/boost/proto/shift_right_assign/impl.html | 6 +- doc/html/boost/proto/subscript.html | 2 +- doc/html/boost/proto/subscript/impl.html | 6 +- doc/html/boost/proto/switch_.html | 2 +- doc/html/boost/proto/switch_/impl.html | 6 +- doc/html/boost/proto/tag/terminal.html | 6 +- doc/html/boost/proto/term.html | 2 +- doc/html/boost/proto/terminal.html | 6 +- doc/html/boost/proto/terminal/impl.html | 18 +- doc/html/boost/proto/transform.html | 46 +- .../transform/result_T_idm45506984144464.html | 55 + .../transform/result_T_idm45506984149872.html | 55 + .../transform/result_T_idm45506984155152.html | 55 + .../transform/result_This_E_idp213168496.html | 55 - .../transform/result_This_E_idp213173776.html | 55 - .../transform/result_This_E_idp213179184.html | 55 - doc/html/boost/proto/transform_impl.html | 6 +- doc/html/boost/proto/transforms.html | 2 +- doc/html/boost/proto/transforms_type.html | 18 +- doc/html/boost/proto/unary_expr.html | 2 +- doc/html/boost/proto/unary_expr/impl.html | 6 +- doc/html/boost/proto/unary_plus.html | 2 +- doc/html/boost/proto/unary_plus/impl.html | 6 +- doc/html/boost/proto/unexpr.html | 8 +- .../boost/proto/unpack_e_idm45506975022288.html | 128 + doc/html/boost/proto/unpack_expr_idp224997360.html | 128 - doc/html/boost/proto/use_basic_expr.html | 8 +- doc/html/boost/proto/value_idm45506990913840.html | 84 + doc/html/boost/proto/value_idp227488272.html | 84 - doc/html/boost/proto/vararg.html | 2 +- doc/html/boost/proto/wants_basic_expr.html | 2 +- doc/html/boost/proto/when.html | 8 +- .../boost/proto/when_Gra_idm45506983606192.html | 93 + .../proto/when_Gra_idm45506983606192/impl.html | 73 + .../boost/proto/when_Gra_idm45506983649024.html | 95 + .../proto/when_Gra_idm45506983649024/impl.html | 126 + .../boost/proto/when_Gra_idm45506983690064.html | 89 + .../proto/when_Gra_idm45506983690064/impl.html | 126 + .../boost/proto/when_Gra_idm45506983699520.html | 67 + .../boost/proto/when_Grammar__idp209631056.html | 67 - .../boost/proto/when_Grammar__idp209640512.html | 89 - .../proto/when_Grammar__idp209640512/impl.html | 126 - .../boost/proto/when_Grammar__idp209681552.html | 95 - .../proto/when_Grammar__idp209681552/impl.html | 126 - .../boost/proto/when_Grammar__idp209724384.html | 93 - .../proto/when_Grammar__idp209724384/impl.html | 73 - doc/html/boost/random/additive_combine_engine.html | 98 +- doc/html/boost/random/bernoulli_distribution.html | 88 +- .../random/bernoulli_distribution/param_type.html | 46 +- doc/html/boost/random/beta_distribution.html | 94 +- .../boost/random/beta_distribution/param_type.html | 50 +- doc/html/boost/random/binomial_distribution.html | 94 +- .../random/binomial_distribution/param_type.html | 50 +- doc/html/boost/random/cauchy_distribution.html | 106 +- .../random/cauchy_distribution/param_type.html | 58 +- .../boost/random/chi_squared_distribution.html | 88 +- .../chi_squared_distribution/param_type.html | 46 +- doc/html/boost/random/discard_block_engine.html | 102 +- doc/html/boost/random/discrete_distribution.html | 112 +- .../random/discrete_distribution/param_type.html | 62 +- doc/html/boost/random/ecuyer1988.html | 2 +- .../boost/random/exponential_distribution.html | 88 +- .../exponential_distribution/param_type.html | 46 +- .../boost/random/extreme_value_distribution.html | 94 +- .../extreme_value_distribution/param_type.html | 50 +- doc/html/boost/random/fisher_f_distribution.html | 94 +- .../random/fisher_f_distribution/param_type.html | 50 +- doc/html/boost/random/gamma_distribution.html | 94 +- .../random/gamma_distribution/param_type.html | 52 +- doc/html/boost/random/generate_canonical.html | 56 + doc/html/boost/random/geometric_distribution.html | 94 +- .../random/geometric_distribution/param_type.html | 48 +- doc/html/boost/random/hellekalek1995.html | 10 +- .../boost/random/hyperexp_idm45507086672304.html | 690 +++++ .../hyperexp_idm45507086672304/param_type.html | 480 ++++ doc/html/boost/random/independent_bits_engine.html | 111 +- .../boost/random/inversiv_idm45507090852608.html | 213 ++ .../boost/random/inversive_con_idp161302576.html | 213 -- doc/html/boost/random/knuth_b.html | 2 +- doc/html/boost/random/kreutzer1986.html | 2 +- doc/html/boost/random/lagged_fibonacci1279.html | 2 +- doc/html/boost/random/lagged_fibonacci19937.html | 2 +- doc/html/boost/random/lagged_fibonacci2281.html | 2 +- doc/html/boost/random/lagged_fibonacci23209.html | 2 +- doc/html/boost/random/lagged_fibonacci3217.html | 2 +- doc/html/boost/random/lagged_fibonacci4423.html | 2 +- doc/html/boost/random/lagged_fibonacci44497.html | 2 +- doc/html/boost/random/lagged_fibonacci607.html | 2 +- doc/html/boost/random/lagged_fibonacci9689.html | 2 +- .../boost/random/lagged_fibonacci_01_engine.html | 90 +- doc/html/boost/random/lagged_fibonacci_engine.html | 90 +- doc/html/boost/random/laplace_distribution.html | 96 +- .../random/laplace_distribution/param_type.html | 50 +- .../boost/random/linear_congruential_engine.html | 82 +- .../boost/random/linear_f_idm45507041557328.html | 206 ++ .../boost/random/linear_feedba_idp109235664.html | 206 -- doc/html/boost/random/lognormal_distribution.html | 102 +- .../random/lognormal_distribution/param_type.html | 50 +- doc/html/boost/random/mersenne_twister_engine.html | 90 +- doc/html/boost/random/minstd_rand.html | 8 +- doc/html/boost/random/minstd_rand0.html | 2 +- doc/html/boost/random/mt11213b.html | 2 +- doc/html/boost/random/mt19937.html | 2 +- .../boost/random/negative_binom_idp94123888.html | 206 -- .../negative_binom_idp94123888/param_type.html | 128 - .../boost/random/negative_idm45506979396656.html | 206 ++ .../negative_idm45506979396656/param_type.html | 128 + .../boost/random/non_cent_idm45506980906800.html | 212 ++ .../non_cent_idm45506980906800/param_type.html | 129 + .../boost/random/non_central_c_idp150001424.html | 212 -- .../non_central_c_idp150001424/param_type.html | 129 - doc/html/boost/random/normal_distribution.html | 102 +- .../random/normal_distribution/param_type.html | 52 +- .../boost/random/piecewis_idm45506986764736.html | 253 ++ .../piecewis_idm45506986764736/param_type.html | 161 ++ .../boost/random/piecewis_idm45507043304112.html | 253 ++ .../piecewis_idm45507043304112/param_type.html | 161 ++ .../boost/random/piecewise_cons_idp94191504.html | 253 -- .../piecewise_cons_idp94191504/param_type.html | 161 -- .../boost/random/piecewise_lin_idp226179472.html | 253 -- .../piecewise_lin_idp226179472/param_type.html | 161 -- doc/html/boost/random/poisson_distribution.html | 96 +- .../random/poisson_distribution/param_type.html | 46 +- doc/html/boost/random/rand48.html | 90 +- doc/html/boost/random/random_device.html | 48 +- doc/html/boost/random/random_number_generator.html | 18 +- doc/html/boost/random/ranlux3.html | 2 +- doc/html/boost/random/ranlux3_01.html | 2 +- doc/html/boost/random/ranlux4.html | 2 +- doc/html/boost/random/ranlux4_01.html | 2 +- doc/html/boost/random/ranlux64_3.html | 2 +- doc/html/boost/random/ranlux64_3_01.html | 2 +- doc/html/boost/random/ranlux64_4.html | 2 +- doc/html/boost/random/ranlux64_4_01.html | 2 +- doc/html/boost/random/seed_seq.html | 38 +- doc/html/boost/random/shuffle_order_engine.html | 102 +- doc/html/boost/random/student_t_distribution.html | 90 +- .../random/student_t_distribution/param_type.html | 48 +- .../boost/random/subtract_idm45507048596384.html | 205 ++ .../boost/random/subtract_with_carry_engine.html | 96 +- .../boost/random/subtract_with_idp162145280.html | 205 -- doc/html/boost/random/taus88.html | 10 +- doc/html/boost/random/traits/is_integral.html | 53 + doc/html/boost/random/traits/is_signed.html | 53 + doc/html/boost/random/traits/make_unsigned.html | 56 + .../random/traits/make_unsigned_or_unbounded.html | 56 + doc/html/boost/random/triangle_distribution.html | 106 +- .../random/triangle_distribution/param_type.html | 54 +- doc/html/boost/random/uniform_01.html | 24 +- .../boost/random/uniform_int_distribution.html | 94 +- .../uniform_int_distribution/param_type.html | 50 +- doc/html/boost/random/uniform_on_sphere.html | 88 +- .../boost/random/uniform_on_sphere/param_type.html | 46 +- .../boost/random/uniform_real_distribution.html | 94 +- .../uniform_real_distribution/param_type.html | 50 +- doc/html/boost/random/uniform_smallint.html | 100 +- .../boost/random/uniform_smallint/param_type.html | 50 +- doc/html/boost/random/weibull_distribution.html | 96 +- .../random/weibull_distribution/param_type.html | 50 +- doc/html/boost/random/xor_combine_engine.html | 102 +- doc/html/boost/recursive_wrapper.html | 66 +- doc/html/boost/relaxed_get.html | 4 +- doc/html/boost/signal.html | 10 +- doc/html/boost/signalN.html | 80 +- doc/html/boost/signals/connection.html | 88 +- doc/html/boost/signals/scoped_connection.html | 32 +- doc/html/boost/signals/trackable.html | 20 +- doc/html/boost/signals2/connection.html | 96 +- doc/html/boost/signals2/deconstruct.html | 4 +- doc/html/boost/signals2/deconstruct_access.html | 2 +- doc/html/boost/signals2/dummy_mutex.html | 14 +- doc/html/boost/signals2/expired_slot.html | 6 +- .../boost/signals2/keywords/combiner_type.html | 2 +- .../keywords/extended_idm45506999542128.html | 62 + .../keywords/extended_slot_idp156345840.html | 62 - .../signals2/keywords/group_compare_type.html | 2 +- doc/html/boost/signals2/keywords/group_type.html | 2 +- doc/html/boost/signals2/keywords/mutex_type.html | 8 +- .../boost/signals2/keywords/signature_type.html | 2 +- .../signals2/keywords/slot_function_type.html | 8 +- .../boost/signals2/last_val_idm45507040057344.html | 86 + doc/html/boost/signals2/last_value.html | 22 +- .../boost/signals2/last_value_vo_idp102752128.html | 86 - doc/html/boost/signals2/mutex.html | 14 +- doc/html/boost/signals2/no_slots_error.html | 12 +- .../boost/signals2/optional_idm45507099693904.html | 87 + .../boost/signals2/optional_last_idp219889824.html | 87 - doc/html/boost/signals2/optional_last_value.html | 22 +- .../boost/signals2/postconstructor_invoker.html | 34 +- doc/html/boost/signals2/scoped_connection.html | 78 +- .../boost/signals2/shared_connection_block.html | 66 +- doc/html/boost/signals2/signal.html | 120 +- doc/html/boost/signals2/signal/arg.html | 6 +- doc/html/boost/signals2/signal_base.html | 8 +- doc/html/boost/signals2/signal_type.html | 6 +- doc/html/boost/signals2/slot.html | 80 +- doc/html/boost/signals2/slot/arg.html | 6 +- doc/html/boost/signals2/slot_base.html | 16 +- doc/html/boost/signals2/trackable.html | 22 +- doc/html/boost/slot.html | 8 +- doc/html/boost/static_visitor.html | 2 +- doc/html/boost/strict_get.html | 8 +- doc/html/boost/swap_idm45506893508496.html | 73 + doc/html/boost/swap_idm45507162621920.html | 72 + doc/html/boost/swap_idm45713141975568.html | 105 + doc/html/boost/swap_idp24893216.html | 105 - doc/html/boost/swap_idp312897248.html | 73 - doc/html/boost/swap_idp45208528.html | 72 - doc/html/boost/type_erasure/_a.html | 6 +- doc/html/boost/type_erasure/_self.html | 4 +- doc/html/boost/type_erasure/add_assignable.html | 12 +- doc/html/boost/type_erasure/addable.html | 12 +- doc/html/boost/type_erasure/any.html | 615 +++++ .../type_erasure/any_Conc_idm45506890943856.html | 572 ++++ .../type_erasure/any_Conc_idm45506978000544.html | 546 ++++ .../type_erasure/any_Conc_idm45506987109008.html | 487 ++++ .../type_erasure/any_Concept___idp199875792.html | 546 ---- .../type_erasure/any_Concept___idp305335072.html | 487 ---- .../type_erasure/any_Concept___idp307465440.html | 572 ---- .../type_erasure/any_cast_idm45506900398752.html | 95 + .../boost/type_erasure/any_cast_idp99227696.html | 95 - doc/html/boost/type_erasure/as_param.html | 14 +- doc/html/boost/type_erasure/assignable.html | 14 +- doc/html/boost/type_erasure/bad_any_cast.html | 10 +- doc/html/boost/type_erasure/bad_function_call.html | 10 +- doc/html/boost/type_erasure/binding.html | 269 ++ doc/html/boost/type_erasure/binding_of.html | 12 +- doc/html/boost/type_erasure/bitand_assignable.html | 12 +- doc/html/boost/type_erasure/bitandable.html | 12 +- doc/html/boost/type_erasure/bitor_assignable.html | 12 +- doc/html/boost/type_erasure/bitorable.html | 12 +- doc/html/boost/type_erasure/bitxor_assignable.html | 12 +- doc/html/boost/type_erasure/bitxorable.html | 12 +- .../boost/type_erasure/call_idm45506884907840.html | 87 + doc/html/boost/type_erasure/call_idp314765536.html | 87 - doc/html/boost/type_erasure/callable.html | 20 +- doc/html/boost/type_erasure/check_match.html | 4 +- doc/html/boost/type_erasure/complementable.html | 14 +- doc/html/boost/type_erasure/concept_interface.html | 8 +- doc/html/boost/type_erasure/concept_of.html | 4 +- doc/html/boost/type_erasure/constructible.html | 14 +- .../boost/type_erasure/copy_constructible.html | 2 +- doc/html/boost/type_erasure/decrementable.html | 14 +- doc/html/boost/type_erasure/deduced.html | 2 +- doc/html/boost/type_erasure/dereferenceable.html | 12 +- doc/html/boost/type_erasure/derived.html | 10 +- doc/html/boost/type_erasure/destructible.html | 6 +- doc/html/boost/type_erasure/dividable.html | 12 +- doc/html/boost/type_erasure/divide_assignable.html | 12 +- doc/html/boost/type_erasure/dynamic_any_cast.html | 103 + doc/html/boost/type_erasure/dynamic_binding.html | 73 + .../boost/type_erasure/equality_comparable.html | 12 +- .../boost/type_erasure/get_idm45506890832112.html | 58 + doc/html/boost/type_erasure/get_idp200238016.html | 58 - doc/html/boost/type_erasure/incrementable.html | 14 +- doc/html/boost/type_erasure/is_empty.html | 4 +- doc/html/boost/type_erasure/is_placeholder.html | 2 +- doc/html/boost/type_erasure/is_relaxed.html | 8 +- doc/html/boost/type_erasure/is_subconcept.html | 4 +- doc/html/boost/type_erasure/istreamable.html | 14 +- doc/html/boost/type_erasure/iterator.html | 4 +- .../boost/type_erasure/left_shift_assignable.html | 12 +- doc/html/boost/type_erasure/left_shiftable.html | 12 +- .../boost/type_erasure/less_than_comparable.html | 12 +- doc/html/boost/type_erasure/make_binding.html | 2 +- doc/html/boost/type_erasure/mod_assignable.html | 12 +- doc/html/boost/type_erasure/modable.html | 12 +- doc/html/boost/type_erasure/multipliable.html | 12 +- .../boost/type_erasure/multiply_assignable.html | 12 +- doc/html/boost/type_erasure/negatable.html | 14 +- doc/html/boost/type_erasure/ostreamable.html | 14 +- doc/html/boost/type_erasure/param.html | 105 + doc/html/boost/type_erasure/placeholder.html | 6 +- doc/html/boost/type_erasure/placeholder_of.html | 4 +- doc/html/boost/type_erasure/rebind_any.html | 10 +- doc/html/boost/type_erasure/register_binding.html | 57 + doc/html/boost/type_erasure/relaxed.html | 10 +- doc/html/boost/type_erasure/require_match.html | 8 +- .../boost/type_erasure/right_shift_assignable.html | 12 +- doc/html/boost/type_erasure/right_shiftable.html | 12 +- doc/html/boost/type_erasure/same_type.html | 2 +- doc/html/boost/type_erasure/static_binding.html | 2 +- doc/html/boost/type_erasure/subscriptable.html | 12 +- .../boost/type_erasure/subtract_assignable.html | 12 +- doc/html/boost/type_erasure/subtractable.html | 18 +- doc/html/boost/type_erasure/tuple.html | 18 +- doc/html/boost/type_erasure/typeid_.html | 12 +- doc/html/boost/type_erasure/typeid_of.html | 12 +- doc/html/boost/typeindex/ctti_type_index.html | 62 +- .../typeindex/hash_val_idm45506981463280.html | 65 + .../boost/typeindex/hash_value_idp309934480.html | 65 - doc/html/boost/typeindex/stl_type_index.html | 64 +- doc/html/boost/typeindex/type_id.html | 2 +- doc/html/boost/typeindex/type_id_runtime.html | 2 +- doc/html/boost/typeindex/type_id_with_cvr.html | 2 +- doc/html/boost/typeindex/type_index.html | 2 +- doc/html/boost/typeindex/type_index_facade.html | 68 +- doc/html/boost/typeindex/type_info.html | 2 +- doc/html/boost/uninitialized_copy_or_move.html | 2 +- doc/html/boost/uninitialized_move.html | 2 +- doc/html/boost/units/absolute.html | 38 +- doc/html/boost/units/abstract/length_unit_tag.html | 6 +- .../units/abstract/luminous_idm45506849409120.html | 54 + .../units/abstract/luminous_inte_idp349555136.html | 54 - doc/html/boost/units/abstract/mass_unit_tag.html | 6 +- doc/html/boost/units/abstract/time_unit_tag.html | 6 +- .../boost/units/add_type_idm45506851507072.html | 58 + .../boost/units/add_type_idm45506851515280.html | 57 + .../boost/units/add_typeof_he_idp347448976.html | 57 - .../boost/units/add_typeof_he_idp347457184.html | 58 - doc/html/boost/units/add_typeof_helper.html | 12 +- doc/html/boost/units/angle/degree_base_unit.html | 22 +- doc/html/boost/units/angle/gradian_base_unit.html | 16 +- doc/html/boost/units/angle/radian_base_unit.html | 22 +- .../boost/units/angle/steradian_base_unit.html | 24 +- .../astronomical/astronom_idm45506849327696.html | 69 + .../astronomical/astronomical__idp349636496.html | 69 - .../units/astronomical/light_second_base_unit.html | 24 +- .../boost/units/astronomical/parsec_base_unit.html | 22 +- doc/html/boost/units/autoprefix_norm.html | 8 +- doc/html/boost/units/base_dimension.html | 2 +- .../boost/units/base_uni_idm45506848735920.html | 68 + .../boost/units/base_uni_idm45506848744192.html | 68 + .../boost/units/base_uni_idm45506848752480.html | 68 + .../boost/units/base_uni_idm45506848760768.html | 68 + .../boost/units/base_uni_idm45506848789696.html | 68 + .../boost/units/base_uni_idm45506848797968.html | 68 + .../boost/units/base_uni_idm45506848806240.html | 68 + .../boost/units/base_uni_idm45506848814528.html | 68 + .../boost/units/base_uni_idm45506848822800.html | 68 + .../boost/units/base_uni_idm45506848831088.html | 68 + .../boost/units/base_uni_idm45506848839376.html | 68 + .../boost/units/base_uni_idm45506848847648.html | 68 + .../boost/units/base_uni_idm45506848855920.html | 68 + .../boost/units/base_uni_idm45506848864192.html | 68 + .../boost/units/base_uni_idm45506848872480.html | 68 + .../boost/units/base_uni_idm45506848880784.html | 68 + .../boost/units/base_uni_idm45506848889072.html | 68 + .../boost/units/base_uni_idm45506848897344.html | 68 + .../boost/units/base_uni_idm45506848968224.html | 68 + .../boost/units/base_uni_idm45506848982992.html | 68 + .../boost/units/base_uni_idm45506848990896.html | 68 + .../boost/units/base_uni_idm45506849005696.html | 68 + .../boost/units/base_uni_idm45506849013616.html | 68 + .../boost/units/base_uni_idm45506849035296.html | 68 + .../boost/units/base_uni_idm45506849050080.html | 68 + .../boost/units/base_uni_idm45506849057968.html | 68 + .../boost/units/base_uni_idm45506849093376.html | 68 + .../boost/units/base_uni_idm45506849110016.html | 68 + .../boost/units/base_uni_idm45506849118320.html | 68 + .../boost/units/base_uni_idm45506849126624.html | 68 + .../boost/units/base_uni_idm45506849134928.html | 68 + .../boost/units/base_uni_idm45506849143232.html | 68 + .../boost/units/base_uni_idm45506849165328.html | 68 + .../boost/units/base_uni_idm45506849173632.html | 68 + .../boost/units/base_uni_idm45506849181936.html | 68 + .../boost/units/base_uni_idm45506849190240.html | 68 + .../boost/units/base_uni_idm45506849198544.html | 68 + .../boost/units/base_uni_idm45506849206848.html | 68 + .../boost/units/base_uni_idm45506849215152.html | 68 + .../boost/units/base_uni_idm45506849223456.html | 68 + .../boost/units/base_uni_idm45506849231760.html | 68 + .../boost/units/base_uni_idm45506849240064.html | 68 + .../boost/units/base_uni_idm45506849248368.html | 68 + .../boost/units/base_uni_idm45506849256672.html | 68 + .../boost/units/base_uni_idm45506849289360.html | 68 + .../boost/units/base_uni_idm45506849304624.html | 68 + .../boost/units/base_uni_idm45506849312960.html | 68 + .../boost/units/base_uni_idm45506849321312.html | 68 + .../boost/units/base_uni_idm45506849344912.html | 68 + .../boost/units/base_uni_idm45506849373888.html | 68 + .../boost/units/base_uni_idm45506849382192.html | 68 + .../boost/units/base_uni_idm45506849416720.html | 68 + .../boost/units/base_uni_idm45506849420800.html | 68 + .../boost/units/base_uni_idm45506849424880.html | 68 + .../boost/units/base_uni_idm45506849428960.html | 68 + .../boost/units/base_uni_idm45506849433024.html | 68 + .../boost/units/base_uni_idm45506849437104.html | 68 + .../boost/units/base_uni_idm45506849441184.html | 68 + .../boost/units/base_uni_idm45506849445264.html | 68 + .../boost/units/base_uni_idm45506849449344.html | 68 + doc/html/boost/units/base_unit.html | 8 +- .../boost/units/base_unit_inf_idp349514912.html | 68 - .../boost/units/base_unit_inf_idp349518992.html | 68 - .../boost/units/base_unit_inf_idp349523072.html | 68 - .../boost/units/base_unit_inf_idp349527152.html | 68 - .../boost/units/base_unit_inf_idp349531232.html | 68 - .../boost/units/base_unit_inf_idp349535296.html | 68 - .../boost/units/base_unit_inf_idp349539376.html | 68 - .../boost/units/base_unit_inf_idp349543456.html | 68 - .../boost/units/base_unit_inf_idp349547536.html | 68 - .../boost/units/base_unit_inf_idp349582000.html | 68 - .../boost/units/base_unit_inf_idp349590304.html | 68 - .../boost/units/base_unit_inf_idp349619280.html | 68 - .../boost/units/base_unit_inf_idp349642880.html | 68 - .../boost/units/base_unit_inf_idp349651232.html | 68 - .../boost/units/base_unit_inf_idp349659568.html | 68 - .../boost/units/base_unit_inf_idp349674832.html | 68 - .../boost/units/base_unit_inf_idp349707520.html | 68 - .../boost/units/base_unit_inf_idp349715824.html | 68 - .../boost/units/base_unit_inf_idp349724128.html | 68 - .../boost/units/base_unit_inf_idp349732432.html | 68 - .../boost/units/base_unit_inf_idp349740736.html | 68 - .../boost/units/base_unit_inf_idp349749040.html | 68 - .../boost/units/base_unit_inf_idp349757344.html | 68 - .../boost/units/base_unit_inf_idp349765648.html | 68 - .../boost/units/base_unit_inf_idp349773952.html | 68 - .../boost/units/base_unit_inf_idp349782256.html | 68 - .../boost/units/base_unit_inf_idp349790560.html | 68 - .../boost/units/base_unit_inf_idp349798864.html | 68 - .../boost/units/base_unit_inf_idp349820960.html | 68 - .../boost/units/base_unit_inf_idp349829264.html | 68 - .../boost/units/base_unit_inf_idp349837568.html | 68 - .../boost/units/base_unit_inf_idp349845872.html | 68 - .../boost/units/base_unit_inf_idp349854176.html | 68 - .../boost/units/base_unit_inf_idp349870816.html | 68 - .../boost/units/base_unit_inf_idp349906224.html | 68 - .../boost/units/base_unit_inf_idp349914112.html | 68 - .../boost/units/base_unit_inf_idp349928896.html | 68 - .../boost/units/base_unit_inf_idp349950576.html | 68 - .../boost/units/base_unit_inf_idp349958496.html | 68 - .../boost/units/base_unit_inf_idp349973296.html | 68 - .../boost/units/base_unit_inf_idp349981200.html | 68 - .../boost/units/base_unit_inf_idp349995968.html | 68 - .../boost/units/base_unit_inf_idp350066848.html | 68 - .../boost/units/base_unit_inf_idp350075120.html | 68 - .../boost/units/base_unit_inf_idp350083408.html | 68 - .../boost/units/base_unit_inf_idp350091712.html | 68 - .../boost/units/base_unit_inf_idp350100000.html | 68 - .../boost/units/base_unit_inf_idp350108272.html | 68 - .../boost/units/base_unit_inf_idp350116544.html | 68 - .../boost/units/base_unit_inf_idp350124816.html | 68 - .../boost/units/base_unit_inf_idp350133104.html | 68 - .../boost/units/base_unit_inf_idp350141392.html | 68 - .../boost/units/base_unit_inf_idp350149664.html | 68 - .../boost/units/base_unit_inf_idp350157952.html | 68 - .../boost/units/base_unit_inf_idp350166224.html | 68 - .../boost/units/base_unit_inf_idp350174496.html | 68 - .../boost/units/base_unit_inf_idp350203424.html | 68 - .../boost/units/base_unit_inf_idp350211712.html | 68 - .../boost/units/base_unit_inf_idp350220000.html | 68 - .../boost/units/base_unit_inf_idp350228272.html | 68 - doc/html/boost/units/base_unit_info.html | 16 +- doc/html/boost/units/cgs/gram_base_unit.html | 22 +- doc/html/boost/units/conversion_helper.html | 12 +- doc/html/boost/units/dim.html | 2 +- .../boost/units/divide_t_idm45506851716160.html | 55 + .../boost/units/divide_t_idm45506851721056.html | 55 + doc/html/boost/units/divide_typeof_helper.html | 12 +- .../boost/units/divide_typeof_idp347243200.html | 55 - .../boost/units/divide_typeof_idp347248096.html | 55 - .../boost/units/get_dime_idm45506852163616.html | 55 + .../boost/units/get_dime_idm45506852167568.html | 55 + .../boost/units/get_dime_idm45506852170672.html | 55 + doc/html/boost/units/get_dimension.html | 6 +- .../boost/units/get_dimension_idp346793584.html | 55 - .../boost/units/get_dimension_idp346796688.html | 55 - .../boost/units/get_dimension_idp346800640.html | 55 - .../boost/units/get_syst_idm45506852148880.html | 55 + .../boost/units/get_syst_idm45506852152832.html | 55 + .../boost/units/get_syst_idm45506852155936.html | 55 + doc/html/boost/units/get_system.html | 8 +- .../boost/units/get_system_ab_idp346808320.html | 55 - .../boost/units/get_system_qu_idp346811424.html | 55 - .../boost/units/get_system_un_idp346815376.html | 55 - doc/html/boost/units/heterogeneous_system.html | 8 +- doc/html/boost/units/homogeneous_system.html | 2 +- doc/html/boost/units/imperial/pint_base_unit.html | 22 +- doc/html/boost/units/imperial/pound_base_unit.html | 22 +- doc/html/boost/units/imperial/yard_base_unit.html | 24 +- doc/html/boost/units/is_dim.html | 8 +- .../boost/units/is_dim_d_idm45506852017952.html | 53 + .../boost/units/is_dim_dim_T__idp346946304.html | 53 - .../boost/units/is_dimen_idm45506851997280.html | 53 + .../boost/units/is_dimen_idm45506852000672.html | 53 + .../boost/units/is_dimen_idm45506852008320.html | 53 + .../boost/units/is_dimen_idm45506852009984.html | 53 + .../boost/units/is_dimension__idp346954272.html | 53 - .../boost/units/is_dimension__idp346955936.html | 53 - doc/html/boost/units/is_dimension_list.html | 8 +- .../boost/units/is_dimensionl_idp346963584.html | 53 - .../boost/units/is_dimensionl_idp346966976.html | 53 - doc/html/boost/units/is_dimensionless.html | 8 +- .../boost/units/is_dimensionless_quantity.html | 6 +- .../boost/units/is_quant_idm45506851961648.html | 55 + .../boost/units/is_quant_idm45506851971072.html | 55 + .../boost/units/is_quant_idm45506851979664.html | 53 + doc/html/boost/units/is_quantity.html | 6 +- .../boost/units/is_quantity_o_idp346993184.html | 55 - .../boost/units/is_quantity_o_idp347002608.html | 55 - doc/html/boost/units/is_quantity_of_dimension.html | 8 +- doc/html/boost/units/is_quantity_of_system.html | 8 +- .../boost/units/is_quantity_q_idp346984592.html | 53 - doc/html/boost/units/is_unit.html | 8 +- .../boost/units/is_unit__idm45506851928752.html | 53 + .../boost/units/is_unit__idm45506851932112.html | 53 + .../boost/units/is_unit__idm45506851940928.html | 53 + .../boost/units/is_unit__idm45506851944288.html | 53 + .../boost/units/is_unit__idm45506851952848.html | 53 + .../boost/units/is_unit_of_di_idp347019968.html | 53 - .../boost/units/is_unit_of_di_idp347023328.html | 53 - doc/html/boost/units/is_unit_of_dimension.html | 8 +- .../boost/units/is_unit_of_sy_idp347032144.html | 53 - .../boost/units/is_unit_of_sy_idp347035504.html | 53 - doc/html/boost/units/is_unit_of_system.html | 8 +- .../boost/units/is_unit_unit__idp347011408.html | 53 - doc/html/boost/units/length_base_dimension.html | 6 +- .../boost/units/luminous_idm45506850904240.html | 55 + .../boost/units/luminous_inte_idp348060016.html | 55 - doc/html/boost/units/make_dimension_list.html | 2 +- .../boost/units/make_sca_idm45506851596992.html | 55 + .../boost/units/make_sca_idm45506851604096.html | 56 + .../boost/units/make_scaled_u_idp347360160.html | 56 - .../boost/units/make_scaled_u_idp347367264.html | 55 - doc/html/boost/units/make_scaled_unit.html | 8 +- doc/html/boost/units/make_system.html | 8 +- doc/html/boost/units/mass_base_dimension.html | 6 +- doc/html/boost/units/metric/are_base_unit.html | 22 +- .../boost/units/metric/atmosphere_base_unit.html | 16 +- doc/html/boost/units/metric/bar_base_unit.html | 16 +- doc/html/boost/units/metric/barn_base_unit.html | 22 +- doc/html/boost/units/metric/hectare_base_unit.html | 24 +- doc/html/boost/units/metric/knot_base_unit.html | 22 +- doc/html/boost/units/metric/liter_base_unit.html | 22 +- doc/html/boost/units/metric/mmHg_base_unit.html | 24 +- doc/html/boost/units/metric/torr_base_unit.html | 24 +- .../boost/units/multiply_idm45506851695616.html | 55 + .../boost/units/multiply_idm45506851700992.html | 55 + .../boost/units/multiply_idm45506851705888.html | 55 + .../boost/units/multiply_idm45506851711264.html | 55 + .../boost/units/multiply_type_idp347252992.html | 55 - .../boost/units/multiply_type_idp347258368.html | 55 - .../boost/units/multiply_type_idp347263264.html | 55 - .../boost/units/multiply_type_idp347268640.html | 55 - doc/html/boost/units/multiply_typeof_helper.html | 12 +- doc/html/boost/units/operator/_idp347279936.html | 59 - doc/html/boost/units/operator/_idp347292208.html | 59 - .../boost/units/operator_idm45506851658880.html | 59 + .../boost/units/operator_idm45506851665920.html | 59 + .../boost/units/operator_idm45506851672048.html | 59 + .../boost/units/operator_idm45506851678176.html | 59 + .../boost/units/operator_idm45506851684320.html | 59 + .../boost/units/operator_idm45506851690464.html | 59 + .../boost/units/operator_idm45506852030768.html | 59 + .../boost/units/operator_idm45506852037168.html | 62 + doc/html/boost/units/operator_idp346927088.html | 62 - doc/html/boost/units/operator_idp346933488.html | 59 - doc/html/boost/units/operator_idp347273792.html | 59 - doc/html/boost/units/operator_idp347286080.html | 59 - doc/html/boost/units/operator_idp347298336.html | 59 - doc/html/boost/units/operator_idp347305376.html | 59 - doc/html/boost/units/pow_idm45506852379376.html | 59 + doc/html/boost/units/pow_idp346584880.html | 59 - .../boost/units/power_ty_idm45506851137248.html | 66 + .../boost/units/power_typeof__idp347827008.html | 66 - doc/html/boost/units/power_typeof_helper.html | 12 +- doc/html/boost/units/quantity.html | 114 +- .../boost/units/quantity_BOOS_idp347523824.html | 165 -- .../boost/units/quantity_idm45506851440432.html | 165 ++ .../boost/units/reduce_u_idm45506851125392.html | 55 + doc/html/boost/units/reduce_unit.html | 6 +- .../boost/units/reduce_unit_u_idp347838864.html | 55 - .../boost/units/root_typ_idm45506851121600.html | 66 + .../boost/units/root_typeof_h_idp347842656.html | 66 - doc/html/boost/units/root_typeof_helper.html | 12 +- doc/html/boost/units/scale.html | 12 +- doc/html/boost/units/scaled_base_unit.html | 16 +- doc/html/boost/units/si/ampere_base_unit.html | 22 +- doc/html/boost/units/si/candela_base_unit.html | 16 +- .../codata/BOOST_UNITS_P_idp348286224.html | 58 - .../codata/BOOST_UNITS_P_idp348306176.html | 58 - .../codata/BOOST_UNITS_P_idp348326592.html | 58 - .../codata/BOOST_UNITS_P_idp348412640.html | 58 - .../codata/BOOST_UNITS_P_idp348508624.html | 58 - .../codata/BOOST_UNITS_P_idp348551696.html | 58 - .../codata/BOOST_UNITS_P_idp348606096.html | 58 - .../codata/BOOST_UNITS_P_idp348706944.html | 58 - .../codata/BOOST_UNITS_P_idp348787808.html | 57 - .../codata/BOOST_UNITS_P_idp348819392.html | 58 - .../codata/BOOST_UNITS_P_idp348887856.html | 58 - .../codata/BOOST_UN_idm45506850076400.html | 58 + .../codata/BOOST_UN_idm45506850144864.html | 58 + .../codata/BOOST_UN_idm45506850176448.html | 57 + .../codata/BOOST_UN_idm45506850257312.html | 58 + .../codata/BOOST_UN_idm45506850358160.html | 58 + .../codata/BOOST_UN_idm45506850412560.html | 58 + .../codata/BOOST_UN_idm45506850455632.html | 58 + .../codata/BOOST_UN_idm45506850551616.html | 58 + .../codata/BOOST_UN_idm45506850637664.html | 58 + .../codata/BOOST_UN_idm45506850658080.html | 58 + .../codata/BOOST_UN_idm45506850678032.html | 58 + doc/html/boost/units/si/katals.html | 6 +- doc/html/boost/units/si/kelvin_base_unit.html | 16 +- .../boost/units/si/kilogram_idm45506849739072.html | 51 + .../boost/units/si/kilogram_idm45506849740208.html | 51 + .../boost/units/si/kilogram_idm45506849846464.html | 51 + .../boost/units/si/kilogramme_pe_idp349224048.html | 51 - .../boost/units/si/kilogramme_per_cubic_metre.html | 6 +- .../boost/units/si/kilogrammes_p_idp349117792.html | 51 - .../boost/units/si/kilogrammes_p_idp349225184.html | 51 - .../boost/units/si/kilograms_per_square_meter.html | 6 +- doc/html/boost/units/si/meter_base_unit.html | 16 +- doc/html/boost/units/si/mole_base_unit.html | 16 +- doc/html/boost/units/si/newton_per_meter.html | 6 +- doc/html/boost/units/si/pascal.html | 6 +- doc/html/boost/units/si/radian.html | 6 +- doc/html/boost/units/si/second_base_unit.html | 16 +- doc/html/boost/units/si/siemen.html | 6 +- doc/html/boost/units/si/watts.html | 6 +- doc/html/boost/units/static_abs.html | 12 +- doc/html/boost/units/static_rational.html | 28 +- .../boost/units/subtract_idm45506851367776.html | 54 + .../boost/units/subtract_idm45506851375984.html | 57 + .../boost/units/subtract_type_idp347588272.html | 57 - .../boost/units/subtract_type_idp347596480.html | 54 - doc/html/boost/units/subtract_typeof_helper.html | 12 +- .../boost/units/temperature/celsius_base_unit.html | 16 +- .../units/temperature/fahrenheit_base_unit.html | 22 +- .../boost/units/unary_minus_typeof_helper.html | 12 +- doc/html/boost/units/unary_plus_typeof_helper.html | 18 +- doc/html/boost/units/unit.html | 22 +- doc/html/boost/units/us/pint_base_unit.html | 22 +- doc/html/boost/units/us/pound_base_unit.html | 16 +- doc/html/boost/units/us/pound_force_base_unit.html | 22 +- doc/html/boost/units/us/yard_base_unit.html | 22 +- doc/html/boost/unordered_map.html | 324 +-- doc/html/boost/unordered_multimap.html | 312 +-- doc/html/boost/unordered_multiset.html | 312 +-- doc/html/boost/unordered_set.html | 312 +-- doc/html/boost/unwrap_recursive_wrapper.html | 2 +- doc/html/boost/variant.html | 150 +- doc/html/boost/variate_generator.html | 46 +- doc/html/boost/visit_each.html | 2 +- doc/html/boost/visitor_ptr.html | 2 +- doc/html/boost/visitor_ptr_t.html | 22 +- doc/html/boost/xpressive/_.html | 2 +- doc/html/boost/xpressive/_b.html | 2 +- doc/html/boost/xpressive/_d.html | 2 +- doc/html/boost/xpressive/_ln.html | 2 +- doc/html/boost/xpressive/_n.html | 2 +- doc/html/boost/xpressive/_s.html | 2 +- doc/html/boost/xpressive/_w.html | 2 +- doc/html/boost/xpressive/after.html | 2 +- doc/html/boost/xpressive/alnum.html | 2 +- doc/html/boost/xpressive/alpha.html | 2 +- doc/html/boost/xpressive/as_idm45506840056256.html | 96 + doc/html/boost/xpressive/as_idp358484288.html | 96 - doc/html/boost/xpressive/as_xpr.html | 2 +- doc/html/boost/xpressive/basic_regex.html | 70 +- doc/html/boost/xpressive/before.html | 2 +- doc/html/boost/xpressive/blank.html | 2 +- doc/html/boost/xpressive/bol.html | 2 +- doc/html/boost/xpressive/bos.html | 2 +- doc/html/boost/xpressive/bow.html | 2 +- doc/html/boost/xpressive/by_ref.html | 2 +- doc/html/boost/xpressive/c_regex_traits.html | 126 +- doc/html/boost/xpressive/check.html | 2 +- doc/html/boost/xpressive/cntrl.html | 2 +- .../xpressive/const_ca_idm45506840039776.html | 96 + .../boost/xpressive/const_cast_idp358500768.html | 96 - .../xpressive/construc_idm45506839992080.html | 97 + .../boost/xpressive/construct_idp358548464.html | 97 - doc/html/boost/xpressive/cpp_regex_traits.html | 108 +- doc/html/boost/xpressive/cref.html | 2 +- doc/html/boost/xpressive/digit.html | 2 +- .../xpressive/dynamic__idm45506840045280.html | 96 + .../boost/xpressive/dynamic_cast_idp358495264.html | 96 - doc/html/boost/xpressive/eol.html | 2 +- doc/html/boost/xpressive/eos.html | 2 +- doc/html/boost/xpressive/eow.html | 2 +- doc/html/boost/xpressive/function.html | 8 +- doc/html/boost/xpressive/graph.html | 2 +- .../xpressive/has_fold_case_idp359300880.html | 52 - .../xpressive/has_fold_case_idp359305424.html | 52 - .../xpressive/has_fold_idm45506839235120.html | 52 + .../xpressive/has_fold_idm45506839239664.html | 52 + doc/html/boost/xpressive/icase.html | 2 +- doc/html/boost/xpressive/imbue.html | 2 +- doc/html/boost/xpressive/inf.html | 2 +- doc/html/boost/xpressive/keep.html | 2 +- doc/html/boost/xpressive/let.html | 8 +- doc/html/boost/xpressive/local.html | 28 +- doc/html/boost/xpressive/lower.html | 2 +- doc/html/boost/xpressive/mark_tag.html | 18 +- doc/html/boost/xpressive/match_results.html | 112 +- doc/html/boost/xpressive/nil.html | 2 +- doc/html/boost/xpressive/null_regex_traits.html | 84 +- doc/html/boost/xpressive/op/as.html | 14 +- doc/html/boost/xpressive/op/at.html | 28 +- doc/html/boost/xpressive/op/at/result.html | 8 +- .../op/at/result_T_idm45506840408416.html | 55 + .../op/at/result_T_idm45506840412336.html | 55 + .../op/at/result_T_idm45506840416256.html | 55 + .../op/at/result_This_C_idp358124288.html | 55 - .../op/at/result_This_C_idp358128208.html | 55 - .../op/at/result_This_C_idp358132128.html | 55 - doc/html/boost/xpressive/op/back.html | 24 +- doc/html/boost/xpressive/op/back/result.html | 8 +- .../op/back/result_T_idm45506840390448.html | 56 + .../op/back/result_This_S_idp358150096.html | 56 - doc/html/boost/xpressive/op/const_cast_.html | 20 +- doc/html/boost/xpressive/op/construct.html | 26 +- doc/html/boost/xpressive/op/dynamic_cast_.html | 14 +- doc/html/boost/xpressive/op/first.html | 16 +- doc/html/boost/xpressive/op/first/result.html | 8 +- .../op/first/result_T_idm45506840337296.html | 55 + .../op/first/result_This_P_idp358203248.html | 55 - doc/html/boost/xpressive/op/front.html | 24 +- doc/html/boost/xpressive/op/front/result.html | 8 +- .../op/front/result_T_idm45506840326960.html | 56 + .../op/front/result_This_S_idp358213584.html | 56 - doc/html/boost/xpressive/op/insert.html | 30 +- doc/html/boost/xpressive/op/insert/result.html | 6 +- doc/html/boost/xpressive/op/length.html | 16 +- doc/html/boost/xpressive/op/length/result.html | 8 +- .../op/length/result_T_idm45506840272608.html | 55 + .../op/length/result_This_S_idp358267936.html | 55 - doc/html/boost/xpressive/op/make_pair.html | 26 +- doc/html/boost/xpressive/op/make_pair/result.html | 8 +- .../op/make_pair/result_T_idm45506840260208.html | 57 + .../op/make_pair/result_This_F_idp358280336.html | 57 - doc/html/boost/xpressive/op/matched.html | 18 +- doc/html/boost/xpressive/op/pop.html | 12 +- doc/html/boost/xpressive/op/pop_back.html | 12 +- doc/html/boost/xpressive/op/pop_front.html | 12 +- doc/html/boost/xpressive/op/push.html | 12 +- doc/html/boost/xpressive/op/push_back.html | 12 +- doc/html/boost/xpressive/op/push_front.html | 12 +- doc/html/boost/xpressive/op/second.html | 16 +- doc/html/boost/xpressive/op/second/result.html | 8 +- .../op/second/result_T_idm45506840183920.html | 55 + .../op/second/result_This_P_idp358356624.html | 55 - doc/html/boost/xpressive/op/static_cast_.html | 20 +- doc/html/boost/xpressive/op/str.html | 16 +- doc/html/boost/xpressive/op/str/result.html | 8 +- .../op/str/result_T_idm45506840163184.html | 55 + .../op/str/result_This_S_idp358377360.html | 55 - doc/html/boost/xpressive/op/throw_.html | 32 +- doc/html/boost/xpressive/op/top.html | 18 +- doc/html/boost/xpressive/op/top/result.html | 8 +- .../op/top/result_T_idm45506840129152.html | 56 + .../op/top/result_This_S_idp358411392.html | 56 - doc/html/boost/xpressive/op/unwrap_reference.html | 26 +- .../xpressive/op/unwrap_reference/result.html | 8 +- .../result_T_idm45506840112768.html | 55 + .../result_T_idm45506840115856.html | 55 + .../result_This_R_idp358424688.html | 55 - .../result_This_R_idp358427776.html | 55 - .../xpressive/operator_idm45506839379712.html | 91 + .../boost/xpressive/operator_idp359160832.html | 91 - doc/html/boost/xpressive/optional.html | 2 +- doc/html/boost/xpressive/placeholder.html | 14 +- doc/html/boost/xpressive/print.html | 2 +- doc/html/boost/xpressive/punct.html | 2 +- doc/html/boost/xpressive/range.html | 2 +- doc/html/boost/xpressive/range_begin.html | 2 +- doc/html/boost/xpressive/range_end.html | 8 +- doc/html/boost/xpressive/ref.html | 2 +- doc/html/boost/xpressive/reference.html | 20 +- doc/html/boost/xpressive/regex_compiler.html | 56 +- .../xpressive/regex_constants/error_type.html | 2 +- .../xpressive/regex_constants/match_flag_type.html | 2 +- .../regex_constants/syntax_option_type.html | 2 +- doc/html/boost/xpressive/regex_error.html | 22 +- .../boost/xpressive/regex_id_filter_predicate.html | 18 +- doc/html/boost/xpressive/regex_iterator.html | 48 +- doc/html/boost/xpressive/regex_match.html | 8 +- doc/html/boost/xpressive/regex_replace.html | 2 +- doc/html/boost/xpressive/regex_search.html | 2 +- doc/html/boost/xpressive/regex_token_iterator.html | 54 +- doc/html/boost/xpressive/regex_traits.html | 12 +- .../xpressive/regex_traits_version_1_tag.html | 2 +- .../xpressive/regex_traits_version_2_tag.html | 2 +- doc/html/boost/xpressive/repeat.html | 2 +- doc/html/boost/xpressive/s1.html | 2 +- doc/html/boost/xpressive/self.html | 2 +- doc/html/boost/xpressive/set.html | 2 +- doc/html/boost/xpressive/skip.html | 2 +- doc/html/boost/xpressive/space.html | 2 +- .../xpressive/static_c_idm45506840050768.html | 96 + .../boost/xpressive/static_cast_idp358489776.html | 96 - doc/html/boost/xpressive/sub_match.html | 50 +- .../boost/xpressive/swap_idm45506840643536.html | 98 + doc/html/boost/xpressive/swap_idp357897008.html | 98 - doc/html/boost/xpressive/unwrap_reference.html | 6 +- doc/html/boost/xpressive/upper.html | 2 +- doc/html/boost/xpressive/val.html | 8 +- doc/html/boost/xpressive/value.html | 28 +- doc/html/boost/xpressive/xdigit.html | 2 +- 3096 files changed, 73121 insertions(+), 92706 deletions(-) delete mode 100644 doc/html/boost/accumulators/absolute.html create mode 100644 doc/html/boost/accumulators/as_featu_idm45507139496800.html delete mode 100644 doc/html/boost/accumulators/as_feature_tag_idp64779136.html delete mode 100644 doc/html/boost/accumulators/as_feature_tag_idp64932064.html delete mode 100644 doc/html/boost/accumulators/as_feature_tag_idp64963952.html delete mode 100644 doc/html/boost/accumulators/as_feature_tag_idp64966064.html delete mode 100644 doc/html/boost/accumulators/as_feature_tag_idp64968208.html delete mode 100644 doc/html/boost/accumulators/as_feature_tag_idp64970352.html delete mode 100644 doc/html/boost/accumulators/as_feature_tag_idp65024544.html delete mode 100644 doc/html/boost/accumulators/as_feature_tag_idp65026624.html delete mode 100644 doc/html/boost/accumulators/as_feature_tag_idp65028704.html delete mode 100644 doc/html/boost/accumulators/as_feature_tag_idp65032400.html delete mode 100644 doc/html/boost/accumulators/as_feature_tag_idp65036080.html delete mode 100644 doc/html/boost/accumulators/as_feature_tag_idp65038192.html delete mode 100644 doc/html/boost/accumulators/as_feature_tag_idp65081440.html delete mode 100644 doc/html/boost/accumulators/as_feature_tag_idp65083552.html delete mode 100644 doc/html/boost/accumulators/as_feature_tag_idp65085696.html delete mode 100644 doc/html/boost/accumulators/as_feature_tag_idp65158224.html delete mode 100644 doc/html/boost/accumulators/as_feature_tag_idp65161088.html delete mode 100644 doc/html/boost/accumulators/as_feature_tag_idp65283264.html delete mode 100644 doc/html/boost/accumulators/as_feature_tag_idp65286112.html delete mode 100644 doc/html/boost/accumulators/as_feature_tag_idp65288944.html delete mode 100644 doc/html/boost/accumulators/as_feature_tag_idp65291808.html delete mode 100644 doc/html/boost/accumulators/as_feature_tag_idp65313104.html delete mode 100644 doc/html/boost/accumulators/as_feature_tag_idp65315952.html delete mode 100644 doc/html/boost/accumulators/as_feature_tag_idp65318784.html delete mode 100644 doc/html/boost/accumulators/as_feature_tag_idp65321648.html delete mode 100644 doc/html/boost/accumulators/as_feature_tag_idp65351376.html delete mode 100644 doc/html/boost/accumulators/as_feature_tag_idp65353488.html delete mode 100644 doc/html/boost/accumulators/as_feature_tag_idp65421120.html delete mode 100644 doc/html/boost/accumulators/as_feature_tag_idp65423232.html delete mode 100644 doc/html/boost/accumulators/as_feature_tag_idp65572848.html delete mode 100644 doc/html/boost/accumulators/as_feature_tag_idp65574928.html delete mode 100644 doc/html/boost/accumulators/as_feature_tag_idp65660848.html delete mode 100644 doc/html/boost/accumulators/as_feature_tag_idp65665392.html delete mode 100644 doc/html/boost/accumulators/as_feature_tag_idp65706992.html delete mode 100644 doc/html/boost/accumulators/as_feature_tag_idp65709088.html delete mode 100644 doc/html/boost/accumulators/as_feature_tag_idp65768368.html delete mode 100644 doc/html/boost/accumulators/as_feature_tag_idp65770480.html delete mode 100644 doc/html/boost/accumulators/as_feature_tag_idp65772576.html delete mode 100644 doc/html/boost/accumulators/as_feature_tag_idp65776304.html delete mode 100644 doc/html/boost/accumulators/as_feature_tag_idp65787952.html delete mode 100644 doc/html/boost/accumulators/as_feature_tag_idp65790064.html delete mode 100644 doc/html/boost/accumulators/as_feature_tag_idp65792240.html delete mode 100644 doc/html/boost/accumulators/as_feature_tag_idp65830272.html delete mode 100644 doc/html/boost/accumulators/as_feature_tag_idp65833152.html delete mode 100644 doc/html/boost/accumulators/as_feature_tag_idp65861648.html delete mode 100644 doc/html/boost/accumulators/as_feature_tag_idp65889776.html delete mode 100644 doc/html/boost/accumulators/as_feature_tag_idp65894352.html delete mode 100644 doc/html/boost/accumulators/as_feature_tag_idp65910400.html delete mode 100644 doc/html/boost/accumulators/as_feature_tag_idp65912496.html create mode 100644 doc/html/boost/accumulators/as_weigh_idm45507139493536.html delete mode 100644 doc/html/boost/accumulators/as_weighted_fe_idp64782400.html delete mode 100644 doc/html/boost/accumulators/as_weighted_fe_idp64882688.html delete mode 100644 doc/html/boost/accumulators/as_weighted_fe_idp64917456.html delete mode 100644 doc/html/boost/accumulators/as_weighted_fe_idp64935328.html delete mode 100644 doc/html/boost/accumulators/as_weighted_fe_idp64949968.html delete mode 100644 doc/html/boost/accumulators/as_weighted_fe_idp64972496.html delete mode 100644 doc/html/boost/accumulators/as_weighted_fe_idp64974624.html delete mode 100644 doc/html/boost/accumulators/as_weighted_fe_idp65006928.html delete mode 100644 doc/html/boost/accumulators/as_weighted_fe_idp65040288.html delete mode 100644 doc/html/boost/accumulators/as_weighted_fe_idp65042384.html delete mode 100644 doc/html/boost/accumulators/as_weighted_fe_idp65046112.html delete mode 100644 doc/html/boost/accumulators/as_weighted_fe_idp65048192.html delete mode 100644 doc/html/boost/accumulators/as_weighted_fe_idp65087792.html delete mode 100644 doc/html/boost/accumulators/as_weighted_fe_idp65089872.html delete mode 100644 doc/html/boost/accumulators/as_weighted_fe_idp65091984.html delete mode 100644 doc/html/boost/accumulators/as_weighted_fe_idp65121904.html delete mode 100644 doc/html/boost/accumulators/as_weighted_fe_idp65132624.html delete mode 100644 doc/html/boost/accumulators/as_weighted_fe_idp65144848.html delete mode 100644 doc/html/boost/accumulators/as_weighted_fe_idp65163952.html delete mode 100644 doc/html/boost/accumulators/as_weighted_fe_idp65166784.html delete mode 100644 doc/html/boost/accumulators/as_weighted_fe_idp65294672.html delete mode 100644 doc/html/boost/accumulators/as_weighted_fe_idp65297504.html delete mode 100644 doc/html/boost/accumulators/as_weighted_fe_idp65324512.html delete mode 100644 doc/html/boost/accumulators/as_weighted_fe_idp65327344.html delete mode 100644 doc/html/boost/accumulators/as_weighted_fe_idp65539840.html delete mode 100644 doc/html/boost/accumulators/as_weighted_fe_idp65553024.html delete mode 100644 doc/html/boost/accumulators/as_weighted_fe_idp65577040.html delete mode 100644 doc/html/boost/accumulators/as_weighted_fe_idp65613072.html delete mode 100644 doc/html/boost/accumulators/as_weighted_fe_idp65631344.html delete mode 100644 doc/html/boost/accumulators/as_weighted_fe_idp65669936.html delete mode 100644 doc/html/boost/accumulators/as_weighted_fe_idp65674512.html delete mode 100644 doc/html/boost/accumulators/as_weighted_fe_idp65711168.html delete mode 100644 doc/html/boost/accumulators/as_weighted_fe_idp65713264.html delete mode 100644 doc/html/boost/accumulators/covariate1.html delete mode 100644 doc/html/boost/accumulators/covariate2.html delete mode 100644 doc/html/boost/accumulators/extract/coherent_tail_mean.html delete mode 100644 doc/html/boost/accumulators/extract/count.html delete mode 100644 doc/html/boost/accumulators/extract/covariance.html delete mode 100644 doc/html/boost/accumulators/extract/density.html delete mode 100644 doc/html/boost/accumulators/extract/extended_p_squ_idp64985888.html delete mode 100644 doc/html/boost/accumulators/extract/extended_p_square.html delete mode 100644 doc/html/boost/accumulators/extract/extended_p_square_quantile.html delete mode 100644 doc/html/boost/accumulators/extract/immediate_rolling_mean.html delete mode 100644 doc/html/boost/accumulators/extract/immediate_rolling_variance.html delete mode 100644 doc/html/boost/accumulators/extract/kurtosis.html delete mode 100644 doc/html/boost/accumulators/extract/lazy_rolling_mean.html delete mode 100644 doc/html/boost/accumulators/extract/lazy_rolling_variance.html delete mode 100644 doc/html/boost/accumulators/extract/lazy_variance.html delete mode 100644 doc/html/boost/accumulators/extract/lazy_weighted_variance.html delete mode 100644 doc/html/boost/accumulators/extract/max.html delete mode 100644 doc/html/boost/accumulators/extract/mean.html delete mode 100644 doc/html/boost/accumulators/extract/mean_of_weights.html delete mode 100644 doc/html/boost/accumulators/extract/median.html delete mode 100644 doc/html/boost/accumulators/extract/min.html delete mode 100644 doc/html/boost/accumulators/extract/non_coherent_tail_mean.html delete mode 100644 doc/html/boost/accumulators/extract/non_coherent_w_idp65878400.html delete mode 100644 doc/html/boost/accumulators/extract/p_square_cumul_idp65137072.html delete mode 100644 doc/html/boost/accumulators/extract/p_square_quant_idp65150816.html delete mode 100644 doc/html/boost/accumulators/extract/p_square_quantile.html delete mode 100644 doc/html/boost/accumulators/extract/peaks_over_threshold.html delete mode 100644 doc/html/boost/accumulators/extract/quantile.html delete mode 100644 doc/html/boost/accumulators/extract/relative_tail__idp65697392.html delete mode 100644 doc/html/boost/accumulators/extract/relative_weigh_idp65901120.html delete mode 100644 doc/html/boost/accumulators/extract/rolling_count.html delete mode 100644 doc/html/boost/accumulators/extract/rolling_mean.html delete mode 100644 doc/html/boost/accumulators/extract/rolling_sum.html delete mode 100644 doc/html/boost/accumulators/extract/rolling_variance.html delete mode 100644 doc/html/boost/accumulators/extract/rolling_window.html delete mode 100644 doc/html/boost/accumulators/extract/rolling_window_plus1.html delete mode 100644 doc/html/boost/accumulators/extract/skewness.html delete mode 100644 doc/html/boost/accumulators/extract/sum.html delete mode 100644 doc/html/boost/accumulators/extract/sum_kahan.html delete mode 100644 doc/html/boost/accumulators/extract/sum_of_variates.html delete mode 100644 doc/html/boost/accumulators/extract/sum_of_variates_kahan.html delete mode 100644 doc/html/boost/accumulators/extract/sum_of_weights.html delete mode 100644 doc/html/boost/accumulators/extract/sum_of_weights_kahan.html delete mode 100644 doc/html/boost/accumulators/extract/tail.html delete mode 100644 doc/html/boost/accumulators/extract/tail_mean.html delete mode 100644 doc/html/boost/accumulators/extract/tail_quantile.html delete mode 100644 doc/html/boost/accumulators/extract/tail_variate.html delete mode 100644 doc/html/boost/accumulators/extract/tail_variate_means.html delete mode 100644 doc/html/boost/accumulators/extract/tail_weights.html delete mode 100644 doc/html/boost/accumulators/extract/variance.html delete mode 100644 doc/html/boost/accumulators/extract/weighted_covariance.html delete mode 100644 doc/html/boost/accumulators/extract/weighted_density.html delete mode 100644 doc/html/boost/accumulators/extract/weighted_exten_idp64987520.html delete mode 100644 doc/html/boost/accumulators/extract/weighted_exten_idp64989152.html delete mode 100644 doc/html/boost/accumulators/extract/weighted_extended_p_square.html delete mode 100644 doc/html/boost/accumulators/extract/weighted_kurtosis.html delete mode 100644 doc/html/boost/accumulators/extract/weighted_mean.html delete mode 100644 doc/html/boost/accumulators/extract/weighted_median.html delete mode 100644 doc/html/boost/accumulators/extract/weighted_p_squ_idp65808320.html delete mode 100644 doc/html/boost/accumulators/extract/weighted_p_squ_idp65819552.html delete mode 100644 doc/html/boost/accumulators/extract/weighted_p_square_quantile.html delete mode 100644 doc/html/boost/accumulators/extract/weighted_peaks_idp65836576.html delete mode 100644 doc/html/boost/accumulators/extract/weighted_skewness.html delete mode 100644 doc/html/boost/accumulators/extract/weighted_sum.html delete mode 100644 doc/html/boost/accumulators/extract/weighted_sum_kahan.html delete mode 100644 doc/html/boost/accumulators/extract/weighted_sum_o_idp65869056.html delete mode 100644 doc/html/boost/accumulators/extract/weighted_sum_of_variates.html delete mode 100644 doc/html/boost/accumulators/extract/weighted_tail__idp65899488.html delete mode 100644 doc/html/boost/accumulators/extract/weighted_tail_quantile.html delete mode 100644 doc/html/boost/accumulators/extract/weighted_variance.html delete mode 100644 doc/html/boost/accumulators/extract/with_density_median.html delete mode 100644 doc/html/boost/accumulators/extract/with_p_square__idp65106528.html create mode 100644 doc/html/boost/accumulators/feature__idm45507139452704.html create mode 100644 doc/html/boost/accumulators/feature__idm45507139467936.html create mode 100644 doc/html/boost/accumulators/feature__idm45507139479888.html create mode 100644 doc/html/boost/accumulators/feature__idm45507139490272.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp64785664.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp64796048.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp64808000.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp64823232.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp64886384.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp64889520.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp64919536.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp64952064.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp64976768.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp64978480.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp64980208.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp64981952.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65009008.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65051888.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65053584.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65056752.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65058464.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65060176.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65063360.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65065056.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65094144.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65095840.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65097552.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65099280.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65101008.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65124992.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65134752.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65146944.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65169632.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65171920.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65174224.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65176544.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65300336.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65302608.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65304880.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65307168.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65330176.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65332448.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65334720.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65337024.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65355568.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65357280.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65425344.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65427072.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65541920.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65555104.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65558240.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65579120.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65580816.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65583952.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65585664.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65599280.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65615920.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65618192.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65620496.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65634176.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65636448.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65644688.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65648672.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65679088.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65683104.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65687152.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65691168.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65715344.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65717040.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65718752.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65848960.html delete mode 100644 doc/html/boost/accumulators/feature_of_tag_idp65863744.html delete mode 100644 doc/html/boost/accumulators/for_median.html delete mode 100644 doc/html/boost/accumulators/immediate.html delete mode 100644 doc/html/boost/accumulators/impl/coherent_tail_mean_impl.html delete mode 100644 doc/html/boost/accumulators/impl/count_impl.html delete mode 100644 doc/html/boost/accumulators/impl/covariance_impl.html delete mode 100644 doc/html/boost/accumulators/impl/density_impl.html delete mode 100644 doc/html/boost/accumulators/impl/error_of_mean_impl.html delete mode 100644 doc/html/boost/accumulators/impl/extended_p_squ_idp66039568.html delete mode 100644 doc/html/boost/accumulators/impl/extended_p_square_impl.html delete mode 100644 doc/html/boost/accumulators/impl/immediate_mean_impl.html delete mode 100644 doc/html/boost/accumulators/impl/immediate_roll_idp65365024.html delete mode 100644 doc/html/boost/accumulators/impl/immediate_roll_idp65434880.html delete mode 100644 doc/html/boost/accumulators/impl/immediate_weig_idp66062928.html delete mode 100644 doc/html/boost/accumulators/impl/kurtosis_impl.html delete mode 100644 doc/html/boost/accumulators/impl/lazy_rolling_mean_impl.html delete mode 100644 doc/html/boost/accumulators/impl/lazy_rolling_variance_impl.html delete mode 100644 doc/html/boost/accumulators/impl/lazy_variance_impl.html delete mode 100644 doc/html/boost/accumulators/impl/lazy_weighted__idp66114016.html delete mode 100644 doc/html/boost/accumulators/impl/max_impl.html delete mode 100644 doc/html/boost/accumulators/impl/mean_impl.html delete mode 100644 doc/html/boost/accumulators/impl/median_impl.html delete mode 100644 doc/html/boost/accumulators/impl/min_impl.html delete mode 100644 doc/html/boost/accumulators/impl/moment_impl.html delete mode 100644 doc/html/boost/accumulators/impl/non_coherent_t_idp66180304.html delete mode 100644 doc/html/boost/accumulators/impl/non_coherent_w_idp66212144.html delete mode 100644 doc/html/boost/accumulators/impl/p_square_cumul_idp66248320.html delete mode 100644 doc/html/boost/accumulators/impl/p_square_quantile_impl.html delete mode 100644 doc/html/boost/accumulators/impl/peaks_over_thr_idp66288512.html delete mode 100644 doc/html/boost/accumulators/impl/peaks_over_threshold_impl.html delete mode 100644 doc/html/boost/accumulators/impl/pot_quantile_impl.html delete mode 100644 doc/html/boost/accumulators/impl/pot_tail_mean_impl.html delete mode 100644 doc/html/boost/accumulators/impl/rolling_count_impl.html delete mode 100644 doc/html/boost/accumulators/impl/rolling_mean_impl.html delete mode 100644 doc/html/boost/accumulators/impl/rolling_moment_impl.html delete mode 100644 doc/html/boost/accumulators/impl/rolling_sum_impl.html delete mode 100644 doc/html/boost/accumulators/impl/rolling_window_impl.html delete mode 100644 doc/html/boost/accumulators/impl/rolling_window_plus1_impl.html delete mode 100644 doc/html/boost/accumulators/impl/skewness_impl.html delete mode 100644 doc/html/boost/accumulators/impl/sum_impl.html delete mode 100644 doc/html/boost/accumulators/impl/sum_kahan_impl.html delete mode 100644 doc/html/boost/accumulators/impl/tail_impl.html delete mode 100644 doc/html/boost/accumulators/impl/tail_quantile_impl.html delete mode 100644 doc/html/boost/accumulators/impl/tail_variate_impl.html delete mode 100644 doc/html/boost/accumulators/impl/tail_variate_means_impl.html delete mode 100644 doc/html/boost/accumulators/impl/variance_impl.html delete mode 100644 doc/html/boost/accumulators/impl/weighted_covariance_impl.html delete mode 100644 doc/html/boost/accumulators/impl/weighted_density_impl.html delete mode 100644 doc/html/boost/accumulators/impl/weighted_exten_idp66592512.html delete mode 100644 doc/html/boost/accumulators/impl/weighted_kurtosis_impl.html delete mode 100644 doc/html/boost/accumulators/impl/weighted_mean_impl.html delete mode 100644 doc/html/boost/accumulators/impl/weighted_median_impl.html delete mode 100644 doc/html/boost/accumulators/impl/weighted_moment_impl.html delete mode 100644 doc/html/boost/accumulators/impl/weighted_p_squ_idp66685360.html delete mode 100644 doc/html/boost/accumulators/impl/weighted_p_squ_idp66702800.html delete mode 100644 doc/html/boost/accumulators/impl/weighted_peaks_idp66732176.html delete mode 100644 doc/html/boost/accumulators/impl/weighted_peaks_idp66744912.html delete mode 100644 doc/html/boost/accumulators/impl/weighted_skewness_impl.html delete mode 100644 doc/html/boost/accumulators/impl/weighted_sum_impl.html delete mode 100644 doc/html/boost/accumulators/impl/weighted_sum_kahan_impl.html delete mode 100644 doc/html/boost/accumulators/impl/weighted_tail__idp66800032.html delete mode 100644 doc/html/boost/accumulators/impl/weighted_tail__idp66832368.html delete mode 100644 doc/html/boost/accumulators/impl/weighted_variance_impl.html delete mode 100644 doc/html/boost/accumulators/impl/with_density_median_impl.html delete mode 100644 doc/html/boost/accumulators/impl/with_density_w_idp66912192.html delete mode 100644 doc/html/boost/accumulators/impl/with_p_square__idp66926624.html delete mode 100644 doc/html/boost/accumulators/impl/with_p_square__idp66937776.html delete mode 100644 doc/html/boost/accumulators/kahan.html delete mode 100644 doc/html/boost/accumulators/lazy.html delete mode 100644 doc/html/boost/accumulators/left.html delete mode 100644 doc/html/boost/accumulators/linear.html delete mode 100644 doc/html/boost/accumulators/quadratic.html delete mode 100644 doc/html/boost/accumulators/regular.html delete mode 100644 doc/html/boost/accumulators/relative.html delete mode 100644 doc/html/boost/accumulators/right.html delete mode 100644 doc/html/boost/accumulators/stats.html delete mode 100644 doc/html/boost/accumulators/tag/absolute_tail__idp66950400.html delete mode 100644 doc/html/boost/accumulators/tag/absolute_weigh_idp66953456.html delete mode 100644 doc/html/boost/accumulators/tag/abstract_absol_idp65700464.html delete mode 100644 doc/html/boost/accumulators/tag/abstract_covariance.html delete mode 100644 doc/html/boost/accumulators/tag/abstract_non_c_idp65628000.html delete mode 100644 doc/html/boost/accumulators/tag/abstract_peaks_idp65279920.html delete mode 100644 doc/html/boost/accumulators/tag/abstract_relat_idp65701456.html delete mode 100644 doc/html/boost/accumulators/tag/abstract_sum_of_variates.html delete mode 100644 doc/html/boost/accumulators/tag/abstract_tail.html delete mode 100644 doc/html/boost/accumulators/tag/abstract_tail_variate.html delete mode 100644 doc/html/boost/accumulators/tag/abstract_tail_weights.html delete mode 100644 doc/html/boost/accumulators/tag/abstract_weigh_idp65857328.html create mode 100644 doc/html/boost/accumulators/tag/as_dropp_idm45507139485056.html delete mode 100644 doc/html/boost/accumulators/tag/as_droppable_d_idp64790880.html delete mode 100644 doc/html/boost/accumulators/tag/coherent_tail_mean.html delete mode 100644 doc/html/boost/accumulators/tag/count.html delete mode 100644 doc/html/boost/accumulators/tag/covariance.html delete mode 100644 doc/html/boost/accumulators/tag/covariate1.html delete mode 100644 doc/html/boost/accumulators/tag/covariate2.html delete mode 100644 doc/html/boost/accumulators/tag/density.html delete mode 100644 doc/html/boost/accumulators/tag/error_of.html delete mode 100644 doc/html/boost/accumulators/tag/error_of_immed_idp64944224.html delete mode 100644 doc/html/boost/accumulators/tag/error_of_mean_idp64945920.html delete mode 100644 doc/html/boost/accumulators/tag/extended_p_squ_idp64995312.html delete mode 100644 doc/html/boost/accumulators/tag/extended_p_square.html delete mode 100644 doc/html/boost/accumulators/tag/extended_p_square_quantile.html delete mode 100644 doc/html/boost/accumulators/tag/external_Featu_idp64801280.html create mode 100644 doc/html/boost/accumulators/tag/external_idm45507139474656.html delete mode 100644 doc/html/boost/accumulators/tag/immediate_mean.html delete mode 100644 doc/html/boost/accumulators/tag/immediate_mean_of_variates.html delete mode 100644 doc/html/boost/accumulators/tag/immediate_mean_of_weights.html delete mode 100644 doc/html/boost/accumulators/tag/immediate_rolling_mean.html delete mode 100644 doc/html/boost/accumulators/tag/immediate_rolling_variance.html delete mode 100644 doc/html/boost/accumulators/tag/immediate_weig_idp66965120.html delete mode 100644 doc/html/boost/accumulators/tag/immediate_weighted_mean.html delete mode 100644 doc/html/boost/accumulators/tag/kurtosis.html delete mode 100644 doc/html/boost/accumulators/tag/lazy_rolling_mean.html delete mode 100644 doc/html/boost/accumulators/tag/lazy_rolling_variance.html delete mode 100644 doc/html/boost/accumulators/tag/lazy_variance.html delete mode 100644 doc/html/boost/accumulators/tag/lazy_weighted_variance.html delete mode 100644 doc/html/boost/accumulators/tag/left_tail_variate.html delete mode 100644 doc/html/boost/accumulators/tag/max.html delete mode 100644 doc/html/boost/accumulators/tag/mean.html delete mode 100644 doc/html/boost/accumulators/tag/mean_of_variates.html delete mode 100644 doc/html/boost/accumulators/tag/mean_of_weights.html delete mode 100644 doc/html/boost/accumulators/tag/median.html delete mode 100644 doc/html/boost/accumulators/tag/min.html delete mode 100644 doc/html/boost/accumulators/tag/moment.html delete mode 100644 doc/html/boost/accumulators/tag/non_coherent_tail_mean.html delete mode 100644 doc/html/boost/accumulators/tag/non_coherent_w_idp66976320.html delete mode 100644 doc/html/boost/accumulators/tag/p_square_cumul_idp65140128.html delete mode 100644 doc/html/boost/accumulators/tag/p_square_quant_idp65154864.html delete mode 100644 doc/html/boost/accumulators/tag/p_square_quantile.html delete mode 100644 doc/html/boost/accumulators/tag/peaks_over_threshold.html delete mode 100644 doc/html/boost/accumulators/tag/peaks_over_threshold_prob.html delete mode 100644 doc/html/boost/accumulators/tag/pot_quantile.html delete mode 100644 doc/html/boost/accumulators/tag/pot_quantile_prob.html delete mode 100644 doc/html/boost/accumulators/tag/pot_tail_mean.html delete mode 100644 doc/html/boost/accumulators/tag/pot_tail_mean_prob.html delete mode 100644 doc/html/boost/accumulators/tag/quantile.html delete mode 100644 doc/html/boost/accumulators/tag/relative_tail__idp66992464.html delete mode 100644 doc/html/boost/accumulators/tag/relative_weigh_idp66995520.html delete mode 100644 doc/html/boost/accumulators/tag/right_tail_variate.html delete mode 100644 doc/html/boost/accumulators/tag/rolling_count.html delete mode 100644 doc/html/boost/accumulators/tag/rolling_mean.html delete mode 100644 doc/html/boost/accumulators/tag/rolling_moment.html delete mode 100644 doc/html/boost/accumulators/tag/rolling_sum.html delete mode 100644 doc/html/boost/accumulators/tag/rolling_variance.html delete mode 100644 doc/html/boost/accumulators/tag/rolling_window.html delete mode 100644 doc/html/boost/accumulators/tag/rolling_window_plus1.html delete mode 100644 doc/html/boost/accumulators/tag/skewness.html delete mode 100644 doc/html/boost/accumulators/tag/sum.html delete mode 100644 doc/html/boost/accumulators/tag/sum_kahan.html delete mode 100644 doc/html/boost/accumulators/tag/sum_of_variates.html delete mode 100644 doc/html/boost/accumulators/tag/sum_of_variates_kahan.html delete mode 100644 doc/html/boost/accumulators/tag/sum_of_weights.html delete mode 100644 doc/html/boost/accumulators/tag/sum_of_weights_kahan.html delete mode 100644 doc/html/boost/accumulators/tag/tail.html delete mode 100644 doc/html/boost/accumulators/tag/tail_mean.html delete mode 100644 doc/html/boost/accumulators/tag/tail_quantile.html delete mode 100644 doc/html/boost/accumulators/tag/tail_variate.html delete mode 100644 doc/html/boost/accumulators/tag/tail_variate_means.html delete mode 100644 doc/html/boost/accumulators/tag/tail_weights.html delete mode 100644 doc/html/boost/accumulators/tag/variance.html delete mode 100644 doc/html/boost/accumulators/tag/weighted_covariance.html delete mode 100644 doc/html/boost/accumulators/tag/weighted_density.html delete mode 100644 doc/html/boost/accumulators/tag/weighted_exten_idp64998384.html delete mode 100644 doc/html/boost/accumulators/tag/weighted_exten_idp65001472.html delete mode 100644 doc/html/boost/accumulators/tag/weighted_extended_p_square.html delete mode 100644 doc/html/boost/accumulators/tag/weighted_kurtosis.html delete mode 100644 doc/html/boost/accumulators/tag/weighted_mean.html delete mode 100644 doc/html/boost/accumulators/tag/weighted_mean_of_variates.html delete mode 100644 doc/html/boost/accumulators/tag/weighted_median.html delete mode 100644 doc/html/boost/accumulators/tag/weighted_moment.html delete mode 100644 doc/html/boost/accumulators/tag/weighted_p_squ_idp65811408.html delete mode 100644 doc/html/boost/accumulators/tag/weighted_p_squ_idp65825264.html delete mode 100644 doc/html/boost/accumulators/tag/weighted_p_square_quantile.html delete mode 100644 doc/html/boost/accumulators/tag/weighted_peaks_idp67026176.html delete mode 100644 doc/html/boost/accumulators/tag/weighted_peaks_idp67028592.html delete mode 100644 doc/html/boost/accumulators/tag/weighted_pot_quantile.html delete mode 100644 doc/html/boost/accumulators/tag/weighted_pot_quantile_prob.html delete mode 100644 doc/html/boost/accumulators/tag/weighted_pot_t_idp67036720.html delete mode 100644 doc/html/boost/accumulators/tag/weighted_pot_tail_mean.html delete mode 100644 doc/html/boost/accumulators/tag/weighted_skewness.html delete mode 100644 doc/html/boost/accumulators/tag/weighted_sum.html delete mode 100644 doc/html/boost/accumulators/tag/weighted_sum_kahan.html delete mode 100644 doc/html/boost/accumulators/tag/weighted_sum_o_idp65873088.html delete mode 100644 doc/html/boost/accumulators/tag/weighted_sum_of_variates.html delete mode 100644 doc/html/boost/accumulators/tag/weighted_tail__idp67042928.html delete mode 100644 doc/html/boost/accumulators/tag/weighted_tail_quantile.html delete mode 100644 doc/html/boost/accumulators/tag/weighted_variance.html delete mode 100644 doc/html/boost/accumulators/tag/with_density_median.html delete mode 100644 doc/html/boost/accumulators/tag/with_density_w_idp65798960.html delete mode 100644 doc/html/boost/accumulators/tag/with_p_square__idp65111616.html delete mode 100644 doc/html/boost/accumulators/tag/with_p_square__idp65799984.html delete mode 100644 doc/html/boost/accumulators/tail_cache_siz_idp65602800.html delete mode 100644 doc/html/boost/accumulators/tail_cache_siz_idp65604480.html delete mode 100644 doc/html/boost/accumulators/tail_cache_size_named_arg.html delete mode 100644 doc/html/boost/accumulators/unweighted.html delete mode 100644 doc/html/boost/accumulators/weighted.html delete mode 100644 doc/html/boost/accumulators/with_density.html delete mode 100644 doc/html/boost/accumulators/with_error.html delete mode 100644 doc/html/boost/accumulators/with_p_square__idp65938128.html delete mode 100644 doc/html/boost/accumulators/with_p_square_quantile.html delete mode 100644 doc/html/boost/accumulators/with_threshold_probability.html delete mode 100644 doc/html/boost/accumulators/with_threshold_value.html create mode 100644 doc/html/boost/algorithm/join_if_idm45506997401056.html create mode 100644 doc/html/boost/algorithm/join_if_idm45507095260992.html delete mode 100644 doc/html/boost/algorithm/join_if_idp102602880.html delete mode 100644 doc/html/boost/algorithm/join_if_idp214569568.html delete mode 100644 doc/html/boost/algorithm/operator___idp97198576.html delete mode 100644 doc/html/boost/algorithm/operator__idp99169024.html create mode 100644 doc/html/boost/algorithm/operator_idm45506971184944.html create mode 100644 doc/html/boost/algorithm/operator_idm45507049375408.html create mode 100644 doc/html/boost/algorithm/operator_idm45507108212576.html delete mode 100644 doc/html/boost/algorithm/operator_idp162356144.html create mode 100644 doc/html/boost/algorithm/split_idm45506997439552.html delete mode 100644 doc/html/boost/algorithm/split_idp159921872.html create mode 100644 doc/html/boost/any_cast_idm45507162615824.html delete mode 100644 doc/html/boost/any_cast_idp45214624.html create mode 100644 doc/html/boost/apply_vi_idm45507085892176.html create mode 100644 doc/html/boost/apply_vi_idm45507092235520.html delete mode 100644 doc/html/boost/apply_visitor_idp313712304.html delete mode 100644 doc/html/boost/apply_visitor_idp353473104.html delete mode 100644 doc/html/boost/circular_buffe_idp24914528.html create mode 100644 doc/html/boost/circular_idm45713141954256.html create mode 100644 doc/html/boost/container/construc_idm46583867843104.html create mode 100644 doc/html/boost/container/construc_idm46583867853472.html delete mode 100644 doc/html/boost/container/constructible__idp59903648.html delete mode 100644 doc/html/boost/container/constructible__idp59914016.html create mode 100644 doc/html/boost/container/erased_type.html create mode 100644 doc/html/boost/container/new_allo_idm46583871819392.html create mode 100644 doc/html/boost/container/new_allo_idm46583871819392/rebind.html delete mode 100644 doc/html/boost/container/new_allocator__idp59775248.html delete mode 100644 doc/html/boost/container/new_allocator__idp59775248/rebind.html delete mode 100644 doc/html/boost/container/new_allocator_bool.html delete mode 100644 doc/html/boost/container/operator___idp62323648.html delete mode 100644 doc/html/boost/container/operator___idp62333664.html delete mode 100644 doc/html/boost/container/operator___idp62363664.html delete mode 100644 doc/html/boost/container/operator___idp62373648.html create mode 100644 doc/html/boost/container/operator_idm46583868786816.html create mode 100644 doc/html/boost/container/operator_idm46583868796800.html create mode 100644 doc/html/boost/container/operator_idm46583868806784.html create mode 100644 doc/html/boost/container/operator_idm46583868816768.html create mode 100644 doc/html/boost/container/operator_idm46583868826800.html create mode 100644 doc/html/boost/container/operator_idm46583868836816.html delete mode 100644 doc/html/boost/container/operator_idp62343696.html delete mode 100644 doc/html/boost/container/operator_idp62353680.html create mode 100644 doc/html/boost/container/pmr/basic_string_of.html create mode 100644 doc/html/boost/container/pmr/deque_of.html create mode 100644 doc/html/boost/container/pmr/flat_map_of.html create mode 100644 doc/html/boost/container/pmr/flat_multimap_of.html create mode 100644 doc/html/boost/container/pmr/flat_multiset_of.html create mode 100644 doc/html/boost/container/pmr/flat_set_of.html create mode 100644 doc/html/boost/container/pmr/get_default_resource.html create mode 100644 doc/html/boost/container/pmr/list_of.html create mode 100644 doc/html/boost/container/pmr/map_of.html create mode 100644 doc/html/boost/container/pmr/memory_resource.html create mode 100644 doc/html/boost/container/pmr/monotonic_buffer_resource.html create mode 100644 doc/html/boost/container/pmr/multimap_of.html create mode 100644 doc/html/boost/container/pmr/multiset_of.html create mode 100644 doc/html/boost/container/pmr/new_delete_resource.html create mode 100644 doc/html/boost/container/pmr/null_memory_resource.html create mode 100644 doc/html/boost/container/pmr/operator_idm46583871486800.html create mode 100644 doc/html/boost/container/pmr/operator_idm46583871492768.html create mode 100644 doc/html/boost/container/pmr/polymorphic_allocator.html create mode 100644 doc/html/boost/container/pmr/pool_options.html create mode 100644 doc/html/boost/container/pmr/resource_adaptor.html create mode 100644 doc/html/boost/container/pmr/resource_adaptor_imp.html create mode 100644 doc/html/boost/container/pmr/set_default_resource.html create mode 100644 doc/html/boost/container/pmr/set_of.html create mode 100644 doc/html/boost/container/pmr/slist_of.html create mode 100644 doc/html/boost/container/pmr/small_vector_of.html create mode 100644 doc/html/boost/container/pmr/stable_vector_of.html create mode 100644 doc/html/boost/container/pmr/synchronized_pool_resource.html create mode 100644 doc/html/boost/container/pmr/unsynchr_idm46583871327984.html create mode 100644 doc/html/boost/container/pmr/vector_of.html delete mode 100644 doc/html/boost/container/scoped_allocat_idp60083856.html delete mode 100644 doc/html/boost/container/scoped_allocat_idp60096720.html create mode 100644 doc/html/boost/container/swap_idm46583868776832.html delete mode 100644 doc/html/boost/container/swap_idp62383632.html create mode 100644 doc/html/boost/date_time/dynamic__idm45507110490096.html delete mode 100644 doc/html/boost/date_time/dynamic_local_idp103052208.html create mode 100644 doc/html/boost/date_time/fixed_st_idm45507094246048.html create mode 100644 doc/html/boost/date_time/fixed_st_idm45507095938400.html delete mode 100644 doc/html/boost/date_time/fixed_string__idp103198160.html delete mode 100644 doc/html/boost/date_time/fixed_string_t_idp96468336.html create mode 100644 doc/html/boost/date_time/from_str_idm45507086264992.html create mode 100644 doc/html/boost/date_time/from_str_idm45507108860000.html create mode 100644 doc/html/boost/date_time/from_str_idm45507110254160.html create mode 100644 doc/html/boost/date_time/from_str_idm45507131471248.html delete mode 100644 doc/html/boost/date_time/from_stream_t_idp102084000.html delete mode 100644 doc/html/boost/date_time/from_stream_t_idp103304976.html delete mode 100644 doc/html/boost/date_time/from_stream_ty_idp73045008.html delete mode 100644 doc/html/boost/date_time/from_stream_ty_idp94879648.html create mode 100644 doc/html/boost/date_time/iso_form_idm45507101202000.html delete mode 100644 doc/html/boost/date_time/iso_format_ba_idp104759696.html create mode 100644 doc/html/boost/date_time/operator_idm45507093183424.html delete mode 100644 doc/html/boost/date_time/operator_idp102086480.html create mode 100644 doc/html/boost/date_time/ostream__idm45507093288816.html create mode 100644 doc/html/boost/date_time/ostream__idm45507132748752.html delete mode 100644 doc/html/boost/date_time/ostream_time_d_idp75152960.html delete mode 100644 doc/html/boost/date_time/ostream_time_p_idp94853696.html create mode 100644 doc/html/boost/date_time/parse_de_idm45507103907392.html delete mode 100644 doc/html/boost/date_time/parse_delimit_idp112715600.html create mode 100644 doc/html/boost/date_time/simple_f_idm45507093224352.html delete mode 100644 doc/html/boost/date_time/simple_format__idp39965872.html delete mode 100644 doc/html/boost/date_time/str_from_delim_idp99809040.html create mode 100644 doc/html/boost/date_time/str_from_idm45507164216160.html create mode 100644 doc/html/boost/date_time/time_res_idm45507110033680.html create mode 100644 doc/html/boost/date_time/time_res_idm45507130513984.html create mode 100644 doc/html/boost/date_time/time_res_idm45507155150400.html create mode 100644 doc/html/boost/date_time/time_res_idm45507162469520.html delete mode 100644 doc/html/boost/date_time/time_resoluti_idp110216112.html delete mode 100644 doc/html/boost/date_time/time_resoluti_idp112449952.html delete mode 100644 doc/html/boost/date_time/time_resolutio_idp37920384.html delete mode 100644 doc/html/boost/date_time/time_resolutio_idp95321136.html create mode 100644 doc/html/boost/enable_m_idm45506990224064.html delete mode 100644 doc/html/boost/enable_move_u_idp163645968.html create mode 100644 doc/html/boost/get_idm45507165650576.html delete mode 100644 doc/html/boost/get_idp351465872.html create mode 100644 doc/html/boost/graph_tr_idm45507045405248.html delete mode 100644 doc/html/boost/graph_traits__idp106738368.html create mode 100644 doc/html/boost/gregorian/operator_idm45507086143184.html create mode 100644 doc/html/boost/gregorian/operator_idm45507108910016.html create mode 100644 doc/html/boost/gregorian/operator_idm45507108917616.html create mode 100644 doc/html/boost/gregorian/operator_idm45507110309184.html delete mode 100644 doc/html/boost/gregorian/operator_idp102151328.html delete mode 100644 doc/html/boost/gregorian/operator_idp102157104.html delete mode 100644 doc/html/boost/gregorian/operator_idp114794880.html delete mode 100644 doc/html/boost/gregorian/operator_idp37883696.html delete mode 100644 doc/html/boost/has_move_emul_idp106862080.html create mode 100644 doc/html/boost/has_move_idm45506979323984.html create mode 100644 doc/html/boost/has_triv_idm45507104705360.html delete mode 100644 doc/html/boost/has_trivial_d_idp221516000.html create mode 100644 doc/html/boost/hash_T_idm45507162576784.html delete mode 100644 doc/html/boost/hash_T_idp31087024.html create mode 100644 doc/html/boost/hash_boo_idm45507130924768.html delete mode 100644 doc/html/boost/hash_bool_idp39904160.html create mode 100644 doc/html/boost/hash_cha_idm45507155605728.html delete mode 100644 doc/html/boost/hash_char_idp115269568.html create mode 100644 doc/html/boost/hash_dou_idm45507091796448.html delete mode 100644 doc/html/boost/hash_double_idp47931856.html create mode 100644 doc/html/boost/hash_flo_idm45507151806784.html delete mode 100644 doc/html/boost/hash_float_idp94718704.html create mode 100644 doc/html/boost/hash_int_idm45507129209328.html delete mode 100644 doc/html/boost/hash_int_idp44717040.html create mode 100644 doc/html/boost/hash_lon_idm45507135588752.html create mode 100644 doc/html/boost/hash_lon_idm45507152187984.html create mode 100644 doc/html/boost/hash_lon_idm45507161501456.html delete mode 100644 doc/html/boost/hash_long_doub_idp75363296.html delete mode 100644 doc/html/boost/hash_long_idp112322912.html delete mode 100644 doc/html/boost/hash_long_long_idp37021984.html create mode 100644 doc/html/boost/hash_sho_idm45507086428944.html delete mode 100644 doc/html/boost/hash_short_idp108298208.html create mode 100644 doc/html/boost/hash_sig_idm45507154819552.html delete mode 100644 doc/html/boost/hash_signed_c_idp108738576.html create mode 100644 doc/html/boost/hash_std_idm45507089085408.html create mode 100644 doc/html/boost/hash_std_idm45507150036736.html create mode 100644 doc/html/boost/hash_std_idm45507162771328.html delete mode 100644 doc/html/boost/hash_std_strin_idp49656032.html delete mode 100644 doc/html/boost/hash_std_type__idp71799568.html delete mode 100644 doc/html/boost/hash_std_wstri_idp47982592.html create mode 100644 doc/html/boost/hash_uns_idm45507098692080.html create mode 100644 doc/html/boost/hash_uns_idm45507103921888.html create mode 100644 doc/html/boost/hash_uns_idm45507132092672.html create mode 100644 doc/html/boost/hash_uns_idm45507132564400.html create mode 100644 doc/html/boost/hash_uns_idm45507151120816.html delete mode 100644 doc/html/boost/hash_unsigned__idp36145056.html delete mode 100644 doc/html/boost/hash_unsigned__idp43866112.html delete mode 100644 doc/html/boost/hash_unsigned__idp73029472.html delete mode 100644 doc/html/boost/hash_unsigned__idp93655040.html delete mode 100644 doc/html/boost/hash_unsigned_idp102966432.html create mode 100644 doc/html/boost/hash_val_idm45507037969264.html delete mode 100644 doc/html/boost/hash_value_idp307613776.html create mode 100644 doc/html/boost/hash_wch_idm45507163052656.html delete mode 100644 doc/html/boost/hash_wchar_t_idp51592560.html create mode 100644 doc/html/boost/interprocess/basic_ma_idm45879391291904.html create mode 100644 doc/html/boost/interprocess/basic_ma_idm45879391340624.html create mode 100644 doc/html/boost/interprocess/basic_ma_idm45879391398368.html create mode 100644 doc/html/boost/interprocess/basic_ma_idm45879391506880.html delete mode 100644 doc/html/boost/interprocess/basic_managed__idp35237824.html delete mode 100644 doc/html/boost/interprocess/basic_managed__idp35346336.html delete mode 100644 doc/html/boost/interprocess/basic_managed__idp35404080.html delete mode 100644 doc/html/boost/interprocess/basic_managed__idp35452800.html create mode 100644 doc/html/boost/interprocess/fixed_ma_idm45879391350304.html delete mode 100644 doc/html/boost/interprocess/fixed_managed__idp35394400.html create mode 100644 doc/html/boost/interprocess/interpro_idm45879390017344.html create mode 100644 doc/html/boost/interprocess/interpro_idm45879390048160.html create mode 100644 doc/html/boost/interprocess/interpro_idm45879390093552.html delete mode 100644 doc/html/boost/interprocess/interprocess_r_idp36585488.html delete mode 100644 doc/html/boost/interprocess/interprocess_s_idp36630880.html delete mode 100644 doc/html/boost/interprocess/interprocess_u_idp36661696.html create mode 100644 doc/html/boost/interprocess/make_man_idm45879390476912.html create mode 100644 doc/html/boost/interprocess/make_man_idm45879390481424.html delete mode 100644 doc/html/boost/interprocess/make_managed_s_idp36242448.html delete mode 100644 doc/html/boost/interprocess/make_managed_s_idp36246960.html create mode 100644 doc/html/boost/interprocess/managed__idm45879391301552.html delete mode 100644 doc/html/boost/interprocess/managed_window_idp35443152.html delete mode 100644 doc/html/boost/interprocess/operator___idp34259840.html delete mode 100644 doc/html/boost/interprocess/operator___idp34268112.html delete mode 100644 doc/html/boost/interprocess/operator___idp34348368.html delete mode 100644 doc/html/boost/interprocess/operator___idp34353344.html delete mode 100644 doc/html/boost/interprocess/operator___idp34455312.html delete mode 100644 doc/html/boost/interprocess/operator___idp34463600.html delete mode 100644 doc/html/boost/interprocess/operator___idp34562560.html delete mode 100644 doc/html/boost/interprocess/operator___idp34569120.html delete mode 100644 doc/html/boost/interprocess/operator___idp34662480.html delete mode 100644 doc/html/boost/interprocess/operator___idp34669024.html delete mode 100644 doc/html/boost/interprocess/operator___idp34768432.html delete mode 100644 doc/html/boost/interprocess/operator___idp34776720.html delete mode 100644 doc/html/boost/interprocess/operator___idp34873552.html delete mode 100644 doc/html/boost/interprocess/operator___idp34881840.html delete mode 100644 doc/html/boost/interprocess/operator___idp36012240.html delete mode 100644 doc/html/boost/interprocess/operator___idp36017456.html delete mode 100644 doc/html/boost/interprocess/operator___idp36022672.html delete mode 100644 doc/html/boost/interprocess/operator___idp36027472.html delete mode 100644 doc/html/boost/interprocess/operator___idp36032272.html delete mode 100644 doc/html/boost/interprocess/operator___idp36037072.html create mode 100644 doc/html/boost/interprocess/operator_idm45879390682704.html create mode 100644 doc/html/boost/interprocess/operator_idm45879390687504.html create mode 100644 doc/html/boost/interprocess/operator_idm45879390692304.html create mode 100644 doc/html/boost/interprocess/operator_idm45879390697104.html create mode 100644 doc/html/boost/interprocess/operator_idm45879390701904.html create mode 100644 doc/html/boost/interprocess/operator_idm45879390707120.html create mode 100644 doc/html/boost/interprocess/operator_idm45879390712336.html create mode 100644 doc/html/boost/interprocess/operator_idm45879391003744.html create mode 100644 doc/html/boost/interprocess/operator_idm45879391010656.html create mode 100644 doc/html/boost/interprocess/operator_idm45879391863280.html create mode 100644 doc/html/boost/interprocess/operator_idm45879391871568.html create mode 100644 doc/html/boost/interprocess/operator_idm45879391968400.html create mode 100644 doc/html/boost/interprocess/operator_idm45879391976688.html create mode 100644 doc/html/boost/interprocess/operator_idm45879392076096.html create mode 100644 doc/html/boost/interprocess/operator_idm45879392082640.html create mode 100644 doc/html/boost/interprocess/operator_idm45879392176000.html create mode 100644 doc/html/boost/interprocess/operator_idm45879392182560.html create mode 100644 doc/html/boost/interprocess/operator_idm45879392281520.html create mode 100644 doc/html/boost/interprocess/operator_idm45879392289808.html create mode 100644 doc/html/boost/interprocess/operator_idm45879392391776.html create mode 100644 doc/html/boost/interprocess/operator_idm45879392396752.html create mode 100644 doc/html/boost/interprocess/operator_idm45879392477104.html create mode 100644 doc/html/boost/interprocess/operator_idm45879392485376.html delete mode 100644 doc/html/boost/interprocess/operator_idp35714560.html delete mode 100644 doc/html/boost/interprocess/operator_idp35721472.html delete mode 100644 doc/html/boost/interprocess/operator_idp36041872.html create mode 100644 doc/html/boost/interprocess/swap_idm45879390627728.html create mode 100644 doc/html/boost/interprocess/swap_idm45879390678048.html delete mode 100644 doc/html/boost/interprocess/swap_idp36046528.html delete mode 100644 doc/html/boost/interprocess/swap_idp36096848.html create mode 100644 doc/html/boost/interprocess/to_raw_p_idm45879390622336.html create mode 100644 doc/html/boost/interprocess/to_raw_p_idm45879390668304.html delete mode 100644 doc/html/boost/interprocess/to_raw_pointer_idp36056272.html delete mode 100644 doc/html/boost/interprocess/to_raw_pointer_idp36102240.html create mode 100644 doc/html/boost/interprocess/weak_ptr.html create mode 100644 doc/html/boost/interprocess/wfixed_m_idm45879391346576.html delete mode 100644 doc/html/boost/interprocess/wfixed_managed_idp35398128.html create mode 100644 doc/html/boost/interprocess/wmanaged_idm45879391297840.html delete mode 100644 doc/html/boost/interprocess/wmanaged_windo_idp35446864.html create mode 100644 doc/html/boost/intrusive/get_pare_idm46322884338032.html create mode 100644 doc/html/boost/intrusive/get_pare_idm46322884342304.html delete mode 100644 doc/html/boost/intrusive/get_parent_fro_idp48890800.html delete mode 100644 doc/html/boost/intrusive/get_parent_fro_idp48895072.html create mode 100644 doc/html/boost/intrusive/make_uno_idm46322874274752.html create mode 100644 doc/html/boost/intrusive/make_uno_idm46322874278544.html delete mode 100644 doc/html/boost/intrusive/make_unordered_idp58605632.html delete mode 100644 doc/html/boost/intrusive/make_unordered_idp58609424.html create mode 100644 doc/html/boost/intrusive/max_poin_idm46322884327776.html delete mode 100644 doc/html/boost/intrusive/max_pointer_pl_idp48905328.html create mode 100644 doc/html/boost/intrusive/pointer__idm46322884203360.html create mode 100644 doc/html/boost/intrusive/pointer__idm46322884203360/rebind_pointer.html create mode 100644 doc/html/boost/intrusive/pointer__idm46322884251312.html create mode 100644 doc/html/boost/intrusive/pointer__idm46322884255808.html create mode 100644 doc/html/boost/intrusive/pointer__idm46322884259472.html create mode 100644 doc/html/boost/intrusive/pointer__idm46322884263136.html create mode 100644 doc/html/boost/intrusive/pointer__idm46322884274320.html create mode 100644 doc/html/boost/intrusive/pointer__idm46322884320704.html delete mode 100644 doc/html/boost/intrusive/pointer_plus_b_idp48912400.html delete mode 100644 doc/html/boost/intrusive/pointer_rebind_idp48958784.html delete mode 100644 doc/html/boost/intrusive/pointer_rebind_idp48969968.html delete mode 100644 doc/html/boost/intrusive/pointer_rebind_idp48973632.html delete mode 100644 doc/html/boost/intrusive/pointer_rebind_idp48977296.html delete mode 100644 doc/html/boost/intrusive/pointer_rebind_idp48981792.html delete mode 100644 doc/html/boost/intrusive/pointer_traits_idp49029744.html delete mode 100644 doc/html/boost/intrusive/pointer_traits_idp49029744/rebind_pointer.html create mode 100644 doc/html/boost/lambda/plain_re_idm45506851725664.html create mode 100644 doc/html/boost/lambda/plain_re_idm45506851731488.html create mode 100644 doc/html/boost/lambda/plain_re_idm45506851738592.html create mode 100644 doc/html/boost/lambda/plain_re_idm45506851745680.html create mode 100644 doc/html/boost/lambda/plain_re_idm45506851751520.html create mode 100644 doc/html/boost/lambda/plain_re_idm45506851755408.html create mode 100644 doc/html/boost/lambda/plain_re_idm45506851761152.html create mode 100644 doc/html/boost/lambda/plain_re_idm45506851766352.html create mode 100644 doc/html/boost/lambda/plain_re_idm45506851772560.html create mode 100644 doc/html/boost/lambda/plain_re_idm45506851779664.html create mode 100644 doc/html/boost/lambda/plain_re_idm45506851786752.html create mode 100644 doc/html/boost/lambda/plain_re_idm45506851792512.html create mode 100644 doc/html/boost/lambda/plain_re_idm45506851799616.html create mode 100644 doc/html/boost/lambda/plain_re_idm45506851806704.html create mode 100644 doc/html/boost/lambda/plain_re_idm45506851811904.html create mode 100644 doc/html/boost/lambda/plain_re_idm45506851818112.html create mode 100644 doc/html/boost/lambda/plain_re_idm45506851823936.html create mode 100644 doc/html/boost/lambda/plain_re_idm45506851831040.html create mode 100644 doc/html/boost/lambda/plain_re_idm45506851838128.html create mode 100644 doc/html/boost/lambda/plain_re_idm45506851843968.html create mode 100644 doc/html/boost/lambda/plain_re_idm45506851847856.html create mode 100644 doc/html/boost/lambda/plain_re_idm45506851851472.html create mode 100644 doc/html/boost/lambda/plain_re_idm45506851857216.html create mode 100644 doc/html/boost/lambda/plain_re_idm45506851862416.html create mode 100644 doc/html/boost/lambda/plain_re_idm45506851869520.html create mode 100644 doc/html/boost/lambda/plain_re_idm45506851876608.html create mode 100644 doc/html/boost/lambda/plain_re_idm45506851882368.html create mode 100644 doc/html/boost/lambda/plain_re_idm45506851889472.html create mode 100644 doc/html/boost/lambda/plain_re_idm45506851896560.html create mode 100644 doc/html/boost/lambda/plain_re_idm45506851901760.html create mode 100644 doc/html/boost/lambda/plain_re_idm45506851906656.html create mode 100644 doc/html/boost/lambda/plain_re_idm45506851911568.html create mode 100644 doc/html/boost/lambda/plain_re_idm45506851916464.html create mode 100644 doc/html/boost/lambda/plain_re_idm45506851921376.html delete mode 100644 doc/html/boost/lambda/plain_return__idp347042880.html delete mode 100644 doc/html/boost/lambda/plain_return__idp347047792.html delete mode 100644 doc/html/boost/lambda/plain_return__idp347052688.html delete mode 100644 doc/html/boost/lambda/plain_return__idp347057600.html delete mode 100644 doc/html/boost/lambda/plain_return__idp347062496.html delete mode 100644 doc/html/boost/lambda/plain_return__idp347067696.html delete mode 100644 doc/html/boost/lambda/plain_return__idp347074784.html delete mode 100644 doc/html/boost/lambda/plain_return__idp347081888.html delete mode 100644 doc/html/boost/lambda/plain_return__idp347087648.html delete mode 100644 doc/html/boost/lambda/plain_return__idp347094736.html delete mode 100644 doc/html/boost/lambda/plain_return__idp347101840.html delete mode 100644 doc/html/boost/lambda/plain_return__idp347107040.html delete mode 100644 doc/html/boost/lambda/plain_return__idp347112784.html delete mode 100644 doc/html/boost/lambda/plain_return__idp347116400.html delete mode 100644 doc/html/boost/lambda/plain_return__idp347120288.html delete mode 100644 doc/html/boost/lambda/plain_return__idp347126128.html delete mode 100644 doc/html/boost/lambda/plain_return__idp347133216.html delete mode 100644 doc/html/boost/lambda/plain_return__idp347140320.html delete mode 100644 doc/html/boost/lambda/plain_return__idp347146144.html delete mode 100644 doc/html/boost/lambda/plain_return__idp347152352.html delete mode 100644 doc/html/boost/lambda/plain_return__idp347157552.html delete mode 100644 doc/html/boost/lambda/plain_return__idp347164640.html delete mode 100644 doc/html/boost/lambda/plain_return__idp347171744.html delete mode 100644 doc/html/boost/lambda/plain_return__idp347177504.html delete mode 100644 doc/html/boost/lambda/plain_return__idp347184592.html delete mode 100644 doc/html/boost/lambda/plain_return__idp347191696.html delete mode 100644 doc/html/boost/lambda/plain_return__idp347197904.html delete mode 100644 doc/html/boost/lambda/plain_return__idp347203104.html delete mode 100644 doc/html/boost/lambda/plain_return__idp347208848.html delete mode 100644 doc/html/boost/lambda/plain_return__idp347212736.html delete mode 100644 doc/html/boost/lambda/plain_return__idp347218576.html delete mode 100644 doc/html/boost/lambda/plain_return__idp347225664.html delete mode 100644 doc/html/boost/lambda/plain_return__idp347232768.html delete mode 100644 doc/html/boost/lambda/plain_return__idp347238592.html create mode 100644 doc/html/boost/last_val_idm45507100097776.html delete mode 100644 doc/html/boost/last_value_vo_idp110570544.html delete mode 100644 doc/html/boost/local_time/operator-__idp112002944.html delete mode 100644 doc/html/boost/local_time/operator-__idp112016272.html delete mode 100644 doc/html/boost/local_time/operator-_idp112012848.html delete mode 100644 doc/html/boost/local_time/operator-_idp38322288.html delete mode 100644 doc/html/boost/local_time/operator___idp112009600.html delete mode 100644 doc/html/boost/local_time/operator___idp38319040.html delete mode 100644 doc/html/boost/local_time/operator__idp112006192.html delete mode 100644 doc/html/boost/local_time/operator__idp38315632.html create mode 100644 doc/html/boost/local_time/operator_idm45507089108976.html create mode 100644 doc/html/boost/local_time/operator_idm45507089112224.html create mode 100644 doc/html/boost/local_time/operator_idm45507089115632.html create mode 100644 doc/html/boost/local_time/operator_idm45507089118880.html create mode 100644 doc/html/boost/local_time/operator_idm45507089122288.html create mode 100644 doc/html/boost/local_time/operator_idm45507092037088.html create mode 100644 doc/html/boost/local_time/operator_idm45507092040512.html create mode 100644 doc/html/boost/local_time/operator_idm45507092043760.html create mode 100644 doc/html/boost/logic/get_defa_idm45507104701424.html delete mode 100644 doc/html/boost/logic/get_default_i_idp154719632.html delete mode 100644 doc/html/boost/logic/operator___idp38768448.html delete mode 100644 doc/html/boost/logic/operator___idp51294368.html delete mode 100644 doc/html/boost/logic/operator___idp96741552.html delete mode 100644 doc/html/boost/logic/operator__idp45706720.html create mode 100644 doc/html/boost/logic/operator_idm45506983089584.html create mode 100644 doc/html/boost/logic/operator_idm45506993963376.html create mode 100644 doc/html/boost/logic/operator_idm45507041012704.html create mode 100644 doc/html/boost/logic/operator_idm45507048922256.html create mode 100644 doc/html/boost/logic/operator_idm45507093800208.html create mode 100644 doc/html/boost/logic/operator_idm45507093816016.html create mode 100644 doc/html/boost/logic/operator_idm45507099076384.html create mode 100644 doc/html/boost/logic/operator_idm45507104075136.html delete mode 100644 doc/html/boost/logic/operator_idp104323600.html delete mode 100644 doc/html/boost/logic/operator_idp154599264.html delete mode 100644 doc/html/boost/logic/operator_idp158797600.html delete mode 100644 doc/html/boost/logic/operator_idp48877552.html create mode 100644 doc/html/boost/make_rec_idm45507101497936.html delete mode 100644 doc/html/boost/make_recursiv_idp352653296.html create mode 100644 doc/html/boost/move_idm45507105093488.html create mode 100644 doc/html/boost/move_idm45507111136736.html delete mode 100644 doc/html/boost/move_idp106413712.html delete mode 100644 doc/html/boost/move_idp207498784.html create mode 100644 doc/html/boost/move_if__idm45507039180160.html delete mode 100644 doc/html/boost/move_upd/bool_conversion.html delete mode 100644 doc/html/boost/move_upd/def_del_compatible_cond.html delete mode 100644 doc/html/boost/move_upd/deleter_types.html delete mode 100644 doc/html/boost/move_upd/enable_def_del.html delete mode 100644 doc/html/boost/move_upd/enable_defdel_call.html delete mode 100644 doc/html/boost/move_upd/enable_up_moveconv_assign.html delete mode 100644 doc/html/boost/move_upd/enable_up_moveconv_constr.html delete mode 100644 doc/html/boost/move_upd/enable_up_ptr.html delete mode 100644 doc/html/boost/move_upd/get_cvelement.html delete mode 100644 doc/html/boost/move_upd/get_element_t_idp214518816.html delete mode 100644 doc/html/boost/move_upd/get_element_type.html delete mode 100644 doc/html/boost/move_upd/get_element_type/DefaultWrap.html delete mode 100644 doc/html/boost/move_upd/is_rvalue_convertible.html delete mode 100644 doc/html/boost/move_upd/is_rvalue_convertible/false_t.html delete mode 100644 doc/html/boost/move_upd/is_same_cvele_idp214489504.html delete mode 100644 doc/html/boost/move_upd/is_unique_ptr_convertible.html delete mode 100644 doc/html/boost/move_upd/is_unique_ptr_idp207464816.html delete mode 100644 doc/html/boost/move_upd/nullptr_type.html delete mode 100644 doc/html/boost/move_upd/unique_delete_idp207431200.html delete mode 100644 doc/html/boost/move_upd/unique_delete_idp207468160.html delete mode 100644 doc/html/boost/move_upd/unique_moveco_idp207435136.html delete mode 100644 doc/html/boost/move_upd/unique_ptr_da_idp203566208.html delete mode 100644 doc/html/boost/move_upd/unique_ptr_data.html create mode 100644 doc/html/boost/movelib/make_uni_idm45507091094560.html create mode 100644 doc/html/boost/movelib/make_uni_idm45507091099536.html create mode 100644 doc/html/boost/movelib/make_uni_idm45507091739024.html create mode 100644 doc/html/boost/movelib/make_uni_idm45507091743264.html create mode 100644 doc/html/boost/movelib/make_uni_idm45507097741232.html create mode 100644 doc/html/boost/movelib/make_uni_idm45507098189296.html create mode 100644 doc/html/boost/movelib/make_uni_idm45507102529152.html create mode 100644 doc/html/boost/movelib/make_uni_idm45507103445360.html create mode 100644 doc/html/boost/movelib/make_uni_idm45507103449648.html create mode 100644 doc/html/boost/movelib/make_uni_idm45507104315232.html create mode 100644 doc/html/boost/movelib/make_uni_idm45507110937472.html create mode 100644 doc/html/boost/movelib/make_uni_idm45507110955264.html delete mode 100644 doc/html/boost/movelib/make_unique_d_idp101273888.html delete mode 100644 doc/html/boost/movelib/make_unique_d_idp224536720.html delete mode 100644 doc/html/boost/movelib/make_unique_d_idp226298144.html delete mode 100644 doc/html/boost/movelib/make_unique_idp151938176.html delete mode 100644 doc/html/boost/movelib/make_unique_idp201646016.html delete mode 100644 doc/html/boost/movelib/make_unique_idp224573072.html delete mode 100644 doc/html/boost/movelib/make_unique_n_idp101278080.html delete mode 100644 doc/html/boost/movelib/make_unique_n_idp154420480.html delete mode 100644 doc/html/boost/movelib/make_unique_n_idp224504784.html delete mode 100644 doc/html/boost/movelib/make_unique_n_idp224541008.html delete mode 100644 doc/html/boost/movelib/make_unique_n_idp226228752.html delete mode 100644 doc/html/boost/movelib/make_unique_n_idp226293136.html delete mode 100644 doc/html/boost/movelib/operator___idp102237008.html delete mode 100644 doc/html/boost/movelib/operator___idp102242064.html delete mode 100644 doc/html/boost/movelib/operator___idp108149184.html delete mode 100644 doc/html/boost/movelib/operator___idp111132784.html delete mode 100644 doc/html/boost/movelib/operator___idp114161104.html delete mode 100644 doc/html/boost/movelib/operator___idp154397872.html delete mode 100644 doc/html/boost/movelib/operator___idp154412416.html delete mode 100644 doc/html/boost/movelib/operator___idp68030480.html delete mode 100644 doc/html/boost/movelib/operator___idp68035984.html delete mode 100644 doc/html/boost/movelib/operator___idp92661952.html delete mode 100644 doc/html/boost/movelib/operator___idp93814816.html delete mode 100644 doc/html/boost/movelib/operator___idp95378464.html create mode 100644 doc/html/boost/movelib/operator_idm45507039736960.html create mode 100644 doc/html/boost/movelib/operator_idm45507043441072.html create mode 100644 doc/html/boost/movelib/operator_idm45507043992192.html create mode 100644 doc/html/boost/movelib/operator_idm45507045351216.html create mode 100644 doc/html/boost/movelib/operator_idm45507048472480.html create mode 100644 doc/html/boost/movelib/operator_idm45507048477536.html create mode 100644 doc/html/boost/movelib/operator_idm45507088427888.html create mode 100644 doc/html/boost/movelib/operator_idm45507094562544.html create mode 100644 doc/html/boost/movelib/operator_idm45507094681568.html create mode 100644 doc/html/boost/movelib/operator_idm45507096735552.html create mode 100644 doc/html/boost/movelib/operator_idm45507096741056.html create mode 100644 doc/html/boost/movelib/operator_idm45507098051056.html create mode 100644 doc/html/boost/movelib/operator_idm45507101134656.html create mode 100644 doc/html/boost/movelib/operator_idm45507104752784.html create mode 100644 doc/html/boost/movelib/operator_idm45507107568208.html create mode 100644 doc/html/boost/movelib/operator_idm45507109686992.html create mode 100644 doc/html/boost/movelib/operator_idm45507109692496.html create mode 100644 doc/html/boost/movelib/operator_idm45507163238016.html delete mode 100644 doc/html/boost/movelib/operator_idp101104320.html delete mode 100644 doc/html/boost/movelib/operator_idp105771664.html delete mode 100644 doc/html/boost/movelib/operator_idp151794496.html delete mode 100644 doc/html/boost/movelib/operator_idp154404928.html delete mode 100644 doc/html/boost/movelib/operator_idp92667008.html delete mode 100644 doc/html/boost/movelib/operator_idp96679536.html create mode 100644 doc/html/boost/movelib/swap_idm45507037906240.html delete mode 100644 doc/html/boost/movelib/swap_idp95372832.html create mode 100644 doc/html/boost/mpi/allocato_idm45506984689984.html create mode 100644 doc/html/boost/mpi/allocato_idm45506984689984/rebind.html delete mode 100644 doc/html/boost/mpi/allocator_voi_idp114760400.html delete mode 100644 doc/html/boost/mpi/allocator_voi_idp114760400/rebind.html create mode 100644 doc/html/boost/mpi/get_idm45507160469824.html create mode 100644 doc/html/boost/mpi/get_idm45507160473392.html delete mode 100644 doc/html/boost/mpi/get_idp110722032.html delete mode 100644 doc/html/boost/mpi/get_idp224410352.html create mode 100644 doc/html/boost/mpi/get_mpi__idm45507086028144.html delete mode 100644 doc/html/boost/mpi/get_mpi_datat_idp216170320.html create mode 100644 doc/html/boost/mpi/inplace__idm45506988730224.html delete mode 100644 doc/html/boost/mpi/inplace_t_T_idp205769904.html create mode 100644 doc/html/boost/mpi/is_mpi_f_idm45507104405744.html delete mode 100644 doc/html/boost/mpi/is_mpi_floati_idp216202464.html delete mode 100644 doc/html/boost/mpi/operator-_idp207337216.html delete mode 100644 doc/html/boost/mpi/operator___idp209197264.html delete mode 100644 doc/html/boost/mpi/operator___idp214478720.html delete mode 100644 doc/html/boost/mpi/operator___idp226217008.html delete mode 100644 doc/html/boost/mpi/operator___idp226222384.html delete mode 100644 doc/html/boost/mpi/operator___idp92471168.html delete mode 100644 doc/html/boost/mpi/operator___idp92477408.html delete mode 100644 doc/html/boost/mpi/operator__idp207491760.html create mode 100644 doc/html/boost/mpi/operator_idm45506986350816.html create mode 100644 doc/html/boost/mpi/operator_idm45506986357056.html create mode 100644 doc/html/boost/mpi/operator_idm45507038807728.html create mode 100644 doc/html/boost/mpi/operator_idm45507042831024.html create mode 100644 doc/html/boost/mpi/operator_idm45507042836400.html create mode 100644 doc/html/boost/mpi/operator_idm45507094512656.html create mode 100644 doc/html/boost/mpi/operator_idm45507094518064.html create mode 100644 doc/html/boost/mpi/operator_idm45507102919600.html create mode 100644 doc/html/boost/mpi/operator_idm45507106437360.html delete mode 100644 doc/html/boost/mpi/operator_idp209202672.html create mode 100644 doc/html/boost/mpi/python/register_idm45507048514256.html delete mode 100644 doc/html/boost/mpi/python/register_skel_idp114524160.html create mode 100644 doc/html/boost/mpi/threading/operator_idm45507037552864.html create mode 100644 doc/html/boost/mpi/threading/operator_idm45507098853648.html delete mode 100644 doc/html/boost/mpi/threading/operator_idp203436240.html delete mode 100644 doc/html/boost/mpi/threading/operator_idp203438896.html delete mode 100644 doc/html/boost/numeric/functional/as_max_T__std__idp67419120.html delete mode 100644 doc/html/boost/numeric/functional/as_max_T__std__idp67495600.html create mode 100644 doc/html/boost/numeric/functional/as_max_T_idm45507138916016.html create mode 100644 doc/html/boost/numeric/functional/as_max_T_idm45507138992496.html delete mode 100644 doc/html/boost/numeric/functional/as_min_T__std__idp67424192.html delete mode 100644 doc/html/boost/numeric/functional/as_min_T__std__idp67500672.html create mode 100644 doc/html/boost/numeric/functional/as_min_T_idm45507138910944.html create mode 100644 doc/html/boost/numeric/functional/as_min_T_idm45507138987424.html create mode 100644 doc/html/boost/numeric/functional/as_min_b_idm45507139322576.html delete mode 100644 doc/html/boost/numeric/functional/as_min_base_Ar_idp67089040.html delete mode 100644 doc/html/boost/numeric/functional/as_one_T__std__idp67429264.html delete mode 100644 doc/html/boost/numeric/functional/as_one_T__std__idp67505744.html create mode 100644 doc/html/boost/numeric/functional/as_one_T_idm45507138905872.html create mode 100644 doc/html/boost/numeric/functional/as_one_T_idm45507138982352.html delete mode 100644 doc/html/boost/numeric/functional/as_zero_T__std_idp67434336.html delete mode 100644 doc/html/boost/numeric/functional/as_zero_T__std_idp67510816.html create mode 100644 doc/html/boost/numeric/functional/as_zero__idm45507138900800.html create mode 100644 doc/html/boost/numeric/functional/as_zero__idm45507138977280.html create mode 100644 doc/html/boost/numeric/functional/fdiv_Lef_idm45507138895728.html create mode 100644 doc/html/boost/numeric/functional/fdiv_Lef_idm45507138972208.html delete mode 100644 doc/html/boost/numeric/functional/fdiv_Left__Rig_idp67439408.html delete mode 100644 doc/html/boost/numeric/functional/fdiv_Left__Rig_idp67515888.html create mode 100644 doc/html/boost/numeric/functional/fdiv_bas_idm45507139240192.html delete mode 100644 doc/html/boost/numeric/functional/fdiv_base_Left_idp67171424.html create mode 100644 doc/html/boost/numeric/functional/max_assi_idm45507138891984.html create mode 100644 doc/html/boost/numeric/functional/max_assi_idm45507138967904.html delete mode 100644 doc/html/boost/numeric/functional/max_assign_Lef_idp67443712.html delete mode 100644 doc/html/boost/numeric/functional/max_assign_Lef_idp67519632.html create mode 100644 doc/html/boost/numeric/functional/min_assi_idm45507138885088.html create mode 100644 doc/html/boost/numeric/functional/min_assi_idm45507138961008.html delete mode 100644 doc/html/boost/numeric/functional/min_assign_Lef_idp67450608.html delete mode 100644 doc/html/boost/numeric/functional/min_assign_Lef_idp67526528.html delete mode 100644 doc/html/boost/numeric/functional/multiply_and_p_idp65905632.html delete mode 100644 doc/html/boost/numeric/functional/outer_product.html delete mode 100644 doc/html/boost/numeric/functional/outer_product__idp64902832.html delete mode 100644 doc/html/boost/numeric/functional/outer_product_base.html delete mode 100644 doc/html/boost/numeric/functional/promote_ToFrom_idp67472480.html delete mode 100644 doc/html/boost/numeric/functional/promote_ToFrom_idp67539616.html delete mode 100644 doc/html/boost/numeric/functional/promote_To__Fr_idp67466288.html delete mode 100644 doc/html/boost/numeric/functional/promote_To__Fr_idp67533424.html create mode 100644 doc/html/boost/numeric/functional/promote__idm45507138872000.html create mode 100644 doc/html/boost/numeric/functional/promote__idm45507138878192.html create mode 100644 doc/html/boost/numeric/functional/promote__idm45507138939136.html create mode 100644 doc/html/boost/numeric/functional/promote__idm45507138945328.html create mode 100644 doc/html/boost/numeric/functional/promote__idm45507138950960.html create mode 100644 doc/html/boost/numeric/functional/promote__idm45507138954112.html create mode 100644 doc/html/boost/numeric/functional/promote__idm45507139047504.html delete mode 100644 doc/html/boost/numeric/functional/promote_base_T_idp67364112.html delete mode 100644 doc/html/boost/numeric/functional/promote_bool___idp67460656.html delete mode 100644 doc/html/boost/numeric/functional/promote_bool_c_idp67457504.html create mode 100644 doc/html/boost/numeric/functional/tag_std__idm45507138866368.html create mode 100644 doc/html/boost/numeric/functional/tag_std__idm45507138933504.html delete mode 100644 doc/html/boost/numeric/functional/tag_std_valarr_idp67478112.html delete mode 100644 doc/html/boost/numeric/functional/tag_std_vector_idp67545248.html delete mode 100644 doc/html/boost/numeric/op/outer_product.html delete mode 100644 doc/html/boost/operator___idp24809744.html delete mode 100644 doc/html/boost/operator___idp24836512.html delete mode 100644 doc/html/boost/operator___idp24864848.html delete mode 100644 doc/html/boost/operator___idp24879024.html create mode 100644 doc/html/boost/operator_idm45506846622160.html create mode 100644 doc/html/boost/operator_idm45713141989760.html create mode 100644 doc/html/boost/operator_idm45713142003936.html create mode 100644 doc/html/boost/operator_idm45713142018112.html create mode 100644 doc/html/boost/operator_idm45713142032272.html create mode 100644 doc/html/boost/operator_idm45713142045616.html create mode 100644 doc/html/boost/operator_idm45713142059040.html delete mode 100644 doc/html/boost/operator_idp24823168.html delete mode 100644 doc/html/boost/operator_idp24850672.html delete mode 100644 doc/html/boost/operator_idp312686896.html create mode 100644 doc/html/boost/posix_time/millisec_idm45507135057104.html delete mode 100644 doc/html/boost/posix_time/millisec_posi_idp112084736.html delete mode 100644 doc/html/boost/posix_time/operator-__idp101451904.html delete mode 100644 doc/html/boost/posix_time/operator-__idp111954528.html delete mode 100644 doc/html/boost/posix_time/operator-_idp101448512.html delete mode 100644 doc/html/boost/posix_time/operator-_idp111951120.html delete mode 100644 doc/html/boost/posix_time/operator___idp101445280.html delete mode 100644 doc/html/boost/posix_time/operator___idp111947888.html delete mode 100644 doc/html/boost/posix_time/operator__idp101441888.html delete mode 100644 doc/html/boost/posix_time/operator__idp111944496.html create mode 100644 doc/html/boost/posix_time/operator_idm45507094493328.html create mode 100644 doc/html/boost/posix_time/operator_idm45507094496736.html create mode 100644 doc/html/boost/posix_time/operator_idm45507094499968.html create mode 100644 doc/html/boost/posix_time/operator_idm45507107058896.html create mode 100644 doc/html/boost/posix_time/operator_idm45507110093456.html create mode 100644 doc/html/boost/posix_time/operator_idm45507110096688.html create mode 100644 doc/html/boost/posix_time/operator_idm45507110100080.html create mode 100644 doc/html/boost/posix_time/operator_idm45507110103312.html create mode 100644 doc/html/boost/posix_time/operator_idm45507154023312.html delete mode 100644 doc/html/boost/posix_time/operator_idp43055264.html create mode 100644 doc/html/boost/program_options/basic_pa_idm45507044853824.html delete mode 100644 doc/html/boost/program_options/basic_parsed__idp152015376.html create mode 100644 doc/html/boost/program_options/basic_parsed_options.html create mode 100644 doc/html/boost/program_options/invalid__idm45507161390480.html delete mode 100644 doc/html/boost/program_options/invalid_comma_idp163674448.html create mode 100644 doc/html/boost/program_options/options__idm45506977779488.html delete mode 100644 doc/html/boost/program_options/options_descr_idp214375408.html create mode 100644 doc/html/boost/program_options/parse_co_idm45507043055104.html create mode 100644 doc/html/boost/program_options/parse_co_idm45507106389456.html delete mode 100644 doc/html/boost/program_options/parse_config__idp203490384.html delete mode 100644 doc/html/boost/program_options/parse_config__idp206025792.html create mode 100644 doc/html/boost/program_options/parse_en_idm45506972428912.html create mode 100644 doc/html/boost/program_options/parse_en_idm45506995617728.html create mode 100644 doc/html/boost/program_options/parse_en_idm45507039007472.html delete mode 100644 doc/html/boost/program_options/parse_environ_idp154393360.html delete mode 100644 doc/html/boost/program_options/parse_environ_idp224270416.html delete mode 100644 doc/html/boost/program_options/parse_environm_idp75334496.html create mode 100644 doc/html/boost/program_options/position_idm45507094291136.html delete mode 100644 doc/html/boost/program_options/positional_op_idp150873344.html create mode 100644 doc/html/boost/program_options/store_idm45507045051456.html create mode 100644 doc/html/boost/program_options/store_idm45507086881680.html delete mode 100644 doc/html/boost/program_options/store_idp104980944.html delete mode 100644 doc/html/boost/program_options/store_idp219446064.html create mode 100644 doc/html/boost/program_options/too_many_idm45507093966064.html delete mode 100644 doc/html/boost/program_options/too_many_posi_idp112496320.html create mode 100644 doc/html/boost/program_options/value_idm45507036651984.html delete mode 100644 doc/html/boost/program_options/value_idp109113408.html create mode 100644 doc/html/boost/program_options/value_se_idm45507037570000.html create mode 100644 doc/html/boost/program_options/value_se_idm45507102986880.html create mode 100644 doc/html/boost/program_options/value_se_idm45507132697440.html delete mode 100644 doc/html/boost/program_options/value_semanti_idp103539104.html delete mode 100644 doc/html/boost/program_options/value_semanti_idp207166032.html delete mode 100644 doc/html/boost/program_options/value_semantic_idp99204112.html create mode 100644 doc/html/boost/property_tree/customiz_idm45506971496960.html create mode 100644 doc/html/boost/property_tree/customiz_idm45507087332800.html create mode 100644 doc/html/boost/property_tree/customiz_idm45507095445648.html create mode 100644 doc/html/boost/property_tree/customiz_idm45507101050960.html create mode 100644 doc/html/boost/property_tree/customiz_idm45507104805872.html delete mode 100644 doc/html/boost/property_tree/customize_str_idp158967040.html delete mode 100644 doc/html/boost/property_tree/customize_str_idp160898256.html delete mode 100644 doc/html/boost/property_tree/customize_str_idp224460896.html delete mode 100644 doc/html/boost/property_tree/customize_str_idp229460720.html delete mode 100644 doc/html/boost/property_tree/customize_stre_idp95731648.html create mode 100644 doc/html/boost/property_tree/info_parser/read_inf_idm45507037423408.html create mode 100644 doc/html/boost/property_tree/info_parser/read_inf_idm45507037753408.html create mode 100644 doc/html/boost/property_tree/info_parser/read_inf_idm45507039400208.html create mode 100644 doc/html/boost/property_tree/info_parser/read_inf_idm45507043140816.html delete mode 100644 doc/html/boost/property_tree/info_parser/read_info_idp104306320.html delete mode 100644 doc/html/boost/property_tree/info_parser/read_info_idp156124912.html delete mode 100644 doc/html/boost/property_tree/info_parser/read_info_idp212307632.html delete mode 100644 doc/html/boost/property_tree/info_parser/read_info_idp99726240.html create mode 100644 doc/html/boost/property_tree/info_parser/write_in_idm45506993828208.html create mode 100644 doc/html/boost/property_tree/info_parser/write_in_idm45507043418960.html delete mode 100644 doc/html/boost/property_tree/info_parser/write_info_idp205409920.html delete mode 100644 doc/html/boost/property_tree/info_parser/write_info_idp217672016.html create mode 100644 doc/html/boost/property_tree/ini_parser/read_ini_idm45507095400496.html create mode 100644 doc/html/boost/property_tree/ini_parser/read_ini_idm45507111553808.html delete mode 100644 doc/html/boost/property_tree/ini_parser/read_ini_idp101407088.html delete mode 100644 doc/html/boost/property_tree/ini_parser/read_ini_idp230717168.html create mode 100644 doc/html/boost/property_tree/ini_parser/write_in_idm45506981221152.html create mode 100644 doc/html/boost/property_tree/ini_parser/write_in_idm45507103416992.html delete mode 100644 doc/html/boost/property_tree/ini_parser/write_ini_idp155201728.html delete mode 100644 doc/html/boost/property_tree/ini_parser/write_ini_idp205666256.html create mode 100644 doc/html/boost/property_tree/json_parser/read_jso_idm45506991936080.html create mode 100644 doc/html/boost/property_tree/json_parser/read_jso_idm45507048694352.html delete mode 100644 doc/html/boost/property_tree/json_parser/read_json_idp110658880.html delete mode 100644 doc/html/boost/property_tree/json_parser/read_json_idp205445056.html create mode 100644 doc/html/boost/property_tree/json_parser/write_js_idm45506991747200.html create mode 100644 doc/html/boost/property_tree/json_parser/write_js_idm45507045482448.html delete mode 100644 doc/html/boost/property_tree/json_parser/write_json_idp106721152.html delete mode 100644 doc/html/boost/property_tree/json_parser/write_json_idp214458256.html create mode 100644 doc/html/boost/property_tree/load_idm45507150470080.html delete mode 100644 doc/html/boost/property_tree/load_idp205463792.html create mode 100644 doc/html/boost/property_tree/path_of__idm45507049288992.html delete mode 100644 doc/html/boost/property_tree/path_of_std_b_idp106753552.html create mode 100644 doc/html/boost/property_tree/save_idm45507111019696.html delete mode 100644 doc/html/boost/property_tree/save_idp154187280.html create mode 100644 doc/html/boost/property_tree/serializ_idm45506988487232.html delete mode 100644 doc/html/boost/property_tree/serialize_idp98162352.html create mode 100644 doc/html/boost/property_tree/string_path.html create mode 100644 doc/html/boost/property_tree/swap_idm45507111027024.html delete mode 100644 doc/html/boost/property_tree/swap_idp92371152.html create mode 100644 doc/html/boost/property_tree/translat_idm45506990189296.html create mode 100644 doc/html/boost/property_tree/translat_idm45507038344480.html create mode 100644 doc/html/boost/property_tree/translat_idm45507040148096.html delete mode 100644 doc/html/boost/property_tree/translator_be_idp205820704.html delete mode 100644 doc/html/boost/property_tree/translator_be_idp207680880.html delete mode 100644 doc/html/boost/property_tree/translator_be_idp215878496.html create mode 100644 doc/html/boost/property_tree/xml_parser/read_xml_idm45506995203264.html create mode 100644 doc/html/boost/property_tree/xml_parser/read_xml_idm45507044821152.html delete mode 100644 doc/html/boost/property_tree/xml_parser/read_xml_idp150019456.html delete mode 100644 doc/html/boost/property_tree/xml_parser/read_xml_idp205787136.html create mode 100644 doc/html/boost/property_tree/xml_parser/write_xm_idm45506983166032.html create mode 100644 doc/html/boost/property_tree/xml_parser/write_xm_idm45507092216384.html delete mode 100644 doc/html/boost/property_tree/xml_parser/write_xml_idp157243712.html delete mode 100644 doc/html/boost/property_tree/xml_parser/write_xml_idp163670112.html create mode 100644 doc/html/boost/proto/_byref/result_T_idm45506990745920.html create mode 100644 doc/html/boost/proto/_byref/result_T_idm45506990750288.html delete mode 100644 doc/html/boost/proto/_byref/result_This_T_idp212547664.html delete mode 100644 doc/html/boost/proto/_byref/result_This_T_idp212552032.html create mode 100644 doc/html/boost/proto/_byval/result_T_idm45506990714496.html create mode 100644 doc/html/boost/proto/_byval/result_T_idm45506990718128.html create mode 100644 doc/html/boost/proto/_byval/result_T_idm45506990721776.html delete mode 100644 doc/html/boost/proto/_byval/result_This_T_idp212579824.html delete mode 100644 doc/html/boost/proto/_byval/result_This_T_idp212583456.html delete mode 100644 doc/html/boost/proto/_byval/result_This_b_idp212576176.html create mode 100644 doc/html/boost/proto/as_child_idm45506990983408.html delete mode 100644 doc/html/boost/proto/as_child_idp227418704.html create mode 100644 doc/html/boost/proto/as_env_idm45506990359280.html delete mode 100644 doc/html/boost/proto/as_env_idp212938672.html create mode 100644 doc/html/boost/proto/as_expr_idm45506991005376.html delete mode 100644 doc/html/boost/proto/as_expr_idp227396736.html create mode 100644 doc/html/boost/proto/by_value_generator/result_T_idm45506975265200.html delete mode 100644 doc/html/boost/proto/by_value_generator/result_This_E_idp204758176.html create mode 100644 doc/html/boost/proto/child_c_idm45506990932896.html delete mode 100644 doc/html/boost/proto/child_c_idp227469216.html create mode 100644 doc/html/boost/proto/child_idm45506990961392.html delete mode 100644 doc/html/boost/proto/child_idp227440720.html create mode 100644 doc/html/boost/proto/compose_generators/result_T_idm45506975247184.html delete mode 100644 doc/html/boost/proto/compose_generators/result_This_E_idp224772464.html create mode 100644 doc/html/boost/proto/deep_cop_idm45506996666736.html delete mode 100644 doc/html/boost/proto/deep_copy_idp215592560.html create mode 100644 doc/html/boost/proto/default_generator/result_T_idm45506975321328.html delete mode 100644 doc/html/boost/proto/default_generator/result_This_E_idp204702048.html create mode 100644 doc/html/boost/proto/display__idm45506996767344.html delete mode 100644 doc/html/boost/proto/display_expr_idp215492336.html create mode 100644 doc/html/boost/proto/env_var_idm45506984357536.html delete mode 100644 doc/html/boost/proto/env_var_idp212966112.html create mode 100644 doc/html/boost/proto/eval_idm45506996501744.html delete mode 100644 doc/html/boost/proto/eval_idp203813264.html create mode 100644 doc/html/boost/proto/flatten_idm45506975343680.html delete mode 100644 doc/html/boost/proto/flatten_idp204679696.html create mode 100644 doc/html/boost/proto/functional/as_child/result_T_idm45506973673760.html delete mode 100644 doc/html/boost/proto/functional/as_child/result_This_T_idp208626464.html create mode 100644 doc/html/boost/proto/functional/as_expr/result_T_idm45506973695920.html delete mode 100644 doc/html/boost/proto/functional/as_expr/result_This_T_idp208604304.html create mode 100644 doc/html/boost/proto/functional/at/result_T_idm45506975827424.html delete mode 100644 doc/html/boost/proto/functional/at/result_This_S_idp204195952.html create mode 100644 doc/html/boost/proto/functional/begin/result_T_idm45506975669312.html delete mode 100644 doc/html/boost/proto/functional/begin/result_This_R_idp204354064.html create mode 100644 doc/html/boost/proto/functional/child/result_T_idm45506973622592.html delete mode 100644 doc/html/boost/proto/functional/child/result_This_E_idp208677632.html create mode 100644 doc/html/boost/proto/functional/child_c/result_T_idm45506973651728.html delete mode 100644 doc/html/boost/proto/functional/child_c/result_This_E_idp208648496.html create mode 100644 doc/html/boost/proto/functional/deep_copy/result_T_idm45506996676928.html delete mode 100644 doc/html/boost/proto/functional/deep_copy/result_This_E_idp215582368.html create mode 100644 doc/html/boost/proto/functional/distance/result_T_idm45506975522832.html delete mode 100644 doc/html/boost/proto/functional/distance/result_This_I_idp204500544.html create mode 100644 doc/html/boost/proto/functional/end/result_T_idm45506975629344.html delete mode 100644 doc/html/boost/proto/functional/end/result_This_R_idp204394032.html create mode 100644 doc/html/boost/proto/functional/eval/result_T_idm45506996531472.html delete mode 100644 doc/html/boost/proto/functional/eval/result_This_E_idp215726640.html create mode 100644 doc/html/boost/proto/functional/first/result_T_idm45506975424160.html create mode 100644 doc/html/boost/proto/functional/first/result_T_idm45506975428480.html create mode 100644 doc/html/boost/proto/functional/first/result_T_idm45506975432800.html delete mode 100644 doc/html/boost/proto/functional/first/result_This_P_idp204590576.html delete mode 100644 doc/html/boost/proto/functional/first/result_This_P_idp204594896.html delete mode 100644 doc/html/boost/proto/functional/first/result_This_P_idp204599216.html create mode 100644 doc/html/boost/proto/functional/flatten/result_T_idm45506975366000.html create mode 100644 doc/html/boost/proto/functional/flatten/result_T_idm45506975370048.html delete mode 100644 doc/html/boost/proto/functional/flatten/result_This_E_idp204653328.html delete mode 100644 doc/html/boost/proto/functional/flatten/result_This_E_idp204657376.html create mode 100644 doc/html/boost/proto/functional/left/result_T_idm45506973573376.html delete mode 100644 doc/html/boost/proto/functional/left/result_This_E_idp226498320.html create mode 100644 doc/html/boost/proto/functional/make_expr/result_T_idm45506975157536.html delete mode 100644 doc/html/boost/proto/functional/make_expr/result_This_A_idp224862112.html create mode 100644 doc/html/boost/proto/functional/make_pair/result_T_idm45506975449936.html delete mode 100644 doc/html/boost/proto/functional/make_pair/result_This_F_idp204573440.html create mode 100644 doc/html/boost/proto/functional/next/result_T_idm45506975502464.html create mode 100644 doc/html/boost/proto/functional/next/result_T_idm45506975506896.html delete mode 100644 doc/html/boost/proto/functional/next/result_This_F_idp204516480.html delete mode 100644 doc/html/boost/proto/functional/next/result_This_F_idp204520912.html create mode 100644 doc/html/boost/proto/functional/pop_back/result_T_idm45506975795264.html create mode 100644 doc/html/boost/proto/functional/pop_back/result_T_idm45506975799312.html delete mode 100644 doc/html/boost/proto/functional/pop_back/result_This_S_idp204224064.html delete mode 100644 doc/html/boost/proto/functional/pop_back/result_This_S_idp204228112.html create mode 100644 doc/html/boost/proto/functional/pop_front/result_T_idm45506975765328.html create mode 100644 doc/html/boost/proto/functional/pop_front/result_T_idm45506975769376.html delete mode 100644 doc/html/boost/proto/functional/pop_front/result_This_S_idp204254000.html delete mode 100644 doc/html/boost/proto/functional/pop_front/result_This_S_idp204258048.html create mode 100644 doc/html/boost/proto/functional/prior/result_T_idm45506975476896.html create mode 100644 doc/html/boost/proto/functional/prior/result_T_idm45506975481312.html delete mode 100644 doc/html/boost/proto/functional/prior/result_This_B_idp204542064.html delete mode 100644 doc/html/boost/proto/functional/prior/result_This_B_idp204546480.html create mode 100644 doc/html/boost/proto/functional/push_back/result_T_idm45506975741456.html delete mode 100644 doc/html/boost/proto/functional/push_back/result_This_S_idp204281920.html create mode 100644 doc/html/boost/proto/functional/push_front/result_T_idm45506975719776.html delete mode 100644 doc/html/boost/proto/functional/push_front/result_This_S_idp204303600.html create mode 100644 doc/html/boost/proto/functional/rbegin/result_T_idm45506975605520.html delete mode 100644 doc/html/boost/proto/functional/rbegin/result_This_R_idp204417856.html create mode 100644 doc/html/boost/proto/functional/rend/result_T_idm45506975581680.html delete mode 100644 doc/html/boost/proto/functional/rend/result_This_R_idp204441696.html create mode 100644 doc/html/boost/proto/functional/reverse/result_T_idm45506975693040.html create mode 100644 doc/html/boost/proto/functional/reverse/result_T_idm45506975697088.html delete mode 100644 doc/html/boost/proto/functional/reverse/result_This_S_idp204326288.html delete mode 100644 doc/html/boost/proto/functional/reverse/result_This_S_idp204330336.html create mode 100644 doc/html/boost/proto/functional/right/result_T_idm45506973548368.html delete mode 100644 doc/html/boost/proto/functional/right/result_This_E_idp226523328.html create mode 100644 doc/html/boost/proto/functional/second/result_T_idm45506975395760.html create mode 100644 doc/html/boost/proto/functional/second/result_T_idm45506975400080.html create mode 100644 doc/html/boost/proto/functional/second/result_T_idm45506975404400.html delete mode 100644 doc/html/boost/proto/functional/second/result_This_P_idp204618976.html delete mode 100644 doc/html/boost/proto/functional/second/result_This_P_idp204623296.html delete mode 100644 doc/html/boost/proto/functional/second/result_This_P_idp204627616.html create mode 100644 doc/html/boost/proto/functional/size/result_T_idm45506975557840.html delete mode 100644 doc/html/boost/proto/functional/size/result_This_R_idp204465536.html create mode 100644 doc/html/boost/proto/functional/unpack_expr/result_T_idm45506975133408.html delete mode 100644 doc/html/boost/proto/functional/unpack_expr/result_This_S_idp224886240.html create mode 100644 doc/html/boost/proto/functional/value/result_T_idm45506973597312.html delete mode 100644 doc/html/boost/proto/functional/value/result_This_E_idp208702912.html create mode 100644 doc/html/boost/proto/generator/result_T_idm45506975300688.html delete mode 100644 doc/html/boost/proto/generator/result_This_E_idp204722688.html create mode 100644 doc/html/boost/proto/has_env__idm45506984371088.html delete mode 100644 doc/html/boost/proto/has_env_var_idp212952560.html create mode 100644 doc/html/boost/proto/left_idm45506990901376.html delete mode 100644 doc/html/boost/proto/left_idp227500736.html create mode 100644 doc/html/boost/proto/make_exp_idm45506975053600.html delete mode 100644 doc/html/boost/proto/make_expr_idp224966048.html delete mode 100644 doc/html/boost/proto/operator__idp212979632.html create mode 100644 doc/html/boost/proto/operator_idm45506984344016.html create mode 100644 doc/html/boost/proto/pod_generator/result_T_idm45506975282944.html delete mode 100644 doc/html/boost/proto/pod_generator/result_This_E_idp204740432.html create mode 100644 doc/html/boost/proto/result_of/make_exp_idm45506975105632.html delete mode 100644 doc/html/boost/proto/result_of/make_expr_Tag_idp224914016.html create mode 100644 doc/html/boost/proto/result_of/unpack_e_idm45506975065392.html delete mode 100644 doc/html/boost/proto/result_of/unpack_expr_T_idp224954256.html create mode 100644 doc/html/boost/proto/right_idm45506990886896.html delete mode 100644 doc/html/boost/proto/right_idp227515216.html create mode 100644 doc/html/boost/proto/transform/result_T_idm45506984144464.html create mode 100644 doc/html/boost/proto/transform/result_T_idm45506984149872.html create mode 100644 doc/html/boost/proto/transform/result_T_idm45506984155152.html delete mode 100644 doc/html/boost/proto/transform/result_This_E_idp213168496.html delete mode 100644 doc/html/boost/proto/transform/result_This_E_idp213173776.html delete mode 100644 doc/html/boost/proto/transform/result_This_E_idp213179184.html create mode 100644 doc/html/boost/proto/unpack_e_idm45506975022288.html delete mode 100644 doc/html/boost/proto/unpack_expr_idp224997360.html create mode 100644 doc/html/boost/proto/value_idm45506990913840.html delete mode 100644 doc/html/boost/proto/value_idp227488272.html create mode 100644 doc/html/boost/proto/when_Gra_idm45506983606192.html create mode 100644 doc/html/boost/proto/when_Gra_idm45506983606192/impl.html create mode 100644 doc/html/boost/proto/when_Gra_idm45506983649024.html create mode 100644 doc/html/boost/proto/when_Gra_idm45506983649024/impl.html create mode 100644 doc/html/boost/proto/when_Gra_idm45506983690064.html create mode 100644 doc/html/boost/proto/when_Gra_idm45506983690064/impl.html create mode 100644 doc/html/boost/proto/when_Gra_idm45506983699520.html delete mode 100644 doc/html/boost/proto/when_Grammar__idp209631056.html delete mode 100644 doc/html/boost/proto/when_Grammar__idp209640512.html delete mode 100644 doc/html/boost/proto/when_Grammar__idp209640512/impl.html delete mode 100644 doc/html/boost/proto/when_Grammar__idp209681552.html delete mode 100644 doc/html/boost/proto/when_Grammar__idp209681552/impl.html delete mode 100644 doc/html/boost/proto/when_Grammar__idp209724384.html delete mode 100644 doc/html/boost/proto/when_Grammar__idp209724384/impl.html create mode 100644 doc/html/boost/random/generate_canonical.html create mode 100644 doc/html/boost/random/hyperexp_idm45507086672304.html create mode 100644 doc/html/boost/random/hyperexp_idm45507086672304/param_type.html create mode 100644 doc/html/boost/random/inversiv_idm45507090852608.html delete mode 100644 doc/html/boost/random/inversive_con_idp161302576.html create mode 100644 doc/html/boost/random/linear_f_idm45507041557328.html delete mode 100644 doc/html/boost/random/linear_feedba_idp109235664.html delete mode 100644 doc/html/boost/random/negative_binom_idp94123888.html delete mode 100644 doc/html/boost/random/negative_binom_idp94123888/param_type.html create mode 100644 doc/html/boost/random/negative_idm45506979396656.html create mode 100644 doc/html/boost/random/negative_idm45506979396656/param_type.html create mode 100644 doc/html/boost/random/non_cent_idm45506980906800.html create mode 100644 doc/html/boost/random/non_cent_idm45506980906800/param_type.html delete mode 100644 doc/html/boost/random/non_central_c_idp150001424.html delete mode 100644 doc/html/boost/random/non_central_c_idp150001424/param_type.html create mode 100644 doc/html/boost/random/piecewis_idm45506986764736.html create mode 100644 doc/html/boost/random/piecewis_idm45506986764736/param_type.html create mode 100644 doc/html/boost/random/piecewis_idm45507043304112.html create mode 100644 doc/html/boost/random/piecewis_idm45507043304112/param_type.html delete mode 100644 doc/html/boost/random/piecewise_cons_idp94191504.html delete mode 100644 doc/html/boost/random/piecewise_cons_idp94191504/param_type.html delete mode 100644 doc/html/boost/random/piecewise_lin_idp226179472.html delete mode 100644 doc/html/boost/random/piecewise_lin_idp226179472/param_type.html create mode 100644 doc/html/boost/random/subtract_idm45507048596384.html delete mode 100644 doc/html/boost/random/subtract_with_idp162145280.html create mode 100644 doc/html/boost/random/traits/is_integral.html create mode 100644 doc/html/boost/random/traits/is_signed.html create mode 100644 doc/html/boost/random/traits/make_unsigned.html create mode 100644 doc/html/boost/random/traits/make_unsigned_or_unbounded.html create mode 100644 doc/html/boost/signals2/keywords/extended_idm45506999542128.html delete mode 100644 doc/html/boost/signals2/keywords/extended_slot_idp156345840.html create mode 100644 doc/html/boost/signals2/last_val_idm45507040057344.html delete mode 100644 doc/html/boost/signals2/last_value_vo_idp102752128.html create mode 100644 doc/html/boost/signals2/optional_idm45507099693904.html delete mode 100644 doc/html/boost/signals2/optional_last_idp219889824.html create mode 100644 doc/html/boost/swap_idm45506893508496.html create mode 100644 doc/html/boost/swap_idm45507162621920.html create mode 100644 doc/html/boost/swap_idm45713141975568.html delete mode 100644 doc/html/boost/swap_idp24893216.html delete mode 100644 doc/html/boost/swap_idp312897248.html delete mode 100644 doc/html/boost/swap_idp45208528.html create mode 100644 doc/html/boost/type_erasure/any.html create mode 100644 doc/html/boost/type_erasure/any_Conc_idm45506890943856.html create mode 100644 doc/html/boost/type_erasure/any_Conc_idm45506978000544.html create mode 100644 doc/html/boost/type_erasure/any_Conc_idm45506987109008.html delete mode 100644 doc/html/boost/type_erasure/any_Concept___idp199875792.html delete mode 100644 doc/html/boost/type_erasure/any_Concept___idp305335072.html delete mode 100644 doc/html/boost/type_erasure/any_Concept___idp307465440.html create mode 100644 doc/html/boost/type_erasure/any_cast_idm45506900398752.html delete mode 100644 doc/html/boost/type_erasure/any_cast_idp99227696.html create mode 100644 doc/html/boost/type_erasure/binding.html create mode 100644 doc/html/boost/type_erasure/call_idm45506884907840.html delete mode 100644 doc/html/boost/type_erasure/call_idp314765536.html create mode 100644 doc/html/boost/type_erasure/dynamic_any_cast.html create mode 100644 doc/html/boost/type_erasure/dynamic_binding.html create mode 100644 doc/html/boost/type_erasure/get_idm45506890832112.html delete mode 100644 doc/html/boost/type_erasure/get_idp200238016.html create mode 100644 doc/html/boost/type_erasure/param.html create mode 100644 doc/html/boost/type_erasure/register_binding.html create mode 100644 doc/html/boost/typeindex/hash_val_idm45506981463280.html delete mode 100644 doc/html/boost/typeindex/hash_value_idp309934480.html create mode 100644 doc/html/boost/units/abstract/luminous_idm45506849409120.html delete mode 100644 doc/html/boost/units/abstract/luminous_inte_idp349555136.html create mode 100644 doc/html/boost/units/add_type_idm45506851507072.html create mode 100644 doc/html/boost/units/add_type_idm45506851515280.html delete mode 100644 doc/html/boost/units/add_typeof_he_idp347448976.html delete mode 100644 doc/html/boost/units/add_typeof_he_idp347457184.html create mode 100644 doc/html/boost/units/astronomical/astronom_idm45506849327696.html delete mode 100644 doc/html/boost/units/astronomical/astronomical__idp349636496.html create mode 100644 doc/html/boost/units/base_uni_idm45506848735920.html create mode 100644 doc/html/boost/units/base_uni_idm45506848744192.html create mode 100644 doc/html/boost/units/base_uni_idm45506848752480.html create mode 100644 doc/html/boost/units/base_uni_idm45506848760768.html create mode 100644 doc/html/boost/units/base_uni_idm45506848789696.html create mode 100644 doc/html/boost/units/base_uni_idm45506848797968.html create mode 100644 doc/html/boost/units/base_uni_idm45506848806240.html create mode 100644 doc/html/boost/units/base_uni_idm45506848814528.html create mode 100644 doc/html/boost/units/base_uni_idm45506848822800.html create mode 100644 doc/html/boost/units/base_uni_idm45506848831088.html create mode 100644 doc/html/boost/units/base_uni_idm45506848839376.html create mode 100644 doc/html/boost/units/base_uni_idm45506848847648.html create mode 100644 doc/html/boost/units/base_uni_idm45506848855920.html create mode 100644 doc/html/boost/units/base_uni_idm45506848864192.html create mode 100644 doc/html/boost/units/base_uni_idm45506848872480.html create mode 100644 doc/html/boost/units/base_uni_idm45506848880784.html create mode 100644 doc/html/boost/units/base_uni_idm45506848889072.html create mode 100644 doc/html/boost/units/base_uni_idm45506848897344.html create mode 100644 doc/html/boost/units/base_uni_idm45506848968224.html create mode 100644 doc/html/boost/units/base_uni_idm45506848982992.html create mode 100644 doc/html/boost/units/base_uni_idm45506848990896.html create mode 100644 doc/html/boost/units/base_uni_idm45506849005696.html create mode 100644 doc/html/boost/units/base_uni_idm45506849013616.html create mode 100644 doc/html/boost/units/base_uni_idm45506849035296.html create mode 100644 doc/html/boost/units/base_uni_idm45506849050080.html create mode 100644 doc/html/boost/units/base_uni_idm45506849057968.html create mode 100644 doc/html/boost/units/base_uni_idm45506849093376.html create mode 100644 doc/html/boost/units/base_uni_idm45506849110016.html create mode 100644 doc/html/boost/units/base_uni_idm45506849118320.html create mode 100644 doc/html/boost/units/base_uni_idm45506849126624.html create mode 100644 doc/html/boost/units/base_uni_idm45506849134928.html create mode 100644 doc/html/boost/units/base_uni_idm45506849143232.html create mode 100644 doc/html/boost/units/base_uni_idm45506849165328.html create mode 100644 doc/html/boost/units/base_uni_idm45506849173632.html create mode 100644 doc/html/boost/units/base_uni_idm45506849181936.html create mode 100644 doc/html/boost/units/base_uni_idm45506849190240.html create mode 100644 doc/html/boost/units/base_uni_idm45506849198544.html create mode 100644 doc/html/boost/units/base_uni_idm45506849206848.html create mode 100644 doc/html/boost/units/base_uni_idm45506849215152.html create mode 100644 doc/html/boost/units/base_uni_idm45506849223456.html create mode 100644 doc/html/boost/units/base_uni_idm45506849231760.html create mode 100644 doc/html/boost/units/base_uni_idm45506849240064.html create mode 100644 doc/html/boost/units/base_uni_idm45506849248368.html create mode 100644 doc/html/boost/units/base_uni_idm45506849256672.html create mode 100644 doc/html/boost/units/base_uni_idm45506849289360.html create mode 100644 doc/html/boost/units/base_uni_idm45506849304624.html create mode 100644 doc/html/boost/units/base_uni_idm45506849312960.html create mode 100644 doc/html/boost/units/base_uni_idm45506849321312.html create mode 100644 doc/html/boost/units/base_uni_idm45506849344912.html create mode 100644 doc/html/boost/units/base_uni_idm45506849373888.html create mode 100644 doc/html/boost/units/base_uni_idm45506849382192.html create mode 100644 doc/html/boost/units/base_uni_idm45506849416720.html create mode 100644 doc/html/boost/units/base_uni_idm45506849420800.html create mode 100644 doc/html/boost/units/base_uni_idm45506849424880.html create mode 100644 doc/html/boost/units/base_uni_idm45506849428960.html create mode 100644 doc/html/boost/units/base_uni_idm45506849433024.html create mode 100644 doc/html/boost/units/base_uni_idm45506849437104.html create mode 100644 doc/html/boost/units/base_uni_idm45506849441184.html create mode 100644 doc/html/boost/units/base_uni_idm45506849445264.html create mode 100644 doc/html/boost/units/base_uni_idm45506849449344.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp349514912.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp349518992.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp349523072.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp349527152.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp349531232.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp349535296.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp349539376.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp349543456.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp349547536.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp349582000.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp349590304.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp349619280.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp349642880.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp349651232.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp349659568.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp349674832.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp349707520.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp349715824.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp349724128.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp349732432.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp349740736.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp349749040.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp349757344.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp349765648.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp349773952.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp349782256.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp349790560.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp349798864.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp349820960.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp349829264.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp349837568.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp349845872.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp349854176.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp349870816.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp349906224.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp349914112.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp349928896.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp349950576.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp349958496.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp349973296.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp349981200.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp349995968.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp350066848.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp350075120.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp350083408.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp350091712.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp350100000.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp350108272.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp350116544.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp350124816.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp350133104.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp350141392.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp350149664.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp350157952.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp350166224.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp350174496.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp350203424.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp350211712.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp350220000.html delete mode 100644 doc/html/boost/units/base_unit_inf_idp350228272.html create mode 100644 doc/html/boost/units/divide_t_idm45506851716160.html create mode 100644 doc/html/boost/units/divide_t_idm45506851721056.html delete mode 100644 doc/html/boost/units/divide_typeof_idp347243200.html delete mode 100644 doc/html/boost/units/divide_typeof_idp347248096.html create mode 100644 doc/html/boost/units/get_dime_idm45506852163616.html create mode 100644 doc/html/boost/units/get_dime_idm45506852167568.html create mode 100644 doc/html/boost/units/get_dime_idm45506852170672.html delete mode 100644 doc/html/boost/units/get_dimension_idp346793584.html delete mode 100644 doc/html/boost/units/get_dimension_idp346796688.html delete mode 100644 doc/html/boost/units/get_dimension_idp346800640.html create mode 100644 doc/html/boost/units/get_syst_idm45506852148880.html create mode 100644 doc/html/boost/units/get_syst_idm45506852152832.html create mode 100644 doc/html/boost/units/get_syst_idm45506852155936.html delete mode 100644 doc/html/boost/units/get_system_ab_idp346808320.html delete mode 100644 doc/html/boost/units/get_system_qu_idp346811424.html delete mode 100644 doc/html/boost/units/get_system_un_idp346815376.html create mode 100644 doc/html/boost/units/is_dim_d_idm45506852017952.html delete mode 100644 doc/html/boost/units/is_dim_dim_T__idp346946304.html create mode 100644 doc/html/boost/units/is_dimen_idm45506851997280.html create mode 100644 doc/html/boost/units/is_dimen_idm45506852000672.html create mode 100644 doc/html/boost/units/is_dimen_idm45506852008320.html create mode 100644 doc/html/boost/units/is_dimen_idm45506852009984.html delete mode 100644 doc/html/boost/units/is_dimension__idp346954272.html delete mode 100644 doc/html/boost/units/is_dimension__idp346955936.html delete mode 100644 doc/html/boost/units/is_dimensionl_idp346963584.html delete mode 100644 doc/html/boost/units/is_dimensionl_idp346966976.html create mode 100644 doc/html/boost/units/is_quant_idm45506851961648.html create mode 100644 doc/html/boost/units/is_quant_idm45506851971072.html create mode 100644 doc/html/boost/units/is_quant_idm45506851979664.html delete mode 100644 doc/html/boost/units/is_quantity_o_idp346993184.html delete mode 100644 doc/html/boost/units/is_quantity_o_idp347002608.html delete mode 100644 doc/html/boost/units/is_quantity_q_idp346984592.html create mode 100644 doc/html/boost/units/is_unit__idm45506851928752.html create mode 100644 doc/html/boost/units/is_unit__idm45506851932112.html create mode 100644 doc/html/boost/units/is_unit__idm45506851940928.html create mode 100644 doc/html/boost/units/is_unit__idm45506851944288.html create mode 100644 doc/html/boost/units/is_unit__idm45506851952848.html delete mode 100644 doc/html/boost/units/is_unit_of_di_idp347019968.html delete mode 100644 doc/html/boost/units/is_unit_of_di_idp347023328.html delete mode 100644 doc/html/boost/units/is_unit_of_sy_idp347032144.html delete mode 100644 doc/html/boost/units/is_unit_of_sy_idp347035504.html delete mode 100644 doc/html/boost/units/is_unit_unit__idp347011408.html create mode 100644 doc/html/boost/units/luminous_idm45506850904240.html delete mode 100644 doc/html/boost/units/luminous_inte_idp348060016.html create mode 100644 doc/html/boost/units/make_sca_idm45506851596992.html create mode 100644 doc/html/boost/units/make_sca_idm45506851604096.html delete mode 100644 doc/html/boost/units/make_scaled_u_idp347360160.html delete mode 100644 doc/html/boost/units/make_scaled_u_idp347367264.html create mode 100644 doc/html/boost/units/multiply_idm45506851695616.html create mode 100644 doc/html/boost/units/multiply_idm45506851700992.html create mode 100644 doc/html/boost/units/multiply_idm45506851705888.html create mode 100644 doc/html/boost/units/multiply_idm45506851711264.html delete mode 100644 doc/html/boost/units/multiply_type_idp347252992.html delete mode 100644 doc/html/boost/units/multiply_type_idp347258368.html delete mode 100644 doc/html/boost/units/multiply_type_idp347263264.html delete mode 100644 doc/html/boost/units/multiply_type_idp347268640.html delete mode 100644 doc/html/boost/units/operator/_idp347279936.html delete mode 100644 doc/html/boost/units/operator/_idp347292208.html create mode 100644 doc/html/boost/units/operator_idm45506851658880.html create mode 100644 doc/html/boost/units/operator_idm45506851665920.html create mode 100644 doc/html/boost/units/operator_idm45506851672048.html create mode 100644 doc/html/boost/units/operator_idm45506851678176.html create mode 100644 doc/html/boost/units/operator_idm45506851684320.html create mode 100644 doc/html/boost/units/operator_idm45506851690464.html create mode 100644 doc/html/boost/units/operator_idm45506852030768.html create mode 100644 doc/html/boost/units/operator_idm45506852037168.html delete mode 100644 doc/html/boost/units/operator_idp346927088.html delete mode 100644 doc/html/boost/units/operator_idp346933488.html delete mode 100644 doc/html/boost/units/operator_idp347273792.html delete mode 100644 doc/html/boost/units/operator_idp347286080.html delete mode 100644 doc/html/boost/units/operator_idp347298336.html delete mode 100644 doc/html/boost/units/operator_idp347305376.html create mode 100644 doc/html/boost/units/pow_idm45506852379376.html delete mode 100644 doc/html/boost/units/pow_idp346584880.html create mode 100644 doc/html/boost/units/power_ty_idm45506851137248.html delete mode 100644 doc/html/boost/units/power_typeof__idp347827008.html delete mode 100644 doc/html/boost/units/quantity_BOOS_idp347523824.html create mode 100644 doc/html/boost/units/quantity_idm45506851440432.html create mode 100644 doc/html/boost/units/reduce_u_idm45506851125392.html delete mode 100644 doc/html/boost/units/reduce_unit_u_idp347838864.html create mode 100644 doc/html/boost/units/root_typ_idm45506851121600.html delete mode 100644 doc/html/boost/units/root_typeof_h_idp347842656.html delete mode 100644 doc/html/boost/units/si/constants/codata/BOOST_UNITS_P_idp348286224.html delete mode 100644 doc/html/boost/units/si/constants/codata/BOOST_UNITS_P_idp348306176.html delete mode 100644 doc/html/boost/units/si/constants/codata/BOOST_UNITS_P_idp348326592.html delete mode 100644 doc/html/boost/units/si/constants/codata/BOOST_UNITS_P_idp348412640.html delete mode 100644 doc/html/boost/units/si/constants/codata/BOOST_UNITS_P_idp348508624.html delete mode 100644 doc/html/boost/units/si/constants/codata/BOOST_UNITS_P_idp348551696.html delete mode 100644 doc/html/boost/units/si/constants/codata/BOOST_UNITS_P_idp348606096.html delete mode 100644 doc/html/boost/units/si/constants/codata/BOOST_UNITS_P_idp348706944.html delete mode 100644 doc/html/boost/units/si/constants/codata/BOOST_UNITS_P_idp348787808.html delete mode 100644 doc/html/boost/units/si/constants/codata/BOOST_UNITS_P_idp348819392.html delete mode 100644 doc/html/boost/units/si/constants/codata/BOOST_UNITS_P_idp348887856.html create mode 100644 doc/html/boost/units/si/constants/codata/BOOST_UN_idm45506850076400.html create mode 100644 doc/html/boost/units/si/constants/codata/BOOST_UN_idm45506850144864.html create mode 100644 doc/html/boost/units/si/constants/codata/BOOST_UN_idm45506850176448.html create mode 100644 doc/html/boost/units/si/constants/codata/BOOST_UN_idm45506850257312.html create mode 100644 doc/html/boost/units/si/constants/codata/BOOST_UN_idm45506850358160.html create mode 100644 doc/html/boost/units/si/constants/codata/BOOST_UN_idm45506850412560.html create mode 100644 doc/html/boost/units/si/constants/codata/BOOST_UN_idm45506850455632.html create mode 100644 doc/html/boost/units/si/constants/codata/BOOST_UN_idm45506850551616.html create mode 100644 doc/html/boost/units/si/constants/codata/BOOST_UN_idm45506850637664.html create mode 100644 doc/html/boost/units/si/constants/codata/BOOST_UN_idm45506850658080.html create mode 100644 doc/html/boost/units/si/constants/codata/BOOST_UN_idm45506850678032.html create mode 100644 doc/html/boost/units/si/kilogram_idm45506849739072.html create mode 100644 doc/html/boost/units/si/kilogram_idm45506849740208.html create mode 100644 doc/html/boost/units/si/kilogram_idm45506849846464.html delete mode 100644 doc/html/boost/units/si/kilogramme_pe_idp349224048.html delete mode 100644 doc/html/boost/units/si/kilogrammes_p_idp349117792.html delete mode 100644 doc/html/boost/units/si/kilogrammes_p_idp349225184.html create mode 100644 doc/html/boost/units/subtract_idm45506851367776.html create mode 100644 doc/html/boost/units/subtract_idm45506851375984.html delete mode 100644 doc/html/boost/units/subtract_type_idp347588272.html delete mode 100644 doc/html/boost/units/subtract_type_idp347596480.html create mode 100644 doc/html/boost/xpressive/as_idm45506840056256.html delete mode 100644 doc/html/boost/xpressive/as_idp358484288.html create mode 100644 doc/html/boost/xpressive/const_ca_idm45506840039776.html delete mode 100644 doc/html/boost/xpressive/const_cast_idp358500768.html create mode 100644 doc/html/boost/xpressive/construc_idm45506839992080.html delete mode 100644 doc/html/boost/xpressive/construct_idp358548464.html create mode 100644 doc/html/boost/xpressive/dynamic__idm45506840045280.html delete mode 100644 doc/html/boost/xpressive/dynamic_cast_idp358495264.html delete mode 100644 doc/html/boost/xpressive/has_fold_case_idp359300880.html delete mode 100644 doc/html/boost/xpressive/has_fold_case_idp359305424.html create mode 100644 doc/html/boost/xpressive/has_fold_idm45506839235120.html create mode 100644 doc/html/boost/xpressive/has_fold_idm45506839239664.html create mode 100644 doc/html/boost/xpressive/op/at/result_T_idm45506840408416.html create mode 100644 doc/html/boost/xpressive/op/at/result_T_idm45506840412336.html create mode 100644 doc/html/boost/xpressive/op/at/result_T_idm45506840416256.html delete mode 100644 doc/html/boost/xpressive/op/at/result_This_C_idp358124288.html delete mode 100644 doc/html/boost/xpressive/op/at/result_This_C_idp358128208.html delete mode 100644 doc/html/boost/xpressive/op/at/result_This_C_idp358132128.html create mode 100644 doc/html/boost/xpressive/op/back/result_T_idm45506840390448.html delete mode 100644 doc/html/boost/xpressive/op/back/result_This_S_idp358150096.html create mode 100644 doc/html/boost/xpressive/op/first/result_T_idm45506840337296.html delete mode 100644 doc/html/boost/xpressive/op/first/result_This_P_idp358203248.html create mode 100644 doc/html/boost/xpressive/op/front/result_T_idm45506840326960.html delete mode 100644 doc/html/boost/xpressive/op/front/result_This_S_idp358213584.html create mode 100644 doc/html/boost/xpressive/op/length/result_T_idm45506840272608.html delete mode 100644 doc/html/boost/xpressive/op/length/result_This_S_idp358267936.html create mode 100644 doc/html/boost/xpressive/op/make_pair/result_T_idm45506840260208.html delete mode 100644 doc/html/boost/xpressive/op/make_pair/result_This_F_idp358280336.html create mode 100644 doc/html/boost/xpressive/op/second/result_T_idm45506840183920.html delete mode 100644 doc/html/boost/xpressive/op/second/result_This_P_idp358356624.html create mode 100644 doc/html/boost/xpressive/op/str/result_T_idm45506840163184.html delete mode 100644 doc/html/boost/xpressive/op/str/result_This_S_idp358377360.html create mode 100644 doc/html/boost/xpressive/op/top/result_T_idm45506840129152.html delete mode 100644 doc/html/boost/xpressive/op/top/result_This_S_idp358411392.html create mode 100644 doc/html/boost/xpressive/op/unwrap_reference/result_T_idm45506840112768.html create mode 100644 doc/html/boost/xpressive/op/unwrap_reference/result_T_idm45506840115856.html delete mode 100644 doc/html/boost/xpressive/op/unwrap_reference/result_This_R_idp358424688.html delete mode 100644 doc/html/boost/xpressive/op/unwrap_reference/result_This_R_idp358427776.html create mode 100644 doc/html/boost/xpressive/operator_idm45506839379712.html delete mode 100644 doc/html/boost/xpressive/operator_idp359160832.html create mode 100644 doc/html/boost/xpressive/static_c_idm45506840050768.html delete mode 100644 doc/html/boost/xpressive/static_cast_idp358489776.html create mode 100644 doc/html/boost/xpressive/swap_idm45506840643536.html delete mode 100644 doc/html/boost/xpressive/swap_idp357897008.html (limited to 'doc/html/boost') diff --git a/doc/html/boost/CV/constrained_value.html b/doc/html/boost/CV/constrained_value.html index 3bad99daf5..da58dbd99e 100644 --- a/doc/html/boost/CV/constrained_value.html +++ b/doc/html/boost/CV/constrained_value.html @@ -39,53 +39,53 @@ typedef value_policies::value_type value_type; // construct/copy/destruct - constrained_value(value_type); - constrained_value & operator=(value_type); + constrained_value(value_type); + constrained_value & operator=(value_type); - // public member functions - operator value_type() const; + // public member functions + operator value_type() const; - // public static functions - static value_type max BOOST_PREVENT_MACRO_SUBSTITUTION(); - static value_type min BOOST_PREVENT_MACRO_SUBSTITUTION(); + // public static functions + static value_type max BOOST_PREVENT_MACRO_SUBSTITUTION(); + static value_type min BOOST_PREVENT_MACRO_SUBSTITUTION(); - // private member functions - void assign(value_type); + // private member functions + void assign(value_type); };
-

Description

+

Description

This template provides a quick way to generate an integer type with a constrained range. The type provides for the ability to specify the min, max, and and error handling policy.

value policies A class that provides the range limits via the min and max functions as well as a function on_error that determines how errors are handled. A common strategy would be to assert or throw and exception. The on_error is passed both the current value and the new value that is in error.

-

+

constrained_value public construct/copy/destruct

    -
  1. constrained_value(value_type value);
    2. -
  2. constrained_value & operator=(value_type v);
    3. +
  3. constrained_value(value_type value);
    4. +
  4. constrained_value & operator=(value_type v);
-

-constrained_value public member functions

+

+constrained_value public member functions

  1. -
    operator value_type() const;
    Coerce into the representation type.
+
operator value_type() const;
Coerce into the representation type.
-

-constrained_value public static functions

+

+constrained_value public static functions

  1. -
    static value_type max BOOST_PREVENT_MACRO_SUBSTITUTION();
    Return the max allowed value (traits method)
    2. +
    static value_type max BOOST_PREVENT_MACRO_SUBSTITUTION();
    Return the max allowed value (traits method)
  2. -
    static value_type min BOOST_PREVENT_MACRO_SUBSTITUTION();
    Return the min allowed value (traits method)
    3. +
    static value_type min BOOST_PREVENT_MACRO_SUBSTITUTION();
    Return the min allowed value (traits method)
-

-constrained_value private member functions

-
  1. void assign(value_type value);
+

+constrained_value private member functions

+
  1. void assign(value_type value);
diff --git a/doc/html/boost/CV/simple_exception_policy.html b/doc/html/boost/CV/simple_exception_policy.html index ab25b83007..fc975a5e52 100644 --- a/doc/html/boost/CV/simple_exception_policy.html +++ b/doc/html/boost/CV/simple_exception_policy.html @@ -43,24 +43,24 @@ struct exception_wrapper : public exception_type { - // public member functions - operator std::out_of_range() const; + // public member functions + operator std::out_of_range() const; }; - // public static functions - static rep_type min BOOST_PREVENT_MACRO_SUBSTITUTION(); - static rep_type max BOOST_PREVENT_MACRO_SUBSTITUTION(); - static void on_error(rep_type, rep_type, violation_enum); + // public static functions + static rep_type min BOOST_PREVENT_MACRO_SUBSTITUTION(); + static rep_type max BOOST_PREVENT_MACRO_SUBSTITUTION(); + static void on_error(rep_type, rep_type, violation_enum); };
-

Description

+

Description

-

-simple_exception_policy public static functions

+

+simple_exception_policy public static functions

    -
  1. static rep_type min BOOST_PREVENT_MACRO_SUBSTITUTION();
    2. -
  2. static rep_type max BOOST_PREVENT_MACRO_SUBSTITUTION();
    3. -
  3. static void on_error(rep_type, rep_type, violation_enum);
    4. +
  4. static rep_type min BOOST_PREVENT_MACRO_SUBSTITUTION();
    5. +
  5. static rep_type max BOOST_PREVENT_MACRO_SUBSTITUTION();
    6. +
  6. static void on_error(rep_type, rep_type, violation_enum);
diff --git a/doc/html/boost/CV/simple_exception_policy/exception_wrapper.html b/doc/html/boost/CV/simple_exception_policy/exception_wrapper.html index 581302762e..eab4ed04c4 100644 --- a/doc/html/boost/CV/simple_exception_policy/exception_wrapper.html +++ b/doc/html/boost/CV/simple_exception_policy/exception_wrapper.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
-PrevUpHomeNext +PrevUpHomeNext
@@ -36,15 +36,15 @@ struct exception_wrapper : public exception_type { - // public member functions - operator std::out_of_range() const; + // public member functions + operator std::out_of_range() const; };
-

Description

+

Description

-

-exception_wrapper public member functions

-
  1. operator std::out_of_range() const;
+

+exception_wrapper public member functions

+
  1. operator std::out_of_range() const;
@@ -56,7 +56,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/boost/accumulators/absolute.html b/doc/html/boost/accumulators/absolute.html deleted file mode 100644 index 89b0d536e6..0000000000 --- a/doc/html/boost/accumulators/absolute.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct absolute - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct absolute

-

boost::accumulators::absolute

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-
-struct absolute {
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/accumulator_base.html b/doc/html/boost/accumulators/accumulator_base.html index 5423cc6b0e..1aeb58c2a2 100644 --- a/doc/html/boost/accumulators/accumulator_base.html +++ b/doc/html/boost/accumulators/accumulator_base.html @@ -37,22 +37,22 @@ // types typedef mpl::false_ is_droppable; - // public member functions - unspecified operator()(dont_care); - unspecified add_ref(dont_care); - unspecified drop(dont_care); - unspecified on_drop(dont_care); + // public member functions + unspecified operator()(dont_care); + unspecified add_ref(dont_care); + unspecified drop(dont_care); + unspecified on_drop(dont_care); };
-

Description

+

Description

-

-accumulator_base public member functions

+

+accumulator_base public member functions

    -
  1. unspecified operator()(dont_care);
    2. -
  2. unspecified add_ref(dont_care);
    3. -
  3. unspecified drop(dont_care);
    4. -
  4. unspecified on_drop(dont_care);
    5. +
  5. unspecified operator()(dont_care);
    6. +
  6. unspecified add_ref(dont_care);
    7. +
  7. unspecified drop(dont_care);
    8. +
  8. unspecified on_drop(dont_care);
diff --git a/doc/html/boost/accumulators/accumulator_concept.html b/doc/html/boost/accumulators/accumulator_concept.html index eb5422691f..ad2038e531 100644 --- a/doc/html/boost/accumulators/accumulator_concept.html +++ b/doc/html/boost/accumulators/accumulator_concept.html @@ -35,18 +35,18 @@ template<typename Stat> struct accumulator_concept { - // public member functions - void constraints(); + // public member functions + void constraints(); // public data members Stat stat; };
-

Description

+

Description

-

-accumulator_concept public member functions

-
  1. void constraints();
+

+accumulator_concept public member functions

+
  1. void constraints();
diff --git a/doc/html/boost/accumulators/accumulator_set.html b/doc/html/boost/accumulators/accumulator_set.html index 3641cb952f..96ef0db9a0 100644 --- a/doc/html/boost/accumulators/accumulator_set.html +++ b/doc/html/boost/accumulators/accumulator_set.html @@ -35,29 +35,29 @@ template<typename Sample, typename Features, typename Weight> struct accumulator_set { // construct/copy/destruct - template<typename A1> explicit accumulator_set(A1 const &); + template<typename A1> explicit accumulator_set(A1 const &); - // public member functions - template<typename UnaryFunction> void visit(UnaryFunction const &); + // public member functions + template<typename UnaryFunction> void visit(UnaryFunction const &); template<typename FilterPred, typename UnaryFunction> - void visit_if(UnaryFunction const &); - void operator()(); - template<typename A1> void operator()(A1 const &); - template<typename Feature> apply< Feature >::type & extract(); - template<typename Feature> apply< Feature >::type const & extract() const; - template<typename Feature> void drop(); + void visit_if(UnaryFunction const &); + void operator()(); + template<typename A1> void operator()(A1 const &); + template<typename Feature> apply< Feature >::type & extract(); + template<typename Feature> apply< Feature >::type const & extract() const; + template<typename Feature> void drop(); };
-

Description

+

Description

accumulator_set resolves the dependencies between features and ensures that the accumulators in the set are updated in the proper order.

acccumulator_set provides a general mechanism to visit the accumulators in the set in order, with or without a filter. You can also fetch a reference to an accumulator that corresponds to a feature.

-

+

accumulator_set public construct/copy/destruct

  1. -
    template<typename A1> explicit accumulator_set(A1 const & a1);
    +
    template<typename A1> explicit accumulator_set(A1 const & a1);

    This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

    @@ -83,11 +83,11 @@
-

-accumulator_set public member functions

+

+accumulator_set public member functions

  1. -
    template<typename UnaryFunction> void visit(UnaryFunction const & func);
    +
    template<typename UnaryFunction> void visit(UnaryFunction const & func);

    Visitation

    @@ -112,7 +112,7 @@ 
  2. template<typename FilterPred, typename UnaryFunction> 
-  void visit_if(UnaryFunction const & func);
    + void visit_if(UnaryFunction const & func);

    Conditional visitation

    3. @@ -136,19 +136,19 @@
  3. -
    void operator()();
    +
    void operator()();

    Accumulation

    4. -
  4. template<typename A1> void operator()(A1 const & a1);
    5. +
  5. template<typename A1> void operator()(A1 const & a1);
  6. -
    template<typename Feature> apply< Feature >::type & extract();
    Extraction.
    7. +
    template<typename Feature> apply< Feature >::type & extract();
    Extraction.
  7. -
    template<typename Feature> apply< Feature >::type const & extract() const;
    +
    template<typename Feature> apply< Feature >::type const & extract() const;

    This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

  8. -
    template<typename Feature> void drop();
    Drop.
    9. +
    template<typename Feature> void drop();
    Drop.
diff --git a/doc/html/boost/accumulators/as_featu_idm45507139496800.html b/doc/html/boost/accumulators/as_featu_idm45507139496800.html new file mode 100644 index 0000000000..0775f2f15b --- /dev/null +++ b/doc/html/boost/accumulators/as_featu_idm45507139496800.html @@ -0,0 +1,54 @@ + + + + +Struct template as_feature<tag::droppable< Feature >> + + + + + + + + + + + + + + + +
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
+
+
+PrevUpHomeNext +
+
+
+
+

Struct template as_feature<tag::droppable< Feature >>

+

boost::accumulators::as_feature<tag::droppable< Feature >>

+
+

Synopsis

+
// In header: <boost/accumulators/framework/accumulators/droppable_accumulator.hpp>
+
+template<typename Feature> 
+struct as_feature<tag::droppable< Feature >> {
+  // types
+  typedef tag::droppable< typename as_feature< Feature >::type > type;
+};
+
+ + + +
Copyright © 2005, 2006 Eric Niebler

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/doc/html/boost/accumulators/as_feature_tag_idp64779136.html b/doc/html/boost/accumulators/as_feature_tag_idp64779136.html deleted file mode 100644 index 0c1a804312..0000000000 --- a/doc/html/boost/accumulators/as_feature_tag_idp64779136.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template as_feature<tag::droppable< Feature >> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template as_feature<tag::droppable< Feature >>

-

boost::accumulators::as_feature<tag::droppable< Feature >>

-
-

Synopsis

-
// In header: <boost/accumulators/framework/accumulators/droppable_accumulator.hpp>
-
-template<typename Feature> 
-struct as_feature<tag::droppable< Feature >> {
-  // types
-  typedef tag::droppable< typename as_feature< Feature >::type > type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_feature_tag_idp64932064.html b/doc/html/boost/accumulators/as_feature_tag_idp64932064.html deleted file mode 100644 index 6a97eb98cc..0000000000 --- a/doc/html/boost/accumulators/as_feature_tag_idp64932064.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template as_feature<tag::error_of< Feature >> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template as_feature<tag::error_of< Feature >>

-

boost::accumulators::as_feature<tag::error_of< Feature >>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/error_of.hpp>
-
-template<typename Feature> 
-struct as_feature<tag::error_of< Feature >> {
-  // types
-  typedef tag::error_of< typename as_feature< Feature >::type > type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_feature_tag_idp64963952.html b/doc/html/boost/accumulators/as_feature_tag_idp64963952.html deleted file mode 100644 index 9feb41785d..0000000000 --- a/doc/html/boost/accumulators/as_feature_tag_idp64963952.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct as_feature<tag::extended_p_square_quantile(linear)> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct as_feature<tag::extended_p_square_quantile(linear)>

-

boost::accumulators::as_feature<tag::extended_p_square_quantile(linear)>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/extended_p_square_quantile.hpp>
-
-
-struct as_feature<tag::extended_p_square_quantile(linear)> {
-  // types
-  typedef tag::extended_p_square_quantile type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_feature_tag_idp64966064.html b/doc/html/boost/accumulators/as_feature_tag_idp64966064.html deleted file mode 100644 index 4b6f5393ad..0000000000 --- a/doc/html/boost/accumulators/as_feature_tag_idp64966064.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct as_feature<tag::extended_p_square_quantile(quadratic)> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct as_feature<tag::extended_p_square_quantile(quadratic)>

-

boost::accumulators::as_feature<tag::extended_p_square_quantile(quadratic)>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/extended_p_square_quantile.hpp>
-
-
-struct as_feature<tag::extended_p_square_quantile(quadratic)> {
-  // types
-  typedef tag::extended_p_square_quantile_quadratic type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_feature_tag_idp64968208.html b/doc/html/boost/accumulators/as_feature_tag_idp64968208.html deleted file mode 100644 index 5250dc935c..0000000000 --- a/doc/html/boost/accumulators/as_feature_tag_idp64968208.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct as_feature<tag::weighted_extended_p_square_quantile(linear)> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct as_feature<tag::weighted_extended_p_square_quantile(linear)>

-

boost::accumulators::as_feature<tag::weighted_extended_p_square_quantile(linear)>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/extended_p_square_quantile.hpp>
-
-
-struct as_feature<tag::weighted_extended_p_square_quantile(linear)> {
-  // types
-  typedef tag::weighted_extended_p_square_quantile type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_feature_tag_idp64970352.html b/doc/html/boost/accumulators/as_feature_tag_idp64970352.html deleted file mode 100644 index 194bbb4830..0000000000 --- a/doc/html/boost/accumulators/as_feature_tag_idp64970352.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct as_feature<tag::weighted_extended_p_square_quantile(quadratic)> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct as_feature<tag::weighted_extended_p_square_quantile(quadratic)>

-

boost::accumulators::as_feature<tag::weighted_extended_p_square_quantile(quadratic)>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/extended_p_square_quantile.hpp>
-
-
-struct as_feature<tag::weighted_extended_p_square_quantile(quadratic)> {
-  // types
-  typedef tag::weighted_extended_p_square_quantile_quadratic type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_feature_tag_idp65024544.html b/doc/html/boost/accumulators/as_feature_tag_idp65024544.html deleted file mode 100644 index cf6f8b6da9..0000000000 --- a/doc/html/boost/accumulators/as_feature_tag_idp65024544.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct as_feature<tag::mean(immediate)> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct as_feature<tag::mean(immediate)>

-

boost::accumulators::as_feature<tag::mean(immediate)>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/mean.hpp>
-
-
-struct as_feature<tag::mean(immediate)> {
-  // types
-  typedef tag::immediate_mean type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_feature_tag_idp65026624.html b/doc/html/boost/accumulators/as_feature_tag_idp65026624.html deleted file mode 100644 index d89801b0ef..0000000000 --- a/doc/html/boost/accumulators/as_feature_tag_idp65026624.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct as_feature<tag::mean(lazy)> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct as_feature<tag::mean(lazy)>

-

boost::accumulators::as_feature<tag::mean(lazy)>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/mean.hpp>
-
-
-struct as_feature<tag::mean(lazy)> {
-  // types
-  typedef tag::mean type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_feature_tag_idp65028704.html b/doc/html/boost/accumulators/as_feature_tag_idp65028704.html deleted file mode 100644 index 6dd343eb54..0000000000 --- a/doc/html/boost/accumulators/as_feature_tag_idp65028704.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template as_feature<tag::mean_of_variates< VariateType, VariateTag >(immediate)> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template as_feature<tag::mean_of_variates< VariateType, VariateTag >(immediate)>

-

boost::accumulators::as_feature<tag::mean_of_variates< VariateType, VariateTag >(immediate)>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/mean.hpp>
-
-template<typename VariateType, typename VariateTag> 
-struct as_feature<tag::mean_of_variates< VariateType, VariateTag >(immediate)> {
-  // types
-  typedef tag::immediate_mean_of_variates< VariateType, VariateTag > type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_feature_tag_idp65032400.html b/doc/html/boost/accumulators/as_feature_tag_idp65032400.html deleted file mode 100644 index 3407c0fad4..0000000000 --- a/doc/html/boost/accumulators/as_feature_tag_idp65032400.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template as_feature<tag::mean_of_variates< VariateType, VariateTag >(lazy)> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template as_feature<tag::mean_of_variates< VariateType, VariateTag >(lazy)>

-

boost::accumulators::as_feature<tag::mean_of_variates< VariateType, VariateTag >(lazy)>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/mean.hpp>
-
-template<typename VariateType, typename VariateTag> 
-struct as_feature<tag::mean_of_variates< VariateType, VariateTag >(lazy)> {
-  // types
-  typedef tag::mean_of_variates< VariateType, VariateTag > type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_feature_tag_idp65036080.html b/doc/html/boost/accumulators/as_feature_tag_idp65036080.html deleted file mode 100644 index 647ba9de35..0000000000 --- a/doc/html/boost/accumulators/as_feature_tag_idp65036080.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct as_feature<tag::mean_of_weights(immediate)> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct as_feature<tag::mean_of_weights(immediate)>

-

boost::accumulators::as_feature<tag::mean_of_weights(immediate)>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/mean.hpp>
-
-
-struct as_feature<tag::mean_of_weights(immediate)> {
-  // types
-  typedef tag::immediate_mean_of_weights type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_feature_tag_idp65038192.html b/doc/html/boost/accumulators/as_feature_tag_idp65038192.html deleted file mode 100644 index 35d0259e73..0000000000 --- a/doc/html/boost/accumulators/as_feature_tag_idp65038192.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct as_feature<tag::mean_of_weights(lazy)> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct as_feature<tag::mean_of_weights(lazy)>

-

boost::accumulators::as_feature<tag::mean_of_weights(lazy)>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/mean.hpp>
-
-
-struct as_feature<tag::mean_of_weights(lazy)> {
-  // types
-  typedef tag::mean_of_weights type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_feature_tag_idp65081440.html b/doc/html/boost/accumulators/as_feature_tag_idp65081440.html deleted file mode 100644 index 3e9f2c0045..0000000000 --- a/doc/html/boost/accumulators/as_feature_tag_idp65081440.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct as_feature<tag::median(with_density)> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct as_feature<tag::median(with_density)>

-

boost::accumulators::as_feature<tag::median(with_density)>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/median.hpp>
-
-
-struct as_feature<tag::median(with_density)> {
-  // types
-  typedef tag::with_density_median type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_feature_tag_idp65083552.html b/doc/html/boost/accumulators/as_feature_tag_idp65083552.html deleted file mode 100644 index c534bae5f6..0000000000 --- a/doc/html/boost/accumulators/as_feature_tag_idp65083552.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct as_feature<tag::median(with_p_square_cumulative_distribution)> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct as_feature<tag::median(with_p_square_cumulative_distribution)>

-

boost::accumulators::as_feature<tag::median(with_p_square_cumulative_distribution)>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/median.hpp>
-
-
-struct as_feature<tag::median(with_p_square_cumulative_distribution)> {
-  // types
-  typedef tag::with_p_square_cumulative_distribution_median type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_feature_tag_idp65085696.html b/doc/html/boost/accumulators/as_feature_tag_idp65085696.html deleted file mode 100644 index 35dd94491d..0000000000 --- a/doc/html/boost/accumulators/as_feature_tag_idp65085696.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct as_feature<tag::median(with_p_square_quantile)> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct as_feature<tag::median(with_p_square_quantile)>

-

boost::accumulators::as_feature<tag::median(with_p_square_quantile)>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/median.hpp>
-
-
-struct as_feature<tag::median(with_p_square_quantile)> {
-  // types
-  typedef tag::median type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_feature_tag_idp65158224.html b/doc/html/boost/accumulators/as_feature_tag_idp65158224.html deleted file mode 100644 index 4bd4768054..0000000000 --- a/doc/html/boost/accumulators/as_feature_tag_idp65158224.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template as_feature<tag::peaks_over_threshold< LeftRight >(with_threshold_probability)> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template as_feature<tag::peaks_over_threshold< LeftRight >(with_threshold_probability)>

-

boost::accumulators::as_feature<tag::peaks_over_threshold< LeftRight >(with_threshold_probability)>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/peaks_over_threshold.hpp>
-
-template<typename LeftRight> 
-struct as_feature<tag::peaks_over_threshold< LeftRight >(with_threshold_probability)> {
-  // types
-  typedef tag::peaks_over_threshold_prob< LeftRight > type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_feature_tag_idp65161088.html b/doc/html/boost/accumulators/as_feature_tag_idp65161088.html deleted file mode 100644 index 82cff147f2..0000000000 --- a/doc/html/boost/accumulators/as_feature_tag_idp65161088.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template as_feature<tag::peaks_over_threshold< LeftRight >(with_threshold_value)> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template as_feature<tag::peaks_over_threshold< LeftRight >(with_threshold_value)>

-

boost::accumulators::as_feature<tag::peaks_over_threshold< LeftRight >(with_threshold_value)>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/peaks_over_threshold.hpp>
-
-template<typename LeftRight> 
-struct as_feature<tag::peaks_over_threshold< LeftRight >(with_threshold_value)> {
-  // types
-  typedef tag::peaks_over_threshold< LeftRight > type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_feature_tag_idp65283264.html b/doc/html/boost/accumulators/as_feature_tag_idp65283264.html deleted file mode 100644 index ef64340d35..0000000000 --- a/doc/html/boost/accumulators/as_feature_tag_idp65283264.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template as_feature<tag::pot_quantile< LeftRight >(with_threshold_probability)> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template as_feature<tag::pot_quantile< LeftRight >(with_threshold_probability)>

-

boost::accumulators::as_feature<tag::pot_quantile< LeftRight >(with_threshold_probability)>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/pot_quantile.hpp>
-
-template<typename LeftRight> 
-struct as_feature<tag::pot_quantile< LeftRight >(with_threshold_probability)> {
-  // types
-  typedef tag::pot_quantile_prob< LeftRight > type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_feature_tag_idp65286112.html b/doc/html/boost/accumulators/as_feature_tag_idp65286112.html deleted file mode 100644 index 246205acfe..0000000000 --- a/doc/html/boost/accumulators/as_feature_tag_idp65286112.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template as_feature<tag::pot_quantile< LeftRight >(with_threshold_value)> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template as_feature<tag::pot_quantile< LeftRight >(with_threshold_value)>

-

boost::accumulators::as_feature<tag::pot_quantile< LeftRight >(with_threshold_value)>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/pot_quantile.hpp>
-
-template<typename LeftRight> 
-struct as_feature<tag::pot_quantile< LeftRight >(with_threshold_value)> {
-  // types
-  typedef tag::pot_quantile< LeftRight > type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_feature_tag_idp65288944.html b/doc/html/boost/accumulators/as_feature_tag_idp65288944.html deleted file mode 100644 index 1a37445f16..0000000000 --- a/doc/html/boost/accumulators/as_feature_tag_idp65288944.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template as_feature<tag::weighted_pot_quantile< LeftRight >(with_threshold_probability)> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template as_feature<tag::weighted_pot_quantile< LeftRight >(with_threshold_probability)>

-

boost::accumulators::as_feature<tag::weighted_pot_quantile< LeftRight >(with_threshold_probability)>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/pot_quantile.hpp>
-
-template<typename LeftRight> 
-struct as_feature<tag::weighted_pot_quantile< LeftRight >(with_threshold_probability)> {
-  // types
-  typedef tag::weighted_pot_quantile_prob< LeftRight > type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_feature_tag_idp65291808.html b/doc/html/boost/accumulators/as_feature_tag_idp65291808.html deleted file mode 100644 index 87f87ad0bb..0000000000 --- a/doc/html/boost/accumulators/as_feature_tag_idp65291808.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template as_feature<tag::weighted_pot_quantile< LeftRight >(with_threshold_value)> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template as_feature<tag::weighted_pot_quantile< LeftRight >(with_threshold_value)>

-

boost::accumulators::as_feature<tag::weighted_pot_quantile< LeftRight >(with_threshold_value)>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/pot_quantile.hpp>
-
-template<typename LeftRight> 
-struct as_feature<tag::weighted_pot_quantile< LeftRight >(with_threshold_value)> {
-  // types
-  typedef tag::weighted_pot_quantile< LeftRight > type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_feature_tag_idp65313104.html b/doc/html/boost/accumulators/as_feature_tag_idp65313104.html deleted file mode 100644 index dc6606adf4..0000000000 --- a/doc/html/boost/accumulators/as_feature_tag_idp65313104.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template as_feature<tag::pot_tail_mean< LeftRight >(with_threshold_probability)> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template as_feature<tag::pot_tail_mean< LeftRight >(with_threshold_probability)>

-

boost::accumulators::as_feature<tag::pot_tail_mean< LeftRight >(with_threshold_probability)>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/pot_tail_mean.hpp>
-
-template<typename LeftRight> 
-struct as_feature<tag::pot_tail_mean< LeftRight >(with_threshold_probability)> {
-  // types
-  typedef tag::pot_tail_mean_prob< LeftRight > type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_feature_tag_idp65315952.html b/doc/html/boost/accumulators/as_feature_tag_idp65315952.html deleted file mode 100644 index 729dfd9573..0000000000 --- a/doc/html/boost/accumulators/as_feature_tag_idp65315952.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template as_feature<tag::pot_tail_mean< LeftRight >(with_threshold_value)> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template as_feature<tag::pot_tail_mean< LeftRight >(with_threshold_value)>

-

boost::accumulators::as_feature<tag::pot_tail_mean< LeftRight >(with_threshold_value)>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/pot_tail_mean.hpp>
-
-template<typename LeftRight> 
-struct as_feature<tag::pot_tail_mean< LeftRight >(with_threshold_value)> {
-  // types
-  typedef tag::pot_tail_mean< LeftRight > type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_feature_tag_idp65318784.html b/doc/html/boost/accumulators/as_feature_tag_idp65318784.html deleted file mode 100644 index 16e8b9313a..0000000000 --- a/doc/html/boost/accumulators/as_feature_tag_idp65318784.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template as_feature<tag::weighted_pot_tail_mean< LeftRight >(with_threshold_probability)> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template as_feature<tag::weighted_pot_tail_mean< LeftRight >(with_threshold_probability)>

-

boost::accumulators::as_feature<tag::weighted_pot_tail_mean< LeftRight >(with_threshold_probability)>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/pot_tail_mean.hpp>
-
-template<typename LeftRight> 
-struct as_feature<tag::weighted_pot_tail_mean< LeftRight >(with_threshold_probability)> {
-  // types
-  typedef tag::weighted_pot_tail_mean_prob< LeftRight > type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_feature_tag_idp65321648.html b/doc/html/boost/accumulators/as_feature_tag_idp65321648.html deleted file mode 100644 index 5381d30550..0000000000 --- a/doc/html/boost/accumulators/as_feature_tag_idp65321648.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template as_feature<tag::weighted_pot_tail_mean< LeftRight >(with_threshold_value)> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template as_feature<tag::weighted_pot_tail_mean< LeftRight >(with_threshold_value)>

-

boost::accumulators::as_feature<tag::weighted_pot_tail_mean< LeftRight >(with_threshold_value)>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/pot_tail_mean.hpp>
-
-template<typename LeftRight> 
-struct as_feature<tag::weighted_pot_tail_mean< LeftRight >(with_threshold_value)> {
-  // types
-  typedef tag::weighted_pot_tail_mean< LeftRight > type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_feature_tag_idp65351376.html b/doc/html/boost/accumulators/as_feature_tag_idp65351376.html deleted file mode 100644 index 794561ade0..0000000000 --- a/doc/html/boost/accumulators/as_feature_tag_idp65351376.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct as_feature<tag::rolling_mean(immediate)> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct as_feature<tag::rolling_mean(immediate)>

-

boost::accumulators::as_feature<tag::rolling_mean(immediate)>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/rolling_mean.hpp>
-
-
-struct as_feature<tag::rolling_mean(immediate)> {
-  // types
-  typedef tag::immediate_rolling_mean type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_feature_tag_idp65353488.html b/doc/html/boost/accumulators/as_feature_tag_idp65353488.html deleted file mode 100644 index 9654ef8120..0000000000 --- a/doc/html/boost/accumulators/as_feature_tag_idp65353488.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct as_feature<tag::rolling_mean(lazy)> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct as_feature<tag::rolling_mean(lazy)>

-

boost::accumulators::as_feature<tag::rolling_mean(lazy)>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/rolling_mean.hpp>
-
-
-struct as_feature<tag::rolling_mean(lazy)> {
-  // types
-  typedef tag::lazy_rolling_mean type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_feature_tag_idp65421120.html b/doc/html/boost/accumulators/as_feature_tag_idp65421120.html deleted file mode 100644 index ecd7de888c..0000000000 --- a/doc/html/boost/accumulators/as_feature_tag_idp65421120.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct as_feature<tag::rolling_variance(immediate)> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct as_feature<tag::rolling_variance(immediate)>

-

boost::accumulators::as_feature<tag::rolling_variance(immediate)>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/rolling_variance.hpp>
-
-
-struct as_feature<tag::rolling_variance(immediate)> {
-  // types
-  typedef tag::immediate_rolling_variance type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_feature_tag_idp65423232.html b/doc/html/boost/accumulators/as_feature_tag_idp65423232.html deleted file mode 100644 index af05d0c260..0000000000 --- a/doc/html/boost/accumulators/as_feature_tag_idp65423232.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct as_feature<tag::rolling_variance(lazy)> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct as_feature<tag::rolling_variance(lazy)>

-

boost::accumulators::as_feature<tag::rolling_variance(lazy)>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/rolling_variance.hpp>
-
-
-struct as_feature<tag::rolling_variance(lazy)> {
-  // types
-  typedef tag::lazy_rolling_variance type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_feature_tag_idp65572848.html b/doc/html/boost/accumulators/as_feature_tag_idp65572848.html deleted file mode 100644 index 29a66a5bbe..0000000000 --- a/doc/html/boost/accumulators/as_feature_tag_idp65572848.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct as_feature<tag::sum(kahan)> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct as_feature<tag::sum(kahan)>

-

boost::accumulators::as_feature<tag::sum(kahan)>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/sum_kahan.hpp>
-
-
-struct as_feature<tag::sum(kahan)> {
-  // types
-  typedef tag::sum_kahan type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_feature_tag_idp65574928.html b/doc/html/boost/accumulators/as_feature_tag_idp65574928.html deleted file mode 100644 index 64c3733ab9..0000000000 --- a/doc/html/boost/accumulators/as_feature_tag_idp65574928.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct as_feature<tag::sum_of_weights(kahan)> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct as_feature<tag::sum_of_weights(kahan)>

-

boost::accumulators::as_feature<tag::sum_of_weights(kahan)>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/sum_kahan.hpp>
-
-
-struct as_feature<tag::sum_of_weights(kahan)> {
-  // types
-  typedef tag::sum_of_weights_kahan type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_feature_tag_idp65660848.html b/doc/html/boost/accumulators/as_feature_tag_idp65660848.html deleted file mode 100644 index c3f5b51209..0000000000 --- a/doc/html/boost/accumulators/as_feature_tag_idp65660848.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template as_feature<tag::tail_variate_means< LeftRight, VariateType, VariateTag >(absolute)> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template as_feature<tag::tail_variate_means< LeftRight, VariateType, VariateTag >(absolute)>

-

boost::accumulators::as_feature<tag::tail_variate_means< LeftRight, VariateType, VariateTag >(absolute)>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/tail_variate_means.hpp>
-
-template<typename LeftRight, typename VariateType, typename VariateTag> 
-struct as_feature<tag::tail_variate_means< LeftRight, VariateType, VariateTag >(absolute)> {
-  // types
-  typedef tag::absolute_tail_variate_means< LeftRight, VariateType, VariateTag > type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_feature_tag_idp65665392.html b/doc/html/boost/accumulators/as_feature_tag_idp65665392.html deleted file mode 100644 index 4ce896864f..0000000000 --- a/doc/html/boost/accumulators/as_feature_tag_idp65665392.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template as_feature<tag::tail_variate_means< LeftRight, VariateType, VariateTag >(relative)> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template as_feature<tag::tail_variate_means< LeftRight, VariateType, VariateTag >(relative)>

-

boost::accumulators::as_feature<tag::tail_variate_means< LeftRight, VariateType, VariateTag >(relative)>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/tail_variate_means.hpp>
-
-template<typename LeftRight, typename VariateType, typename VariateTag> 
-struct as_feature<tag::tail_variate_means< LeftRight, VariateType, VariateTag >(relative)> {
-  // types
-  typedef tag::relative_tail_variate_means< LeftRight, VariateType, VariateTag > type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_feature_tag_idp65706992.html b/doc/html/boost/accumulators/as_feature_tag_idp65706992.html deleted file mode 100644 index 2f49e0cabc..0000000000 --- a/doc/html/boost/accumulators/as_feature_tag_idp65706992.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct as_feature<tag::variance(immediate)> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct as_feature<tag::variance(immediate)>

-

boost::accumulators::as_feature<tag::variance(immediate)>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/variance.hpp>
-
-
-struct as_feature<tag::variance(immediate)> {
-  // types
-  typedef tag::variance type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_feature_tag_idp65709088.html b/doc/html/boost/accumulators/as_feature_tag_idp65709088.html deleted file mode 100644 index fb41a310dc..0000000000 --- a/doc/html/boost/accumulators/as_feature_tag_idp65709088.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct as_feature<tag::variance(lazy)> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct as_feature<tag::variance(lazy)>

-

boost::accumulators::as_feature<tag::variance(lazy)>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/variance.hpp>
-
-
-struct as_feature<tag::variance(lazy)> {
-  // types
-  typedef tag::lazy_variance type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_feature_tag_idp65768368.html b/doc/html/boost/accumulators/as_feature_tag_idp65768368.html deleted file mode 100644 index 1893f25944..0000000000 --- a/doc/html/boost/accumulators/as_feature_tag_idp65768368.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct as_feature<tag::weighted_mean(immediate)> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct as_feature<tag::weighted_mean(immediate)>

-

boost::accumulators::as_feature<tag::weighted_mean(immediate)>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_mean.hpp>
-
-
-struct as_feature<tag::weighted_mean(immediate)> {
-  // types
-  typedef tag::immediate_weighted_mean type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_feature_tag_idp65770480.html b/doc/html/boost/accumulators/as_feature_tag_idp65770480.html deleted file mode 100644 index 49c29fabdb..0000000000 --- a/doc/html/boost/accumulators/as_feature_tag_idp65770480.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct as_feature<tag::weighted_mean(lazy)> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct as_feature<tag::weighted_mean(lazy)>

-

boost::accumulators::as_feature<tag::weighted_mean(lazy)>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_mean.hpp>
-
-
-struct as_feature<tag::weighted_mean(lazy)> {
-  // types
-  typedef tag::weighted_mean type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_feature_tag_idp65772576.html b/doc/html/boost/accumulators/as_feature_tag_idp65772576.html deleted file mode 100644 index 0a8bc7393f..0000000000 --- a/doc/html/boost/accumulators/as_feature_tag_idp65772576.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template as_feature<tag::weighted_mean_of_variates< VariateType, VariateTag >(immediate)> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template as_feature<tag::weighted_mean_of_variates< VariateType, VariateTag >(immediate)>

-

boost::accumulators::as_feature<tag::weighted_mean_of_variates< VariateType, VariateTag >(immediate)>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_mean.hpp>
-
-template<typename VariateType, typename VariateTag> 
-struct as_feature<tag::weighted_mean_of_variates< VariateType, VariateTag >(immediate)> {
-  // types
-  typedef tag::immediate_weighted_mean_of_variates< VariateType, VariateTag > type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_feature_tag_idp65776304.html b/doc/html/boost/accumulators/as_feature_tag_idp65776304.html deleted file mode 100644 index 942c01f35a..0000000000 --- a/doc/html/boost/accumulators/as_feature_tag_idp65776304.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template as_feature<tag::weighted_mean_of_variates< VariateType, VariateTag >(lazy)> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template as_feature<tag::weighted_mean_of_variates< VariateType, VariateTag >(lazy)>

-

boost::accumulators::as_feature<tag::weighted_mean_of_variates< VariateType, VariateTag >(lazy)>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_mean.hpp>
-
-template<typename VariateType, typename VariateTag> 
-struct as_feature<tag::weighted_mean_of_variates< VariateType, VariateTag >(lazy)> {
-  // types
-  typedef tag::weighted_mean_of_variates< VariateType, VariateTag > type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_feature_tag_idp65787952.html b/doc/html/boost/accumulators/as_feature_tag_idp65787952.html deleted file mode 100644 index bf233c6779..0000000000 --- a/doc/html/boost/accumulators/as_feature_tag_idp65787952.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct as_feature<tag::weighted_median(with_density)> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct as_feature<tag::weighted_median(with_density)>

-

boost::accumulators::as_feature<tag::weighted_median(with_density)>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_median.hpp>
-
-
-struct as_feature<tag::weighted_median(with_density)> {
-  // types
-  typedef tag::with_density_weighted_median type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_feature_tag_idp65790064.html b/doc/html/boost/accumulators/as_feature_tag_idp65790064.html deleted file mode 100644 index 3773829cf9..0000000000 --- a/doc/html/boost/accumulators/as_feature_tag_idp65790064.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct as_feature<tag::weighted_median(with_p_square_cumulative_distribution)> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct as_feature<tag::weighted_median(with_p_square_cumulative_distribution)>

-

boost::accumulators::as_feature<tag::weighted_median(with_p_square_cumulative_distribution)>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_median.hpp>
-
-
-struct as_feature<tag::weighted_median(with_p_square_cumulative_distribution)> {
-  // types
-  typedef tag::with_p_square_cumulative_distribution_weighted_median type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_feature_tag_idp65792240.html b/doc/html/boost/accumulators/as_feature_tag_idp65792240.html deleted file mode 100644 index 7ac15621d9..0000000000 --- a/doc/html/boost/accumulators/as_feature_tag_idp65792240.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct as_feature<tag::weighted_median(with_p_square_quantile)> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct as_feature<tag::weighted_median(with_p_square_quantile)>

-

boost::accumulators::as_feature<tag::weighted_median(with_p_square_quantile)>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_median.hpp>
-
-
-struct as_feature<tag::weighted_median(with_p_square_quantile)> {
-  // types
-  typedef tag::weighted_median type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_feature_tag_idp65830272.html b/doc/html/boost/accumulators/as_feature_tag_idp65830272.html deleted file mode 100644 index 3753cd92cd..0000000000 --- a/doc/html/boost/accumulators/as_feature_tag_idp65830272.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template as_feature<tag::weighted_peaks_over_threshold< LeftRight >(with_threshold_probability)> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template as_feature<tag::weighted_peaks_over_threshold< LeftRight >(with_threshold_probability)>

-

boost::accumulators::as_feature<tag::weighted_peaks_over_threshold< LeftRight >(with_threshold_probability)>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_peaks_over_threshold.hpp>
-
-template<typename LeftRight> 
-struct as_feature<tag::weighted_peaks_over_threshold< LeftRight >(with_threshold_probability)> {
-  // types
-  typedef tag::weighted_peaks_over_threshold_prob< LeftRight > type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_feature_tag_idp65833152.html b/doc/html/boost/accumulators/as_feature_tag_idp65833152.html deleted file mode 100644 index ab23a57893..0000000000 --- a/doc/html/boost/accumulators/as_feature_tag_idp65833152.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template as_feature<tag::weighted_peaks_over_threshold< LeftRight >(with_threshold_value)> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template as_feature<tag::weighted_peaks_over_threshold< LeftRight >(with_threshold_value)>

-

boost::accumulators::as_feature<tag::weighted_peaks_over_threshold< LeftRight >(with_threshold_value)>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_peaks_over_threshold.hpp>
-
-template<typename LeftRight> 
-struct as_feature<tag::weighted_peaks_over_threshold< LeftRight >(with_threshold_value)> {
-  // types
-  typedef tag::weighted_peaks_over_threshold< LeftRight > type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_feature_tag_idp65861648.html b/doc/html/boost/accumulators/as_feature_tag_idp65861648.html deleted file mode 100644 index 611d4f457e..0000000000 --- a/doc/html/boost/accumulators/as_feature_tag_idp65861648.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct as_feature<tag::weighted_sum(kahan)> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct as_feature<tag::weighted_sum(kahan)>

-

boost::accumulators::as_feature<tag::weighted_sum(kahan)>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_sum_kahan.hpp>
-
-
-struct as_feature<tag::weighted_sum(kahan)> {
-  // types
-  typedef tag::weighted_sum_kahan type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_feature_tag_idp65889776.html b/doc/html/boost/accumulators/as_feature_tag_idp65889776.html deleted file mode 100644 index f049b06a7e..0000000000 --- a/doc/html/boost/accumulators/as_feature_tag_idp65889776.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template as_feature<tag::weighted_tail_variate_means< LeftRight, VariateType, VariateTag >(absolute)> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template as_feature<tag::weighted_tail_variate_means< LeftRight, VariateType, VariateTag >(absolute)>

-

boost::accumulators::as_feature<tag::weighted_tail_variate_means< LeftRight, VariateType, VariateTag >(absolute)>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_tail_variate_means.hpp>
-
-template<typename LeftRight, typename VariateType, typename VariateTag> 
-struct as_feature<tag::weighted_tail_variate_means< LeftRight, VariateType, VariateTag >(absolute)> {
-  // types
-  typedef tag::absolute_weighted_tail_variate_means< LeftRight, VariateType, VariateTag > type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_feature_tag_idp65894352.html b/doc/html/boost/accumulators/as_feature_tag_idp65894352.html deleted file mode 100644 index 5807f63379..0000000000 --- a/doc/html/boost/accumulators/as_feature_tag_idp65894352.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template as_feature<tag::weighted_tail_variate_means< LeftRight, VariateType, VariateTag >(relative)> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template as_feature<tag::weighted_tail_variate_means< LeftRight, VariateType, VariateTag >(relative)>

-

boost::accumulators::as_feature<tag::weighted_tail_variate_means< LeftRight, VariateType, VariateTag >(relative)>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_tail_variate_means.hpp>
-
-template<typename LeftRight, typename VariateType, typename VariateTag> 
-struct as_feature<tag::weighted_tail_variate_means< LeftRight, VariateType, VariateTag >(relative)> {
-  // types
-  typedef tag::relative_weighted_tail_variate_means< LeftRight, VariateType, VariateTag > type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_feature_tag_idp65910400.html b/doc/html/boost/accumulators/as_feature_tag_idp65910400.html deleted file mode 100644 index b7272beca6..0000000000 --- a/doc/html/boost/accumulators/as_feature_tag_idp65910400.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct as_feature<tag::weighted_variance(immediate)> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct as_feature<tag::weighted_variance(immediate)>

-

boost::accumulators::as_feature<tag::weighted_variance(immediate)>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_variance.hpp>
-
-
-struct as_feature<tag::weighted_variance(immediate)> {
-  // types
-  typedef tag::weighted_variance type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_feature_tag_idp65912496.html b/doc/html/boost/accumulators/as_feature_tag_idp65912496.html deleted file mode 100644 index 49058f1874..0000000000 --- a/doc/html/boost/accumulators/as_feature_tag_idp65912496.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct as_feature<tag::weighted_variance(lazy)> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct as_feature<tag::weighted_variance(lazy)>

-

boost::accumulators::as_feature<tag::weighted_variance(lazy)>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_variance.hpp>
-
-
-struct as_feature<tag::weighted_variance(lazy)> {
-  // types
-  typedef tag::lazy_weighted_variance type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_weigh_idm45507139493536.html b/doc/html/boost/accumulators/as_weigh_idm45507139493536.html new file mode 100644 index 0000000000..ca6475a03b --- /dev/null +++ b/doc/html/boost/accumulators/as_weigh_idm45507139493536.html @@ -0,0 +1,54 @@ + + + + +Struct template as_weighted_feature<tag::droppable< Feature >> + + + + + + + + + + + + + + + +
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
+
+
+PrevUpHomeNext +
+
+
+
+

Struct template as_weighted_feature<tag::droppable< Feature >>

+

boost::accumulators::as_weighted_feature<tag::droppable< Feature >>

+
+

Synopsis

+
// In header: <boost/accumulators/framework/accumulators/droppable_accumulator.hpp>
+
+template<typename Feature> 
+struct as_weighted_feature<tag::droppable< Feature >> {
+  // types
+  typedef tag::droppable< typename as_weighted_feature< Feature >::type > type;
+};
+
+ + + +
Copyright © 2005, 2006 Eric Niebler

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/doc/html/boost/accumulators/as_weighted_fe_idp64782400.html b/doc/html/boost/accumulators/as_weighted_fe_idp64782400.html deleted file mode 100644 index 8d30b2ef6e..0000000000 --- a/doc/html/boost/accumulators/as_weighted_fe_idp64782400.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template as_weighted_feature<tag::droppable< Feature >> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template as_weighted_feature<tag::droppable< Feature >>

-

boost::accumulators::as_weighted_feature<tag::droppable< Feature >>

-
-

Synopsis

-
// In header: <boost/accumulators/framework/accumulators/droppable_accumulator.hpp>
-
-template<typename Feature> 
-struct as_weighted_feature<tag::droppable< Feature >> {
-  // types
-  typedef tag::droppable< typename as_weighted_feature< Feature >::type > type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_weighted_fe_idp64882688.html b/doc/html/boost/accumulators/as_weighted_fe_idp64882688.html deleted file mode 100644 index e557fc4bb2..0000000000 --- a/doc/html/boost/accumulators/as_weighted_fe_idp64882688.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template as_weighted_feature<tag::covariance< VariateType, VariateTag >> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template as_weighted_feature<tag::covariance< VariateType, VariateTag >>

-

boost::accumulators::as_weighted_feature<tag::covariance< VariateType, VariateTag >>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/covariance.hpp>
-
-template<typename VariateType, typename VariateTag> 
-struct as_weighted_feature<tag::covariance< VariateType, VariateTag >> {
-  // types
-  typedef tag::weighted_covariance< VariateType, VariateTag > type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_weighted_fe_idp64917456.html b/doc/html/boost/accumulators/as_weighted_fe_idp64917456.html deleted file mode 100644 index 0e89840c17..0000000000 --- a/doc/html/boost/accumulators/as_weighted_fe_idp64917456.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct as_weighted_feature<tag::density> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct as_weighted_feature<tag::density>

-

boost::accumulators::as_weighted_feature<tag::density>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/density.hpp>
-
-
-struct as_weighted_feature<tag::density> {
-  // types
-  typedef tag::weighted_density type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_weighted_fe_idp64935328.html b/doc/html/boost/accumulators/as_weighted_fe_idp64935328.html deleted file mode 100644 index 38b9b7de82..0000000000 --- a/doc/html/boost/accumulators/as_weighted_fe_idp64935328.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template as_weighted_feature<tag::error_of< Feature >> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template as_weighted_feature<tag::error_of< Feature >>

-

boost::accumulators::as_weighted_feature<tag::error_of< Feature >>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/error_of.hpp>
-
-template<typename Feature> 
-struct as_weighted_feature<tag::error_of< Feature >> {
-  // types
-  typedef tag::error_of< typename as_weighted_feature< Feature >::type > type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_weighted_fe_idp64949968.html b/doc/html/boost/accumulators/as_weighted_fe_idp64949968.html deleted file mode 100644 index d85f4b6851..0000000000 --- a/doc/html/boost/accumulators/as_weighted_fe_idp64949968.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct as_weighted_feature<tag::extended_p_square> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct as_weighted_feature<tag::extended_p_square>

-

boost::accumulators::as_weighted_feature<tag::extended_p_square>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/extended_p_square.hpp>
-
-
-struct as_weighted_feature<tag::extended_p_square> {
-  // types
-  typedef tag::weighted_extended_p_square type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_weighted_fe_idp64972496.html b/doc/html/boost/accumulators/as_weighted_fe_idp64972496.html deleted file mode 100644 index 335ad5dcb0..0000000000 --- a/doc/html/boost/accumulators/as_weighted_fe_idp64972496.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct as_weighted_feature<tag::extended_p_square_quantile> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct as_weighted_feature<tag::extended_p_square_quantile>

-

boost::accumulators::as_weighted_feature<tag::extended_p_square_quantile>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/extended_p_square_quantile.hpp>
-
-
-struct as_weighted_feature<tag::extended_p_square_quantile> {
-  // types
-  typedef tag::weighted_extended_p_square_quantile type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_weighted_fe_idp64974624.html b/doc/html/boost/accumulators/as_weighted_fe_idp64974624.html deleted file mode 100644 index f6fa18ec03..0000000000 --- a/doc/html/boost/accumulators/as_weighted_fe_idp64974624.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct as_weighted_feature<tag::extended_p_square_quantile_quadratic> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct as_weighted_feature<tag::extended_p_square_quantile_quadratic>

-

boost::accumulators::as_weighted_feature<tag::extended_p_square_quantile_quadratic>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/extended_p_square_quantile.hpp>
-
-
-struct as_weighted_feature<tag::extended_p_square_quantile_quadratic> {
-  // types
-  typedef tag::weighted_extended_p_square_quantile_quadratic type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_weighted_fe_idp65006928.html b/doc/html/boost/accumulators/as_weighted_fe_idp65006928.html deleted file mode 100644 index 633181db0a..0000000000 --- a/doc/html/boost/accumulators/as_weighted_fe_idp65006928.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct as_weighted_feature<tag::kurtosis> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct as_weighted_feature<tag::kurtosis>

-

boost::accumulators::as_weighted_feature<tag::kurtosis>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/kurtosis.hpp>
-
-
-struct as_weighted_feature<tag::kurtosis> {
-  // types
-  typedef tag::weighted_kurtosis type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_weighted_fe_idp65040288.html b/doc/html/boost/accumulators/as_weighted_fe_idp65040288.html deleted file mode 100644 index ac3c66e958..0000000000 --- a/doc/html/boost/accumulators/as_weighted_fe_idp65040288.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct as_weighted_feature<tag::immediate_mean> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct as_weighted_feature<tag::immediate_mean>

-

boost::accumulators::as_weighted_feature<tag::immediate_mean>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/mean.hpp>
-
-
-struct as_weighted_feature<tag::immediate_mean> {
-  // types
-  typedef tag::immediate_weighted_mean type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_weighted_fe_idp65042384.html b/doc/html/boost/accumulators/as_weighted_fe_idp65042384.html deleted file mode 100644 index 7ea56a86e7..0000000000 --- a/doc/html/boost/accumulators/as_weighted_fe_idp65042384.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template as_weighted_feature<tag::immediate_mean_of_variates< VariateType, VariateTag >> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template as_weighted_feature<tag::immediate_mean_of_variates< VariateType, VariateTag >>

-

boost::accumulators::as_weighted_feature<tag::immediate_mean_of_variates< VariateType, VariateTag >>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/mean.hpp>
-
-template<typename VariateType, typename VariateTag> 
-struct as_weighted_feature<tag::immediate_mean_of_variates< VariateType, VariateTag >> {
-  // types
-  typedef tag::immediate_weighted_mean_of_variates< VariateType, VariateTag > type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_weighted_fe_idp65046112.html b/doc/html/boost/accumulators/as_weighted_fe_idp65046112.html deleted file mode 100644 index af6d1612cd..0000000000 --- a/doc/html/boost/accumulators/as_weighted_fe_idp65046112.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct as_weighted_feature<tag::mean> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct as_weighted_feature<tag::mean>

-

boost::accumulators::as_weighted_feature<tag::mean>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/mean.hpp>
-
-
-struct as_weighted_feature<tag::mean> {
-  // types
-  typedef tag::weighted_mean type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_weighted_fe_idp65048192.html b/doc/html/boost/accumulators/as_weighted_fe_idp65048192.html deleted file mode 100644 index 3af0ab4366..0000000000 --- a/doc/html/boost/accumulators/as_weighted_fe_idp65048192.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template as_weighted_feature<tag::mean_of_variates< VariateType, VariateTag >> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template as_weighted_feature<tag::mean_of_variates< VariateType, VariateTag >>

-

boost::accumulators::as_weighted_feature<tag::mean_of_variates< VariateType, VariateTag >>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/mean.hpp>
-
-template<typename VariateType, typename VariateTag> 
-struct as_weighted_feature<tag::mean_of_variates< VariateType, VariateTag >> {
-  // types
-  typedef tag::weighted_mean_of_variates< VariateType, VariateTag > type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_weighted_fe_idp65087792.html b/doc/html/boost/accumulators/as_weighted_fe_idp65087792.html deleted file mode 100644 index 82bf3e521c..0000000000 --- a/doc/html/boost/accumulators/as_weighted_fe_idp65087792.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct as_weighted_feature<tag::median> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct as_weighted_feature<tag::median>

-

boost::accumulators::as_weighted_feature<tag::median>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/median.hpp>
-
-
-struct as_weighted_feature<tag::median> {
-  // types
-  typedef tag::weighted_median type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_weighted_fe_idp65089872.html b/doc/html/boost/accumulators/as_weighted_fe_idp65089872.html deleted file mode 100644 index 24177dd280..0000000000 --- a/doc/html/boost/accumulators/as_weighted_fe_idp65089872.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct as_weighted_feature<tag::with_density_median> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct as_weighted_feature<tag::with_density_median>

-

boost::accumulators::as_weighted_feature<tag::with_density_median>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/median.hpp>
-
-
-struct as_weighted_feature<tag::with_density_median> {
-  // types
-  typedef tag::with_density_weighted_median type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_weighted_fe_idp65091984.html b/doc/html/boost/accumulators/as_weighted_fe_idp65091984.html deleted file mode 100644 index 9e5918d517..0000000000 --- a/doc/html/boost/accumulators/as_weighted_fe_idp65091984.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct as_weighted_feature<tag::with_p_square_cumulative_distribution_median> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct as_weighted_feature<tag::with_p_square_cumulative_distribution_median>

-

boost::accumulators::as_weighted_feature<tag::with_p_square_cumulative_distribution_median>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/median.hpp>
-
-
-struct as_weighted_feature<tag::with_p_square_cumulative_distribution_median> {
-  // types
-  typedef tag::with_p_square_cumulative_distribution_weighted_median type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_weighted_fe_idp65121904.html b/doc/html/boost/accumulators/as_weighted_fe_idp65121904.html deleted file mode 100644 index d61621c0d6..0000000000 --- a/doc/html/boost/accumulators/as_weighted_fe_idp65121904.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template as_weighted_feature<tag::moment< N >> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template as_weighted_feature<tag::moment< N >>

-

boost::accumulators::as_weighted_feature<tag::moment< N >>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/moment.hpp>
-
-template<int N> 
-struct as_weighted_feature<tag::moment< N >> {
-  // types
-  typedef tag::weighted_moment< N > type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_weighted_fe_idp65132624.html b/doc/html/boost/accumulators/as_weighted_fe_idp65132624.html deleted file mode 100644 index 05c4c23ccf..0000000000 --- a/doc/html/boost/accumulators/as_weighted_fe_idp65132624.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct as_weighted_feature<tag::p_square_cumulative_distribution> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct as_weighted_feature<tag::p_square_cumulative_distribution>

-

boost::accumulators::as_weighted_feature<tag::p_square_cumulative_distribution>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/p_square_cumul_dist.hpp>
-
-
-struct as_weighted_feature<tag::p_square_cumulative_distribution> {
-  // types
-  typedef tag::weighted_p_square_cumulative_distribution type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_weighted_fe_idp65144848.html b/doc/html/boost/accumulators/as_weighted_fe_idp65144848.html deleted file mode 100644 index 17093084d6..0000000000 --- a/doc/html/boost/accumulators/as_weighted_fe_idp65144848.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct as_weighted_feature<tag::p_square_quantile> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct as_weighted_feature<tag::p_square_quantile>

-

boost::accumulators::as_weighted_feature<tag::p_square_quantile>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/p_square_quantile.hpp>
-
-
-struct as_weighted_feature<tag::p_square_quantile> {
-  // types
-  typedef tag::weighted_p_square_quantile type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_weighted_fe_idp65163952.html b/doc/html/boost/accumulators/as_weighted_fe_idp65163952.html deleted file mode 100644 index 67bca813ee..0000000000 --- a/doc/html/boost/accumulators/as_weighted_fe_idp65163952.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template as_weighted_feature<tag::peaks_over_threshold< LeftRight >> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template as_weighted_feature<tag::peaks_over_threshold< LeftRight >>

-

boost::accumulators::as_weighted_feature<tag::peaks_over_threshold< LeftRight >>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/peaks_over_threshold.hpp>
-
-template<typename LeftRight> 
-struct as_weighted_feature<tag::peaks_over_threshold< LeftRight >> {
-  // types
-  typedef tag::weighted_peaks_over_threshold< LeftRight > type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_weighted_fe_idp65166784.html b/doc/html/boost/accumulators/as_weighted_fe_idp65166784.html deleted file mode 100644 index 8808274bc8..0000000000 --- a/doc/html/boost/accumulators/as_weighted_fe_idp65166784.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template as_weighted_feature<tag::peaks_over_threshold_prob< LeftRight >> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template as_weighted_feature<tag::peaks_over_threshold_prob< LeftRight >>

-

boost::accumulators::as_weighted_feature<tag::peaks_over_threshold_prob< LeftRight >>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/peaks_over_threshold.hpp>
-
-template<typename LeftRight> 
-struct as_weighted_feature<tag::peaks_over_threshold_prob< LeftRight >> {
-  // types
-  typedef tag::weighted_peaks_over_threshold_prob< LeftRight > type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_weighted_fe_idp65294672.html b/doc/html/boost/accumulators/as_weighted_fe_idp65294672.html deleted file mode 100644 index 1d3eb11484..0000000000 --- a/doc/html/boost/accumulators/as_weighted_fe_idp65294672.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template as_weighted_feature<tag::pot_quantile< LeftRight >> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template as_weighted_feature<tag::pot_quantile< LeftRight >>

-

boost::accumulators::as_weighted_feature<tag::pot_quantile< LeftRight >>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/pot_quantile.hpp>
-
-template<typename LeftRight> 
-struct as_weighted_feature<tag::pot_quantile< LeftRight >> {
-  // types
-  typedef tag::weighted_pot_quantile< LeftRight > type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_weighted_fe_idp65297504.html b/doc/html/boost/accumulators/as_weighted_fe_idp65297504.html deleted file mode 100644 index 0739537e91..0000000000 --- a/doc/html/boost/accumulators/as_weighted_fe_idp65297504.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template as_weighted_feature<tag::pot_quantile_prob< LeftRight >> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template as_weighted_feature<tag::pot_quantile_prob< LeftRight >>

-

boost::accumulators::as_weighted_feature<tag::pot_quantile_prob< LeftRight >>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/pot_quantile.hpp>
-
-template<typename LeftRight> 
-struct as_weighted_feature<tag::pot_quantile_prob< LeftRight >> {
-  // types
-  typedef tag::weighted_pot_quantile_prob< LeftRight > type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_weighted_fe_idp65324512.html b/doc/html/boost/accumulators/as_weighted_fe_idp65324512.html deleted file mode 100644 index 7ec60618ce..0000000000 --- a/doc/html/boost/accumulators/as_weighted_fe_idp65324512.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template as_weighted_feature<tag::pot_tail_mean< LeftRight >> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template as_weighted_feature<tag::pot_tail_mean< LeftRight >>

-

boost::accumulators::as_weighted_feature<tag::pot_tail_mean< LeftRight >>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/pot_tail_mean.hpp>
-
-template<typename LeftRight> 
-struct as_weighted_feature<tag::pot_tail_mean< LeftRight >> {
-  // types
-  typedef tag::weighted_pot_tail_mean< LeftRight > type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_weighted_fe_idp65327344.html b/doc/html/boost/accumulators/as_weighted_fe_idp65327344.html deleted file mode 100644 index b90009fea7..0000000000 --- a/doc/html/boost/accumulators/as_weighted_fe_idp65327344.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template as_weighted_feature<tag::pot_tail_mean_prob< LeftRight >> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template as_weighted_feature<tag::pot_tail_mean_prob< LeftRight >>

-

boost::accumulators::as_weighted_feature<tag::pot_tail_mean_prob< LeftRight >>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/pot_tail_mean.hpp>
-
-template<typename LeftRight> 
-struct as_weighted_feature<tag::pot_tail_mean_prob< LeftRight >> {
-  // types
-  typedef tag::weighted_pot_tail_mean_prob< LeftRight > type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_weighted_fe_idp65539840.html b/doc/html/boost/accumulators/as_weighted_fe_idp65539840.html deleted file mode 100644 index 9cb0df2904..0000000000 --- a/doc/html/boost/accumulators/as_weighted_fe_idp65539840.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct as_weighted_feature<tag::skewness> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct as_weighted_feature<tag::skewness>

-

boost::accumulators::as_weighted_feature<tag::skewness>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/skewness.hpp>
-
-
-struct as_weighted_feature<tag::skewness> {
-  // types
-  typedef tag::weighted_skewness type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_weighted_fe_idp65553024.html b/doc/html/boost/accumulators/as_weighted_fe_idp65553024.html deleted file mode 100644 index f0ff47259d..0000000000 --- a/doc/html/boost/accumulators/as_weighted_fe_idp65553024.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct as_weighted_feature<tag::sum> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct as_weighted_feature<tag::sum>

-

boost::accumulators::as_weighted_feature<tag::sum>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/sum.hpp>
-
-
-struct as_weighted_feature<tag::sum> {
-  // types
-  typedef tag::weighted_sum type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_weighted_fe_idp65577040.html b/doc/html/boost/accumulators/as_weighted_fe_idp65577040.html deleted file mode 100644 index afd4360581..0000000000 --- a/doc/html/boost/accumulators/as_weighted_fe_idp65577040.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct as_weighted_feature<tag::sum_kahan> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct as_weighted_feature<tag::sum_kahan>

-

boost::accumulators::as_weighted_feature<tag::sum_kahan>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/sum_kahan.hpp>
-
-
-struct as_weighted_feature<tag::sum_kahan> {
-  // types
-  typedef tag::weighted_sum_kahan type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_weighted_fe_idp65613072.html b/doc/html/boost/accumulators/as_weighted_fe_idp65613072.html deleted file mode 100644 index 29ad63993e..0000000000 --- a/doc/html/boost/accumulators/as_weighted_fe_idp65613072.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template as_weighted_feature<tag::non_coherent_tail_mean< LeftRight >> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template as_weighted_feature<tag::non_coherent_tail_mean< LeftRight >>

-

boost::accumulators::as_weighted_feature<tag::non_coherent_tail_mean< LeftRight >>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/tail_mean.hpp>
-
-template<typename LeftRight> 
-struct as_weighted_feature<tag::non_coherent_tail_mean< LeftRight >> {
-  // types
-  typedef tag::non_coherent_weighted_tail_mean< LeftRight > type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_weighted_fe_idp65631344.html b/doc/html/boost/accumulators/as_weighted_fe_idp65631344.html deleted file mode 100644 index 0f0e529761..0000000000 --- a/doc/html/boost/accumulators/as_weighted_fe_idp65631344.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template as_weighted_feature<tag::tail_quantile< LeftRight >> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template as_weighted_feature<tag::tail_quantile< LeftRight >>

-

boost::accumulators::as_weighted_feature<tag::tail_quantile< LeftRight >>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/tail_quantile.hpp>
-
-template<typename LeftRight> 
-struct as_weighted_feature<tag::tail_quantile< LeftRight >> {
-  // types
-  typedef tag::weighted_tail_quantile< LeftRight > type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_weighted_fe_idp65669936.html b/doc/html/boost/accumulators/as_weighted_fe_idp65669936.html deleted file mode 100644 index 99a661d7a3..0000000000 --- a/doc/html/boost/accumulators/as_weighted_fe_idp65669936.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template as_weighted_feature<tag::absolute_tail_variate_means< LeftRight, VariateType, VariateTag >> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template as_weighted_feature<tag::absolute_tail_variate_means< LeftRight, VariateType, VariateTag >>

-

boost::accumulators::as_weighted_feature<tag::absolute_tail_variate_means< LeftRight, VariateType, VariateTag >>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/tail_variate_means.hpp>
-
-template<typename LeftRight, typename VariateType, typename VariateTag> 
-struct as_weighted_feature<tag::absolute_tail_variate_means< LeftRight, VariateType, VariateTag >> {
-  // types
-  typedef tag::absolute_weighted_tail_variate_means< LeftRight, VariateType, VariateTag > type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_weighted_fe_idp65674512.html b/doc/html/boost/accumulators/as_weighted_fe_idp65674512.html deleted file mode 100644 index ae6663a1bf..0000000000 --- a/doc/html/boost/accumulators/as_weighted_fe_idp65674512.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template as_weighted_feature<tag::relative_tail_variate_means< LeftRight, VariateType, VariateTag >> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template as_weighted_feature<tag::relative_tail_variate_means< LeftRight, VariateType, VariateTag >>

-

boost::accumulators::as_weighted_feature<tag::relative_tail_variate_means< LeftRight, VariateType, VariateTag >>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/tail_variate_means.hpp>
-
-template<typename LeftRight, typename VariateType, typename VariateTag> 
-struct as_weighted_feature<tag::relative_tail_variate_means< LeftRight, VariateType, VariateTag >> {
-  // types
-  typedef tag::relative_weighted_tail_variate_means< LeftRight, VariateType, VariateTag > type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_weighted_fe_idp65711168.html b/doc/html/boost/accumulators/as_weighted_fe_idp65711168.html deleted file mode 100644 index ae3ee22ab2..0000000000 --- a/doc/html/boost/accumulators/as_weighted_fe_idp65711168.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct as_weighted_feature<tag::lazy_variance> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct as_weighted_feature<tag::lazy_variance>

-

boost::accumulators::as_weighted_feature<tag::lazy_variance>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/variance.hpp>
-
-
-struct as_weighted_feature<tag::lazy_variance> {
-  // types
-  typedef tag::lazy_weighted_variance type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/as_weighted_fe_idp65713264.html b/doc/html/boost/accumulators/as_weighted_fe_idp65713264.html deleted file mode 100644 index d6149241df..0000000000 --- a/doc/html/boost/accumulators/as_weighted_fe_idp65713264.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct as_weighted_feature<tag::variance> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct as_weighted_feature<tag::variance>

-

boost::accumulators::as_weighted_feature<tag::variance>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/variance.hpp>
-
-
-struct as_weighted_feature<tag::variance> {
-  // types
-  typedef tag::weighted_variance type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/covariate1.html b/doc/html/boost/accumulators/covariate1.html deleted file mode 100644 index b19fb5d841..0000000000 --- a/doc/html/boost/accumulators/covariate1.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global covariate1 - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global covariate1

-

boost::accumulators::covariate1

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/variates/covariate.hpp>
-
-boost::parameter::keyword< tag::covariate1 > const covariate1;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/covariate2.html b/doc/html/boost/accumulators/covariate2.html deleted file mode 100644 index 2bd32455db..0000000000 --- a/doc/html/boost/accumulators/covariate2.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global covariate2 - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global covariate2

-

boost::accumulators::covariate2

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/variates/covariate.hpp>
-
-boost::parameter::keyword< tag::covariate2 > const covariate2;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/dont_care.html b/doc/html/boost/accumulators/dont_care.html index 6447f354dd..8ccd9cba4c 100644 --- a/doc/html/boost/accumulators/dont_care.html +++ b/doc/html/boost/accumulators/dont_care.html @@ -35,16 +35,16 @@ struct dont_care { // construct/copy/destruct - template<typename Args> dont_care(Args const &); + template<typename Args> dont_care(Args const &); };
-

Description

+

Description

-

+

dont_care public construct/copy/destruct

-
  1. template<typename Args> dont_care(Args const &);
+
  1. template<typename Args> dont_care(Args const &);
diff --git a/doc/html/boost/accumulators/droppable_accumulator.html b/doc/html/boost/accumulators/droppable_accumulator.html index 77becdb14c..5dcbcbeba8 100644 --- a/doc/html/boost/accumulators/droppable_accumulator.html +++ b/doc/html/boost/accumulators/droppable_accumulator.html @@ -37,19 +37,19 @@ public boost::accumulators::droppable_accumulator_base< Accumulator > { // construct/copy/destruct - template<typename Args> droppable_accumulator(Args const &); - droppable_accumulator(droppable_accumulator const &); + template<typename Args> droppable_accumulator(Args const &); + droppable_accumulator(droppable_accumulator const &); };
-

Description

+

Description

-

+

droppable_accumulator public construct/copy/destruct

    -
  1. template<typename Args> droppable_accumulator(Args const & args);
    2. -
  2. droppable_accumulator(droppable_accumulator const & that);
    3. +
  3. template<typename Args> droppable_accumulator(Args const & args);
    4. +
  4. droppable_accumulator(droppable_accumulator const & that);
diff --git a/doc/html/boost/accumulators/droppable_accumulator_base.html b/doc/html/boost/accumulators/droppable_accumulator_base.html index e68e0d223c..5d3e941fc7 100644 --- a/doc/html/boost/accumulators/droppable_accumulator_base.html +++ b/doc/html/boost/accumulators/droppable_accumulator_base.html @@ -35,35 +35,35 @@ template<typename Accumulator> struct droppable_accumulator_base : public Accumulator { // construct/copy/destruct - template<typename Args> droppable_accumulator_base(Args const &); - droppable_accumulator_base(droppable_accumulator_base const &); + template<typename Args> droppable_accumulator_base(Args const &); + droppable_accumulator_base(droppable_accumulator_base const &); - // public member functions - template<typename Args> void operator()(Args const &); - template<typename Args> void add_ref(Args const &); - template<typename Args> void drop(Args const &); - bool is_dropped() const; + // public member functions + template<typename Args> void operator()(Args const &); + template<typename Args> void add_ref(Args const &); + template<typename Args> void drop(Args const &); + bool is_dropped() const; };
-

Description

+

Description

-

+

droppable_accumulator_base public construct/copy/destruct

    -
  1. template<typename Args> droppable_accumulator_base(Args const & args);
    2. -
  2. droppable_accumulator_base(droppable_accumulator_base const & that);
    3. +
  3. template<typename Args> droppable_accumulator_base(Args const & args);
    4. +
  4. droppable_accumulator_base(droppable_accumulator_base const & that);
-

-droppable_accumulator_base public member functions

+

+droppable_accumulator_base public member functions

    -
  1. template<typename Args> void operator()(Args const & args);
    2. -
  2. template<typename Args> void add_ref(Args const &);
    3. -
  3. template<typename Args> void drop(Args const & args);
    4. -
  4. bool is_dropped() const;
    5. +
  5. template<typename Args> void operator()(Args const & args);
    6. +
  6. template<typename Args> void add_ref(Args const &);
    7. +
  7. template<typename Args> void drop(Args const & args);
    8. +
  8. bool is_dropped() const;
diff --git a/doc/html/boost/accumulators/extract/coherent_tail_mean.html b/doc/html/boost/accumulators/extract/coherent_tail_mean.html deleted file mode 100644 index 368e7f944a..0000000000 --- a/doc/html/boost/accumulators/extract/coherent_tail_mean.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global coherent_tail_mean - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global coherent_tail_mean

-

boost::accumulators::extract::coherent_tail_mean

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/tail_mean.hpp>
-
-extractor< tag::tail_mean > const coherent_tail_mean;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/count.html b/doc/html/boost/accumulators/extract/count.html deleted file mode 100644 index 103107b889..0000000000 --- a/doc/html/boost/accumulators/extract/count.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global count - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global count

-

boost::accumulators::extract::count

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/count.hpp>
-
-extractor< tag::count > const count;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/covariance.html b/doc/html/boost/accumulators/extract/covariance.html deleted file mode 100644 index b899ae33d4..0000000000 --- a/doc/html/boost/accumulators/extract/covariance.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global covariance - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global covariance

-

boost::accumulators::extract::covariance

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/covariance.hpp>
-
-extractor< tag::abstract_covariance > const covariance;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/density.html b/doc/html/boost/accumulators/extract/density.html deleted file mode 100644 index 29f2ccce5f..0000000000 --- a/doc/html/boost/accumulators/extract/density.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global density - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global density

-

boost::accumulators::extract::density

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/density.hpp>
-
-extractor< tag::density > const density;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/extended_p_squ_idp64985888.html b/doc/html/boost/accumulators/extract/extended_p_squ_idp64985888.html deleted file mode 100644 index 2ee0602bca..0000000000 --- a/doc/html/boost/accumulators/extract/extended_p_squ_idp64985888.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global extended_p_square_quantile_quadratic - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global extended_p_square_quantile_quadratic

-

boost::accumulators::extract::extended_p_square_quantile_quadratic

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/extended_p_square_quantile.hpp>
-
-extractor< tag::extended_p_square_quantile_quadratic > const extended_p_square_quantile_quadratic;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/extended_p_square.html b/doc/html/boost/accumulators/extract/extended_p_square.html deleted file mode 100644 index f46144a72b..0000000000 --- a/doc/html/boost/accumulators/extract/extended_p_square.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global extended_p_square - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global extended_p_square

-

boost::accumulators::extract::extended_p_square

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/extended_p_square.hpp>
-
-extractor< tag::extended_p_square > const extended_p_square;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/extended_p_square_quantile.html b/doc/html/boost/accumulators/extract/extended_p_square_quantile.html deleted file mode 100644 index 83761025f7..0000000000 --- a/doc/html/boost/accumulators/extract/extended_p_square_quantile.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global extended_p_square_quantile - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global extended_p_square_quantile

-

boost::accumulators::extract::extended_p_square_quantile

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/extended_p_square_quantile.hpp>
-
-extractor< tag::extended_p_square_quantile > const extended_p_square_quantile;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/immediate_rolling_mean.html b/doc/html/boost/accumulators/extract/immediate_rolling_mean.html deleted file mode 100644 index 215c3f7742..0000000000 --- a/doc/html/boost/accumulators/extract/immediate_rolling_mean.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global immediate_rolling_mean - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global immediate_rolling_mean

-

boost::accumulators::extract::immediate_rolling_mean

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/rolling_mean.hpp>
-
-extractor< tag::immediate_rolling_mean > const immediate_rolling_mean;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/immediate_rolling_variance.html b/doc/html/boost/accumulators/extract/immediate_rolling_variance.html deleted file mode 100644 index 71ff6e26d8..0000000000 --- a/doc/html/boost/accumulators/extract/immediate_rolling_variance.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global immediate_rolling_variance - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global immediate_rolling_variance

-

boost::accumulators::extract::immediate_rolling_variance

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/rolling_variance.hpp>
-
-extractor< tag::immediate_rolling_variance > const immediate_rolling_variance;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/kurtosis.html b/doc/html/boost/accumulators/extract/kurtosis.html deleted file mode 100644 index d3c836dce6..0000000000 --- a/doc/html/boost/accumulators/extract/kurtosis.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global kurtosis - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global kurtosis

-

boost::accumulators::extract::kurtosis

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/kurtosis.hpp>
-
-extractor< tag::kurtosis > const kurtosis;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/lazy_rolling_mean.html b/doc/html/boost/accumulators/extract/lazy_rolling_mean.html deleted file mode 100644 index a900df7057..0000000000 --- a/doc/html/boost/accumulators/extract/lazy_rolling_mean.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global lazy_rolling_mean - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global lazy_rolling_mean

-

boost::accumulators::extract::lazy_rolling_mean

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/rolling_mean.hpp>
-
-extractor< tag::lazy_rolling_mean > const lazy_rolling_mean;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/lazy_rolling_variance.html b/doc/html/boost/accumulators/extract/lazy_rolling_variance.html deleted file mode 100644 index 1accc0d115..0000000000 --- a/doc/html/boost/accumulators/extract/lazy_rolling_variance.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global lazy_rolling_variance - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global lazy_rolling_variance

-

boost::accumulators::extract::lazy_rolling_variance

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/rolling_variance.hpp>
-
-extractor< tag::lazy_rolling_variance > const lazy_rolling_variance;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/lazy_variance.html b/doc/html/boost/accumulators/extract/lazy_variance.html deleted file mode 100644 index 4af1e5d98d..0000000000 --- a/doc/html/boost/accumulators/extract/lazy_variance.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global lazy_variance - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global lazy_variance

-

boost::accumulators::extract::lazy_variance

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/variance.hpp>
-
-extractor< tag::lazy_variance > const lazy_variance;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/lazy_weighted_variance.html b/doc/html/boost/accumulators/extract/lazy_weighted_variance.html deleted file mode 100644 index 6412d66e2e..0000000000 --- a/doc/html/boost/accumulators/extract/lazy_weighted_variance.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global lazy_weighted_variance - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global lazy_weighted_variance

-

boost::accumulators::extract::lazy_weighted_variance

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_variance.hpp>
-
-extractor< tag::lazy_weighted_variance > const lazy_weighted_variance;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/max.html b/doc/html/boost/accumulators/extract/max.html deleted file mode 100644 index cc1b3e1b61..0000000000 --- a/doc/html/boost/accumulators/extract/max.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global max - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global max

-

boost::accumulators::extract::max

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/max.hpp>
-
-extractor< tag::max > const max;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/mean.html b/doc/html/boost/accumulators/extract/mean.html deleted file mode 100644 index 8e41f96c40..0000000000 --- a/doc/html/boost/accumulators/extract/mean.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global mean - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global mean

-

boost::accumulators::extract::mean

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/mean.hpp>
-
-extractor< tag::mean > const mean;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/mean_of_weights.html b/doc/html/boost/accumulators/extract/mean_of_weights.html deleted file mode 100644 index 9963f1c1a1..0000000000 --- a/doc/html/boost/accumulators/extract/mean_of_weights.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global mean_of_weights - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global mean_of_weights

-

boost::accumulators::extract::mean_of_weights

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/mean.hpp>
-
-extractor< tag::mean_of_weights > const mean_of_weights;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/median.html b/doc/html/boost/accumulators/extract/median.html deleted file mode 100644 index d61fb01560..0000000000 --- a/doc/html/boost/accumulators/extract/median.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global median - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global median

-

boost::accumulators::extract::median

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/median.hpp>
-
-extractor< tag::median > const median;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/min.html b/doc/html/boost/accumulators/extract/min.html deleted file mode 100644 index 550bb8a222..0000000000 --- a/doc/html/boost/accumulators/extract/min.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global min - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global min

-

boost::accumulators::extract::min

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/min.hpp>
-
-extractor< tag::min > const min;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/non_coherent_tail_mean.html b/doc/html/boost/accumulators/extract/non_coherent_tail_mean.html deleted file mode 100644 index 253137bb4b..0000000000 --- a/doc/html/boost/accumulators/extract/non_coherent_tail_mean.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global non_coherent_tail_mean - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global non_coherent_tail_mean

-

boost::accumulators::extract::non_coherent_tail_mean

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/tail_mean.hpp>
-
-extractor< tag::abstract_non_coherent_tail_mean > const non_coherent_tail_mean;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/non_coherent_w_idp65878400.html b/doc/html/boost/accumulators/extract/non_coherent_w_idp65878400.html deleted file mode 100644 index 323c63d31f..0000000000 --- a/doc/html/boost/accumulators/extract/non_coherent_w_idp65878400.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global non_coherent_weighted_tail_mean - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global non_coherent_weighted_tail_mean

-

boost::accumulators::extract::non_coherent_weighted_tail_mean

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_tail_mean.hpp>
-
-extractor< tag::abstract_non_coherent_tail_mean > const non_coherent_weighted_tail_mean;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/p_square_cumul_idp65137072.html b/doc/html/boost/accumulators/extract/p_square_cumul_idp65137072.html deleted file mode 100644 index 1209e6d07a..0000000000 --- a/doc/html/boost/accumulators/extract/p_square_cumul_idp65137072.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global p_square_cumulative_distribution - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global p_square_cumulative_distribution

-

boost::accumulators::extract::p_square_cumulative_distribution

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/p_square_cumul_dist.hpp>
-
-extractor< tag::p_square_cumulative_distribution > const p_square_cumulative_distribution;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/p_square_quant_idp65150816.html b/doc/html/boost/accumulators/extract/p_square_quant_idp65150816.html deleted file mode 100644 index 13da0d247a..0000000000 --- a/doc/html/boost/accumulators/extract/p_square_quant_idp65150816.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global p_square_quantile_for_median - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global p_square_quantile_for_median

-

boost::accumulators::extract::p_square_quantile_for_median

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/p_square_quantile.hpp>
-
-extractor< tag::p_square_quantile_for_median > const p_square_quantile_for_median;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/p_square_quantile.html b/doc/html/boost/accumulators/extract/p_square_quantile.html deleted file mode 100644 index ce71130adb..0000000000 --- a/doc/html/boost/accumulators/extract/p_square_quantile.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global p_square_quantile - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global p_square_quantile

-

boost::accumulators::extract::p_square_quantile

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/p_square_quantile.hpp>
-
-extractor< tag::p_square_quantile > const p_square_quantile;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/peaks_over_threshold.html b/doc/html/boost/accumulators/extract/peaks_over_threshold.html deleted file mode 100644 index d1e27966ef..0000000000 --- a/doc/html/boost/accumulators/extract/peaks_over_threshold.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global peaks_over_threshold - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global peaks_over_threshold

-

boost::accumulators::extract::peaks_over_threshold

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/peaks_over_threshold.hpp>
-
-extractor< tag::abstract_peaks_over_threshold > const peaks_over_threshold;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/quantile.html b/doc/html/boost/accumulators/extract/quantile.html deleted file mode 100644 index 2d31e89052..0000000000 --- a/doc/html/boost/accumulators/extract/quantile.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global quantile - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global quantile

-

boost::accumulators::extract::quantile

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-extractor< tag::quantile > const quantile;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/relative_tail__idp65697392.html b/doc/html/boost/accumulators/extract/relative_tail__idp65697392.html deleted file mode 100644 index a63a361d3a..0000000000 --- a/doc/html/boost/accumulators/extract/relative_tail__idp65697392.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global relative_tail_variate_means - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global relative_tail_variate_means

-

boost::accumulators::extract::relative_tail_variate_means

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/tail_variate_means.hpp>
-
-extractor< tag::abstract_relative_tail_variate_means > const relative_tail_variate_means;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/relative_weigh_idp65901120.html b/doc/html/boost/accumulators/extract/relative_weigh_idp65901120.html deleted file mode 100644 index c2def6a471..0000000000 --- a/doc/html/boost/accumulators/extract/relative_weigh_idp65901120.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global relative_weighted_tail_variate_means - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global relative_weighted_tail_variate_means

-

boost::accumulators::extract::relative_weighted_tail_variate_means

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_tail_variate_means.hpp>
-
-extractor< tag::abstract_relative_tail_variate_means > const relative_weighted_tail_variate_means;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/rolling_count.html b/doc/html/boost/accumulators/extract/rolling_count.html deleted file mode 100644 index caeb85873f..0000000000 --- a/doc/html/boost/accumulators/extract/rolling_count.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global rolling_count - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global rolling_count

-

boost::accumulators::extract::rolling_count

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/rolling_count.hpp>
-
-extractor< tag::rolling_count > const rolling_count;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/rolling_mean.html b/doc/html/boost/accumulators/extract/rolling_mean.html deleted file mode 100644 index f5166760d4..0000000000 --- a/doc/html/boost/accumulators/extract/rolling_mean.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global rolling_mean - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global rolling_mean

-

boost::accumulators::extract::rolling_mean

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/rolling_mean.hpp>
-
-extractor< tag::rolling_mean > const rolling_mean;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/rolling_sum.html b/doc/html/boost/accumulators/extract/rolling_sum.html deleted file mode 100644 index e9a06ec091..0000000000 --- a/doc/html/boost/accumulators/extract/rolling_sum.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global rolling_sum - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global rolling_sum

-

boost::accumulators::extract::rolling_sum

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/rolling_sum.hpp>
-
-extractor< tag::rolling_sum > const rolling_sum;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/rolling_variance.html b/doc/html/boost/accumulators/extract/rolling_variance.html deleted file mode 100644 index e6e471afa2..0000000000 --- a/doc/html/boost/accumulators/extract/rolling_variance.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global rolling_variance - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global rolling_variance

-

boost::accumulators::extract::rolling_variance

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/rolling_variance.hpp>
-
-extractor< tag::rolling_variance > const rolling_variance;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/rolling_window.html b/doc/html/boost/accumulators/extract/rolling_window.html deleted file mode 100644 index 09d34d001b..0000000000 --- a/doc/html/boost/accumulators/extract/rolling_window.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global rolling_window - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global rolling_window

-

boost::accumulators::extract::rolling_window

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/rolling_window.hpp>
-
-extractor< tag::rolling_window > const rolling_window;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/rolling_window_plus1.html b/doc/html/boost/accumulators/extract/rolling_window_plus1.html deleted file mode 100644 index 177d2e8300..0000000000 --- a/doc/html/boost/accumulators/extract/rolling_window_plus1.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global rolling_window_plus1 - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global rolling_window_plus1

-

boost::accumulators::extract::rolling_window_plus1

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/rolling_window.hpp>
-
-extractor< tag::rolling_window_plus1 > const rolling_window_plus1;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/skewness.html b/doc/html/boost/accumulators/extract/skewness.html deleted file mode 100644 index 415f91411e..0000000000 --- a/doc/html/boost/accumulators/extract/skewness.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global skewness - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global skewness

-

boost::accumulators::extract::skewness

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/skewness.hpp>
-
-extractor< tag::skewness > const skewness;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/sum.html b/doc/html/boost/accumulators/extract/sum.html deleted file mode 100644 index 9f6d8b6ed1..0000000000 --- a/doc/html/boost/accumulators/extract/sum.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global sum - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global sum

-

boost::accumulators::extract::sum

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/sum.hpp>
-
-extractor< tag::sum > const sum;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/sum_kahan.html b/doc/html/boost/accumulators/extract/sum_kahan.html deleted file mode 100644 index 4952a89ed9..0000000000 --- a/doc/html/boost/accumulators/extract/sum_kahan.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global sum_kahan - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global sum_kahan

-

boost::accumulators::extract::sum_kahan

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/sum_kahan.hpp>
-
-extractor< tag::sum_kahan > const sum_kahan;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/sum_of_variates.html b/doc/html/boost/accumulators/extract/sum_of_variates.html deleted file mode 100644 index b2151c3ad0..0000000000 --- a/doc/html/boost/accumulators/extract/sum_of_variates.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global sum_of_variates - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global sum_of_variates

-

boost::accumulators::extract::sum_of_variates

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/sum.hpp>
-
-extractor< tag::abstract_sum_of_variates > const sum_of_variates;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/sum_of_variates_kahan.html b/doc/html/boost/accumulators/extract/sum_of_variates_kahan.html deleted file mode 100644 index 52cb25c0a5..0000000000 --- a/doc/html/boost/accumulators/extract/sum_of_variates_kahan.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global sum_of_variates_kahan - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global sum_of_variates_kahan

-

boost::accumulators::extract::sum_of_variates_kahan

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/sum_kahan.hpp>
-
-extractor< tag::abstract_sum_of_variates > const sum_of_variates_kahan;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/sum_of_weights.html b/doc/html/boost/accumulators/extract/sum_of_weights.html deleted file mode 100644 index 0ff41bfbd4..0000000000 --- a/doc/html/boost/accumulators/extract/sum_of_weights.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global sum_of_weights - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global sum_of_weights

-

boost::accumulators::extract::sum_of_weights

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/sum.hpp>
-
-extractor< tag::sum_of_weights > const sum_of_weights;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/sum_of_weights_kahan.html b/doc/html/boost/accumulators/extract/sum_of_weights_kahan.html deleted file mode 100644 index cdeb18a12d..0000000000 --- a/doc/html/boost/accumulators/extract/sum_of_weights_kahan.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global sum_of_weights_kahan - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global sum_of_weights_kahan

-

boost::accumulators::extract::sum_of_weights_kahan

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/sum_kahan.hpp>
-
-extractor< tag::sum_of_weights_kahan > const sum_of_weights_kahan;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/tail.html b/doc/html/boost/accumulators/extract/tail.html deleted file mode 100644 index 4ffce017b2..0000000000 --- a/doc/html/boost/accumulators/extract/tail.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global tail - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global tail

-

boost::accumulators::extract::tail

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/tail.hpp>
-
-extractor< tag::abstract_tail > const tail;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/tail_mean.html b/doc/html/boost/accumulators/extract/tail_mean.html deleted file mode 100644 index 995cb5863a..0000000000 --- a/doc/html/boost/accumulators/extract/tail_mean.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global tail_mean - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global tail_mean

-

boost::accumulators::extract::tail_mean

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-extractor< tag::tail_mean > const tail_mean;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/tail_quantile.html b/doc/html/boost/accumulators/extract/tail_quantile.html deleted file mode 100644 index af443f1d95..0000000000 --- a/doc/html/boost/accumulators/extract/tail_quantile.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global tail_quantile - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global tail_quantile

-

boost::accumulators::extract::tail_quantile

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/tail_quantile.hpp>
-
-extractor< tag::quantile > const tail_quantile;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/tail_variate.html b/doc/html/boost/accumulators/extract/tail_variate.html deleted file mode 100644 index a9148fb723..0000000000 --- a/doc/html/boost/accumulators/extract/tail_variate.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global tail_variate - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global tail_variate

-

boost::accumulators::extract::tail_variate

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/tail_variate.hpp>
-
-extractor< tag::abstract_tail_variate > const tail_variate;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/tail_variate_means.html b/doc/html/boost/accumulators/extract/tail_variate_means.html deleted file mode 100644 index 32e004007c..0000000000 --- a/doc/html/boost/accumulators/extract/tail_variate_means.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global tail_variate_means - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global tail_variate_means

-

boost::accumulators::extract::tail_variate_means

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/tail_variate_means.hpp>
-
-extractor< tag::abstract_absolute_tail_variate_means > const tail_variate_means;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/tail_weights.html b/doc/html/boost/accumulators/extract/tail_weights.html deleted file mode 100644 index e8bd3b709c..0000000000 --- a/doc/html/boost/accumulators/extract/tail_weights.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global tail_weights - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global tail_weights

-

boost::accumulators::extract::tail_weights

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/tail_variate.hpp>
-
-extractor< tag::abstract_tail_weights > const tail_weights;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/variance.html b/doc/html/boost/accumulators/extract/variance.html deleted file mode 100644 index 20277d47d1..0000000000 --- a/doc/html/boost/accumulators/extract/variance.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global variance - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global variance

-

boost::accumulators::extract::variance

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/variance.hpp>
-
-extractor< tag::variance > const variance;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/weighted_covariance.html b/doc/html/boost/accumulators/extract/weighted_covariance.html deleted file mode 100644 index 7f7e3306ac..0000000000 --- a/doc/html/boost/accumulators/extract/weighted_covariance.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global weighted_covariance - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global weighted_covariance

-

boost::accumulators::extract::weighted_covariance

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_covariance.hpp>
-
-extractor< tag::abstract_covariance > const weighted_covariance;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/weighted_density.html b/doc/html/boost/accumulators/extract/weighted_density.html deleted file mode 100644 index 3c56065180..0000000000 --- a/doc/html/boost/accumulators/extract/weighted_density.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global weighted_density - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global weighted_density

-

boost::accumulators::extract::weighted_density

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_density.hpp>
-
-extractor< tag::density > const weighted_density;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/weighted_exten_idp64987520.html b/doc/html/boost/accumulators/extract/weighted_exten_idp64987520.html deleted file mode 100644 index c693cb538b..0000000000 --- a/doc/html/boost/accumulators/extract/weighted_exten_idp64987520.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global weighted_extended_p_square_quantile - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global weighted_extended_p_square_quantile

-

boost::accumulators::extract::weighted_extended_p_square_quantile

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/extended_p_square_quantile.hpp>
-
-extractor< tag::weighted_extended_p_square_quantile > const weighted_extended_p_square_quantile;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/weighted_exten_idp64989152.html b/doc/html/boost/accumulators/extract/weighted_exten_idp64989152.html deleted file mode 100644 index d2c8e358b8..0000000000 --- a/doc/html/boost/accumulators/extract/weighted_exten_idp64989152.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global weighted_extended_p_square_quantile_quadratic - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global weighted_extended_p_square_quantile_quadratic

-

boost::accumulators::extract::weighted_extended_p_square_quantile_quadratic

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/extended_p_square_quantile.hpp>
-
-extractor< tag::weighted_extended_p_square_quantile_quadratic > const weighted_extended_p_square_quantile_quadratic;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/weighted_extended_p_square.html b/doc/html/boost/accumulators/extract/weighted_extended_p_square.html deleted file mode 100644 index 70f6df294d..0000000000 --- a/doc/html/boost/accumulators/extract/weighted_extended_p_square.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global weighted_extended_p_square - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global weighted_extended_p_square

-

boost::accumulators::extract::weighted_extended_p_square

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_extended_p_square.hpp>
-
-extractor< tag::weighted_extended_p_square > const weighted_extended_p_square;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/weighted_kurtosis.html b/doc/html/boost/accumulators/extract/weighted_kurtosis.html deleted file mode 100644 index 434e780c20..0000000000 --- a/doc/html/boost/accumulators/extract/weighted_kurtosis.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global weighted_kurtosis - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global weighted_kurtosis

-

boost::accumulators::extract::weighted_kurtosis

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_kurtosis.hpp>
-
-extractor< tag::weighted_kurtosis > const weighted_kurtosis;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/weighted_mean.html b/doc/html/boost/accumulators/extract/weighted_mean.html deleted file mode 100644 index 0bc349040c..0000000000 --- a/doc/html/boost/accumulators/extract/weighted_mean.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global weighted_mean - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global weighted_mean

-

boost::accumulators::extract::weighted_mean

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_mean.hpp>
-
-extractor< tag::mean > const weighted_mean;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/weighted_median.html b/doc/html/boost/accumulators/extract/weighted_median.html deleted file mode 100644 index a6b7fda72e..0000000000 --- a/doc/html/boost/accumulators/extract/weighted_median.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global weighted_median - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global weighted_median

-

boost::accumulators::extract::weighted_median

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_median.hpp>
-
-extractor< tag::median > const weighted_median;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/weighted_p_squ_idp65808320.html b/doc/html/boost/accumulators/extract/weighted_p_squ_idp65808320.html deleted file mode 100644 index af07d50c9e..0000000000 --- a/doc/html/boost/accumulators/extract/weighted_p_squ_idp65808320.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global weighted_p_square_cumulative_distribution - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global weighted_p_square_cumulative_distribution

-

boost::accumulators::extract::weighted_p_square_cumulative_distribution

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_p_square_cumul_dist.hpp>
-
-extractor< tag::weighted_p_square_cumulative_distribution > const weighted_p_square_cumulative_distribution;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/weighted_p_squ_idp65819552.html b/doc/html/boost/accumulators/extract/weighted_p_squ_idp65819552.html deleted file mode 100644 index d81e392b90..0000000000 --- a/doc/html/boost/accumulators/extract/weighted_p_squ_idp65819552.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global weighted_p_square_quantile_for_median - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global weighted_p_square_quantile_for_median

-

boost::accumulators::extract::weighted_p_square_quantile_for_median

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_p_square_quantile.hpp>
-
-extractor< tag::weighted_p_square_quantile_for_median > const weighted_p_square_quantile_for_median;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/weighted_p_square_quantile.html b/doc/html/boost/accumulators/extract/weighted_p_square_quantile.html deleted file mode 100644 index b0c163a0a2..0000000000 --- a/doc/html/boost/accumulators/extract/weighted_p_square_quantile.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global weighted_p_square_quantile - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global weighted_p_square_quantile

-

boost::accumulators::extract::weighted_p_square_quantile

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_p_square_quantile.hpp>
-
-extractor< tag::weighted_p_square_quantile > const weighted_p_square_quantile;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/weighted_peaks_idp65836576.html b/doc/html/boost/accumulators/extract/weighted_peaks_idp65836576.html deleted file mode 100644 index 6a358cf6b4..0000000000 --- a/doc/html/boost/accumulators/extract/weighted_peaks_idp65836576.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global weighted_peaks_over_threshold - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global weighted_peaks_over_threshold

-

boost::accumulators::extract::weighted_peaks_over_threshold

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_peaks_over_threshold.hpp>
-
-extractor< tag::abstract_peaks_over_threshold > const weighted_peaks_over_threshold;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/weighted_skewness.html b/doc/html/boost/accumulators/extract/weighted_skewness.html deleted file mode 100644 index 7d65fb7cc2..0000000000 --- a/doc/html/boost/accumulators/extract/weighted_skewness.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global weighted_skewness - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global weighted_skewness

-

boost::accumulators::extract::weighted_skewness

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_skewness.hpp>
-
-extractor< tag::weighted_skewness > const weighted_skewness;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/weighted_sum.html b/doc/html/boost/accumulators/extract/weighted_sum.html deleted file mode 100644 index 4dff2eaed5..0000000000 --- a/doc/html/boost/accumulators/extract/weighted_sum.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global weighted_sum - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global weighted_sum

-

boost::accumulators::extract::weighted_sum

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_sum.hpp>
-
-extractor< tag::weighted_sum > const weighted_sum;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/weighted_sum_kahan.html b/doc/html/boost/accumulators/extract/weighted_sum_kahan.html deleted file mode 100644 index 3ba6725dbd..0000000000 --- a/doc/html/boost/accumulators/extract/weighted_sum_kahan.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global weighted_sum_kahan - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global weighted_sum_kahan

-

boost::accumulators::extract::weighted_sum_kahan

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_sum_kahan.hpp>
-
-extractor< tag::weighted_sum_kahan > const weighted_sum_kahan;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/weighted_sum_o_idp65869056.html b/doc/html/boost/accumulators/extract/weighted_sum_o_idp65869056.html deleted file mode 100644 index def5e68caf..0000000000 --- a/doc/html/boost/accumulators/extract/weighted_sum_o_idp65869056.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global weighted_sum_of_variates_kahan - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global weighted_sum_of_variates_kahan

-

boost::accumulators::extract::weighted_sum_of_variates_kahan

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_sum_kahan.hpp>
-
-extractor< tag::abstract_weighted_sum_of_variates > const weighted_sum_of_variates_kahan;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/weighted_sum_of_variates.html b/doc/html/boost/accumulators/extract/weighted_sum_of_variates.html deleted file mode 100644 index b74a0ad6c0..0000000000 --- a/doc/html/boost/accumulators/extract/weighted_sum_of_variates.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global weighted_sum_of_variates - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global weighted_sum_of_variates

-

boost::accumulators::extract::weighted_sum_of_variates

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_sum.hpp>
-
-extractor< tag::abstract_weighted_sum_of_variates > const weighted_sum_of_variates;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/weighted_tail__idp65899488.html b/doc/html/boost/accumulators/extract/weighted_tail__idp65899488.html deleted file mode 100644 index 6bd6ac55f7..0000000000 --- a/doc/html/boost/accumulators/extract/weighted_tail__idp65899488.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global weighted_tail_variate_means - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global weighted_tail_variate_means

-

boost::accumulators::extract::weighted_tail_variate_means

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_tail_variate_means.hpp>
-
-extractor< tag::abstract_absolute_tail_variate_means > const weighted_tail_variate_means;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/weighted_tail_quantile.html b/doc/html/boost/accumulators/extract/weighted_tail_quantile.html deleted file mode 100644 index 97bb1d7f18..0000000000 --- a/doc/html/boost/accumulators/extract/weighted_tail_quantile.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global weighted_tail_quantile - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global weighted_tail_quantile

-

boost::accumulators::extract::weighted_tail_quantile

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_tail_quantile.hpp>
-
-extractor< tag::quantile > const weighted_tail_quantile;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/weighted_variance.html b/doc/html/boost/accumulators/extract/weighted_variance.html deleted file mode 100644 index 882c2de4e6..0000000000 --- a/doc/html/boost/accumulators/extract/weighted_variance.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global weighted_variance - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global weighted_variance

-

boost::accumulators::extract::weighted_variance

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_variance.hpp>
-
-extractor< tag::weighted_variance > const weighted_variance;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/with_density_median.html b/doc/html/boost/accumulators/extract/with_density_median.html deleted file mode 100644 index f864ca3d70..0000000000 --- a/doc/html/boost/accumulators/extract/with_density_median.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global with_density_median - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global with_density_median

-

boost::accumulators::extract::with_density_median

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/median.hpp>
-
-extractor< tag::with_density_median > const with_density_median;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extract/with_p_square__idp65106528.html b/doc/html/boost/accumulators/extract/with_p_square__idp65106528.html deleted file mode 100644 index 6daa81159a..0000000000 --- a/doc/html/boost/accumulators/extract/with_p_square__idp65106528.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global with_p_square_cumulative_distribution_median - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Global with_p_square_cumulative_distribution_median

-

boost::accumulators::extract::with_p_square_cumulative_distribution_median

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/median.hpp>
-
-extractor< tag::with_p_square_cumulative_distribution_median > const with_p_square_cumulative_distribution_median;
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/extractor.html b/doc/html/boost/accumulators/extractor.html index c316f1feef..bd3e2b55dc 100644 --- a/doc/html/boost/accumulators/extractor.html +++ b/doc/html/boost/accumulators/extractor.html @@ -35,28 +35,28 @@ template<typename Feature> struct extractor { - // public member functions - template<typename Arg1> unspecified operator()(Arg1 const &) const; + // public member functions + template<typename Arg1> unspecified operator()(Arg1 const &) const; template<typename AccumulatorSet, typename A1> - unspecified operator()(AccumulatorSet const &, A1 const &) const; + unspecified operator()(AccumulatorSet const &, A1 const &) const; template<typename AccumulatorSet, typename A1, typename A2, ... > - unspecified operator()(AccumulatorSet const &, A1 const &, A2 const &, + unspecified operator()(AccumulatorSet const &, A1 const &, A2 const &, ...); };
-

Description

+

Description

-

-extractor public member functions

+

+extractor public member functions

  1. -
    template<typename Arg1> unspecified operator()(Arg1 const & arg1) const;
    +
    template<typename Arg1> unspecified operator()(Arg1 const & arg1) const;

    Extract the result associated with Feature from the accumulator set 

  2. template<typename AccumulatorSet, typename A1> 
-  unspecified operator()(AccumulatorSet const & acc, A1 const & a1) const;
    + unspecified operator()(AccumulatorSet const & acc, A1 const & a1) const;

    This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

    @@ -82,7 +82,7 @@ 
  3. template<typename AccumulatorSet, typename A1, typename A2, ... > 
-  unspecified operator()(AccumulatorSet const & acc, A1 const & a1, 
+  unspecified operator()(AccumulatorSet const & acc, A1 const & a1, 
                          A2 const & a2, ...);

    This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

    4. diff --git a/doc/html/boost/accumulators/feature__idm45507139452704.html b/doc/html/boost/accumulators/feature__idm45507139452704.html new file mode 100644 index 0000000000..68b2d88121 --- /dev/null +++ b/doc/html/boost/accumulators/feature__idm45507139452704.html @@ -0,0 +1,54 @@ + + + + +Struct template feature_of<tag::value< ValueType, Tag >> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct template feature_of<tag::value< ValueType, Tag >>

    +

    boost::accumulators::feature_of<tag::value< ValueType, Tag >>

    +
    +

    Synopsis

    +
    // In header: <boost/accumulators/framework/accumulators/value_accumulator.hpp>
+
+template<typename ValueType, typename Tag> 
+struct feature_of<tag::value< ValueType, Tag >> :
+  public boost::accumulators::feature_of< tag::value_tag< Tag > >
+{
+};
    +
    + + + +
    Copyright © 2005, 2006 Eric Niebler

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/accumulators/feature__idm45507139467936.html b/doc/html/boost/accumulators/feature__idm45507139467936.html new file mode 100644 index 0000000000..7cf4d8e733 --- /dev/null +++ b/doc/html/boost/accumulators/feature__idm45507139467936.html @@ -0,0 +1,54 @@ + + + + +Struct template feature_of<tag::reference< ValueType, Tag >> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct template feature_of<tag::reference< ValueType, Tag >>

    +

    boost::accumulators::feature_of<tag::reference< ValueType, Tag >>

    +
    +

    Synopsis

    +
    // In header: <boost/accumulators/framework/accumulators/reference_accumulator.hpp>
+
+template<typename ValueType, typename Tag> 
+struct feature_of<tag::reference< ValueType, Tag >> :
+  public boost::accumulators::feature_of< tag::reference_tag< Tag > >
+{
+};
    +
    + + + +
    Copyright © 2005, 2006 Eric Niebler

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/accumulators/feature__idm45507139479888.html b/doc/html/boost/accumulators/feature__idm45507139479888.html new file mode 100644 index 0000000000..7d76f9fe19 --- /dev/null +++ b/doc/html/boost/accumulators/feature__idm45507139479888.html @@ -0,0 +1,52 @@ + + + + +Struct template feature_of<tag::external< Feature, Tag, AccumulatorSet >> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct template feature_of<tag::external< Feature, Tag, AccumulatorSet >>

    +

    boost::accumulators::feature_of<tag::external< Feature, Tag, AccumulatorSet >>

    +
    +

    Synopsis

    +
    // In header: <boost/accumulators/framework/accumulators/external_accumulator.hpp>
+
+template<typename Feature, typename Tag, typename AccumulatorSet> 
+struct feature_of<tag::external< Feature, Tag, AccumulatorSet >> : public boost::accumulators::feature_of< Feature > {
+};
    +
    + + + +
    Copyright © 2005, 2006 Eric Niebler

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/accumulators/feature__idm45507139490272.html b/doc/html/boost/accumulators/feature__idm45507139490272.html new file mode 100644 index 0000000000..3f7ff226bd --- /dev/null +++ b/doc/html/boost/accumulators/feature__idm45507139490272.html @@ -0,0 +1,52 @@ + + + + +Struct template feature_of<tag::droppable< Feature >> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct template feature_of<tag::droppable< Feature >>

    +

    boost::accumulators::feature_of<tag::droppable< Feature >>

    +
    +

    Synopsis

    +
    // In header: <boost/accumulators/framework/accumulators/droppable_accumulator.hpp>
+
+template<typename Feature> 
+struct feature_of<tag::droppable< Feature >> : public boost::accumulators::feature_of< Feature > {
+};
    +
    + + + +
    Copyright © 2005, 2006 Eric Niebler

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/accumulators/feature_of_tag_idp64785664.html b/doc/html/boost/accumulators/feature_of_tag_idp64785664.html deleted file mode 100644 index 52215e5942..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp64785664.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct template feature_of<tag::droppable< Feature >> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template feature_of<tag::droppable< Feature >>

    -

    boost::accumulators::feature_of<tag::droppable< Feature >>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/framework/accumulators/droppable_accumulator.hpp>
-
-template<typename Feature> 
-struct feature_of<tag::droppable< Feature >> : public boost::accumulators::feature_of< Feature > {
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp64796048.html b/doc/html/boost/accumulators/feature_of_tag_idp64796048.html deleted file mode 100644 index d6df35cbca..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp64796048.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct template feature_of<tag::external< Feature, Tag, AccumulatorSet >> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template feature_of<tag::external< Feature, Tag, AccumulatorSet >>

    -

    boost::accumulators::feature_of<tag::external< Feature, Tag, AccumulatorSet >>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/framework/accumulators/external_accumulator.hpp>
-
-template<typename Feature, typename Tag, typename AccumulatorSet> 
-struct feature_of<tag::external< Feature, Tag, AccumulatorSet >> : public boost::accumulators::feature_of< Feature > {
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp64808000.html b/doc/html/boost/accumulators/feature_of_tag_idp64808000.html deleted file mode 100644 index e43b988fe9..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp64808000.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template feature_of<tag::reference< ValueType, Tag >> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template feature_of<tag::reference< ValueType, Tag >>

    -

    boost::accumulators::feature_of<tag::reference< ValueType, Tag >>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/framework/accumulators/reference_accumulator.hpp>
-
-template<typename ValueType, typename Tag> 
-struct feature_of<tag::reference< ValueType, Tag >> :
-  public boost::accumulators::feature_of< tag::reference_tag< Tag > >
-{
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp64823232.html b/doc/html/boost/accumulators/feature_of_tag_idp64823232.html deleted file mode 100644 index 072e65d448..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp64823232.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template feature_of<tag::value< ValueType, Tag >> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template feature_of<tag::value< ValueType, Tag >>

    -

    boost::accumulators::feature_of<tag::value< ValueType, Tag >>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/framework/accumulators/value_accumulator.hpp>
-
-template<typename ValueType, typename Tag> 
-struct feature_of<tag::value< ValueType, Tag >> :
-  public boost::accumulators::feature_of< tag::value_tag< Tag > >
-{
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp64886384.html b/doc/html/boost/accumulators/feature_of_tag_idp64886384.html deleted file mode 100644 index 5769589bc0..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp64886384.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template feature_of<tag::covariance< VariateType, VariateTag >> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template feature_of<tag::covariance< VariateType, VariateTag >>

    -

    boost::accumulators::feature_of<tag::covariance< VariateType, VariateTag >>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/covariance.hpp>
-
-template<typename VariateType, typename VariateTag> 
-struct feature_of<tag::covariance< VariateType, VariateTag >> :
-  public boost::accumulators::feature_of< tag::abstract_covariance >
-{
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp64889520.html b/doc/html/boost/accumulators/feature_of_tag_idp64889520.html deleted file mode 100644 index 5d52452a71..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp64889520.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template feature_of<tag::weighted_covariance< VariateType, VariateTag >> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template feature_of<tag::weighted_covariance< VariateType, VariateTag >>

    -

    boost::accumulators::feature_of<tag::weighted_covariance< VariateType, VariateTag >>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/covariance.hpp>
-
-template<typename VariateType, typename VariateTag> 
-struct feature_of<tag::weighted_covariance< VariateType, VariateTag >> : public boost::accumulators::feature_of< tag::covariance< VariateType, VariateTag > >
-{
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp64919536.html b/doc/html/boost/accumulators/feature_of_tag_idp64919536.html deleted file mode 100644 index d284ebb520..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp64919536.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct feature_of<tag::weighted_density> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct feature_of<tag::weighted_density>

    -

    boost::accumulators::feature_of<tag::weighted_density>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/density.hpp>
-
-
-struct feature_of<tag::weighted_density> : public boost::accumulators::feature_of< tag::density > {
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp64952064.html b/doc/html/boost/accumulators/feature_of_tag_idp64952064.html deleted file mode 100644 index 2fcac88b66..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp64952064.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct feature_of<tag::weighted_extended_p_square> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct feature_of<tag::weighted_extended_p_square>

    -

    boost::accumulators::feature_of<tag::weighted_extended_p_square>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/extended_p_square.hpp>
-
-
-struct feature_of<tag::weighted_extended_p_square> :
-  public boost::accumulators::feature_of< tag::extended_p_square >
-{
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp64976768.html b/doc/html/boost/accumulators/feature_of_tag_idp64976768.html deleted file mode 100644 index 91b86101a8..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp64976768.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct feature_of<tag::extended_p_square_quantile> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct feature_of<tag::extended_p_square_quantile>

    -

    boost::accumulators::feature_of<tag::extended_p_square_quantile>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/extended_p_square_quantile.hpp>
-
-
-struct feature_of<tag::extended_p_square_quantile> : public boost::accumulators::feature_of< tag::quantile > {
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp64978480.html b/doc/html/boost/accumulators/feature_of_tag_idp64978480.html deleted file mode 100644 index 267f85878a..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp64978480.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct feature_of<tag::extended_p_square_quantile_quadratic> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct feature_of<tag::extended_p_square_quantile_quadratic>

    -

    boost::accumulators::feature_of<tag::extended_p_square_quantile_quadratic>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/extended_p_square_quantile.hpp>
-
-
-struct feature_of<tag::extended_p_square_quantile_quadratic> : public boost::accumulators::feature_of< tag::quantile > {
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp64980208.html b/doc/html/boost/accumulators/feature_of_tag_idp64980208.html deleted file mode 100644 index c3b30c73b7..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp64980208.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct feature_of<tag::weighted_extended_p_square_quantile> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct feature_of<tag::weighted_extended_p_square_quantile>

    -

    boost::accumulators::feature_of<tag::weighted_extended_p_square_quantile>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/extended_p_square_quantile.hpp>
-
-
-struct feature_of<tag::weighted_extended_p_square_quantile> :
-  public boost::accumulators::feature_of< tag::extended_p_square_quantile >
-{
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp64981952.html b/doc/html/boost/accumulators/feature_of_tag_idp64981952.html deleted file mode 100644 index 18d23b8cde..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp64981952.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct feature_of<tag::weighted_extended_p_square_quantile_quadratic> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct feature_of<tag::weighted_extended_p_square_quantile_quadratic>

    -

    boost::accumulators::feature_of<tag::weighted_extended_p_square_quantile_quadratic>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/extended_p_square_quantile.hpp>
-
-
-struct feature_of<tag::weighted_extended_p_square_quantile_quadratic> : public boost::accumulators::feature_of< tag::extended_p_square_quantile_quadratic >
-{
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65009008.html b/doc/html/boost/accumulators/feature_of_tag_idp65009008.html deleted file mode 100644 index fd15c54bff..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65009008.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct feature_of<tag::weighted_kurtosis> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct feature_of<tag::weighted_kurtosis>

    -

    boost::accumulators::feature_of<tag::weighted_kurtosis>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/kurtosis.hpp>
-
-
-struct feature_of<tag::weighted_kurtosis> : public boost::accumulators::feature_of< tag::kurtosis > {
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65051888.html b/doc/html/boost/accumulators/feature_of_tag_idp65051888.html deleted file mode 100644 index 7e5ae9910d..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65051888.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct feature_of<tag::immediate_mean> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct feature_of<tag::immediate_mean>

    -

    boost::accumulators::feature_of<tag::immediate_mean>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/mean.hpp>
-
-
-struct feature_of<tag::immediate_mean> : public boost::accumulators::feature_of< tag::mean > {
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65053584.html b/doc/html/boost/accumulators/feature_of_tag_idp65053584.html deleted file mode 100644 index 653cbb5937..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65053584.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template feature_of<tag::immediate_mean_of_variates< VariateType, VariateTag >> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template feature_of<tag::immediate_mean_of_variates< VariateType, VariateTag >>

    -

    boost::accumulators::feature_of<tag::immediate_mean_of_variates< VariateType, VariateTag >>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/mean.hpp>
-
-template<typename VariateType, typename VariateTag> 
-struct feature_of<tag::immediate_mean_of_variates< VariateType, VariateTag >> : public boost::accumulators::feature_of< tag::mean_of_variates< VariateType, VariateTag > >
-{
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65056752.html b/doc/html/boost/accumulators/feature_of_tag_idp65056752.html deleted file mode 100644 index 63eb6034f0..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65056752.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct feature_of<tag::immediate_mean_of_weights> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct feature_of<tag::immediate_mean_of_weights>

    -

    boost::accumulators::feature_of<tag::immediate_mean_of_weights>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/mean.hpp>
-
-
-struct feature_of<tag::immediate_mean_of_weights> :
-  public boost::accumulators::feature_of< tag::mean_of_weights >
-{
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65058464.html b/doc/html/boost/accumulators/feature_of_tag_idp65058464.html deleted file mode 100644 index 3e4477e159..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65058464.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct feature_of<tag::immediate_weighted_mean> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct feature_of<tag::immediate_weighted_mean>

    -

    boost::accumulators::feature_of<tag::immediate_weighted_mean>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/mean.hpp>
-
-
-struct feature_of<tag::immediate_weighted_mean> :
-  public boost::accumulators::feature_of< tag::immediate_mean >
-{
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65060176.html b/doc/html/boost/accumulators/feature_of_tag_idp65060176.html deleted file mode 100644 index e4f226eaf3..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65060176.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template feature_of<tag::immediate_weighted_mean_of_variates< VariateType, VariateTag >> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template feature_of<tag::immediate_weighted_mean_of_variates< VariateType, VariateTag >>

    -

    boost::accumulators::feature_of<tag::immediate_weighted_mean_of_variates< VariateType, VariateTag >>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/mean.hpp>
-
-template<typename VariateType, typename VariateTag> 
-struct feature_of<tag::immediate_weighted_mean_of_variates< VariateType, VariateTag >> : public boost::accumulators::feature_of< tag::immediate_mean_of_variates< VariateType, VariateTag > >
-{
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65063360.html b/doc/html/boost/accumulators/feature_of_tag_idp65063360.html deleted file mode 100644 index 230299076f..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65063360.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct feature_of<tag::weighted_mean> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct feature_of<tag::weighted_mean>

    -

    boost::accumulators::feature_of<tag::weighted_mean>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/mean.hpp>
-
-
-struct feature_of<tag::weighted_mean> : public boost::accumulators::feature_of< tag::mean > {
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65065056.html b/doc/html/boost/accumulators/feature_of_tag_idp65065056.html deleted file mode 100644 index c3cfa80664..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65065056.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template feature_of<tag::weighted_mean_of_variates< VariateType, VariateTag >> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template feature_of<tag::weighted_mean_of_variates< VariateType, VariateTag >>

    -

    boost::accumulators::feature_of<tag::weighted_mean_of_variates< VariateType, VariateTag >>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/mean.hpp>
-
-template<typename VariateType, typename VariateTag> 
-struct feature_of<tag::weighted_mean_of_variates< VariateType, VariateTag >> : public boost::accumulators::feature_of< tag::mean_of_variates< VariateType, VariateTag > >
-{
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65094144.html b/doc/html/boost/accumulators/feature_of_tag_idp65094144.html deleted file mode 100644 index 057a597cc2..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65094144.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct feature_of<tag::weighted_median> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct feature_of<tag::weighted_median>

    -

    boost::accumulators::feature_of<tag::weighted_median>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/median.hpp>
-
-
-struct feature_of<tag::weighted_median> : public boost::accumulators::feature_of< tag::median > {
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65095840.html b/doc/html/boost/accumulators/feature_of_tag_idp65095840.html deleted file mode 100644 index 1dd65b9db8..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65095840.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct feature_of<tag::with_density_median> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct feature_of<tag::with_density_median>

    -

    boost::accumulators::feature_of<tag::with_density_median>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/median.hpp>
-
-
-struct feature_of<tag::with_density_median> : public boost::accumulators::feature_of< tag::median > {
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65097552.html b/doc/html/boost/accumulators/feature_of_tag_idp65097552.html deleted file mode 100644 index 12afd32df9..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65097552.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct feature_of<tag::with_density_weighted_median> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct feature_of<tag::with_density_weighted_median>

    -

    boost::accumulators::feature_of<tag::with_density_weighted_median>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/median.hpp>
-
-
-struct feature_of<tag::with_density_weighted_median> :
-  public boost::accumulators::feature_of< tag::with_density_median >
-{
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65099280.html b/doc/html/boost/accumulators/feature_of_tag_idp65099280.html deleted file mode 100644 index 13c8e8e4c0..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65099280.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct feature_of<tag::with_p_square_cumulative_distribution_median> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct feature_of<tag::with_p_square_cumulative_distribution_median>

    -

    boost::accumulators::feature_of<tag::with_p_square_cumulative_distribution_median>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/median.hpp>
-
-
-struct feature_of<tag::with_p_square_cumulative_distribution_median> : public boost::accumulators::feature_of< tag::median > {
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65101008.html b/doc/html/boost/accumulators/feature_of_tag_idp65101008.html deleted file mode 100644 index 865a8ec705..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65101008.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct feature_of<tag::with_p_square_cumulative_distribution_weighted_median> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct feature_of<tag::with_p_square_cumulative_distribution_weighted_median>

    -

    boost::accumulators::feature_of<tag::with_p_square_cumulative_distribution_weighted_median>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/median.hpp>
-
-
-struct feature_of<tag::with_p_square_cumulative_distribution_weighted_median> : public boost::accumulators::feature_of< tag::with_p_square_cumulative_distribution_median >
-{
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65124992.html b/doc/html/boost/accumulators/feature_of_tag_idp65124992.html deleted file mode 100644 index b464adb840..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65124992.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template feature_of<tag::weighted_moment< N >> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template feature_of<tag::weighted_moment< N >>

    -

    boost::accumulators::feature_of<tag::weighted_moment< N >>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/moment.hpp>
-
-template<int N> 
-struct feature_of<tag::weighted_moment< N >> :
-  public boost::accumulators::feature_of< tag::moment< N > >
-{
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65134752.html b/doc/html/boost/accumulators/feature_of_tag_idp65134752.html deleted file mode 100644 index dbac625c56..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65134752.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct feature_of<tag::weighted_p_square_cumulative_distribution> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct feature_of<tag::weighted_p_square_cumulative_distribution>

    -

    boost::accumulators::feature_of<tag::weighted_p_square_cumulative_distribution>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/p_square_cumul_dist.hpp>
-
-
-struct feature_of<tag::weighted_p_square_cumulative_distribution> : public boost::accumulators::feature_of< tag::p_square_cumulative_distribution >
-{
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65146944.html b/doc/html/boost/accumulators/feature_of_tag_idp65146944.html deleted file mode 100644 index ed81d39b61..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65146944.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct feature_of<tag::weighted_p_square_quantile> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct feature_of<tag::weighted_p_square_quantile>

    -

    boost::accumulators::feature_of<tag::weighted_p_square_quantile>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/p_square_quantile.hpp>
-
-
-struct feature_of<tag::weighted_p_square_quantile> :
-  public boost::accumulators::feature_of< tag::p_square_quantile >
-{
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65169632.html b/doc/html/boost/accumulators/feature_of_tag_idp65169632.html deleted file mode 100644 index 84b77156c8..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65169632.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template feature_of<tag::peaks_over_threshold< LeftRight >> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template feature_of<tag::peaks_over_threshold< LeftRight >>

    -

    boost::accumulators::feature_of<tag::peaks_over_threshold< LeftRight >>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/peaks_over_threshold.hpp>
-
-template<typename LeftRight> 
-struct feature_of<tag::peaks_over_threshold< LeftRight >> : public boost::accumulators::feature_of< tag::abstract_peaks_over_threshold >
-{
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65171920.html b/doc/html/boost/accumulators/feature_of_tag_idp65171920.html deleted file mode 100644 index b9642e34fc..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65171920.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template feature_of<tag::peaks_over_threshold_prob< LeftRight >> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template feature_of<tag::peaks_over_threshold_prob< LeftRight >>

    -

    boost::accumulators::feature_of<tag::peaks_over_threshold_prob< LeftRight >>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/peaks_over_threshold.hpp>
-
-template<typename LeftRight> 
-struct feature_of<tag::peaks_over_threshold_prob< LeftRight >> : public boost::accumulators::feature_of< tag::abstract_peaks_over_threshold >
-{
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65174224.html b/doc/html/boost/accumulators/feature_of_tag_idp65174224.html deleted file mode 100644 index 2e66a9ba7c..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65174224.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template feature_of<tag::weighted_peaks_over_threshold< LeftRight >> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template feature_of<tag::weighted_peaks_over_threshold< LeftRight >>

    -

    boost::accumulators::feature_of<tag::weighted_peaks_over_threshold< LeftRight >>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/peaks_over_threshold.hpp>
-
-template<typename LeftRight> 
-struct feature_of<tag::weighted_peaks_over_threshold< LeftRight >> : public boost::accumulators::feature_of< tag::peaks_over_threshold< LeftRight > >
-{
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65176544.html b/doc/html/boost/accumulators/feature_of_tag_idp65176544.html deleted file mode 100644 index abd45adddf..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65176544.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template feature_of<tag::weighted_peaks_over_threshold_prob< LeftRight >> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template feature_of<tag::weighted_peaks_over_threshold_prob< LeftRight >>

    -

    boost::accumulators::feature_of<tag::weighted_peaks_over_threshold_prob< LeftRight >>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/peaks_over_threshold.hpp>
-
-template<typename LeftRight> 
-struct feature_of<tag::weighted_peaks_over_threshold_prob< LeftRight >> : public boost::accumulators::feature_of< tag::peaks_over_threshold_prob< LeftRight > >
-{
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65300336.html b/doc/html/boost/accumulators/feature_of_tag_idp65300336.html deleted file mode 100644 index 716c75daed..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65300336.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct template feature_of<tag::pot_quantile< LeftRight >> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template feature_of<tag::pot_quantile< LeftRight >>

    -

    boost::accumulators::feature_of<tag::pot_quantile< LeftRight >>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/pot_quantile.hpp>
-
-template<typename LeftRight> 
-struct feature_of<tag::pot_quantile< LeftRight >> : public boost::accumulators::feature_of< tag::quantile > {
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65302608.html b/doc/html/boost/accumulators/feature_of_tag_idp65302608.html deleted file mode 100644 index 6547bbf76b..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65302608.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct template feature_of<tag::pot_quantile_prob< LeftRight >> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template feature_of<tag::pot_quantile_prob< LeftRight >>

    -

    boost::accumulators::feature_of<tag::pot_quantile_prob< LeftRight >>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/pot_quantile.hpp>
-
-template<typename LeftRight> 
-struct feature_of<tag::pot_quantile_prob< LeftRight >> : public boost::accumulators::feature_of< tag::quantile > {
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65304880.html b/doc/html/boost/accumulators/feature_of_tag_idp65304880.html deleted file mode 100644 index 7d364d345f..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65304880.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template feature_of<tag::weighted_pot_quantile< LeftRight >> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template feature_of<tag::weighted_pot_quantile< LeftRight >>

    -

    boost::accumulators::feature_of<tag::weighted_pot_quantile< LeftRight >>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/pot_quantile.hpp>
-
-template<typename LeftRight> 
-struct feature_of<tag::weighted_pot_quantile< LeftRight >> :
-  public boost::accumulators::feature_of< tag::pot_quantile< LeftRight > >
-{
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65307168.html b/doc/html/boost/accumulators/feature_of_tag_idp65307168.html deleted file mode 100644 index 2646cd04bc..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65307168.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template feature_of<tag::weighted_pot_quantile_prob< LeftRight >> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template feature_of<tag::weighted_pot_quantile_prob< LeftRight >>

    -

    boost::accumulators::feature_of<tag::weighted_pot_quantile_prob< LeftRight >>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/pot_quantile.hpp>
-
-template<typename LeftRight> 
-struct feature_of<tag::weighted_pot_quantile_prob< LeftRight >> : public boost::accumulators::feature_of< tag::pot_quantile_prob< LeftRight > >
-{
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65330176.html b/doc/html/boost/accumulators/feature_of_tag_idp65330176.html deleted file mode 100644 index a6df783c37..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65330176.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct template feature_of<tag::pot_tail_mean< LeftRight >> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template feature_of<tag::pot_tail_mean< LeftRight >>

    -

    boost::accumulators::feature_of<tag::pot_tail_mean< LeftRight >>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/pot_tail_mean.hpp>
-
-template<typename LeftRight> 
-struct feature_of<tag::pot_tail_mean< LeftRight >> : public boost::accumulators::feature_of< tag::tail_mean > {
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65332448.html b/doc/html/boost/accumulators/feature_of_tag_idp65332448.html deleted file mode 100644 index 93490686f1..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65332448.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct template feature_of<tag::pot_tail_mean_prob< LeftRight >> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template feature_of<tag::pot_tail_mean_prob< LeftRight >>

    -

    boost::accumulators::feature_of<tag::pot_tail_mean_prob< LeftRight >>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/pot_tail_mean.hpp>
-
-template<typename LeftRight> 
-struct feature_of<tag::pot_tail_mean_prob< LeftRight >> : public boost::accumulators::feature_of< tag::tail_mean > {
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65334720.html b/doc/html/boost/accumulators/feature_of_tag_idp65334720.html deleted file mode 100644 index 3def942551..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65334720.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template feature_of<tag::weighted_pot_tail_mean< LeftRight >> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template feature_of<tag::weighted_pot_tail_mean< LeftRight >>

    -

    boost::accumulators::feature_of<tag::weighted_pot_tail_mean< LeftRight >>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/pot_tail_mean.hpp>
-
-template<typename LeftRight> 
-struct feature_of<tag::weighted_pot_tail_mean< LeftRight >> :
-  public boost::accumulators::feature_of< tag::pot_tail_mean< LeftRight > >
-{
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65337024.html b/doc/html/boost/accumulators/feature_of_tag_idp65337024.html deleted file mode 100644 index 5bc6219fc2..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65337024.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template feature_of<tag::weighted_pot_tail_mean_prob< LeftRight >> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template feature_of<tag::weighted_pot_tail_mean_prob< LeftRight >>

    -

    boost::accumulators::feature_of<tag::weighted_pot_tail_mean_prob< LeftRight >>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/pot_tail_mean.hpp>
-
-template<typename LeftRight> 
-struct feature_of<tag::weighted_pot_tail_mean_prob< LeftRight >> : public boost::accumulators::feature_of< tag::pot_tail_mean_prob< LeftRight > >
-{
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65355568.html b/doc/html/boost/accumulators/feature_of_tag_idp65355568.html deleted file mode 100644 index b3db34ab88..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65355568.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct feature_of<tag::immediate_rolling_mean> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct feature_of<tag::immediate_rolling_mean>

    -

    boost::accumulators::feature_of<tag::immediate_rolling_mean>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/rolling_mean.hpp>
-
-
-struct feature_of<tag::immediate_rolling_mean> :
-  public boost::accumulators::feature_of< tag::rolling_mean >
-{
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65357280.html b/doc/html/boost/accumulators/feature_of_tag_idp65357280.html deleted file mode 100644 index 7332ac2705..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65357280.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct feature_of<tag::lazy_rolling_mean> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct feature_of<tag::lazy_rolling_mean>

    -

    boost::accumulators::feature_of<tag::lazy_rolling_mean>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/rolling_mean.hpp>
-
-
-struct feature_of<tag::lazy_rolling_mean> :
-  public boost::accumulators::feature_of< tag::rolling_mean >
-{
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65425344.html b/doc/html/boost/accumulators/feature_of_tag_idp65425344.html deleted file mode 100644 index 6564272109..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65425344.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct feature_of<tag::immediate_rolling_variance> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct feature_of<tag::immediate_rolling_variance>

    -

    boost::accumulators::feature_of<tag::immediate_rolling_variance>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/rolling_variance.hpp>
-
-
-struct feature_of<tag::immediate_rolling_variance> :
-  public boost::accumulators::feature_of< tag::rolling_variance >
-{
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65427072.html b/doc/html/boost/accumulators/feature_of_tag_idp65427072.html deleted file mode 100644 index 308d26224b..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65427072.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct feature_of<tag::lazy_rolling_variance> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct feature_of<tag::lazy_rolling_variance>

    -

    boost::accumulators::feature_of<tag::lazy_rolling_variance>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/rolling_variance.hpp>
-
-
-struct feature_of<tag::lazy_rolling_variance> :
-  public boost::accumulators::feature_of< tag::rolling_variance >
-{
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65541920.html b/doc/html/boost/accumulators/feature_of_tag_idp65541920.html deleted file mode 100644 index 9a018a869d..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65541920.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct feature_of<tag::weighted_skewness> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct feature_of<tag::weighted_skewness>

    -

    boost::accumulators::feature_of<tag::weighted_skewness>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/skewness.hpp>
-
-
-struct feature_of<tag::weighted_skewness> : public boost::accumulators::feature_of< tag::skewness > {
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65555104.html b/doc/html/boost/accumulators/feature_of_tag_idp65555104.html deleted file mode 100644 index 9dfe1694c3..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65555104.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template feature_of<tag::sum_of_variates< VariateType, VariateTag >> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template feature_of<tag::sum_of_variates< VariateType, VariateTag >>

    -

    boost::accumulators::feature_of<tag::sum_of_variates< VariateType, VariateTag >>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/sum.hpp>
-
-template<typename VariateType, typename VariateTag> 
-struct feature_of<tag::sum_of_variates< VariateType, VariateTag >> :
-  public boost::accumulators::feature_of< tag::abstract_sum_of_variates >
-{
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65558240.html b/doc/html/boost/accumulators/feature_of_tag_idp65558240.html deleted file mode 100644 index 95c9c3dd30..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65558240.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct feature_of<tag::weighted_sum> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct feature_of<tag::weighted_sum>

    -

    boost::accumulators::feature_of<tag::weighted_sum>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/sum.hpp>
-
-
-struct feature_of<tag::weighted_sum> : public boost::accumulators::feature_of< tag::sum > {
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65579120.html b/doc/html/boost/accumulators/feature_of_tag_idp65579120.html deleted file mode 100644 index 55f7343ea8..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65579120.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct feature_of<tag::sum_kahan> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct feature_of<tag::sum_kahan>

    -

    boost::accumulators::feature_of<tag::sum_kahan>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/sum_kahan.hpp>
-
-
-struct feature_of<tag::sum_kahan> : public boost::accumulators::feature_of< tag::sum > {
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65580816.html b/doc/html/boost/accumulators/feature_of_tag_idp65580816.html deleted file mode 100644 index dfddf2c91e..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65580816.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template feature_of<tag::sum_of_variates_kahan< VariateType, VariateTag >> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template feature_of<tag::sum_of_variates_kahan< VariateType, VariateTag >>

    -

    boost::accumulators::feature_of<tag::sum_of_variates_kahan< VariateType, VariateTag >>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/sum_kahan.hpp>
-
-template<typename VariateType, typename VariateTag> 
-struct feature_of<tag::sum_of_variates_kahan< VariateType, VariateTag >> :
-  public boost::accumulators::feature_of< tag::abstract_sum_of_variates >
-{
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65583952.html b/doc/html/boost/accumulators/feature_of_tag_idp65583952.html deleted file mode 100644 index 245a3fc9a3..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65583952.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct feature_of<tag::sum_of_weights_kahan> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct feature_of<tag::sum_of_weights_kahan>

    -

    boost::accumulators::feature_of<tag::sum_of_weights_kahan>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/sum_kahan.hpp>
-
-
-struct feature_of<tag::sum_of_weights_kahan> :
-  public boost::accumulators::feature_of< tag::sum_of_weights >
-{
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65585664.html b/doc/html/boost/accumulators/feature_of_tag_idp65585664.html deleted file mode 100644 index db3b27571b..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65585664.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct feature_of<tag::weighted_sum_kahan> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct feature_of<tag::weighted_sum_kahan>

    -

    boost::accumulators::feature_of<tag::weighted_sum_kahan>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/sum_kahan.hpp>
-
-
-struct feature_of<tag::weighted_sum_kahan> : public boost::accumulators::feature_of< tag::sum > {
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65599280.html b/doc/html/boost/accumulators/feature_of_tag_idp65599280.html deleted file mode 100644 index 90d54c4875..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65599280.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template feature_of<tag::tail< LeftRight >> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template feature_of<tag::tail< LeftRight >>

    -

    boost::accumulators::feature_of<tag::tail< LeftRight >>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/tail.hpp>
-
-template<typename LeftRight> 
-struct feature_of<tag::tail< LeftRight >> :
-  public boost::accumulators::feature_of< tag::abstract_tail >
-{
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65615920.html b/doc/html/boost/accumulators/feature_of_tag_idp65615920.html deleted file mode 100644 index 82e52e00a0..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65615920.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct template feature_of<tag::coherent_tail_mean< LeftRight >> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template feature_of<tag::coherent_tail_mean< LeftRight >>

    -

    boost::accumulators::feature_of<tag::coherent_tail_mean< LeftRight >>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/tail_mean.hpp>
-
-template<typename LeftRight> 
-struct feature_of<tag::coherent_tail_mean< LeftRight >> : public boost::accumulators::feature_of< tag::tail_mean > {
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65618192.html b/doc/html/boost/accumulators/feature_of_tag_idp65618192.html deleted file mode 100644 index e6ee0ca07a..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65618192.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template feature_of<tag::non_coherent_tail_mean< LeftRight >> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template feature_of<tag::non_coherent_tail_mean< LeftRight >>

    -

    boost::accumulators::feature_of<tag::non_coherent_tail_mean< LeftRight >>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/tail_mean.hpp>
-
-template<typename LeftRight> 
-struct feature_of<tag::non_coherent_tail_mean< LeftRight >> : public boost::accumulators::feature_of< tag::abstract_non_coherent_tail_mean >
-{
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65620496.html b/doc/html/boost/accumulators/feature_of_tag_idp65620496.html deleted file mode 100644 index 3d0b4150d1..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65620496.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template feature_of<tag::non_coherent_weighted_tail_mean< LeftRight >> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template feature_of<tag::non_coherent_weighted_tail_mean< LeftRight >>

    -

    boost::accumulators::feature_of<tag::non_coherent_weighted_tail_mean< LeftRight >>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/tail_mean.hpp>
-
-template<typename LeftRight> 
-struct feature_of<tag::non_coherent_weighted_tail_mean< LeftRight >> : public boost::accumulators::feature_of< tag::non_coherent_tail_mean< LeftRight > >
-{
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65634176.html b/doc/html/boost/accumulators/feature_of_tag_idp65634176.html deleted file mode 100644 index 7bd0571015..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65634176.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct template feature_of<tag::tail_quantile< LeftRight >> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template feature_of<tag::tail_quantile< LeftRight >>

    -

    boost::accumulators::feature_of<tag::tail_quantile< LeftRight >>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/tail_quantile.hpp>
-
-template<typename LeftRight> 
-struct feature_of<tag::tail_quantile< LeftRight >> : public boost::accumulators::feature_of< tag::quantile > {
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65636448.html b/doc/html/boost/accumulators/feature_of_tag_idp65636448.html deleted file mode 100644 index d8497396c1..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65636448.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template feature_of<tag::weighted_tail_quantile< LeftRight >> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template feature_of<tag::weighted_tail_quantile< LeftRight >>

    -

    boost::accumulators::feature_of<tag::weighted_tail_quantile< LeftRight >>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/tail_quantile.hpp>
-
-template<typename LeftRight> 
-struct feature_of<tag::weighted_tail_quantile< LeftRight >> :
-  public boost::accumulators::feature_of< tag::tail_quantile< LeftRight > >
-{
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65644688.html b/doc/html/boost/accumulators/feature_of_tag_idp65644688.html deleted file mode 100644 index 9d23f5d6cd..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65644688.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template feature_of<tag::tail_variate< VariateType, VariateTag, LeftRight >> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template feature_of<tag::tail_variate< VariateType, VariateTag, LeftRight >>

    -

    boost::accumulators::feature_of<tag::tail_variate< VariateType, VariateTag, LeftRight >>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/tail_variate.hpp>
-
-template<typename VariateType, typename VariateTag, typename LeftRight> 
-struct feature_of<tag::tail_variate< VariateType, VariateTag, LeftRight >> :
-  public boost::accumulators::feature_of< tag::abstract_tail_variate >
-{
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65648672.html b/doc/html/boost/accumulators/feature_of_tag_idp65648672.html deleted file mode 100644 index 94920a1450..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65648672.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template feature_of<tag::tail_weights< LeftRight >> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template feature_of<tag::tail_weights< LeftRight >>

    -

    boost::accumulators::feature_of<tag::tail_weights< LeftRight >>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/tail_variate.hpp>
-
-template<typename LeftRight> 
-struct feature_of<tag::tail_weights< LeftRight >> {
-  // types
-  typedef tag::abstract_tail_weights type;
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65679088.html b/doc/html/boost/accumulators/feature_of_tag_idp65679088.html deleted file mode 100644 index 89c7645820..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65679088.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template feature_of<tag::absolute_tail_variate_means< LeftRight, VariateType, VariateTag >> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template feature_of<tag::absolute_tail_variate_means< LeftRight, VariateType, VariateTag >>

    -

    boost::accumulators::feature_of<tag::absolute_tail_variate_means< LeftRight, VariateType, VariateTag >>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/tail_variate_means.hpp>
-
-template<typename LeftRight, typename VariateType, typename VariateTag> 
-struct feature_of<tag::absolute_tail_variate_means< LeftRight, VariateType, VariateTag >> : public boost::accumulators::feature_of< tag::abstract_absolute_tail_variate_means >
-{
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65683104.html b/doc/html/boost/accumulators/feature_of_tag_idp65683104.html deleted file mode 100644 index 2e5bee2c99..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65683104.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template feature_of<tag::absolute_weighted_tail_variate_means< LeftRight, VariateType, VariateTag >> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template feature_of<tag::absolute_weighted_tail_variate_means< LeftRight, VariateType, VariateTag >>

    -

    boost::accumulators::feature_of<tag::absolute_weighted_tail_variate_means< LeftRight, VariateType, VariateTag >>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/tail_variate_means.hpp>
-
-template<typename LeftRight, typename VariateType, typename VariateTag> 
-struct feature_of<tag::absolute_weighted_tail_variate_means< LeftRight, VariateType, VariateTag >> : public boost::accumulators::feature_of< tag::absolute_tail_variate_means< LeftRight, VariateType, VariateTag > >
-{
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65687152.html b/doc/html/boost/accumulators/feature_of_tag_idp65687152.html deleted file mode 100644 index 094329242a..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65687152.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template feature_of<tag::relative_tail_variate_means< LeftRight, VariateType, VariateTag >> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template feature_of<tag::relative_tail_variate_means< LeftRight, VariateType, VariateTag >>

    -

    boost::accumulators::feature_of<tag::relative_tail_variate_means< LeftRight, VariateType, VariateTag >>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/tail_variate_means.hpp>
-
-template<typename LeftRight, typename VariateType, typename VariateTag> 
-struct feature_of<tag::relative_tail_variate_means< LeftRight, VariateType, VariateTag >> : public boost::accumulators::feature_of< tag::abstract_relative_tail_variate_means >
-{
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65691168.html b/doc/html/boost/accumulators/feature_of_tag_idp65691168.html deleted file mode 100644 index 940e87bed1..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65691168.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template feature_of<tag::relative_weighted_tail_variate_means< LeftRight, VariateType, VariateTag >> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template feature_of<tag::relative_weighted_tail_variate_means< LeftRight, VariateType, VariateTag >>

    -

    boost::accumulators::feature_of<tag::relative_weighted_tail_variate_means< LeftRight, VariateType, VariateTag >>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/tail_variate_means.hpp>
-
-template<typename LeftRight, typename VariateType, typename VariateTag> 
-struct feature_of<tag::relative_weighted_tail_variate_means< LeftRight, VariateType, VariateTag >> : public boost::accumulators::feature_of< tag::relative_tail_variate_means< LeftRight, VariateType, VariateTag > >
-{
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65715344.html b/doc/html/boost/accumulators/feature_of_tag_idp65715344.html deleted file mode 100644 index 8e9d5e36b2..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65715344.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct feature_of<tag::lazy_variance> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct feature_of<tag::lazy_variance>

    -

    boost::accumulators::feature_of<tag::lazy_variance>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/variance.hpp>
-
-
-struct feature_of<tag::lazy_variance> : public boost::accumulators::feature_of< tag::variance > {
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65717040.html b/doc/html/boost/accumulators/feature_of_tag_idp65717040.html deleted file mode 100644 index 44533d7473..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65717040.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct feature_of<tag::lazy_weighted_variance> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct feature_of<tag::lazy_weighted_variance>

    -

    boost::accumulators::feature_of<tag::lazy_weighted_variance>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/variance.hpp>
-
-
-struct feature_of<tag::lazy_weighted_variance> :
-  public boost::accumulators::feature_of< tag::lazy_variance >
-{
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65718752.html b/doc/html/boost/accumulators/feature_of_tag_idp65718752.html deleted file mode 100644 index 5d2c295b83..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65718752.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct feature_of<tag::weighted_variance> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct feature_of<tag::weighted_variance>

    -

    boost::accumulators::feature_of<tag::weighted_variance>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/variance.hpp>
-
-
-struct feature_of<tag::weighted_variance> : public boost::accumulators::feature_of< tag::variance > {
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65848960.html b/doc/html/boost/accumulators/feature_of_tag_idp65848960.html deleted file mode 100644 index 3692945334..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65848960.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template feature_of<tag::weighted_sum_of_variates< VariateType, VariateTag >> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template feature_of<tag::weighted_sum_of_variates< VariateType, VariateTag >>

    -

    boost::accumulators::feature_of<tag::weighted_sum_of_variates< VariateType, VariateTag >>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/weighted_sum.hpp>
-
-template<typename VariateType, typename VariateTag> 
-struct feature_of<tag::weighted_sum_of_variates< VariateType, VariateTag >> : public boost::accumulators::feature_of< tag::abstract_weighted_sum_of_variates >
-{
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/feature_of_tag_idp65863744.html b/doc/html/boost/accumulators/feature_of_tag_idp65863744.html deleted file mode 100644 index 20963f73ab..0000000000 --- a/doc/html/boost/accumulators/feature_of_tag_idp65863744.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template feature_of<tag::weighted_sum_of_variates_kahan< VariateType, VariateTag >> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template feature_of<tag::weighted_sum_of_variates_kahan< VariateType, VariateTag >>

    -

    boost::accumulators::feature_of<tag::weighted_sum_of_variates_kahan< VariateType, VariateTag >>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/weighted_sum_kahan.hpp>
-
-template<typename VariateType, typename VariateTag> 
-struct feature_of<tag::weighted_sum_of_variates_kahan< VariateType, VariateTag >> : public boost::accumulators::feature_of< tag::abstract_weighted_sum_of_variates >
-{
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/for_median.html b/doc/html/boost/accumulators/for_median.html deleted file mode 100644 index b7711d6f4f..0000000000 --- a/doc/html/boost/accumulators/for_median.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct for_median - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct for_median

    -

    boost::accumulators::for_median

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics_fwd.hpp>
-
-
-struct for_median {
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/immediate.html b/doc/html/boost/accumulators/immediate.html deleted file mode 100644 index 54c141099e..0000000000 --- a/doc/html/boost/accumulators/immediate.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct immediate - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct immediate

    -

    boost::accumulators::immediate

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics_fwd.hpp>
-
-
-struct immediate {
-};
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/impl/coherent_tail_mean_impl.html b/doc/html/boost/accumulators/impl/coherent_tail_mean_impl.html deleted file mode 100644 index d64d014bac..0000000000 --- a/doc/html/boost/accumulators/impl/coherent_tail_mean_impl.html +++ /dev/null @@ -1,83 +0,0 @@ - - - - -Struct template coherent_tail_mean_impl - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template coherent_tail_mean_impl

    -

    boost::accumulators::impl::coherent_tail_mean_impl — Estimation of the coherent tail mean based on order statistics (for both left and right tails)

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample, typename LeftRight> 
-struct coherent_tail_mean_impl : public accumulator_base {
-  // construct/copy/destruct
-  coherent_tail_mean_impl(dont_care);
-
-  // public member functions
-  template<typename Args> result_type result(Args const &) const;
-};
    -
    -

    Description

    -

    The coherent tail mean is equal to the non-coherent tail mean plus a correction term that ensures coherence in case of non-continuous distributions.

    -
    -

    Equation 1.15. 

    -
    -
    -


    -
    -

    Equation 1.16. 

    -
    -
    -


    -
    -

    -coherent_tail_mean_impl - public - construct/copy/destruct

    -
    1. coherent_tail_mean_impl(dont_care);
    -
    -
    -

    -coherent_tail_mean_impl public member functions

    -
    1. template<typename Args> result_type result(Args const & args) const;
    -
    -
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/impl/count_impl.html b/doc/html/boost/accumulators/impl/count_impl.html deleted file mode 100644 index 9efd3d856d..0000000000 --- a/doc/html/boost/accumulators/impl/count_impl.html +++ /dev/null @@ -1,79 +0,0 @@ - - - - -Struct count_impl - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct count_impl

    -

    boost::accumulators::impl::count_impl

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/count.hpp>
-
-
-struct count_impl : public accumulator_base {
-  // types
-  typedef std::size_t result_type;
-
-  // construct/copy/destruct
-  count_impl(dont_care);
-
-  // public member functions
-  void operator()(dont_care);
-  result_type result(dont_care) const;
-};
    -
    -

    Description

    -
    -

    -count_impl - public - construct/copy/destruct

    -
    1. count_impl(dont_care);
    -
    -
    -

    -count_impl public member functions

    -
      -
    1. void operator()(dont_care);
      2. -
    2. result_type result(dont_care) const;
      3. -
    -
    -
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/impl/covariance_impl.html b/doc/html/boost/accumulators/impl/covariance_impl.html deleted file mode 100644 index 5bafa98b14..0000000000 --- a/doc/html/boost/accumulators/impl/covariance_impl.html +++ /dev/null @@ -1,83 +0,0 @@ - - - - -Struct template covariance_impl - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template covariance_impl

    -

    boost::accumulators::impl::covariance_impl — Covariance Estimator.

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample, typename VariateType, typename VariateTag> 
-struct covariance_impl : public accumulator_base {
-  // construct/copy/destruct
-  template<typename Args> covariance_impl(Args const &);
-
-  // public member functions
-  template<typename Args> void operator()(Args const &);
-  result_type result(dont_care) const;
-};
    -
    -

    Description

    -

    An iterative Monte Carlo estimator for the covariance , where is a sample and is a variate, is given by:

    -
    -

    Equation 1.17. 

    -
    -
    -


    -

    and being the means of the samples and variates.

    -
    -

    -covariance_impl - public - construct/copy/destruct

    -
    1. template<typename Args> covariance_impl(Args const & args);
    -
    -
    -

    -covariance_impl public member functions

    -
      -
    1. template<typename Args> void operator()(Args const & args);
      2. -
    2. result_type result(dont_care) const;
      3. -
    -
    -
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/impl/density_impl.html b/doc/html/boost/accumulators/impl/density_impl.html deleted file mode 100644 index 8c0c5e2819..0000000000 --- a/doc/html/boost/accumulators/impl/density_impl.html +++ /dev/null @@ -1,93 +0,0 @@ - - - - -Struct template density_impl - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template density_impl

    -

    boost::accumulators::impl::density_impl — Histogram density estimator.

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample> 
-struct density_impl : public accumulator_base {
-  // construct/copy/destruct
-  template<typename Args> density_impl(Args const &);
-
-  // public member functions
-  template<typename Args> void operator()(Args const &);
-  template<typename Args> result_type result(Args const &) const;
-};
    -
    -

    Description

    -

    The histogram density estimator returns a histogram of the sample distribution. The positions and sizes of the bins are determined using a specifiable number of cached samples (cache_size). The range between the minimum and the maximum of the cached samples is subdivided into a specifiable number of bins (num_bins) of same size. Additionally, an under- and an overflow bin is added to capture future under- and overflow samples. Once the bins are determined, the cached samples and all subsequent samples are added to the correct bins. At the end, a range of std::pair is return, where each pair contains the position of the bin (lower bound) and the samples count (normalized with the total number of samples).

    -

    -

    -
    -

    -density_impl - public - construct/copy/destruct

    -
    1. template<typename Args> density_impl(Args const & args);
    -
    -
    -

    -density_impl public member functions

    -
      -
    1. template<typename Args> void operator()(Args const & args);
      2. -
    2. -
      template<typename Args> result_type result(Args const & args) const;
      -

      -

      -
      ---- - - - - -

      Requires:

      The number of samples must meet or exceed the cache size

      -
      3. -
    -
    -
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/impl/error_of_mean_impl.html b/doc/html/boost/accumulators/impl/error_of_mean_impl.html deleted file mode 100644 index 91163e70fc..0000000000 --- a/doc/html/boost/accumulators/impl/error_of_mean_impl.html +++ /dev/null @@ -1,72 +0,0 @@ - - - - -Struct template error_of_mean_impl - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template error_of_mean_impl

    -

    boost::accumulators::impl::error_of_mean_impl

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample, typename Variance> 
-struct error_of_mean_impl : public accumulator_base {
-  // construct/copy/destruct
-  error_of_mean_impl(dont_care);
-
-  // public member functions
-  template<typename Args> result_type result(Args const &) const;
-};
    -
    -

    Description

    -
    -

    -error_of_mean_impl - public - construct/copy/destruct

    -
    1. error_of_mean_impl(dont_care);
    -
    -
    -

    -error_of_mean_impl public member functions

    -
    1. template<typename Args> result_type result(Args const & args) const;
    -
    -
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/impl/extended_p_squ_idp66039568.html b/doc/html/boost/accumulators/impl/extended_p_squ_idp66039568.html deleted file mode 100644 index 396907c8e7..0000000000 --- a/doc/html/boost/accumulators/impl/extended_p_squ_idp66039568.html +++ /dev/null @@ -1,75 +0,0 @@ - - - - -Struct template extended_p_square_quantile_impl - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template extended_p_square_quantile_impl

    -

    boost::accumulators::impl::extended_p_square_quantile_impl — Quantile estimation using the extended algorithm for weighted and unweighted samples.

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample, typename Impl1, typename Impl2> 
-struct extended_p_square_quantile_impl : public accumulator_base {
-  // construct/copy/destruct
-  template<typename Args> extended_p_square_quantile_impl(Args const &);
-
-  // public member functions
-  template<typename Args> result_type result(Args const &) const;
-};
    -
    -

    Description

    -

    Uses the quantile estimates calculated by the extended algorithm to compute intermediate quantile estimates by means of quadratic interpolation.

    -

    -

    -
    -

    -extended_p_square_quantile_impl - public - construct/copy/destruct

    -
    1. template<typename Args> extended_p_square_quantile_impl(Args const & args);
    -
    -
    -

    -extended_p_square_quantile_impl public member functions

    -
    1. template<typename Args> result_type result(Args const & args) const;
    -
    -
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/impl/extended_p_square_impl.html b/doc/html/boost/accumulators/impl/extended_p_square_impl.html deleted file mode 100644 index 1663723f5e..0000000000 --- a/doc/html/boost/accumulators/impl/extended_p_square_impl.html +++ /dev/null @@ -1,83 +0,0 @@ - - - - -Struct template extended_p_square_impl - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template extended_p_square_impl

    -

    boost::accumulators::impl::extended_p_square_impl — Multiple quantile estimation with the extended algorithm.

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample> 
-struct extended_p_square_impl : public accumulator_base {
-  // construct/copy/destruct
-  template<typename Args> extended_p_square_impl(Args const &);
-
-  // public member functions
-  template<typename Args> void operator()(Args const &);
-  result_type result(dont_care) const;
-};
    -
    -

    Description

    -

    Extended algorithm for estimation of several quantiles without storing samples. Assume that quantiles are to be estimated. Instead of storing the whole sample cumulative distribution, the algorithm maintains only principal markers and middle markers, whose positions are updated with each sample and whose heights are adjusted (if necessary) using a piecewise-parablic formula. The heights of these central markers are the current estimates of the quantiles and returned as an iterator range.

    -

    For further details, see

    -

    K. E. E. Raatikainen, Simultaneous estimation of several quantiles, Simulation, Volume 49, Number 4 (October), 1986, p. 159-164.

    -

    The extended algorithm generalizes the algorithm of

    -

    R. Jain and I. Chlamtac, The P^2 algorithm for dynamic calculation of quantiles and histograms without storing observations, Communications of the ACM, Volume 28 (October), Number 10, 1985, p. 1076-1085.

    -

    -

    -
    -

    -extended_p_square_impl - public - construct/copy/destruct

    -
    1. template<typename Args> extended_p_square_impl(Args const & args);
    -
    -
    -

    -extended_p_square_impl public member functions

    -
      -
    1. template<typename Args> void operator()(Args const & args);
      2. -
    2. result_type result(dont_care) const;
      3. -
    -
    -
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/impl/immediate_mean_impl.html b/doc/html/boost/accumulators/impl/immediate_mean_impl.html deleted file mode 100644 index 2f682fdf83..0000000000 --- a/doc/html/boost/accumulators/impl/immediate_mean_impl.html +++ /dev/null @@ -1,76 +0,0 @@ - - - - -Struct template immediate_mean_impl - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template immediate_mean_impl

    -

    boost::accumulators::impl::immediate_mean_impl

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample, typename Tag> 
-struct immediate_mean_impl : public accumulator_base {
-  // construct/copy/destruct
-  template<typename Args> immediate_mean_impl(Args const &);
-
-  // public member functions
-  template<typename Args> void operator()(Args const &);
-  result_type result(dont_care) const;
-};
    -
    -

    Description

    -
    -

    -immediate_mean_impl - public - construct/copy/destruct

    -
    1. template<typename Args> immediate_mean_impl(Args const & args);
    -
    -
    -

    -immediate_mean_impl public member functions

    -
      -
    1. template<typename Args> void operator()(Args const & args);
      2. -
    2. result_type result(dont_care) const;
      3. -
    -
    -
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/impl/immediate_roll_idp65365024.html b/doc/html/boost/accumulators/impl/immediate_roll_idp65365024.html deleted file mode 100644 index 1e24bc4e5a..0000000000 --- a/doc/html/boost/accumulators/impl/immediate_roll_idp65365024.html +++ /dev/null @@ -1,79 +0,0 @@ - - - - -Struct template immediate_rolling_mean_impl - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template immediate_rolling_mean_impl

    -

    boost::accumulators::impl::immediate_rolling_mean_impl

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/rolling_mean.hpp>
-
-template<typename Sample> 
-struct immediate_rolling_mean_impl : public accumulator_base {
-  // types
-  typedef numeric::functional::fdiv< Sample, std::size_t >::result_type result_type;
-
-  // construct/copy/destruct
-  template<typename Args> immediate_rolling_mean_impl(Args const &);
-
-  // public member functions
-  template<typename Args> void operator()(Args const &);
-  template<typename Args> result_type result(Args const &) const;
-};
    -
    -

    Description

    -
    -

    -immediate_rolling_mean_impl - public - construct/copy/destruct

    -
    1. template<typename Args> immediate_rolling_mean_impl(Args const & args);
    -
    -
    -

    -immediate_rolling_mean_impl public member functions

    -
      -
    1. template<typename Args> void operator()(Args const & args);
      2. -
    2. template<typename Args> result_type result(Args const &) const;
      3. -
    -
    -
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/impl/immediate_roll_idp65434880.html b/doc/html/boost/accumulators/impl/immediate_roll_idp65434880.html deleted file mode 100644 index de87fcbab9..0000000000 --- a/doc/html/boost/accumulators/impl/immediate_roll_idp65434880.html +++ /dev/null @@ -1,131 +0,0 @@ - - - - -Struct template immediate_rolling_variance_impl - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template immediate_rolling_variance_impl

    -

    boost::accumulators::impl::immediate_rolling_variance_impl — Iterative calculation of the rolling variance.

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/rolling_variance.hpp>
-
-template<typename Sample> 
-struct immediate_rolling_variance_impl : public accumulator_base {
-  // types
-  typedef numeric::functional::fdiv< Sample, std::size_t >::result_type result_type;
-
-  // construct/copy/destruct
-  template<typename Args> immediate_rolling_variance_impl(Args const &);
-
-  // public member functions
-  template<typename Args> void operator()(Args const &);
-  template<typename Args> result_type result(Args const &) const;
-
-  // private member functions
-  template<typename T> 
-    void prevent_underflow(T &, 
-                           typename boost::enable_if< boost::is_arithmetic< T >, T >::type * = 0);
-  template<typename T> 
-    void prevent_underflow(T &, 
-                           typename boost::disable_if< boost::is_arithmetic< T >, T >::type * = 0);
-};
    -
    -

    Description

    -

    Iterative calculation of sample variance is done as follows, see also http://en.wikipedia.org/wiki/Algorithms_for_calculating_variance. For a rolling window of size , for the first samples, the variance is computed according to the formula

    -
    -

    Equation 1.7. 

    -
    -
    -


    where the sum of squares can be recursively computed as:

    -
    -

    Equation 1.8. 

    -
    -
    -


    and the estimate of the sample mean as:

    -
    -

    Equation 1.9. 

    -
    -
    -


    For further samples, when the rolling window is fully filled with data, one has to take into account that the oldest sample is dropped from the window. The sample variance over the window now becomes:

    -
    -

    Equation 1.10. 

    -
    -
    -


    where the sum of squares now equals:

    -
    -

    Equation 1.11. 

    -
    -
    -


    and the estimated mean is:

    -
    -

    Equation 1.12. 

    -
    -
    -


    -

    Note that the sample variance is not defined for .

    -
    -

    -immediate_rolling_variance_impl - public - construct/copy/destruct

    -
    1. template<typename Args> immediate_rolling_variance_impl(Args const & args);
    -
    -
    -

    -immediate_rolling_variance_impl public member functions

    -
      -
    1. template<typename Args> void operator()(Args const & args);
      2. -
    2. template<typename Args> result_type result(Args const & args) const;
      3. -
    -
    -
    -

    -immediate_rolling_variance_impl private member functions

    -
      -
    1. template<typename T> 
-  void prevent_underflow(T & non_negative_number, 
-                         typename boost::enable_if< boost::is_arithmetic< T >, T >::type * = 0);
      2. -
    2. template<typename T> 
-  void prevent_underflow(T & non_arithmetic_quantity, 
-                         typename boost::disable_if< boost::is_arithmetic< T >, T >::type * = 0);
      3. -
    -
    -
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/impl/immediate_weig_idp66062928.html b/doc/html/boost/accumulators/impl/immediate_weig_idp66062928.html deleted file mode 100644 index 53b134a2ed..0000000000 --- a/doc/html/boost/accumulators/impl/immediate_weig_idp66062928.html +++ /dev/null @@ -1,76 +0,0 @@ - - - - -Struct template immediate_weighted_mean_impl - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template immediate_weighted_mean_impl

    -

    boost::accumulators::impl::immediate_weighted_mean_impl

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample, typename Weight, typename Tag> 
-struct immediate_weighted_mean_impl : public accumulator_base {
-  // construct/copy/destruct
-  template<typename Args> immediate_weighted_mean_impl(Args const &);
-
-  // public member functions
-  template<typename Args> void operator()(Args const &);
-  result_type result(dont_care) const;
-};
    -
    -

    Description

    -
    -

    -immediate_weighted_mean_impl - public - construct/copy/destruct

    -
    1. template<typename Args> immediate_weighted_mean_impl(Args const & args);
    -
    -
    -

    -immediate_weighted_mean_impl public member functions

    -
      -
    1. template<typename Args> void operator()(Args const & args);
      2. -
    2. result_type result(dont_care) const;
      3. -
    -
    -
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/impl/kurtosis_impl.html b/doc/html/boost/accumulators/impl/kurtosis_impl.html deleted file mode 100644 index d0339dd1a9..0000000000 --- a/doc/html/boost/accumulators/impl/kurtosis_impl.html +++ /dev/null @@ -1,79 +0,0 @@ - - - - -Struct template kurtosis_impl - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template kurtosis_impl

    -

    boost::accumulators::impl::kurtosis_impl — Kurtosis estimation.

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample> 
-struct kurtosis_impl : public accumulator_base {
-  // construct/copy/destruct
-  kurtosis_impl(dont_care);
-
-  // public member functions
-  template<typename Args> result_type result(Args const &) const;
-};
    -
    -

    Description

    -

    The kurtosis of a sample distribution is defined as the ratio of the 4th central moment and the square of the 2nd central moment (the variance) of the samples, minus 3. The term is added in order to ensure that the normal distribution has zero kurtosis. The kurtosis can also be expressed by the simple moments:

    -
    -

    Equation 1.18. 

    -
    -
    -


    -

    where are the -th moment and the mean (first moment) of the samples.

    -
    -

    -kurtosis_impl - public - construct/copy/destruct

    -
    1. kurtosis_impl(dont_care);
    -
    -
    -

    -kurtosis_impl public member functions

    -
    1. template<typename Args> result_type result(Args const & args) const;
    -
    -
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/impl/lazy_rolling_mean_impl.html b/doc/html/boost/accumulators/impl/lazy_rolling_mean_impl.html deleted file mode 100644 index ee8154e10e..0000000000 --- a/doc/html/boost/accumulators/impl/lazy_rolling_mean_impl.html +++ /dev/null @@ -1,75 +0,0 @@ - - - - -Struct template lazy_rolling_mean_impl - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template lazy_rolling_mean_impl

    -

    boost::accumulators::impl::lazy_rolling_mean_impl

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/rolling_mean.hpp>
-
-template<typename Sample> 
-struct lazy_rolling_mean_impl : public accumulator_base {
-  // types
-  typedef numeric::functional::fdiv< Sample, std::size_t, void, void >::result_type result_type;
-
-  // construct/copy/destruct
-  lazy_rolling_mean_impl(dont_care);
-
-  // public member functions
-  template<typename Args> result_type result(Args const &) const;
-};
    -
    -

    Description

    -
    -

    -lazy_rolling_mean_impl - public - construct/copy/destruct

    -
    1. lazy_rolling_mean_impl(dont_care);
    -
    -
    -

    -lazy_rolling_mean_impl public member functions

    -
    1. template<typename Args> result_type result(Args const & args) const;
    -
    -
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/impl/lazy_rolling_variance_impl.html b/doc/html/boost/accumulators/impl/lazy_rolling_variance_impl.html deleted file mode 100644 index 0b9f6b143a..0000000000 --- a/doc/html/boost/accumulators/impl/lazy_rolling_variance_impl.html +++ /dev/null @@ -1,86 +0,0 @@ - - - - -Struct template lazy_rolling_variance_impl - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template lazy_rolling_variance_impl

    -

    boost::accumulators::impl::lazy_rolling_variance_impl — Immediate (lazy) calculation of the rolling variance.

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/rolling_variance.hpp>
-
-template<typename Sample> 
-struct lazy_rolling_variance_impl : public accumulator_base {
-  // types
-  typedef numeric::functional::fdiv< Sample, std::size_t, void, void >::result_type result_type;
-
-  // construct/copy/destruct
-  lazy_rolling_variance_impl(dont_care);
-
-  // public member functions
-  template<typename Args> result_type result(Args const &) const;
-};
    -
    -

    Description

    -

    Calculation of sample variance is done as follows, see also http://en.wikipedia.org/wiki/Algorithms_for_calculating_variance. For a rolling window of size , when , the variance is computed according to the formula

    -
    -

    Equation 1.13. 

    -
    -
    -


    When , the sample variance over the window becomes:

    -
    -

    Equation 1.14. 

    -
    -
    -


    -
    -

    -lazy_rolling_variance_impl - public - construct/copy/destruct

    -
    1. lazy_rolling_variance_impl(dont_care);
    -
    -
    -

    -lazy_rolling_variance_impl public member functions

    -
    1. template<typename Args> result_type result(Args const & args) const;
    -
    -
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/impl/lazy_variance_impl.html b/doc/html/boost/accumulators/impl/lazy_variance_impl.html deleted file mode 100644 index e4ef7ae682..0000000000 --- a/doc/html/boost/accumulators/impl/lazy_variance_impl.html +++ /dev/null @@ -1,83 +0,0 @@ - - - - -Struct template lazy_variance_impl - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template lazy_variance_impl

    -

    boost::accumulators::impl::lazy_variance_impl — Lazy calculation of variance.

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample, typename MeanFeature> 
-struct lazy_variance_impl : public accumulator_base {
-  // construct/copy/destruct
-  lazy_variance_impl(dont_care);
-
-  // public member functions
-  template<typename Args> result_type result(Args const &) const;
-};
    -
    -

    Description

    -

    Default sample variance implementation based on the second moment moment<2>, mean and count.

    -
    -

    Equation 1.19. 

    -
    -
    -


    where

    -
    -

    Equation 1.20. 

    -
    -
    -


    is the estimate of the sample mean and is the number of samples.

    -
    -

    -lazy_variance_impl - public - construct/copy/destruct

    -
    1. lazy_variance_impl(dont_care);
    -
    -
    -

    -lazy_variance_impl public member functions

    -
    1. template<typename Args> result_type result(Args const & args) const;
    -
    -
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/impl/lazy_weighted__idp66114016.html b/doc/html/boost/accumulators/impl/lazy_weighted__idp66114016.html deleted file mode 100644 index 24c6070fb0..0000000000 --- a/doc/html/boost/accumulators/impl/lazy_weighted__idp66114016.html +++ /dev/null @@ -1,78 +0,0 @@ - - - - -Struct template lazy_weighted_variance_impl - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template lazy_weighted_variance_impl

    -

    boost::accumulators::impl::lazy_weighted_variance_impl — Lazy calculation of variance of weighted samples.

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample, typename Weight, typename MeanFeature> 
-struct lazy_weighted_variance_impl : public accumulator_base {
-  // construct/copy/destruct
-  lazy_weighted_variance_impl(dont_care);
-
-  // public member functions
-  template<typename Args> result_type result(Args const &) const;
-};
    -
    -

    Description

    -

    The default implementation of the variance of weighted samples is based on the second moment (weighted_moment<2>) and the mean (weighted_mean):

    -
    -

    Equation 1.21. 

    -
    -
    -


    where is the number of samples.

    -
    -

    -lazy_weighted_variance_impl - public - construct/copy/destruct

    -
    1. lazy_weighted_variance_impl(dont_care);
    -
    -
    -

    -lazy_weighted_variance_impl public member functions

    -
    1. template<typename Args> result_type result(Args const & args) const;
    -
    -
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/impl/max_impl.html b/doc/html/boost/accumulators/impl/max_impl.html deleted file mode 100644 index 991f769fa5..0000000000 --- a/doc/html/boost/accumulators/impl/max_impl.html +++ /dev/null @@ -1,76 +0,0 @@ - - - - -Struct template max_impl - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template max_impl

    -

    boost::accumulators::impl::max_impl

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample> 
-struct max_impl : public accumulator_base {
-  // construct/copy/destruct
-  template<typename Args> max_impl(Args const &);
-
-  // public member functions
-  template<typename Args> void operator()(Args const &);
-  result_type result(dont_care) const;
-};
    -
    -

    Description

    -
    -

    -max_impl - public - construct/copy/destruct

    -
    1. template<typename Args> max_impl(Args const & args);
    -
    -
    -

    -max_impl public member functions

    -
      -
    1. template<typename Args> void operator()(Args const & args);
      2. -
    2. result_type result(dont_care) const;
      3. -
    -
    -
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/impl/mean_impl.html b/doc/html/boost/accumulators/impl/mean_impl.html deleted file mode 100644 index f7e912c5f7..0000000000 --- a/doc/html/boost/accumulators/impl/mean_impl.html +++ /dev/null @@ -1,72 +0,0 @@ - - - - -Struct template mean_impl - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template mean_impl

    -

    boost::accumulators::impl::mean_impl

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample, typename SumFeature> 
-struct mean_impl : public accumulator_base {
-  // construct/copy/destruct
-  mean_impl(dont_care);
-
-  // public member functions
-  template<typename Args> result_type result(Args const &) const;
-};
    -
    -

    Description

    -
    -

    -mean_impl - public - construct/copy/destruct

    -
    1. mean_impl(dont_care);
    -
    -
    -

    -mean_impl public member functions

    -
    1. template<typename Args> result_type result(Args const & args) const;
    -
    -
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/impl/median_impl.html b/doc/html/boost/accumulators/impl/median_impl.html deleted file mode 100644 index 9ab8c4cbbd..0000000000 --- a/doc/html/boost/accumulators/impl/median_impl.html +++ /dev/null @@ -1,73 +0,0 @@ - - - - -Struct template median_impl - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template median_impl

    -

    boost::accumulators::impl::median_impl — Median estimation based on the quantile estimator.

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample> 
-struct median_impl : public accumulator_base {
-  // construct/copy/destruct
-  median_impl(dont_care);
-
-  // public member functions
-  template<typename Args> result_type result(Args const &) const;
-};
    -
    -

    Description

    -

    The algorithm is invoked with a quantile probability of 0.5.

    -
    -

    -median_impl - public - construct/copy/destruct

    -
    1. median_impl(dont_care);
    -
    -
    -

    -median_impl public member functions

    -
    1. template<typename Args> result_type result(Args const & args) const;
    -
    -
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/impl/min_impl.html b/doc/html/boost/accumulators/impl/min_impl.html deleted file mode 100644 index f9ea630ab5..0000000000 --- a/doc/html/boost/accumulators/impl/min_impl.html +++ /dev/null @@ -1,76 +0,0 @@ - - - - -Struct template min_impl - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template min_impl

    -

    boost::accumulators::impl::min_impl

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample> 
-struct min_impl : public accumulator_base {
-  // construct/copy/destruct
-  template<typename Args> min_impl(Args const &);
-
-  // public member functions
-  template<typename Args> void operator()(Args const &);
-  result_type result(dont_care) const;
-};
    -
    -

    Description

    -
    -

    -min_impl - public - construct/copy/destruct

    -
    1. template<typename Args> min_impl(Args const & args);
    -
    -
    -

    -min_impl public member functions

    -
      -
    1. template<typename Args> void operator()(Args const & args);
      2. -
    2. result_type result(dont_care) const;
      3. -
    -
    -
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/impl/moment_impl.html b/doc/html/boost/accumulators/impl/moment_impl.html deleted file mode 100644 index c8997264ab..0000000000 --- a/doc/html/boost/accumulators/impl/moment_impl.html +++ /dev/null @@ -1,78 +0,0 @@ - - - - -Struct template moment_impl - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template moment_impl

    -

    boost::accumulators::impl::moment_impl

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename N, typename Sample> 
-struct moment_impl : public accumulator_base {
-  // construct/copy/destruct
-  template<typename Args> moment_impl(Args const &);
-
-  // public member functions
-   BOOST_MPL_ASSERT_RELATION(N::value, 0);
-  template<typename Args> void operator()(Args const &);
-  template<typename Args> result_type result(Args const &) const;
-};
    -
    -

    Description

    -
    -

    -moment_impl - public - construct/copy/destruct

    -
    1. template<typename Args> moment_impl(Args const & args);
    -
    -
    -

    -moment_impl public member functions

    -
      -
    1.  BOOST_MPL_ASSERT_RELATION(N::value, 0);
      2. -
    2. template<typename Args> void operator()(Args const & args);
      3. -
    3. template<typename Args> result_type result(Args const & args) const;
      4. -
    -
    -
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/impl/non_coherent_t_idp66180304.html b/doc/html/boost/accumulators/impl/non_coherent_t_idp66180304.html deleted file mode 100644 index fe81d287fe..0000000000 --- a/doc/html/boost/accumulators/impl/non_coherent_t_idp66180304.html +++ /dev/null @@ -1,86 +0,0 @@ - - - - -Struct template non_coherent_tail_mean_impl - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template non_coherent_tail_mean_impl

    -

    boost::accumulators::impl::non_coherent_tail_mean_impl — Estimation of the (non-coherent) tail mean based on order statistics (for both left and right tails)

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample, typename LeftRight> 
-struct non_coherent_tail_mean_impl : public accumulator_base {
-  // construct/copy/destruct
-  non_coherent_tail_mean_impl(dont_care);
-
-  // public member functions
-  template<typename Args> result_type result(Args const &) const;
-};
    -
    -

    Description

    -

    An estimation of the non-coherent tail mean is given by the mean of the smallest samples (left tail) or the mean of the largest samples (right tail), being the total number of samples and the quantile level:

    -
    -

    Equation 1.22. 

    -
    -
    -


    -
    -

    Equation 1.23. 

    -
    -
    -


    -

    It thus requires the caching of at least the smallest or the largest samples.

    -

    -

    -
    -

    -non_coherent_tail_mean_impl - public - construct/copy/destruct

    -
    1. non_coherent_tail_mean_impl(dont_care);
    -
    -
    -

    -non_coherent_tail_mean_impl public member functions

    -
    1. template<typename Args> result_type result(Args const & args) const;
    -
    -
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/impl/non_coherent_w_idp66212144.html b/doc/html/boost/accumulators/impl/non_coherent_w_idp66212144.html deleted file mode 100644 index 04576c8022..0000000000 --- a/doc/html/boost/accumulators/impl/non_coherent_w_idp66212144.html +++ /dev/null @@ -1,97 +0,0 @@ - - - - -Struct template non_coherent_weighted_tail_mean_impl - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template non_coherent_weighted_tail_mean_impl

    -

    boost::accumulators::impl::non_coherent_weighted_tail_mean_impl — Estimation of the (non-coherent) weighted tail mean based on order statistics (for both left and right tails)

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample, typename Weight, typename LeftRight> 
-struct non_coherent_weighted_tail_mean_impl : public accumulator_base {
-  // construct/copy/destruct
-  non_coherent_weighted_tail_mean_impl(dont_care);
-
-  // public member functions
-  template<typename Args> result_type result(Args const &) const;
-};
    -
    -

    Description

    -

    An estimation of the non-coherent, weighted tail mean is given by the weighted mean of the

    -
    -

    Equation 1.24. 

    -
    -
    -


    -

    smallest samples (left tail) or the weighted mean of the

    -
    -

    Equation 1.25. 

    -
    -
    -


    -

    largest samples (right tail) above a quantile of level , being the total number of sample and the sum of all weights:

    -
    -

    Equation 1.26. 

    -
    -
    -


    -
    -

    Equation 1.27. 

    -
    -
    -


    -

    -

    -
    -

    -non_coherent_weighted_tail_mean_impl - public - construct/copy/destruct

    -
    1. non_coherent_weighted_tail_mean_impl(dont_care);
    -
    -
    -

    -non_coherent_weighted_tail_mean_impl public member functions

    -
    1. template<typename Args> result_type result(Args const & args) const;
    -
    -
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/impl/p_square_cumul_idp66248320.html b/doc/html/boost/accumulators/impl/p_square_cumul_idp66248320.html deleted file mode 100644 index b8bbc27ba2..0000000000 --- a/doc/html/boost/accumulators/impl/p_square_cumul_idp66248320.html +++ /dev/null @@ -1,82 +0,0 @@ - - - - -Struct template p_square_cumulative_distribution_impl - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template p_square_cumulative_distribution_impl

    -

    boost::accumulators::impl::p_square_cumulative_distribution_impl — Histogram calculation of the cumulative distribution with the algorithm.

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample> 
-struct p_square_cumulative_distribution_impl : public accumulator_base {
-  // construct/copy/destruct
-  template<typename Args> p_square_cumulative_distribution_impl(Args const &);
-
-  // public member functions
-  template<typename Args> void operator()(Args const &);
-  template<typename Args> result_type result(Args const &) const;
-};
    -
    -

    Description

    -

    A histogram of the sample cumulative distribution is computed dynamically without storing samples based on the algorithm. The returned histogram has a specifiable amount (num_cells) equiprobable (and not equal-sized) cells.

    -

    For further details, see

    -

    R. Jain and I. Chlamtac, The P^2 algorithm for dynamic calculation of quantiles and histograms without storing observations, Communications of the ACM, Volume 28 (October), Number 10, 1985, p. 1076-1085.

    -

    -

    -
    -

    -p_square_cumulative_distribution_impl - public - construct/copy/destruct

    -
    1. template<typename Args> 
-  p_square_cumulative_distribution_impl(Args const & args);
    -
    -
    -

    -p_square_cumulative_distribution_impl public member functions

    -
      -
    1. template<typename Args> void operator()(Args const & args);
      2. -
    2. template<typename Args> result_type result(Args const & args) const;
      3. -
    -
    -
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/impl/p_square_quantile_impl.html b/doc/html/boost/accumulators/impl/p_square_quantile_impl.html deleted file mode 100644 index f4e546bb1a..0000000000 --- a/doc/html/boost/accumulators/impl/p_square_quantile_impl.html +++ /dev/null @@ -1,81 +0,0 @@ - - - - -Struct template p_square_quantile_impl - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template p_square_quantile_impl

    -

    boost::accumulators::impl::p_square_quantile_impl — Single quantile estimation with the algorithm.

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample, typename Impl> 
-struct p_square_quantile_impl : public accumulator_base {
-  // construct/copy/destruct
-  template<typename Args> p_square_quantile_impl(Args const &);
-
-  // public member functions
-  template<typename Args> void operator()(Args const &);
-  result_type result(dont_care) const;
-};
    -
    -

    Description

    -

    The algorithm estimates a quantile dynamically without storing samples. Instead of storing the whole sample cumulative distribution, only five points (markers) are stored. The heights of these markers are the minimum and the maximum of the samples and the current estimates of the -, - and -quantiles. Their positions are equal to the number of samples that are smaller or equal to the markers. Each time a new samples is recorded, the positions of the markers are updated and if necessary their heights are adjusted using a piecewise- parabolic formula.

    -

    For further details, see

    -

    R. Jain and I. Chlamtac, The P^2 algorithm for dynamic calculation of quantiles and histograms without storing observations, Communications of the ACM, Volume 28 (October), Number 10, 1985, p. 1076-1085.

    -

    -

    -
    -

    -p_square_quantile_impl - public - construct/copy/destruct

    -
    1. template<typename Args> p_square_quantile_impl(Args const & args);
    -
    -
    -

    -p_square_quantile_impl public member functions

    -
      -
    1. template<typename Args> void operator()(Args const & args);
      2. -
    2. result_type result(dont_care) const;
      3. -
    -
    -
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/impl/peaks_over_thr_idp66288512.html b/doc/html/boost/accumulators/impl/peaks_over_thr_idp66288512.html deleted file mode 100644 index e55bb16469..0000000000 --- a/doc/html/boost/accumulators/impl/peaks_over_thr_idp66288512.html +++ /dev/null @@ -1,81 +0,0 @@ - - - - -Struct template peaks_over_threshold_prob_impl - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template peaks_over_threshold_prob_impl

    -

    boost::accumulators::impl::peaks_over_threshold_prob_impl — Peaks over Threshold Method for Quantile and Tail Mean Estimation.

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample, typename LeftRight> 
-struct peaks_over_threshold_prob_impl : public accumulator_base {
-  // construct/copy/destruct
-  template<typename Args> peaks_over_threshold_prob_impl(Args const &);
-
-  // public member functions
-  void operator()(dont_care);
-  template<typename Args> result_type result(Args const &) const;
-};
    -
    -

    Description

    -

    See Also:

    -

    peaks_over_threshold_impl

    -

    - -

    -
    -

    -peaks_over_threshold_prob_impl - public - construct/copy/destruct

    -
    1. template<typename Args> peaks_over_threshold_prob_impl(Args const & args);
    -
    -
    -

    -peaks_over_threshold_prob_impl public member functions

    -
      -
    1. void operator()(dont_care);
      2. -
    2. template<typename Args> result_type result(Args const & args) const;
      3. -
    -
    -
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/impl/peaks_over_threshold_impl.html b/doc/html/boost/accumulators/impl/peaks_over_threshold_impl.html deleted file mode 100644 index 927a61acd7..0000000000 --- a/doc/html/boost/accumulators/impl/peaks_over_threshold_impl.html +++ /dev/null @@ -1,118 +0,0 @@ - - - - -Struct template peaks_over_threshold_impl - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template peaks_over_threshold_impl

    -

    boost::accumulators::impl::peaks_over_threshold_impl — Peaks over Threshold Method for Quantile and Tail Mean Estimation.

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics/peaks_over_threshold.hpp>
-
-template<typename Sample, typename LeftRight> 
-struct peaks_over_threshold_impl : public accumulator_base {
-  // types
-  typedef numeric::functional::fdiv< Sample, std::size_t >::result_type float_type; 
-  typedef boost::tuple< float_type, float_type, float_type >            result_type;
-  typedef mpl::int_< is_same< LeftRight, left >::value?-1:1 >           sign;       
-
-  // construct/copy/destruct
-  template<typename Args> peaks_over_threshold_impl(Args const &);
-
-  // public member functions
-  template<typename Args> void operator()(Args const &);
-  template<typename Args> result_type result(Args const &) const;
-};
    -
    -

    Description

    -

    According to the theorem of Pickands-Balkema-de Haan, the distribution function of the excesses over some sufficiently high threshold of a distribution function may be approximated by a generalized Pareto distribution

    -
    -

    Equation 1.1. 

    -
    -
    -


    with suitable parameters and that can be estimated, e.g., with the method of moments, cf. Hosking and Wallis (1987),

    -
    -

    Equation 1.2. 

    -
    -
    -


    and being the empirical mean and variance of the samples over the threshold . Equivalently, the distribution function of the exceedances can be approximated by . Since for the distribution function can be written as

    -
    -

    Equation 1.3. 

    -
    -
    -


    and the probability can be approximated by the empirical distribution function evaluated at , an estimator of is given by

    -
    -

    Equation 1.4. 

    -
    -
    -


    It can be shown that is a generalized Pareto distribution with and . By inverting , one obtains an estimator for the -quantile,

    -
    -

    Equation 1.5. 

    -
    -
    -


    and similarly an estimator for the (coherent) tail mean,

    -
    -

    Equation 1.6. 

    -
    -
    -


    cf. McNeil and Frey (2000).

    -

    Note that in case extreme values of the left tail are fitted, the distribution is mirrored with respect to the axis such that the left tail can be treated as a right tail. The computed fit parameters thus define the Pareto distribution that fits the mirrored left tail. When quantities like a quantile or a tail mean are computed using the fit parameters obtained from the mirrored data, the result is mirrored back, yielding the correct result.

    -

    For further details, see

    -

    J. R. M. Hosking and J. R. Wallis, Parameter and quantile estimation for the generalized Pareto distribution, Technometrics, Volume 29, 1987, p. 339-349

    -

    A. J. McNeil and R. Frey, Estimation of Tail-Related Risk Measures for Heteroscedastic Financial Time Series: an Extreme Value Approach, Journal of Empirical Finance, Volume 7, 2000, p. 271-300

    -

    -

    -
    -

    -peaks_over_threshold_impl - public - construct/copy/destruct

    -
    1. template<typename Args> peaks_over_threshold_impl(Args const & args);
    -
    -
    -

    -peaks_over_threshold_impl public member functions

    -
      -
    1. template<typename Args> void operator()(Args const & args);
      2. -
    2. template<typename Args> result_type result(Args const & args) const;
      3. -
    -
    -
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/impl/pot_quantile_impl.html b/doc/html/boost/accumulators/impl/pot_quantile_impl.html deleted file mode 100644 index 9ac35bf421..0000000000 --- a/doc/html/boost/accumulators/impl/pot_quantile_impl.html +++ /dev/null @@ -1,78 +0,0 @@ - - - - -Struct template pot_quantile_impl - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template pot_quantile_impl

    -

    boost::accumulators::impl::pot_quantile_impl — Quantile Estimation based on Peaks over Threshold Method (for both left and right tails)

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample, typename Impl, typename LeftRight> 
-struct pot_quantile_impl : public accumulator_base {
-  // construct/copy/destruct
-  pot_quantile_impl(dont_care);
-
-  // public member functions
-  template<typename Args> result_type result(Args const &) const;
-};
    -
    -

    Description

    -

    Computes an estimate

    -
    -

    Equation 1.28. 

    -
    -
    -


    for a right or left extreme quantile, , and being the parameters of the generalized Pareto distribution that approximates the right tail of the distribution (or the mirrored left tail, in case the left tail is used). In the latter case, the result is mirrored back, yielding the correct result.

    -
    -

    -pot_quantile_impl - public - construct/copy/destruct

    -
    1. pot_quantile_impl(dont_care);
    -
    -
    -

    -pot_quantile_impl public member functions

    -
    1. template<typename Args> result_type result(Args const & args) const;
    -
    -
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/impl/pot_tail_mean_impl.html b/doc/html/boost/accumulators/impl/pot_tail_mean_impl.html deleted file mode 100644 index 21f6ecc324..0000000000 --- a/doc/html/boost/accumulators/impl/pot_tail_mean_impl.html +++ /dev/null @@ -1,78 +0,0 @@ - - - - -Struct template pot_tail_mean_impl - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template pot_tail_mean_impl

    -

    boost::accumulators::impl::pot_tail_mean_impl — Estimation of the (coherent) tail mean based on the peaks over threshold method (for both left and right tails)

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample, typename Impl, typename LeftRight> 
-struct pot_tail_mean_impl : public accumulator_base {
-  // construct/copy/destruct
-  pot_tail_mean_impl(dont_care);
-
-  // public member functions
-  template<typename Args> result_type result(Args const &) const;
-};
    -
    -

    Description

    -

    Computes an estimate for the (coherent) tail mean

    -
    -

    Equation 1.29. 

    -
    -
    -


    where , and are the parameters of the generalized Pareto distribution that approximates the right tail of the distribution (or the mirrored left tail, in case the left tail is used). In the latter case, the result is mirrored back, yielding the correct result.

    -
    -

    -pot_tail_mean_impl - public - construct/copy/destruct

    -
    1. pot_tail_mean_impl(dont_care);
    -
    -
    -

    -pot_tail_mean_impl public member functions

    -
    1. template<typename Args> result_type result(Args const & args) const;
    -
    -
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/accumulators/impl/reference_accumulator_impl.html b/doc/html/boost/accumulators/impl/reference_accumulator_impl.html index 9fdc8fd5ff..f7c0fd9ce1 100644 --- a/doc/html/boost/accumulators/impl/reference_accumulator_impl.html +++ b/doc/html/boost/accumulators/impl/reference_accumulator_impl.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -40,24 +40,24 @@ typedef Referent & result_type; // construct/copy/destruct - template<typename Args> reference_accumulator_impl(Args const &); + template<typename Args> reference_accumulator_impl(Args const &); - // public member functions - result_type result(dont_care) const; + // public member functions + result_type result(dont_care) const; };
    -

    Description

    +

    Description

    -

    +

    reference_accumulator_impl public construct/copy/destruct

    -
    1. template<typename Args> reference_accumulator_impl(Args const & args);
    +
    1. template<typename Args> reference_accumulator_impl(Args const & args);
    -

    -reference_accumulator_impl public member functions

    -
    1. result_type result(dont_care) const;
    +

    +reference_accumulator_impl public member functions

    +
    1. result_type result(dont_care) const;
@@ -71,7 +71,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/boost/accumulators/impl/rolling_count_impl.html b/doc/html/boost/accumulators/impl/rolling_count_impl.html deleted file mode 100644 index 0aacdc1670..0000000000 --- a/doc/html/boost/accumulators/impl/rolling_count_impl.html +++ /dev/null @@ -1,72 +0,0 @@ - - - - -Struct template rolling_count_impl - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template rolling_count_impl

-

boost::accumulators::impl::rolling_count_impl

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample> 
-struct rolling_count_impl : public accumulator_base {
-  // construct/copy/destruct
-  rolling_count_impl(dont_care);
-
-  // public member functions
-  template<typename Args> result_type result(Args const &) const;
-};
-
-

Description

-
-

-rolling_count_impl - public - construct/copy/destruct

-
  1. rolling_count_impl(dont_care);
-
-
-

-rolling_count_impl public member functions

-
  1. template<typename Args> result_type result(Args const & args) const;
-
-
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/impl/rolling_mean_impl.html b/doc/html/boost/accumulators/impl/rolling_mean_impl.html deleted file mode 100644 index 07b7783ce6..0000000000 --- a/doc/html/boost/accumulators/impl/rolling_mean_impl.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct template rolling_mean_impl - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template rolling_mean_impl

-

boost::accumulators::impl::rolling_mean_impl

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample> 
-struct rolling_mean_impl {
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/impl/rolling_moment_impl.html b/doc/html/boost/accumulators/impl/rolling_moment_impl.html deleted file mode 100644 index 761d9a03a0..0000000000 --- a/doc/html/boost/accumulators/impl/rolling_moment_impl.html +++ /dev/null @@ -1,81 +0,0 @@ - - - - -Struct template rolling_moment_impl - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template rolling_moment_impl

-

boost::accumulators::impl::rolling_moment_impl

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/rolling_moment.hpp>
-
-template<typename N, typename Sample> 
-struct rolling_moment_impl : public accumulator_base {
-  // types
-  typedef numeric::functional::fdiv< Sample, std::size_t, void, void >::result_type result_type;
-
-  // construct/copy/destruct
-  template<typename Args> rolling_moment_impl(Args const &);
-
-  // public member functions
-   BOOST_MPL_ASSERT_RELATION(N::value, 0);
-  template<typename Args> void operator()(Args const &);
-  template<typename Args> result_type result(Args const &) const;
-};
-
-

Description

-
-

-rolling_moment_impl - public - construct/copy/destruct

-
  1. template<typename Args> rolling_moment_impl(Args const & args);
-
-
-

-rolling_moment_impl public member functions

-
    -
  1.  BOOST_MPL_ASSERT_RELATION(N::value, 0);
    2. -
  2. template<typename Args> void operator()(Args const & args);
    3. -
  3. template<typename Args> result_type result(Args const & args) const;
    4. -
-
-
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/impl/rolling_sum_impl.html b/doc/html/boost/accumulators/impl/rolling_sum_impl.html deleted file mode 100644 index 513c196c6a..0000000000 --- a/doc/html/boost/accumulators/impl/rolling_sum_impl.html +++ /dev/null @@ -1,76 +0,0 @@ - - - - -Struct template rolling_sum_impl - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template rolling_sum_impl

-

boost::accumulators::impl::rolling_sum_impl

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample> 
-struct rolling_sum_impl : public accumulator_base {
-  // construct/copy/destruct
-  template<typename Args> rolling_sum_impl(Args const &);
-
-  // public member functions
-  template<typename Args> void operator()(Args const &);
-  template<typename Args> result_type result(Args const &) const;
-};
-
-

Description

-
-

-rolling_sum_impl - public - construct/copy/destruct

-
  1. template<typename Args> rolling_sum_impl(Args const & args);
-
-
-

-rolling_sum_impl public member functions

-
    -
  1. template<typename Args> void operator()(Args const & args);
    2. -
  2. template<typename Args> result_type result(Args const &) const;
    3. -
-
-
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/impl/rolling_window_impl.html b/doc/html/boost/accumulators/impl/rolling_window_impl.html deleted file mode 100644 index 5b7bd8bbb5..0000000000 --- a/doc/html/boost/accumulators/impl/rolling_window_impl.html +++ /dev/null @@ -1,72 +0,0 @@ - - - - -Struct template rolling_window_impl - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template rolling_window_impl

-

boost::accumulators::impl::rolling_window_impl

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample> 
-struct rolling_window_impl : public accumulator_base {
-  // construct/copy/destruct
-  rolling_window_impl(dont_care);
-
-  // public member functions
-  template<typename Args> result_type result(Args const &) const;
-};
-
-

Description

-
-

-rolling_window_impl - public - construct/copy/destruct

-
  1. rolling_window_impl(dont_care);
-
-
-

-rolling_window_impl public member functions

-
  1. template<typename Args> result_type result(Args const & args) const;
-
-
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/impl/rolling_window_plus1_impl.html b/doc/html/boost/accumulators/impl/rolling_window_plus1_impl.html deleted file mode 100644 index 006d473b46..0000000000 --- a/doc/html/boost/accumulators/impl/rolling_window_plus1_impl.html +++ /dev/null @@ -1,84 +0,0 @@ - - - - -Struct template rolling_window_plus1_impl - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template rolling_window_plus1_impl

-

boost::accumulators::impl::rolling_window_plus1_impl

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample> 
-struct rolling_window_plus1_impl : public accumulator_base {
-  // construct/copy/destruct
-  template<typename Args> rolling_window_plus1_impl(Args const &);
-  rolling_window_plus1_impl(rolling_window_plus1_impl const &);
-  rolling_window_plus1_impl & operator=(rolling_window_plus1_impl const &);
-
-  // public member functions
-  template<typename Args> void operator()(Args const &);
-  bool full() const;
-  result_type result(dont_care) const;
-};
-
-

Description

-
-

-rolling_window_plus1_impl - public - construct/copy/destruct

-
    -
  1. template<typename Args> rolling_window_plus1_impl(Args const & args);
    2. -
  2. rolling_window_plus1_impl(rolling_window_plus1_impl const & that);
    3. -
  3. rolling_window_plus1_impl & operator=(rolling_window_plus1_impl const & that);
    4. -
-
-
-

-rolling_window_plus1_impl public member functions

-
    -
  1. template<typename Args> void operator()(Args const & args);
    2. -
  2. bool full() const;
    3. -
  3. result_type result(dont_care) const;
    4. -
-
-
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/impl/skewness_impl.html b/doc/html/boost/accumulators/impl/skewness_impl.html deleted file mode 100644 index 8ec1f4d888..0000000000 --- a/doc/html/boost/accumulators/impl/skewness_impl.html +++ /dev/null @@ -1,79 +0,0 @@ - - - - -Struct template skewness_impl - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template skewness_impl

-

boost::accumulators::impl::skewness_impl — Skewness estimation.

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample> 
-struct skewness_impl : public accumulator_base {
-  // construct/copy/destruct
-  skewness_impl(dont_care);
-
-  // public member functions
-  template<typename Args> result_type result(Args const &) const;
-};
-
-

Description

-

The skewness of a sample distribution is defined as the ratio of the 3rd central moment and the -th power of the 2nd central moment (the variance) of the samples 3. The skewness can also be expressed by the simple moments:

-
-

Equation 1.30. 

-
-
-


-

where are the -th moment and the mean (first moment) of the samples.

-
-

-skewness_impl - public - construct/copy/destruct

-
  1. skewness_impl(dont_care);
-
-
-

-skewness_impl public member functions

-
  1. template<typename Args> result_type result(Args const & args) const;
-
-
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/impl/sum_impl.html b/doc/html/boost/accumulators/impl/sum_impl.html deleted file mode 100644 index b2a450ea02..0000000000 --- a/doc/html/boost/accumulators/impl/sum_impl.html +++ /dev/null @@ -1,76 +0,0 @@ - - - - -Struct template sum_impl - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template sum_impl

-

boost::accumulators::impl::sum_impl

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample, typename Tag> 
-struct sum_impl : public accumulator_base {
-  // construct/copy/destruct
-  template<typename Args> sum_impl(Args const &);
-
-  // public member functions
-  template<typename Args> void operator()(Args const &);
-  result_type result(dont_care) const;
-};
-
-

Description

-
-

-sum_impl - public - construct/copy/destruct

-
  1. template<typename Args> sum_impl(Args const & args);
-
-
-

-sum_impl public member functions

-
    -
  1. template<typename Args> void operator()(Args const & args);
    2. -
  2. result_type result(dont_care) const;
    3. -
-
-
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/impl/sum_kahan_impl.html b/doc/html/boost/accumulators/impl/sum_kahan_impl.html deleted file mode 100644 index a7704e81a4..0000000000 --- a/doc/html/boost/accumulators/impl/sum_kahan_impl.html +++ /dev/null @@ -1,78 +0,0 @@ - - - - -Struct template sum_kahan_impl - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template sum_kahan_impl

-

boost::accumulators::impl::sum_kahan_impl

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample, typename Tag> 
-struct sum_kahan_impl : public accumulator_base {
-  // construct/copy/destruct
-  template<typename Args> sum_kahan_impl(Args const &);
-
-  // public member functions
-  template<typename Args> void operator()(Args const &);
-  result_type result(dont_care) const;
-};
-
-

Description

-
-

-sum_kahan_impl - public - construct/copy/destruct

-
  1. -
    template<typename Args> sum_kahan_impl(Args const & args);
    Kahan summation algorithm.

    The Kahan summation algorithm reduces the numerical error obtained with standard sequential sum.

    -
-
-
-

-sum_kahan_impl public member functions

-
    -
  1. template<typename Args> void operator()(Args const & args);
    2. -
  2. result_type result(dont_care) const;
    3. -
-
-
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/impl/tail_impl.html b/doc/html/boost/accumulators/impl/tail_impl.html deleted file mode 100644 index 659ec1b0ab..0000000000 --- a/doc/html/boost/accumulators/impl/tail_impl.html +++ /dev/null @@ -1,90 +0,0 @@ - - - - -Struct template tail_impl - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template tail_impl

-

boost::accumulators::impl::tail_impl

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample, typename LeftRight> 
-struct tail_impl : public accumulator_base {
-  // construct/copy/destruct
-  template<typename Args> tail_impl(Args const &);
-  tail_impl(tail_impl const &);
-
-  // public member functions
-   BOOST_MPL_ASSERT((mpl::or_< is_same< LeftRight, right >, is_same< LeftRight, left > >));
-  template<typename Args> void operator()(Args const &);
-  result_type result(dont_care) const;
-
-  // private member functions
-  template<typename Args> void assign(Args const &, std::size_t);
-};
-
-

Description

-
-

-tail_impl - public - construct/copy/destruct

-
    -
  1. template<typename Args> tail_impl(Args const & args);
    2. -
  2. tail_impl(tail_impl const & that);
    3. -
-
-
-

-tail_impl public member functions

-
    -
  1.  BOOST_MPL_ASSERT((mpl::or_< is_same< LeftRight, right >, is_same< LeftRight, left > >));
    2. -
  2. template<typename Args> void operator()(Args const & args);
    3. -
  3. result_type result(dont_care) const;
    4. -
-
-
-

-tail_impl private member functions

-
  1. template<typename Args> void assign(Args const & args, std::size_t index);
-
-
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/impl/tail_quantile_impl.html b/doc/html/boost/accumulators/impl/tail_quantile_impl.html deleted file mode 100644 index fadce61296..0000000000 --- a/doc/html/boost/accumulators/impl/tail_quantile_impl.html +++ /dev/null @@ -1,80 +0,0 @@ - - - - -Struct template tail_quantile_impl - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template tail_quantile_impl

-

boost::accumulators::impl::tail_quantile_impl — Tail quantile estimation based on order statistics (for both left and right tails)

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample, typename LeftRight> 
-struct tail_quantile_impl : public accumulator_base {
-  // construct/copy/destruct
-  tail_quantile_impl(dont_care);
-
-  // public member functions
-  template<typename Args> result_type result(Args const &) const;
-};
-
-

Description

-

The estimation of a tail quantile with level based on order statistics requires the caching of at least the smallest or the largest samples, being the total number of samples. The largest of the smallest samples or the smallest of the largest samples provides an estimate for the quantile:

-
-

Equation 1.31. 

-
-
-


-

-

-
-

-tail_quantile_impl - public - construct/copy/destruct

-
  1. tail_quantile_impl(dont_care);
-
-
-

-tail_quantile_impl public member functions

-
  1. template<typename Args> result_type result(Args const & args) const;
-
-
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/impl/tail_variate_impl.html b/doc/html/boost/accumulators/impl/tail_variate_impl.html deleted file mode 100644 index 4ce19d2ac4..0000000000 --- a/doc/html/boost/accumulators/impl/tail_variate_impl.html +++ /dev/null @@ -1,84 +0,0 @@ - - - - -Struct template tail_variate_impl - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template tail_variate_impl

-

boost::accumulators::impl::tail_variate_impl

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename VariateType, typename VariateTag, typename LeftRight> 
-struct tail_variate_impl : public accumulator_base {
-  // construct/copy/destruct
-  template<typename Args> tail_variate_impl(Args const &);
-
-  // public member functions
-  template<typename Args> void assign(Args const &, std::size_t);
-  template<typename Args> result_type result(Args const &) const;
-
-  // private member functions
-  template<typename TailRng> result_type do_result(TailRng const &) const;
-};
-
-

Description

-
-

-tail_variate_impl - public - construct/copy/destruct

-
  1. template<typename Args> tail_variate_impl(Args const & args);
-
-
-

-tail_variate_impl public member functions

-
    -
  1. template<typename Args> void assign(Args const & args, std::size_t index);
    2. -
  2. template<typename Args> result_type result(Args const & args) const;
    3. -
-
-
-

-tail_variate_impl private member functions

-
  1. template<typename TailRng> result_type do_result(TailRng const & rng) const;
-
-
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/impl/tail_variate_means_impl.html b/doc/html/boost/accumulators/impl/tail_variate_means_impl.html deleted file mode 100644 index 136f8d144a..0000000000 --- a/doc/html/boost/accumulators/impl/tail_variate_means_impl.html +++ /dev/null @@ -1,94 +0,0 @@ - - - - -Struct template tail_variate_means_impl - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template tail_variate_means_impl

-

boost::accumulators::impl::tail_variate_means_impl — Estimation of the absolute and relative tail variate means (for both left and right tails)

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample, typename Impl, typename LeftRight, 
-         typename VariateTag> 
-struct tail_variate_means_impl : public accumulator_base {
-  // construct/copy/destruct
-  tail_variate_means_impl(dont_care);
-
-  // public member functions
-  template<typename Args> result_type result(Args const &) const;
-};
-
-

Description

-

For all -th variates associated to the largest samples (or the smallest samples in case of the left tail), the absolute tail means are computed and returned as an iterator range. Alternatively, the relative tail means are returned, which are the absolute tail means normalized with the (non-coherent) sample tail mean .

-
-

Equation 1.32. 

-
-
-


-
-

Equation 1.33. 

-
-
-


-
-

Equation 1.34. 

-
-
-


-
-

Equation 1.35. 

-
-
-


-
-

-tail_variate_means_impl - public - construct/copy/destruct

-
  1. tail_variate_means_impl(dont_care);
-
-
-

-tail_variate_means_impl public member functions

-
  1. template<typename Args> result_type result(Args const & args) const;
-
-
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/impl/value_accumulator_impl.html b/doc/html/boost/accumulators/impl/value_accumulator_impl.html index f39c93bb0c..714c2543e4 100644 --- a/doc/html/boost/accumulators/impl/value_accumulator_impl.html +++ b/doc/html/boost/accumulators/impl/value_accumulator_impl.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
-PrevUpHomeNext +PrevUpHomeNext
@@ -38,24 +38,24 @@ typedef ValueType result_type; // construct/copy/destruct - template<typename Args> value_accumulator_impl(Args const &); + template<typename Args> value_accumulator_impl(Args const &); - // public member functions - result_type result(dont_care) const; + // public member functions + result_type result(dont_care) const; };
-

Description

+

Description

-

+

value_accumulator_impl public construct/copy/destruct

-
  1. template<typename Args> value_accumulator_impl(Args const & args);
+
  1. template<typename Args> value_accumulator_impl(Args const & args);
-

-value_accumulator_impl public member functions

-
  1. result_type result(dont_care) const;
+

+value_accumulator_impl public member functions

+
  1. result_type result(dont_care) const;
@@ -69,7 +69,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/boost/accumulators/impl/variance_impl.html b/doc/html/boost/accumulators/impl/variance_impl.html deleted file mode 100644 index 96d671d6a2..0000000000 --- a/doc/html/boost/accumulators/impl/variance_impl.html +++ /dev/null @@ -1,99 +0,0 @@ - - - - -Struct template variance_impl - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template variance_impl

-

boost::accumulators::impl::variance_impl — Iterative calculation of variance.

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample, typename MeanFeature, typename Tag> 
-struct variance_impl : public accumulator_base {
-  // construct/copy/destruct
-  template<typename Args> variance_impl(Args const &);
-
-  // public member functions
-  template<typename Args> void operator()(Args const &);
-  result_type result(dont_care) const;
-};
-
-

Description

-

Iterative calculation of sample variance according to the formula

-
-

Equation 1.36. 

-
-
-


where

-
-

Equation 1.37. 

-
-
-


is the estimate of the sample mean and is the number of samples.

-

Note that the sample variance is not defined for .

-

A simplification can be obtained by the approximate recursion

-
-

Equation 1.38. 

-
-
-


because the difference

-
-

Equation 1.39. 

-
-
-


converges to zero as . However, for small the difference can be non-negligible.

-
-

-variance_impl - public - construct/copy/destruct

-
  1. template<typename Args> variance_impl(Args const & args);
-
-
-

-variance_impl public member functions

-
    -
  1. template<typename Args> void operator()(Args const & args);
    2. -
  2. result_type result(dont_care) const;
    3. -
-
-
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/impl/weighted_covariance_impl.html b/doc/html/boost/accumulators/impl/weighted_covariance_impl.html deleted file mode 100644 index c9e17ad12f..0000000000 --- a/doc/html/boost/accumulators/impl/weighted_covariance_impl.html +++ /dev/null @@ -1,84 +0,0 @@ - - - - -Struct template weighted_covariance_impl - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template weighted_covariance_impl

-

boost::accumulators::impl::weighted_covariance_impl — Weighted Covariance Estimator.

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample, typename Weight, typename VariateType, 
-         typename VariateTag> 
-struct weighted_covariance_impl : public accumulator_base {
-  // construct/copy/destruct
-  template<typename Args> weighted_covariance_impl(Args const &);
-
-  // public member functions
-  template<typename Args> void operator()(Args const &);
-  result_type result(dont_care) const;
-};
-
-

Description

-

An iterative Monte Carlo estimator for the weighted covariance , where is a sample and a variate, is given by:

-
-

Equation 1.40. 

-
-
-


-

and being the weighted means of the samples and variates and the sum of the first weights .

-
-

-weighted_covariance_impl - public - construct/copy/destruct

-
  1. template<typename Args> weighted_covariance_impl(Args const & args);
-
-
-

-weighted_covariance_impl public member functions

-
    -
  1. template<typename Args> void operator()(Args const & args);
    2. -
  2. result_type result(dont_care) const;
    3. -
-
-
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/impl/weighted_density_impl.html b/doc/html/boost/accumulators/impl/weighted_density_impl.html deleted file mode 100644 index 2e5987eb0f..0000000000 --- a/doc/html/boost/accumulators/impl/weighted_density_impl.html +++ /dev/null @@ -1,79 +0,0 @@ - - - - -Struct template weighted_density_impl - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template weighted_density_impl

-

boost::accumulators::impl::weighted_density_impl — Histogram density estimator for weighted samples.

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample, typename Weight> 
-struct weighted_density_impl : public accumulator_base {
-  // construct/copy/destruct
-  template<typename Args> weighted_density_impl(Args const &);
-
-  // public member functions
-  template<typename Args> void operator()(Args const &);
-  template<typename Args> result_type result(Args const &) const;
-};
-
-

Description

-

The histogram density estimator returns a histogram of the sample distribution. The positions and sizes of the bins are determined using a specifiable number of cached samples (cache_size). The range between the minimum and the maximum of the cached samples is subdivided into a specifiable number of bins (num_bins) of same size. Additionally, an under- and an overflow bin is added to capture future under- and overflow samples. Once the bins are determined, the cached samples and all subsequent samples are added to the correct bins. At the end, a range of std::pair is returned, where each pair contains the position of the bin (lower bound) and the sum of the weights (normalized with the sum of all weights).

-

-

-
-

-weighted_density_impl - public - construct/copy/destruct

-
  1. template<typename Args> weighted_density_impl(Args const & args);
-
-
-

-weighted_density_impl public member functions

-
    -
  1. template<typename Args> void operator()(Args const & args);
    2. -
  2. template<typename Args> result_type result(Args const & args) const;
    3. -
-
-
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/impl/weighted_exten_idp66592512.html b/doc/html/boost/accumulators/impl/weighted_exten_idp66592512.html deleted file mode 100644 index f99bf9ab6e..0000000000 --- a/doc/html/boost/accumulators/impl/weighted_exten_idp66592512.html +++ /dev/null @@ -1,83 +0,0 @@ - - - - -Struct template weighted_extended_p_square_impl - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template weighted_extended_p_square_impl

-

boost::accumulators::impl::weighted_extended_p_square_impl — Multiple quantile estimation with the extended algorithm for weighted samples.

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample, typename Weight> 
-struct weighted_extended_p_square_impl : public accumulator_base {
-  // construct/copy/destruct
-  template<typename Args> weighted_extended_p_square_impl(Args const &);
-
-  // public member functions
-  template<typename Args> void operator()(Args const &);
-  result_type result(dont_care) const;
-};
-
-

Description

-

This version of the extended algorithm extends the extended algorithm to support weighted samples. The extended algorithm dynamically estimates several quantiles without storing samples. Assume that quantiles are to be estimated. Instead of storing the whole sample cumulative distribution, the algorithm maintains only principal markers and middle markers, whose positions are updated with each sample and whose heights are adjusted (if necessary) using a piecewise-parablic formula. The heights of the principal markers are the current estimates of the quantiles and are returned as an iterator range.

-

For further details, see

-

K. E. E. Raatikainen, Simultaneous estimation of several quantiles, Simulation, Volume 49, Number 4 (October), 1986, p. 159-164.

-

The extended algorithm generalizes the algorithm of

-

R. Jain and I. Chlamtac, The P^2 algorithm for dynamic calculation of quantiles and histograms without storing observations, Communications of the ACM, Volume 28 (October), Number 10, 1985, p. 1076-1085.

-

-

-
-

-weighted_extended_p_square_impl - public - construct/copy/destruct

-
  1. template<typename Args> weighted_extended_p_square_impl(Args const & args);
-
-
-

-weighted_extended_p_square_impl public member functions

-
    -
  1. template<typename Args> void operator()(Args const & args);
    2. -
  2. result_type result(dont_care) const;
    3. -
-
-
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/impl/weighted_kurtosis_impl.html b/doc/html/boost/accumulators/impl/weighted_kurtosis_impl.html deleted file mode 100644 index 575bdb2f2d..0000000000 --- a/doc/html/boost/accumulators/impl/weighted_kurtosis_impl.html +++ /dev/null @@ -1,80 +0,0 @@ - - - - -Struct template weighted_kurtosis_impl - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template weighted_kurtosis_impl

-

boost::accumulators::impl::weighted_kurtosis_impl — Kurtosis estimation for weighted samples.

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample, typename Weight> 
-struct weighted_kurtosis_impl : public accumulator_base {
-  // construct/copy/destruct
-  weighted_kurtosis_impl(dont_care);
-
-  // public member functions
-  template<typename Args> result_type result(Args const &) const;
-};
-
-

Description

-

The kurtosis of a sample distribution is defined as the ratio of the 4th central moment and the square of the 2nd central moment (the variance) of the samples, minus 3. The term is added in order to ensure that the normal distribution has zero kurtosis. The kurtosis can also be expressed by the simple moments:

-
-

Equation 1.41. 

-
-
-


-

where are the -th moment and the mean (first moment) of the samples.

-

The kurtosis estimator for weighted samples is formally identical to the estimator for unweighted samples, except that the weighted counterparts of all measures it depends on are to be taken.

-
-

-weighted_kurtosis_impl - public - construct/copy/destruct

-
  1. weighted_kurtosis_impl(dont_care);
-
-
-

-weighted_kurtosis_impl public member functions

-
  1. template<typename Args> result_type result(Args const & args) const;
-
-
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/impl/weighted_mean_impl.html b/doc/html/boost/accumulators/impl/weighted_mean_impl.html deleted file mode 100644 index 1bea55c7bd..0000000000 --- a/doc/html/boost/accumulators/impl/weighted_mean_impl.html +++ /dev/null @@ -1,72 +0,0 @@ - - - - -Struct template weighted_mean_impl - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template weighted_mean_impl

-

boost::accumulators::impl::weighted_mean_impl

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample, typename Weight, typename Tag> 
-struct weighted_mean_impl : public accumulator_base {
-  // construct/copy/destruct
-  weighted_mean_impl(dont_care);
-
-  // public member functions
-  template<typename Args> result_type result(Args const &) const;
-};
-
-

Description

-
-

-weighted_mean_impl - public - construct/copy/destruct

-
  1. weighted_mean_impl(dont_care);
-
-
-

-weighted_mean_impl public member functions

-
  1. template<typename Args> result_type result(Args const & args) const;
-
-
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/impl/weighted_median_impl.html b/doc/html/boost/accumulators/impl/weighted_median_impl.html deleted file mode 100644 index 1b30bf2822..0000000000 --- a/doc/html/boost/accumulators/impl/weighted_median_impl.html +++ /dev/null @@ -1,73 +0,0 @@ - - - - -Struct template weighted_median_impl - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template weighted_median_impl

-

boost::accumulators::impl::weighted_median_impl — Median estimation for weighted samples based on the quantile estimator.

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample> 
-struct weighted_median_impl : public accumulator_base {
-  // construct/copy/destruct
-  weighted_median_impl(dont_care);
-
-  // public member functions
-  template<typename Args> result_type result(Args const &) const;
-};
-
-

Description

-

The algorithm for weighted samples is invoked with a quantile probability of 0.5.

-
-

-weighted_median_impl - public - construct/copy/destruct

-
  1. weighted_median_impl(dont_care);
-
-
-

-weighted_median_impl public member functions

-
  1. template<typename Args> result_type result(Args const & args) const;
-
-
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/impl/weighted_moment_impl.html b/doc/html/boost/accumulators/impl/weighted_moment_impl.html deleted file mode 100644 index e02e525bfa..0000000000 --- a/doc/html/boost/accumulators/impl/weighted_moment_impl.html +++ /dev/null @@ -1,78 +0,0 @@ - - - - -Struct template weighted_moment_impl - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template weighted_moment_impl

-

boost::accumulators::impl::weighted_moment_impl

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename N, typename Sample, typename Weight> 
-struct weighted_moment_impl : public accumulator_base {
-  // construct/copy/destruct
-  template<typename Args> weighted_moment_impl(Args const &);
-
-  // public member functions
-   BOOST_MPL_ASSERT_RELATION(N::value, 0);
-  template<typename Args> void operator()(Args const &);
-  template<typename Args> result_type result(Args const &) const;
-};
-
-

Description

-
-

-weighted_moment_impl - public - construct/copy/destruct

-
  1. template<typename Args> weighted_moment_impl(Args const & args);
-
-
-

-weighted_moment_impl public member functions

-
    -
  1.  BOOST_MPL_ASSERT_RELATION(N::value, 0);
    2. -
  2. template<typename Args> void operator()(Args const & args);
    3. -
  3. template<typename Args> result_type result(Args const & args) const;
    4. -
-
-
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/impl/weighted_p_squ_idp66685360.html b/doc/html/boost/accumulators/impl/weighted_p_squ_idp66685360.html deleted file mode 100644 index 16fb4eca8f..0000000000 --- a/doc/html/boost/accumulators/impl/weighted_p_squ_idp66685360.html +++ /dev/null @@ -1,86 +0,0 @@ - - - - -Struct template weighted_p_square_cumulative_distribution_impl - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template weighted_p_square_cumulative_distribution_impl

-

boost::accumulators::impl::weighted_p_square_cumulative_distribution_impl — Histogram calculation of the cumulative distribution with the algorithm for weighted samples.

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample, typename Weight> 
-struct weighted_p_square_cumulative_distribution_impl :
-  public accumulator_base
-{
-  // construct/copy/destruct
-  template<typename Args> 
-    weighted_p_square_cumulative_distribution_impl(Args const &);
-
-  // public member functions
-  template<typename Args> void operator()(Args const &);
-  template<typename Args> result_type result(Args const &) const;
-};
-
-

Description

-

A histogram of the sample cumulative distribution is computed dynamically without storing samples based on the algorithm for weighted samples. The returned histogram has a specifiable amount (num_cells) equiprobable (and not equal-sized) cells.

-

Note that applying importance sampling results in regions to be more and other regions to be less accurately estimated than without importance sampling, i.e., with unweighted samples.

-

For further details, see

-

R. Jain and I. Chlamtac, The P^2 algorithm for dynamic calculation of quantiles and histograms without storing observations, Communications of the ACM, Volume 28 (October), Number 10, 1985, p. 1076-1085.

-

-

-
-

-weighted_p_square_cumulative_distribution_impl - public - construct/copy/destruct

-
  1. template<typename Args> 
-  weighted_p_square_cumulative_distribution_impl(Args const & args);
-
-
-

-weighted_p_square_cumulative_distribution_impl public member functions

-
    -
  1. template<typename Args> void operator()(Args const & args);
    2. -
  2. template<typename Args> result_type result(Args const & args) const;
    3. -
-
-
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/impl/weighted_p_squ_idp66702800.html b/doc/html/boost/accumulators/impl/weighted_p_squ_idp66702800.html deleted file mode 100644 index b343243e12..0000000000 --- a/doc/html/boost/accumulators/impl/weighted_p_squ_idp66702800.html +++ /dev/null @@ -1,81 +0,0 @@ - - - - -Struct template weighted_p_square_quantile_impl - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template weighted_p_square_quantile_impl

-

boost::accumulators::impl::weighted_p_square_quantile_impl — Single quantile estimation with the algorithm for weighted samples.

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample, typename Weight, typename Impl> 
-struct weighted_p_square_quantile_impl : public accumulator_base {
-  // construct/copy/destruct
-  template<typename Args> weighted_p_square_quantile_impl(Args const &);
-
-  // public member functions
-  template<typename Args> void operator()(Args const &);
-  result_type result(dont_care) const;
-};
-
-

Description

-

This version of the algorithm extends the algorithm to support weighted samples. The algorithm estimates a quantile dynamically without storing samples. Instead of storing the whole sample cumulative distribution, only five points (markers) are stored. The heights of these markers are the minimum and the maximum of the samples and the current estimates of the -, - and -quantiles. Their positions are equal to the number of samples that are smaller or equal to the markers. Each time a new sample is added, the positions of the markers are updated and if necessary their heights are adjusted using a piecewise- parabolic formula.

-

For further details, see

-

R. Jain and I. Chlamtac, The P^2 algorithm for dynamic calculation of quantiles and histograms without storing observations, Communications of the ACM, Volume 28 (October), Number 10, 1985, p. 1076-1085.

-

-

-
-

-weighted_p_square_quantile_impl - public - construct/copy/destruct

-
  1. template<typename Args> weighted_p_square_quantile_impl(Args const & args);
-
-
-

-weighted_p_square_quantile_impl public member functions

-
    -
  1. template<typename Args> void operator()(Args const & args);
    2. -
  2. result_type result(dont_care) const;
    3. -
-
-
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/impl/weighted_peaks_idp66732176.html b/doc/html/boost/accumulators/impl/weighted_peaks_idp66732176.html deleted file mode 100644 index 09a7b6226c..0000000000 --- a/doc/html/boost/accumulators/impl/weighted_peaks_idp66732176.html +++ /dev/null @@ -1,81 +0,0 @@ - - - - -Struct template weighted_peaks_over_threshold_impl - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template weighted_peaks_over_threshold_impl

-

boost::accumulators::impl::weighted_peaks_over_threshold_impl — Weighted Peaks over Threshold Method for Weighted Quantile and Weighted Tail Mean Estimation.

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample, typename Weight, typename LeftRight> 
-struct weighted_peaks_over_threshold_impl : public accumulator_base {
-  // construct/copy/destruct
-  template<typename Args> weighted_peaks_over_threshold_impl(Args const &);
-
-  // public member functions
-  template<typename Args> void operator()(Args const &);
-  template<typename Args> result_type result(Args const &) const;
-};
-
-

Description

-

See Also:

-

peaks_over_threshold_impl

-

- -

-
-

-weighted_peaks_over_threshold_impl - public - construct/copy/destruct

-
  1. template<typename Args> weighted_peaks_over_threshold_impl(Args const & args);
-
-
-

-weighted_peaks_over_threshold_impl public member functions

-
    -
  1. template<typename Args> void operator()(Args const & args);
    2. -
  2. template<typename Args> result_type result(Args const & args) const;
    3. -
-
-
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/impl/weighted_peaks_idp66744912.html b/doc/html/boost/accumulators/impl/weighted_peaks_idp66744912.html deleted file mode 100644 index bad2952859..0000000000 --- a/doc/html/boost/accumulators/impl/weighted_peaks_idp66744912.html +++ /dev/null @@ -1,83 +0,0 @@ - - - - -Struct template weighted_peaks_over_threshold_prob_impl - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template weighted_peaks_over_threshold_prob_impl

-

boost::accumulators::impl::weighted_peaks_over_threshold_prob_impl — Peaks over Threshold Method for Quantile and Tail Mean Estimation.

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample, typename Weight, typename LeftRight> 
-struct weighted_peaks_over_threshold_prob_impl : public accumulator_base {
-  // construct/copy/destruct
-  template<typename Args> 
-    weighted_peaks_over_threshold_prob_impl(Args const &);
-
-  // public member functions
-  void operator()(dont_care);
-  template<typename Args> result_type result(Args const &) const;
-};
-
-

Description

-

See Also:

-

weighted_peaks_over_threshold_impl

-

- -

-
-

-weighted_peaks_over_threshold_prob_impl - public - construct/copy/destruct

-
  1. template<typename Args> 
-  weighted_peaks_over_threshold_prob_impl(Args const & args);
-
-
-

-weighted_peaks_over_threshold_prob_impl public member functions

-
    -
  1. void operator()(dont_care);
    2. -
  2. template<typename Args> result_type result(Args const & args) const;
    3. -
-
-
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/impl/weighted_skewness_impl.html b/doc/html/boost/accumulators/impl/weighted_skewness_impl.html deleted file mode 100644 index f2af5b2d0c..0000000000 --- a/doc/html/boost/accumulators/impl/weighted_skewness_impl.html +++ /dev/null @@ -1,80 +0,0 @@ - - - - -Struct template weighted_skewness_impl - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template weighted_skewness_impl

-

boost::accumulators::impl::weighted_skewness_impl — Skewness estimation for weighted samples.

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample, typename Weight> 
-struct weighted_skewness_impl : public accumulator_base {
-  // construct/copy/destruct
-  weighted_skewness_impl(dont_care);
-
-  // public member functions
-  template<typename Args> result_type result(Args const &) const;
-};
-
-

Description

-

The skewness of a sample distribution is defined as the ratio of the 3rd central moment and the -th power $ of the 2nd central moment (the variance) of the samples. The skewness can also be expressed by the simple moments:

-
-

Equation 1.42. 

-
-
-


-

where are the -th moment and the mean (first moment) of the samples.

-

The skewness estimator for weighted samples is formally identical to the estimator for unweighted samples, except that the weighted counterparts of all measures it depends on are to be taken.

-
-

-weighted_skewness_impl - public - construct/copy/destruct

-
  1. weighted_skewness_impl(dont_care);
-
-
-

-weighted_skewness_impl public member functions

-
  1. template<typename Args> result_type result(Args const & args) const;
-
-
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/impl/weighted_sum_impl.html b/doc/html/boost/accumulators/impl/weighted_sum_impl.html deleted file mode 100644 index 6ce26da7b8..0000000000 --- a/doc/html/boost/accumulators/impl/weighted_sum_impl.html +++ /dev/null @@ -1,76 +0,0 @@ - - - - -Struct template weighted_sum_impl - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template weighted_sum_impl

-

boost::accumulators::impl::weighted_sum_impl

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample, typename Weight, typename Tag> 
-struct weighted_sum_impl : public accumulator_base {
-  // construct/copy/destruct
-  template<typename Args> weighted_sum_impl(Args const &);
-
-  // public member functions
-  template<typename Args> void operator()(Args const &);
-  result_type result(dont_care) const;
-};
-
-

Description

-
-

-weighted_sum_impl - public - construct/copy/destruct

-
  1. template<typename Args> weighted_sum_impl(Args const & args);
-
-
-

-weighted_sum_impl public member functions

-
    -
  1. template<typename Args> void operator()(Args const & args);
    2. -
  2. result_type result(dont_care) const;
    3. -
-
-
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/impl/weighted_sum_kahan_impl.html b/doc/html/boost/accumulators/impl/weighted_sum_kahan_impl.html deleted file mode 100644 index efa47cd05b..0000000000 --- a/doc/html/boost/accumulators/impl/weighted_sum_kahan_impl.html +++ /dev/null @@ -1,76 +0,0 @@ - - - - -Struct template weighted_sum_kahan_impl - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template weighted_sum_kahan_impl

-

boost::accumulators::impl::weighted_sum_kahan_impl

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample, typename Weight, typename Tag> 
-struct weighted_sum_kahan_impl : public accumulator_base {
-  // construct/copy/destruct
-  template<typename Args> weighted_sum_kahan_impl(Args const &);
-
-  // public member functions
-  template<typename Args> void operator()(Args const &);
-  result_type result(dont_care) const;
-};
-
-

Description

-
-

-weighted_sum_kahan_impl - public - construct/copy/destruct

-
  1. template<typename Args> weighted_sum_kahan_impl(Args const & args);
-
-
-

-weighted_sum_kahan_impl public member functions

-
    -
  1. template<typename Args> void operator()(Args const & args);
    2. -
  2. result_type result(dont_care) const;
    3. -
-
-
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/impl/weighted_tail__idp66800032.html b/doc/html/boost/accumulators/impl/weighted_tail__idp66800032.html deleted file mode 100644 index 51dd3fb76d..0000000000 --- a/doc/html/boost/accumulators/impl/weighted_tail__idp66800032.html +++ /dev/null @@ -1,87 +0,0 @@ - - - - -Struct template weighted_tail_quantile_impl - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template weighted_tail_quantile_impl

-

boost::accumulators::impl::weighted_tail_quantile_impl — Tail quantile estimation based on order statistics of weighted samples (for both left and right tails)

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample, typename Weight, typename LeftRight> 
-struct weighted_tail_quantile_impl : public accumulator_base {
-  // construct/copy/destruct
-  weighted_tail_quantile_impl(dont_care);
-
-  // public member functions
-  template<typename Args> result_type result(Args const &) const;
-};
-
-

Description

-

An estimator of tail quantiles with level based on order statistics of weighted samples are given by (left tail) and (right tail), where

-
-

Equation 1.43. 

-
-
-


-

and

-
-

Equation 1.44. 

-
-
-


-

being the number of samples and the sum of all weights.

-

-

-
-

-weighted_tail_quantile_impl - public - construct/copy/destruct

-
  1. weighted_tail_quantile_impl(dont_care);
-
-
-

-weighted_tail_quantile_impl public member functions

-
  1. template<typename Args> result_type result(Args const & args) const;
-
-
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/impl/weighted_tail__idp66832368.html b/doc/html/boost/accumulators/impl/weighted_tail__idp66832368.html deleted file mode 100644 index 3734d8ff74..0000000000 --- a/doc/html/boost/accumulators/impl/weighted_tail__idp66832368.html +++ /dev/null @@ -1,106 +0,0 @@ - - - - -Struct template weighted_tail_variate_means_impl - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template weighted_tail_variate_means_impl

-

boost::accumulators::impl::weighted_tail_variate_means_impl — Estimation of the absolute and relative weighted tail variate means (for both left and right tails)

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample, typename Weight, typename Impl, typename LeftRight, 
-         typename VariateType> 
-struct weighted_tail_variate_means_impl : public accumulator_base {
-  // construct/copy/destruct
-  weighted_tail_variate_means_impl(dont_care);
-
-  // public member functions
-  template<typename Args> result_type result(Args const &) const;
-};
-
-

Description

-

For all -th variates associated to the

-
-

Equation 1.45. 

-
-
-


-

smallest samples (left tail) or the weighted mean of the

-
-

Equation 1.46. 

-
-
-


-

largest samples (right tail), the absolute weighted tail means are computed and returned as an iterator range. Alternatively, the relative weighted tail means are returned, which are the absolute weighted tail means normalized with the weighted (non-coherent) sample tail mean .

-
-

Equation 1.47. 

-
-
-


-
-

Equation 1.48. 

-
-
-


-
-

Equation 1.49. 

-
-
-


-
-

Equation 1.50. 

-
-
-


-
-

-weighted_tail_variate_means_impl - public - construct/copy/destruct

-
  1. weighted_tail_variate_means_impl(dont_care);
-
-
-

-weighted_tail_variate_means_impl public member functions

-
  1. template<typename Args> result_type result(Args const & args) const;
-
-
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/impl/weighted_variance_impl.html b/doc/html/boost/accumulators/impl/weighted_variance_impl.html deleted file mode 100644 index f1abf7dd92..0000000000 --- a/doc/html/boost/accumulators/impl/weighted_variance_impl.html +++ /dev/null @@ -1,82 +0,0 @@ - - - - -Struct template weighted_variance_impl - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template weighted_variance_impl

-

boost::accumulators::impl::weighted_variance_impl — Iterative calculation of variance of weighted samples.

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample, typename Weight, typename MeanFeature, typename Tag> 
-struct weighted_variance_impl : public accumulator_base {
-  // construct/copy/destruct
-  template<typename Args> weighted_variance_impl(Args const &);
-
-  // public member functions
-  template<typename Args> void operator()(Args const &);
-  result_type result(dont_care) const;
-};
-
-

Description

-

Iterative calculation of variance of weighted samples:

-
-

Equation 1.51. 

-
-
-


where is the sum of the weights and the estimate of the mean of the weighted samples. Note that the sample variance is not defined for .

-
-

-weighted_variance_impl - public - construct/copy/destruct

-
  1. template<typename Args> weighted_variance_impl(Args const & args);
-
-
-

-weighted_variance_impl public member functions

-
    -
  1. template<typename Args> void operator()(Args const & args);
    2. -
  2. result_type result(dont_care) const;
    3. -
-
-
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/impl/with_density_median_impl.html b/doc/html/boost/accumulators/impl/with_density_median_impl.html deleted file mode 100644 index f647316caf..0000000000 --- a/doc/html/boost/accumulators/impl/with_density_median_impl.html +++ /dev/null @@ -1,77 +0,0 @@ - - - - -Struct template with_density_median_impl - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template with_density_median_impl

-

boost::accumulators::impl::with_density_median_impl — Median estimation based on the density estimator.

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample> 
-struct with_density_median_impl : public accumulator_base {
-  // construct/copy/destruct
-  template<typename Args> with_density_median_impl(Args const &);
-
-  // public member functions
-  void operator()(dont_care);
-  template<typename Args> result_type result(Args const &) const;
-};
-
-

Description

-

The algorithm determines the bin in which the -th sample lies, being the total number of samples. It returns the approximate horizontal position of this sample, based on a linear interpolation inside the bin.

-
-

-with_density_median_impl - public - construct/copy/destruct

-
  1. template<typename Args> with_density_median_impl(Args const & args);
-
-
-

-with_density_median_impl public member functions

-
    -
  1. void operator()(dont_care);
    2. -
  2. template<typename Args> result_type result(Args const & args) const;
    3. -
-
-
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/impl/with_density_w_idp66912192.html b/doc/html/boost/accumulators/impl/with_density_w_idp66912192.html deleted file mode 100644 index 8694f3384e..0000000000 --- a/doc/html/boost/accumulators/impl/with_density_w_idp66912192.html +++ /dev/null @@ -1,77 +0,0 @@ - - - - -Struct template with_density_weighted_median_impl - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template with_density_weighted_median_impl

-

boost::accumulators::impl::with_density_weighted_median_impl — Median estimation for weighted samples based on the density estimator.

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample> 
-struct with_density_weighted_median_impl : public accumulator_base {
-  // construct/copy/destruct
-  template<typename Args> with_density_weighted_median_impl(Args const &);
-
-  // public member functions
-  void operator()(dont_care);
-  template<typename Args> result_type result(Args const &) const;
-};
-
-

Description

-

The algorithm determines the bin in which the -th sample lies, being the total number of samples. It returns the approximate horizontal position of this sample, based on a linear interpolation inside the bin.

-
-

-with_density_weighted_median_impl - public - construct/copy/destruct

-
  1. template<typename Args> with_density_weighted_median_impl(Args const & args);
-
-
-

-with_density_weighted_median_impl public member functions

-
    -
  1. void operator()(dont_care);
    2. -
  2. template<typename Args> result_type result(Args const & args) const;
    3. -
-
-
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/impl/with_p_square__idp66926624.html b/doc/html/boost/accumulators/impl/with_p_square__idp66926624.html deleted file mode 100644 index 5db10f9026..0000000000 --- a/doc/html/boost/accumulators/impl/with_p_square__idp66926624.html +++ /dev/null @@ -1,79 +0,0 @@ - - - - -Struct template with_p_square_cumulative_distribution_median_impl - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template with_p_square_cumulative_distribution_median_impl

-

boost::accumulators::impl::with_p_square_cumulative_distribution_median_impl — Median estimation based on the cumulative distribution estimator.

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample> 
-struct with_p_square_cumulative_distribution_median_impl :
-  public accumulator_base
-{
-  // construct/copy/destruct
-  with_p_square_cumulative_distribution_median_impl(dont_care);
-
-  // public member functions
-  void operator()(dont_care);
-  template<typename Args> result_type result(Args const &) const;
-};
-
-

Description

-

The algorithm determines the first (leftmost) bin with a height exceeding 0.5. It returns the approximate horizontal position of where the cumulative distribution equals 0.5, based on a linear interpolation inside the bin.

-
-

-with_p_square_cumulative_distribution_median_impl - public - construct/copy/destruct

-
  1. with_p_square_cumulative_distribution_median_impl(dont_care);
-
-
-

-with_p_square_cumulative_distribution_median_impl public member functions

-
    -
  1. void operator()(dont_care);
    2. -
  2. template<typename Args> result_type result(Args const & args) const;
    3. -
-
-
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/impl/with_p_square__idp66937776.html b/doc/html/boost/accumulators/impl/with_p_square__idp66937776.html deleted file mode 100644 index e9e90e3c01..0000000000 --- a/doc/html/boost/accumulators/impl/with_p_square__idp66937776.html +++ /dev/null @@ -1,79 +0,0 @@ - - - - -Struct template with_p_square_cumulative_distribution_weighted_median_impl - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template with_p_square_cumulative_distribution_weighted_median_impl

-

boost::accumulators::impl::with_p_square_cumulative_distribution_weighted_median_impl — Median estimation for weighted samples based on the cumulative distribution estimator.

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Sample, typename Weight> 
-struct with_p_square_cumulative_distribution_weighted_median_impl :
-  public accumulator_base
-{
-  // construct/copy/destruct
-  with_p_square_cumulative_distribution_weighted_median_impl(dont_care);
-
-  // public member functions
-  void operator()(dont_care);
-  template<typename Args> result_type result(Args const &) const;
-};
-
-

Description

-

The algorithm determines the first (leftmost) bin with a height exceeding 0.5. It returns the approximate horizontal position of where the cumulative distribution equals 0.5, based on a linear interpolation inside the bin.

-
-

-with_p_square_cumulative_distribution_weighted_median_impl - public - construct/copy/destruct

-
  1. with_p_square_cumulative_distribution_weighted_median_impl(dont_care);
-
-
-

-with_p_square_cumulative_distribution_weighted_median_impl public member functions

-
    -
  1. void operator()(dont_care);
    2. -
  2. template<typename Args> result_type result(Args const & args) const;
    3. -
-
-
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/kahan.html b/doc/html/boost/accumulators/kahan.html deleted file mode 100644 index bbd28d1ca1..0000000000 --- a/doc/html/boost/accumulators/kahan.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct kahan - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct kahan

-

boost::accumulators::kahan

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-
-struct kahan {
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/lazy.html b/doc/html/boost/accumulators/lazy.html deleted file mode 100644 index e73d70a5dd..0000000000 --- a/doc/html/boost/accumulators/lazy.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct lazy - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct lazy

-

boost::accumulators::lazy

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-
-struct lazy {
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/left.html b/doc/html/boost/accumulators/left.html deleted file mode 100644 index 245845b5a9..0000000000 --- a/doc/html/boost/accumulators/left.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct left - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct left

-

boost::accumulators::left

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-
-struct left {
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/linear.html b/doc/html/boost/accumulators/linear.html deleted file mode 100644 index cefa569ecc..0000000000 --- a/doc/html/boost/accumulators/linear.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct linear - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct linear

-

boost::accumulators::linear

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-
-struct linear {
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/quadratic.html b/doc/html/boost/accumulators/quadratic.html deleted file mode 100644 index cf3b74dced..0000000000 --- a/doc/html/boost/accumulators/quadratic.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct quadratic - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct quadratic

-

boost::accumulators::quadratic

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-
-struct quadratic {
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/regular.html b/doc/html/boost/accumulators/regular.html deleted file mode 100644 index a9ec62c002..0000000000 --- a/doc/html/boost/accumulators/regular.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct regular - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct regular

-

boost::accumulators::regular

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-
-struct regular {
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/relative.html b/doc/html/boost/accumulators/relative.html deleted file mode 100644 index eeebc7f93b..0000000000 --- a/doc/html/boost/accumulators/relative.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct relative - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct relative

-

boost::accumulators::relative

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-
-struct relative {
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/right.html b/doc/html/boost/accumulators/right.html deleted file mode 100644 index f377fabdbd..0000000000 --- a/doc/html/boost/accumulators/right.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct right - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct right

-

boost::accumulators::right

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-
-struct right {
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/stats.html b/doc/html/boost/accumulators/stats.html deleted file mode 100644 index 82de01d74b..0000000000 --- a/doc/html/boost/accumulators/stats.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct template stats - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template stats

-

boost::accumulators::stats — An MPL sequence of statistics.

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Stat1, typename Stat2, ... > 
-struct stats : public mpl::vector< Stat1, Stat2,...> {
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/absolute_tail__idp66950400.html b/doc/html/boost/accumulators/tag/absolute_tail__idp66950400.html deleted file mode 100644 index 476c247595..0000000000 --- a/doc/html/boost/accumulators/tag/absolute_tail__idp66950400.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template absolute_tail_variate_means - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template absolute_tail_variate_means

-

boost::accumulators::tag::absolute_tail_variate_means

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename LeftRight, typename VariateType, typename VariateTag> 
-struct absolute_tail_variate_means : public boost::accumulators::depends_on< count, non_coherent_tail_mean< LeftRight >, tail_variate< VariateType, VariateTag, LeftRight > >
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/absolute_weigh_idp66953456.html b/doc/html/boost/accumulators/tag/absolute_weigh_idp66953456.html deleted file mode 100644 index 3887e735fb..0000000000 --- a/doc/html/boost/accumulators/tag/absolute_weigh_idp66953456.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template absolute_weighted_tail_variate_means - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template absolute_weighted_tail_variate_means

-

boost::accumulators::tag::absolute_weighted_tail_variate_means

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename LeftRight, typename VariateType, typename VariateTag> 
-struct absolute_weighted_tail_variate_means : public boost::accumulators::depends_on< non_coherent_weighted_tail_mean< LeftRight >, tail_variate< VariateType, VariateTag, LeftRight >, tail_weights< LeftRight > >
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/abstract_absol_idp65700464.html b/doc/html/boost/accumulators/tag/abstract_absol_idp65700464.html deleted file mode 100644 index e015c2f17f..0000000000 --- a/doc/html/boost/accumulators/tag/abstract_absol_idp65700464.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct abstract_absolute_tail_variate_means - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct abstract_absolute_tail_variate_means

-

boost::accumulators::tag::abstract_absolute_tail_variate_means

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/tail_variate_means.hpp>
-
-
-struct abstract_absolute_tail_variate_means :
-  public boost::accumulators::depends_on<>
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/abstract_covariance.html b/doc/html/boost/accumulators/tag/abstract_covariance.html deleted file mode 100644 index baf2e6d229..0000000000 --- a/doc/html/boost/accumulators/tag/abstract_covariance.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct abstract_covariance - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct abstract_covariance

-

boost::accumulators::tag::abstract_covariance

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/covariance.hpp>
-
-
-struct abstract_covariance : public boost::accumulators::depends_on<> {
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/abstract_non_c_idp65628000.html b/doc/html/boost/accumulators/tag/abstract_non_c_idp65628000.html deleted file mode 100644 index 6d3d5991b4..0000000000 --- a/doc/html/boost/accumulators/tag/abstract_non_c_idp65628000.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct abstract_non_coherent_tail_mean - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct abstract_non_coherent_tail_mean

-

boost::accumulators::tag::abstract_non_coherent_tail_mean

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/tail_mean.hpp>
-
-
-struct abstract_non_coherent_tail_mean :
-  public boost::accumulators::depends_on<>
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/abstract_peaks_idp65279920.html b/doc/html/boost/accumulators/tag/abstract_peaks_idp65279920.html deleted file mode 100644 index b7763972a8..0000000000 --- a/doc/html/boost/accumulators/tag/abstract_peaks_idp65279920.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct abstract_peaks_over_threshold - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct abstract_peaks_over_threshold

-

boost::accumulators::tag::abstract_peaks_over_threshold

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/peaks_over_threshold.hpp>
-
-
-struct abstract_peaks_over_threshold :
-  public boost::accumulators::depends_on<>
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/abstract_relat_idp65701456.html b/doc/html/boost/accumulators/tag/abstract_relat_idp65701456.html deleted file mode 100644 index 165e76dd99..0000000000 --- a/doc/html/boost/accumulators/tag/abstract_relat_idp65701456.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct abstract_relative_tail_variate_means - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct abstract_relative_tail_variate_means

-

boost::accumulators::tag::abstract_relative_tail_variate_means

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/tail_variate_means.hpp>
-
-
-struct abstract_relative_tail_variate_means :
-  public boost::accumulators::depends_on<>
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/abstract_sum_of_variates.html b/doc/html/boost/accumulators/tag/abstract_sum_of_variates.html deleted file mode 100644 index 92fd5c869d..0000000000 --- a/doc/html/boost/accumulators/tag/abstract_sum_of_variates.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct abstract_sum_of_variates - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct abstract_sum_of_variates

-

boost::accumulators::tag::abstract_sum_of_variates

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/sum.hpp>
-
-
-struct abstract_sum_of_variates : public boost::accumulators::depends_on<> {
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/abstract_tail.html b/doc/html/boost/accumulators/tag/abstract_tail.html deleted file mode 100644 index 857ff162d0..0000000000 --- a/doc/html/boost/accumulators/tag/abstract_tail.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct abstract_tail - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct abstract_tail

-

boost::accumulators::tag::abstract_tail

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/tail.hpp>
-
-
-struct abstract_tail : public boost::accumulators::depends_on<> {
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/abstract_tail_variate.html b/doc/html/boost/accumulators/tag/abstract_tail_variate.html deleted file mode 100644 index 41db90fc46..0000000000 --- a/doc/html/boost/accumulators/tag/abstract_tail_variate.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct abstract_tail_variate - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct abstract_tail_variate

-

boost::accumulators::tag::abstract_tail_variate

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/tail_variate.hpp>
-
-
-struct abstract_tail_variate : public boost::accumulators::depends_on<> {
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/abstract_tail_weights.html b/doc/html/boost/accumulators/tag/abstract_tail_weights.html deleted file mode 100644 index 3bbe6e066c..0000000000 --- a/doc/html/boost/accumulators/tag/abstract_tail_weights.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct abstract_tail_weights - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct abstract_tail_weights

-

boost::accumulators::tag::abstract_tail_weights

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/tail_variate.hpp>
-
-
-struct abstract_tail_weights : public boost::accumulators::depends_on<> {
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/abstract_weigh_idp65857328.html b/doc/html/boost/accumulators/tag/abstract_weigh_idp65857328.html deleted file mode 100644 index ba771871a8..0000000000 --- a/doc/html/boost/accumulators/tag/abstract_weigh_idp65857328.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct abstract_weighted_sum_of_variates - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct abstract_weighted_sum_of_variates

-

boost::accumulators::tag::abstract_weighted_sum_of_variates

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_sum.hpp>
-
-
-struct abstract_weighted_sum_of_variates :
-  public boost::accumulators::depends_on<>
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/as_dropp_idm45507139485056.html b/doc/html/boost/accumulators/tag/as_dropp_idm45507139485056.html new file mode 100644 index 0000000000..ad9ec2d62e --- /dev/null +++ b/doc/html/boost/accumulators/tag/as_dropp_idm45507139485056.html @@ -0,0 +1,54 @@ + + + + +Struct template as_droppable<droppable< Feature >> + + + + + + + + + + + + + + + +
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
+
+
+PrevUpHomeNext +
+
+
+
+

Struct template as_droppable<droppable< Feature >>

+

boost::accumulators::tag::as_droppable<droppable< Feature >>

+
+

Synopsis

+
// In header: <boost/accumulators/framework/accumulators/droppable_accumulator.hpp>
+
+template<typename Feature> 
+struct as_droppable<droppable< Feature >> {
+  // types
+  typedef droppable< Feature > type;
+};
+
+ + + +
Copyright © 2005, 2006 Eric Niebler

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/doc/html/boost/accumulators/tag/as_droppable.html b/doc/html/boost/accumulators/tag/as_droppable.html index 9da85ae9ae..0c24e3f49d 100644 --- a/doc/html/boost/accumulators/tag/as_droppable.html +++ b/doc/html/boost/accumulators/tag/as_droppable.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
-PrevUpHomeNext +PrevUpHomeNext
@@ -48,7 +48,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/boost/accumulators/tag/as_droppable_d_idp64790880.html b/doc/html/boost/accumulators/tag/as_droppable_d_idp64790880.html deleted file mode 100644 index 0b0d36e451..0000000000 --- a/doc/html/boost/accumulators/tag/as_droppable_d_idp64790880.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template as_droppable<droppable< Feature >> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template as_droppable<droppable< Feature >>

-

boost::accumulators::tag::as_droppable<droppable< Feature >>

-
-

Synopsis

-
// In header: <boost/accumulators/framework/accumulators/droppable_accumulator.hpp>
-
-template<typename Feature> 
-struct as_droppable<droppable< Feature >> {
-  // types
-  typedef droppable< Feature > type;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/coherent_tail_mean.html b/doc/html/boost/accumulators/tag/coherent_tail_mean.html deleted file mode 100644 index 11df2f7cd4..0000000000 --- a/doc/html/boost/accumulators/tag/coherent_tail_mean.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template coherent_tail_mean - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template coherent_tail_mean

-

boost::accumulators::tag::coherent_tail_mean

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename LeftRight> 
-struct coherent_tail_mean : public boost::accumulators::depends_on< count, quantile, non_coherent_tail_mean< LeftRight > >
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/count.html b/doc/html/boost/accumulators/tag/count.html deleted file mode 100644 index 7161c4e719..0000000000 --- a/doc/html/boost/accumulators/tag/count.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct count - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct count

-

boost::accumulators::tag::count

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/count.hpp>
-
-
-struct count : public boost::accumulators::depends_on<> {
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/covariance.html b/doc/html/boost/accumulators/tag/covariance.html deleted file mode 100644 index b8f2b2e53a..0000000000 --- a/doc/html/boost/accumulators/tag/covariance.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template covariance - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template covariance

-

boost::accumulators::tag::covariance

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename VariateType, typename VariateTag> 
-struct covariance : public boost::accumulators::depends_on< count, mean, mean_of_variates< VariateType, VariateTag > >
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/covariate1.html b/doc/html/boost/accumulators/tag/covariate1.html deleted file mode 100644 index 4ca75304b9..0000000000 --- a/doc/html/boost/accumulators/tag/covariate1.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct covariate1 - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct covariate1

-

boost::accumulators::tag::covariate1

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/variates/covariate.hpp>
-
-
-struct covariate1 {
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/covariate2.html b/doc/html/boost/accumulators/tag/covariate2.html deleted file mode 100644 index f45236c61e..0000000000 --- a/doc/html/boost/accumulators/tag/covariate2.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct covariate2 - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct covariate2

-

boost::accumulators::tag::covariate2

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/variates/covariate.hpp>
-
-
-struct covariate2 {
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/density.html b/doc/html/boost/accumulators/tag/density.html deleted file mode 100644 index 090c013b17..0000000000 --- a/doc/html/boost/accumulators/tag/density.html +++ /dev/null @@ -1,72 +0,0 @@ - - - - -Struct density - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct density

-

boost::accumulators::tag::density

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/density.hpp>
-
-
-struct density : public boost::accumulators::depends_on< count, min, max >,
-                 public density_cache_size,
-                 public density_num_bins
-{
-
-  // public data members
-  static boost::parameter::keyword< density_cache_size > const cache_size;
-  static boost::parameter::keyword< density_num_bins > const num_bins;
-};
-
-

Description

-
-

-density - public - public data members

-
  1. -
    static boost::parameter::keyword< density_cache_size > const cache_size;
    -

    tag::density::cache_size named parameter tag::density::num_bins named parameter

    -
-
-
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/error_of.html b/doc/html/boost/accumulators/tag/error_of.html deleted file mode 100644 index 4cbaf0afc0..0000000000 --- a/doc/html/boost/accumulators/tag/error_of.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct template error_of - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template error_of

-

boost::accumulators::tag::error_of

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Feature> 
-struct error_of : public boost::accumulators::depends_on< Feature > {
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/error_of_immed_idp64944224.html b/doc/html/boost/accumulators/tag/error_of_immed_idp64944224.html deleted file mode 100644 index f0c9eef719..0000000000 --- a/doc/html/boost/accumulators/tag/error_of_immed_idp64944224.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct error_of<immediate_mean> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct error_of<immediate_mean>

-

boost::accumulators::tag::error_of<immediate_mean>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/error_of_mean.hpp>
-
-
-struct error_of<immediate_mean> : public boost::accumulators::depends_on< variance, count > {
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/error_of_mean_idp64945920.html b/doc/html/boost/accumulators/tag/error_of_mean_idp64945920.html deleted file mode 100644 index b73e5da225..0000000000 --- a/doc/html/boost/accumulators/tag/error_of_mean_idp64945920.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct error_of<mean> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct error_of<mean>

-

boost::accumulators::tag::error_of<mean>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/error_of_mean.hpp>
-
-
-struct error_of<mean> :
-  public boost::accumulators::depends_on< lazy_variance, count >
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/extended_p_squ_idp64995312.html b/doc/html/boost/accumulators/tag/extended_p_squ_idp64995312.html deleted file mode 100644 index ce47859681..0000000000 --- a/doc/html/boost/accumulators/tag/extended_p_squ_idp64995312.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Struct extended_p_square_quantile_quadratic - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct extended_p_square_quantile_quadratic

-

boost::accumulators::tag::extended_p_square_quantile_quadratic

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/extended_p_square_quantile.hpp>
-
-
-struct extended_p_square_quantile_quadratic :
-  public boost::accumulators::depends_on< extended_p_square >
-{
-  // types
-  typedef accumulators::impl::extended_p_square_quantile_impl< mpl::_1, unweighted, quadratic > impl;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/extended_p_square.html b/doc/html/boost/accumulators/tag/extended_p_square.html deleted file mode 100644 index da2a69b643..0000000000 --- a/doc/html/boost/accumulators/tag/extended_p_square.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Struct extended_p_square - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct extended_p_square

-

boost::accumulators::tag::extended_p_square

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/extended_p_square.hpp>
-
-
-struct extended_p_square : public boost::accumulators::depends_on< count >,
-                           public extended_p_square_probabilities
-{
-  // types
-  typedef accumulators::impl::extended_p_square_impl< mpl::_1 > impl;
-
-  // public data members
-  static boost::parameter::keyword< tag::probabilities > const probabilities;  // tag::extended_p_square::probabilities named parameter 
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/extended_p_square_quantile.html b/doc/html/boost/accumulators/tag/extended_p_square_quantile.html deleted file mode 100644 index 86481f5eed..0000000000 --- a/doc/html/boost/accumulators/tag/extended_p_square_quantile.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Struct extended_p_square_quantile - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct extended_p_square_quantile

-

boost::accumulators::tag::extended_p_square_quantile

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/extended_p_square_quantile.hpp>
-
-
-struct extended_p_square_quantile :
-  public boost::accumulators::depends_on< extended_p_square >
-{
-  // types
-  typedef accumulators::impl::extended_p_square_quantile_impl< mpl::_1, unweighted, linear > impl;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/external_Featu_idp64801280.html b/doc/html/boost/accumulators/tag/external_Featu_idp64801280.html deleted file mode 100644 index 567c9ab08e..0000000000 --- a/doc/html/boost/accumulators/tag/external_Featu_idp64801280.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template external<Feature, Tag, void> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template external<Feature, Tag, void>

-

boost::accumulators::tag::external<Feature, Tag, void>

-
-

Synopsis

-
// In header: <boost/accumulators/framework/accumulators/external_accumulator.hpp>
-
-template<typename Feature, typename Tag> 
-struct external<Feature, Tag, void> : public boost::accumulators::depends_on<> {
-  // types
-  typedef unspecified impl;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/external_idm45507139474656.html b/doc/html/boost/accumulators/tag/external_idm45507139474656.html new file mode 100644 index 0000000000..cc9e119533 --- /dev/null +++ b/doc/html/boost/accumulators/tag/external_idm45507139474656.html @@ -0,0 +1,54 @@ + + + + +Struct template external<Feature, Tag, void> + + + + + + + + + + + + + + + +
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
+
+
+PrevUpHomeNext +
+
+
+
+

Struct template external<Feature, Tag, void>

+

boost::accumulators::tag::external<Feature, Tag, void>

+
+

Synopsis

+
// In header: <boost/accumulators/framework/accumulators/external_accumulator.hpp>
+
+template<typename Feature, typename Tag> 
+struct external<Feature, Tag, void> : public boost::accumulators::depends_on<> {
+  // types
+  typedef unspecified impl;
+};
+
+ + + +
Copyright © 2005, 2006 Eric Niebler

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/doc/html/boost/accumulators/tag/immediate_mean.html b/doc/html/boost/accumulators/tag/immediate_mean.html deleted file mode 100644 index 6c9b5ace14..0000000000 --- a/doc/html/boost/accumulators/tag/immediate_mean.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct immediate_mean - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct immediate_mean

-

boost::accumulators::tag::immediate_mean

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/mean.hpp>
-
-
-struct immediate_mean : public boost::accumulators::depends_on< count > {
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/immediate_mean_of_variates.html b/doc/html/boost/accumulators/tag/immediate_mean_of_variates.html deleted file mode 100644 index ae649f89ff..0000000000 --- a/doc/html/boost/accumulators/tag/immediate_mean_of_variates.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template immediate_mean_of_variates - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template immediate_mean_of_variates

-

boost::accumulators::tag::immediate_mean_of_variates

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename VariateType, typename VariateTag> 
-struct immediate_mean_of_variates :
-  public boost::accumulators::depends_on< count >
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/immediate_mean_of_weights.html b/doc/html/boost/accumulators/tag/immediate_mean_of_weights.html deleted file mode 100644 index 39d3285ad3..0000000000 --- a/doc/html/boost/accumulators/tag/immediate_mean_of_weights.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Struct immediate_mean_of_weights - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct immediate_mean_of_weights

-

boost::accumulators::tag::immediate_mean_of_weights

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/mean.hpp>
-
-
-struct immediate_mean_of_weights :
-  public boost::accumulators::depends_on< count >
-{
-  // types
-  typedef mpl::true_ is_weight_accumulator;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/immediate_rolling_mean.html b/doc/html/boost/accumulators/tag/immediate_rolling_mean.html deleted file mode 100644 index ef1a1e98d0..0000000000 --- a/doc/html/boost/accumulators/tag/immediate_rolling_mean.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Struct immediate_rolling_mean - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct immediate_rolling_mean

-

boost::accumulators::tag::immediate_rolling_mean

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/rolling_mean.hpp>
-
-
-struct immediate_rolling_mean : public boost::accumulators::depends_on< rolling_window_plus1, rolling_count >
-{
-
-  // public data members
-  static boost::parameter::keyword< tag::rolling_window_size > const window_size;  // tag::rolling_window::window_size named parameter 
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/immediate_rolling_variance.html b/doc/html/boost/accumulators/tag/immediate_rolling_variance.html deleted file mode 100644 index d797cda232..0000000000 --- a/doc/html/boost/accumulators/tag/immediate_rolling_variance.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Struct immediate_rolling_variance - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct immediate_rolling_variance

-

boost::accumulators::tag::immediate_rolling_variance

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/rolling_variance.hpp>
-
-
-struct immediate_rolling_variance : public boost::accumulators::depends_on< rolling_window_plus1, rolling_count, immediate_rolling_mean >
-{
-
-  // public data members
-  static boost::parameter::keyword< tag::rolling_window_size > const window_size;  // tag::rolling_window::window_size named parameter 
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/immediate_weig_idp66965120.html b/doc/html/boost/accumulators/tag/immediate_weig_idp66965120.html deleted file mode 100644 index 1c657351d2..0000000000 --- a/doc/html/boost/accumulators/tag/immediate_weig_idp66965120.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template immediate_weighted_mean_of_variates - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template immediate_weighted_mean_of_variates

-

boost::accumulators::tag::immediate_weighted_mean_of_variates

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename VariateType, typename VariateTag> 
-struct immediate_weighted_mean_of_variates :
-  public boost::accumulators::depends_on< sum_of_weights >
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/immediate_weighted_mean.html b/doc/html/boost/accumulators/tag/immediate_weighted_mean.html deleted file mode 100644 index 04f8873454..0000000000 --- a/doc/html/boost/accumulators/tag/immediate_weighted_mean.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct immediate_weighted_mean - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct immediate_weighted_mean

-

boost::accumulators::tag::immediate_weighted_mean

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_mean.hpp>
-
-
-struct immediate_weighted_mean :
-  public boost::accumulators::depends_on< sum_of_weights >
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/kurtosis.html b/doc/html/boost/accumulators/tag/kurtosis.html deleted file mode 100644 index 3b032085e9..0000000000 --- a/doc/html/boost/accumulators/tag/kurtosis.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct kurtosis - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct kurtosis

-

boost::accumulators::tag::kurtosis

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/kurtosis.hpp>
-
-
-struct kurtosis : public boost::accumulators::depends_on< mean, moment< 2 >, moment< 3 >, moment< 4 > >
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/lazy_rolling_mean.html b/doc/html/boost/accumulators/tag/lazy_rolling_mean.html deleted file mode 100644 index 7661077063..0000000000 --- a/doc/html/boost/accumulators/tag/lazy_rolling_mean.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Struct lazy_rolling_mean - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct lazy_rolling_mean

-

boost::accumulators::tag::lazy_rolling_mean

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/rolling_mean.hpp>
-
-
-struct lazy_rolling_mean :
-  public boost::accumulators::depends_on< rolling_sum, rolling_count >
-{
-
-  // public data members
-  static boost::parameter::keyword< tag::rolling_window_size > const window_size;  // tag::rolling_window::window_size named parameter 
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/lazy_rolling_variance.html b/doc/html/boost/accumulators/tag/lazy_rolling_variance.html deleted file mode 100644 index 140c136cb5..0000000000 --- a/doc/html/boost/accumulators/tag/lazy_rolling_variance.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Struct lazy_rolling_variance - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct lazy_rolling_variance

-

boost::accumulators::tag::lazy_rolling_variance

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/rolling_variance.hpp>
-
-
-struct lazy_rolling_variance : public boost::accumulators::depends_on< rolling_count, rolling_mean, rolling_moment< 2 > >
-{
-
-  // public data members
-  static boost::parameter::keyword< tag::rolling_window_size > const window_size;  // tag::rolling_window::window_size named parameter 
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/lazy_variance.html b/doc/html/boost/accumulators/tag/lazy_variance.html deleted file mode 100644 index e49479c025..0000000000 --- a/doc/html/boost/accumulators/tag/lazy_variance.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct lazy_variance - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct lazy_variance

-

boost::accumulators::tag::lazy_variance

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/variance.hpp>
-
-
-struct lazy_variance :
-  public boost::accumulators::depends_on< moment< 2 >, mean >
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/lazy_weighted_variance.html b/doc/html/boost/accumulators/tag/lazy_weighted_variance.html deleted file mode 100644 index e34295889c..0000000000 --- a/doc/html/boost/accumulators/tag/lazy_weighted_variance.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct lazy_weighted_variance - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct lazy_weighted_variance

-

boost::accumulators::tag::lazy_weighted_variance

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_variance.hpp>
-
-
-struct lazy_weighted_variance : public boost::accumulators::depends_on< weighted_moment< 2 >, weighted_mean >
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/left_tail_variate.html b/doc/html/boost/accumulators/tag/left_tail_variate.html deleted file mode 100644 index 09e14fcd36..0000000000 --- a/doc/html/boost/accumulators/tag/left_tail_variate.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct template left_tail_variate - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template left_tail_variate

-

boost::accumulators::tag::left_tail_variate

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename VariateType, typename VariateTag, typename LeftRight> 
-struct left_tail_variate {
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/max.html b/doc/html/boost/accumulators/tag/max.html deleted file mode 100644 index 46573387c7..0000000000 --- a/doc/html/boost/accumulators/tag/max.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct max - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct max

-

boost::accumulators::tag::max

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/max.hpp>
-
-
-struct max : public boost::accumulators::depends_on<> {
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/mean.html b/doc/html/boost/accumulators/tag/mean.html deleted file mode 100644 index 64bde4d1fd..0000000000 --- a/doc/html/boost/accumulators/tag/mean.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct mean - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct mean

-

boost::accumulators::tag::mean

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/mean.hpp>
-
-
-struct mean : public boost::accumulators::depends_on< count, sum > {
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/mean_of_variates.html b/doc/html/boost/accumulators/tag/mean_of_variates.html deleted file mode 100644 index b4653593b5..0000000000 --- a/doc/html/boost/accumulators/tag/mean_of_variates.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template mean_of_variates - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template mean_of_variates

-

boost::accumulators::tag::mean_of_variates

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename VariateType, typename VariateTag> 
-struct mean_of_variates : public boost::accumulators::depends_on< count, sum_of_variates< VariateType, VariateTag > >
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/mean_of_weights.html b/doc/html/boost/accumulators/tag/mean_of_weights.html deleted file mode 100644 index 4072c20e78..0000000000 --- a/doc/html/boost/accumulators/tag/mean_of_weights.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Struct mean_of_weights - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct mean_of_weights

-

boost::accumulators::tag::mean_of_weights

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/mean.hpp>
-
-
-struct mean_of_weights :
-  public boost::accumulators::depends_on< count, sum_of_weights >
-{
-  // types
-  typedef mpl::true_ is_weight_accumulator;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/median.html b/doc/html/boost/accumulators/tag/median.html deleted file mode 100644 index ef65a814c3..0000000000 --- a/doc/html/boost/accumulators/tag/median.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct median - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct median

-

boost::accumulators::tag::median

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/median.hpp>
-
-
-struct median :
-  public boost::accumulators::depends_on< p_square_quantile_for_median >
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/min.html b/doc/html/boost/accumulators/tag/min.html deleted file mode 100644 index ea2832fe7b..0000000000 --- a/doc/html/boost/accumulators/tag/min.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct min - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct min

-

boost::accumulators::tag::min

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/min.hpp>
-
-
-struct min : public boost::accumulators::depends_on<> {
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/moment.html b/doc/html/boost/accumulators/tag/moment.html deleted file mode 100644 index 7bce933daa..0000000000 --- a/doc/html/boost/accumulators/tag/moment.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct template moment - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template moment

-

boost::accumulators::tag::moment

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<int N> 
-struct moment : public boost::accumulators::depends_on< count > {
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/non_coherent_tail_mean.html b/doc/html/boost/accumulators/tag/non_coherent_tail_mean.html deleted file mode 100644 index 8fb8065cff..0000000000 --- a/doc/html/boost/accumulators/tag/non_coherent_tail_mean.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template non_coherent_tail_mean - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template non_coherent_tail_mean

-

boost::accumulators::tag::non_coherent_tail_mean

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename LeftRight> 
-struct non_coherent_tail_mean :
-  public boost::accumulators::depends_on< count, tail< LeftRight > >
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/non_coherent_w_idp66976320.html b/doc/html/boost/accumulators/tag/non_coherent_w_idp66976320.html deleted file mode 100644 index 078057b1a6..0000000000 --- a/doc/html/boost/accumulators/tag/non_coherent_w_idp66976320.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template non_coherent_weighted_tail_mean - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template non_coherent_weighted_tail_mean

-

boost::accumulators::tag::non_coherent_weighted_tail_mean

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename LeftRight> 
-struct non_coherent_weighted_tail_mean : public boost::accumulators::depends_on< sum_of_weights, tail_weights< LeftRight > >
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/p_square_cumul_idp65140128.html b/doc/html/boost/accumulators/tag/p_square_cumul_idp65140128.html deleted file mode 100644 index b694937ba2..0000000000 --- a/doc/html/boost/accumulators/tag/p_square_cumul_idp65140128.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct p_square_cumulative_distribution - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct p_square_cumulative_distribution

-

boost::accumulators::tag::p_square_cumulative_distribution

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/p_square_cumul_dist.hpp>
-
-
-struct p_square_cumulative_distribution : public boost::accumulators::depends_on< count >,
-                                          public p_square_cumulative_distribution_num_cells
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/p_square_quant_idp65154864.html b/doc/html/boost/accumulators/tag/p_square_quant_idp65154864.html deleted file mode 100644 index 2a5936a7ba..0000000000 --- a/doc/html/boost/accumulators/tag/p_square_quant_idp65154864.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct p_square_quantile_for_median - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct p_square_quantile_for_median

-

boost::accumulators::tag::p_square_quantile_for_median

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/p_square_quantile.hpp>
-
-
-struct p_square_quantile_for_median :
-  public boost::accumulators::depends_on< count >
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/p_square_quantile.html b/doc/html/boost/accumulators/tag/p_square_quantile.html deleted file mode 100644 index 032e5fb57d..0000000000 --- a/doc/html/boost/accumulators/tag/p_square_quantile.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct p_square_quantile - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct p_square_quantile

-

boost::accumulators::tag::p_square_quantile

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/p_square_quantile.hpp>
-
-
-struct p_square_quantile : public boost::accumulators::depends_on< count > {
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/peaks_over_threshold.html b/doc/html/boost/accumulators/tag/peaks_over_threshold.html deleted file mode 100644 index a3f7e2716d..0000000000 --- a/doc/html/boost/accumulators/tag/peaks_over_threshold.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template peaks_over_threshold - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template peaks_over_threshold

-

boost::accumulators::tag::peaks_over_threshold

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename LeftRight> 
-struct peaks_over_threshold :
-  public boost::accumulators::depends_on< count >, public pot_threshold_value
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/peaks_over_threshold_prob.html b/doc/html/boost/accumulators/tag/peaks_over_threshold_prob.html deleted file mode 100644 index 7338c2ad93..0000000000 --- a/doc/html/boost/accumulators/tag/peaks_over_threshold_prob.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template peaks_over_threshold_prob - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template peaks_over_threshold_prob

-

boost::accumulators::tag::peaks_over_threshold_prob

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename LeftRight> 
-struct peaks_over_threshold_prob : public boost::accumulators::depends_on< count, tail< LeftRight > >,
-                                   public pot_threshold_probability
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/pot_quantile.html b/doc/html/boost/accumulators/tag/pot_quantile.html deleted file mode 100644 index 44175bfd97..0000000000 --- a/doc/html/boost/accumulators/tag/pot_quantile.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template pot_quantile - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template pot_quantile

-

boost::accumulators::tag::pot_quantile

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename LeftRight> 
-struct pot_quantile :
-  public boost::accumulators::depends_on< peaks_over_threshold< LeftRight > >
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/pot_quantile_prob.html b/doc/html/boost/accumulators/tag/pot_quantile_prob.html deleted file mode 100644 index 0afe493e0b..0000000000 --- a/doc/html/boost/accumulators/tag/pot_quantile_prob.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template pot_quantile_prob - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template pot_quantile_prob

-

boost::accumulators::tag::pot_quantile_prob

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename LeftRight> 
-struct pot_quantile_prob : public boost::accumulators::depends_on< peaks_over_threshold_prob< LeftRight > >
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/pot_tail_mean.html b/doc/html/boost/accumulators/tag/pot_tail_mean.html deleted file mode 100644 index 98d3fcc667..0000000000 --- a/doc/html/boost/accumulators/tag/pot_tail_mean.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template pot_tail_mean - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template pot_tail_mean

-

boost::accumulators::tag::pot_tail_mean

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename LeftRight> 
-struct pot_tail_mean : public boost::accumulators::depends_on< peaks_over_threshold< LeftRight >, pot_quantile< LeftRight > >
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/pot_tail_mean_prob.html b/doc/html/boost/accumulators/tag/pot_tail_mean_prob.html deleted file mode 100644 index 426920b280..0000000000 --- a/doc/html/boost/accumulators/tag/pot_tail_mean_prob.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template pot_tail_mean_prob - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template pot_tail_mean_prob

-

boost::accumulators::tag::pot_tail_mean_prob

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename LeftRight> 
-struct pot_tail_mean_prob : public boost::accumulators::depends_on< peaks_over_threshold_prob< LeftRight >, pot_quantile_prob< LeftRight > >
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/quantile.html b/doc/html/boost/accumulators/tag/quantile.html deleted file mode 100644 index e9964ec7c3..0000000000 --- a/doc/html/boost/accumulators/tag/quantile.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct quantile - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct quantile

-

boost::accumulators::tag::quantile

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-
-struct quantile : public boost::accumulators::depends_on<> {
-  // types
-  typedef mpl::print< class ____MISSING_SPECIFIC_QUANTILE_FEATURE_IN_ACCUMULATOR_SET____ > impl;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/relative_tail__idp66992464.html b/doc/html/boost/accumulators/tag/relative_tail__idp66992464.html deleted file mode 100644 index bab021932d..0000000000 --- a/doc/html/boost/accumulators/tag/relative_tail__idp66992464.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template relative_tail_variate_means - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template relative_tail_variate_means

-

boost::accumulators::tag::relative_tail_variate_means

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename LeftRight, typename VariateType, typename VariateTag> 
-struct relative_tail_variate_means : public boost::accumulators::depends_on< count, non_coherent_tail_mean< LeftRight >, tail_variate< VariateType, VariateTag, LeftRight > >
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/relative_weigh_idp66995520.html b/doc/html/boost/accumulators/tag/relative_weigh_idp66995520.html deleted file mode 100644 index 7c3982adf9..0000000000 --- a/doc/html/boost/accumulators/tag/relative_weigh_idp66995520.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template relative_weighted_tail_variate_means - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template relative_weighted_tail_variate_means

-

boost::accumulators::tag::relative_weighted_tail_variate_means

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename LeftRight, typename VariateType, typename VariateTag> 
-struct relative_weighted_tail_variate_means : public boost::accumulators::depends_on< non_coherent_weighted_tail_mean< LeftRight >, tail_variate< VariateType, VariateTag, LeftRight >, tail_weights< LeftRight > >
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/right_tail_variate.html b/doc/html/boost/accumulators/tag/right_tail_variate.html deleted file mode 100644 index 93c992daa4..0000000000 --- a/doc/html/boost/accumulators/tag/right_tail_variate.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct template right_tail_variate - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template right_tail_variate

-

boost::accumulators::tag::right_tail_variate

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename VariateType, typename VariateTag, typename LeftRight> 
-struct right_tail_variate {
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/rolling_count.html b/doc/html/boost/accumulators/tag/rolling_count.html deleted file mode 100644 index b838470004..0000000000 --- a/doc/html/boost/accumulators/tag/rolling_count.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Struct rolling_count - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct rolling_count

-

boost::accumulators::tag::rolling_count

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/rolling_count.hpp>
-
-
-struct rolling_count :
-  public boost::accumulators::depends_on< rolling_window_plus1 >
-{
-
-  // public data members
-  static boost::parameter::keyword< tag::rolling_window_size > const window_size;  // tag::rolling_window::window_size named parameter 
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/rolling_mean.html b/doc/html/boost/accumulators/tag/rolling_mean.html deleted file mode 100644 index 0c24bd460e..0000000000 --- a/doc/html/boost/accumulators/tag/rolling_mean.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct rolling_mean - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct rolling_mean

-

boost::accumulators::tag::rolling_mean

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/rolling_mean.hpp>
-
-
-struct rolling_mean : public boost::accumulators::tag::immediate_rolling_mean {
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/rolling_moment.html b/doc/html/boost/accumulators/tag/rolling_moment.html deleted file mode 100644 index 06a035c6d2..0000000000 --- a/doc/html/boost/accumulators/tag/rolling_moment.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Struct template rolling_moment - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template rolling_moment

-

boost::accumulators::tag::rolling_moment

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/rolling_moment.hpp>
-
-template<int N> 
-struct rolling_moment : public boost::accumulators::depends_on< rolling_window_plus1, rolling_count >
-{
-
-  // public data members
-  static boost::parameter::keyword< tag::rolling_window_size > const window_size;  // tag::rolling_window::window_size named parameter 
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/rolling_sum.html b/doc/html/boost/accumulators/tag/rolling_sum.html deleted file mode 100644 index 3f630eccf3..0000000000 --- a/doc/html/boost/accumulators/tag/rolling_sum.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Struct rolling_sum - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct rolling_sum

-

boost::accumulators::tag::rolling_sum

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/rolling_sum.hpp>
-
-
-struct rolling_sum :
-  public boost::accumulators::depends_on< rolling_window_plus1 >
-{
-
-  // public data members
-  static boost::parameter::keyword< tag::rolling_window_size > const window_size;  // tag::rolling_window::window_size named parameter 
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/rolling_variance.html b/doc/html/boost/accumulators/tag/rolling_variance.html deleted file mode 100644 index 7a2b5854bc..0000000000 --- a/doc/html/boost/accumulators/tag/rolling_variance.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct rolling_variance - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct rolling_variance

-

boost::accumulators::tag::rolling_variance

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/rolling_variance.hpp>
-
-
-struct rolling_variance :
-  public boost::accumulators::tag::immediate_rolling_variance
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/rolling_window.html b/doc/html/boost/accumulators/tag/rolling_window.html deleted file mode 100644 index d27dadd731..0000000000 --- a/doc/html/boost/accumulators/tag/rolling_window.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Struct rolling_window - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct rolling_window

-

boost::accumulators::tag::rolling_window

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/rolling_window.hpp>
-
-
-struct rolling_window :
-  public boost::accumulators::depends_on< rolling_window_plus1 >
-{
-
-  // public data members
-  static boost::parameter::keyword< tag::rolling_window_size > const window_size;  // tag::rolling_window::size named parameter 
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/rolling_window_plus1.html b/doc/html/boost/accumulators/tag/rolling_window_plus1.html deleted file mode 100644 index cacfec684b..0000000000 --- a/doc/html/boost/accumulators/tag/rolling_window_plus1.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Struct rolling_window_plus1 - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct rolling_window_plus1

-

boost::accumulators::tag::rolling_window_plus1

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/rolling_window.hpp>
-
-
-struct rolling_window_plus1 :
-  public boost::accumulators::depends_on<>, public rolling_window_size
-{
-
-  // public data members
-  static boost::parameter::keyword< tag::rolling_window_size > const window_size;  // tag::rolling_window::size named parameter 
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/skewness.html b/doc/html/boost/accumulators/tag/skewness.html deleted file mode 100644 index 10b8f653a8..0000000000 --- a/doc/html/boost/accumulators/tag/skewness.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct skewness - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct skewness

-

boost::accumulators::tag::skewness

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/skewness.hpp>
-
-
-struct skewness :
-  public boost::accumulators::depends_on< mean, moment< 2 >, moment< 3 > >
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/sum.html b/doc/html/boost/accumulators/tag/sum.html deleted file mode 100644 index 35a79b086e..0000000000 --- a/doc/html/boost/accumulators/tag/sum.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct sum - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct sum

-

boost::accumulators::tag::sum

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/sum.hpp>
-
-
-struct sum : public boost::accumulators::depends_on<> {
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/sum_kahan.html b/doc/html/boost/accumulators/tag/sum_kahan.html deleted file mode 100644 index 8bea34e553..0000000000 --- a/doc/html/boost/accumulators/tag/sum_kahan.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct sum_kahan - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct sum_kahan

-

boost::accumulators::tag::sum_kahan

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/sum_kahan.hpp>
-
-
-struct sum_kahan : public boost::accumulators::depends_on<> {
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/sum_of_variates.html b/doc/html/boost/accumulators/tag/sum_of_variates.html deleted file mode 100644 index 3549bffd93..0000000000 --- a/doc/html/boost/accumulators/tag/sum_of_variates.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct template sum_of_variates - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template sum_of_variates

-

boost::accumulators::tag::sum_of_variates

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename VariateType, typename VariateTag> 
-struct sum_of_variates : public boost::accumulators::depends_on<> {
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/sum_of_variates_kahan.html b/doc/html/boost/accumulators/tag/sum_of_variates_kahan.html deleted file mode 100644 index 2a9269bd5a..0000000000 --- a/doc/html/boost/accumulators/tag/sum_of_variates_kahan.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct template sum_of_variates_kahan - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template sum_of_variates_kahan

-

boost::accumulators::tag::sum_of_variates_kahan

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename VariateType, typename VariateTag> 
-struct sum_of_variates_kahan : public boost::accumulators::depends_on<> {
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/sum_of_weights.html b/doc/html/boost/accumulators/tag/sum_of_weights.html deleted file mode 100644 index c439d0c435..0000000000 --- a/doc/html/boost/accumulators/tag/sum_of_weights.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct sum_of_weights - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct sum_of_weights

-

boost::accumulators::tag::sum_of_weights

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/sum.hpp>
-
-
-struct sum_of_weights : public boost::accumulators::depends_on<> {
-  // types
-  typedef mpl::true_ is_weight_accumulator;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/sum_of_weights_kahan.html b/doc/html/boost/accumulators/tag/sum_of_weights_kahan.html deleted file mode 100644 index 3a014aa64a..0000000000 --- a/doc/html/boost/accumulators/tag/sum_of_weights_kahan.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct sum_of_weights_kahan - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct sum_of_weights_kahan

-

boost::accumulators::tag::sum_of_weights_kahan

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/sum_kahan.hpp>
-
-
-struct sum_of_weights_kahan : public boost::accumulators::depends_on<> {
-  // types
-  typedef mpl::true_ is_weight_accumulator;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/tail.html b/doc/html/boost/accumulators/tag/tail.html deleted file mode 100644 index 326d55d76f..0000000000 --- a/doc/html/boost/accumulators/tag/tail.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template tail - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template tail

-

boost::accumulators::tag::tail

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename LeftRight> 
-struct tail : public boost::accumulators::depends_on<>,
-              public boost::accumulators::tail_cache_size_named_arg< LeftRight >
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/tail_mean.html b/doc/html/boost/accumulators/tag/tail_mean.html deleted file mode 100644 index 2dc6f19ef4..0000000000 --- a/doc/html/boost/accumulators/tag/tail_mean.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct tail_mean - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct tail_mean

-

boost::accumulators::tag::tail_mean

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-
-struct tail_mean : public boost::accumulators::depends_on<> {
-  // types
-  typedef mpl::print< class ____MISSING_SPECIFIC_TAIL_MEAN_FEATURE_IN_ACCUMULATOR_SET____ > impl;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/tail_quantile.html b/doc/html/boost/accumulators/tag/tail_quantile.html deleted file mode 100644 index 6e155af71d..0000000000 --- a/doc/html/boost/accumulators/tag/tail_quantile.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template tail_quantile - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template tail_quantile

-

boost::accumulators::tag::tail_quantile

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename LeftRight> 
-struct tail_quantile :
-  public boost::accumulators::depends_on< count, tail< LeftRight > >
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/tail_variate.html b/doc/html/boost/accumulators/tag/tail_variate.html deleted file mode 100644 index 9233ec66be..0000000000 --- a/doc/html/boost/accumulators/tag/tail_variate.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template tail_variate - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template tail_variate

-

boost::accumulators::tag::tail_variate

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename VariateType, typename VariateTag, typename LeftRight> 
-struct tail_variate :
-  public boost::accumulators::depends_on< tail< LeftRight > >
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/tail_variate_means.html b/doc/html/boost/accumulators/tag/tail_variate_means.html deleted file mode 100644 index 4115a83b02..0000000000 --- a/doc/html/boost/accumulators/tag/tail_variate_means.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct template tail_variate_means - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template tail_variate_means

-

boost::accumulators::tag::tail_variate_means

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename LeftRight, typename VariateType, typename VariateTag> 
-struct tail_variate_means {
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/tail_weights.html b/doc/html/boost/accumulators/tag/tail_weights.html deleted file mode 100644 index 2423548bc3..0000000000 --- a/doc/html/boost/accumulators/tag/tail_weights.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template tail_weights - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template tail_weights

-

boost::accumulators::tag::tail_weights

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename LeftRight> 
-struct tail_weights :
-  public boost::accumulators::depends_on< tail< LeftRight > >
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/variance.html b/doc/html/boost/accumulators/tag/variance.html deleted file mode 100644 index d7252d4112..0000000000 --- a/doc/html/boost/accumulators/tag/variance.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct variance - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct variance

-

boost::accumulators::tag::variance

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/variance.hpp>
-
-
-struct variance :
-  public boost::accumulators::depends_on< count, immediate_mean >
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/weighted_covariance.html b/doc/html/boost/accumulators/tag/weighted_covariance.html deleted file mode 100644 index 6257980e8e..0000000000 --- a/doc/html/boost/accumulators/tag/weighted_covariance.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template weighted_covariance - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template weighted_covariance

-

boost::accumulators::tag::weighted_covariance

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename VariateType, typename VariateTag> 
-struct weighted_covariance : public boost::accumulators::depends_on< count, sum_of_weights, weighted_mean, weighted_mean_of_variates< VariateType, VariateTag > >
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/weighted_density.html b/doc/html/boost/accumulators/tag/weighted_density.html deleted file mode 100644 index 88a8dc0435..0000000000 --- a/doc/html/boost/accumulators/tag/weighted_density.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Struct weighted_density - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct weighted_density

-

boost::accumulators::tag::weighted_density

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_density.hpp>
-
-
-struct weighted_density : public boost::accumulators::depends_on< count, sum_of_weights, min, max >,
-                          public density_cache_size,
-                          public density_num_bins
-{
-
-  // public data members
-  static boost::parameter::keyword< density_cache_size > const cache_size;
-  static boost::parameter::keyword< density_num_bins > const num_bins;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/weighted_exten_idp64998384.html b/doc/html/boost/accumulators/tag/weighted_exten_idp64998384.html deleted file mode 100644 index 0b1a1a8e4a..0000000000 --- a/doc/html/boost/accumulators/tag/weighted_exten_idp64998384.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Struct weighted_extended_p_square_quantile - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct weighted_extended_p_square_quantile

-

boost::accumulators::tag::weighted_extended_p_square_quantile

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/extended_p_square_quantile.hpp>
-
-
-struct weighted_extended_p_square_quantile :
-  public boost::accumulators::depends_on< weighted_extended_p_square >
-{
-  // types
-  typedef accumulators::impl::extended_p_square_quantile_impl< mpl::_1, weighted, linear > impl;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/weighted_exten_idp65001472.html b/doc/html/boost/accumulators/tag/weighted_exten_idp65001472.html deleted file mode 100644 index ef904b8c72..0000000000 --- a/doc/html/boost/accumulators/tag/weighted_exten_idp65001472.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Struct weighted_extended_p_square_quantile_quadratic - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct weighted_extended_p_square_quantile_quadratic

-

boost::accumulators::tag::weighted_extended_p_square_quantile_quadratic

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/extended_p_square_quantile.hpp>
-
-
-struct weighted_extended_p_square_quantile_quadratic :
-  public boost::accumulators::depends_on< weighted_extended_p_square >
-{
-  // types
-  typedef accumulators::impl::extended_p_square_quantile_impl< mpl::_1, weighted, quadratic > impl;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/weighted_extended_p_square.html b/doc/html/boost/accumulators/tag/weighted_extended_p_square.html deleted file mode 100644 index be4c607c7d..0000000000 --- a/doc/html/boost/accumulators/tag/weighted_extended_p_square.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Struct weighted_extended_p_square - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct weighted_extended_p_square

-

boost::accumulators::tag::weighted_extended_p_square

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_extended_p_square.hpp>
-
-
-struct weighted_extended_p_square : public boost::accumulators::depends_on< count, sum_of_weights >,
-                                    public extended_p_square_probabilities
-{
-  // types
-  typedef accumulators::impl::weighted_extended_p_square_impl< mpl::_1, mpl::_2 > impl;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/weighted_kurtosis.html b/doc/html/boost/accumulators/tag/weighted_kurtosis.html deleted file mode 100644 index 3a66177bae..0000000000 --- a/doc/html/boost/accumulators/tag/weighted_kurtosis.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct weighted_kurtosis - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct weighted_kurtosis

-

boost::accumulators::tag::weighted_kurtosis

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_kurtosis.hpp>
-
-
-struct weighted_kurtosis : public boost::accumulators::depends_on< weighted_mean, weighted_moment< 2 >, weighted_moment< 3 >, weighted_moment< 4 > >
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/weighted_mean.html b/doc/html/boost/accumulators/tag/weighted_mean.html deleted file mode 100644 index dca41f98ec..0000000000 --- a/doc/html/boost/accumulators/tag/weighted_mean.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct weighted_mean - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct weighted_mean

-

boost::accumulators::tag::weighted_mean

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_mean.hpp>
-
-
-struct weighted_mean :
-  public boost::accumulators::depends_on< sum_of_weights, weighted_sum >
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/weighted_mean_of_variates.html b/doc/html/boost/accumulators/tag/weighted_mean_of_variates.html deleted file mode 100644 index b2e71b0a11..0000000000 --- a/doc/html/boost/accumulators/tag/weighted_mean_of_variates.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template weighted_mean_of_variates - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template weighted_mean_of_variates

-

boost::accumulators::tag::weighted_mean_of_variates

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename VariateType, typename VariateTag> 
-struct weighted_mean_of_variates : public boost::accumulators::depends_on< sum_of_weights, weighted_sum_of_variates< VariateType, VariateTag > >
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/weighted_median.html b/doc/html/boost/accumulators/tag/weighted_median.html deleted file mode 100644 index c53994927c..0000000000 --- a/doc/html/boost/accumulators/tag/weighted_median.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct weighted_median - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct weighted_median

-

boost::accumulators::tag::weighted_median

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_median.hpp>
-
-
-struct weighted_median : public boost::accumulators::depends_on< weighted_p_square_quantile_for_median >
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/weighted_moment.html b/doc/html/boost/accumulators/tag/weighted_moment.html deleted file mode 100644 index 0311af6915..0000000000 --- a/doc/html/boost/accumulators/tag/weighted_moment.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template weighted_moment - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template weighted_moment

-

boost::accumulators::tag::weighted_moment

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<int N> 
-struct weighted_moment :
-  public boost::accumulators::depends_on< count, sum_of_weights >
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/weighted_p_squ_idp65811408.html b/doc/html/boost/accumulators/tag/weighted_p_squ_idp65811408.html deleted file mode 100644 index 8724dede15..0000000000 --- a/doc/html/boost/accumulators/tag/weighted_p_squ_idp65811408.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Struct weighted_p_square_cumulative_distribution - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct weighted_p_square_cumulative_distribution

-

boost::accumulators::tag::weighted_p_square_cumulative_distribution

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_p_square_cumul_dist.hpp>
-
-
-struct weighted_p_square_cumulative_distribution : public boost::accumulators::depends_on< count, sum_of_weights >,
-                                                   public p_square_cumulative_distribution_num_cells
-{
-  // types
-  typedef accumulators::impl::weighted_p_square_cumulative_distribution_impl< mpl::_1, mpl::_2 > impl;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/weighted_p_squ_idp65825264.html b/doc/html/boost/accumulators/tag/weighted_p_squ_idp65825264.html deleted file mode 100644 index d18012f177..0000000000 --- a/doc/html/boost/accumulators/tag/weighted_p_squ_idp65825264.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Struct weighted_p_square_quantile_for_median - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct weighted_p_square_quantile_for_median

-

boost::accumulators::tag::weighted_p_square_quantile_for_median

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_p_square_quantile.hpp>
-
-
-struct weighted_p_square_quantile_for_median :
-  public boost::accumulators::depends_on< count, sum_of_weights >
-{
-  // types
-  typedef accumulators::impl::weighted_p_square_quantile_impl< mpl::_1, mpl::_2, for_median > impl;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/weighted_p_square_quantile.html b/doc/html/boost/accumulators/tag/weighted_p_square_quantile.html deleted file mode 100644 index 3257493589..0000000000 --- a/doc/html/boost/accumulators/tag/weighted_p_square_quantile.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Struct weighted_p_square_quantile - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct weighted_p_square_quantile

-

boost::accumulators::tag::weighted_p_square_quantile

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_p_square_quantile.hpp>
-
-
-struct weighted_p_square_quantile :
-  public boost::accumulators::depends_on< count, sum_of_weights >
-{
-  // types
-  typedef accumulators::impl::weighted_p_square_quantile_impl< mpl::_1, mpl::_2, regular > impl;
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/weighted_peaks_idp67026176.html b/doc/html/boost/accumulators/tag/weighted_peaks_idp67026176.html deleted file mode 100644 index e58bee90c9..0000000000 --- a/doc/html/boost/accumulators/tag/weighted_peaks_idp67026176.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template weighted_peaks_over_threshold - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template weighted_peaks_over_threshold

-

boost::accumulators::tag::weighted_peaks_over_threshold

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename LeftRight> 
-struct weighted_peaks_over_threshold : public boost::accumulators::depends_on< sum_of_weights >,
-                                       public pot_threshold_value
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/weighted_peaks_idp67028592.html b/doc/html/boost/accumulators/tag/weighted_peaks_idp67028592.html deleted file mode 100644 index 983e68319a..0000000000 --- a/doc/html/boost/accumulators/tag/weighted_peaks_idp67028592.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template weighted_peaks_over_threshold_prob - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template weighted_peaks_over_threshold_prob

-

boost::accumulators::tag::weighted_peaks_over_threshold_prob

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename LeftRight> 
-struct weighted_peaks_over_threshold_prob : public boost::accumulators::depends_on< sum_of_weights, tail_weights< LeftRight > >,
-                                            public pot_threshold_probability
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/weighted_pot_quantile.html b/doc/html/boost/accumulators/tag/weighted_pot_quantile.html deleted file mode 100644 index 82e955a040..0000000000 --- a/doc/html/boost/accumulators/tag/weighted_pot_quantile.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template weighted_pot_quantile - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template weighted_pot_quantile

-

boost::accumulators::tag::weighted_pot_quantile

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename LeftRight> 
-struct weighted_pot_quantile : public boost::accumulators::depends_on< weighted_peaks_over_threshold< LeftRight > >
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/weighted_pot_quantile_prob.html b/doc/html/boost/accumulators/tag/weighted_pot_quantile_prob.html deleted file mode 100644 index 926d80be50..0000000000 --- a/doc/html/boost/accumulators/tag/weighted_pot_quantile_prob.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template weighted_pot_quantile_prob - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template weighted_pot_quantile_prob

-

boost::accumulators::tag::weighted_pot_quantile_prob

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename LeftRight> 
-struct weighted_pot_quantile_prob : public boost::accumulators::depends_on< weighted_peaks_over_threshold_prob< LeftRight > >
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/weighted_pot_t_idp67036720.html b/doc/html/boost/accumulators/tag/weighted_pot_t_idp67036720.html deleted file mode 100644 index 66299f5f5f..0000000000 --- a/doc/html/boost/accumulators/tag/weighted_pot_t_idp67036720.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template weighted_pot_tail_mean_prob - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template weighted_pot_tail_mean_prob

-

boost::accumulators::tag::weighted_pot_tail_mean_prob

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename LeftRight> 
-struct weighted_pot_tail_mean_prob : public boost::accumulators::depends_on< weighted_peaks_over_threshold_prob< LeftRight >, weighted_pot_quantile_prob< LeftRight > >
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/weighted_pot_tail_mean.html b/doc/html/boost/accumulators/tag/weighted_pot_tail_mean.html deleted file mode 100644 index 8b61bea3a7..0000000000 --- a/doc/html/boost/accumulators/tag/weighted_pot_tail_mean.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template weighted_pot_tail_mean - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template weighted_pot_tail_mean

-

boost::accumulators::tag::weighted_pot_tail_mean

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename LeftRight> 
-struct weighted_pot_tail_mean : public boost::accumulators::depends_on< weighted_peaks_over_threshold< LeftRight >, weighted_pot_quantile< LeftRight > >
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/weighted_skewness.html b/doc/html/boost/accumulators/tag/weighted_skewness.html deleted file mode 100644 index 4be79c20bc..0000000000 --- a/doc/html/boost/accumulators/tag/weighted_skewness.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct weighted_skewness - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct weighted_skewness

-

boost::accumulators::tag::weighted_skewness

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_skewness.hpp>
-
-
-struct weighted_skewness : public boost::accumulators::depends_on< weighted_mean, weighted_moment< 2 >, weighted_moment< 3 > >
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/weighted_sum.html b/doc/html/boost/accumulators/tag/weighted_sum.html deleted file mode 100644 index ebdd590635..0000000000 --- a/doc/html/boost/accumulators/tag/weighted_sum.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct weighted_sum - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct weighted_sum

-

boost::accumulators::tag::weighted_sum

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_sum.hpp>
-
-
-struct weighted_sum : public boost::accumulators::depends_on<> {
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/weighted_sum_kahan.html b/doc/html/boost/accumulators/tag/weighted_sum_kahan.html deleted file mode 100644 index 5053b24334..0000000000 --- a/doc/html/boost/accumulators/tag/weighted_sum_kahan.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct weighted_sum_kahan - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct weighted_sum_kahan

-

boost::accumulators::tag::weighted_sum_kahan

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_sum_kahan.hpp>
-
-
-struct weighted_sum_kahan : public boost::accumulators::depends_on<> {
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/weighted_sum_o_idp65873088.html b/doc/html/boost/accumulators/tag/weighted_sum_o_idp65873088.html deleted file mode 100644 index 536eff1a06..0000000000 --- a/doc/html/boost/accumulators/tag/weighted_sum_o_idp65873088.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template weighted_sum_of_variates_kahan - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template weighted_sum_of_variates_kahan

-

boost::accumulators::tag::weighted_sum_of_variates_kahan

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_sum_kahan.hpp>
-
-template<typename VariateType, typename VariateTag> 
-struct weighted_sum_of_variates_kahan :
-  public boost::accumulators::depends_on<>
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/weighted_sum_of_variates.html b/doc/html/boost/accumulators/tag/weighted_sum_of_variates.html deleted file mode 100644 index 2faab0ef9e..0000000000 --- a/doc/html/boost/accumulators/tag/weighted_sum_of_variates.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct template weighted_sum_of_variates - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template weighted_sum_of_variates

-

boost::accumulators::tag::weighted_sum_of_variates

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename VariateType, typename VariateTag> 
-struct weighted_sum_of_variates : public boost::accumulators::depends_on<> {
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/weighted_tail__idp67042928.html b/doc/html/boost/accumulators/tag/weighted_tail__idp67042928.html deleted file mode 100644 index 656c97ecfe..0000000000 --- a/doc/html/boost/accumulators/tag/weighted_tail__idp67042928.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct template weighted_tail_variate_means - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template weighted_tail_variate_means

-

boost::accumulators::tag::weighted_tail_variate_means

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename LeftRight, typename VariateType, typename VariateTag> 
-struct weighted_tail_variate_means {
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/weighted_tail_quantile.html b/doc/html/boost/accumulators/tag/weighted_tail_quantile.html deleted file mode 100644 index 867a3cd71a..0000000000 --- a/doc/html/boost/accumulators/tag/weighted_tail_quantile.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template weighted_tail_quantile - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template weighted_tail_quantile

-

boost::accumulators::tag::weighted_tail_quantile

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename LeftRight> 
-struct weighted_tail_quantile : public boost::accumulators::depends_on< sum_of_weights, tail_weights< LeftRight > >
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/weighted_variance.html b/doc/html/boost/accumulators/tag/weighted_variance.html deleted file mode 100644 index 6e258dc1b4..0000000000 --- a/doc/html/boost/accumulators/tag/weighted_variance.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct weighted_variance - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct weighted_variance

-

boost::accumulators::tag::weighted_variance

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_variance.hpp>
-
-
-struct weighted_variance :
-  public boost::accumulators::depends_on< count, immediate_weighted_mean >
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/with_density_median.html b/doc/html/boost/accumulators/tag/with_density_median.html deleted file mode 100644 index 430c712080..0000000000 --- a/doc/html/boost/accumulators/tag/with_density_median.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct with_density_median - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct with_density_median

-

boost::accumulators::tag::with_density_median

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/median.hpp>
-
-
-struct with_density_median :
-  public boost::accumulators::depends_on< count, density >
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/with_density_w_idp65798960.html b/doc/html/boost/accumulators/tag/with_density_w_idp65798960.html deleted file mode 100644 index 872fdc3554..0000000000 --- a/doc/html/boost/accumulators/tag/with_density_w_idp65798960.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct with_density_weighted_median - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct with_density_weighted_median

-

boost::accumulators::tag::with_density_weighted_median

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_median.hpp>
-
-
-struct with_density_weighted_median :
-  public boost::accumulators::depends_on< count, weighted_density >
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/with_p_square__idp65111616.html b/doc/html/boost/accumulators/tag/with_p_square__idp65111616.html deleted file mode 100644 index 1bf75e63ba..0000000000 --- a/doc/html/boost/accumulators/tag/with_p_square__idp65111616.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct with_p_square_cumulative_distribution_median - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct with_p_square_cumulative_distribution_median

-

boost::accumulators::tag::with_p_square_cumulative_distribution_median

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/median.hpp>
-
-
-struct with_p_square_cumulative_distribution_median :
-  public boost::accumulators::depends_on< p_square_cumulative_distribution >
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tag/with_p_square__idp65799984.html b/doc/html/boost/accumulators/tag/with_p_square__idp65799984.html deleted file mode 100644 index 30d51ffa9e..0000000000 --- a/doc/html/boost/accumulators/tag/with_p_square__idp65799984.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct with_p_square_cumulative_distribution_weighted_median - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct with_p_square_cumulative_distribution_weighted_median

-

boost::accumulators::tag::with_p_square_cumulative_distribution_weighted_median

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/weighted_median.hpp>
-
-
-struct with_p_square_cumulative_distribution_weighted_median : public boost::accumulators::depends_on< weighted_p_square_cumulative_distribution >
-{
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tail_cache_siz_idp65602800.html b/doc/html/boost/accumulators/tail_cache_siz_idp65602800.html deleted file mode 100644 index 428e09ccd8..0000000000 --- a/doc/html/boost/accumulators/tail_cache_siz_idp65602800.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct tail_cache_size_named_arg<left> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct tail_cache_size_named_arg<left>

-

boost::accumulators::tail_cache_size_named_arg<left>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/tail.hpp>
-
-
-struct tail_cache_size_named_arg<left> : public left_tail_cache_size {
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tail_cache_siz_idp65604480.html b/doc/html/boost/accumulators/tail_cache_siz_idp65604480.html deleted file mode 100644 index 851ae32b16..0000000000 --- a/doc/html/boost/accumulators/tail_cache_siz_idp65604480.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct tail_cache_size_named_arg<right> - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct tail_cache_size_named_arg<right>

-

boost::accumulators::tail_cache_size_named_arg<right>

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/tail.hpp>
-
-
-struct tail_cache_size_named_arg<right> : public right_tail_cache_size {
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/tail_cache_size_named_arg.html b/doc/html/boost/accumulators/tail_cache_size_named_arg.html deleted file mode 100644 index d5eff0b698..0000000000 --- a/doc/html/boost/accumulators/tail_cache_size_named_arg.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct template tail_cache_size_named_arg - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template tail_cache_size_named_arg

-

boost::accumulators::tail_cache_size_named_arg

-
-

Synopsis

-
// In header: <boost/accumulators/statistics/tail.hpp>
-
-template<typename T> 
-struct tail_cache_size_named_arg {
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/unweighted.html b/doc/html/boost/accumulators/unweighted.html deleted file mode 100644 index 3757f216f9..0000000000 --- a/doc/html/boost/accumulators/unweighted.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct unweighted - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct unweighted

-

boost::accumulators::unweighted

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-
-struct unweighted {
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/weighted.html b/doc/html/boost/accumulators/weighted.html deleted file mode 100644 index 0a2fc69036..0000000000 --- a/doc/html/boost/accumulators/weighted.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct weighted - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct weighted

-

boost::accumulators::weighted

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-
-struct weighted {
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/weights.html b/doc/html/boost/accumulators/weights.html index 91aa017b8a..92278c5586 100644 --- a/doc/html/boost/accumulators/weights.html +++ b/doc/html/boost/accumulators/weights.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
-PrevUpHomeNext +PrevUpHomeNext
@@ -44,7 +44,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/boost/accumulators/with_cached_result.html b/doc/html/boost/accumulators/with_cached_result.html index f4e29b8bb2..b0d4bb8805 100644 --- a/doc/html/boost/accumulators/with_cached_result.html +++ b/doc/html/boost/accumulators/with_cached_result.html @@ -35,49 +35,49 @@ template<typename Accumulator> struct with_cached_result : public Accumulator { // construct/copy/destruct - template<typename Args> with_cached_result(Args const &); - with_cached_result(with_cached_result const &); - with_cached_result & operator=(with_cached_result const &); - ~with_cached_result(); + template<typename Args> with_cached_result(Args const &); + with_cached_result(with_cached_result const &); + with_cached_result & operator=(with_cached_result const &); + ~with_cached_result(); - // public member functions - template<typename Args> void on_drop(Args const &); - template<typename Args> result_type result(Args const &) const; + // public member functions + template<typename Args> void on_drop(Args const &); + template<typename Args> result_type result(Args const &) const; - // private member functions - void set(result_type const &); - result_type const & get() const; - bool has_result() const; + // private member functions + void set(result_type const &); + result_type const & get() const; + bool has_result() const; };
-

Description

+

Description

-

+

with_cached_result public construct/copy/destruct

    -
  1. template<typename Args> with_cached_result(Args const & args);
    2. -
  2. with_cached_result(with_cached_result const & that);
    3. -
  3. with_cached_result & operator=(with_cached_result const &);
    4. -
  4. ~with_cached_result();
    5. +
  5. template<typename Args> with_cached_result(Args const & args);
    6. +
  6. with_cached_result(with_cached_result const & that);
    7. +
  7. with_cached_result & operator=(with_cached_result const &);
    8. +
  8. ~with_cached_result();
-

-with_cached_result public member functions

+

+with_cached_result public member functions

    -
  1. template<typename Args> void on_drop(Args const & args);
    2. -
  2. template<typename Args> result_type result(Args const & args) const;
    3. +
  3. template<typename Args> void on_drop(Args const & args);
    4. +
  4. template<typename Args> result_type result(Args const & args) const;
-

-with_cached_result private member functions

+

+with_cached_result private member functions

    -
  1. void set(result_type const & r);
    2. -
  2. result_type const & get() const;
    3. -
  3. bool has_result() const;
    4. +
  4. void set(result_type const & r);
    5. +
  5. result_type const & get() const;
    6. +
  6. bool has_result() const;
diff --git a/doc/html/boost/accumulators/with_density.html b/doc/html/boost/accumulators/with_density.html deleted file mode 100644 index 49c61b9217..0000000000 --- a/doc/html/boost/accumulators/with_density.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct with_density - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct with_density

-

boost::accumulators::with_density

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-
-struct with_density {
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/with_error.html b/doc/html/boost/accumulators/with_error.html deleted file mode 100644 index f5a1e28cc0..0000000000 --- a/doc/html/boost/accumulators/with_error.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct template with_error - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct template with_error

-

boost::accumulators::with_error

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-template<typename Feature1, typename Feature2, ... > 
-struct with_error {
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/with_p_square__idp65938128.html b/doc/html/boost/accumulators/with_p_square__idp65938128.html deleted file mode 100644 index 0ec5a5e173..0000000000 --- a/doc/html/boost/accumulators/with_p_square__idp65938128.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct with_p_square_cumulative_distribution - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct with_p_square_cumulative_distribution

-

boost::accumulators::with_p_square_cumulative_distribution

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-
-struct with_p_square_cumulative_distribution {
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/with_p_square_quantile.html b/doc/html/boost/accumulators/with_p_square_quantile.html deleted file mode 100644 index 3374a9cc2c..0000000000 --- a/doc/html/boost/accumulators/with_p_square_quantile.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct with_p_square_quantile - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct with_p_square_quantile

-

boost::accumulators::with_p_square_quantile

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-
-struct with_p_square_quantile {
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/with_threshold_probability.html b/doc/html/boost/accumulators/with_threshold_probability.html deleted file mode 100644 index 2657ee208d..0000000000 --- a/doc/html/boost/accumulators/with_threshold_probability.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct with_threshold_probability - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct with_threshold_probability

-

boost::accumulators::with_threshold_probability

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-
-struct with_threshold_probability {
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/accumulators/with_threshold_value.html b/doc/html/boost/accumulators/with_threshold_value.html deleted file mode 100644 index 7462903b99..0000000000 --- a/doc/html/boost/accumulators/with_threshold_value.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct with_threshold_value - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct with_threshold_value

-

boost::accumulators::with_threshold_value

-
-

Synopsis

-
// In header: <boost/accumulators/statistics_fwd.hpp>
-
-
-struct with_threshold_value {
-};
-
- - - -
Copyright © 2005, 2006 Eric Niebler

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/adl_move_swap.html b/doc/html/boost/adl_move_swap.html index 275fb3325c..3fbe5d0119 100644 --- a/doc/html/boost/adl_move_swap.html +++ b/doc/html/boost/adl_move_swap.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
-PrevUpHomeNext +PrevUpHomeNext
@@ -35,7 +35,7 @@ template<typename T> void adl_move_swap(T & x, T & y);
-

Description

+

Description

Exchanges the values of a and b, using Argument Dependent Lookup (ADL) to select a specialized swap function if available. If no specialized swap function is available, std::swap is used.

Exception: If T uses Boost.Move's move emulation and the compiler has no rvalue references then:

    @@ -56,7 +56,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/algorithm/FinderConcept.html b/doc/html/boost/algorithm/FinderConcept.html index 6f32001848..c3cb27beb5 100644 --- a/doc/html/boost/algorithm/FinderConcept.html +++ b/doc/html/boost/algorithm/FinderConcept.html @@ -35,17 +35,17 @@ template<typename FinderT, typename IteratorT> struct FinderConcept { - // public member functions - void constraints(); + // public member functions + void constraints(); };
-

Description

+

Description

Defines the Finder concept. Finder is a functor which selects an arbitrary part of a string. Search is performed on the range specified by starting and ending iterators.

Result of the find operation must be convertible to iterator_range.

-

-FinderConcept public member functions

-
  1. void constraints();
+

+FinderConcept public member functions

+
  1. void constraints();
diff --git a/doc/html/boost/algorithm/FormatterConcept.html b/doc/html/boost/algorithm/FormatterConcept.html index b4101ec84e..31df48288d 100644 --- a/doc/html/boost/algorithm/FormatterConcept.html +++ b/doc/html/boost/algorithm/FormatterConcept.html @@ -35,17 +35,17 @@ template<typename FormatterT, typename FinderT, typename IteratorT> struct FormatterConcept { - // public member functions - void constraints(); + // public member functions + void constraints(); };
-

Description

+

Description

Defines the Formatter concept. Formatter is a functor, which takes a result from a finder operation and transforms it in a specific way.

Result must be a container supported by container_traits, or a reference to it.

-

-FormatterConcept public member functions

-
  1. void constraints();
+

+FormatterConcept public member functions

+
  1. void constraints();
diff --git a/doc/html/boost/algorithm/all.html b/doc/html/boost/algorithm/all.html index 73544e2dd3..0d77d5d23b 100644 --- a/doc/html/boost/algorithm/all.html +++ b/doc/html/boost/algorithm/all.html @@ -36,7 +36,7 @@ template<typename RangeT, typename PredicateT> bool all(const RangeT & Input, PredicateT Pred);
-

Description

+

Description

This predicate holds it all its elements satisfy a given condition, represented by the predicate.

diff --git a/doc/html/boost/algorithm/const_formatter.html b/doc/html/boost/algorithm/const_formatter.html index b17d1c9d30..d32456a5f3 100644 --- a/doc/html/boost/algorithm/const_formatter.html +++ b/doc/html/boost/algorithm/const_formatter.html @@ -35,7 +35,7 @@ template<typename RangeT> unspecified const_formatter(const RangeT & Format);

-

Description

+

Description

Constructs a const_formatter. Const formatter always returns the same value, regardless of the parameter.

diff --git a/doc/html/boost/algorithm/contains.html b/doc/html/boost/algorithm/contains.html index 10217d3369..e20c0101ab 100644 --- a/doc/html/boost/algorithm/contains.html +++ b/doc/html/boost/algorithm/contains.html @@ -38,7 +38,7 @@ template<typename Range1T, typename Range2T> bool contains(const Range1T & Input, const Range2T & Test);

-

Description

+

Description

This predicate holds when the test container is contained in the Input. When the optional predicate is specified, it is used for character-wise comparison.

diff --git a/doc/html/boost/algorithm/dissect_formatter.html b/doc/html/boost/algorithm/dissect_formatter.html index 538563275f..3f5ffd4b41 100644 --- a/doc/html/boost/algorithm/dissect_formatter.html +++ b/doc/html/boost/algorithm/dissect_formatter.html @@ -36,7 +36,7 @@ template<typename FinderT> unspecified dissect_formatter(const FinderT & Finder);

-

Description

+

Description

Constructs a dissect_formatter. Dissect formatter uses a specified finder to extract a portion of the formatted sequence. The first finder's match is returned as a result

diff --git a/doc/html/boost/algorithm/empty_formatter.html b/doc/html/boost/algorithm/empty_formatter.html index 00b4e07d57..50950cff90 100644 --- a/doc/html/boost/algorithm/empty_formatter.html +++ b/doc/html/boost/algorithm/empty_formatter.html @@ -35,7 +35,7 @@ template<typename RangeT> unspecified empty_formatter(const RangeT &);

-

Description

+

Description

Constructs an empty_formatter. Empty formatter always returns an empty sequence.

diff --git a/doc/html/boost/algorithm/ends_with.html b/doc/html/boost/algorithm/ends_with.html index d0ca87fe88..c3d667c056 100644 --- a/doc/html/boost/algorithm/ends_with.html +++ b/doc/html/boost/algorithm/ends_with.html @@ -38,7 +38,7 @@ template<typename Range1T, typename Range2T> bool ends_with(const Range1T & Input, const Range2T & Test);

-

Description

+

Description

This predicate holds when the test string is a suffix of the Input. In other words, if the input ends with the test. When the optional predicate is specified, it is used for character-wise comparison.

diff --git a/doc/html/boost/algorithm/equals.html b/doc/html/boost/algorithm/equals.html index 7f555e863c..ac4439b994 100644 --- a/doc/html/boost/algorithm/equals.html +++ b/doc/html/boost/algorithm/equals.html @@ -38,7 +38,7 @@ template<typename Range1T, typename Range2T> bool equals(const Range1T & Input, const Range2T & Test);

-

Description

+

Description

This predicate holds when the test container is equal to the input container i.e. all elements in both containers are same. When the optional predicate is specified, it is used for character-wise comparison.

diff --git a/doc/html/boost/algorithm/erase_all.html b/doc/html/boost/algorithm/erase_all.html index 89c12437c9..e76ef1f489 100644 --- a/doc/html/boost/algorithm/erase_all.html +++ b/doc/html/boost/algorithm/erase_all.html @@ -36,7 +36,7 @@ template<typename SequenceT, typename RangeT> void erase_all(SequenceT & Input, const RangeT & Search);

-

Description

+

Description

Remove all the occurrences of the string from the input. The input sequence is modified in-place.

diff --git a/doc/html/boost/algorithm/erase_all_copy.html b/doc/html/boost/algorithm/erase_all_copy.html index 92e68f7c9a..b7b574a5a1 100644 --- a/doc/html/boost/algorithm/erase_all_copy.html +++ b/doc/html/boost/algorithm/erase_all_copy.html @@ -40,7 +40,7 @@ template<typename SequenceT, typename RangeT> SequenceT erase_all_copy(const SequenceT & Input, const RangeT & Search);
-

Description

+

Description

Remove all the occurrences of the string from the input. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator.

diff --git a/doc/html/boost/algorithm/erase_all_regex.html b/doc/html/boost/algorithm/erase_all_regex.html index b2be82434b..f62fef5d9c 100644 --- a/doc/html/boost/algorithm/erase_all_regex.html +++ b/doc/html/boost/algorithm/erase_all_regex.html @@ -38,7 +38,7 @@ const basic_regex< CharT, RegexTraitsT > & Rx, match_flag_type Flags = match_default);

-

Description

+

Description

Erase all substrings, matching given regex, from the input. The input string is modified in-place.

diff --git a/doc/html/boost/algorithm/erase_all_regex_copy.html b/doc/html/boost/algorithm/erase_all_regex_copy.html index b3a9cb1cb0..3bd3fb3b2e 100644 --- a/doc/html/boost/algorithm/erase_all_regex_copy.html +++ b/doc/html/boost/algorithm/erase_all_regex_copy.html @@ -44,7 +44,7 @@ const basic_regex< CharT, RegexTraitsT > & Rx, match_flag_type Flags = match_default);
-

Description

+

Description

Erase all substrings, matching given regex, from the input. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator.

diff --git a/doc/html/boost/algorithm/erase_first.html b/doc/html/boost/algorithm/erase_first.html index 19fff3b880..9a0e742b41 100644 --- a/doc/html/boost/algorithm/erase_first.html +++ b/doc/html/boost/algorithm/erase_first.html @@ -36,7 +36,7 @@ template<typename SequenceT, typename RangeT> void erase_first(SequenceT & Input, const RangeT & Search);

-

Description

+

Description

Remove the first occurrence of the substring from the input. The input sequence is modified in-place.

diff --git a/doc/html/boost/algorithm/erase_first_copy.html b/doc/html/boost/algorithm/erase_first_copy.html index e525726346..723698bd9d 100644 --- a/doc/html/boost/algorithm/erase_first_copy.html +++ b/doc/html/boost/algorithm/erase_first_copy.html @@ -40,7 +40,7 @@ template<typename SequenceT, typename RangeT> SequenceT erase_first_copy(const SequenceT & Input, const RangeT & Search);
-

Description

+

Description

Remove the first occurrence of the substring from the input. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator.

diff --git a/doc/html/boost/algorithm/erase_head.html b/doc/html/boost/algorithm/erase_head.html index 5bd799bedf..6ab8c5cd3e 100644 --- a/doc/html/boost/algorithm/erase_head.html +++ b/doc/html/boost/algorithm/erase_head.html @@ -35,7 +35,7 @@ template<typename SequenceT> void erase_head(SequenceT & Input, int N);

-

Description

+

Description

Remove the head from the input. The head is a prefix of a sequence of given size. If the sequence is shorter then required, the whole string is considered to be the head. The input sequence is modified in-place.

diff --git a/doc/html/boost/algorithm/erase_head_copy.html b/doc/html/boost/algorithm/erase_head_copy.html index 3a42a6d037..d2c0dd6937 100644 --- a/doc/html/boost/algorithm/erase_head_copy.html +++ b/doc/html/boost/algorithm/erase_head_copy.html @@ -39,7 +39,7 @@ template<typename SequenceT> SequenceT erase_head_copy(const SequenceT & Input, int N);
-

Description

+

Description

Remove the head from the input. The head is a prefix of a sequence of given size. If the sequence is shorter then required, the whole string is considered to be the head. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator.

diff --git a/doc/html/boost/algorithm/erase_last.html b/doc/html/boost/algorithm/erase_last.html index 26cda9fa33..43540ac3c4 100644 --- a/doc/html/boost/algorithm/erase_last.html +++ b/doc/html/boost/algorithm/erase_last.html @@ -36,7 +36,7 @@ template<typename SequenceT, typename RangeT> void erase_last(SequenceT & Input, const RangeT & Search);

-

Description

+

Description

Remove the last occurrence of the substring from the input. The input sequence is modified in-place.

diff --git a/doc/html/boost/algorithm/erase_last_copy.html b/doc/html/boost/algorithm/erase_last_copy.html index c309644c95..3b9456fd8d 100644 --- a/doc/html/boost/algorithm/erase_last_copy.html +++ b/doc/html/boost/algorithm/erase_last_copy.html @@ -40,7 +40,7 @@ template<typename SequenceT, typename RangeT> SequenceT erase_last_copy(const SequenceT & Input, const RangeT & Search);
-

Description

+

Description

Remove the last occurrence of the substring from the input. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator.

diff --git a/doc/html/boost/algorithm/erase_nth.html b/doc/html/boost/algorithm/erase_nth.html index a84aa8551d..d4882eb35a 100644 --- a/doc/html/boost/algorithm/erase_nth.html +++ b/doc/html/boost/algorithm/erase_nth.html @@ -36,7 +36,7 @@ template<typename SequenceT, typename RangeT> void erase_nth(SequenceT & Input, const RangeT & Search, int Nth);

-

Description

+

Description

Remove the Nth occurrence of the substring in the input. The input sequence is modified in-place.

diff --git a/doc/html/boost/algorithm/erase_nth_copy.html b/doc/html/boost/algorithm/erase_nth_copy.html index ece87715b5..b7bce9cac1 100644 --- a/doc/html/boost/algorithm/erase_nth_copy.html +++ b/doc/html/boost/algorithm/erase_nth_copy.html @@ -41,7 +41,7 @@ SequenceT erase_nth_copy(const SequenceT & Input, const RangeT & Search, int Nth);
-

Description

+

Description

Remove the Nth occurrence of the substring in the input. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator.

diff --git a/doc/html/boost/algorithm/erase_range.html b/doc/html/boost/algorithm/erase_range.html index 29a4770c63..831a3c2bd0 100644 --- a/doc/html/boost/algorithm/erase_range.html +++ b/doc/html/boost/algorithm/erase_range.html @@ -37,7 +37,7 @@ void erase_range(SequenceT & Input, const iterator_range< typename range_iterator< SequenceT >::type > & SearchRange);

-

Description

+

Description

Remove the given range from the input. The input sequence is modified in-place.

diff --git a/doc/html/boost/algorithm/erase_range_copy.html b/doc/html/boost/algorithm/erase_range_copy.html index 2792b09c92..d8bd72b092 100644 --- a/doc/html/boost/algorithm/erase_range_copy.html +++ b/doc/html/boost/algorithm/erase_range_copy.html @@ -41,7 +41,7 @@ SequenceT erase_range_copy(const SequenceT & Input, const iterator_range< typename range_const_iterator< SequenceT >::type > & SearchRange);
-

Description

+

Description

Remove the given range from the input. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator.

diff --git a/doc/html/boost/algorithm/erase_regex.html b/doc/html/boost/algorithm/erase_regex.html index 08375afd80..676bd36084 100644 --- a/doc/html/boost/algorithm/erase_regex.html +++ b/doc/html/boost/algorithm/erase_regex.html @@ -38,7 +38,7 @@ const basic_regex< CharT, RegexTraitsT > & Rx, match_flag_type Flags = match_default);

-

Description

+

Description

Remove a substring matching given regex from the input. The input string is modified in-place.

diff --git a/doc/html/boost/algorithm/erase_regex_copy.html b/doc/html/boost/algorithm/erase_regex_copy.html index 5c5dd3a47f..e97f81ef7c 100644 --- a/doc/html/boost/algorithm/erase_regex_copy.html +++ b/doc/html/boost/algorithm/erase_regex_copy.html @@ -44,7 +44,7 @@ const basic_regex< CharT, RegexTraitsT > & Rx, match_flag_type Flags = match_default);
-

Description

+

Description

Remove a substring matching given regex from the input. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator.

diff --git a/doc/html/boost/algorithm/erase_tail.html b/doc/html/boost/algorithm/erase_tail.html index 9bab9c7760..0c0194c3ef 100644 --- a/doc/html/boost/algorithm/erase_tail.html +++ b/doc/html/boost/algorithm/erase_tail.html @@ -35,7 +35,7 @@ template<typename SequenceT> void erase_tail(SequenceT & Input, int N);

-

Description

+

Description

Remove the tail from the input. The tail is a suffix of a sequence of given size. If the sequence is shorter then required, the whole string is considered to be the tail. The input sequence is modified in-place.

diff --git a/doc/html/boost/algorithm/erase_tail_copy.html b/doc/html/boost/algorithm/erase_tail_copy.html index 3ddfad2108..641fc0bf46 100644 --- a/doc/html/boost/algorithm/erase_tail_copy.html +++ b/doc/html/boost/algorithm/erase_tail_copy.html @@ -39,7 +39,7 @@ template<typename SequenceT> SequenceT erase_tail_copy(const SequenceT & Input, int N);
-

Description

+

Description

Remove the tail from the input. The tail is a suffix of a sequence of given size. If the sequence is shorter then required, the whole string is considered to be the tail. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator.

diff --git a/doc/html/boost/algorithm/find.html b/doc/html/boost/algorithm/find.html index 9532a3b7bd..b6db69321d 100644 --- a/doc/html/boost/algorithm/find.html +++ b/doc/html/boost/algorithm/find.html @@ -37,7 +37,7 @@ iterator_range< typename range_iterator< RangeT >::type > find(RangeT & Input, const FinderT & Finder);

-

Description

+

Description

Search the input using the given finder.

diff --git a/doc/html/boost/algorithm/find_all.html b/doc/html/boost/algorithm/find_all.html index 865d505b6a..e4bfe308f5 100644 --- a/doc/html/boost/algorithm/find_all.html +++ b/doc/html/boost/algorithm/find_all.html @@ -38,7 +38,7 @@ find_all(SequenceSequenceT & Result, Range1T & Input, const Range2T & Search);

-

Description

+

Description

This algorithm finds all occurrences of the search string in the input.

Each part is copied and added as a new element to the output container. Thus the result container must be able to hold copies of the matches (in a compatible structure like std::string) or a reference to it (e.g. using the iterator range class). Examples of such a container are std::vector<std::string> or std::list<boost::iterator_range<std::string::iterator>>

diff --git a/doc/html/boost/algorithm/find_all_regex.html b/doc/html/boost/algorithm/find_all_regex.html index 5b814336fb..e016d8892d 100644 --- a/doc/html/boost/algorithm/find_all_regex.html +++ b/doc/html/boost/algorithm/find_all_regex.html @@ -40,7 +40,7 @@ const basic_regex< CharT, RegexTraitsT > & Rx, match_flag_type Flags = match_default);

-

Description

+

Description

This algorithm finds all substrings matching the give regex in the input.

Each part is copied and added as a new element to the output container. Thus the result container must be able to hold copies of the matches (in a compatible structure like std::string) or a reference to it (e.g. using the iterator range class). Examples of such a container are std::vector<std::string> or std::list<boost::iterator_range<std::string::iterator>>

diff --git a/doc/html/boost/algorithm/find_first.html b/doc/html/boost/algorithm/find_first.html index 6fe15c36e1..b5887c60d5 100644 --- a/doc/html/boost/algorithm/find_first.html +++ b/doc/html/boost/algorithm/find_first.html @@ -37,7 +37,7 @@ iterator_range< typename range_iterator< Range1T >::type > find_first(Range1T & Input, const Range2T & Search);

-

Description

+

Description

Search for the first occurrence of the substring in the input.

diff --git a/doc/html/boost/algorithm/find_format.html b/doc/html/boost/algorithm/find_format.html index 487ca8af0e..1b74e60fe3 100644 --- a/doc/html/boost/algorithm/find_format.html +++ b/doc/html/boost/algorithm/find_format.html @@ -36,7 +36,7 @@ template<typename SequenceT, typename FinderT, typename FormatterT> void find_format(SequenceT & Input, FinderT Finder, FormatterT Formatter);

-

Description

+

Description

Use the Finder to search for a substring. Use the Formatter to format this substring and replace it in the input. The input is modified in-place.

diff --git a/doc/html/boost/algorithm/find_format_all.html b/doc/html/boost/algorithm/find_format_all.html index 9d2ce689c6..149e927b2a 100644 --- a/doc/html/boost/algorithm/find_format_all.html +++ b/doc/html/boost/algorithm/find_format_all.html @@ -37,7 +37,7 @@ void find_format_all(SequenceT & Input, FinderT Finder, FormatterT Formatter);
-

Description

+

Description

Use the Finder to search for a substring. Use the Formatter to format this substring and replace it in the input. Repeat this for all matching substrings.The input is modified in-place.

diff --git a/doc/html/boost/algorithm/find_format_all_copy.html b/doc/html/boost/algorithm/find_format_all_copy.html index 542d695288..7564f28e1e 100644 --- a/doc/html/boost/algorithm/find_format_all_copy.html +++ b/doc/html/boost/algorithm/find_format_all_copy.html @@ -42,7 +42,7 @@ SequenceT find_format_all_copy(const SequenceT & Input, FinderT Finder, FormatterT Formatter);
-

Description

+

Description

Use the Finder to search for a substring. Use the Formatter to format this substring and replace it in the input. Repeat this for all matching substrings. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator.

diff --git a/doc/html/boost/algorithm/find_format_copy.html b/doc/html/boost/algorithm/find_format_copy.html index ef5e987faf..da5ec2108e 100644 --- a/doc/html/boost/algorithm/find_format_copy.html +++ b/doc/html/boost/algorithm/find_format_copy.html @@ -42,7 +42,7 @@ SequenceT find_format_copy(const SequenceT & Input, FinderT Finder, FormatterT Formatter);

-

Description

+

Description

Use the Finder to search for a substring. Use the Formatter to format this substring and replace it in the input. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator.

diff --git a/doc/html/boost/algorithm/find_head.html b/doc/html/boost/algorithm/find_head.html index 75fa259ecf..19944bdea8 100644 --- a/doc/html/boost/algorithm/find_head.html +++ b/doc/html/boost/algorithm/find_head.html @@ -37,7 +37,7 @@ iterator_range< typename range_iterator< RangeT >::type > find_head(RangeT & Input, int N);

-

Description

+

Description

Get the head of the input. Head is a prefix of the string of the given size. If the input is shorter then required, whole input is considered to be the head.

diff --git a/doc/html/boost/algorithm/find_iterator.html b/doc/html/boost/algorithm/find_iterator.html index 081e5bfbc4..2a6ec78670 100644 --- a/doc/html/boost/algorithm/find_iterator.html +++ b/doc/html/boost/algorithm/find_iterator.html @@ -37,32 +37,32 @@ { public: // construct/copy/destruct - find_iterator(); - find_iterator(const find_iterator &); - template<typename FinderT> find_iterator(IteratorT, IteratorT, FinderT); - template<typename FinderT, typename RangeT> find_iterator(RangeT &, FinderT); + find_iterator(); + find_iterator(const find_iterator &); + template<typename FinderT> find_iterator(IteratorT, IteratorT, FinderT); + template<typename FinderT, typename RangeT> find_iterator(RangeT &, FinderT); - // public member functions - bool eof() const; + // public member functions + bool eof() const; - // private member functions - const match_type & dereference() const; - void increment(); - bool equal(const find_iterator &) const; + // private member functions + const match_type & dereference() const; + void increment(); + bool equal(const find_iterator &) const; };

-

Description

+

Description

Find iterator encapsulates a Finder and allows for incremental searching in a string. Each increment moves the iterator to the next match.

Find iterator is a readable forward traversal iterator.

Dereferencing the iterator yields an iterator_range delimiting the current match.

-

+

find_iterator public construct/copy/destruct

  1. -
    find_iterator();
    Default constructor.

    Construct null iterator. All null iterators are equal.

    +
    find_iterator();
    Default constructor.

    Construct null iterator. All null iterators are equal.

    @@ -77,32 +77,32 @@
  2. -
    find_iterator(const find_iterator & Other);
    Copy constructor.

    Construct a copy of the find_iterator

    +
    find_iterator(const find_iterator & Other);
    Copy constructor.

    Construct a copy of the find_iterator 

  3. template<typename FinderT> 
-  find_iterator(IteratorT Begin, IteratorT End, FinderT Finder);
    Constructor.

    Construct new find_iterator for a given finder and a range.

    + find_iterator(IteratorT Begin, IteratorT End, FinderT Finder);Constructor.

    Construct new find_iterator for a given finder and a range. 

  4. template<typename FinderT, typename RangeT> 
-  find_iterator(RangeT & Col, FinderT Finder);
    Constructor.

    Construct new find_iterator for a given finder and a range.

    + find_iterator(RangeT & Col, FinderT Finder);Constructor.

    Construct new find_iterator for a given finder and a range.

-

-find_iterator public member functions

+

+find_iterator public member functions

  1. -
    bool eof() const;
    Eof check.

    Check the eof condition. Eof condition means that there is nothing more to be searched i.e. find_iterator is after the last match.

    +
    bool eof() const;
    Eof check.

    Check the eof condition. Eof condition means that there is nothing more to be searched i.e. find_iterator is after the last match.

-

-find_iterator private member functions

+

+find_iterator private member functions

    -
  1. const match_type & dereference() const;
    2. -
  2. void increment();
    3. -
  3. bool equal(const find_iterator & Other) const;
    4. +
  4. const match_type & dereference() const;
    5. +
  5. void increment();
    6. +
  6. bool equal(const find_iterator & Other) const;
diff --git a/doc/html/boost/algorithm/find_last.html b/doc/html/boost/algorithm/find_last.html index 0cf5c99517..f258e1e439 100644 --- a/doc/html/boost/algorithm/find_last.html +++ b/doc/html/boost/algorithm/find_last.html @@ -37,7 +37,7 @@ iterator_range< typename range_iterator< Range1T >::type > find_last(Range1T & Input, const Range2T & Search);
-

Description

+

Description

Search for the last occurrence of the substring in the input.

diff --git a/doc/html/boost/algorithm/find_nth.html b/doc/html/boost/algorithm/find_nth.html index 6bd0256453..afb4db8229 100644 --- a/doc/html/boost/algorithm/find_nth.html +++ b/doc/html/boost/algorithm/find_nth.html @@ -37,7 +37,7 @@ iterator_range< typename range_iterator< Range1T >::type > find_nth(Range1T & Input, const Range2T & Search, int Nth);

-

Description

+

Description

Search for the n-th (zero-indexed) occurrence of the substring in the input.

diff --git a/doc/html/boost/algorithm/find_regex.html b/doc/html/boost/algorithm/find_regex.html index 8860b376b5..5b224df98d 100644 --- a/doc/html/boost/algorithm/find_regex.html +++ b/doc/html/boost/algorithm/find_regex.html @@ -38,7 +38,7 @@ find_regex(RangeT & Input, const basic_regex< CharT, RegexTraitsT > & Rx, match_flag_type Flags = match_default);

-

Description

+

Description

Search for a substring matching the given regex in the input.

diff --git a/doc/html/boost/algorithm/find_tail.html b/doc/html/boost/algorithm/find_tail.html index 22e4514967..0eb1203de2 100644 --- a/doc/html/boost/algorithm/find_tail.html +++ b/doc/html/boost/algorithm/find_tail.html @@ -37,7 +37,7 @@ iterator_range< typename range_iterator< RangeT >::type > find_tail(RangeT & Input, int N);

-

Description

+

Description

Get the tail of the input. Tail is a suffix of the string of the given size. If the input is shorter then required, whole input is considered to be the tail.

diff --git a/doc/html/boost/algorithm/find_token.html b/doc/html/boost/algorithm/find_token.html index 812b927d6e..88a2759391 100644 --- a/doc/html/boost/algorithm/find_token.html +++ b/doc/html/boost/algorithm/find_token.html @@ -38,7 +38,7 @@ find_token(RangeT & Input, PredicateT Pred, token_compress_mode_type eCompress = token_compress_off);

-

Description

+

Description

Look for a given token in the string. Token is a character that matches the given predicate. If the "token compress mode" is enabled, adjacent tokens are considered to be one match.

diff --git a/doc/html/boost/algorithm/first_finder.html b/doc/html/boost/algorithm/first_finder.html index bd1953dede..24d30b3915 100644 --- a/doc/html/boost/algorithm/first_finder.html +++ b/doc/html/boost/algorithm/first_finder.html @@ -37,7 +37,7 @@ template<typename RangeT, typename PredicateT> unspecified first_finder(const RangeT & Search, PredicateT Comp);

-

Description

+

Description

Construct the first_finder. The finder searches for the first occurrence of the string in a given input. The result is given as an iterator_range delimiting the match.

diff --git a/doc/html/boost/algorithm/has_const_time_erase.html b/doc/html/boost/algorithm/has_const_time_erase.html index 77f7e82921..0078d5f71d 100644 --- a/doc/html/boost/algorithm/has_const_time_erase.html +++ b/doc/html/boost/algorithm/has_const_time_erase.html @@ -42,7 +42,7 @@ static const bool value; };

-

Description

+

Description

This trait specifies that the sequence's erase method has constant time complexity.

diff --git a/doc/html/boost/algorithm/has_const_time_insert.html b/doc/html/boost/algorithm/has_const_time_insert.html index bca5883ef2..cc76639cb7 100644 --- a/doc/html/boost/algorithm/has_const_time_insert.html +++ b/doc/html/boost/algorithm/has_const_time_insert.html @@ -42,7 +42,7 @@ static const bool value; };
-

Description

+

Description

This trait specifies that the sequence's insert method has constant time complexity.

diff --git a/doc/html/boost/algorithm/has_native_replace.html b/doc/html/boost/algorithm/has_native_replace.html index fbf397b708..69bfa1056c 100644 --- a/doc/html/boost/algorithm/has_native_replace.html +++ b/doc/html/boost/algorithm/has_native_replace.html @@ -42,7 +42,7 @@ static const bool value; };
-

Description

+

Description

This trait specifies that the sequence has std::string like replace method

diff --git a/doc/html/boost/algorithm/has_stable_iterators.html b/doc/html/boost/algorithm/has_stable_iterators.html index 3b4f624197..61b3285cac 100644 --- a/doc/html/boost/algorithm/has_stable_iterators.html +++ b/doc/html/boost/algorithm/has_stable_iterators.html @@ -42,7 +42,7 @@ static const bool value; };
-

Description

+

Description

This trait specifies that the sequence has stable iterators. It means that operations like insert/erase/replace do not invalidate iterators.

diff --git a/doc/html/boost/algorithm/head_finder.html b/doc/html/boost/algorithm/head_finder.html index 4f37f1b94b..3cdc173b85 100644 --- a/doc/html/boost/algorithm/head_finder.html +++ b/doc/html/boost/algorithm/head_finder.html @@ -35,7 +35,7 @@ unspecified head_finder(int N);
-

Description

+

Description

Construct the head_finder. The finder returns a head of a given input. The head is a prefix of a string up to n elements in size. If an input has less then n elements, whole input is considered a head. The result is given as an iterator_range delimiting the match.

diff --git a/doc/html/boost/algorithm/icontains.html b/doc/html/boost/algorithm/icontains.html index 3aa01c13a6..f6482719b5 100644 --- a/doc/html/boost/algorithm/icontains.html +++ b/doc/html/boost/algorithm/icontains.html @@ -37,7 +37,7 @@ bool icontains(const Range1T & Input, const Range2T & Test, const std::locale & Loc = std::locale());

-

Description

+

Description

This predicate holds when the test container is contained in the Input. Elements are compared case insensitively.

diff --git a/doc/html/boost/algorithm/identity_formatter.html b/doc/html/boost/algorithm/identity_formatter.html index 9a0cd56ca4..47c504dc4f 100644 --- a/doc/html/boost/algorithm/identity_formatter.html +++ b/doc/html/boost/algorithm/identity_formatter.html @@ -35,7 +35,7 @@ template<typename RangeT> unspecified identity_formatter();

-

Description

+

Description

Constructs an identity_formatter. Identity formatter always returns the parameter.

diff --git a/doc/html/boost/algorithm/iends_with.html b/doc/html/boost/algorithm/iends_with.html index 48dec1dd09..516ab7bca3 100644 --- a/doc/html/boost/algorithm/iends_with.html +++ b/doc/html/boost/algorithm/iends_with.html @@ -37,7 +37,7 @@ bool iends_with(const Range1T & Input, const Range2T & Test, const std::locale & Loc = std::locale());
-

Description

+

Description

This predicate holds when the test container is a suffix of the Input. In other words, if the input ends with the test. Elements are compared case insensitively.

diff --git a/doc/html/boost/algorithm/iequals.html b/doc/html/boost/algorithm/iequals.html index 0a283d9d5f..fddb97e421 100644 --- a/doc/html/boost/algorithm/iequals.html +++ b/doc/html/boost/algorithm/iequals.html @@ -37,7 +37,7 @@ bool iequals(const Range1T & Input, const Range2T & Test, const std::locale & Loc = std::locale());

-

Description

+

Description

This predicate holds when the test container is equal to the input container i.e. all elements in both containers are same. Elements are compared case insensitively.

diff --git a/doc/html/boost/algorithm/ierase_all.html b/doc/html/boost/algorithm/ierase_all.html index 05a9a250c5..1da33bdcac 100644 --- a/doc/html/boost/algorithm/ierase_all.html +++ b/doc/html/boost/algorithm/ierase_all.html @@ -37,7 +37,7 @@ void ierase_all(SequenceT & Input, const RangeT & Search, const std::locale & Loc = std::locale());

-

Description

+

Description

Remove all the occurrences of the string from the input. The input sequence is modified in-place. Searching is case insensitive.

diff --git a/doc/html/boost/algorithm/ierase_all_copy.html b/doc/html/boost/algorithm/ierase_all_copy.html index 1f5b034380..4b0bbdfa6f 100644 --- a/doc/html/boost/algorithm/ierase_all_copy.html +++ b/doc/html/boost/algorithm/ierase_all_copy.html @@ -42,7 +42,7 @@ SequenceT ierase_all_copy(const SequenceT & Input, const RangeT & Search, const std::locale & Loc = std::locale());
-

Description

+

Description

Remove all the occurrences of the string from the input. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator. Searching is case insensitive.

diff --git a/doc/html/boost/algorithm/ierase_first.html b/doc/html/boost/algorithm/ierase_first.html index 20445d8f5c..6029ecc495 100644 --- a/doc/html/boost/algorithm/ierase_first.html +++ b/doc/html/boost/algorithm/ierase_first.html @@ -37,7 +37,7 @@ void ierase_first(SequenceT & Input, const RangeT & Search, const std::locale & Loc = std::locale());

-

Description

+

Description

Remove the first occurrence of the substring from the input. The input sequence is modified in-place. Searching is case insensitive.

diff --git a/doc/html/boost/algorithm/ierase_first_copy.html b/doc/html/boost/algorithm/ierase_first_copy.html index 51d2ed6045..a95057e44d 100644 --- a/doc/html/boost/algorithm/ierase_first_copy.html +++ b/doc/html/boost/algorithm/ierase_first_copy.html @@ -42,7 +42,7 @@ SequenceT ierase_first_copy(const SequenceT & Input, const RangeT & Search, const std::locale & Loc = std::locale());
-

Description

+

Description

Remove the first occurrence of the substring from the input. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator. Searching is case insensitive.

diff --git a/doc/html/boost/algorithm/ierase_last.html b/doc/html/boost/algorithm/ierase_last.html index a1ec07911e..3b7d30114c 100644 --- a/doc/html/boost/algorithm/ierase_last.html +++ b/doc/html/boost/algorithm/ierase_last.html @@ -37,7 +37,7 @@ void ierase_last(SequenceT & Input, const RangeT & Search, const std::locale & Loc = std::locale());

-

Description

+

Description

Remove the last occurrence of the substring from the input. The input sequence is modified in-place. Searching is case insensitive.

diff --git a/doc/html/boost/algorithm/ierase_last_copy.html b/doc/html/boost/algorithm/ierase_last_copy.html index bd09e89c74..c62726c85e 100644 --- a/doc/html/boost/algorithm/ierase_last_copy.html +++ b/doc/html/boost/algorithm/ierase_last_copy.html @@ -42,7 +42,7 @@ SequenceT ierase_last_copy(const SequenceT & Input, const RangeT & Search, const std::locale & Loc = std::locale());
-

Description

+

Description

Remove the last occurrence of the substring from the input. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator. Searching is case insensitive.

diff --git a/doc/html/boost/algorithm/ierase_nth.html b/doc/html/boost/algorithm/ierase_nth.html index bedf751a20..ec6a108a76 100644 --- a/doc/html/boost/algorithm/ierase_nth.html +++ b/doc/html/boost/algorithm/ierase_nth.html @@ -37,7 +37,7 @@ void ierase_nth(SequenceT & Input, const RangeT & Search, int Nth, const std::locale & Loc = std::locale());

-

Description

+

Description

Remove the Nth occurrence of the substring in the input. The input sequence is modified in-place. Searching is case insensitive.

diff --git a/doc/html/boost/algorithm/ierase_nth_copy.html b/doc/html/boost/algorithm/ierase_nth_copy.html index f1fab44118..7dfa7c3634 100644 --- a/doc/html/boost/algorithm/ierase_nth_copy.html +++ b/doc/html/boost/algorithm/ierase_nth_copy.html @@ -42,7 +42,7 @@ SequenceT ierase_nth_copy(const SequenceT & Input, const RangeT & Search, int Nth, const std::locale & Loc = std::locale());
-

Description

+

Description

Remove the Nth occurrence of the substring in the input. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator. Searching is case insensitive.

diff --git a/doc/html/boost/algorithm/ifind_all.html b/doc/html/boost/algorithm/ifind_all.html index 39a5d70e0c..83c69d811f 100644 --- a/doc/html/boost/algorithm/ifind_all.html +++ b/doc/html/boost/algorithm/ifind_all.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@

-PrevUpHomeNext +PrevUpHomeNext
@@ -38,7 +38,7 @@ ifind_all(SequenceSequenceT & Result, Range1T & Input, const Range2T & Search, const std::locale & Loc = std::locale());
-

Description

+

Description

This algorithm finds all occurrences of the search string in the input. Each part is copied and added as a new element to the output container. Thus the result container must be able to hold copies of the matches (in a compatible structure like std::string) or a reference to it (e.g. using the iterator range class). Examples of such a container are std::vector<std::string> or std::list<boost::iterator_range<std::string::iterator>>

Searching is case insensitive.

@@ -113,7 +113,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/boost/algorithm/ifind_first.html b/doc/html/boost/algorithm/ifind_first.html index 9208ae66a4..7ae8c9f601 100644 --- a/doc/html/boost/algorithm/ifind_first.html +++ b/doc/html/boost/algorithm/ifind_first.html @@ -38,7 +38,7 @@ ifind_first(Range1T & Input, const Range2T & Search, const std::locale & Loc = std::locale());
-

Description

+

Description

Search for the first occurrence of the substring in the input. Searching is case insensitive.

diff --git a/doc/html/boost/algorithm/ifind_last.html b/doc/html/boost/algorithm/ifind_last.html index d369d2a953..451d172f5b 100644 --- a/doc/html/boost/algorithm/ifind_last.html +++ b/doc/html/boost/algorithm/ifind_last.html @@ -38,7 +38,7 @@ ifind_last(Range1T & Input, const Range2T & Search, const std::locale & Loc = std::locale());

-

Description

+

Description

Search for the last match a string in the input. Searching is case insensitive.

diff --git a/doc/html/boost/algorithm/ifind_nth.html b/doc/html/boost/algorithm/ifind_nth.html index 024c67c27c..bdcd33500c 100644 --- a/doc/html/boost/algorithm/ifind_nth.html +++ b/doc/html/boost/algorithm/ifind_nth.html @@ -38,7 +38,7 @@ ifind_nth(Range1T & Input, const Range2T & Search, int Nth, const std::locale & Loc = std::locale());

-

Description

+

Description

Search for the n-th (zero-indexed) occurrence of the substring in the input. Searching is case insensitive.

diff --git a/doc/html/boost/algorithm/ilexicographical_compare.html b/doc/html/boost/algorithm/ilexicographical_compare.html index 08bf180a52..bf7cba4859 100644 --- a/doc/html/boost/algorithm/ilexicographical_compare.html +++ b/doc/html/boost/algorithm/ilexicographical_compare.html @@ -37,7 +37,7 @@ bool ilexicographical_compare(const Range1T & Arg1, const Range2T & Arg2, const std::locale & Loc = std::locale());

-

Description

+

Description

This predicate is an overload of std::lexicographical_compare for range arguments. It check whether the first argument is lexicographically less then the second one. Elements are compared case insensitively

diff --git a/doc/html/boost/algorithm/ireplace_all.html b/doc/html/boost/algorithm/ireplace_all.html index 6e24792ff3..6afbf691c6 100644 --- a/doc/html/boost/algorithm/ireplace_all.html +++ b/doc/html/boost/algorithm/ireplace_all.html @@ -38,7 +38,7 @@ const Range2T & Format, const std::locale & Loc = std::locale());

-

Description

+

Description

Replace all occurrences of the search string in the input with the format string.The input sequence is modified in-place. Searching is case insensitive.

diff --git a/doc/html/boost/algorithm/ireplace_all_copy.html b/doc/html/boost/algorithm/ireplace_all_copy.html index 8fd8f6bf9c..06533db4fd 100644 --- a/doc/html/boost/algorithm/ireplace_all_copy.html +++ b/doc/html/boost/algorithm/ireplace_all_copy.html @@ -44,7 +44,7 @@ const Range2T & Format, const std::locale & Loc = std::locale());
-

Description

+

Description

Replace all occurrences of the search string in the input with the format string. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator. Searching is case insensitive.

diff --git a/doc/html/boost/algorithm/ireplace_first.html b/doc/html/boost/algorithm/ireplace_first.html index 9731b03332..2d3251d08a 100644 --- a/doc/html/boost/algorithm/ireplace_first.html +++ b/doc/html/boost/algorithm/ireplace_first.html @@ -38,7 +38,7 @@ const Range2T & Format, const std::locale & Loc = std::locale());

-

Description

+

Description

Replace the first match of the search substring in the input with the format string. Input sequence is modified in-place. Searching is case insensitive.

diff --git a/doc/html/boost/algorithm/ireplace_first_copy.html b/doc/html/boost/algorithm/ireplace_first_copy.html index 48c7f57b35..33121bbf9a 100644 --- a/doc/html/boost/algorithm/ireplace_first_copy.html +++ b/doc/html/boost/algorithm/ireplace_first_copy.html @@ -45,7 +45,7 @@ const Range1T & Format, const std::locale & Loc = std::locale());
-

Description

+

Description

Replace the first match of the search substring in the input with the format string. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator. Searching is case insensitive.

diff --git a/doc/html/boost/algorithm/ireplace_last.html b/doc/html/boost/algorithm/ireplace_last.html index 0441e2b459..0fd3be931b 100644 --- a/doc/html/boost/algorithm/ireplace_last.html +++ b/doc/html/boost/algorithm/ireplace_last.html @@ -38,7 +38,7 @@ const Range2T & Format, const std::locale & Loc = std::locale());

-

Description

+

Description

Replace the last match of the search string in the input with the format string.The input sequence is modified in-place. Searching is case insensitive.

diff --git a/doc/html/boost/algorithm/ireplace_last_copy.html b/doc/html/boost/algorithm/ireplace_last_copy.html index 45cd44f02f..d0bad3f9ee 100644 --- a/doc/html/boost/algorithm/ireplace_last_copy.html +++ b/doc/html/boost/algorithm/ireplace_last_copy.html @@ -45,7 +45,7 @@ const Range2T & Format, const std::locale & Loc = std::locale());

-

Description

+

Description

Replace the last match of the search string in the input with the format string. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator. Searching is case insensitive.

diff --git a/doc/html/boost/algorithm/ireplace_nth.html b/doc/html/boost/algorithm/ireplace_nth.html index 3e6d95e9de..9b4be02952 100644 --- a/doc/html/boost/algorithm/ireplace_nth.html +++ b/doc/html/boost/algorithm/ireplace_nth.html @@ -38,7 +38,7 @@ const Range2T & Format, const std::locale & Loc = std::locale());

-

Description

+

Description

Replace an Nth (zero-indexed) match of the search string in the input with the format string. Input sequence is modified in-place. Searching is case insensitive.

diff --git a/doc/html/boost/algorithm/ireplace_nth_copy.html b/doc/html/boost/algorithm/ireplace_nth_copy.html index efac16ed5f..54653545ac 100644 --- a/doc/html/boost/algorithm/ireplace_nth_copy.html +++ b/doc/html/boost/algorithm/ireplace_nth_copy.html @@ -44,7 +44,7 @@ int Nth, const Range2T & Format, const std::locale & Loc = std::locale());
-

Description

+

Description

Replace an Nth (zero-indexed) match of the search string in the input with the format string. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator. Searching is case insensitive.

diff --git a/doc/html/boost/algorithm/is_alnum.html b/doc/html/boost/algorithm/is_alnum.html index e2d79e7b4c..814de71654 100644 --- a/doc/html/boost/algorithm/is_alnum.html +++ b/doc/html/boost/algorithm/is_alnum.html @@ -35,7 +35,7 @@ unspecified is_alnum(const std::locale & Loc = std::locale());

-

Description

+

Description

Construct the is_classified predicate for the ctype_base::alnum category.

diff --git a/doc/html/boost/algorithm/is_alpha.html b/doc/html/boost/algorithm/is_alpha.html index 93d872ff35..a784b1c008 100644 --- a/doc/html/boost/algorithm/is_alpha.html +++ b/doc/html/boost/algorithm/is_alpha.html @@ -35,7 +35,7 @@ unspecified is_alpha(const std::locale & Loc = std::locale());

-

Description

+

Description

Construct the is_classified predicate for the ctype_base::alpha category.

diff --git a/doc/html/boost/algorithm/is_any_of.html b/doc/html/boost/algorithm/is_any_of.html index b2c9517af3..8526434fe1 100644 --- a/doc/html/boost/algorithm/is_any_of.html +++ b/doc/html/boost/algorithm/is_any_of.html @@ -35,7 +35,7 @@ template<typename RangeT> unspecified is_any_of(const RangeT & Set);

-

Description

+

Description

Construct the is_any_of predicate. The predicate holds if the input is included in the specified set of characters.

diff --git a/doc/html/boost/algorithm/is_classified.html b/doc/html/boost/algorithm/is_classified.html index c72462c9ae..1a6b6629d8 100644 --- a/doc/html/boost/algorithm/is_classified.html +++ b/doc/html/boost/algorithm/is_classified.html @@ -36,7 +36,7 @@ unspecified is_classified(std::ctype_base::mask Type, const std::locale & Loc = std::locale());

-

Description

+

Description

Construct the is_classified predicate. This predicate holds if the input is of specified std::ctype category.

diff --git a/doc/html/boost/algorithm/is_cntrl.html b/doc/html/boost/algorithm/is_cntrl.html index 69be1e9677..d43d322a53 100644 --- a/doc/html/boost/algorithm/is_cntrl.html +++ b/doc/html/boost/algorithm/is_cntrl.html @@ -35,7 +35,7 @@ unspecified is_cntrl(const std::locale & Loc = std::locale());

-

Description

+

Description

Construct the is_classified predicate for the ctype_base::cntrl category.

diff --git a/doc/html/boost/algorithm/is_digit.html b/doc/html/boost/algorithm/is_digit.html index f656c62b0b..d2e89415fb 100644 --- a/doc/html/boost/algorithm/is_digit.html +++ b/doc/html/boost/algorithm/is_digit.html @@ -35,7 +35,7 @@ unspecified is_digit(const std::locale & Loc = std::locale());

-

Description

+

Description

Construct the is_classified predicate for the ctype_base::digit category.

diff --git a/doc/html/boost/algorithm/is_equal.html b/doc/html/boost/algorithm/is_equal.html index 6aa0ac321e..9dc22b19ad 100644 --- a/doc/html/boost/algorithm/is_equal.html +++ b/doc/html/boost/algorithm/is_equal.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@

-PrevUpHomeNext +PrevUpHomeNext
@@ -35,19 +35,19 @@ struct is_equal { - // public member functions + // public member functions template<typename T1, typename T2> - bool operator()(const T1 &, const T2 &) const; + bool operator()(const T1 &, const T2 &) const; };
-

Description

+

Description

Standard STL equal_to only handle comparison between arguments of the same type. This is a less restrictive version which wraps operator ==.

-

-is_equal public member functions

+

+is_equal public member functions

  1. template<typename T1, typename T2> 
-  bool operator()(const T1 & Arg1, const T2 & Arg2) const;
    Function operator.

    Compare two operands for equality

    + bool operator()(const T1 & Arg1, const T2 & Arg2) const;Function operator.

    Compare two operands for equality

@@ -62,7 +62,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/boost/algorithm/is_from_range.html b/doc/html/boost/algorithm/is_from_range.html index 3b6986822f..5f586750bb 100644 --- a/doc/html/boost/algorithm/is_from_range.html +++ b/doc/html/boost/algorithm/is_from_range.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
-PrevUpHomeNext +PrevUpHomeNext
@@ -35,7 +35,7 @@ template<typename CharT> unspecified is_from_range(CharT From, CharT To);
-

Description

+

Description

Construct the is_from_range predicate. The predicate holds if the input is included in the specified range. (i.e. From <= Ch <= To )

@@ -83,7 +83,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/boost/algorithm/is_graph.html b/doc/html/boost/algorithm/is_graph.html index 676c04ad5b..ad05fa5e80 100644 --- a/doc/html/boost/algorithm/is_graph.html +++ b/doc/html/boost/algorithm/is_graph.html @@ -35,7 +35,7 @@ unspecified is_graph(const std::locale & Loc = std::locale());
-

Description

+

Description

Construct the is_classified predicate for the ctype_base::graph category.

diff --git a/doc/html/boost/algorithm/is_iequal.html b/doc/html/boost/algorithm/is_iequal.html index dd6b5282ba..16b4b80312 100644 --- a/doc/html/boost/algorithm/is_iequal.html +++ b/doc/html/boost/algorithm/is_iequal.html @@ -35,22 +35,22 @@ struct is_iequal { // construct/copy/destruct - is_iequal(const std::locale & = std::locale()); + is_iequal(const std::locale & = std::locale()); - // public member functions + // public member functions template<typename T1, typename T2> - bool operator()(const T1 &, const T2 &) const; + bool operator()(const T1 &, const T2 &) const; };

-

Description

+

Description

Case insensitive comparison predicate. Comparison is done using specified locales.

-

+

is_iequal public construct/copy/destruct

  1. -
    is_iequal(const std::locale & Loc = std::locale());
    Constructor.

    +

    is_iequal(const std::locale & Loc = std::locale());
    Constructor.

    @@ -74,11 +74,11 @@
    -

    -is_iequal public member functions

    +

    +is_iequal public member functions

    1. template<typename T1, typename T2> 
-  bool operator()(const T1 & Arg1, const T2 & Arg2) const;
      Function operator.

      Compare two operands. Case is ignored.

      + bool operator()(const T1 & Arg1, const T2 & Arg2) const;Function operator.

      Compare two operands. Case is ignored.

    diff --git a/doc/html/boost/algorithm/is_iless.html b/doc/html/boost/algorithm/is_iless.html index 1f40acf205..24506ccd24 100644 --- a/doc/html/boost/algorithm/is_iless.html +++ b/doc/html/boost/algorithm/is_iless.html @@ -35,22 +35,22 @@ structis_iless{// construct/copy/destruct - is_iless(conststd::locale&=std::locale()); + is_iless(conststd::locale&=std::locale()); - // public member functions + // public member functionstemplate<typename T1,typename T2> - booloperator()(constT1&,constT2&)const; + booloperator()(constT1&,constT2&)const;};
    -

    Description

    +

    Description

    Case insensitive comparison predicate. Comparison is done using specified locales.

    -

    +

    is_iless public construct/copy/destruct

    1. -
      is_iless(const std::locale & Loc = std::locale());
      Constructor.

      +

      is_iless(const std::locale & Loc = std::locale());
      Constructor.

    @@ -74,11 +74,11 @@
    -

    -is_iless public member functions

    +

    +is_iless public member functions

    1. template<typename T1, typename T2> 
-  bool operator()(const T1 & Arg1, const T2 & Arg2) const;
      Function operator.

      Compare two operands. Case is ignored.

      + bool operator()(const T1 & Arg1, const T2 & Arg2) const;Function operator.

      Compare two operands. Case is ignored.

    diff --git a/doc/html/boost/algorithm/is_less.html b/doc/html/boost/algorithm/is_less.html index aa3c36fa20..9298fad05c 100644 --- a/doc/html/boost/algorithm/is_less.html +++ b/doc/html/boost/algorithm/is_less.html @@ -35,19 +35,19 @@ structis_less{ - // public member functions + // public member functionstemplate<typename T1,typename T2> - booloperator()(constT1&,constT2&)const; + booloperator()(constT1&,constT2&)const;};
    -

    Description

    +

    Description

    Convenient version of standard std::less. Operation is templated, therefore it is not required to specify the exact types upon the construction

    -

    -is_less public member functions

    +

    +is_less public member functions

    1. template<typename T1, typename T2> 
-  bool operator()(const T1 & Arg1, const T2 & Arg2) const;
      Functor operation.

      Compare two operands using > operator

      + bool operator()(const T1 & Arg1, const T2 & Arg2) const;Functor operation.

      Compare two operands using > operator

    diff --git a/doc/html/boost/algorithm/is_lower.html b/doc/html/boost/algorithm/is_lower.html index 1cd6988030..2a30a1c308 100644 --- a/doc/html/boost/algorithm/is_lower.html +++ b/doc/html/boost/algorithm/is_lower.html @@ -35,7 +35,7 @@ unspecifiedis_lower(conststd::locale& Loc =std::locale());
    -

    Description

    +

    Description

    Construct the is_classified predicate for the ctype_base::lower category.

    diff --git a/doc/html/boost/algorithm/is_not_greater.html b/doc/html/boost/algorithm/is_not_greater.html index dfc4a3d99e..d41447e1c3 100644 --- a/doc/html/boost/algorithm/is_not_greater.html +++ b/doc/html/boost/algorithm/is_not_greater.html @@ -35,19 +35,19 @@ struct is_not_greater { - // public member functions + // public member functions template<typename T1, typename T2> - bool operator()(const T1 &, const T2 &) const; + bool operator()(const T1 &, const T2 &) const; };

    -

    Description

    +

    Description

    Convenient version of standard std::not_greater_to. Operation is templated, therefore it is not required to specify the exact types upon the construction

    -

    -is_not_greater public member functions

    +

    +is_not_greater public member functions

    1. template<typename T1, typename T2> 
-  bool operator()(const T1 & Arg1, const T2 & Arg2) const;
      Functor operation.

      Compare two operands using > operator

      + bool operator()(const T1 & Arg1, const T2 & Arg2) const;Functor operation.

      Compare two operands using > operator

    diff --git a/doc/html/boost/algorithm/is_not_igreater.html b/doc/html/boost/algorithm/is_not_igreater.html index 1aadf5fe2a..f80ceadbf7 100644 --- a/doc/html/boost/algorithm/is_not_igreater.html +++ b/doc/html/boost/algorithm/is_not_igreater.html @@ -35,22 +35,22 @@ structis_not_igreater{// construct/copy/destruct - is_not_igreater(conststd::locale&=std::locale()); + is_not_igreater(conststd::locale&=std::locale()); - // public member functions + // public member functionstemplate<typename T1,typename T2> - booloperator()(constT1&,constT2&)const; + booloperator()(constT1&,constT2&)const;};
    -

    Description

    +

    Description

    Case insensitive comparison predicate. Comparison is done using specified locales.

    -

    +

    is_not_igreater public construct/copy/destruct

    1. -
      is_not_igreater(const std::locale & Loc = std::locale());
      Constructor.

      +

      is_not_igreater(const std::locale & Loc = std::locale());
      Constructor.

    @@ -74,11 +74,11 @@
    -

    -is_not_igreater public member functions

    +

    +is_not_igreater public member functions

    1. template<typename T1, typename T2> 
-  bool operator()(const T1 & Arg1, const T2 & Arg2) const;
      Function operator.

      Compare two operands. Case is ignored.

      + bool operator()(const T1 & Arg1, const T2 & Arg2) const;Function operator.

      Compare two operands. Case is ignored.

    diff --git a/doc/html/boost/algorithm/is_print.html b/doc/html/boost/algorithm/is_print.html index b069966d64..7460ebabd6 100644 --- a/doc/html/boost/algorithm/is_print.html +++ b/doc/html/boost/algorithm/is_print.html @@ -35,7 +35,7 @@ unspecifiedis_print(conststd::locale& Loc =std::locale());
    -

    Description

    +

    Description

    Construct the is_classified predicate for the ctype_base::print category.

    diff --git a/doc/html/boost/algorithm/is_punct.html b/doc/html/boost/algorithm/is_punct.html index 197caaa251..11eb5b9b0f 100644 --- a/doc/html/boost/algorithm/is_punct.html +++ b/doc/html/boost/algorithm/is_punct.html @@ -35,7 +35,7 @@ unspecified is_punct(const std::locale & Loc = std::locale());

    -

    Description

    +

    Description

    Construct the is_classified predicate for the ctype_base::punct category.

    diff --git a/doc/html/boost/algorithm/is_space.html b/doc/html/boost/algorithm/is_space.html index 0548a425c1..1a1a8a1b4c 100644 --- a/doc/html/boost/algorithm/is_space.html +++ b/doc/html/boost/algorithm/is_space.html @@ -35,7 +35,7 @@ unspecified is_space(const std::locale & Loc = std::locale());

    -

    Description

    +

    Description

    Construct the is_classified predicate for the ctype_base::space category.

    diff --git a/doc/html/boost/algorithm/is_upper.html b/doc/html/boost/algorithm/is_upper.html index 3fc683a887..9492d458a8 100644 --- a/doc/html/boost/algorithm/is_upper.html +++ b/doc/html/boost/algorithm/is_upper.html @@ -35,7 +35,7 @@ unspecified is_upper(const std::locale & Loc = std::locale());

    -

    Description

    +

    Description

    Construct the is_classified predicate for the ctype_base::upper category.

    diff --git a/doc/html/boost/algorithm/is_xdigit.html b/doc/html/boost/algorithm/is_xdigit.html index 8ed187e845..eba1d1a945 100644 --- a/doc/html/boost/algorithm/is_xdigit.html +++ b/doc/html/boost/algorithm/is_xdigit.html @@ -35,7 +35,7 @@ unspecified is_xdigit(const std::locale & Loc = std::locale());

    -

    Description

    +

    Description

    Construct the is_classified predicate for the ctype_base::xdigit category.

    diff --git a/doc/html/boost/algorithm/istarts_with.html b/doc/html/boost/algorithm/istarts_with.html index 6e6a624eac..1e4e021ca8 100644 --- a/doc/html/boost/algorithm/istarts_with.html +++ b/doc/html/boost/algorithm/istarts_with.html @@ -37,7 +37,7 @@ bool istarts_with(const Range1T & Input, const Range2T & Test, const std::locale & Loc = std::locale());

    -

    Description

    +

    Description

    This predicate holds when the test string is a prefix of the Input. In other words, if the input starts with the test. Elements are compared case insensitively.

    diff --git a/doc/html/boost/algorithm/iter_find.html b/doc/html/boost/algorithm/iter_find.html index 2fdad1aeaf..194691dfb1 100644 --- a/doc/html/boost/algorithm/iter_find.html +++ b/doc/html/boost/algorithm/iter_find.html @@ -37,7 +37,7 @@ SequenceSequenceT & iter_find(SequenceSequenceT & Result, RangeT & Input, FinderT Finder);

    -

    Description

    +

    Description

    This algorithm executes a given finder in iteration on the input, until the end of input is reached, or no match is found. Iteration is done using built-in find_iterator, so the real searching is performed only when needed. In each iteration new match is found and added to the result.

    diff --git a/doc/html/boost/algorithm/iter_split.html b/doc/html/boost/algorithm/iter_split.html index 38f12d9988..0937c21ecf 100644 --- a/doc/html/boost/algorithm/iter_split.html +++ b/doc/html/boost/algorithm/iter_split.html @@ -37,7 +37,7 @@ SequenceSequenceT & iter_split(SequenceSequenceT & Result, RangeT & Input, FinderT Finder);

    -

    Description

    +

    Description

    This algorithm executes a given finder in iteration on the input, until the end of input is reached, or no match is found. Iteration is done using built-in find_iterator, so the real searching is performed only when needed. Each match is used as a separator of segments. These segments are then returned in the result.

    diff --git a/doc/html/boost/algorithm/join.html b/doc/html/boost/algorithm/join.html index 1d7640a334..4641731204 100644 --- a/doc/html/boost/algorithm/join.html +++ b/doc/html/boost/algorithm/join.html @@ -8,7 +8,7 @@ - +

    @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -37,7 +37,7 @@ range_value< SequenceSequenceT >::type join(const SequenceSequenceT & Input, const Range1T & Separator);
    -

    Description

    +

    Description

    This algorithm joins all strings in a 'list' into one long string. Segments are concatenated by given separator.

    @@ -94,7 +94,7 @@

    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/algorithm/join_if_idm45506997401056.html b/doc/html/boost/algorithm/join_if_idm45506997401056.html new file mode 100644 index 0000000000..dc4d55f211 --- /dev/null +++ b/doc/html/boost/algorithm/join_if_idm45506997401056.html @@ -0,0 +1,112 @@ + + + + +Function template join_if + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template join_if

    +

    boost::algorithm::join_if — Conditional join algorithm.

    +
    +

    Synopsis

    +
    // In header: <boost/algorithm/string/regex.hpp>
+
+
+template<typename SequenceSequenceT, typename Range1T, typename CharT, 
+         typename RegexTraitsT> 
+  range_value< SequenceSequenceT >::type 
+  join_if(const SequenceSequenceT & Input, const Range1T & Separator, 
+          const basic_regex< CharT, RegexTraitsT > & Rx, 
+          match_flag_type Flags = match_default);
    +
    +

    Description

    +

    This algorithm joins all strings in a 'list' into one long string. Segments are concatenated by given separator. Only segments that match the given regular expression will be added to the result

    +

    This is a specialization of join_if algorithm.

    +

    + +

    +
    + + + + + +
    [Note]Note

    This function provides the strong exception-safety guarantee

    +

    +

    +
    ++++ + + + + + + + + + + +

    Parameters:

    ++++ + + + + + + + + + + + + + + + + + + +

    Flags

    Regex options

    Input

    A container that holds the input strings. It must be a container-of-containers.

    Rx

    A regular expression

    Separator

    A string that will separate the joined segments.

    Returns:

    Concatenated string.

    +
    +
    + + + +
    Copyright © 2002-2004 Pavol Droba

    Use, modification and distribution is subject to the Boost + Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/algorithm/join_if_idm45507095260992.html b/doc/html/boost/algorithm/join_if_idm45507095260992.html new file mode 100644 index 0000000000..93f9d58bcc --- /dev/null +++ b/doc/html/boost/algorithm/join_if_idm45507095260992.html @@ -0,0 +1,105 @@ + + + + +Function template join_if + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template join_if

    +

    boost::algorithm::join_if — Conditional join algorithm.

    +
    +

    Synopsis

    +
    // In header: <boost/algorithm/string/join.hpp>
+
+
+template<typename SequenceSequenceT, typename Range1T, typename PredicateT> 
+  range_value< SequenceSequenceT >::type 
+  join_if(const SequenceSequenceT & Input, const Range1T & Separator, 
+          PredicateT Pred);
    +
    +

    Description

    +

    This algorithm joins all strings in a 'list' into one long string. Segments are concatenated by given separator. Only segments that satisfy the predicate will be added to the result.

    +

    + +

    +
    + + + + + +
    [Note]Note

    This function provides the strong exception-safety guarantee

    +

    +

    +
    ++++ + + + + + + + + + + +

    Parameters:

    ++++ + + + + + + + + + + + + + + +

    Input

    A container that holds the input strings. It must be a container-of-containers.

    Pred

    A segment selection predicate

    Separator

    A string that will separate the joined segments.

    Returns:

    Concatenated string.

    +
    +
    + + + +
    Copyright © 2002-2004 Pavol Droba

    Use, modification and distribution is subject to the Boost + Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/algorithm/join_if_idp102602880.html b/doc/html/boost/algorithm/join_if_idp102602880.html deleted file mode 100644 index a986ca0614..0000000000 --- a/doc/html/boost/algorithm/join_if_idp102602880.html +++ /dev/null @@ -1,105 +0,0 @@ - - - - -Function template join_if - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template join_if

    -

    boost::algorithm::join_if — Conditional join algorithm.

    -
    -

    Synopsis

    -
    // In header: <boost/algorithm/string/join.hpp>
-
-
-template<typename SequenceSequenceT, typename Range1T, typename PredicateT> 
-  range_value< SequenceSequenceT >::type 
-  join_if(const SequenceSequenceT & Input, const Range1T & Separator, 
-          PredicateT Pred);
    -
    -

    Description

    -

    This algorithm joins all strings in a 'list' into one long string. Segments are concatenated by given separator. Only segments that satisfy the predicate will be added to the result.

    -

    - -

    -
    - - - - - -
    [Note]Note

    This function provides the strong exception-safety guarantee

    -

    -

    -
    ---- - - - - - - - - - - -

    Parameters:

    ---- - - - - - - - - - - - - - - -

    Input

    A container that holds the input strings. It must be a container-of-containers.

    Pred

    A segment selection predicate

    Separator

    A string that will separate the joined segments.

    Returns:

    Concatenated string.

    -
    -
    - - - -
    Copyright © 2002-2004 Pavol Droba

    Use, modification and distribution is subject to the Boost - Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/algorithm/join_if_idp214569568.html b/doc/html/boost/algorithm/join_if_idp214569568.html deleted file mode 100644 index 6ef5e561aa..0000000000 --- a/doc/html/boost/algorithm/join_if_idp214569568.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - -Function template join_if - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template join_if

    -

    boost::algorithm::join_if — Conditional join algorithm.

    -
    -

    Synopsis

    -
    // In header: <boost/algorithm/string/regex.hpp>
-
-
-template<typename SequenceSequenceT, typename Range1T, typename CharT, 
-         typename RegexTraitsT> 
-  range_value< SequenceSequenceT >::type 
-  join_if(const SequenceSequenceT & Input, const Range1T & Separator, 
-          const basic_regex< CharT, RegexTraitsT > & Rx, 
-          match_flag_type Flags = match_default);
    -
    -

    Description

    -

    This algorithm joins all strings in a 'list' into one long string. Segments are concatenated by given separator. Only segments that match the given regular expression will be added to the result

    -

    This is a specialization of join_if algorithm.

    -

    - -

    -
    - - - - - -
    [Note]Note

    This function provides the strong exception-safety guarantee

    -

    -

    -
    ---- - - - - - - - - - - -

    Parameters:

    ---- - - - - - - - - - - - - - - - - - - -

    Flags

    Regex options

    Input

    A container that holds the input strings. It must be a container-of-containers.

    Rx

    A regular expression

    Separator

    A string that will separate the joined segments.

    Returns:

    Concatenated string.

    -
    -
    - - - -
    Copyright © 2002-2004 Pavol Droba

    Use, modification and distribution is subject to the Boost - Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/algorithm/last_finder.html b/doc/html/boost/algorithm/last_finder.html index e4555b9281..dfcf452977 100644 --- a/doc/html/boost/algorithm/last_finder.html +++ b/doc/html/boost/algorithm/last_finder.html @@ -37,7 +37,7 @@ template<typename RangeT, typename PredicateT> unspecified last_finder(const RangeT & Search, PredicateT Comp);
    -

    Description

    +

    Description

    Construct the last_finder. The finder searches for the last occurrence of the string in a given input. The result is given as an iterator_range delimiting the match.

    diff --git a/doc/html/boost/algorithm/lexicographical_compare.html b/doc/html/boost/algorithm/lexicographical_compare.html index 825e852f0a..2664ead401 100644 --- a/doc/html/boost/algorithm/lexicographical_compare.html +++ b/doc/html/boost/algorithm/lexicographical_compare.html @@ -39,7 +39,7 @@ template<typename Range1T, typename Range2T> bool lexicographical_compare(const Range1T & Arg1, const Range2T & Arg2);

    -

    Description

    +

    Description

    This predicate is an overload of std::lexicographical_compare for range arguments

    It check whether the first argument is lexicographically less then the second one.

    If the optional predicate is specified, it is used for character-wise comparison

    diff --git a/doc/html/boost/algorithm/make_find_iterator.html b/doc/html/boost/algorithm/make_find_iterator.html index 59842378a0..a2c7673d87 100644 --- a/doc/html/boost/algorithm/make_find_iterator.html +++ b/doc/html/boost/algorithm/make_find_iterator.html @@ -37,7 +37,7 @@ find_iterator< typename range_iterator< RangeT >::type > make_find_iterator(RangeT & Collection, FinderT Finder);
    -

    Description

    +

    Description

    Construct a find iterator to iterate through the specified string

    diff --git a/doc/html/boost/algorithm/make_split_iterator.html b/doc/html/boost/algorithm/make_split_iterator.html index 39c4ae5a7e..d356b937e9 100644 --- a/doc/html/boost/algorithm/make_split_iterator.html +++ b/doc/html/boost/algorithm/make_split_iterator.html @@ -37,7 +37,7 @@ split_iterator< typename range_iterator< RangeT >::type > make_split_iterator(RangeT & Collection, FinderT Finder);
-

Description

+

Description

Construct a split iterator to iterate through the specified collection

diff --git a/doc/html/boost/algorithm/nth_finder.html b/doc/html/boost/algorithm/nth_finder.html index 6ebc159553..d1f2e9ef58 100644 --- a/doc/html/boost/algorithm/nth_finder.html +++ b/doc/html/boost/algorithm/nth_finder.html @@ -38,7 +38,7 @@ template<typename RangeT, typename PredicateT> unspecified nth_finder(const RangeT & Search, int Nth, PredicateT Comp);
-

Description

+

Description

Construct the nth_finder. The finder searches for the n-th (zero-indexed) occurrence of the string in a given input. The result is given as an iterator_range delimiting the match.

diff --git a/doc/html/boost/algorithm/operator___idp97198576.html b/doc/html/boost/algorithm/operator___idp97198576.html deleted file mode 100644 index 2643b64992..0000000000 --- a/doc/html/boost/algorithm/operator___idp97198576.html +++ /dev/null @@ -1,91 +0,0 @@ - - - - -Function template operator&& - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-

-
-PrevUpHomeNext -
-
-
-
-

Function template operator&&

-

boost::algorithm::operator&& — predicate 'and' composition predicate

-
-

Synopsis

-
// In header: <boost/algorithm/string/classification.hpp>
-
-
-template<typename Pred1T, typename Pred2T> 
-  unspecified operator&&(const predicate_facade< Pred1T > & Pred1, 
-                         const predicate_facade< Pred2T > & Pred2);
-
-

Description

-

Construct the class_and predicate. This predicate can be used to logically combine two classification predicates. class_and holds, if both predicates return true.

-

- -

-
---- - - - - - - - - - - -

Parameters:

---- - - - - - - - - - - -

Pred1

The first predicate

Pred2

The second predicate

Returns:

An instance of the class_and predicate

-
-
- - - -
Copyright © 2002-2004 Pavol Droba

Use, modification and distribution is subject to the Boost - Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/operator__idp99169024.html b/doc/html/boost/algorithm/operator__idp99169024.html deleted file mode 100644 index 0a7b06bc27..0000000000 --- a/doc/html/boost/algorithm/operator__idp99169024.html +++ /dev/null @@ -1,84 +0,0 @@ - - - - -Function template operator! - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template operator!

-

boost::algorithm::operator! — predicate negation operator

-
-

Synopsis

-
// In header: <boost/algorithm/string/classification.hpp>
-
-
-template<typename PredT> 
-  unspecified operator!(const predicate_facade< PredT > & Pred);
-
-

Description

-

Construct the class_not predicate. This predicate represents a negation. class_or holds if of the predicates return false.

-

- -

-
---- - - - - - - - - - - -

Parameters:

---- - - - - -

Pred

The predicate to be negated

Returns:

An instance of the class_not predicate

-
-
- - - -
Copyright © 2002-2004 Pavol Droba

Use, modification and distribution is subject to the Boost - Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/operator_idm45506971184944.html b/doc/html/boost/algorithm/operator_idm45506971184944.html new file mode 100644 index 0000000000..a33c195270 --- /dev/null +++ b/doc/html/boost/algorithm/operator_idm45506971184944.html @@ -0,0 +1,91 @@ + + + + +Function template operator&& + + + + + + + + + + + + + + + +
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
+
+
+PrevUpHomeNext +
+
+
+
+

Function template operator&&

+

boost::algorithm::operator&& — predicate 'and' composition predicate

+
+

Synopsis

+
// In header: <boost/algorithm/string/classification.hpp>
+
+
+template<typename Pred1T, typename Pred2T> 
+  unspecified operator&&(const predicate_facade< Pred1T > & Pred1, 
+                         const predicate_facade< Pred2T > & Pred2);
+
+

Description

+

Construct the class_and predicate. This predicate can be used to logically combine two classification predicates. class_and holds, if both predicates return true.

+

+ +

+
++++ + + + + + + + + + + +

Parameters:

++++ + + + + + + + + + + +

Pred1

The first predicate

Pred2

The second predicate

Returns:

An instance of the class_and predicate

+
+
+ + + +
Copyright © 2002-2004 Pavol Droba

Use, modification and distribution is subject to the Boost + Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/doc/html/boost/algorithm/operator_idm45507049375408.html b/doc/html/boost/algorithm/operator_idm45507049375408.html new file mode 100644 index 0000000000..e992a94b9a --- /dev/null +++ b/doc/html/boost/algorithm/operator_idm45507049375408.html @@ -0,0 +1,91 @@ + + + + +Function template operator|| + + + + + + + + + + + + + + + +
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
+
+
+PrevUpHomeNext +
+
+
+
+

Function template operator||

+

boost::algorithm::operator|| — predicate 'or' composition predicate

+
+

Synopsis

+
// In header: <boost/algorithm/string/classification.hpp>
+
+
+template<typename Pred1T, typename Pred2T> 
+  unspecified operator||(const predicate_facade< Pred1T > & Pred1, 
+                         const predicate_facade< Pred2T > & Pred2);
+
+

Description

+

Construct the class_or predicate. This predicate can be used to logically combine two classification predicates. class_or holds, if one of the predicates return true.

+

+ +

+
++++ + + + + + + + + + + +

Parameters:

++++ + + + + + + + + + + +

Pred1

The first predicate

Pred2

The second predicate

Returns:

An instance of the class_or predicate

+
+
+ + + +
Copyright © 2002-2004 Pavol Droba

Use, modification and distribution is subject to the Boost + Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/doc/html/boost/algorithm/operator_idm45507108212576.html b/doc/html/boost/algorithm/operator_idm45507108212576.html new file mode 100644 index 0000000000..fbd2fa2750 --- /dev/null +++ b/doc/html/boost/algorithm/operator_idm45507108212576.html @@ -0,0 +1,84 @@ + + + + +Function template operator! + + + + + + + + + + + + + + + +
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
+
+
+PrevUpHomeNext +
+
+
+
+

Function template operator!

+

boost::algorithm::operator! — predicate negation operator

+
+

Synopsis

+
// In header: <boost/algorithm/string/classification.hpp>
+
+
+template<typename PredT> 
+  unspecified operator!(const predicate_facade< PredT > & Pred);
+
+

Description

+

Construct the class_not predicate. This predicate represents a negation. class_or holds if of the predicates return false.

+

+ +

+
++++ + + + + + + + + + + +

Parameters:

++++ + + + + +

Pred

The predicate to be negated

Returns:

An instance of the class_not predicate

+
+
+ + + +
Copyright © 2002-2004 Pavol Droba

Use, modification and distribution is subject to the Boost + Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/doc/html/boost/algorithm/operator_idp162356144.html b/doc/html/boost/algorithm/operator_idp162356144.html deleted file mode 100644 index 44bdc30c62..0000000000 --- a/doc/html/boost/algorithm/operator_idp162356144.html +++ /dev/null @@ -1,91 +0,0 @@ - - - - -Function template operator|| - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template operator||

-

boost::algorithm::operator|| — predicate 'or' composition predicate

-
-

Synopsis

-
// In header: <boost/algorithm/string/classification.hpp>
-
-
-template<typename Pred1T, typename Pred2T> 
-  unspecified operator||(const predicate_facade< Pred1T > & Pred1, 
-                         const predicate_facade< Pred2T > & Pred2);
-
-

Description

-

Construct the class_or predicate. This predicate can be used to logically combine two classification predicates. class_or holds, if one of the predicates return true.

-

- -

-
---- - - - - - - - - - - -

Parameters:

---- - - - - - - - - - - -

Pred1

The first predicate

Pred2

The second predicate

Returns:

An instance of the class_or predicate

-
-
- - - -
Copyright © 2002-2004 Pavol Droba

Use, modification and distribution is subject to the Boost - Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/range_finder.html b/doc/html/boost/algorithm/range_finder.html index 8ca271ef06..62d906dfb0 100644 --- a/doc/html/boost/algorithm/range_finder.html +++ b/doc/html/boost/algorithm/range_finder.html @@ -38,7 +38,7 @@ template<typename ForwardIteratorT> unspecified range_finder(iterator_range< ForwardIteratorT > Range);
-

Description

+

Description

Construct the range_finder. The finder does not perform any operation. It simply returns the given range for any input.

diff --git a/doc/html/boost/algorithm/regex_finder.html b/doc/html/boost/algorithm/regex_finder.html index 3199555614..291f3a41b8 100644 --- a/doc/html/boost/algorithm/regex_finder.html +++ b/doc/html/boost/algorithm/regex_finder.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@

-PrevUpHomeNext +PrevUpHomeNext
@@ -37,7 +37,7 @@ unspecified regex_finder(const basic_regex< CharT, RegexTraitsT > & Rx, match_flag_type MatchFlags = match_default);
-

Description

+

Description

Construct the regex_finder. Finder uses the regex engine to search for a match. Result is given in regex_search_result. This is an extension of the iterator_range. In addition it contains match results from the regex_search algorithm.

@@ -85,7 +85,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/boost/algorithm/regex_formatter.html b/doc/html/boost/algorithm/regex_formatter.html index aadcbaf893..4f24c6cd34 100644 --- a/doc/html/boost/algorithm/regex_formatter.html +++ b/doc/html/boost/algorithm/regex_formatter.html @@ -37,7 +37,7 @@ unspecified regex_formatter(const std::basic_string< CharT, TraitsT, AllocT > & Format, match_flag_type Flags = format_default);
-

Description

+

Description

Construct the regex_formatter. Regex formatter uses the regex engine to format a match found by the regex_finder. This formatted it designed to closely cooperate with regex_finder.

diff --git a/doc/html/boost/algorithm/replace_all.html b/doc/html/boost/algorithm/replace_all.html index bff346d8ab..ecc0874f96 100644 --- a/doc/html/boost/algorithm/replace_all.html +++ b/doc/html/boost/algorithm/replace_all.html @@ -37,7 +37,7 @@ void replace_all(SequenceT & Input, const Range1T & Search, const Range2T & Format);

-

Description

+

Description

Replace all occurrences of the search string in the input with the format string. The input sequence is modified in-place.

diff --git a/doc/html/boost/algorithm/replace_all_copy.html b/doc/html/boost/algorithm/replace_all_copy.html index 1a675f8ed1..df3bce34e9 100644 --- a/doc/html/boost/algorithm/replace_all_copy.html +++ b/doc/html/boost/algorithm/replace_all_copy.html @@ -42,7 +42,7 @@ SequenceT replace_all_copy(const SequenceT & Input, const Range1T & Search, const Range2T & Format);

-

Description

+

Description

Replace all occurrences of the search string in the input with the format string. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator.

diff --git a/doc/html/boost/algorithm/replace_all_regex.html b/doc/html/boost/algorithm/replace_all_regex.html index 48984f2e67..33f7a93386 100644 --- a/doc/html/boost/algorithm/replace_all_regex.html +++ b/doc/html/boost/algorithm/replace_all_regex.html @@ -40,7 +40,7 @@ const std::basic_string< CharT, FormatStringTraitsT, FormatStringAllocatorT > & Format, match_flag_type Flags = match_default|format_default);

-

Description

+

Description

Format all substrings, matching given regex, with the specified format. The input string is modified in-place.

diff --git a/doc/html/boost/algorithm/replace_all_regex_copy.html b/doc/html/boost/algorithm/replace_all_regex_copy.html index a84ff3d9f9..2f336320ef 100644 --- a/doc/html/boost/algorithm/replace_all_regex_copy.html +++ b/doc/html/boost/algorithm/replace_all_regex_copy.html @@ -48,7 +48,7 @@ const std::basic_string< CharT, FormatStringTraitsT, FormatStringAllocatorT > & Format, match_flag_type Flags = match_default|format_default);
-

Description

+

Description

Format all substrings, matching given regex, with the specified format. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator.

diff --git a/doc/html/boost/algorithm/replace_first.html b/doc/html/boost/algorithm/replace_first.html index 9ca3fc354f..872713b8de 100644 --- a/doc/html/boost/algorithm/replace_first.html +++ b/doc/html/boost/algorithm/replace_first.html @@ -37,7 +37,7 @@ void replace_first(SequenceT & Input, const Range1T & Search, const Range2T & Format);

-

Description

+

Description

replace the first match of the search substring in the input with the format string. The input sequence is modified in-place.

diff --git a/doc/html/boost/algorithm/replace_first_copy.html b/doc/html/boost/algorithm/replace_first_copy.html index d87983be70..b57525ff31 100644 --- a/doc/html/boost/algorithm/replace_first_copy.html +++ b/doc/html/boost/algorithm/replace_first_copy.html @@ -43,7 +43,7 @@ const Range1T & Search, const Range2T & Format);
-

Description

+

Description

Replace the first match of the search substring in the input with the format string. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator.

diff --git a/doc/html/boost/algorithm/replace_head.html b/doc/html/boost/algorithm/replace_head.html index 9a79c19d1c..3575d2b6fc 100644 --- a/doc/html/boost/algorithm/replace_head.html +++ b/doc/html/boost/algorithm/replace_head.html @@ -36,7 +36,7 @@ template<typename SequenceT, typename RangeT> void replace_head(SequenceT & Input, int N, const RangeT & Format);

-

Description

+

Description

Replace the head of the input with the given format string. The head is a prefix of a string of given size. If the sequence is shorter then required, the whole string is considered to be the head. The input sequence is modified in-place.

diff --git a/doc/html/boost/algorithm/replace_head_copy.html b/doc/html/boost/algorithm/replace_head_copy.html index c3e88588bf..e322f4e530 100644 --- a/doc/html/boost/algorithm/replace_head_copy.html +++ b/doc/html/boost/algorithm/replace_head_copy.html @@ -41,7 +41,7 @@ SequenceT replace_head_copy(const SequenceT & Input, int N, const RangeT & Format);
-

Description

+

Description

Replace the head of the input with the given format string. The head is a prefix of a string of given size. If the sequence is shorter then required, whole string if considered to be the head. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator.

diff --git a/doc/html/boost/algorithm/replace_last.html b/doc/html/boost/algorithm/replace_last.html index 7d3cf0c3a8..c9361cbf59 100644 --- a/doc/html/boost/algorithm/replace_last.html +++ b/doc/html/boost/algorithm/replace_last.html @@ -37,7 +37,7 @@ void replace_last(SequenceT & Input, const Range1T & Search, const Range2T & Format);

-

Description

+

Description

Replace the last match of the search string in the input with the format string. Input sequence is modified in-place.

diff --git a/doc/html/boost/algorithm/replace_last_copy.html b/doc/html/boost/algorithm/replace_last_copy.html index e3a3ae9d73..90f79f623e 100644 --- a/doc/html/boost/algorithm/replace_last_copy.html +++ b/doc/html/boost/algorithm/replace_last_copy.html @@ -42,7 +42,7 @@ SequenceT replace_last_copy(const SequenceT & Input, const Range1T & Search, const Range2T & Format);
-

Description

+

Description

Replace the last match of the search string in the input with the format string. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator.

diff --git a/doc/html/boost/algorithm/replace_nth.html b/doc/html/boost/algorithm/replace_nth.html index e13641555b..11c616bdbc 100644 --- a/doc/html/boost/algorithm/replace_nth.html +++ b/doc/html/boost/algorithm/replace_nth.html @@ -37,7 +37,7 @@ void replace_nth(SequenceT & Input, const Range1T & Search, int Nth, const Range2T & Format);

-

Description

+

Description

Replace an Nth (zero-indexed) match of the search string in the input with the format string. Input sequence is modified in-place.

diff --git a/doc/html/boost/algorithm/replace_nth_copy.html b/doc/html/boost/algorithm/replace_nth_copy.html index 5db6232a31..5ee050a9cf 100644 --- a/doc/html/boost/algorithm/replace_nth_copy.html +++ b/doc/html/boost/algorithm/replace_nth_copy.html @@ -42,7 +42,7 @@ SequenceT replace_nth_copy(const SequenceT & Input, const Range1T & Search, int Nth, const Range2T & Format);
-

Description

+

Description

Replace an Nth (zero-indexed) match of the search string in the input with the format string. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator.

diff --git a/doc/html/boost/algorithm/replace_range.html b/doc/html/boost/algorithm/replace_range.html index 3521266c90..93230fdcb6 100644 --- a/doc/html/boost/algorithm/replace_range.html +++ b/doc/html/boost/algorithm/replace_range.html @@ -38,7 +38,7 @@ const iterator_range< typename range_iterator< SequenceT >::type > & SearchRange, const RangeT & Format);

-

Description

+

Description

Replace the given range in the input string. The input sequence is modified in-place.

diff --git a/doc/html/boost/algorithm/replace_range_copy.html b/doc/html/boost/algorithm/replace_range_copy.html index 63c3ba0119..93043139fa 100644 --- a/doc/html/boost/algorithm/replace_range_copy.html +++ b/doc/html/boost/algorithm/replace_range_copy.html @@ -43,7 +43,7 @@ const iterator_range< typename range_const_iterator< SequenceT >::type > & SearchRange, const RangeT & Format);
-

Description

+

Description

Replace the given range in the input string. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator.

diff --git a/doc/html/boost/algorithm/replace_regex.html b/doc/html/boost/algorithm/replace_regex.html index f2b981452f..368cce2eb7 100644 --- a/doc/html/boost/algorithm/replace_regex.html +++ b/doc/html/boost/algorithm/replace_regex.html @@ -40,7 +40,7 @@ const std::basic_string< CharT, FormatStringTraitsT, FormatStringAllocatorT > & Format, match_flag_type Flags = match_default|format_default);

-

Description

+

Description

Search for a substring matching given regex and format it with the specified format. The input string is modified in-place.

diff --git a/doc/html/boost/algorithm/replace_regex_copy.html b/doc/html/boost/algorithm/replace_regex_copy.html index b1db30cd86..72c202b3ea 100644 --- a/doc/html/boost/algorithm/replace_regex_copy.html +++ b/doc/html/boost/algorithm/replace_regex_copy.html @@ -48,7 +48,7 @@ const std::basic_string< CharT, FormatStringTraitsT, FormatStringAllocatorT > & Format, match_flag_type Flags = match_default|format_default);
-

Description

+

Description

Search for a substring matching given regex and format it with the specified format. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator.

diff --git a/doc/html/boost/algorithm/replace_tail.html b/doc/html/boost/algorithm/replace_tail.html index 44c4dceb37..212f92fcfc 100644 --- a/doc/html/boost/algorithm/replace_tail.html +++ b/doc/html/boost/algorithm/replace_tail.html @@ -36,7 +36,7 @@ template<typename SequenceT, typename RangeT> void replace_tail(SequenceT & Input, int N, const RangeT & Format);

-

Description

+

Description

Replace the tail of the input with the given format sequence. The tail is a suffix of a string of given size. If the sequence is shorter then required, the whole string is considered to be the tail. The input sequence is modified in-place.

diff --git a/doc/html/boost/algorithm/replace_tail_copy.html b/doc/html/boost/algorithm/replace_tail_copy.html index 984b122eed..e66ede591a 100644 --- a/doc/html/boost/algorithm/replace_tail_copy.html +++ b/doc/html/boost/algorithm/replace_tail_copy.html @@ -41,7 +41,7 @@ SequenceT replace_tail_copy(const SequenceT & Input, int N, const RangeT & Format);
-

Description

+

Description

Replace the tail of the input with the given format string. The tail is a suffix of a string of given size. If the sequence is shorter then required, whole string is considered to be the tail. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator.

diff --git a/doc/html/boost/algorithm/split_idm45506997439552.html b/doc/html/boost/algorithm/split_idm45506997439552.html new file mode 100644 index 0000000000..1ed5d0161f --- /dev/null +++ b/doc/html/boost/algorithm/split_idm45506997439552.html @@ -0,0 +1,119 @@ + + + + +Function template split + + + + + + + + + + + + + + + +
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
+

+
+PrevUpHomeNext +
+
+
+
+

Function template split

+

boost::algorithm::split — Split algorithm.

+
+

Synopsis

+
// In header: <boost/algorithm/string/split.hpp>
+
+
+template<typename SequenceSequenceT, typename RangeT, typename PredicateT> 
+  SequenceSequenceT & 
+  split(SequenceSequenceT & Result, RangeT & Input, PredicateT Pred, 
+        token_compress_mode_type eCompress = token_compress_off);
+
+

Description

+

Tokenize expression. This function is equivalent to C strtok. Input sequence is split into tokens, separated by separators. Separators are given by means of the predicate.

+

Each part is copied and added as a new element to the output container. Thus the result container must be able to hold copies of the matches (in a compatible structure like std::string) or a reference to it (e.g. using the iterator range class). Examples of such a container are std::vector<std::string> or std::list<boost::iterator_range<std::string::iterator>>

+

+ +

+
+ + + + + +
[Note]Note

Prior content of the result will be overwritten.

+

+

+
+ + + + + +
[Note]Note

This function provides the strong exception-safety guarantee

+

+

+
++++ + + + + + + + + + + +

Parameters:

++++ + + + + + + + + + + + + + + + + + + +

Input

A container which will be searched.

Pred

A predicate to identify separators. This predicate is supposed to return true if a given element is a separator.

Result

A container that can hold copies of references to the substrings

eCompress

If eCompress argument is set to token_compress_on, adjacent separators are merged together. Otherwise, every two separators delimit a token.

Returns:

A reference the result

+
+
+ + + +
Copyright © 2002-2004 Pavol Droba

Use, modification and distribution is subject to the Boost + Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/doc/html/boost/algorithm/split_idp159921872.html b/doc/html/boost/algorithm/split_idp159921872.html deleted file mode 100644 index 73de012691..0000000000 --- a/doc/html/boost/algorithm/split_idp159921872.html +++ /dev/null @@ -1,119 +0,0 @@ - - - - -Function template split - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template split

-

boost::algorithm::split — Split algorithm.

-
-

Synopsis

-
// In header: <boost/algorithm/string/split.hpp>
-
-
-template<typename SequenceSequenceT, typename RangeT, typename PredicateT> 
-  SequenceSequenceT & 
-  split(SequenceSequenceT & Result, RangeT & Input, PredicateT Pred, 
-        token_compress_mode_type eCompress = token_compress_off);
-
-

Description

-

Tokenize expression. This function is equivalent to C strtok. Input sequence is split into tokens, separated by separators. Separators are given by means of the predicate.

-

Each part is copied and added as a new element to the output container. Thus the result container must be able to hold copies of the matches (in a compatible structure like std::string) or a reference to it (e.g. using the iterator range class). Examples of such a container are std::vector<std::string> or std::list<boost::iterator_range<std::string::iterator>>

-

- -

-
- - - - - -
[Note]Note

Prior content of the result will be overwritten.

-

-

-
- - - - - -
[Note]Note

This function provides the strong exception-safety guarantee

-

-

-
---- - - - - - - - - - - -

Parameters:

---- - - - - - - - - - - - - - - - - - - -

Input

A container which will be searched.

Pred

A predicate to identify separators. This predicate is supposed to return true if a given element is a separator.

Result

A container that can hold copies of references to the substrings

eCompress

If eCompress argument is set to token_compress_on, adjacent separators are merged together. Otherwise, every two separators delimit a token.

Returns:

A reference the result

-
-
- - - -
Copyright © 2002-2004 Pavol Droba

Use, modification and distribution is subject to the Boost - Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/split_iterator.html b/doc/html/boost/algorithm/split_iterator.html index 2fabf7e700..208f3705b0 100644 --- a/doc/html/boost/algorithm/split_iterator.html +++ b/doc/html/boost/algorithm/split_iterator.html @@ -37,33 +37,33 @@ { public: // construct/copy/destruct - split_iterator(); - split_iterator(const split_iterator &); - template<typename FinderT> split_iterator(IteratorT, IteratorT, FinderT); + split_iterator(); + split_iterator(const split_iterator &); + template<typename FinderT> split_iterator(IteratorT, IteratorT, FinderT); template<typename FinderT, typename RangeT> - split_iterator(RangeT &, FinderT); + split_iterator(RangeT &, FinderT); - // public member functions - bool eof() const; + // public member functions + bool eof() const; - // private member functions - const match_type & dereference() const; - void increment(); - bool equal(const split_iterator &) const; + // private member functions + const match_type & dereference() const; + void increment(); + bool equal(const split_iterator &) const; };
-

Description

+

Description

Split iterator encapsulates a Finder and allows for incremental searching in a string. Unlike the find iterator, split iterator iterates through gaps between matches.

Find iterator is a readable forward traversal iterator.

Dereferencing the iterator yields an iterator_range delimiting the current match.

-

+

split_iterator public construct/copy/destruct

  1. -
    split_iterator();
    Default constructor.

    Construct null iterator. All null iterators are equal.

    +
    split_iterator();
    Default constructor.

    Construct null iterator. All null iterators are equal.

    @@ -78,32 +78,32 @@
  2. -
    split_iterator(const split_iterator & Other);
    Copy constructor.

    Construct a copy of the split_iterator

    +
    split_iterator(const split_iterator & Other);
    Copy constructor.

    Construct a copy of the split_iterator 

  3. template<typename FinderT> 
-  split_iterator(IteratorT Begin, IteratorT End, FinderT Finder);
    Constructor.

    Construct new split_iterator for a given finder and a range.

    + split_iterator(IteratorT Begin, IteratorT End, FinderT Finder);Constructor.

    Construct new split_iterator for a given finder and a range. 

  4. template<typename FinderT, typename RangeT> 
-  split_iterator(RangeT & Col, FinderT Finder);
    Constructor.

    Construct new split_iterator for a given finder and a collection.

    + split_iterator(RangeT & Col, FinderT Finder);Constructor.

    Construct new split_iterator for a given finder and a collection.

-

-split_iterator public member functions

+

+split_iterator public member functions

  1. -
    bool eof() const;
    Eof check.

    Check the eof condition. Eof condition means that there is nothing more to be searched i.e. find_iterator is after the last match.

    +
    bool eof() const;
    Eof check.

    Check the eof condition. Eof condition means that there is nothing more to be searched i.e. find_iterator is after the last match.

-

-split_iterator private member functions

+

+split_iterator private member functions

    -
  1. const match_type & dereference() const;
    2. -
  2. void increment();
    3. -
  3. bool equal(const split_iterator & Other) const;
    4. +
  4. const match_type & dereference() const;
    5. +
  5. void increment();
    6. +
  6. bool equal(const split_iterator & Other) const;
diff --git a/doc/html/boost/algorithm/split_regex.html b/doc/html/boost/algorithm/split_regex.html index 609fc3d9aa..25675a8e42 100644 --- a/doc/html/boost/algorithm/split_regex.html +++ b/doc/html/boost/algorithm/split_regex.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
-PrevUpHomeNext +PrevUpHomeNext
@@ -40,7 +40,7 @@ const basic_regex< CharT, RegexTraitsT > & Rx, match_flag_type Flags = match_default);
-

Description

+

Description

Tokenize expression. This function is equivalent to C strtok. Input sequence is split into tokens, separated by separators. Separator is an every match of the given regex. Each part is copied and added as a new element to the output container. Thus the result container must be able to hold copies of the matches (in a compatible structure like std::string) or a reference to it (e.g. using the iterator range class). Examples of such a container are std::vector<std::string> or std::list<boost::iterator_range<std::string::iterator>>

@@ -114,7 +114,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/boost/algorithm/starts_with.html b/doc/html/boost/algorithm/starts_with.html index df3320f788..d45236038f 100644 --- a/doc/html/boost/algorithm/starts_with.html +++ b/doc/html/boost/algorithm/starts_with.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
-PrevUpHomeNext +PrevUpHomeNext
@@ -39,7 +39,7 @@ template<typename Range1T, typename Range2T> bool starts_with(const Range1T & Input, const Range2T & Test);
-

Description

+

Description

This predicate holds when the test string is a prefix of the Input. In other words, if the input starts with the test. When the optional predicate is specified, it is used for character-wise comparison.

@@ -100,7 +100,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/boost/algorithm/tail_finder.html b/doc/html/boost/algorithm/tail_finder.html index 8371f517e3..b9702adb7f 100644 --- a/doc/html/boost/algorithm/tail_finder.html +++ b/doc/html/boost/algorithm/tail_finder.html @@ -35,7 +35,7 @@ unspecified tail_finder(int N);
-

Description

+

Description

Construct the tail_finder. The finder returns a tail of a given input. The tail is a suffix of a string up to n elements in size. If an input has less then n elements, whole input is considered a head. The result is given as an iterator_range delimiting the match.

diff --git a/doc/html/boost/algorithm/to_lower.html b/doc/html/boost/algorithm/to_lower.html index 6b7f9548f9..c6643e3e5d 100644 --- a/doc/html/boost/algorithm/to_lower.html +++ b/doc/html/boost/algorithm/to_lower.html @@ -37,7 +37,7 @@ void to_lower(WritableRangeT & Input, const std::locale & Loc = std::locale());

-

Description

+

Description

Each element of the input sequence is converted to lower case. The input sequence is modified in-place.

diff --git a/doc/html/boost/algorithm/to_lower_copy.html b/doc/html/boost/algorithm/to_lower_copy.html index e9d4de38ec..a1bd21b9e8 100644 --- a/doc/html/boost/algorithm/to_lower_copy.html +++ b/doc/html/boost/algorithm/to_lower_copy.html @@ -41,7 +41,7 @@ SequenceT to_lower_copy(const SequenceT & Input, const std::locale & Loc = std::locale());
-

Description

+

Description

Each element of the input sequence is converted to lower case. The result is a copy of the input converted to lower case. It is returned as a sequence or copied to the output iterator.

diff --git a/doc/html/boost/algorithm/to_upper.html b/doc/html/boost/algorithm/to_upper.html index 7f6dd8938a..64f79172df 100644 --- a/doc/html/boost/algorithm/to_upper.html +++ b/doc/html/boost/algorithm/to_upper.html @@ -37,7 +37,7 @@ void to_upper(WritableRangeT & Input, const std::locale & Loc = std::locale());

-

Description

+

Description

Each element of the input sequence is converted to upper case. The input sequence is modified in-place.

diff --git a/doc/html/boost/algorithm/to_upper_copy.html b/doc/html/boost/algorithm/to_upper_copy.html index b70d4bade6..5690114bef 100644 --- a/doc/html/boost/algorithm/to_upper_copy.html +++ b/doc/html/boost/algorithm/to_upper_copy.html @@ -41,7 +41,7 @@ SequenceT to_upper_copy(const SequenceT & Input, const std::locale & Loc = std::locale());
-

Description

+

Description

Each element of the input sequence is converted to upper case. The result is a copy of the input converted to upper case. It is returned as a sequence or copied to the output iterator

diff --git a/doc/html/boost/algorithm/token_compress_mode_type.html b/doc/html/boost/algorithm/token_compress_mode_type.html index 5ac77e8b09..50bd496998 100644 --- a/doc/html/boost/algorithm/token_compress_mode_type.html +++ b/doc/html/boost/algorithm/token_compress_mode_type.html @@ -35,7 +35,7 @@ enum token_compress_mode_type { token_compress_on, token_compress_off };

-

Description

+

Description

Specifies token compression mode for the token_finder.

token_compress_on
diff --git a/doc/html/boost/algorithm/token_finder.html b/doc/html/boost/algorithm/token_finder.html index 858b8e0228..9bf8ebdace 100644 --- a/doc/html/boost/algorithm/token_finder.html +++ b/doc/html/boost/algorithm/token_finder.html @@ -37,7 +37,7 @@ unspecified token_finder(PredicateT Pred, token_compress_mode_type eCompress = token_compress_off);
-

Description

+

Description

Construct the token_finder. The finder searches for a token specified by a predicate. It is similar to std::find_if algorithm, with an exception that it return a range of instead of a single iterator.

If "compress token mode" is enabled, adjacent matching tokens are concatenated into one match. Thus the finder can be used to search for continuous segments of characters satisfying the given predicate.

The result is given as an iterator_range delimiting the match.

diff --git a/doc/html/boost/algorithm/trim.html b/doc/html/boost/algorithm/trim.html index 4c9549c73a..bcf4322181 100644 --- a/doc/html/boost/algorithm/trim.html +++ b/doc/html/boost/algorithm/trim.html @@ -36,7 +36,7 @@ template<typename SequenceT> void trim(SequenceT & Input, const std::locale & Loc = std::locale());
-

Description

+

Description

Remove all leading and trailing spaces from the input. The input sequence is modified in-place.

diff --git a/doc/html/boost/algorithm/trim_all.html b/doc/html/boost/algorithm/trim_all.html index 1b431b1724..84250647f3 100644 --- a/doc/html/boost/algorithm/trim_all.html +++ b/doc/html/boost/algorithm/trim_all.html @@ -36,7 +36,7 @@ template<typename SequenceT> void trim_all(SequenceT & Input, const std::locale & Loc = std::locale());
-

Description

+

Description

Remove all leading and trailing spaces from the input and compress all other spaces to a single character. The input sequence is modified in-place.

diff --git a/doc/html/boost/algorithm/trim_all_copy.html b/doc/html/boost/algorithm/trim_all_copy.html index b37ec3e555..328ae186da 100644 --- a/doc/html/boost/algorithm/trim_all_copy.html +++ b/doc/html/boost/algorithm/trim_all_copy.html @@ -37,7 +37,7 @@ SequenceT trim_all_copy(const SequenceT & Input, const std::locale & Loc = std::locale());

-

Description

+

Description

Remove all leading and trailing spaces from the input and compress all other spaces to a single character. The result is a trimmed copy of the input

diff --git a/doc/html/boost/algorithm/trim_all_copy_if.html b/doc/html/boost/algorithm/trim_all_copy_if.html index feb187159b..49725fddf7 100644 --- a/doc/html/boost/algorithm/trim_all_copy_if.html +++ b/doc/html/boost/algorithm/trim_all_copy_if.html @@ -36,7 +36,7 @@ template<typename SequenceT, typename PredicateT> SequenceT trim_all_copy_if(const SequenceT & Input, PredicateT IsSpace);

-

Description

+

Description

Remove all leading and trailing spaces from the input and compress all other spaces to a single character. The result is a trimmed copy of the input

diff --git a/doc/html/boost/algorithm/trim_all_if.html b/doc/html/boost/algorithm/trim_all_if.html index b165d373d0..0848717213 100644 --- a/doc/html/boost/algorithm/trim_all_if.html +++ b/doc/html/boost/algorithm/trim_all_if.html @@ -36,7 +36,7 @@ template<typename SequenceT, typename PredicateT> void trim_all_if(SequenceT & Input, PredicateT IsSpace);

-

Description

+

Description

Remove all leading and trailing spaces from the input and compress all other spaces to a single character. The input sequence is modified in-place.

diff --git a/doc/html/boost/algorithm/trim_copy.html b/doc/html/boost/algorithm/trim_copy.html index 3f9e345b3e..6f29dbbec5 100644 --- a/doc/html/boost/algorithm/trim_copy.html +++ b/doc/html/boost/algorithm/trim_copy.html @@ -37,7 +37,7 @@ SequenceT trim_copy(const SequenceT & Input, const std::locale & Loc = std::locale());
-

Description

+

Description

Remove all leading and trailing spaces from the input. The result is a trimmed copy of the input

diff --git a/doc/html/boost/algorithm/trim_copy_if.html b/doc/html/boost/algorithm/trim_copy_if.html index a5f11692b1..897393a26a 100644 --- a/doc/html/boost/algorithm/trim_copy_if.html +++ b/doc/html/boost/algorithm/trim_copy_if.html @@ -40,7 +40,7 @@ template<typename SequenceT, typename PredicateT> SequenceT trim_copy_if(const SequenceT & Input, PredicateT IsSpace);

-

Description

+

Description

Remove all trailing and leading spaces from the input. The supplied predicate is used to determine which characters are considered spaces. The result is a trimmed copy of the input. It is returned as a sequence or copied to the output iterator

diff --git a/doc/html/boost/algorithm/trim_fill.html b/doc/html/boost/algorithm/trim_fill.html index cbf0cd0996..0219e00d7c 100644 --- a/doc/html/boost/algorithm/trim_fill.html +++ b/doc/html/boost/algorithm/trim_fill.html @@ -37,7 +37,7 @@ void trim_fill(SequenceT & Input, const RangeT & Fill, const std::locale & Loc = std::locale());

-

Description

+

Description

Remove all leading and trailing spaces from the input and replace all every block of consecutive spaces with a fill string defined by user. The input sequence is modified in-place.

diff --git a/doc/html/boost/algorithm/trim_fill_copy.html b/doc/html/boost/algorithm/trim_fill_copy.html index c79514dc15..836b7cd827 100644 --- a/doc/html/boost/algorithm/trim_fill_copy.html +++ b/doc/html/boost/algorithm/trim_fill_copy.html @@ -37,7 +37,7 @@ SequenceT trim_fill_copy(const SequenceT & Input, const RangeT & Fill, const std::locale & Loc = std::locale());

-

Description

+

Description

Remove all leading and trailing spaces from the input and replace all every block of consecutive spaces with a fill string defined by user. The result is a trimmed copy of the input

diff --git a/doc/html/boost/algorithm/trim_fill_copy_if.html b/doc/html/boost/algorithm/trim_fill_copy_if.html index bed457105f..6a78940f9c 100644 --- a/doc/html/boost/algorithm/trim_fill_copy_if.html +++ b/doc/html/boost/algorithm/trim_fill_copy_if.html @@ -37,7 +37,7 @@ SequenceT trim_fill_copy_if(const SequenceT & Input, const RangeT & Fill, PredicateT IsSpace);

-

Description

+

Description

Remove all leading and trailing spaces from the input and replace all every block of consecutive spaces with a fill string defined by user. The result is a trimmed copy of the input

diff --git a/doc/html/boost/algorithm/trim_fill_if.html b/doc/html/boost/algorithm/trim_fill_if.html index 806c9ce118..a3fc9491d2 100644 --- a/doc/html/boost/algorithm/trim_fill_if.html +++ b/doc/html/boost/algorithm/trim_fill_if.html @@ -37,7 +37,7 @@ void trim_fill_if(SequenceT & Input, const RangeT & Fill, PredicateT IsSpace);

-

Description

+

Description

Remove all leading and trailing spaces from the input and replace all every block of consecutive spaces with a fill string defined by user. The input sequence is modified in-place.

diff --git a/doc/html/boost/algorithm/trim_if.html b/doc/html/boost/algorithm/trim_if.html index 43a5dc2ba6..243b94b89f 100644 --- a/doc/html/boost/algorithm/trim_if.html +++ b/doc/html/boost/algorithm/trim_if.html @@ -36,7 +36,7 @@ template<typename SequenceT, typename PredicateT> void trim_if(SequenceT & Input, PredicateT IsSpace);
-

Description

+

Description

Remove all leading and trailing spaces from the input. The supplied predicate is used to determine which characters are considered spaces. The input sequence is modified in-place.

diff --git a/doc/html/boost/algorithm/trim_left.html b/doc/html/boost/algorithm/trim_left.html index aa72612bf7..a25569f5d5 100644 --- a/doc/html/boost/algorithm/trim_left.html +++ b/doc/html/boost/algorithm/trim_left.html @@ -36,7 +36,7 @@ template<typename SequenceT> void trim_left(SequenceT & Input, const std::locale & Loc = std::locale());
-

Description

+

Description

Remove all leading spaces from the input. The Input sequence is modified in-place.

diff --git a/doc/html/boost/algorithm/trim_left_copy.html b/doc/html/boost/algorithm/trim_left_copy.html index 6d2ac9aec0..74ea51e46d 100644 --- a/doc/html/boost/algorithm/trim_left_copy.html +++ b/doc/html/boost/algorithm/trim_left_copy.html @@ -37,7 +37,7 @@ SequenceT trim_left_copy(const SequenceT & Input, const std::locale & Loc = std::locale());
-

Description

+

Description

Remove all leading spaces from the input. The result is a trimmed copy of the input.

diff --git a/doc/html/boost/algorithm/trim_left_copy_if.html b/doc/html/boost/algorithm/trim_left_copy_if.html index 7e9968b598..06e6a56821 100644 --- a/doc/html/boost/algorithm/trim_left_copy_if.html +++ b/doc/html/boost/algorithm/trim_left_copy_if.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@

-PrevUpHomeNext +PrevUpHomeNext
@@ -40,7 +40,7 @@ template<typename SequenceT, typename PredicateT> SequenceT trim_left_copy_if(const SequenceT & Input, PredicateT IsSpace);
-

Description

+

Description

Remove all leading spaces from the input. The supplied predicate is used to determine which characters are considered spaces. The result is a trimmed copy of the input. It is returned as a sequence or copied to the output iterator

@@ -101,7 +101,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/boost/algorithm/trim_left_if.html b/doc/html/boost/algorithm/trim_left_if.html index 782bac87e6..7fe4a1e932 100644 --- a/doc/html/boost/algorithm/trim_left_if.html +++ b/doc/html/boost/algorithm/trim_left_if.html @@ -36,7 +36,7 @@ template<typename SequenceT, typename PredicateT> void trim_left_if(SequenceT & Input, PredicateT IsSpace);
-

Description

+

Description

Remove all leading spaces from the input. The supplied predicate is used to determine which characters are considered spaces. The input sequence is modified in-place.

diff --git a/doc/html/boost/algorithm/trim_right.html b/doc/html/boost/algorithm/trim_right.html index 88a6dfb579..466fd027c5 100644 --- a/doc/html/boost/algorithm/trim_right.html +++ b/doc/html/boost/algorithm/trim_right.html @@ -36,7 +36,7 @@ template<typename SequenceT> void trim_right(SequenceT & Input, const std::locale & Loc = std::locale());
-

Description

+

Description

Remove all trailing spaces from the input. The input sequence is modified in-place.

diff --git a/doc/html/boost/algorithm/trim_right_copy.html b/doc/html/boost/algorithm/trim_right_copy.html index dd0d03e221..791104d54b 100644 --- a/doc/html/boost/algorithm/trim_right_copy.html +++ b/doc/html/boost/algorithm/trim_right_copy.html @@ -37,7 +37,7 @@ SequenceT trim_right_copy(const SequenceT & Input, const std::locale & Loc = std::locale());
-

Description

+

Description

Remove all trailing spaces from the input. The result is a trimmed copy of the input

diff --git a/doc/html/boost/algorithm/trim_right_copy_if.html b/doc/html/boost/algorithm/trim_right_copy_if.html index 01d05a2190..fea1e757c4 100644 --- a/doc/html/boost/algorithm/trim_right_copy_if.html +++ b/doc/html/boost/algorithm/trim_right_copy_if.html @@ -40,7 +40,7 @@ template<typename SequenceT, typename PredicateT> SequenceT trim_right_copy_if(const SequenceT & Input, PredicateT IsSpace);

-

Description

+

Description

Remove all trailing spaces from the input. The supplied predicate is used to determine which characters are considered spaces. The result is a trimmed copy of the input. It is returned as a sequence or copied to the output iterator

diff --git a/doc/html/boost/algorithm/trim_right_if.html b/doc/html/boost/algorithm/trim_right_if.html index f86571b859..2e86528873 100644 --- a/doc/html/boost/algorithm/trim_right_if.html +++ b/doc/html/boost/algorithm/trim_right_if.html @@ -36,7 +36,7 @@ template<typename SequenceT, typename PredicateT> void trim_right_if(SequenceT & Input, PredicateT IsSpace);

-

Description

+

Description

Remove all trailing spaces from the input. The supplied predicate is used to determine which characters are considered spaces. The input sequence is modified in-place.

diff --git a/doc/html/boost/any.html b/doc/html/boost/any.html index fbad86ccc1..b4c517c0c1 100644 --- a/doc/html/boost/any.html +++ b/doc/html/boost/any.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
-PrevUpHomeNext +PrevUpHomeNext
@@ -38,34 +38,34 @@ class any { public: // construct/copy/destruct - any(); - any(const any &); - any(any &&); - template<typename ValueType> any(const ValueType &); - template<typename ValueType> any(ValueType &&); - any & operator=(const any &); - any & operator=(any &&); - template<typename ValueType> any & operator=(const ValueType &); - template<typename ValueType> any & operator=(ValueType &&); - ~any(); + any(); + any(const any &); + any(any &&); + template<typename ValueType> any(const ValueType &); + template<typename ValueType> any(ValueType &&); + any & operator=(const any &); + any & operator=(any &&); + template<typename ValueType> any & operator=(const ValueType &); + template<typename ValueType> any & operator=(ValueType &&); + ~any(); - // modifiers - any & swap(any &); + // modifiers + any & swap(any &); - // queries - bool empty() const; - const std::type_info & type() const; + // queries + bool empty() const; + const std::type_info & type() const; };
-

Description

+

Description

-

+

any public construct/copy/destruct

  1. -
    any();
    +
    any();
    @@ -73,12 +73,12 @@ - +

    Postconditions:

    		this->empty()this->empty()
  2. -
    any(const any & other);
    +
    any(const any & other);
    @@ -104,7 +104,7 @@
  3. -
    any(any && other);
    +
    any(any && other);
    @@ -119,7 +119,7 @@ - + @@ -129,7 +129,7 @@

    Postconditions:

    		other->empty()other->empty()

    Throws:

  4. -
    template<typename ValueType> any(const ValueType & value);
    +
    template<typename ValueType> any(const ValueType & value);
    @@ -154,7 +154,7 @@
  5. -
    template<typename ValueType> any(ValueType && value);
    +
    template<typename ValueType> any(ValueType && value);
    @@ -179,7 +179,7 @@
  6. -
    any & operator=(const any & rhs);
    +
    any & operator=(const any & rhs);
    @@ -192,7 +192,7 @@ current instance, discarding previous content, so that the new content is equivalent in both type and value to the content of rhs, or empty if - rhs.empty(). + rhs.empty(). @@ -206,7 +206,7 @@

    Throws:

  7. -
    any & operator=(any && rhs);
    +
    any & operator=(any && rhs);
    @@ -219,11 +219,11 @@ current instance, discarding previous content, so that the new content is equivalent in both type and value to the content of rhs before move, or empty if - rhs.empty(). + rhs.empty(). - + @@ -233,7 +233,7 @@

    Postconditions:

    		rhs->empty()rhs->empty()

    Throws:

  8. -
    template<typename ValueType> any & operator=(const ValueType & rhs);
    +
    template<typename ValueType> any & operator=(const ValueType & rhs);
    @@ -259,7 +259,7 @@
  9. -
    template<typename ValueType> any & operator=(ValueType && rhs);
    +
    template<typename ValueType> any & operator=(ValueType && rhs);
    @@ -285,7 +285,7 @@
  10. -
    ~any();
    +
    ~any();
    @@ -307,10 +307,10 @@
    -

    -any modifiers

    +

    +any modifiers

    1. -
      any & swap(any & rhs);
      +
      any & swap(any & rhs);
    @@ -336,11 +336,11 @@
    -

    -any queries

    +

    +any queries

    1. -
      bool empty() const;
      +
      bool empty() const;
    @@ -361,7 +361,7 @@
  11. -
    const std::type_info & type() const;
    +
    const std::type_info & type() const;
    @@ -397,7 +397,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/any_cast_idm45507162615824.html b/doc/html/boost/any_cast_idm45507162615824.html new file mode 100644 index 0000000000..cc848332a1 --- /dev/null +++ b/doc/html/boost/any_cast_idm45507162615824.html @@ -0,0 +1,86 @@ + + + + +Function any_cast + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function any_cast

    +

    boost::any_cast — Custom keyword cast for extracting a value + of a given type from an + any.

    +
    +

    Synopsis

    +
    // In header: <boost/any.hpp>
+
+
+template<typename T> T any_cast(any & operand);
+template<typename T> T any_cast(any && operand);
+template<typename T> T any_cast(const any & operand);
+template<typename ValueType> const ValueType * any_cast(const any * operand);
+template<typename ValueType> ValueType * any_cast(any * operand);
    +
    +

    Description

    +
    ++++ + + + + + + + + + + +

    Returns:

    		 If passed a pointer, it returns a + similarly qualified pointer to the value content if + successful, otherwise null is returned. + If T is ValueType, it returns a copy of the held value, otherwise, if T is a reference + to (possibly const qualified) ValueType, it returns a reference to the held + value.

    Throws:

    		Overloads taking an + any pointer do not + throw; overloads taking an + any value or reference + throws bad_any_cast if + unsuccessful.
    +
    +
    + + + +
    Copyright © 2001 Kevlin Henney

    Distributed under the Boost Software License, Version 1.0. + (See accompanying file LICENSE_1_0.txt or copy at + http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/any_cast_idp45214624.html b/doc/html/boost/any_cast_idp45214624.html deleted file mode 100644 index b434b1ab2a..0000000000 --- a/doc/html/boost/any_cast_idp45214624.html +++ /dev/null @@ -1,86 +0,0 @@ - - - - -Function any_cast - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function any_cast

    -

    boost::any_cast — Custom keyword cast for extracting a value - of a given type from an - any.

    -
    -

    Synopsis

    -
    // In header: <boost/any.hpp>
-
-
-template<typename T> T any_cast(any & operand);
-template<typename T> T any_cast(any && operand);
-template<typename T> T any_cast(const any & operand);
-template<typename ValueType> const ValueType * any_cast(const any * operand);
-template<typename ValueType> ValueType * any_cast(any * operand);
    -
    -

    Description

    -
    ---- - - - - - - - - - - -

    Returns:

    		 If passed a pointer, it returns a - similarly qualified pointer to the value content if - successful, otherwise null is returned. - If T is ValueType, it returns a copy of the held value, otherwise, if T is a reference - to (possibly const qualified) ValueType, it returns a reference to the held - value.

    Throws:

    		Overloads taking an - any pointer do not - throw; overloads taking an - any value or reference - throws bad_any_cast if - unsuccessful.
    -
    -
    - - - -
    Copyright © 2001 Kevlin Henney

    Distributed under the Boost Software License, Version 1.0. - (See accompanying file LICENSE_1_0.txt or copy at - http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/apply_vi_idm45507085892176.html b/doc/html/boost/apply_vi_idm45507085892176.html new file mode 100644 index 0000000000..aba66cbf27 --- /dev/null +++ b/doc/html/boost/apply_vi_idm45507085892176.html @@ -0,0 +1,104 @@ + + + + +Class template apply_visitor_delayed_cpp14_t + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Class template apply_visitor_delayed_cpp14_t

    +

    boost::apply_visitor_delayed_cpp14_t — Adapts a visitor for use as a function object.

    +
    +

    Synopsis

    +
    // In header: <boost/variant/apply_visitor.hpp>
+
+template<typename Visitor> 
+class apply_visitor_delayed_cpp14_t {
+public:
+  // construct/copy/destruct
+  explicit apply_visitor_delayed_cpp14_t(Visitor &);
+
+  // function object interface
+  template<typename ... Variant> decltype(auto) operator()(Variant&...);
+};
    +
    +

    Description

    +

    Adapts the function given at construction for use as a + function object. This is useful, for example, when one needs to + operate on each element of a sequence of variant objects using a + standard library algorithm such as + std::for_each.

    +

    See the "visitor-only" form of + apply_visitor for a simple + way to create apply_visitor_delayed_t objects.

    +

    See apply_visitor_delayed_t + which is used when Visitor has result_type + typedef.

    +

    Available only if macro + BOOST_VARIANT_DO_NOT_USE_VARIADIC_TEMPLATES is not defined and + compiler supports decltype(auto) and decltype(some-expression).

    +
    +

    +apply_visitor_delayed_cpp14_t + public + construct/copy/destruct

    +
    1. +
      explicit apply_visitor_delayed_cpp14_t(Visitor & visitor);
      +
      ++++ + + + + +

      Effects:

      		Constructs the function object with the given + visitor.
      +
    +
    +
    +

    +apply_visitor_delayed_cpp14_t function object interface

    +
    1. +
      template<typename ... Variant> decltype(auto) operator()(Variant&... operand);
      Function call operator.

      Invokes + apply_visitor on the + stored visitor using the given operands.

      +
    +
    +
    +
    + + + +
    Copyright © 2002, 2003 Eric Friedman, Itay Maman

    Distributed under the Boost Software License, Version 1.0. + (See accompanying file LICENSE_1_0.txt or copy at + http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/apply_vi_idm45507092235520.html b/doc/html/boost/apply_vi_idm45507092235520.html new file mode 100644 index 0000000000..9bc656a601 --- /dev/null +++ b/doc/html/boost/apply_vi_idm45507092235520.html @@ -0,0 +1,73 @@ + + + + +Function apply_visitor /*three or more variant parameters*/ + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function apply_visitor /*three or more variant parameters*/

    +

    boost::apply_visitor /*three or more variant parameters*/

    +
    +

    Synopsis

    +
    // In header: <boost/variant/multivisitors.hpp>
+
+
+template<typename MultiVisitor, typename Variant1, typename Variant2, 
+         typename Variant3> 
+  typename MultiVisitor::result_type OR decltype(auto) 
+  apply_visitor /*three or more variant parameters*/(MultiVisitor & visitor, 
+                                                     Variant1 & operand1, 
+                                                     Variant2 & operand2, 
+                                                     Variant3 & operand3, 
+                                                     ... other_operands);
+template<typename MultiVisitor, typename Variant1, typename Variant2, 
+         typename Variant3> 
+  typename MultiVisitor::result_type OR decltype(auto) 
+  apply_visitor /*three or more variant parameters*/(const MultiVisitor & visitor, 
+                                                     Variant1 & operand1, 
+                                                     Variant2 & operand2, 
+                                                     Variant3 & operand3, 
+                                                     ... other_operands);
    +
    +

    Description

    +

    Allows compile-time checked type-safe application of the + given visitor to the content of the given variant, ensuring that all + types are handled by the visitor. See apply_visitor + for more information.

    +
    +
    + + + +
    Copyright © 2002, 2003 Eric Friedman, Itay Maman

    Distributed under the Boost Software License, Version 1.0. + (See accompanying file LICENSE_1_0.txt or copy at + http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/apply_visitor.html b/doc/html/boost/apply_visitor.html index 3eafffa441..a3bb50cc3a 100644 --- a/doc/html/boost/apply_visitor.html +++ b/doc/html/boost/apply_visitor.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -62,9 +62,9 @@ template<typename Visitor> apply_visitor_delayed_t<Visitor> apply_visitor(Visitor & visitor); template<typename Visitor> - apply_visitor_delayed_cpp14_t<Visitor> apply_visitor(Visitor & visitor);
    + apply_visitor_delayed_cpp14_t<Visitor> apply_visitor(Visitor & visitor);
    -

    Description

    +

    Description

    The behavior of apply_visitor is dependent on the number of arguments on which it operates (i.e., other than the visitor). The function behaves as follows: @@ -88,7 +88,7 @@

  12. The overloads accepting only a visitor return a C++03 compatible generic function object or - C++14 compatible generic function object + C++14 compatible generic function object that accepts either one, two or arbitrary count of arguments and invoke apply_visitor using these arguments and visitor, thus behaving as @@ -141,7 +141,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/apply_visitor_delayed_t.html b/doc/html/boost/apply_visitor_delayed_t.html index 3c0105b839..0f343324ab 100644 --- a/doc/html/boost/apply_visitor_delayed_t.html +++ b/doc/html/boost/apply_visitor_delayed_t.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -39,16 +39,16 @@ typedef typename Visitor::result_type result_type; // construct/copy/destruct - explicit apply_visitor_delayed_t(Visitor &); + explicit apply_visitor_delayed_t(Visitor &); - // function object interface - template<typename ... Variant> result_type operator()(Variant&...); - template<typename Variant> result_type operator()(Variant &); + // function object interface + template<typename ... Variant> result_type operator()(Variant&...); + template<typename Variant> result_type operator()(Variant &); template<typename Variant1, typename Variant2> - result_type operator()(Variant1 &, Variant2 &); + result_type operator()(Variant1 &, Variant2 &); };
    -

    Description

    +

    Description

    Adapts the function given at construction for use as a function object. This is useful, for example, when one needs to operate on each element of a sequence of variant objects using a @@ -57,16 +57,16 @@

    See the "visitor-only" form of apply_visitor for a simple way to create apply_visitor_delayed_t objects.

    -

    See apply_visitor_delayed_cpp14_t +

    See apply_visitor_delayed_cpp14_t which is used on C++14 compatible compilers when Visitor has no result_type typedef.

    -

    +

    apply_visitor_delayed_t public construct/copy/destruct

    1. -
      explicit apply_visitor_delayed_t(Visitor & visitor);
      +
      explicit apply_visitor_delayed_t(Visitor & visitor);
      @@ -81,13 +81,13 @@
      -

      -apply_visitor_delayed_t function object interface

      +

      +apply_visitor_delayed_t function object interface

      1. -
        template<typename ... Variant> result_type operator()(Variant&... operand);
-template<typename Variant> result_type operator()(Variant & operand);
+
        template<typename ... Variant> result_type operator()(Variant&... operand);
+template<typename Variant> result_type operator()(Variant & operand);
 template<typename Variant1, typename Variant2> 
-  result_type operator()(Variant1 & operand1, Variant2 & operand2);
        Function call operator.
        Invokes
+  result_type operator()(Variant1 & operand1, Variant2 & operand2);
        Function call operator.

        Invokes apply_visitor on the stored visitor using the given operands.

      @@ -115,7 +115,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/apply_visitor_idp313712304.html b/doc/html/boost/apply_visitor_idp313712304.html deleted file mode 100644 index 71319fd477..0000000000 --- a/doc/html/boost/apply_visitor_idp313712304.html +++ /dev/null @@ -1,104 +0,0 @@ - - - - -Class template apply_visitor_delayed_cpp14_t - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Class template apply_visitor_delayed_cpp14_t

      -

      boost::apply_visitor_delayed_cpp14_t — Adapts a visitor for use as a function object.

      -
      -

      Synopsis

      -
      // In header: <boost/variant/apply_visitor.hpp>
-
-template<typename Visitor> 
-class apply_visitor_delayed_cpp14_t {
-public:
-  // construct/copy/destruct
-  explicit apply_visitor_delayed_cpp14_t(Visitor &);
-
-  // function object interface
-  template<typename ... Variant> decltype(auto) operator()(Variant&...);
-};
      -
      -

      Description

      -

      Adapts the function given at construction for use as a - function object. This is useful, for example, when one needs to - operate on each element of a sequence of variant objects using a - standard library algorithm such as - std::for_each.

      -

      See the "visitor-only" form of - apply_visitor for a simple - way to create apply_visitor_delayed_t objects.

      -

      See apply_visitor_delayed_t - which is used when Visitor has result_type - typedef.

      -

      Available only if macro - BOOST_VARIANT_DO_NOT_USE_VARIADIC_TEMPLATES is not defined and - compiler supports decltype(auto) and decltype(some-expression).

      -
      -

      -apply_visitor_delayed_cpp14_t - public - construct/copy/destruct

      -
      1. -
        explicit apply_visitor_delayed_cpp14_t(Visitor & visitor);
        -
        ---- - - - - -

        Effects:

        		Constructs the function object with the given - visitor.
        -
      -
      -
      -

      -apply_visitor_delayed_cpp14_t function object interface

      -
      1. -
        template<typename ... Variant> decltype(auto) operator()(Variant&... operand);
        Function call operator.

        Invokes - apply_visitor on the - stored visitor using the given operands.

        -
      -
      -
      -
      - - - -
      Copyright © 2002, 2003 Eric Friedman, Itay Maman

      Distributed under the Boost Software License, Version 1.0. - (See accompanying file LICENSE_1_0.txt or copy at - http://www.boost.org/LICENSE_1_0.txt) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/apply_visitor_idp353473104.html b/doc/html/boost/apply_visitor_idp353473104.html deleted file mode 100644 index 72963348e3..0000000000 --- a/doc/html/boost/apply_visitor_idp353473104.html +++ /dev/null @@ -1,73 +0,0 @@ - - - - -Function apply_visitor /*three or more variant parameters*/ - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Function apply_visitor /*three or more variant parameters*/

      -

      boost::apply_visitor /*three or more variant parameters*/

      -
      -

      Synopsis

      -
      // In header: <boost/variant/multivisitors.hpp>
-
-
-template<typename MultiVisitor, typename Variant1, typename Variant2, 
-         typename Variant3> 
-  typename MultiVisitor::result_type OR decltype(auto) 
-  apply_visitor /*three or more variant parameters*/(MultiVisitor & visitor, 
-                                                     Variant1 & operand1, 
-                                                     Variant2 & operand2, 
-                                                     Variant3 & operand3, 
-                                                     ... other_operands);
-template<typename MultiVisitor, typename Variant1, typename Variant2, 
-         typename Variant3> 
-  typename MultiVisitor::result_type OR decltype(auto) 
-  apply_visitor /*three or more variant parameters*/(const MultiVisitor & visitor, 
-                                                     Variant1 & operand1, 
-                                                     Variant2 & operand2, 
-                                                     Variant3 & operand3, 
-                                                     ... other_operands);
      -
      -

      Description

      -

      Allows compile-time checked type-safe application of the - given visitor to the content of the given variant, ensuring that all - types are handled by the visitor. See apply_visitor - for more information.

      -
      -
      - - - -
      Copyright © 2002, 2003 Eric Friedman, Itay Maman

      Distributed under the Boost Software License, Version 1.0. - (See accompanying file LICENSE_1_0.txt or copy at - http://www.boost.org/LICENSE_1_0.txt) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/array.html b/doc/html/boost/array.html index 4598f8cb3c..07940194f7 100644 --- a/doc/html/boost/array.html +++ b/doc/html/boost/array.html @@ -50,70 +50,70 @@ static const size_type static_size = N; // construct/copy/destruct - template<typename U> array& operator=(const array<U, N>&); + template<typename U> array& operator=(const array<U, N>&); - // iterator support - iterator begin(); - const_iterator begin() const; - iterator end(); - const_iterator end() const; + // iterator support + iterator begin(); + const_iterator begin() const; + iterator end(); + const_iterator end() const; - // reverse iterator support - reverse_iterator rbegin(); - const_reverse_iterator rbegin() const; - reverse_iterator rend(); - const_reverse_iterator rend() const; + // reverse iterator support + reverse_iterator rbegin(); + const_reverse_iterator rbegin() const; + reverse_iterator rend(); + const_reverse_iterator rend() const; - // capacity - size_type size(); - bool empty(); - size_type max_size(); + // capacity + size_type size(); + bool empty(); + size_type max_size(); - // element access - reference operator[](size_type); - const_reference operator[](size_type) const; - reference at(size_type); - const_reference at(size_type) const; - reference front(); - const_reference front() const; - reference back(); - const_reference back() const; - const T* data() const; - T* c_array(); + // element access + reference operator[](size_type); + const_reference operator[](size_type) const; + reference at(size_type); + const_reference at(size_type) const; + reference front(); + const_reference front() const; + reference back(); + const_reference back() const; + const T* data() const; + T* c_array(); - // modifiers - void swap(array<T, N>&); - void assign(const T&); + // modifiers + void swap(array<T, N>&); + void assign(const T&); // public data members T elems[N]; }; -// specialized algorithms -template<typename T, std::size_t N> void swap(array<T, N>&, array<T, N>&); +// specialized algorithms +template<typename T, std::size_t N> void swap(array<T, N>&, array<T, N>&); -// comparisons +// comparisons template<typename T, std::size_t N> - bool operator==(const array<T, N>&, const array<T, N>&); + bool operator==(const array<T, N>&, const array<T, N>&); template<typename T, std::size_t N> - bool operator!=(const array<T, N>&, const array<T, N>&); + bool operator!=(const array<T, N>&, const array<T, N>&); template<typename T, std::size_t N> - bool operator<(const array<T, N>&, const array<T, N>&); + bool operator<(const array<T, N>&, const array<T, N>&); template<typename T, std::size_t N> - bool operator>(const array<T, N>&, const array<T, N>&); + bool operator>(const array<T, N>&, const array<T, N>&); template<typename T, std::size_t N> - bool operator<=(const array<T, N>&, const array<T, N>&); + bool operator<=(const array<T, N>&, const array<T, N>&); template<typename T, std::size_t N> - bool operator>=(const array<T, N>&, const array<T, N>&);
      + bool operator>=(const array<T, N>&, const array<T, N>&);
    -

    Description

    +

    Description

    -

    +

    array public construct/copy/destruct

    1. -
      template<typename U> array& operator=(const array<U, N>& other);
      +
      template<typename U> array& operator=(const array<U, N>& other);
      @@ -121,18 +121,18 @@ - +

      Effects:

      		std::copy(rhs.begin(),rhs.end(), begin())std::copy(rhs.begin(),rhs.end(), begin())
    -

    -array iterator support

    +

    +array iterator support

    1. -
      iterator begin();
-const_iterator begin() const;
      +
      iterator begin();
+const_iterator begin() const;
      @@ -151,8 +151,8 @@
    2. -
      iterator end();
-const_iterator end() const;
      +
      iterator end();
+const_iterator end() const;
      @@ -173,12 +173,12 @@
      -

      -array reverse iterator support

      +

      +array reverse iterator support

      1. -
        reverse_iterator rbegin();
-const_reverse_iterator rbegin() const;
        +
        reverse_iterator rbegin();
+const_reverse_iterator rbegin() const;
      @@ -191,8 +191,8 @@
    3. -
      reverse_iterator rend();
-const_reverse_iterator rend() const;
      +
      reverse_iterator rend();
+const_reverse_iterator rend() const;
      @@ -207,11 +207,11 @@
      -

      -array capacity

      +

      +array capacity

      1. -
        size_type size();
        +
        size_type size();
      @@ -224,7 +224,7 @@
    4. -
      bool empty();
      +
      bool empty();
      @@ -243,7 +243,7 @@
    5. -
      size_type max_size();
      +
      size_type max_size();
      @@ -264,12 +264,12 @@
      -

      -array element access

      +

      +array element access

      1. -
        reference operator[](size_type i);
-const_reference operator[](size_type i) const;
        +
        reference operator[](size_type i);
+const_reference operator[](size_type i) const;
      @@ -293,8 +293,8 @@
    6. -
      reference at(size_type i);
-const_reference at(size_type i) const;
      +
      reference at(size_type i);
+const_reference at(size_type i) const;
      @@ -316,8 +316,8 @@
    7. -
      reference front();
-const_reference front() const;
      +
      reference front();
+const_reference front() const;
      @@ -340,8 +340,8 @@
    8. -
      reference back();
-const_reference back() const;
      +
      reference back();
+const_reference back() const;
      @@ -364,7 +364,7 @@
    9. -
      const T* data() const;
      +
      const T* data() const;
      @@ -383,7 +383,7 @@
    10. -
      T* c_array();
      +
      T* c_array();
      @@ -404,11 +404,11 @@
      -

      -array modifiers

      +

      +array modifiers

      1. -
        void swap(array<T, N>& other);
        +
        void swap(array<T, N>& other);
      @@ -417,7 +417,7 @@ - + @@ -428,7 +428,7 @@

      Effects:

      		std::swap_ranges(begin(), end(), other.begin())std::swap_ranges(begin(), end(), other.begin())

      Complexity:

    11. -
      void assign(const T& value);
      +
      void assign(const T& value);
      @@ -436,17 +436,17 @@ - +

      Effects:

      		std::fill_n(begin(), N, value)std::fill_n(begin(), N, value)
    -

    -array specialized algorithms

    +

    +array specialized algorithms

    1. -
      template<typename T, std::size_t N> void swap(array<T, N>& x, array<T, N>& y);
      +
      template<typename T, std::size_t N> void swap(array<T, N>& x, array<T, N>& y);
      @@ -455,7 +455,7 @@ - + @@ -466,12 +466,12 @@
      -

      -array comparisons

      +

      +array comparisons

      1. template<typename T, std::size_t N> 
-  bool operator==(const array<T, N>& x, const array<T, N>& y);
        + bool operator==(const array<T, N>& x, const array<T, N>& y);

      Effects:

      		x.swap(y)x.swap(y)

      Throws:
      @@ -479,13 +479,13 @@ - +

      Returns:

      		std::equal(x.begin(), x.end(), y.begin())std::equal(x.begin(), x.end(), y.begin()) 
    2. template<typename T, std::size_t N> 
-  bool operator!=(const array<T, N>& x, const array<T, N>& y);
      + bool operator!=(const array<T, N>& x, const array<T, N>& y);
      @@ -499,7 +499,7 @@ 
    3. template<typename T, std::size_t N> 
-  bool operator<(const array<T, N>& x, const array<T, N>& y);
      + bool operator<(const array<T, N>& x, const array<T, N>& y);
      4. @@ -507,13 +507,13 @@ - +

      Returns:

      		std::lexicographical_compare(x.begin(), x.end(), y.begin(), y.end())std::lexicographical_compare(x.begin(), x.end(), y.begin(), y.end()) 
    4. template<typename T, std::size_t N> 
-  bool operator>(const array<T, N>& x, const array<T, N>& y);
      + bool operator>(const array<T, N>& x, const array<T, N>& y);
      @@ -527,7 +527,7 @@ 
    5. template<typename T, std::size_t N> 
-  bool operator<=(const array<T, N>& x, const array<T, N>& y);
      + bool operator<=(const array<T, N>& x, const array<T, N>& y);
      6. @@ -541,7 +541,7 @@ 
    6. template<typename T, std::size_t N> 
-  bool operator>=(const array<T, N>& x, const array<T, N>& y);
      + bool operator>=(const array<T, N>& x, const array<T, N>& y);
      7. diff --git a/doc/html/boost/back_move_insert_iterator.html b/doc/html/boost/back_move_insert_iterator.html index 516fe9bbd7..32c654ab37 100644 --- a/doc/html/boost/back_move_insert_iterator.html +++ b/doc/html/boost/back_move_insert_iterator.html @@ -44,36 +44,36 @@ typedefstd::output_iterator_tagiterator_category;// construct/copy/destruct - explicitback_move_insert_iterator(C&); - back_move_insert_iterator&operator=(reference); - back_move_insert_iterator&operator=(value_type&&); + explicitback_move_insert_iterator(C&); + back_move_insert_iterator&operator=(reference); + back_move_insert_iterator&operator=(value_type&&); - // public member functions - back_move_insert_iterator&operator*(); - back_move_insert_iterator&operator++(); - back_move_insert_iterator&operator++(int); + // public member functions + back_move_insert_iterator&operator*(); + back_move_insert_iterator&operator++(); + back_move_insert_iterator&operator++(int);};
      -

      Description

      +

      Description

      A move insert iterator that move constructs elements at the back of a container

      -

      +

      back_move_insert_iterator public construct/copy/destruct

        -
      1. explicit back_move_insert_iterator(C & x);
        2. -
      2. back_move_insert_iterator & operator=(reference x);
        3. -
      3. back_move_insert_iterator & operator=(value_type && x);
        4. +
      4. explicit back_move_insert_iterator(C & x);
        5. +
      5. back_move_insert_iterator & operator=(reference x);
        6. +
      6. back_move_insert_iterator & operator=(value_type && x);
      -

      -back_move_insert_iterator public member functions

      +

      +back_move_insert_iterator public member functions

        -
      1. back_move_insert_iterator & operator*();
        2. -
      2. back_move_insert_iterator & operator++();
        3. -
      3. back_move_insert_iterator & operator++(int);
        4. +
      4. back_move_insert_iterator & operator*();
        5. +
      5. back_move_insert_iterator & operator++();
        6. +
      6. back_move_insert_iterator & operator++(int);
      diff --git a/doc/html/boost/back_move_inserter.html b/doc/html/boost/back_move_inserter.html index bd250a70e4..781fe2be28 100644 --- a/doc/html/boost/back_move_inserter.html +++ b/doc/html/boost/back_move_inserter.html @@ -35,7 +35,7 @@ template<typename C>back_move_insert_iterator<C>back_move_inserter(C& x);
      -

      Description

      +

      Description

      Returns: back_move_insert_iterator<C>(x).

      diff --git a/doc/html/boost/bad_any_cast.html b/doc/html/boost/bad_any_cast.html index 81a8e6b09b..5bd8b7d75a 100644 --- a/doc/html/boost/bad_any_cast.html +++ b/doc/html/boost/bad_any_cast.html @@ -28,7 +28,7 @@

      Class bad_any_cast

      boost::bad_any_cast — The exception thrown in the event of a failed - any_cast of an + any_cast of an any value.

      Synopsis

      @@ -37,11 +37,11 @@ classbad_any_cast:public std::bad_cast {public: - virtualconstchar*what()const; + virtualconstchar*what()const;};
      -

      Description

      -
      virtual const char * what() const;
      +

      Description

      +
      virtual const char * what() const;
      diff --git a/doc/html/boost/bad_function_call.html b/doc/html/boost/bad_function_call.html index 760c68e6f9..6b62fb46e9 100644 --- a/doc/html/boost/bad_function_call.html +++ b/doc/html/boost/bad_function_call.html @@ -36,17 +36,17 @@ classbad_function_call:public std::runtime_error {public:// construct/copy/destruct - bad_function_call(); + bad_function_call();};
      -

      Description

      +

      Description

      -

      +

      bad_function_call public construct/copy/destruct

      1. -
        bad_function_call();
        +
        bad_function_call();
      diff --git a/doc/html/boost/bad_get.html b/doc/html/boost/bad_get.html index 469c9a31f2..cd42b1144f 100644 --- a/doc/html/boost/bad_get.html +++ b/doc/html/boost/bad_get.html @@ -7,7 +7,7 @@ - + @@ -21,14 +21,14 @@
      -PrevUpHomeNext +PrevUpHomeNext

      Class bad_get

      boost::bad_get — The exception thrown in the event of a failed application of - boost::get on the given + boost::get on the given operand value.

      Synopsis

      @@ -37,11 +37,11 @@ class bad_get : public std::exception { public: - virtual const char * what() const; + virtual const char * what() const; };
      -

      Description

      -
      virtual const	char * what() const;
      +

      Description

      +
      virtual const	char * what() const;
      @@ -54,7 +54,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/bad_polymorphic_get.html b/doc/html/boost/bad_polymorphic_get.html index 472698f9f7..dfb7120bc5 100644 --- a/doc/html/boost/bad_polymorphic_get.html +++ b/doc/html/boost/bad_polymorphic_get.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      @@ -37,11 +37,11 @@ class bad_polymorphic_get : public boost::bad_get { public: - virtual const char * what() const; + virtual const char * what() const; };
      -

      Description

      -
      virtual const	char * what() const;
      +

      Description

      +
      virtual const	char * what() const;
    @@ -54,7 +54,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/bad_visit.html b/doc/html/boost/bad_visit.html index 2c80e7a5bd..939e62bb0d 100644 --- a/doc/html/boost/bad_visit.html +++ b/doc/html/boost/bad_visit.html @@ -36,11 +36,11 @@ class bad_visit : public std::exception { public: - virtual const char * what() const; + virtual const char * what() const; };
    -

    Description

    -
    virtual const char * what() const;
    +

    Description

    +
    virtual const char * what() const;
    diff --git a/doc/html/boost/circular_buffe_idp24914528.html b/doc/html/boost/circular_buffe_idp24914528.html deleted file mode 100644 index 01f8a91f06..0000000000 --- a/doc/html/boost/circular_buffe_idp24914528.html +++ /dev/null @@ -1,2828 +0,0 @@ - - - - -Class template circular_buffer_space_optimized - - - - - - - - -
    - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Class template circular_buffer_space_optimized

    -

    boost::circular_buffer_space_optimized — Space optimized circular buffer container adaptor. T must be a copyable class or must have an noexcept move constructor and move assignment operator.

    -
    -

    Synopsis

    -
    // In header: <boost/circular_buffer/space_optimized.hpp>
-
-template<typename T, typename Alloc> 
-class circular_buffer_space_optimized :
-  private boost::circular_buffer< T, Alloc >
-{
-public:
-  // types
-  typedef circular_buffer< T, Alloc >::value_type             value_type;            
-  typedef circular_buffer< T, Alloc >::pointer                pointer;               
-  typedef circular_buffer< T, Alloc >::const_pointer          const_pointer;         
-  typedef circular_buffer< T, Alloc >::reference              reference;             
-  typedef circular_buffer< T, Alloc >::const_reference        const_reference;       
-  typedef circular_buffer< T, Alloc >::size_type              size_type;             
-  typedef circular_buffer< T, Alloc >::difference_type        difference_type;       
-  typedef circular_buffer< T, Alloc >::allocator_type         allocator_type;        
-  typedef circular_buffer< T, Alloc >::const_iterator         const_iterator;        
-  typedef circular_buffer< T, Alloc >::iterator               iterator;              
-  typedef circular_buffer< T, Alloc >::const_reverse_iterator const_reverse_iterator;
-  typedef circular_buffer< T, Alloc >::reverse_iterator       reverse_iterator;      
-  typedef circular_buffer< T, Alloc >::array_range            array_range;           
-  typedef circular_buffer< T, Alloc >::const_array_range      const_array_range;     
-  typedef circular_buffer< T, Alloc >::param_value_type       param_value_type;      
-  typedef circular_buffer< T, Alloc >::rvalue_type            rvalue_type;           
-  typedef cb_details::capacity_control< size_type >           capacity_type;         
-
-  // construct/copy/destruct
-  explicit circular_buffer_space_optimized(const allocator_type & = allocator_type()) noexcept;
-  explicit circular_buffer_space_optimized(capacity_type, 
-                                           const allocator_type & = allocator_type());
-  circular_buffer_space_optimized(capacity_type, param_value_type, 
-                                  const allocator_type & = allocator_type());
-  circular_buffer_space_optimized(capacity_type, size_type, param_value_type, 
-                                  const allocator_type & = allocator_type());
-  circular_buffer_space_optimized(const circular_buffer_space_optimized< T, Alloc > &);
-  circular_buffer_space_optimized(circular_buffer_space_optimized< T, Alloc > &&) noexcept;
-  template<typename InputIterator> 
-    circular_buffer_space_optimized(InputIterator, InputIterator, 
-                                    const allocator_type & = allocator_type());
-  template<typename InputIterator> 
-    circular_buffer_space_optimized(capacity_type, InputIterator, 
-                                    InputIterator, 
-                                    const allocator_type & = allocator_type());
-  circular_buffer_space_optimized< T, Alloc > & 
-  operator=(const circular_buffer_space_optimized< T, Alloc > &);
-  circular_buffer_space_optimized< T, Alloc > & 
-  operator=(circular_buffer_space_optimized< T, Alloc > &&) noexcept;
-
-  // public member functions
-  bool full() const noexcept;
-  size_type reserve() const noexcept;
-  const capacity_type & capacity() const noexcept;
-  void set_capacity(const capacity_type &);
-  void resize(size_type, param_value_type = value_type());
-  void rset_capacity(const capacity_type &);
-  void rresize(size_type, param_value_type = value_type());
-  void assign(size_type, param_value_type);
-  void assign(capacity_type, size_type, param_value_type);
-  template<typename InputIterator> void assign(InputIterator, InputIterator);
-  template<typename InputIterator> 
-    void assign(capacity_type, InputIterator, InputIterator);
-  void swap(circular_buffer_space_optimized< T, Alloc > &) noexcept;
-  void push_back(param_value_type);
-  void push_back(rvalue_type);
-  void push_back();
-  void push_front(param_value_type);
-  void push_front(rvalue_type);
-  void push_front();
-  void pop_back();
-  void pop_front();
-  iterator insert(iterator, param_value_type);
-  iterator insert(iterator, rvalue_type);
-  iterator insert(iterator);
-  void insert(iterator, size_type, param_value_type);
-  template<typename InputIterator> 
-    void insert(iterator, InputIterator, InputIterator);
-  iterator rinsert(iterator, param_value_type);
-  iterator rinsert(iterator, rvalue_type);
-  iterator rinsert(iterator);
-  void rinsert(iterator, size_type, param_value_type);
-  template<typename InputIterator> 
-    void rinsert(iterator, InputIterator, InputIterator);
-  iterator erase(iterator);
-  iterator erase(iterator, iterator);
-  iterator rerase(iterator);
-  iterator rerase(iterator, iterator);
-  void clear();
-
-  // private member functions
-  void adjust_min_capacity();
-  size_type ensure_reserve(size_type, size_type) const;
-  void check_low_capacity(size_type = 1);
-  void check_high_capacity();
-  void reduce_capacity(const true_type &);
-  void reduce_capacity(const false_type &);
-  template<typename IntegralType> 
-    void insert(const iterator &, IntegralType, IntegralType, 
-                const true_type &);
-  template<typename Iterator> 
-    void insert(const iterator &, Iterator, Iterator, const false_type &);
-  template<typename IntegralType> 
-    void rinsert(const iterator &, IntegralType, IntegralType, 
-                 const true_type &);
-  template<typename Iterator> 
-    void rinsert(const iterator &, Iterator, Iterator, const false_type &);
-
-  // private static functions
-  static size_type init_capacity(const capacity_type &, size_type);
-  template<typename IntegralType> 
-    static size_type 
-    init_capacity(const capacity_type &, IntegralType, IntegralType, 
-                  const true_type &);
-  template<typename Iterator> 
-    static size_type 
-    init_capacity(const capacity_type &, Iterator, Iterator, 
-                  const false_type &);
-  template<typename InputIterator> 
-    static size_type 
-    init_capacity(const capacity_type &, InputIterator, InputIterator, 
-                  const std::input_iterator_tag &);
-  template<typename ForwardIterator> 
-    static size_type 
-    init_capacity(const capacity_type &, ForwardIterator, ForwardIterator, 
-                  const std::forward_iterator_tag &);
-};
    -
    -

    Description

    -
    -

    -circular_buffer_space_optimized - public - types

    -
    1. -

      -typedef cb_details::capacity_control< size_type > capacity_type;

      -

      Capacity controller of the space optimized circular buffer.

      -

      See Also:

      -

      capacity_control in details.hpp.

      -

      - class capacity_control
      - {
      - size_type m_capacity; // Available capacity.
      - size_type m_min_capacity; // Minimum capacity.
      - public:
      - capacity_control(size_type capacity, size_type min_capacity = 0)
      - : m_capacity(capacity), m_min_capacity(min_capacity)
      - {};
      - size_type capacity() const { return m_capacity; }
      - size_type min_capacity() const { return m_min_capacity; }
      - operator size_type() const { return m_capacity; }
      - };
      -

      -

      Always capacity >= min_capacity.

      -

      The capacity() represents the capacity of the circular_buffer_space_optimized and the min_capacity() determines the minimal allocated size of its internal buffer.

      -

      The converting constructor of the capacity_control allows implicit conversion from size_type-like types which ensures compatibility of creating an instance of the circular_buffer_space_optimized with other STL containers.

      -

      On the other hand the operator size_type() provides implicit conversion to the size_type which allows to treat the capacity of the circular_buffer_space_optimized the same way as in the circular_buffer.

      -
    -
    -
    -

    -circular_buffer_space_optimized - public - construct/copy/destruct

    -
      -
    1. -
      explicit circular_buffer_space_optimized(const allocator_type & alloc = allocator_type()) noexcept;
      Create an empty space optimized circular buffer with zero capacity.

      - - -

      -

      Complexity. Constant.

      -

      -

      -
      - - - - - -
      [Warning]Warning

      Since Boost version 1.36 the behaviour of this constructor has changed. Now it creates a space optimized circular buffer with zero capacity.

      -

      -

      -
      ---- - - - - - - - - - - - - - - -

      Parameters:

      ---- - - - - -

      alloc

      The allocator.

      Postconditions:

      capacity().capacity() == 0 && capacity().min_capacity() == 0 && size() == 0

      Throws:

      		Nothing.
      -
      2. -
    2. -
      explicit circular_buffer_space_optimized(capacity_type capacity_ctrl, 
-                                         const allocator_type & alloc = allocator_type());
      Create an empty space optimized circular buffer with the specified capacity.

      - - -

      -

      Complexity. Constant.

      -

      -

      -
      ---- - - - - - - - - - - - - - - -

      Parameters:

      ---- - - - - - - - - - - -

      alloc

      The allocator.

      capacity_ctrl

      The capacity controller representing the maximum number of elements which can be stored in the circular_buffer_space_optimized and the minimal allocated size of the internal buffer.

      Postconditions:

      capacity() == capacity_ctrl && size() == 0
      -
      - The amount of allocated memory in the internal buffer is capacity_ctrl.min_capacity().

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used).
      -
      3. -
    3. -
      circular_buffer_space_optimized(capacity_type capacity_ctrl, 
-                                param_value_type item, 
-                                const allocator_type & alloc = allocator_type());
      Create a full space optimized circular buffer with the specified capacity filled with capacity_ctrl.capacity() copies of item.

      - - -

      -

      Complexity. Linear (in the capacity_ctrl.capacity()).

      -

      -

      -
      ---- - - - - - - - - - - - - - - -

      Parameters:

      ---- - - - - - - - - - - - - - - -

      alloc

      The allocator.

      capacity_ctrl

      The capacity controller representing the maximum number of elements which can be stored in the circular_buffer_space_optimized and the minimal allocated size of the internal buffer.

      item

      The element the created circular_buffer_space_optimized will be filled with.

      Postconditions:

      capacity() == capacity_ctrl && full() && (*this)[0] == item && (*this)[1] == item && ... && (*this) [capacity_ctrl.capacity() - 1] == item
      -
      - The amount of allocated memory in the internal buffer is capacity_ctrl.capacity().

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). T::T(const T&) throws.
      -
      4. -
    4. -
      circular_buffer_space_optimized(capacity_type capacity_ctrl, size_type n, 
-                                param_value_type item, 
-                                const allocator_type & alloc = allocator_type());
      Create a space optimized circular buffer with the specified capacity filled with n copies of item.

      - - - -

      -

      Complexity. Linear (in the n).

      -

      -

      -
      ---- - - - - - - - - - - - - - - - - - - -

      Parameters:

      ---- - - - - - - - - - - - - - - - - - - -

      alloc

      The allocator.

      capacity_ctrl

      The capacity controller representing the maximum number of elements which can be stored in the circular_buffer_space_optimized and the minimal allocated size of the internal buffer.

      item

      The element the created circular_buffer_space_optimized will be filled with.

      n

      The number of elements the created circular_buffer_space_optimized will be filled with.

      Requires:

      capacity_ctrl.capacity() >= n

      Postconditions:

      capacity() == capacity_ctrl && size() == n && (*this)[0] == item && (*this)[1] == item && ... && (*this)[n - 1] == item
      -
      - The amount of allocated memory in the internal buffer is max[n, capacity_ctrl.min_capacity()].

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws.
      -
      5. -
    5. -
      circular_buffer_space_optimized(const circular_buffer_space_optimized< T, Alloc > & cb);
      The copy constructor.

      Creates a copy of the specified circular_buffer_space_optimized. - - -

      -

      Complexity. Linear (in the size of cb).

      -

      -

      -
      ---- - - - - - - - - - - - - - - -

      Parameters:

      ---- - - - - -

      cb

      The circular_buffer_space_optimized to be copied.

      Postconditions:

      *this == cb
      -
      - The amount of allocated memory in the internal buffer is cb.size().

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws.
      -
      6. -
    6. -
      circular_buffer_space_optimized(circular_buffer_space_optimized< T, Alloc > && cb) noexcept;
      The move constructor.

      Move constructs a circular_buffer_space_optimized from cb, leaving cb empty. - - - -

      -

      Constant. 

      -

      -

      -
      ---- - - - - - - - - - - - - - - - - - - -

      Parameters:

      ---- - - - - -

      cb

      circular_buffer to 'steal' value from.

      Requires:

      C++ compiler with rvalue references support.

      Postconditions:

      cb.empty()

      Throws:

      		Nothing.
      -
      7. -
    7. -
      template<typename InputIterator> 
-  circular_buffer_space_optimized(InputIterator first, InputIterator last, 
-                                  const allocator_type & alloc = allocator_type());
      Create a full space optimized circular buffer filled with a copy of the range.

      - - - -

      -

      Complexity. Linear (in the std::distance(first, last)).

      -

      -

      -
      ---- - - - - - - - - - - - - - - - - - - -

      Parameters:

      ---- - - - - - - - - - - - - - - -

      alloc

      The allocator.

      first

      The beginning of the range to be copied.

      last

      The end of the range to be copied.

      Requires:

      Valid range [first, last).
      - first and last have to meet the requirements of InputIterator.

      Postconditions:

      capacity().capacity() == std::distance(first, last) && capacity().min_capacity() == 0 && full() && (*this)[0]== *first && (*this)[1] == *(first + 1) && ... && (*this)[std::distance(first, last) - 1] == *(last - 1)
      -
      - The amount of allocated memory in the internal buffer is std::distance(first, last).

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept and InputIterator is a move iterator.
      -
      8. -
    8. -
      template<typename InputIterator> 
-  circular_buffer_space_optimized(capacity_type capacity_ctrl, 
-                                  InputIterator first, InputIterator last, 
-                                  const allocator_type & alloc = allocator_type());
      Create a space optimized circular buffer with the specified capacity (and the minimal guaranteed amount of allocated memory) filled with a copy of the range.

      - - - -

      -

      Complexity. Linear (in std::distance(first, last); in min[capacity_ctrl.capacity(), std::distance(first, last)] if the InputIterator is a RandomAccessIterator).

      -

      -

      -
      ---- - - - - - - - - - - - - - - - - - - -

      Parameters:

      ---- - - - - - - - - - - - - - - - - - - -

      alloc

      The allocator.

      capacity_ctrl

      The capacity controller representing the maximum number of elements which can be stored in the circular_buffer_space_optimized and the minimal allocated size of the internal buffer.

      first

      The beginning of the range to be copied.

      last

      The end of the range to be copied.

      Requires:

      Valid range [first, last).
      - first and last have to meet the requirements of InputIterator.

      Postconditions:

      capacity() == capacity_ctrl && size() <= std::distance(first, last) && (*this)[0]== (last - capacity_ctrl.capacity()) && (*this)[1] == *(last - capacity_ctrl.capacity() + 1) && ... && (*this)[capacity_ctrl.capacity() - 1] == *(last - 1)
      -
      - If the number of items to be copied from the range [first, last) is greater than the specified capacity_ctrl.capacity() then only elements from the range [last - capacity_ctrl.capacity(), last) will be copied.
      -
      - The amount of allocated memory in the internal buffer is max[capacity_ctrl.min_capacity(), min[capacity_ctrl.capacity(), std::distance(first, last)]].

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws.
      -
      9. -
    9. -
      circular_buffer_space_optimized< T, Alloc > & 
-operator=(const circular_buffer_space_optimized< T, Alloc > & cb);
      The assign operator.

      Makes this circular_buffer_space_optimized to become a copy of the specified circular_buffer_space_optimized. - - -

      -

      Exception Safety. Strong.

      -

      -

      -

      Iterator Invalidation. Invalidates all iterators pointing to this circular_buffer_space_optimized (except iterators equal to end()).

      -

      -

      -

      Complexity. Linear (in the size of cb).

      -

      -

      -

      See Also:

      -

      assign(size_type, const_reference), assign(capacity_type, size_type, const_reference), assign(InputIterator, InputIterator), assign(capacity_type, InputIterator, InputIterator)

      -

      -

      -
      ---- - - - - - - - - - - - - - - -

      Parameters:

      ---- - - - - -

      cb

      The circular_buffer_space_optimized to be copied.

      Postconditions:

      *this == cb
      -
      - The amount of allocated memory in the internal buffer is cb.size().

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). T::T(const T&) throws.
      -
      10. -
    10. -
      circular_buffer_space_optimized< T, Alloc > & 
-operator=(circular_buffer_space_optimized< T, Alloc > && cb) noexcept;
      Move assigns content of cb to *this, leaving cb empty.

      - - - -

      -

      Complexity. Constant.

      -

      -

      -
      ---- - - - - - - - - - - - - - - - - - - -

      Parameters:

      ---- - - - - -

      cb

      circular_buffer to 'steal' value from.

      Requires:

      C++ compiler with rvalue references support.

      Postconditions:

      cb.empty()

      Throws:

      		Nothing.
      -
      11. -
    -
    -
    -

    -circular_buffer_space_optimized public member functions

    -
      -
    1. -
      bool full() const noexcept;
      Is the circular_buffer_space_optimized full?

      - -

      -

      Exception Safety. No-throw.

      -

      -

      -

      Iterator Invalidation. Does not invalidate any iterators.

      -

      -

      -

      Complexity. Constant (in the size of the circular_buffer_space_optimized).

      -

      -

      -

      See Also:

      -

      empty()

      -

      -

      -
      ---- - - - - - - - - - - -

      Returns:

      true if the number of elements stored in the circular_buffer_space_optimized equals the capacity of the circular_buffer_space_optimized; false otherwise.

      Throws:

      		Nothing.
      -
      2. -
    2. -
      size_type reserve() const noexcept;
      Get the maximum number of elements which can be inserted into the circular_buffer_space_optimized without overwriting any of already stored elements.

      - -

      -

      Exception Safety. No-throw.

      -

      -

      -

      Iterator Invalidation. Does not invalidate any iterators.

      -

      -

      -

      Complexity. Constant (in the size of the circular_buffer_space_optimized).

      -

      -

      -

      See Also:

      -

      capacity(), size(), max_size()

      -

      -

      -
      ---- - - - - - - - - - - -

      Returns:

      capacity().capacity() - size()

      Throws:

      		Nothing.
      -
      3. -
    3. -
      const capacity_type & capacity() const noexcept;
      Get the capacity of the circular_buffer_space_optimized.

      - -

      -

      Exception Safety. No-throw.

      -

      -

      -

      Iterator Invalidation. Does not invalidate any iterators.

      -

      -

      -

      Complexity. Constant (in the size of the circular_buffer_space_optimized).

      -

      -

      -

      See Also:

      -

      reserve(), size(), max_size(), set_capacity(const capacity_type&)

      -

      -

      -
      ---- - - - - - - - - - - -

      Returns:

      The capacity controller representing the maximum number of elements which can be stored in the circular_buffer_space_optimized and the minimal allocated size of the internal buffer.

      Throws:

      		Nothing.
      -
      4. -
    4. -
      void set_capacity(const capacity_type & capacity_ctrl);
      Change the capacity (and the minimal guaranteed amount of allocated memory) of the circular_buffer_space_optimized.

      - - -

      -

      Exception Safety. Strong.

      -

      -

      -

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      -

      -

      -

      Complexity. Linear (in min[size(), capacity_ctrl.capacity()]).

      -

      -

      -
      - - - - - -
      [Note]Note

      To explicitly clear the extra allocated memory use the shrink-to-fit technique:
      -
      - boost::circular_buffer_space_optimized<int> cb(1000);
      - ...
      - boost::circular_buffer_space_optimized<int>(cb).swap(cb);
      -
      - For more information about the shrink-to-fit technique in STL see http://www.gotw.ca/gotw/054.htm.

      -

      -

      -

      See Also:

      -

      rset_capacity(const capacity_type&), resize(size_type, const_reference)

      -

      -

      -
      ---- - - - - - - - - - - - - - - -

      Parameters:

      ---- - - - - -

      capacity_ctrl

      The new capacity controller.

      Postconditions:

      capacity() == capacity_ctrl && size() <= capacity_ctrl.capacity()
      -
      - If the current number of elements stored in the circular_buffer_space_optimized is greater than the desired new capacity then number of [size() - capacity_ctrl.capacity()] last elements will be removed and the new size will be equal to capacity_ctrl.capacity().
      -
      - If the current number of elements stored in the circular_buffer_space_optimized is lower than the new capacity then the amount of allocated memory in the internal buffer may be accommodated as necessary but it will never drop below capacity_ctrl.min_capacity().

      Throws:

      		An allocation error if memory is exhausted, (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept.
      -
      5. -
    5. -
      void resize(size_type new_size, param_value_type item = value_type());
      Change the size of the circular_buffer_space_optimized.

      - - -

      -

      Exception Safety. Basic.

      -

      -

      -

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      -

      -

      -

      Complexity. Linear (in the new size of the circular_buffer_space_optimized).

      -

      -

      -

      See Also:

      -

      rresize(size_type, const_reference), set_capacity(const capacity_type&)

      -

      -

      -
      ---- - - - - - - - - - - - - - - -

      Parameters:

      ---- - - - - - - - - - - -

      item

      The element the circular_buffer_space_optimized will be filled with in order to gain the requested size. (See the Effect.)

      new_size

      The new size.

      Postconditions:

      size() == new_size && capacity().capacity() >= new_size
      -
      - If the new size is greater than the current size, copies of item will be inserted at the back of the of the circular_buffer_space_optimized in order to achieve the desired size. In the case the resulting size exceeds the current capacity the capacity will be set to new_size.
      -
      - If the current number of elements stored in the circular_buffer_space_optimized is greater than the desired new size then number of [size() - new_size] last elements will be removed. (The capacity will remain unchanged.)
      -
      - The amount of allocated memory in the internal buffer may be accommodated as necessary.

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws.
      -
      6. -
    6. -
      void rset_capacity(const capacity_type & capacity_ctrl);
      Change the capacity (and the minimal guaranteed amount of allocated memory) of the circular_buffer_space_optimized.

      - - -

      -

      Exception Safety. Strong.

      -

      -

      -

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      -

      -

      -

      Complexity. Linear (in min[size(), capacity_ctrl.capacity()]).

      -

      -

      -

      See Also:

      -

      set_capacity(const capacity_type&), rresize(size_type, const_reference)

      -

      -

      -
      ---- - - - - - - - - - - - - - - -

      Parameters:

      ---- - - - - -

      capacity_ctrl

      The new capacity controller.

      Postconditions:

      capacity() == capacity_ctrl && size() <= capacity_ctrl
      -
      - If the current number of elements stored in the circular_buffer_space_optimized is greater than the desired new capacity then number of [size() - capacity_ctrl.capacity()] first elements will be removed and the new size will be equal to capacity_ctrl.capacity().
      -
      - If the current number of elements stored in the circular_buffer_space_optimized is lower than the new capacity then the amount of allocated memory in the internal buffer may be accommodated as necessary but it will never drop below capacity_ctrl.min_capacity().

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept.
      -
      7. -
    7. -
      void rresize(size_type new_size, param_value_type item = value_type());
      Change the size of the circular_buffer_space_optimized.

      - - -

      -

      Exception Safety. Basic.

      -

      -

      -

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      -

      -

      -

      Complexity. Linear (in the new size of the circular_buffer_space_optimized).

      -

      -

      -

      See Also:

      -

      resize(size_type, const_reference), rset_capacity(const capacity_type&)

      -

      -

      -
      ---- - - - - - - - - - - - - - - -

      Parameters:

      ---- - - - - - - - - - - -

      item

      The element the circular_buffer_space_optimized will be filled with in order to gain the requested size. (See the Effect.)

      new_size

      The new size.

      Postconditions:

      size() == new_size && capacity().capacity() >= new_size
      -
      - If the new size is greater than the current size, copies of item will be inserted at the front of the of the circular_buffer_space_optimized in order to achieve the desired size. In the case the resulting size exceeds the current capacity the capacity will be set to new_size.
      -
      - If the current number of elements stored in the circular_buffer_space_optimized is greater than the desired new size then number of [size() - new_size] first elements will be removed. (The capacity will remain unchanged.)
      -
      - The amount of allocated memory in the internal buffer may be accommodated as necessary.

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws.
      -
      8. -
    8. -
      void assign(size_type n, param_value_type item);
      Assign n items into the space optimized circular buffer.

      The content of the circular_buffer_space_optimized will be removed and replaced with n copies of the item. - - -

      -

      Exception Safety. Basic.

      -

      -

      -

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      -

      -

      -

      Complexity. Linear (in the n).

      -

      -

      -

      See Also:

      -

      operator=, assign(capacity_type, size_type, const_reference), assign(InputIterator, InputIterator), assign(capacity_type, InputIterator, InputIterator)

      -

      -

      -
      ---- - - - - - - - - - - - - - - -

      Parameters:

      ---- - - - - - - - - - - -

      item

      The element the circular_buffer_space_optimized will be filled with.

      n

      The number of elements the circular_buffer_space_optimized will be filled with.

      Postconditions:

      capacity().capacity() == n && capacity().min_capacity() == 0 && size() == n && (*this)[0] == item && (*this)[1] == item && ... && (*this) [n - 1] == item
      -
      - The amount of allocated memory in the internal buffer is n.

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws.
      -
      9. -
    9. -
      void assign(capacity_type capacity_ctrl, size_type n, param_value_type item);
      Assign n items into the space optimized circular buffer specifying the capacity.

      The capacity of the circular_buffer_space_optimized will be set to the specified value and the content of the circular_buffer_space_optimized will be removed and replaced with n copies of the item. - - - -

      -

      Exception Safety. Basic.

      -

      -

      -

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      -

      -

      -

      Complexity. Linear (in the n).

      -

      -

      -

      See Also:

      -

      operator=, assign(size_type, const_reference), assign(InputIterator, InputIterator), assign(capacity_type, InputIterator, InputIterator)

      -

      -

      -
      ---- - - - - - - - - - - - - - - - - - - -

      Parameters:

      ---- - - - - - - - - - - - - - - -

      capacity_ctrl

      The new capacity controller.

      item

      The element the circular_buffer_space_optimized will be filled with.

      n

      The number of elements the circular_buffer_space_optimized will be filled with.

      Requires:

      capacity_ctrl.capacity() >= n

      Postconditions:

      capacity() == capacity_ctrl && size() == n && (*this)[0] == item && (*this)[1] == item && ... && (*this) [n - 1] == item
      -
      - The amount of allocated memory will be max[n, capacity_ctrl.min_capacity()].

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws.
      -
      10. -
    10. -
      template<typename InputIterator> 
-  void assign(InputIterator first, InputIterator last);
      Assign a copy of the range into the space optimized circular buffer.

      The content of the circular_buffer_space_optimized will be removed and replaced with copies of elements from the specified range. - - - -

      -

      Exception Safety. Basic.

      -

      -

      -

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      -

      -

      -

      Complexity. Linear (in the std::distance(first, last)).

      -

      -

      -

      See Also:

      -

      operator=, assign(size_type, const_reference), assign(capacity_type, size_type, const_reference), assign(capacity_type, InputIterator, InputIterator)

      -

      -

      -
      ---- - - - - - - - - - - - - - - - - - - -

      Parameters:

      ---- - - - - - - - - - - -

      first

      The beginning of the range to be copied.

      last

      The end of the range to be copied.

      Requires:

      Valid range [first, last).
      - first and last have to meet the requirements of InputIterator.

      Postconditions:

      capacity().capacity() == std::distance(first, last) && capacity().min_capacity() == 0 && size() == std::distance(first, last) && (*this)[0]== *first && (*this)[1] == *(first + 1) && ... && (*this)[std::distance(first, last) - 1] == *(last - 1)
      -
      - The amount of allocated memory in the internal buffer is std::distance(first, last).

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept and InputIterator is a move iterator.
      -
      11. -
    11. -
      template<typename InputIterator> 
-  void assign(capacity_type capacity_ctrl, InputIterator first, 
-              InputIterator last);
      Assign a copy of the range into the space optimized circular buffer specifying the capacity.

      The capacity of the circular_buffer_space_optimized will be set to the specified value and the content of the circular_buffer_space_optimized will be removed and replaced with copies of elements from the specified range. - - - -

      -

      Exception Safety. Basic.

      -

      -

      -

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      -

      -

      -

      Complexity. Linear (in std::distance(first, last); in min[capacity_ctrl.capacity(), std::distance(first, last)] if the InputIterator is a RandomAccessIterator).

      -

      -

      -

      See Also:

      -

      operator=, assign(size_type, const_reference), assign(capacity_type, size_type, const_reference), assign(InputIterator, InputIterator)

      -

      -

      -
      ---- - - - - - - - - - - - - - - - - - - -

      Parameters:

      ---- - - - - - - - - - - - - - - -

      capacity_ctrl

      The new capacity controller.

      first

      The beginning of the range to be copied.

      last

      The end of the range to be copied.

      Requires:

      Valid range [first, last).
      - first and last have to meet the requirements of InputIterator.

      Postconditions:

      capacity() == capacity_ctrl && size() <= std::distance(first, last) && (*this)[0]== *(last - capacity) && (*this)[1] == *(last - capacity + 1) && ... && (*this)[capacity - 1] == *(last - 1)
      -
      - If the number of items to be copied from the range [first, last) is greater than the specified capacity then only elements from the range [last - capacity, last) will be copied.
      -
      - The amount of allocated memory in the internal buffer is max[std::distance(first, last), capacity_ctrl.min_capacity()].

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept and InputIterator is a move iterator.
      -
      12. -
    12. -
      void swap(circular_buffer_space_optimized< T, Alloc > & cb) noexcept;
      Swap the contents of two space-optimized circular-buffers.

      - - -

      -

      Exception Safety. No-throw.

      -

      -

      -

      Iterator Invalidation. Invalidates all iterators of both circular_buffer_space_optimized containers. (On the other hand the iterators still point to the same elements but within another container. If you want to rely on this feature you have to turn the __debug_support off by defining macro BOOST_CB_DISABLE_DEBUG, otherwise an assertion will report an error if such invalidated iterator is used.)

      -

      -

      -

      Complexity. Constant (in the size of the circular_buffer_space_optimized).

      -

      -

      -

      See Also:

      -

      swap(circular_buffer<T, Alloc>&, circular_buffer<T, Alloc>&), swap(circular_buffer_space_optimized<T, Alloc>&, circular_buffer_space_optimized<T, Alloc>&)

      -

      -

      -
      ---- - - - - - - - - - - - - - - -

      Parameters:

      ---- - - - - -

      cb

      The circular_buffer_space_optimized whose content will be swapped.

      Postconditions:

      this contains elements of cb and vice versa; the capacity and the amount of allocated memory in the internal buffer of this equal to the capacity and the amount of allocated memory of cb and vice versa.

      Throws:

      		Nothing.
      -
      13. -
    13. -
      void push_back(param_value_type item);
      Insert a new element at the end of the space optimized circular buffer.

      - - -

      -

      Exception Safety. Basic.

      -

      -

      -

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      -

      -

      -

      Complexity. Linear (in the size of the circular_buffer_space_optimized).

      -

      -

      -

      See Also:

      -

      push_front(const_reference), pop_back(), pop_front()

      -

      -

      -
      ---- - - - - - - - - - - - - - - -

      Parameters:

      ---- - - - - -

      item

      The element to be inserted.

      Postconditions:

      if capacity().capacity() > 0 then back() == item
      - If the circular_buffer_space_optimized is full, the first element will be removed. If the capacity is 0, nothing will be inserted.
      -
      - The amount of allocated memory in the internal buffer may be predictively increased.

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws.
      -
      14. -
    14. -
      void push_back(rvalue_type item);
      Insert a new element at the end of the space optimized circular buffer.

      - - -

      -

      Exception Safety. Basic.

      -

      -

      -

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      -

      -

      -

      Complexity. Linear (in the size of the circular_buffer_space_optimized).

      -

      -

      -

      See Also:

      -

      push_front(const_reference), pop_back(), pop_front()

      -

      -

      -
      ---- - - - - - - - - - - - - - - -

      Parameters:

      ---- - - - - -

      item

      The element to be inserted.

      Postconditions:

      if capacity().capacity() > 0 then back() == item
      - If the circular_buffer_space_optimized is full, the first element will be removed. If the capacity is 0, nothing will be inserted.
      -
      - The amount of allocated memory in the internal buffer may be predictively increased.

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used).
      -
      15. -
    15. -
      void push_back();
      Insert a new element at the end of the space optimized circular buffer.

      - -

      -

      Exception Safety. Basic.

      -

      -

      -

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      -

      -

      -

      Complexity. Linear (in the size of the circular_buffer_space_optimized).

      -

      -

      -

      See Also:

      -

      push_front(const_reference), pop_back(), pop_front()

      -

      -

      -
      ---- - - - - - - - - - - -

      Postconditions:

      if capacity().capacity() > 0 then back() == item
      - If the circular_buffer_space_optimized is full, the first element will be removed. If the capacity is 0, nothing will be inserted.
      -
      - The amount of allocated memory in the internal buffer may be predictively increased.

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T() throws. Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept.
      -
      16. -
    16. -
      void push_front(param_value_type item);
      Insert a new element at the beginning of the space optimized circular buffer.

      - - -

      -

      Exception Safety. Basic.

      -

      -

      -

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      -

      -

      -

      Complexity. Linear (in the size of the circular_buffer_space_optimized).

      -

      -

      -

      See Also:

      -

      push_back(const_reference), pop_back(), pop_front()

      -

      -

      -
      ---- - - - - - - - - - - - - - - -

      Parameters:

      ---- - - - - -

      item

      The element to be inserted.

      Postconditions:

      if capacity().capacity() > 0 then front() == item
      - If the circular_buffer_space_optimized is full, the last element will be removed. If the capacity is 0, nothing will be inserted.
      -
      - The amount of allocated memory in the internal buffer may be predictively increased.

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws.
      -
      17. -
    17. -
      void push_front(rvalue_type item);
      Insert a new element at the beginning of the space optimized circular buffer.

      - - -

      -

      Exception Safety. Basic.

      -

      -

      -

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      -

      -

      -

      Complexity. Linear (in the size of the circular_buffer_space_optimized).

      -

      -

      -

      See Also:

      -

      push_back(const_reference), pop_back(), pop_front()

      -

      -

      -
      ---- - - - - - - - - - - - - - - -

      Parameters:

      ---- - - - - -

      item

      The element to be inserted.

      Postconditions:

      if capacity().capacity() > 0 then front() == item
      - If the circular_buffer_space_optimized is full, the last element will be removed. If the capacity is 0, nothing will be inserted.
      -
      - The amount of allocated memory in the internal buffer may be predictively increased.

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept.
      -
      18. -
    18. -
      void push_front();
      Insert a new element at the beginning of the space optimized circular buffer.

      - -

      -

      Exception Safety. Basic.

      -

      -

      -

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      -

      -

      -

      Complexity. Linear (in the size of the circular_buffer_space_optimized).

      -

      -

      -

      See Also:

      -

      push_back(const_reference), pop_back(), pop_front()

      -

      -

      -
      ---- - - - - - - - - - - -

      Postconditions:

      if capacity().capacity() > 0 then front() == item
      - If the circular_buffer_space_optimized is full, the last element will be removed. If the capacity is 0, nothing will be inserted.
      -
      - The amount of allocated memory in the internal buffer may be predictively increased.

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T() throws. Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept.
      -
      19. -
    19. -
      void pop_back();
      Remove the last element from the space optimized circular buffer.

      - - -

      -

      Exception Safety. Basic.

      -

      -

      -

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      -

      -

      -

      Complexity. Linear (in the size of the circular_buffer_space_optimized).

      -

      -

      -

      See Also:

      -

      pop_front(), push_back(const_reference), push_front(const_reference)

      -

      -

      -
      ---- - - - - - - - - - - - - - - -

      Requires:

      !empty()

      Postconditions:

      The last element is removed from the circular_buffer_space_optimized.
      -
      - The amount of allocated memory in the internal buffer may be predictively decreased.

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used).
      -
      20. -
    20. -
      void pop_front();
      Remove the first element from the space optimized circular buffer.

      - - -

      -

      Exception Safety. Basic.

      -

      -

      -

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      -

      -

      -

      Complexity. Linear (in the size of the circular_buffer_space_optimized).

      -

      -

      -

      See Also:

      -

      pop_back(), push_back(const_reference), push_front(const_reference)

      -

      -

      -
      ---- - - - - - - - - - - - - - - -

      Requires:

      !empty()

      Postconditions:

      The first element is removed from the circular_buffer_space_optimized.
      -
      - The amount of allocated memory in the internal buffer may be predictively decreased.

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used).
      -
      21. -
    21. -
      iterator insert(iterator pos, param_value_type item);
      Insert an element at the specified position.

      - - - - -

      -

      Exception Safety. Basic.

      -

      -

      -

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      -

      -

      -

      Complexity. Linear (in the size of the circular_buffer_space_optimized).

      -

      -

      -

      See Also:

      -

      insert(iterator, size_type, value_type), insert(iterator, InputIterator, InputIterator), rinsert(iterator, value_type), rinsert(iterator, size_type, value_type), rinsert(iterator, InputIterator, InputIterator)

      -

      -

      -
      ---- - - - - - - - - - - - - - - - - - - - - - - -

      Parameters:

      ---- - - - - - - - - - - -

      item

      The element to be inserted.

      pos

      An iterator specifying the position where the item will be inserted.

      Requires:

      pos is a valid iterator pointing to the circular_buffer_space_optimized or its end.

      Postconditions:

      The item will be inserted at the position pos.
      - If the circular_buffer_space_optimized is full, the first element will be overwritten. If the circular_buffer_space_optimized is full and the pos points to begin(), then the item will not be inserted. If the capacity is 0, nothing will be inserted.
      -
      - The amount of allocated memory in the internal buffer may be predictively increased.

      Returns:

      Iterator to the inserted element or begin() if the item is not inserted. (See the Effect.)

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws. Whatever T::operator = (const T&) throws.
      -
      22. -
    22. -
      iterator insert(iterator pos, rvalue_type item);
      Insert an element at the specified position.

      - - - - -

      -

      Exception Safety. Basic.

      -

      -

      -

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      -

      -

      -

      Complexity. Linear (in the size of the circular_buffer_space_optimized).

      -

      -

      -

      See Also:

      -

      insert(iterator, size_type, value_type), insert(iterator, InputIterator, InputIterator), rinsert(iterator, value_type), rinsert(iterator, size_type, value_type), rinsert(iterator, InputIterator, InputIterator)

      -

      -

      -
      ---- - - - - - - - - - - - - - - - - - - - - - - -

      Parameters:

      ---- - - - - - - - - - - -

      item

      The element to be inserted.

      pos

      An iterator specifying the position where the item will be inserted.

      Requires:

      pos is a valid iterator pointing to the circular_buffer_space_optimized or its end.

      Postconditions:

      The item will be inserted at the position pos.
      - If the circular_buffer_space_optimized is full, the first element will be overwritten. If the circular_buffer_space_optimized is full and the pos points to begin(), then the item will not be inserted. If the capacity is 0, nothing will be inserted.
      -
      - The amount of allocated memory in the internal buffer may be predictively increased.

      Returns:

      Iterator to the inserted element or begin() if the item is not inserted. (See the Effect.)

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept.
      -
      23. -
    23. -
      iterator insert(iterator pos);
      Insert an element at the specified position.

      - - - - -

      -

      Exception Safety. Basic.

      -

      -

      -

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      -

      -

      -

      Complexity. Linear (in the size of the circular_buffer_space_optimized).

      -

      -

      -

      See Also:

      -

      insert(iterator, size_type, value_type), insert(iterator, InputIterator, InputIterator), rinsert(iterator, value_type), rinsert(iterator, size_type, value_type), rinsert(iterator, InputIterator, InputIterator)

      -

      -

      -
      ---- - - - - - - - - - - - - - - - - - - - - - - -

      Parameters:

      ---- - - - - -

      pos

      An iterator specifying the position where the item will be inserted.

      Requires:

      pos is a valid iterator pointing to the circular_buffer_space_optimized or its end.

      Postconditions:

      The item will be inserted at the position pos.
      - If the circular_buffer_space_optimized is full, the first element will be overwritten. If the circular_buffer_space_optimized is full and the pos points to begin(), then the item will not be inserted. If the capacity is 0, nothing will be inserted.
      -
      - The amount of allocated memory in the internal buffer may be predictively increased.

      Returns:

      Iterator to the inserted element or begin() if the item is not inserted. (See the Effect.)

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T() throws. Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept.
      -
      24. -
    24. -
      void insert(iterator pos, size_type n, param_value_type item);
      Insert n copies of the item at the specified position.

      - - - -

      -

      Exception Safety. Basic.

      -

      -

      -

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      -

      -

      -

      Complexity. Linear (in min[capacity().capacity(), size() + n]).

      -

      -

      -

      Example. Consider a circular_buffer_space_optimized with the capacity of 6 and the size of 4. Its internal buffer may look like the one below.
      -
      - |1|2|3|4| | |
      - p ___^
      -
      -After inserting 5 elements at the position p:
      -
      - insert(p, (size_t)5, 0);
      -
      -actually only 4 elements get inserted and elements 1 and 2 are overwritten. This is due to the fact the insert operation preserves the capacity. After insertion the internal buffer looks like this:
      -
      -|0|0|0|0|3|4|
      -
      -For comparison if the capacity would not be preserved the internal buffer would then result in |1|2|0|0|0|0|0|3|4|.

      -

      -

      -

      See Also:

      -

      insert(iterator, value_type), insert(iterator, InputIterator, InputIterator), rinsert(iterator, value_type), rinsert(iterator, size_type, value_type), rinsert(iterator, InputIterator, InputIterator)

      -

      -

      -
      ---- - - - - - - - - - - - - - - - - - - -

      Parameters:

      ---- - - - - - - - - - - - - - - -

      item

      The element whose copies will be inserted.

      n

      The number of items the to be inserted.

      pos

      An iterator specifying the position where the items will be inserted.

      Requires:

      pos is a valid iterator pointing to the circular_buffer_space_optimized or its end.

      Postconditions:

      The number of min[n, (pos - begin()) + reserve()] elements will be inserted at the position pos.
      -The number of min[pos - begin(), max[0, n - reserve()]] elements will be overwritten at the beginning of the circular_buffer_space_optimized.
      -(See Example for the explanation.)
      -
      - The amount of allocated memory in the internal buffer may be predictively increased.

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws. Whatever T::operator = (const T&) throws.
      -
      25. -
    25. -
      template<typename InputIterator> 
-  void insert(iterator pos, InputIterator first, InputIterator last);
      Insert the range [first, last) at the specified position.

      - - - -

      -

      Exception Safety. Basic.

      -

      -

      -

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      -

      -

      -

      Complexity. Linear (in [size() + std::distance(first, last)]; in min[capacity().capacity(), size() + std::distance(first, last)] if the InputIterator is a RandomAccessIterator).

      -

      -

      -

      Example. Consider a circular_buffer_space_optimized with the capacity of 6 and the size of 4. Its internal buffer may look like the one below.
      -
      - |1|2|3|4| | |
      - p ___^
      -
      -After inserting a range of elements at the position p:
      -
      - int array[] = { 5, 6, 7, 8, 9 };
      -insert(p, array, array + 5);
      -
      - actually only elements 6, 7, 8 and 9 from the specified range get inserted and elements 1 and 2 are overwritten. This is due to the fact the insert operation preserves the capacity. After insertion the internal buffer looks like this:
      -
      -|6|7|8|9|3|4|
      -
      -For comparison if the capacity would not be preserved the internal buffer would then result in |1|2|5|6|7|8|9|3|4|.

      -

      -

      -

      See Also:

      -

      insert(iterator, value_type), insert(iterator, size_type, value_type), rinsert(iterator, value_type), rinsert(iterator, size_type, value_type), rinsert(iterator, InputIterator, InputIterator)

      -

      -

      -
      ---- - - - - - - - - - - - - - - - - - - -

      Parameters:

      ---- - - - - - - - - - - - - - - -

      first

      The beginning of the range to be inserted.

      last

      The end of the range to be inserted.

      pos

      An iterator specifying the position where the range will be inserted.

      Requires:

      pos is a valid iterator pointing to the circular_buffer_space_optimized or its end.
      -Valid range [first, last) where first and last meet the requirements of an InputIterator.

      Postconditions:

      Elements from the range [first + max[0, distance(first, last) - (pos - begin()) - reserve()], last) will be inserted at the position pos.
      -The number of min[pos - begin(), max[0, distance(first, last) - reserve()]] elements will be overwritten at the beginning of the circular_buffer_space_optimized.
      -(See Example for the explanation.)
      -
      - The amount of allocated memory in the internal buffer may be predictively increased.

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept.
      -
      26. -
    26. -
      iterator rinsert(iterator pos, param_value_type item);
      Insert an element before the specified position.

      - - - - -

      -

      Exception Safety. Basic.

      -

      -

      -

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      -

      -

      -

      Complexity. Linear (in the size of the circular_buffer_space_optimized).

      -

      -

      -

      See Also:

      -

      rinsert(iterator, size_type, value_type), rinsert(iterator, InputIterator, InputIterator), insert(iterator, value_type), insert(iterator, size_type, value_type), insert(iterator, InputIterator, InputIterator)

      -

      -

      -
      ---- - - - - - - - - - - - - - - - - - - - - - - -

      Parameters:

      ---- - - - - - - - - - - -

      item

      The element to be inserted.

      pos

      An iterator specifying the position before which the item will be inserted.

      Requires:

      pos is a valid iterator pointing to the circular_buffer_space_optimized or its end.

      Postconditions:

      The item will be inserted before the position pos.
      - If the circular_buffer_space_optimized is full, the last element will be overwritten. If the circular_buffer_space_optimized is full and the pos points to end(), then the item will not be inserted. If the capacity is 0, nothing will be inserted.
      -
      - The amount of allocated memory in the internal buffer may be predictively increased.

      Returns:

      Iterator to the inserted element or end() if the item is not inserted. (See the Effect.)

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws. Whatever T::operator = (const T&) throws.
      -
      27. -
    27. -
      iterator rinsert(iterator pos, rvalue_type item);
      Insert an element before the specified position.

      - - - - -

      -

      Exception Safety. Basic.

      -

      -

      -

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      -

      -

      -

      Complexity. Linear (in the size of the circular_buffer_space_optimized).

      -

      -

      -

      See Also:

      -

      rinsert(iterator, size_type, value_type), rinsert(iterator, InputIterator, InputIterator), insert(iterator, value_type), insert(iterator, size_type, value_type), insert(iterator, InputIterator, InputIterator)

      -

      -

      -
      ---- - - - - - - - - - - - - - - - - - - - - - - -

      Parameters:

      ---- - - - - - - - - - - -

      item

      The element to be inserted.

      pos

      An iterator specifying the position before which the item will be inserted.

      Requires:

      pos is a valid iterator pointing to the circular_buffer_space_optimized or its end.

      Postconditions:

      The item will be inserted before the position pos.
      - If the circular_buffer_space_optimized is full, the last element will be overwritten. If the circular_buffer_space_optimized is full and the pos points to end(), then the item will not be inserted. If the capacity is 0, nothing will be inserted.
      -
      - The amount of allocated memory in the internal buffer may be predictively increased.

      Returns:

      Iterator to the inserted element or end() if the item is not inserted. (See the Effect.)

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept.
      -
      28. -
    28. -
      iterator rinsert(iterator pos);
      Insert an element before the specified position.

      - - - - -

      -

      Exception Safety. Basic.

      -

      -

      -

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      -

      -

      -

      Complexity. Linear (in the size of the circular_buffer_space_optimized).

      -

      -

      -

      See Also:

      -

      rinsert(iterator, size_type, value_type), rinsert(iterator, InputIterator, InputIterator), insert(iterator, value_type), insert(iterator, size_type, value_type), insert(iterator, InputIterator, InputIterator)

      -

      -

      -
      ---- - - - - - - - - - - - - - - - - - - - - - - -

      Parameters:

      ---- - - - - -

      pos

      An iterator specifying the position before which the item will be inserted.

      Requires:

      pos is a valid iterator pointing to the circular_buffer_space_optimized or its end.

      Postconditions:

      The item will be inserted before the position pos.
      - If the circular_buffer_space_optimized is full, the last element will be overwritten. If the circular_buffer_space_optimized is full and the pos points to end(), then the item will not be inserted. If the capacity is 0, nothing will be inserted.
      -
      - The amount of allocated memory in the internal buffer may be predictively increased.

      Returns:

      Iterator to the inserted element or end() if the item is not inserted. (See the Effect.)

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T() throws. Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept.
      -
      29. -
    29. -
      void rinsert(iterator pos, size_type n, param_value_type item);
      Insert n copies of the item before the specified position.

      - - - -

      -

      Exception Safety. Basic.

      -

      -

      -

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      -

      -

      -

      Complexity. Linear (in min[capacity().capacity(), size() + n]).

      -

      -

      -

      Example. Consider a circular_buffer_space_optimized with the capacity of 6 and the size of 4. Its internal buffer may look like the one below.
      -
      - |1|2|3|4| | |
      - p ___^
      -
      -After inserting 5 elements before the position p:
      -
      - rinsert(p, (size_t)5, 0);
      -
      -actually only 4 elements get inserted and elements 3 and 4 are overwritten. This is due to the fact the rinsert operation preserves the capacity. After insertion the internal buffer looks like this:
      -
      -|1|2|0|0|0|0|
      -
      -For comparison if the capacity would not be preserved the internal buffer would then result in |1|2|0|0|0|0|0|3|4|.

      -

      -

      -

      See Also:

      -

      rinsert(iterator, value_type), rinsert(iterator, InputIterator, InputIterator), insert(iterator, value_type), insert(iterator, size_type, value_type), insert(iterator, InputIterator, InputIterator)

      -

      -

      -
      ---- - - - - - - - - - - - - - - - - - - -

      Parameters:

      ---- - - - - - - - - - - - - - - -

      item

      The element whose copies will be inserted.

      n

      The number of items the to be inserted.

      pos

      An iterator specifying the position where the items will be inserted.

      Requires:

      pos is a valid iterator pointing to the circular_buffer_space_optimized or its end.

      Postconditions:

      The number of min[n, (end() - pos) + reserve()] elements will be inserted before the position pos.
      -The number of min[end() - pos, max[0, n - reserve()]] elements will be overwritten at the end of the circular_buffer_space_optimized.
      -(See Example for the explanation.)
      -
      - The amount of allocated memory in the internal buffer may be predictively increased.

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws. Whatever T::operator = (const T&) throws.
      -
      30. -
    30. -
      template<typename InputIterator> 
-  void rinsert(iterator pos, InputIterator first, InputIterator last);
      Insert the range [first, last) before the specified position.

      - - - -

      -

      Exception Safety. Basic.

      -

      -

      -

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      -

      -

      -

      Complexity. Linear (in [size() + std::distance(first, last)]; in min[capacity().capacity(), size() + std::distance(first, last)] if the InputIterator is a RandomAccessIterator).

      -

      -

      -

      Example. Consider a circular_buffer_space_optimized with the capacity of 6 and the size of 4. Its internal buffer may look like the one below.
      -
      - |1|2|3|4| | |
      - p ___^
      -
      -After inserting a range of elements before the position p:
      -
      - int array[] = { 5, 6, 7, 8, 9 };
      -insert(p, array, array + 5);
      -
      - actually only elements 5, 6, 7 and 8 from the specified range get inserted and elements 3 and 4 are overwritten. This is due to the fact the rinsert operation preserves the capacity. After insertion the internal buffer looks like this:
      -
      -|1|2|5|6|7|8|
      -
      -For comparison if the capacity would not be preserved the internal buffer would then result in |1|2|5|6|7|8|9|3|4|.

      -

      -

      -

      See Also:

      -

      rinsert(iterator, value_type), rinsert(iterator, size_type, value_type), insert(iterator, value_type), insert(iterator, size_type, value_type), insert(iterator, InputIterator, InputIterator)

      -

      -

      -
      ---- - - - - - - - - - - - - - - - - - - -

      Parameters:

      ---- - - - - - - - - - - - - - - -

      first

      The beginning of the range to be inserted.

      last

      The end of the range to be inserted.

      pos

      An iterator specifying the position where the range will be inserted.

      Requires:

      pos is a valid iterator pointing to the circular_buffer_space_optimized or its end.
      - Valid range [first, last) where first and last meet the requirements of an InputIterator.

      Postconditions:

      Elements from the range [first, last - max[0, distance(first, last) - (end() - pos) - reserve()]) will be inserted before the position pos.
      -The number of min[end() - pos, max[0, distance(first, last) - reserve()]] elements will be overwritten at the end of the circular_buffer.
      -(See Example for the explanation.)
      -
      - The amount of allocated memory in the internal buffer may be predictively increased.

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws. Whatever T::operator = (const T&) throws.
      -
      31. -
    31. -
      iterator erase(iterator pos);
      Remove an element at the specified position.

      - - - - -

      -

      Exception Safety. Basic.

      -

      -

      -

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      -

      -

      -

      Complexity. Linear (in the size of the circular_buffer_space_optimized).

      -

      -

      -

      See Also:

      -

      erase(iterator, iterator), rerase(iterator), rerase(iterator, iterator), clear()

      -

      -

      -
      ---- - - - - - - - - - - - - - - - - - - - - - - -

      Parameters:

      ---- - - - - -

      pos

      An iterator pointing at the element to be removed.

      Requires:

      pos is a valid iterator pointing to the circular_buffer_space_optimized (but not an end()).

      Postconditions:

      The element at the position pos is removed.
      -
      - The amount of allocated memory in the internal buffer may be predictively decreased.

      Returns:

      Iterator to the first element remaining beyond the removed element or end() if no such element exists.

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::operator = (const T&) throws or nothing if T::operator = (T&&) is noexcept.
      -
      32. -
    32. -
      iterator erase(iterator first, iterator last);
      Erase the range [first, last).

      - - - - -

      -

      Exception Safety. Basic.

      -

      -

      -

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      -

      -

      -

      Complexity. Linear (in the size of the circular_buffer_space_optimized).

      -

      -

      -

      See Also:

      -

      erase(iterator), rerase(iterator), rerase(iterator, iterator), clear()

      -

      -

      -
      ---- - - - - - - - - - - - - - - - - - - - - - - -

      Parameters:

      ---- - - - - - - - - - - -

      first

      The beginning of the range to be removed.

      last

      The end of the range to be removed.

      Requires:

      Valid range [first, last).

      Postconditions:

      The elements from the range [first, last) are removed. (If first == last nothing is removed.)
      -
      - The amount of allocated memory in the internal buffer may be predictively decreased.

      Returns:

      Iterator to the first element remaining beyond the removed elements or end() if no such element exists.

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::operator = (const T&) throws or nothing if T::operator = (T&&) is noexcept.
      -
      33. -
    33. -
      iterator rerase(iterator pos);
      Remove an element at the specified position.

      - - - - -

      -

      Exception Safety. Basic.

      -

      -

      -

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      -

      -

      -

      Complexity. Linear (in the size of the circular_buffer_space_optimized).

      -

      -

      -
      - - - - - -
      [Note]Note

      Basically there is no difference between erase(iterator) and this method. It is implemented only for consistency with the base circular_buffer.

      -

      -

      -

      See Also:

      -

      erase(iterator), erase(iterator, iterator), rerase(iterator, iterator), clear()

      -

      -

      -
      ---- - - - - - - - - - - - - - - - - - - - - - - -

      Parameters:

      ---- - - - - -

      pos

      An iterator pointing at the element to be removed.

      Requires:

      pos is a valid iterator pointing to the circular_buffer_space_optimized (but not an end()).
      -
      - The amount of allocated memory in the internal buffer may be predictively decreased.

      Postconditions:

      The element at the position pos is removed.

      Returns:

      Iterator to the first element remaining in front of the removed element or begin() if no such element exists.

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::operator = (const T&) throws or nothing if T::operator = (T&&) is noexcept.
      -
      34. -
    34. -
      iterator rerase(iterator first, iterator last);
      Erase the range [first, last).

      - - - - -

      -

      Exception Safety. Basic.

      -

      -

      -

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      -

      -

      -

      Complexity. Linear (in the size of the circular_buffer_space_optimized).

      -

      -

      -
      - - - - - -
      [Note]Note

      Basically there is no difference between erase(iterator, iterator) and this method. It is implemented only for consistency with the base <circular_buffer.

      -

      -

      -

      See Also:

      -

      erase(iterator), erase(iterator, iterator), rerase(iterator), clear()

      -

      -

      -
      ---- - - - - - - - - - - - - - - - - - - - - - - -

      Parameters:

      ---- - - - - - - - - - - -

      first

      The beginning of the range to be removed.

      last

      The end of the range to be removed.

      Requires:

      Valid range [first, last).

      Postconditions:

      The elements from the range [first, last) are removed. (If first == last nothing is removed.)
      -
      - The amount of allocated memory in the internal buffer may be predictively decreased.

      Returns:

      Iterator to the first element remaining in front of the removed elements or begin() if no such element exists.

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::operator = (const T&) throws or nothing if T::operator = (T&&) is noexcept.
      -
      35. -
    35. -
      void clear();
      Remove all stored elements from the space optimized circular buffer.

      - -

      -

      Exception Safety. Basic.

      -

      -

      -

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      -

      -

      -

      Complexity. Linear (in the size of the circular_buffer_space_optimized).

      -

      -

      -

      See Also:

      -

      ~circular_buffer_space_optimized(), erase(iterator), erase(iterator, iterator), rerase(iterator), rerase(iterator, iterator)

      -

      -

      -
      ---- - - - - - - - - - - -

      Postconditions:

      size() == 0
      -
      - The amount of allocated memory in the internal buffer may be predictively decreased.

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used).
      -
      36. -
    -
    -
    -

    -circular_buffer_space_optimized private member functions

    -
      -
    1. -
      void adjust_min_capacity();
      Adjust the amount of allocated memory.
      2. -
    2. -
      size_type ensure_reserve(size_type new_capacity, size_type buffer_size) const;
      Ensure the reserve for possible growth up.
      3. -
    3. -
      void check_low_capacity(size_type n = 1);
      Check for low capacity.
      4. -
    4. -
      void check_high_capacity();
      Check for high capacity.
      5. -
    5. -
      void reduce_capacity(const true_type &);
      Specialized method for reducing the capacity.
      6. -
    6. -
      void reduce_capacity(const false_type &);
      Specialized method for reducing the capacity.
      7. -
    7. -
      template<typename IntegralType> 
-  void insert(const iterator & pos, IntegralType n, IntegralType item, 
-              const true_type &);
      Specialized insert method.
      8. -
    8. -
      template<typename Iterator> 
-  void insert(const iterator & pos, Iterator first, Iterator last, 
-              const false_type &);
      Specialized insert method.
      9. -
    9. -
      template<typename IntegralType> 
-  void rinsert(const iterator & pos, IntegralType n, IntegralType item, 
-               const true_type &);
      Specialized rinsert method.
      10. -
    10. -
      template<typename Iterator> 
-  void rinsert(const iterator & pos, Iterator first, Iterator last, 
-               const false_type &);
      Specialized rinsert method.
      11. -
    -
    -
    -

    -circular_buffer_space_optimized private static functions

    -
      -
    1. -
      static size_type 
-init_capacity(const capacity_type & capacity_ctrl, size_type n);
      Determine the initial capacity.
      2. -
    2. -
      template<typename IntegralType> 
-  static size_type 
-  init_capacity(const capacity_type & capacity_ctrl, IntegralType n, 
-                IntegralType, const true_type &);
      Specialized method for determining the initial capacity.
      3. -
    3. -
      template<typename Iterator> 
-  static size_type 
-  init_capacity(const capacity_type & capacity_ctrl, Iterator first, 
-                Iterator last, const false_type &);
      Specialized method for determining the initial capacity.
      4. -
    4. -
      template<typename InputIterator> 
-  static size_type 
-  init_capacity(const capacity_type & capacity_ctrl, InputIterator, 
-                InputIterator, const std::input_iterator_tag &);
      Specialized method for determining the initial capacity.
      5. -
    5. -
      template<typename ForwardIterator> 
-  static size_type 
-  init_capacity(const capacity_type & capacity_ctrl, ForwardIterator first, 
-                ForwardIterator last, const std::forward_iterator_tag &);
      Specialized method for determining the initial capacity.
      6. -
    -
    -
    -
    - - - -
    Copyright © 2003-2013 Jan Gaspar

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/circular_buffer.html b/doc/html/boost/circular_buffer.html index 6ff33f4b76..a6e8bd6d63 100644 --- a/doc/html/boost/circular_buffer.html +++ b/doc/html/boost/circular_buffer.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -56,204 +56,204 @@ typedef value_type && rvalue_type; // construct/copy/destruct - explicit circular_buffer(const allocator_type & = allocator_type()) noexcept; - explicit circular_buffer(capacity_type, + explicit circular_buffer(const allocator_type & = allocator_type()) noexcept; + explicit circular_buffer(capacity_type, const allocator_type & = allocator_type()); - circular_buffer(size_type, param_value_type, + circular_buffer(size_type, param_value_type, const allocator_type & = allocator_type()); - circular_buffer(capacity_type, size_type, param_value_type, + circular_buffer(capacity_type, size_type, param_value_type, const allocator_type & = allocator_type()); - circular_buffer(const circular_buffer< T, Alloc > &); - circular_buffer(circular_buffer< T, Alloc > &&) noexcept; + circular_buffer(const circular_buffer< T, Alloc > &); + circular_buffer(circular_buffer< T, Alloc > &&) noexcept; template<typename InputIterator> - circular_buffer(InputIterator, InputIterator, + circular_buffer(InputIterator, InputIterator, const allocator_type & = allocator_type()); template<typename InputIterator> - circular_buffer(capacity_type, InputIterator, InputIterator, + circular_buffer(capacity_type, InputIterator, InputIterator, const allocator_type & = allocator_type()); - circular_buffer< T, Alloc > & operator=(const circular_buffer< T, Alloc > &); + circular_buffer< T, Alloc > & operator=(const circular_buffer< T, Alloc > &); circular_buffer< T, Alloc > & - operator=(circular_buffer< T, Alloc > &&) noexcept; - ~circular_buffer(); - - // public member functions - allocator_type get_allocator() const noexcept; - allocator_type & get_allocator() noexcept; - iterator begin() noexcept; - iterator end() noexcept; - const_iterator begin() const noexcept; - const_iterator end() const noexcept; - reverse_iterator rbegin() noexcept; - reverse_iterator rend() noexcept; - const_reverse_iterator rbegin() const noexcept; - const_reverse_iterator rend() const noexcept; - reference operator[](size_type); - const_reference operator[](size_type) const; - reference at(size_type); - const_reference at(size_type) const; - reference front(); - reference back(); - const_reference front() const; - const_reference back() const; - array_range array_one(); - array_range array_two(); - const_array_range array_one() const; - const_array_range array_two() const; - pointer linearize(); - bool is_linearized() const noexcept; - void rotate(const_iterator); - size_type size() const noexcept; - size_type max_size() const noexcept; - bool empty() const noexcept; - bool full() const noexcept; - size_type reserve() const noexcept; - capacity_type capacity() const noexcept; - void set_capacity(capacity_type); - void resize(size_type, param_value_type = value_type()); - void rset_capacity(capacity_type); - void rresize(size_type, param_value_type = value_type()); - void assign(size_type, param_value_type); - void assign(capacity_type, size_type, param_value_type); - template<typename InputIterator> void assign(InputIterator, InputIterator); + operator=(circular_buffer< T, Alloc > &&) noexcept; + ~circular_buffer(); + + // public member functions + allocator_type get_allocator() const noexcept; + allocator_type & get_allocator() noexcept; + iterator begin() noexcept; + iterator end() noexcept; + const_iterator begin() const noexcept; + const_iterator end() const noexcept; + reverse_iterator rbegin() noexcept; + reverse_iterator rend() noexcept; + const_reverse_iterator rbegin() const noexcept; + const_reverse_iterator rend() const noexcept; + reference operator[](size_type); + const_reference operator[](size_type) const; + reference at(size_type); + const_reference at(size_type) const; + reference front(); + reference back(); + const_reference front() const; + const_reference back() const; + array_range array_one(); + array_range array_two(); + const_array_range array_one() const; + const_array_range array_two() const; + pointer linearize(); + bool is_linearized() const noexcept; + void rotate(const_iterator); + size_type size() const noexcept; + size_type max_size() const noexcept; + bool empty() const noexcept; + bool full() const noexcept; + size_type reserve() const noexcept; + capacity_type capacity() const noexcept; + void set_capacity(capacity_type); + void resize(size_type, param_value_type = value_type()); + void rset_capacity(capacity_type); + void rresize(size_type, param_value_type = value_type()); + void assign(size_type, param_value_type); + void assign(capacity_type, size_type, param_value_type); + template<typename InputIterator> void assign(InputIterator, InputIterator); template<typename InputIterator> - void assign(capacity_type, InputIterator, InputIterator); - void swap(circular_buffer< T, Alloc > &) noexcept; - void push_back(param_value_type); - void push_back(rvalue_type); - void push_back(); - void push_front(param_value_type); - void push_front(rvalue_type); - void push_front(); - void pop_back(); - void pop_front(); - iterator insert(iterator, param_value_type); - iterator insert(iterator, rvalue_type); - iterator insert(iterator); - void insert(iterator, size_type, param_value_type); + void assign(capacity_type, InputIterator, InputIterator); + void swap(circular_buffer< T, Alloc > &) noexcept; + void push_back(param_value_type); + void push_back(rvalue_type); + void push_back(); + void push_front(param_value_type); + void push_front(rvalue_type); + void push_front(); + void pop_back(); + void pop_front(); + iterator insert(iterator, param_value_type); + iterator insert(iterator, rvalue_type); + iterator insert(iterator); + void insert(iterator, size_type, param_value_type); template<typename InputIterator> - void insert(iterator, InputIterator, InputIterator); - iterator rinsert(iterator, param_value_type); - iterator rinsert(iterator, rvalue_type); - iterator rinsert(iterator); - void rinsert(iterator, size_type, param_value_type); + void insert(iterator, InputIterator, InputIterator); + iterator rinsert(iterator, param_value_type); + iterator rinsert(iterator, rvalue_type); + iterator rinsert(iterator); + void rinsert(iterator, size_type, param_value_type); template<typename InputIterator> - void rinsert(iterator, InputIterator, InputIterator); - iterator erase(iterator); - iterator erase(iterator, iterator); - iterator rerase(iterator); - iterator rerase(iterator, iterator); - void erase_begin(size_type); - void erase_end(size_type); - void clear() noexcept; - - // private member functions - template<typename ValT> void push_back_impl(ValT); - template<typename ValT> void push_front_impl(ValT); - template<typename ValT> iterator insert_impl(iterator, ValT); - template<typename ValT> iterator rinsert_impl(iterator, ValT); - void check_position(size_type) const; - template<typename Pointer> void increment(Pointer &) const; - template<typename Pointer> void decrement(Pointer &) const; - template<typename Pointer> Pointer add(Pointer, difference_type) const; - template<typename Pointer> Pointer sub(Pointer, difference_type) const; - pointer map_pointer(pointer) const; - pointer allocate(size_type); - void deallocate(pointer, size_type); - bool is_uninitialized(const_pointer) const noexcept; - void replace(pointer, param_value_type); - void replace(pointer, rvalue_type); - void construct_or_replace(bool, pointer, param_value_type); - void construct_or_replace(bool, pointer, rvalue_type); - void destroy_item(pointer); - void destroy_if_constructed(pointer); - void destroy_content(); - void destroy_content(const true_type &); - void destroy_content(const false_type &); - void destroy() noexcept; - void initialize_buffer(capacity_type); - void initialize_buffer(capacity_type, param_value_type); + void rinsert(iterator, InputIterator, InputIterator); + iterator erase(iterator); + iterator erase(iterator, iterator); + iterator rerase(iterator); + iterator rerase(iterator, iterator); + void erase_begin(size_type); + void erase_end(size_type); + void clear() noexcept; + + // private member functions + template<typename ValT> void push_back_impl(ValT); + template<typename ValT> void push_front_impl(ValT); + template<typename ValT> iterator insert_impl(iterator, ValT); + template<typename ValT> iterator rinsert_impl(iterator, ValT); + void check_position(size_type) const; + template<typename Pointer> void increment(Pointer &) const; + template<typename Pointer> void decrement(Pointer &) const; + template<typename Pointer> Pointer add(Pointer, difference_type) const; + template<typename Pointer> Pointer sub(Pointer, difference_type) const; + pointer map_pointer(pointer) const; + pointer allocate(size_type); + void deallocate(pointer, size_type); + bool is_uninitialized(const_pointer) const noexcept; + void replace(pointer, param_value_type); + void replace(pointer, rvalue_type); + void construct_or_replace(bool, pointer, param_value_type); + void construct_or_replace(bool, pointer, rvalue_type); + void destroy_item(pointer); + void destroy_if_constructed(pointer); + void destroy_content(); + void destroy_content(const true_type &); + void destroy_content(const false_type &); + void destroy() noexcept; + void initialize_buffer(capacity_type); + void initialize_buffer(capacity_type, param_value_type); template<typename IntegralType> - void initialize(IntegralType, IntegralType, const true_type &); + void initialize(IntegralType, IntegralType, const true_type &); template<typename Iterator> - void initialize(Iterator, Iterator, const false_type &); + void initialize(Iterator, Iterator, const false_type &); template<typename InputIterator> - void initialize(InputIterator, InputIterator, + void initialize(InputIterator, InputIterator, const std::input_iterator_tag &); template<typename ForwardIterator> - void initialize(ForwardIterator, ForwardIterator, + void initialize(ForwardIterator, ForwardIterator, const std::forward_iterator_tag &); template<typename IntegralType> - void initialize(capacity_type, IntegralType, IntegralType, + void initialize(capacity_type, IntegralType, IntegralType, const true_type &); template<typename Iterator> - void initialize(capacity_type, Iterator, Iterator, const false_type &); + void initialize(capacity_type, Iterator, Iterator, const false_type &); template<typename InputIterator> - void initialize(capacity_type, InputIterator, InputIterator, + void initialize(capacity_type, InputIterator, InputIterator, const std::input_iterator_tag &); template<typename ForwardIterator> - void initialize(capacity_type, ForwardIterator, ForwardIterator, + void initialize(capacity_type, ForwardIterator, ForwardIterator, const std::forward_iterator_tag &); template<typename ForwardIterator> - void initialize(capacity_type, ForwardIterator, ForwardIterator, + void initialize(capacity_type, ForwardIterator, ForwardIterator, size_type); - void reset(pointer, pointer, capacity_type); - void swap_allocator(circular_buffer< T, Alloc > &, const true_type &); - void swap_allocator(circular_buffer< T, Alloc > &, const false_type &); + void reset(pointer, pointer, capacity_type); + void swap_allocator(circular_buffer< T, Alloc > &, const true_type &); + void swap_allocator(circular_buffer< T, Alloc > &, const false_type &); template<typename IntegralType> - void assign(IntegralType, IntegralType, const true_type &); + void assign(IntegralType, IntegralType, const true_type &); template<typename Iterator> - void assign(Iterator, Iterator, const false_type &); + void assign(Iterator, Iterator, const false_type &); template<typename InputIterator> - void assign(InputIterator, InputIterator, const std::input_iterator_tag &); + void assign(InputIterator, InputIterator, const std::input_iterator_tag &); template<typename ForwardIterator> - void assign(ForwardIterator, ForwardIterator, + void assign(ForwardIterator, ForwardIterator, const std::forward_iterator_tag &); template<typename IntegralType> - void assign(capacity_type, IntegralType, IntegralType, const true_type &); + void assign(capacity_type, IntegralType, IntegralType, const true_type &); template<typename Iterator> - void assign(capacity_type, Iterator, Iterator, const false_type &); + void assign(capacity_type, Iterator, Iterator, const false_type &); template<typename InputIterator> - void assign(capacity_type, InputIterator, InputIterator, + void assign(capacity_type, InputIterator, InputIterator, const std::input_iterator_tag &); template<typename ForwardIterator> - void assign(capacity_type, ForwardIterator, ForwardIterator, + void assign(capacity_type, ForwardIterator, ForwardIterator, const std::forward_iterator_tag &); template<typename Functor> - void assign_n(capacity_type, size_type, const Functor &); - template<typename ValT> iterator insert_item(const iterator &, ValT); + void assign_n(capacity_type, size_type, const Functor &); + template<typename ValT> iterator insert_item(const iterator &, ValT); template<typename IntegralType> - void insert(const iterator &, IntegralType, IntegralType, + void insert(const iterator &, IntegralType, IntegralType, const true_type &); template<typename Iterator> - void insert(const iterator &, Iterator, Iterator, const false_type &); + void insert(const iterator &, Iterator, Iterator, const false_type &); template<typename InputIterator> - void insert(iterator, InputIterator, InputIterator, + void insert(iterator, InputIterator, InputIterator, const std::input_iterator_tag &); template<typename ForwardIterator> - void insert(const iterator &, ForwardIterator, ForwardIterator, + void insert(const iterator &, ForwardIterator, ForwardIterator, const std::forward_iterator_tag &); template<typename Wrapper> - void insert_n(const iterator &, size_type, const Wrapper &); + void insert_n(const iterator &, size_type, const Wrapper &); template<typename IntegralType> - void rinsert(const iterator &, IntegralType, IntegralType, + void rinsert(const iterator &, IntegralType, IntegralType, const true_type &); template<typename Iterator> - void rinsert(const iterator &, Iterator, Iterator, const false_type &); + void rinsert(const iterator &, Iterator, Iterator, const false_type &); template<typename InputIterator> - void rinsert(iterator, InputIterator, InputIterator, + void rinsert(iterator, InputIterator, InputIterator, const std::input_iterator_tag &); template<typename ForwardIterator> - void rinsert(const iterator &, ForwardIterator, ForwardIterator, + void rinsert(const iterator &, ForwardIterator, ForwardIterator, const std::forward_iterator_tag &); template<typename Wrapper> - void rinsert_n(const iterator &, size_type, const Wrapper &); - void erase_begin(size_type, const true_type &); - void erase_begin(size_type, const false_type &); - void erase_end(size_type, const true_type &); - void erase_end(size_type, const false_type &); + void rinsert_n(const iterator &, size_type, const Wrapper &); + void erase_begin(size_type, const true_type &); + void erase_begin(size_type, const false_type &); + void erase_end(size_type, const true_type &); + void erase_end(size_type, const false_type &); };
    -

    Description

    +

    Description

    Type Requirements T. The T has to be SGIAssignable (SGI STL defined combination of Assignable and CopyConstructible). Moreover T has to be DefaultConstructible if supplied as a default parameter when invoking some of the circular_buffer's methods e.g. insert(iterator pos, const value_type& item = value_type()). And EqualityComparable and/or LessThanComparable if the circular_buffer will be compared with another container.

    @@ -267,7 +267,7 @@

    For detailed documentation of the circular_buffer visit: http://www.boost.org/libs/circular_buffer/doc/circular_buffer.html

    -

    Template Parameters

    +

    Template Parameters

    1. typename T
      @@ -280,7 +280,7 @@ For detailed documentation of the
    -

    +

    circular_buffer public types

    @@ -318,13 +318,13 @@ For detailed documentation of the
    -

    +

    circular_buffer public construct/copy/destruct

    1. -
      explicit circular_buffer(const allocator_type & alloc = allocator_type()) noexcept;
      Create an empty circular_buffer with zero capacity.

      +

      explicit circular_buffer(const allocator_type & alloc = allocator_type()) noexcept;
      Create an empty circular_buffer with zero capacity.

      @@ -384,7 +384,7 @@ For detailed documentation of the
  13. -
    explicit circular_buffer(capacity_type buffer_capacity, 
+
    explicit circular_buffer(capacity_type buffer_capacity, 
                          const allocator_type & alloc = allocator_type());
    Create an empty circular_buffer with the specified capacity. 
    
 
 
@@ -429,7 +429,7 @@ For detailed documentation of the
  • -
    circular_buffer(size_type n, param_value_type item, 
+
    circular_buffer(size_type n, param_value_type item, 
                 const allocator_type & alloc = allocator_type());
    Create a full circular_buffer with the specified capacity and filled with n copies of item. 
    
 
 
@@ -478,7 +478,7 @@ For detailed documentation of the
  • -
    circular_buffer(capacity_type buffer_capacity, size_type n, 
+
    circular_buffer(capacity_type buffer_capacity, size_type n, 
                 param_value_type item, 
                 const allocator_type & alloc = allocator_type());
    Create a circular_buffer with the specified capacity and filled with n copies of item. 
    
 
@@ -537,7 +537,7 @@ For detailed documentation of the
  • -
    circular_buffer(const circular_buffer< T, Alloc > & cb);
    The copy constructor.

    Creates a copy of the specified circular_buffer. +

    circular_buffer(const circular_buffer< T, Alloc > & cb);
    The copy constructor.

    Creates a copy of the specified circular_buffer.

    @@ -575,7 +575,7 @@ For detailed documentation of the
  • -
    circular_buffer(circular_buffer< T, Alloc > && cb) noexcept;
    The move constructor.

    Move constructs a circular_buffer from cb, leaving cb empty. +

    circular_buffer(circular_buffer< T, Alloc > && cb) noexcept;
    The move constructor.

    Move constructs a circular_buffer from cb, leaving cb empty. @@ -619,7 +619,7 @@ For detailed documentation of the 

  • template<typename InputIterator> 
-  circular_buffer(InputIterator first, InputIterator last, 
+  circular_buffer(InputIterator first, InputIterator last, 
                   const allocator_type & alloc = allocator_type());
    Create a full circular_buffer filled with a copy of the range.

    @@ -675,7 +675,7 @@ For detailed documentation of the 

  • template<typename InputIterator> 
-  circular_buffer(capacity_type buffer_capacity, InputIterator first, 
+  circular_buffer(capacity_type buffer_capacity, InputIterator first, 
                   InputIterator last, 
                   const allocator_type & alloc = allocator_type());
    Create a circular_buffer with the specified capacity and filled with a copy of the range.

    @@ -738,7 +738,7 @@ For detailed documentation of the 

  • circular_buffer< T, Alloc > & 
-operator=(const circular_buffer< T, Alloc > & cb);
    The assign operator.

    Makes this circular_buffer to become a copy of the specified circular_buffer. +operator=(const circular_buffer< T, Alloc > & cb);The assign operator.

    Makes this circular_buffer to become a copy of the specified circular_buffer.

    @@ -787,7 +787,7 @@ For detailed documentation of the 
  • circular_buffer< T, Alloc > & 
-operator=(circular_buffer< T, Alloc > && cb) noexcept;
    Move assigns content of cb to *this, leaving cb empty.

    +operator=(circular_buffer< T, Alloc > && cb) noexcept;Move assigns content of cb to *this, leaving cb empty.

    @@ -830,7 +830,7 @@ For detailed documentation of the

  • -
    ~circular_buffer();
    The destructor.

    Destroys the circular_buffer. +

    ~circular_buffer();
    The destructor.

    Destroys the circular_buffer.

    Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer (including iterators equal to end()).

    @@ -856,11 +856,11 @@ For detailed documentation of the

    • -

    -circular_buffer public member functions

    +

    +circular_buffer public member functions

    1. -
      allocator_type get_allocator() const noexcept;
      Get the allocator.

      +

      allocator_type get_allocator() const noexcept;
      Get the allocator.

      Exception Safety. No-throw.

      @@ -894,7 +894,7 @@ For detailed documentation of the
  • -
    allocator_type & get_allocator() noexcept;
    Get the allocator reference.

    +

    allocator_type & get_allocator() noexcept;
    Get the allocator reference.

    Exception Safety. No-throw.

    @@ -937,7 +937,7 @@ For detailed documentation of the
  • -
    iterator begin() noexcept;
    Get the iterator pointing to the beginning of the circular_buffer.

    +

    iterator begin() noexcept;
    Get the iterator pointing to the beginning of the circular_buffer.

    Exception Safety. No-throw.

    @@ -971,7 +971,7 @@ For detailed documentation of the
  • -
    iterator end() noexcept;
    Get the iterator pointing to the end of the circular_buffer.

    +

    iterator end() noexcept;
    Get the iterator pointing to the end of the circular_buffer.

    Exception Safety. No-throw.

    @@ -1005,7 +1005,7 @@ For detailed documentation of the
  • -
    const_iterator begin() const noexcept;
    Get the const iterator pointing to the beginning of the circular_buffer.

    +

    const_iterator begin() const noexcept;
    Get the const iterator pointing to the beginning of the circular_buffer.

    Exception Safety. No-throw.

    @@ -1039,7 +1039,7 @@ For detailed documentation of the
  • -
    const_iterator end() const noexcept;
    Get the const iterator pointing to the end of the circular_buffer.

    +

    const_iterator end() const noexcept;
    Get the const iterator pointing to the end of the circular_buffer.

    Exception Safety. No-throw.

    @@ -1073,7 +1073,7 @@ For detailed documentation of the
  • -
    reverse_iterator rbegin() noexcept;
    Get the iterator pointing to the beginning of the "reversed" circular_buffer.

    +

    reverse_iterator rbegin() noexcept;
    Get the iterator pointing to the beginning of the "reversed" circular_buffer.

    Exception Safety. No-throw.

    @@ -1107,7 +1107,7 @@ For detailed documentation of the
  • -
    reverse_iterator rend() noexcept;
    Get the iterator pointing to the end of the "reversed" circular_buffer.

    +

    reverse_iterator rend() noexcept;
    Get the iterator pointing to the end of the "reversed" circular_buffer.

    Exception Safety. No-throw.

    @@ -1141,7 +1141,7 @@ For detailed documentation of the
  • -
    const_reverse_iterator rbegin() const noexcept;
    Get the const iterator pointing to the beginning of the "reversed" circular_buffer.

    +

    const_reverse_iterator rbegin() const noexcept;
    Get the const iterator pointing to the beginning of the "reversed" circular_buffer.

    Exception Safety. No-throw.

    @@ -1175,7 +1175,7 @@ For detailed documentation of the
  • -
    const_reverse_iterator rend() const noexcept;
    Get the const iterator pointing to the end of the "reversed" circular_buffer.

    +

    const_reverse_iterator rend() const noexcept;
    Get the const iterator pointing to the end of the "reversed" circular_buffer.

    Exception Safety. No-throw.

    @@ -1209,7 +1209,7 @@ For detailed documentation of the
  • -
    reference operator[](size_type index);
    Get the element at the index position.

    +

    reference operator[](size_type index);
    Get the element at the index position.

    @@ -1262,7 +1262,7 @@ For detailed documentation of the

  • -
    const_reference operator[](size_type index) const;
    Get the element at the index position.

    +

    const_reference operator[](size_type index) const;
    Get the element at the index position.

    @@ -1315,7 +1315,7 @@ For detailed documentation of the

  • -
    reference at(size_type index);
    Get the element at the index position.

    +

    reference at(size_type index);
    Get the element at the index position.

    @@ -1363,7 +1363,7 @@ For detailed documentation of the
  • -
    const_reference at(size_type index) const;
    Get the element at the index position.

    +

    const_reference at(size_type index) const;
    Get the element at the index position.

    @@ -1411,7 +1411,7 @@ For detailed documentation of the
  • -
    reference front();
    Get the first element.

    +

    reference front();
    Get the first element.

    @@ -1450,7 +1450,7 @@ For detailed documentation of the
  • -
    reference back();
    Get the last element.

    +

    reference back();
    Get the last element.

    @@ -1489,7 +1489,7 @@ For detailed documentation of the
  • -
    const_reference front() const;
    Get the first element.

    +

    const_reference front() const;
    Get the first element.

    @@ -1528,7 +1528,7 @@ For detailed documentation of the
  • -
    const_reference back() const;
    Get the last element.

    +

    const_reference back() const;
    Get the last element.

    @@ -1567,7 +1567,7 @@ For detailed documentation of the
  • -
    array_range array_one();
    Get the first continuous array of the internal buffer.

    This method in combination with array_two() can be useful when passing the stored data into a legacy C API as an array. Suppose there is a circular_buffer of capacity 10, containing 7 characters 'a', 'b', ..., 'g' where buff[0] == 'a', buff[1] == 'b', ... and buff[6] == 'g':
    +

    array_range array_one();
    Get the first continuous array of the internal buffer.

    This method in combination with array_two() can be useful when passing the stored data into a legacy C API as an array. Suppose there is a circular_buffer of capacity 10, containing 7 characters 'a', 'b', ..., 'g' where buff[0] == 'a', buff[1] == 'b', ... and buff[6] == 'g':

    circular_buffer<char> buff(10);

    @@ -1646,7 +1646,7 @@ For detailed documentation of the

  • -
    array_range array_two();
    Get the second continuous array of the internal buffer.

    This method in combination with array_one() can be useful when passing the stored data into a legacy C API as an array. +

    array_range array_two();
    Get the second continuous array of the internal buffer.

    This method in combination with array_one() can be useful when passing the stored data into a legacy C API as an array.

    Exception Safety. No-throw.

    @@ -1680,7 +1680,7 @@ For detailed documentation of the
  • -
    const_array_range array_one() const;
    Get the first continuous array of the internal buffer.

    This method in combination with array_two() const can be useful when passing the stored data into a legacy C API as an array. +

    const_array_range array_one() const;
    Get the first continuous array of the internal buffer.

    This method in combination with array_two() const can be useful when passing the stored data into a legacy C API as an array.

    Exception Safety. No-throw.

    @@ -1714,7 +1714,7 @@ For detailed documentation of the
  • -
    const_array_range array_two() const;
    Get the second continuous array of the internal buffer.

    This method in combination with array_one() const can be useful when passing the stored data into a legacy C API as an array. +

    const_array_range array_two() const;
    Get the second continuous array of the internal buffer.

    This method in combination with array_one() const can be useful when passing the stored data into a legacy C API as an array.

    Exception Safety. No-throw.

    @@ -1748,7 +1748,7 @@ For detailed documentation of the
  • -
    pointer linearize();
    Linearize the internal buffer into a continuous array.

    This method can be useful when passing the stored data into a legacy C API as an array. +

    pointer linearize();
    Linearize the internal buffer into a continuous array.

    This method can be useful when passing the stored data into a legacy C API as an array.

    @@ -1796,7 +1796,7 @@ For detailed documentation of the
  • -
    bool is_linearized() const noexcept;
    Is the circular_buffer linearized?

    +

    bool is_linearized() const noexcept;
    Is the circular_buffer linearized?

    Exception Safety. No-throw.

    @@ -1830,7 +1830,7 @@ For detailed documentation of the
  • -
    void rotate(const_iterator new_begin);
    Rotate elements in the circular_buffer.

    A more effective implementation of std::rotate. +

    void rotate(const_iterator new_begin);
    Rotate elements in the circular_buffer.

    A more effective implementation of std::rotate. @@ -1892,7 +1892,7 @@ then after call to the method:

  • -
    size_type size() const noexcept;
    Get the number of elements currently stored in the circular_buffer.

    +

    size_type size() const noexcept;
    Get the number of elements currently stored in the circular_buffer.

    Exception Safety. No-throw.

    @@ -1926,7 +1926,7 @@ then after call to the method:
  • -
    size_type max_size() const noexcept;
    Get the largest possible size or capacity of the circular_buffer. (It depends on allocator's max_size()).

    +

    size_type max_size() const noexcept;
    Get the largest possible size or capacity of the circular_buffer. (It depends on allocator's max_size()).

    Exception Safety. No-throw.

    @@ -1960,7 +1960,7 @@ then after call to the method:
  • -
    bool empty() const noexcept;
    Is the circular_buffer empty?

    +

    bool empty() const noexcept;
    Is the circular_buffer empty?

    Exception Safety. No-throw.

    @@ -1994,7 +1994,7 @@ then after call to the method:
  • -
    bool full() const noexcept;
    Is the circular_buffer full?

    +

    bool full() const noexcept;
    Is the circular_buffer full?

    Exception Safety. No-throw.

    @@ -2028,7 +2028,7 @@ then after call to the method:
  • -
    size_type reserve() const noexcept;
    Get the maximum number of elements which can be inserted into the circular_buffer without overwriting any of already stored elements.

    +

    size_type reserve() const noexcept;
    Get the maximum number of elements which can be inserted into the circular_buffer without overwriting any of already stored elements.

    Exception Safety. No-throw.

    @@ -2062,7 +2062,7 @@ then after call to the method:
  • -
    capacity_type capacity() const noexcept;
    Get the capacity of the circular_buffer.

    +

    capacity_type capacity() const noexcept;
    Get the capacity of the circular_buffer.

    Exception Safety. No-throw.

    @@ -2096,7 +2096,7 @@ then after call to the method:
  • -
    void set_capacity(capacity_type new_capacity);
    Change the capacity of the circular_buffer.

    +

    void set_capacity(capacity_type new_capacity);
    Change the capacity of the circular_buffer.

    @@ -2151,7 +2151,7 @@ then after call to the method:

  • -
    void resize(size_type new_size, param_value_type item = value_type());
    Change the size of the circular_buffer.

    +

    void resize(size_type new_size, param_value_type item = value_type());
    Change the size of the circular_buffer.

    @@ -2208,7 +2208,7 @@ then after call to the method:
  • -
    void rset_capacity(capacity_type new_capacity);
    Change the capacity of the circular_buffer.

    +

    void rset_capacity(capacity_type new_capacity);
    Change the capacity of the circular_buffer.

    @@ -2263,7 +2263,7 @@ then after call to the method:

  • -
    void rresize(size_type new_size, param_value_type item = value_type());
    Change the size of the circular_buffer.

    +

    void rresize(size_type new_size, param_value_type item = value_type());
    Change the size of the circular_buffer.

    @@ -2320,7 +2320,7 @@ then after call to the method:
  • -
    void assign(size_type n, param_value_type item);
    Assign n items into the circular_buffer.

    The content of the circular_buffer will be removed and replaced with n copies of the item. +

    void assign(size_type n, param_value_type item);
    Assign n items into the circular_buffer.

    The content of the circular_buffer will be removed and replaced with n copies of the item.

    @@ -2374,7 +2374,7 @@ then after call to the method:
  • -
    void assign(capacity_type buffer_capacity, size_type n, param_value_type item);
    Assign n items into the circular_buffer specifying the capacity.

    The capacity of the circular_buffer will be set to the specified value and the content of the circular_buffer will be removed and replaced with n copies of the item. +

    void assign(capacity_type buffer_capacity, size_type n, param_value_type item);
    Assign n items into the circular_buffer specifying the capacity.

    The capacity of the circular_buffer will be set to the specified value and the content of the circular_buffer will be removed and replaced with n copies of the item. @@ -2438,7 +2438,7 @@ then after call to the method:

  • template<typename InputIterator> 
-  void assign(InputIterator first, InputIterator last);
    Assign a copy of the range into the circular_buffer.

    The content of the circular_buffer will be removed and replaced with copies of elements from the specified range. + void assign(InputIterator first, InputIterator last);Assign a copy of the range into the circular_buffer.

    The content of the circular_buffer will be removed and replaced with copies of elements from the specified range. @@ -2499,7 +2499,7 @@ then after call to the method:

  • template<typename InputIterator> 
-  void assign(capacity_type buffer_capacity, InputIterator first, 
+  void assign(capacity_type buffer_capacity, InputIterator first, 
               InputIterator last);
    Assign a copy of the range into the circular_buffer specifying the capacity.

    The capacity of the circular_buffer will be set to the specified value and the content of the circular_buffer will be removed and replaced with copies of elements from the specified range. @@ -2566,7 +2566,7 @@ then after call to the method:

  • -
    void swap(circular_buffer< T, Alloc > & cb) noexcept;
    Swap the contents of two circular_buffers.

    +

    void swap(circular_buffer< T, Alloc > & cb) noexcept;
    Swap the contents of two circular_buffers.

    @@ -2614,7 +2614,7 @@ then after call to the method:
  • -
    void push_back(param_value_type item);
    Insert a new element at the end of the circular_buffer.

    +

    void push_back(param_value_type item);
    Insert a new element at the end of the circular_buffer.

    @@ -2663,7 +2663,7 @@ then after call to the method:
  • -
    void push_back(rvalue_type item);
    Insert a new element at the end of the circular_buffer using rvalue references or rvalues references emulation.

    +

    void push_back(rvalue_type item);
    Insert a new element at the end of the circular_buffer using rvalue references or rvalues references emulation.

    @@ -2712,7 +2712,7 @@ then after call to the method:
  • -
    void push_back();
    Insert a new default-constructed element at the end of the circular_buffer.

    +

    void push_back();
    Insert a new default-constructed element at the end of the circular_buffer.

    Exception Safety. Basic; no-throw if the operation in the Throws section does not throw anything.

    @@ -2747,7 +2747,7 @@ then after call to the method:
  • -
    void push_front(param_value_type item);
    Insert a new element at the beginning of the circular_buffer.

    +

    void push_front(param_value_type item);
    Insert a new element at the beginning of the circular_buffer.

    @@ -2796,7 +2796,7 @@ then after call to the method:
  • -
    void push_front(rvalue_type item);
    Insert a new element at the beginning of the circular_buffer using rvalue references or rvalues references emulation.

    +

    void push_front(rvalue_type item);
    Insert a new element at the beginning of the circular_buffer using rvalue references or rvalues references emulation.

    @@ -2845,7 +2845,7 @@ then after call to the method:
  • -
    void push_front();
    Insert a new default-constructed element at the beginning of the circular_buffer.

    +

    void push_front();
    Insert a new default-constructed element at the beginning of the circular_buffer.

    Exception Safety. Basic; no-throw if the operation in the Throws section does not throw anything.

    @@ -2880,7 +2880,7 @@ then after call to the method:
  • -
    void pop_back();
    Remove the last element from the circular_buffer.

    +

    void pop_back();
    Remove the last element from the circular_buffer.

    @@ -2919,7 +2919,7 @@ then after call to the method:
  • -
    void pop_front();
    Remove the first element from the circular_buffer.

    +

    void pop_front();
    Remove the first element from the circular_buffer.

    @@ -2958,7 +2958,7 @@ then after call to the method:
  • -
    iterator insert(iterator pos, param_value_type item);
    Insert an element at the specified position.

    +

    iterator insert(iterator pos, param_value_type item);
    Insert an element at the specified position.

    @@ -3023,7 +3023,7 @@ then after call to the method:

  • -
    iterator insert(iterator pos, rvalue_type item);
    Insert an element at the specified position.

    +

    iterator insert(iterator pos, rvalue_type item);
    Insert an element at the specified position.

    @@ -3088,7 +3088,7 @@ then after call to the method:

  • -
    iterator insert(iterator pos);
    Insert a default-constructed element at the specified position.

    +

    iterator insert(iterator pos);
    Insert a default-constructed element at the specified position.

    @@ -3147,7 +3147,7 @@ then after call to the method:

  • -
    void insert(iterator pos, size_type n, param_value_type item);
    Insert n copies of the item at the specified position.

    +

    void insert(iterator pos, size_type n, param_value_type item);
    Insert n copies of the item at the specified position.

    @@ -3229,7 +3229,7 @@ The number of min[pos - begin(), max[0, n - reserve 

  • template<typename InputIterator> 
-  void insert(iterator pos, InputIterator first, InputIterator last);
    Insert the range [first, last) at the specified position.

    + void insert(iterator pos, InputIterator first, InputIterator last);Insert the range [first, last) at the specified position.

    @@ -3312,7 +3312,7 @@ The number of min[pos - begin(), max[0, distance(fi

  • -
    iterator rinsert(iterator pos, param_value_type item);
    Insert an element before the specified position.

    +

    iterator rinsert(iterator pos, param_value_type item);
    Insert an element before the specified position.

    @@ -3377,7 +3377,7 @@ The number of min[pos - begin(), max[0, distance(fi

  • -
    iterator rinsert(iterator pos, rvalue_type item);
    Insert an element before the specified position.

    +

    iterator rinsert(iterator pos, rvalue_type item);
    Insert an element before the specified position.

    @@ -3442,7 +3442,7 @@ The number of min[pos - begin(), max[0, distance(fi

  • -
    iterator rinsert(iterator pos);
    Insert an element before the specified position.

    +

    iterator rinsert(iterator pos);
    Insert an element before the specified position.

    @@ -3501,7 +3501,7 @@ The number of min[pos - begin(), max[0, distance(fi

  • -
    void rinsert(iterator pos, size_type n, param_value_type item);
    Insert n copies of the item before the specified position.

    +

    void rinsert(iterator pos, size_type n, param_value_type item);
    Insert n copies of the item before the specified position.

    @@ -3583,7 +3583,7 @@ The number of min[end() - pos, max[0, n - reserve() 

  • template<typename InputIterator> 
-  void rinsert(iterator pos, InputIterator first, InputIterator last);
    Insert the range [first, last) before the specified position.

    + void rinsert(iterator pos, InputIterator first, InputIterator last);Insert the range [first, last) before the specified position.

    @@ -3666,7 +3666,7 @@ The number of min[end() - pos, max[0, distance(firs

  • -
    iterator erase(iterator pos);
    Remove an element at the specified position.

    +

    iterator erase(iterator pos);
    Remove an element at the specified position.

    @@ -3724,7 +3724,7 @@ The number of min[end() - pos, max[0, distance(firs

  • -
    iterator erase(iterator first, iterator last);
    Erase the range [first, last).

    +

    iterator erase(iterator first, iterator last);
    Erase the range [first, last).

    @@ -3788,7 +3788,7 @@ The number of min[end() - pos, max[0, distance(firs

  • -
    iterator rerase(iterator pos);
    Remove an element at the specified position.

    +

    iterator rerase(iterator pos);
    Remove an element at the specified position.

    @@ -3855,7 +3855,7 @@ The number of min[end() - pos, max[0, distance(firs

  • -
    iterator rerase(iterator first, iterator last);
    Erase the range [first, last).

    +

    iterator rerase(iterator first, iterator last);
    Erase the range [first, last).

    @@ -3928,7 +3928,7 @@ The number of min[end() - pos, max[0, distance(firs

  • -
    void erase_begin(size_type n);
    Remove first n elements (with constant complexity for scalar types).

    +

    void erase_begin(size_type n);
    Remove first n elements (with constant complexity for scalar types).

    @@ -3990,7 +3990,7 @@ The number of min[end() - pos, max[0, distance(firs

  • -
    void erase_end(size_type n);
    Remove last n elements (with constant complexity for scalar types).

    +

    void erase_end(size_type n);
    Remove last n elements (with constant complexity for scalar types).

    @@ -4052,7 +4052,7 @@ The number of min[end() - pos, max[0, distance(firs

  • -
    void clear() noexcept;
    Remove all stored elements from the circular_buffer.

    +

    void clear() noexcept;
    Remove all stored elements from the circular_buffer.

    Exception Safety. No-throw.

    @@ -4088,178 +4088,178 @@ The number of min[end() - pos, max[0, distance(firs
    -

    -circular_buffer private member functions

    +

    +circular_buffer private member functions

      -
    1. template<typename ValT> void push_back_impl(ValT item);
      2. -
    2. template<typename ValT> void push_front_impl(ValT item);
      3. -
    3. template<typename ValT> iterator insert_impl(iterator pos, ValT item);
      4. -
    4. template<typename ValT> iterator rinsert_impl(iterator pos, ValT item);
      5. +
    5. template<typename ValT> void push_back_impl(ValT item);
      6. +
    6. template<typename ValT> void push_front_impl(ValT item);
      7. +
    7. template<typename ValT> iterator insert_impl(iterator pos, ValT item);
      8. +
    8. template<typename ValT> iterator rinsert_impl(iterator pos, ValT item);
    9. -
      void check_position(size_type index) const;
      Check if the index is valid.
      10. +
      void check_position(size_type index) const;
      Check if the index is valid.
    10. -
      template<typename Pointer> void increment(Pointer & p) const;
      Increment the pointer.
      11. +
      template<typename Pointer> void increment(Pointer & p) const;
      Increment the pointer.
    11. -
      template<typename Pointer> void decrement(Pointer & p) const;
      Decrement the pointer.
      12. +
      template<typename Pointer> void decrement(Pointer & p) const;
      Decrement the pointer.
    12. -
      template<typename Pointer> Pointer add(Pointer p, difference_type n) const;
      Add n to the pointer.
      13. +
      template<typename Pointer> Pointer add(Pointer p, difference_type n) const;
      Add n to the pointer.
    13. -
      template<typename Pointer> Pointer sub(Pointer p, difference_type n) const;
      Subtract n from the pointer.
      14. +
      template<typename Pointer> Pointer sub(Pointer p, difference_type n) const;
      Subtract n from the pointer.
    14. -
      pointer map_pointer(pointer p) const;
      Map the null pointer to virtual end of circular buffer.
      15. +
      pointer map_pointer(pointer p) const;
      Map the null pointer to virtual end of circular buffer.
    15. -
      pointer allocate(size_type n);
      Allocate memory.
      16. +
      pointer allocate(size_type n);
      Allocate memory.
    16. -
      void deallocate(pointer p, size_type n);
      Deallocate memory.
      17. +
      void deallocate(pointer p, size_type n);
      Deallocate memory.
    17. -
      bool is_uninitialized(const_pointer p) const noexcept;
      Does the pointer point to the uninitialized memory?
      18. +
      bool is_uninitialized(const_pointer p) const noexcept;
      Does the pointer point to the uninitialized memory?
    18. -
      void replace(pointer pos, param_value_type item);
      Replace an element.
      19. +
      void replace(pointer pos, param_value_type item);
      Replace an element.
    19. -
      void replace(pointer pos, rvalue_type item);
      Replace an element.
      20. +
      void replace(pointer pos, rvalue_type item);
      Replace an element.
    20. -
      void construct_or_replace(bool construct, pointer pos, param_value_type item);
      Construct or replace an element.

      construct has to be set to true if and only if pos points to an uninitialized memory.

      +
      void construct_or_replace(bool construct, pointer pos, param_value_type item);
      Construct or replace an element.

      construct has to be set to true if and only if pos points to an uninitialized memory.

    21. -
      void construct_or_replace(bool construct, pointer pos, rvalue_type item);
      Construct or replace an element.

      construct has to be set to true if and only if pos points to an uninitialized memory.

      +
      void construct_or_replace(bool construct, pointer pos, rvalue_type item);
      Construct or replace an element.

      construct has to be set to true if and only if pos points to an uninitialized memory.

    22. -
      void destroy_item(pointer p);
      Destroy an item.
      23. +
      void destroy_item(pointer p);
      Destroy an item.
    23. -
      void destroy_if_constructed(pointer pos);
      Destroy an item only if it has been constructed.
      24. +
      void destroy_if_constructed(pointer pos);
      Destroy an item only if it has been constructed.
    24. -
      void destroy_content();
      Destroy the whole content of the circular buffer.
      25. +
      void destroy_content();
      Destroy the whole content of the circular buffer.
    25. -
      void destroy_content(const true_type &);
      Specialized destroy_content method.
      26. +
      void destroy_content(const true_type &);
      Specialized destroy_content method.
    26. -
      void destroy_content(const false_type &);
      Specialized destroy_content method.
      27. +
      void destroy_content(const false_type &);
      Specialized destroy_content method.
    27. -
      void destroy() noexcept;
      Destroy content and free allocated memory.
      28. +
      void destroy() noexcept;
      Destroy content and free allocated memory.
    28. -
      void initialize_buffer(capacity_type buffer_capacity);
      Initialize the internal buffer.
      29. +
      void initialize_buffer(capacity_type buffer_capacity);
      Initialize the internal buffer.
    29. -
      void initialize_buffer(capacity_type buffer_capacity, param_value_type item);
      Initialize the internal buffer.
      30. +
      void initialize_buffer(capacity_type buffer_capacity, param_value_type item);
      Initialize the internal buffer. 
    30. template<typename IntegralType> 
-  void initialize(IntegralType n, IntegralType item, const true_type &);
      Specialized initialize method.
      31. + void initialize(IntegralType n, IntegralType item, const true_type &);Specialized initialize method. 
    31. template<typename Iterator> 
-  void initialize(Iterator first, Iterator last, const false_type &);
      Specialized initialize method.
      32. + void initialize(Iterator first, Iterator last, const false_type &);Specialized initialize method. 
    32. template<typename InputIterator> 
-  void initialize(InputIterator first, InputIterator last, 
+  void initialize(InputIterator first, InputIterator last, 
                   const std::input_iterator_tag &);
      Specialized initialize method. 
    33. template<typename ForwardIterator> 
-  void initialize(ForwardIterator first, ForwardIterator last, 
+  void initialize(ForwardIterator first, ForwardIterator last, 
                   const std::forward_iterator_tag &);
      Specialized initialize method. 
    34. template<typename IntegralType> 
-  void initialize(capacity_type buffer_capacity, IntegralType n, 
+  void initialize(capacity_type buffer_capacity, IntegralType n, 
                   IntegralType item, const true_type &);
      Specialized initialize method. 
    35. template<typename Iterator> 
-  void initialize(capacity_type buffer_capacity, Iterator first, 
+  void initialize(capacity_type buffer_capacity, Iterator first, 
                   Iterator last, const false_type &);
      Specialized initialize method. 
    36. template<typename InputIterator> 
-  void initialize(capacity_type buffer_capacity, InputIterator first, 
+  void initialize(capacity_type buffer_capacity, InputIterator first, 
                   InputIterator last, const std::input_iterator_tag &);
      Specialized initialize method. 
    37. template<typename ForwardIterator> 
-  void initialize(capacity_type buffer_capacity, ForwardIterator first, 
+  void initialize(capacity_type buffer_capacity, ForwardIterator first, 
                   ForwardIterator last, const std::forward_iterator_tag &);
      Specialized initialize method. 
    38. template<typename ForwardIterator> 
-  void initialize(capacity_type buffer_capacity, ForwardIterator first, 
+  void initialize(capacity_type buffer_capacity, ForwardIterator first, 
                   ForwardIterator last, size_type distance);
      Initialize the circular buffer.
    39. -
      void reset(pointer buff, pointer last, capacity_type new_capacity);
      Reset the circular buffer.
      40. +
      void reset(pointer buff, pointer last, capacity_type new_capacity);
      Reset the circular buffer.
    40. -
      void swap_allocator(circular_buffer< T, Alloc > &, const true_type &);
      Specialized method for swapping the allocator.
      41. +
      void swap_allocator(circular_buffer< T, Alloc > &, const true_type &);
      Specialized method for swapping the allocator.
    41. -
      void swap_allocator(circular_buffer< T, Alloc > & cb, const false_type &);
      Specialized method for swapping the allocator.
      42. +
      void swap_allocator(circular_buffer< T, Alloc > & cb, const false_type &);
      Specialized method for swapping the allocator. 
    42. template<typename IntegralType> 
-  void assign(IntegralType n, IntegralType item, const true_type &);
      Specialized assign method.
      43. + void assign(IntegralType n, IntegralType item, const true_type &);Specialized assign method. 
    43. template<typename Iterator> 
-  void assign(Iterator first, Iterator last, const false_type &);
      Specialized assign method.
      44. + void assign(Iterator first, Iterator last, const false_type &);Specialized assign method. 
    44. template<typename InputIterator> 
-  void assign(InputIterator first, InputIterator last, 
+  void assign(InputIterator first, InputIterator last, 
               const std::input_iterator_tag &);
      Specialized assign method. 
    45. template<typename ForwardIterator> 
-  void assign(ForwardIterator first, ForwardIterator last, 
+  void assign(ForwardIterator first, ForwardIterator last, 
               const std::forward_iterator_tag &);
      Specialized assign method. 
    46. template<typename IntegralType> 
-  void assign(capacity_type new_capacity, IntegralType n, IntegralType item, 
+  void assign(capacity_type new_capacity, IntegralType n, IntegralType item, 
               const true_type &);
      Specialized assign method. 
    47. template<typename Iterator> 
-  void assign(capacity_type new_capacity, Iterator first, Iterator last, 
+  void assign(capacity_type new_capacity, Iterator first, Iterator last, 
               const false_type &);
      Specialized assign method. 
    48. template<typename InputIterator> 
-  void assign(capacity_type new_capacity, InputIterator first, 
+  void assign(capacity_type new_capacity, InputIterator first, 
               InputIterator last, const std::input_iterator_tag &);
      Specialized assign method. 
    49. template<typename ForwardIterator> 
-  void assign(capacity_type new_capacity, ForwardIterator first, 
+  void assign(capacity_type new_capacity, ForwardIterator first, 
               ForwardIterator last, const std::forward_iterator_tag &);
      Specialized assign method. 
    50. template<typename Functor> 
-  void assign_n(capacity_type new_capacity, size_type n, const Functor & fnc);
      Helper assign method.
      51. + void assign_n(capacity_type new_capacity, size_type n, const Functor & fnc);Helper assign method.
    51. -
      template<typename ValT> iterator insert_item(const iterator & pos, ValT item);
      Helper insert method.
      52. +
      template<typename ValT> iterator insert_item(const iterator & pos, ValT item);
      Helper insert method. 
    52. template<typename IntegralType> 
-  void insert(const iterator & pos, IntegralType n, IntegralType item, 
+  void insert(const iterator & pos, IntegralType n, IntegralType item, 
               const true_type &);
      Specialized insert method. 
    53. template<typename Iterator> 
-  void insert(const iterator & pos, Iterator first, Iterator last, 
+  void insert(const iterator & pos, Iterator first, Iterator last, 
               const false_type &);
      Specialized insert method. 
    54. template<typename InputIterator> 
-  void insert(iterator pos, InputIterator first, InputIterator last, 
+  void insert(iterator pos, InputIterator first, InputIterator last, 
               const std::input_iterator_tag &);
      Specialized insert method. 
    55. template<typename ForwardIterator> 
-  void insert(const iterator & pos, ForwardIterator first, 
+  void insert(const iterator & pos, ForwardIterator first, 
               ForwardIterator last, const std::forward_iterator_tag &);
      Specialized insert method. 
    56. template<typename Wrapper> 
-  void insert_n(const iterator & pos, size_type n, const Wrapper & wrapper);
      Helper insert method.
      57. + void insert_n(const iterator & pos, size_type n, const Wrapper & wrapper);Helper insert method. 
    57. template<typename IntegralType> 
-  void rinsert(const iterator & pos, IntegralType n, IntegralType item, 
+  void rinsert(const iterator & pos, IntegralType n, IntegralType item, 
                const true_type &);
      Specialized rinsert method. 
    58. template<typename Iterator> 
-  void rinsert(const iterator & pos, Iterator first, Iterator last, 
+  void rinsert(const iterator & pos, Iterator first, Iterator last, 
                const false_type &);
      Specialized rinsert method. 
    59. template<typename InputIterator> 
-  void rinsert(iterator pos, InputIterator first, InputIterator last, 
+  void rinsert(iterator pos, InputIterator first, InputIterator last, 
                const std::input_iterator_tag &);
      Specialized insert method. 
    60. template<typename ForwardIterator> 
-  void rinsert(const iterator & pos, ForwardIterator first, 
+  void rinsert(const iterator & pos, ForwardIterator first, 
                ForwardIterator last, const std::forward_iterator_tag &);
      Specialized rinsert method. 
    61. template<typename Wrapper> 
-  void rinsert_n(const iterator & pos, size_type n, const Wrapper & wrapper);
      Helper rinsert method.
      62. + void rinsert_n(const iterator & pos, size_type n, const Wrapper & wrapper);Helper rinsert method.
    62. -
      void erase_begin(size_type n, const true_type &);
      Specialized erase_begin method.
      63. +
      void erase_begin(size_type n, const true_type &);
      Specialized erase_begin method.
    63. -
      void erase_begin(size_type n, const false_type &);
      Specialized erase_begin method.
      64. +
      void erase_begin(size_type n, const false_type &);
      Specialized erase_begin method.
    64. -
      void erase_end(size_type n, const true_type &);
      Specialized erase_end method.
      65. +
      void erase_end(size_type n, const true_type &);
      Specialized erase_end method.
    65. -
      void erase_end(size_type n, const false_type &);
      Specialized erase_end method.
      66. +
      void erase_end(size_type n, const false_type &);
      Specialized erase_end method.
    @@ -4274,7 +4274,7 @@ The number of min[end() - pos, max[0, distance(firs
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/circular_idm45713141954256.html b/doc/html/boost/circular_idm45713141954256.html new file mode 100644 index 0000000000..a76525db72 --- /dev/null +++ b/doc/html/boost/circular_idm45713141954256.html @@ -0,0 +1,2828 @@ + + + + +Class template circular_buffer_space_optimized + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Class template circular_buffer_space_optimized

    +

    boost::circular_buffer_space_optimized — Space optimized circular buffer container adaptor. T must be a copyable class or must have an noexcept move constructor and move assignment operator.

    +
    +

    Synopsis

    +
    // In header: <boost/circular_buffer/space_optimized.hpp>
+
+template<typename T, typename Alloc> 
+class circular_buffer_space_optimized :
+  private boost::circular_buffer< T, Alloc >
+{
+public:
+  // types
+  typedef circular_buffer< T, Alloc >::value_type             value_type;            
+  typedef circular_buffer< T, Alloc >::pointer                pointer;               
+  typedef circular_buffer< T, Alloc >::const_pointer          const_pointer;         
+  typedef circular_buffer< T, Alloc >::reference              reference;             
+  typedef circular_buffer< T, Alloc >::const_reference        const_reference;       
+  typedef circular_buffer< T, Alloc >::size_type              size_type;             
+  typedef circular_buffer< T, Alloc >::difference_type        difference_type;       
+  typedef circular_buffer< T, Alloc >::allocator_type         allocator_type;        
+  typedef circular_buffer< T, Alloc >::const_iterator         const_iterator;        
+  typedef circular_buffer< T, Alloc >::iterator               iterator;              
+  typedef circular_buffer< T, Alloc >::const_reverse_iterator const_reverse_iterator;
+  typedef circular_buffer< T, Alloc >::reverse_iterator       reverse_iterator;      
+  typedef circular_buffer< T, Alloc >::array_range            array_range;           
+  typedef circular_buffer< T, Alloc >::const_array_range      const_array_range;     
+  typedef circular_buffer< T, Alloc >::param_value_type       param_value_type;      
+  typedef circular_buffer< T, Alloc >::rvalue_type            rvalue_type;           
+  typedef cb_details::capacity_control< size_type >           capacity_type;         
+
+  // construct/copy/destruct
+  explicit circular_buffer_space_optimized(const allocator_type & = allocator_type()) noexcept;
+  explicit circular_buffer_space_optimized(capacity_type, 
+                                           const allocator_type & = allocator_type());
+  circular_buffer_space_optimized(capacity_type, param_value_type, 
+                                  const allocator_type & = allocator_type());
+  circular_buffer_space_optimized(capacity_type, size_type, param_value_type, 
+                                  const allocator_type & = allocator_type());
+  circular_buffer_space_optimized(const circular_buffer_space_optimized< T, Alloc > &);
+  circular_buffer_space_optimized(circular_buffer_space_optimized< T, Alloc > &&) noexcept;
+  template<typename InputIterator> 
+    circular_buffer_space_optimized(InputIterator, InputIterator, 
+                                    const allocator_type & = allocator_type());
+  template<typename InputIterator> 
+    circular_buffer_space_optimized(capacity_type, InputIterator, 
+                                    InputIterator, 
+                                    const allocator_type & = allocator_type());
+  circular_buffer_space_optimized< T, Alloc > & 
+  operator=(const circular_buffer_space_optimized< T, Alloc > &);
+  circular_buffer_space_optimized< T, Alloc > & 
+  operator=(circular_buffer_space_optimized< T, Alloc > &&) noexcept;
+
+  // public member functions
+  bool full() const noexcept;
+  size_type reserve() const noexcept;
+  const capacity_type & capacity() const noexcept;
+  void set_capacity(const capacity_type &);
+  void resize(size_type, param_value_type = value_type());
+  void rset_capacity(const capacity_type &);
+  void rresize(size_type, param_value_type = value_type());
+  void assign(size_type, param_value_type);
+  void assign(capacity_type, size_type, param_value_type);
+  template<typename InputIterator> void assign(InputIterator, InputIterator);
+  template<typename InputIterator> 
+    void assign(capacity_type, InputIterator, InputIterator);
+  void swap(circular_buffer_space_optimized< T, Alloc > &) noexcept;
+  void push_back(param_value_type);
+  void push_back(rvalue_type);
+  void push_back();
+  void push_front(param_value_type);
+  void push_front(rvalue_type);
+  void push_front();
+  void pop_back();
+  void pop_front();
+  iterator insert(iterator, param_value_type);
+  iterator insert(iterator, rvalue_type);
+  iterator insert(iterator);
+  void insert(iterator, size_type, param_value_type);
+  template<typename InputIterator> 
+    void insert(iterator, InputIterator, InputIterator);
+  iterator rinsert(iterator, param_value_type);
+  iterator rinsert(iterator, rvalue_type);
+  iterator rinsert(iterator);
+  void rinsert(iterator, size_type, param_value_type);
+  template<typename InputIterator> 
+    void rinsert(iterator, InputIterator, InputIterator);
+  iterator erase(iterator);
+  iterator erase(iterator, iterator);
+  iterator rerase(iterator);
+  iterator rerase(iterator, iterator);
+  void clear();
+
+  // private member functions
+  void adjust_min_capacity();
+  size_type ensure_reserve(size_type, size_type) const;
+  void check_low_capacity(size_type = 1);
+  void check_high_capacity();
+  void reduce_capacity(const true_type &);
+  void reduce_capacity(const false_type &);
+  template<typename IntegralType> 
+    void insert(const iterator &, IntegralType, IntegralType, 
+                const true_type &);
+  template<typename Iterator> 
+    void insert(const iterator &, Iterator, Iterator, const false_type &);
+  template<typename IntegralType> 
+    void rinsert(const iterator &, IntegralType, IntegralType, 
+                 const true_type &);
+  template<typename Iterator> 
+    void rinsert(const iterator &, Iterator, Iterator, const false_type &);
+
+  // private static functions
+  static size_type init_capacity(const capacity_type &, size_type);
+  template<typename IntegralType> 
+    static size_type 
+    init_capacity(const capacity_type &, IntegralType, IntegralType, 
+                  const true_type &);
+  template<typename Iterator> 
+    static size_type 
+    init_capacity(const capacity_type &, Iterator, Iterator, 
+                  const false_type &);
+  template<typename InputIterator> 
+    static size_type 
+    init_capacity(const capacity_type &, InputIterator, InputIterator, 
+                  const std::input_iterator_tag &);
+  template<typename ForwardIterator> 
+    static size_type 
+    init_capacity(const capacity_type &, ForwardIterator, ForwardIterator, 
+                  const std::forward_iterator_tag &);
+};
    +
    +

    Description

    +
    +

    +circular_buffer_space_optimized + public + types

    +
    1. +

      +typedef cb_details::capacity_control< size_type > capacity_type;

      +

      Capacity controller of the space optimized circular buffer.

      +

      See Also:

      +

      capacity_control in details.hpp.

      +

      + class capacity_control
      + {
      + size_type m_capacity; // Available capacity.
      + size_type m_min_capacity; // Minimum capacity.
      + public:
      + capacity_control(size_type capacity, size_type min_capacity = 0)
      + : m_capacity(capacity), m_min_capacity(min_capacity)
      + {};
      + size_type capacity() const { return m_capacity; }
      + size_type min_capacity() const { return m_min_capacity; }
      + operator size_type() const { return m_capacity; }
      + };
      +

      +

      Always capacity >= min_capacity.

      +

      The capacity() represents the capacity of the circular_buffer_space_optimized and the min_capacity() determines the minimal allocated size of its internal buffer.

      +

      The converting constructor of the capacity_control allows implicit conversion from size_type-like types which ensures compatibility of creating an instance of the circular_buffer_space_optimized with other STL containers.

      +

      On the other hand the operator size_type() provides implicit conversion to the size_type which allows to treat the capacity of the circular_buffer_space_optimized the same way as in the circular_buffer.

      +
    +
    +
    +

    +circular_buffer_space_optimized + public + construct/copy/destruct

    +
      +
    1. +
      explicit circular_buffer_space_optimized(const allocator_type & alloc = allocator_type()) noexcept;
      Create an empty space optimized circular buffer with zero capacity.

      + + +

      +

      Complexity. Constant.

      +

      +

      +
      + + + + + +
      [Warning]Warning

      Since Boost version 1.36 the behaviour of this constructor has changed. Now it creates a space optimized circular buffer with zero capacity.

      +

      +

      +
      ++++ + + + + + + + + + + + + + + +

      Parameters:

      ++++ + + + + +

      alloc

      The allocator.

      Postconditions:

      capacity().capacity() == 0 && capacity().min_capacity() == 0 && size() == 0

      Throws:

      		Nothing.
      +
      2. +
    2. +
      explicit circular_buffer_space_optimized(capacity_type capacity_ctrl, 
+                                         const allocator_type & alloc = allocator_type());
      Create an empty space optimized circular buffer with the specified capacity.

      + + +

      +

      Complexity. Constant.

      +

      +

      +
      ++++ + + + + + + + + + + + + + + +

      Parameters:

      ++++ + + + + + + + + + + +

      alloc

      The allocator.

      capacity_ctrl

      The capacity controller representing the maximum number of elements which can be stored in the circular_buffer_space_optimized and the minimal allocated size of the internal buffer.

      Postconditions:

      capacity() == capacity_ctrl && size() == 0
      +
      + The amount of allocated memory in the internal buffer is capacity_ctrl.min_capacity().

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used).
      +
      3. +
    3. +
      circular_buffer_space_optimized(capacity_type capacity_ctrl, 
+                                param_value_type item, 
+                                const allocator_type & alloc = allocator_type());
      Create a full space optimized circular buffer with the specified capacity filled with capacity_ctrl.capacity() copies of item.

      + + +

      +

      Complexity. Linear (in the capacity_ctrl.capacity()).

      +

      +

      +
      ++++ + + + + + + + + + + + + + + +

      Parameters:

      ++++ + + + + + + + + + + + + + + +

      alloc

      The allocator.

      capacity_ctrl

      The capacity controller representing the maximum number of elements which can be stored in the circular_buffer_space_optimized and the minimal allocated size of the internal buffer.

      item

      The element the created circular_buffer_space_optimized will be filled with.

      Postconditions:

      capacity() == capacity_ctrl && full() && (*this)[0] == item && (*this)[1] == item && ... && (*this) [capacity_ctrl.capacity() - 1] == item
      +
      + The amount of allocated memory in the internal buffer is capacity_ctrl.capacity().

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). T::T(const T&) throws.
      +
      4. +
    4. +
      circular_buffer_space_optimized(capacity_type capacity_ctrl, size_type n, 
+                                param_value_type item, 
+                                const allocator_type & alloc = allocator_type());
      Create a space optimized circular buffer with the specified capacity filled with n copies of item.

      + + + +

      +

      Complexity. Linear (in the n).

      +

      +

      +
      ++++ + + + + + + + + + + + + + + + + + + +

      Parameters:

      ++++ + + + + + + + + + + + + + + + + + + +

      alloc

      The allocator.

      capacity_ctrl

      The capacity controller representing the maximum number of elements which can be stored in the circular_buffer_space_optimized and the minimal allocated size of the internal buffer.

      item

      The element the created circular_buffer_space_optimized will be filled with.

      n

      The number of elements the created circular_buffer_space_optimized will be filled with.

      Requires:

      capacity_ctrl.capacity() >= n

      Postconditions:

      capacity() == capacity_ctrl && size() == n && (*this)[0] == item && (*this)[1] == item && ... && (*this)[n - 1] == item
      +
      + The amount of allocated memory in the internal buffer is max[n, capacity_ctrl.min_capacity()].

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws.
      +
      5. +
    5. +
      circular_buffer_space_optimized(const circular_buffer_space_optimized< T, Alloc > & cb);
      The copy constructor.

      Creates a copy of the specified circular_buffer_space_optimized. + + +

      +

      Complexity. Linear (in the size of cb).

      +

      +

      +
      ++++ + + + + + + + + + + + + + + +

      Parameters:

      ++++ + + + + +

      cb

      The circular_buffer_space_optimized to be copied.

      Postconditions:

      *this == cb
      +
      + The amount of allocated memory in the internal buffer is cb.size().

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws.
      +
      6. +
    6. +
      circular_buffer_space_optimized(circular_buffer_space_optimized< T, Alloc > && cb) noexcept;
      The move constructor.

      Move constructs a circular_buffer_space_optimized from cb, leaving cb empty. + + + +

      +

      Constant. 

      +

      +

      +
      ++++ + + + + + + + + + + + + + + + + + + +

      Parameters:

      ++++ + + + + +

      cb

      circular_buffer to 'steal' value from.

      Requires:

      C++ compiler with rvalue references support.

      Postconditions:

      cb.empty()

      Throws:

      		Nothing.
      +
      7. +
    7. +
      template<typename InputIterator> 
+  circular_buffer_space_optimized(InputIterator first, InputIterator last, 
+                                  const allocator_type & alloc = allocator_type());
      Create a full space optimized circular buffer filled with a copy of the range.

      + + + +

      +

      Complexity. Linear (in the std::distance(first, last)).

      +

      +

      +
      ++++ + + + + + + + + + + + + + + + + + + +

      Parameters:

      ++++ + + + + + + + + + + + + + + +

      alloc

      The allocator.

      first

      The beginning of the range to be copied.

      last

      The end of the range to be copied.

      Requires:

      Valid range [first, last).
      + first and last have to meet the requirements of InputIterator.

      Postconditions:

      capacity().capacity() == std::distance(first, last) && capacity().min_capacity() == 0 && full() && (*this)[0]== *first && (*this)[1] == *(first + 1) && ... && (*this)[std::distance(first, last) - 1] == *(last - 1)
      +
      + The amount of allocated memory in the internal buffer is std::distance(first, last).

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept and InputIterator is a move iterator.
      +
      8. +
    8. +
      template<typename InputIterator> 
+  circular_buffer_space_optimized(capacity_type capacity_ctrl, 
+                                  InputIterator first, InputIterator last, 
+                                  const allocator_type & alloc = allocator_type());
      Create a space optimized circular buffer with the specified capacity (and the minimal guaranteed amount of allocated memory) filled with a copy of the range.

      + + + +

      +

      Complexity. Linear (in std::distance(first, last); in min[capacity_ctrl.capacity(), std::distance(first, last)] if the InputIterator is a RandomAccessIterator).

      +

      +

      +
      ++++ + + + + + + + + + + + + + + + + + + +

      Parameters:

      ++++ + + + + + + + + + + + + + + + + + + +

      alloc

      The allocator.

      capacity_ctrl

      The capacity controller representing the maximum number of elements which can be stored in the circular_buffer_space_optimized and the minimal allocated size of the internal buffer.

      first

      The beginning of the range to be copied.

      last

      The end of the range to be copied.

      Requires:

      Valid range [first, last).
      + first and last have to meet the requirements of InputIterator.

      Postconditions:

      capacity() == capacity_ctrl && size() <= std::distance(first, last) && (*this)[0]== (last - capacity_ctrl.capacity()) && (*this)[1] == *(last - capacity_ctrl.capacity() + 1) && ... && (*this)[capacity_ctrl.capacity() - 1] == *(last - 1)
      +
      + If the number of items to be copied from the range [first, last) is greater than the specified capacity_ctrl.capacity() then only elements from the range [last - capacity_ctrl.capacity(), last) will be copied.
      +
      + The amount of allocated memory in the internal buffer is max[capacity_ctrl.min_capacity(), min[capacity_ctrl.capacity(), std::distance(first, last)]].

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws.
      +
      9. +
    9. +
      circular_buffer_space_optimized< T, Alloc > & 
+operator=(const circular_buffer_space_optimized< T, Alloc > & cb);
      The assign operator.

      Makes this circular_buffer_space_optimized to become a copy of the specified circular_buffer_space_optimized. + + +

      +

      Exception Safety. Strong.

      +

      +

      +

      Iterator Invalidation. Invalidates all iterators pointing to this circular_buffer_space_optimized (except iterators equal to end()).

      +

      +

      +

      Complexity. Linear (in the size of cb).

      +

      +

      +

      See Also:

      +

      assign(size_type, const_reference), assign(capacity_type, size_type, const_reference), assign(InputIterator, InputIterator), assign(capacity_type, InputIterator, InputIterator)

      +

      +

      +
      ++++ + + + + + + + + + + + + + + +

      Parameters:

      ++++ + + + + +

      cb

      The circular_buffer_space_optimized to be copied.

      Postconditions:

      *this == cb
      +
      + The amount of allocated memory in the internal buffer is cb.size().

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). T::T(const T&) throws.
      +
      10. +
    10. +
      circular_buffer_space_optimized< T, Alloc > & 
+operator=(circular_buffer_space_optimized< T, Alloc > && cb) noexcept;
      Move assigns content of cb to *this, leaving cb empty.

      + + + +

      +

      Complexity. Constant.

      +

      +

      +
      ++++ + + + + + + + + + + + + + + + + + + +

      Parameters:

      ++++ + + + + +

      cb

      circular_buffer to 'steal' value from.

      Requires:

      C++ compiler with rvalue references support.

      Postconditions:

      cb.empty()

      Throws:

      		Nothing.
      +
      11. +
    +
    +
    +

    +circular_buffer_space_optimized public member functions

    +
      +
    1. +
      bool full() const noexcept;
      Is the circular_buffer_space_optimized full?

      + +

      +

      Exception Safety. No-throw.

      +

      +

      +

      Iterator Invalidation. Does not invalidate any iterators.

      +

      +

      +

      Complexity. Constant (in the size of the circular_buffer_space_optimized).

      +

      +

      +

      See Also:

      +

      empty()

      +

      +

      +
      ++++ + + + + + + + + + + +

      Returns:

      true if the number of elements stored in the circular_buffer_space_optimized equals the capacity of the circular_buffer_space_optimized; false otherwise.

      Throws:

      		Nothing.
      +
      2. +
    2. +
      size_type reserve() const noexcept;
      Get the maximum number of elements which can be inserted into the circular_buffer_space_optimized without overwriting any of already stored elements.

      + +

      +

      Exception Safety. No-throw.

      +

      +

      +

      Iterator Invalidation. Does not invalidate any iterators.

      +

      +

      +

      Complexity. Constant (in the size of the circular_buffer_space_optimized).

      +

      +

      +

      See Also:

      +

      capacity(), size(), max_size()

      +

      +

      +
      ++++ + + + + + + + + + + +

      Returns:

      capacity().capacity() - size()

      Throws:

      		Nothing.
      +
      3. +
    3. +
      const capacity_type & capacity() const noexcept;
      Get the capacity of the circular_buffer_space_optimized.

      + +

      +

      Exception Safety. No-throw.

      +

      +

      +

      Iterator Invalidation. Does not invalidate any iterators.

      +

      +

      +

      Complexity. Constant (in the size of the circular_buffer_space_optimized).

      +

      +

      +

      See Also:

      +

      reserve(), size(), max_size(), set_capacity(const capacity_type&)

      +

      +

      +
      ++++ + + + + + + + + + + +

      Returns:

      The capacity controller representing the maximum number of elements which can be stored in the circular_buffer_space_optimized and the minimal allocated size of the internal buffer.

      Throws:

      		Nothing.
      +
      4. +
    4. +
      void set_capacity(const capacity_type & capacity_ctrl);
      Change the capacity (and the minimal guaranteed amount of allocated memory) of the circular_buffer_space_optimized.

      + + +

      +

      Exception Safety. Strong.

      +

      +

      +

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      +

      +

      +

      Complexity. Linear (in min[size(), capacity_ctrl.capacity()]).

      +

      +

      +
      + + + + + +
      [Note]Note

      To explicitly clear the extra allocated memory use the shrink-to-fit technique:
      +
      + boost::circular_buffer_space_optimized<int> cb(1000);
      + ...
      + boost::circular_buffer_space_optimized<int>(cb).swap(cb);
      +
      + For more information about the shrink-to-fit technique in STL see http://www.gotw.ca/gotw/054.htm.

      +

      +

      +

      See Also:

      +

      rset_capacity(const capacity_type&), resize(size_type, const_reference)

      +

      +

      +
      ++++ + + + + + + + + + + + + + + +

      Parameters:

      ++++ + + + + +

      capacity_ctrl

      The new capacity controller.

      Postconditions:

      capacity() == capacity_ctrl && size() <= capacity_ctrl.capacity()
      +
      + If the current number of elements stored in the circular_buffer_space_optimized is greater than the desired new capacity then number of [size() - capacity_ctrl.capacity()] last elements will be removed and the new size will be equal to capacity_ctrl.capacity().
      +
      + If the current number of elements stored in the circular_buffer_space_optimized is lower than the new capacity then the amount of allocated memory in the internal buffer may be accommodated as necessary but it will never drop below capacity_ctrl.min_capacity().

      Throws:

      		An allocation error if memory is exhausted, (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept.
      +
      5. +
    5. +
      void resize(size_type new_size, param_value_type item = value_type());
      Change the size of the circular_buffer_space_optimized.

      + + +

      +

      Exception Safety. Basic.

      +

      +

      +

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      +

      +

      +

      Complexity. Linear (in the new size of the circular_buffer_space_optimized).

      +

      +

      +

      See Also:

      +

      rresize(size_type, const_reference), set_capacity(const capacity_type&)

      +

      +

      +
      ++++ + + + + + + + + + + + + + + +

      Parameters:

      ++++ + + + + + + + + + + +

      item

      The element the circular_buffer_space_optimized will be filled with in order to gain the requested size. (See the Effect.)

      new_size

      The new size.

      Postconditions:

      size() == new_size && capacity().capacity() >= new_size
      +
      + If the new size is greater than the current size, copies of item will be inserted at the back of the of the circular_buffer_space_optimized in order to achieve the desired size. In the case the resulting size exceeds the current capacity the capacity will be set to new_size.
      +
      + If the current number of elements stored in the circular_buffer_space_optimized is greater than the desired new size then number of [size() - new_size] last elements will be removed. (The capacity will remain unchanged.)
      +
      + The amount of allocated memory in the internal buffer may be accommodated as necessary.

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws.
      +
      6. +
    6. +
      void rset_capacity(const capacity_type & capacity_ctrl);
      Change the capacity (and the minimal guaranteed amount of allocated memory) of the circular_buffer_space_optimized.

      + + +

      +

      Exception Safety. Strong.

      +

      +

      +

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      +

      +

      +

      Complexity. Linear (in min[size(), capacity_ctrl.capacity()]).

      +

      +

      +

      See Also:

      +

      set_capacity(const capacity_type&), rresize(size_type, const_reference)

      +

      +

      +
      ++++ + + + + + + + + + + + + + + +

      Parameters:

      ++++ + + + + +

      capacity_ctrl

      The new capacity controller.

      Postconditions:

      capacity() == capacity_ctrl && size() <= capacity_ctrl
      +
      + If the current number of elements stored in the circular_buffer_space_optimized is greater than the desired new capacity then number of [size() - capacity_ctrl.capacity()] first elements will be removed and the new size will be equal to capacity_ctrl.capacity().
      +
      + If the current number of elements stored in the circular_buffer_space_optimized is lower than the new capacity then the amount of allocated memory in the internal buffer may be accommodated as necessary but it will never drop below capacity_ctrl.min_capacity().

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept.
      +
      7. +
    7. +
      void rresize(size_type new_size, param_value_type item = value_type());
      Change the size of the circular_buffer_space_optimized.

      + + +

      +

      Exception Safety. Basic.

      +

      +

      +

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      +

      +

      +

      Complexity. Linear (in the new size of the circular_buffer_space_optimized).

      +

      +

      +

      See Also:

      +

      resize(size_type, const_reference), rset_capacity(const capacity_type&)

      +

      +

      +
      ++++ + + + + + + + + + + + + + + +

      Parameters:

      ++++ + + + + + + + + + + +

      item

      The element the circular_buffer_space_optimized will be filled with in order to gain the requested size. (See the Effect.)

      new_size

      The new size.

      Postconditions:

      size() == new_size && capacity().capacity() >= new_size
      +
      + If the new size is greater than the current size, copies of item will be inserted at the front of the of the circular_buffer_space_optimized in order to achieve the desired size. In the case the resulting size exceeds the current capacity the capacity will be set to new_size.
      +
      + If the current number of elements stored in the circular_buffer_space_optimized is greater than the desired new size then number of [size() - new_size] first elements will be removed. (The capacity will remain unchanged.)
      +
      + The amount of allocated memory in the internal buffer may be accommodated as necessary.

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws.
      +
      8. +
    8. +
      void assign(size_type n, param_value_type item);
      Assign n items into the space optimized circular buffer.

      The content of the circular_buffer_space_optimized will be removed and replaced with n copies of the item. + + +

      +

      Exception Safety. Basic.

      +

      +

      +

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      +

      +

      +

      Complexity. Linear (in the n).

      +

      +

      +

      See Also:

      +

      operator=, assign(capacity_type, size_type, const_reference), assign(InputIterator, InputIterator), assign(capacity_type, InputIterator, InputIterator)

      +

      +

      +
      ++++ + + + + + + + + + + + + + + +

      Parameters:

      ++++ + + + + + + + + + + +

      item

      The element the circular_buffer_space_optimized will be filled with.

      n

      The number of elements the circular_buffer_space_optimized will be filled with.

      Postconditions:

      capacity().capacity() == n && capacity().min_capacity() == 0 && size() == n && (*this)[0] == item && (*this)[1] == item && ... && (*this) [n - 1] == item
      +
      + The amount of allocated memory in the internal buffer is n.

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws.
      +
      9. +
    9. +
      void assign(capacity_type capacity_ctrl, size_type n, param_value_type item);
      Assign n items into the space optimized circular buffer specifying the capacity.

      The capacity of the circular_buffer_space_optimized will be set to the specified value and the content of the circular_buffer_space_optimized will be removed and replaced with n copies of the item. + + + +

      +

      Exception Safety. Basic.

      +

      +

      +

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      +

      +

      +

      Complexity. Linear (in the n).

      +

      +

      +

      See Also:

      +

      operator=, assign(size_type, const_reference), assign(InputIterator, InputIterator), assign(capacity_type, InputIterator, InputIterator)

      +

      +

      +
      ++++ + + + + + + + + + + + + + + + + + + +

      Parameters:

      ++++ + + + + + + + + + + + + + + +

      capacity_ctrl

      The new capacity controller.

      item

      The element the circular_buffer_space_optimized will be filled with.

      n

      The number of elements the circular_buffer_space_optimized will be filled with.

      Requires:

      capacity_ctrl.capacity() >= n

      Postconditions:

      capacity() == capacity_ctrl && size() == n && (*this)[0] == item && (*this)[1] == item && ... && (*this) [n - 1] == item
      +
      + The amount of allocated memory will be max[n, capacity_ctrl.min_capacity()].

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws.
      +
      10. +
    10. +
      template<typename InputIterator> 
+  void assign(InputIterator first, InputIterator last);
      Assign a copy of the range into the space optimized circular buffer.

      The content of the circular_buffer_space_optimized will be removed and replaced with copies of elements from the specified range. + + + +

      +

      Exception Safety. Basic.

      +

      +

      +

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      +

      +

      +

      Complexity. Linear (in the std::distance(first, last)).

      +

      +

      +

      See Also:

      +

      operator=, assign(size_type, const_reference), assign(capacity_type, size_type, const_reference), assign(capacity_type, InputIterator, InputIterator)

      +

      +

      +
      ++++ + + + + + + + + + + + + + + + + + + +

      Parameters:

      ++++ + + + + + + + + + + +

      first

      The beginning of the range to be copied.

      last

      The end of the range to be copied.

      Requires:

      Valid range [first, last).
      + first and last have to meet the requirements of InputIterator.

      Postconditions:

      capacity().capacity() == std::distance(first, last) && capacity().min_capacity() == 0 && size() == std::distance(first, last) && (*this)[0]== *first && (*this)[1] == *(first + 1) && ... && (*this)[std::distance(first, last) - 1] == *(last - 1)
      +
      + The amount of allocated memory in the internal buffer is std::distance(first, last).

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept and InputIterator is a move iterator.
      +
      11. +
    11. +
      template<typename InputIterator> 
+  void assign(capacity_type capacity_ctrl, InputIterator first, 
+              InputIterator last);
      Assign a copy of the range into the space optimized circular buffer specifying the capacity.

      The capacity of the circular_buffer_space_optimized will be set to the specified value and the content of the circular_buffer_space_optimized will be removed and replaced with copies of elements from the specified range. + + + +

      +

      Exception Safety. Basic.

      +

      +

      +

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      +

      +

      +

      Complexity. Linear (in std::distance(first, last); in min[capacity_ctrl.capacity(), std::distance(first, last)] if the InputIterator is a RandomAccessIterator).

      +

      +

      +

      See Also:

      +

      operator=, assign(size_type, const_reference), assign(capacity_type, size_type, const_reference), assign(InputIterator, InputIterator)

      +

      +

      +
      ++++ + + + + + + + + + + + + + + + + + + +

      Parameters:

      ++++ + + + + + + + + + + + + + + +

      capacity_ctrl

      The new capacity controller.

      first

      The beginning of the range to be copied.

      last

      The end of the range to be copied.

      Requires:

      Valid range [first, last).
      + first and last have to meet the requirements of InputIterator.

      Postconditions:

      capacity() == capacity_ctrl && size() <= std::distance(first, last) && (*this)[0]== *(last - capacity) && (*this)[1] == *(last - capacity + 1) && ... && (*this)[capacity - 1] == *(last - 1)
      +
      + If the number of items to be copied from the range [first, last) is greater than the specified capacity then only elements from the range [last - capacity, last) will be copied.
      +
      + The amount of allocated memory in the internal buffer is max[std::distance(first, last), capacity_ctrl.min_capacity()].

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept and InputIterator is a move iterator.
      +
      12. +
    12. +
      void swap(circular_buffer_space_optimized< T, Alloc > & cb) noexcept;
      Swap the contents of two space-optimized circular-buffers.

      + + +

      +

      Exception Safety. No-throw.

      +

      +

      +

      Iterator Invalidation. Invalidates all iterators of both circular_buffer_space_optimized containers. (On the other hand the iterators still point to the same elements but within another container. If you want to rely on this feature you have to turn the __debug_support off by defining macro BOOST_CB_DISABLE_DEBUG, otherwise an assertion will report an error if such invalidated iterator is used.)

      +

      +

      +

      Complexity. Constant (in the size of the circular_buffer_space_optimized).

      +

      +

      +

      See Also:

      +

      swap(circular_buffer<T, Alloc>&, circular_buffer<T, Alloc>&), swap(circular_buffer_space_optimized<T, Alloc>&, circular_buffer_space_optimized<T, Alloc>&)

      +

      +

      +
      ++++ + + + + + + + + + + + + + + +

      Parameters:

      ++++ + + + + +

      cb

      The circular_buffer_space_optimized whose content will be swapped.

      Postconditions:

      this contains elements of cb and vice versa; the capacity and the amount of allocated memory in the internal buffer of this equal to the capacity and the amount of allocated memory of cb and vice versa.

      Throws:

      		Nothing.
      +
      13. +
    13. +
      void push_back(param_value_type item);
      Insert a new element at the end of the space optimized circular buffer.

      + + +

      +

      Exception Safety. Basic.

      +

      +

      +

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      +

      +

      +

      Complexity. Linear (in the size of the circular_buffer_space_optimized).

      +

      +

      +

      See Also:

      +

      push_front(const_reference), pop_back(), pop_front()

      +

      +

      +
      ++++ + + + + + + + + + + + + + + +

      Parameters:

      ++++ + + + + +

      item

      The element to be inserted.

      Postconditions:

      if capacity().capacity() > 0 then back() == item
      + If the circular_buffer_space_optimized is full, the first element will be removed. If the capacity is 0, nothing will be inserted.
      +
      + The amount of allocated memory in the internal buffer may be predictively increased.

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws.
      +
      14. +
    14. +
      void push_back(rvalue_type item);
      Insert a new element at the end of the space optimized circular buffer.

      + + +

      +

      Exception Safety. Basic.

      +

      +

      +

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      +

      +

      +

      Complexity. Linear (in the size of the circular_buffer_space_optimized).

      +

      +

      +

      See Also:

      +

      push_front(const_reference), pop_back(), pop_front()

      +

      +

      +
      ++++ + + + + + + + + + + + + + + +

      Parameters:

      ++++ + + + + +

      item

      The element to be inserted.

      Postconditions:

      if capacity().capacity() > 0 then back() == item
      + If the circular_buffer_space_optimized is full, the first element will be removed. If the capacity is 0, nothing will be inserted.
      +
      + The amount of allocated memory in the internal buffer may be predictively increased.

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used).
      +
      15. +
    15. +
      void push_back();
      Insert a new element at the end of the space optimized circular buffer.

      + +

      +

      Exception Safety. Basic.

      +

      +

      +

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      +

      +

      +

      Complexity. Linear (in the size of the circular_buffer_space_optimized).

      +

      +

      +

      See Also:

      +

      push_front(const_reference), pop_back(), pop_front()

      +

      +

      +
      ++++ + + + + + + + + + + +

      Postconditions:

      if capacity().capacity() > 0 then back() == item
      + If the circular_buffer_space_optimized is full, the first element will be removed. If the capacity is 0, nothing will be inserted.
      +
      + The amount of allocated memory in the internal buffer may be predictively increased.

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T() throws. Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept.
      +
      16. +
    16. +
      void push_front(param_value_type item);
      Insert a new element at the beginning of the space optimized circular buffer.

      + + +

      +

      Exception Safety. Basic.

      +

      +

      +

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      +

      +

      +

      Complexity. Linear (in the size of the circular_buffer_space_optimized).

      +

      +

      +

      See Also:

      +

      push_back(const_reference), pop_back(), pop_front()

      +

      +

      +
      ++++ + + + + + + + + + + + + + + +

      Parameters:

      ++++ + + + + +

      item

      The element to be inserted.

      Postconditions:

      if capacity().capacity() > 0 then front() == item
      + If the circular_buffer_space_optimized is full, the last element will be removed. If the capacity is 0, nothing will be inserted.
      +
      + The amount of allocated memory in the internal buffer may be predictively increased.

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws.
      +
      17. +
    17. +
      void push_front(rvalue_type item);
      Insert a new element at the beginning of the space optimized circular buffer.

      + + +

      +

      Exception Safety. Basic.

      +

      +

      +

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      +

      +

      +

      Complexity. Linear (in the size of the circular_buffer_space_optimized).

      +

      +

      +

      See Also:

      +

      push_back(const_reference), pop_back(), pop_front()

      +

      +

      +
      ++++ + + + + + + + + + + + + + + +

      Parameters:

      ++++ + + + + +

      item

      The element to be inserted.

      Postconditions:

      if capacity().capacity() > 0 then front() == item
      + If the circular_buffer_space_optimized is full, the last element will be removed. If the capacity is 0, nothing will be inserted.
      +
      + The amount of allocated memory in the internal buffer may be predictively increased.

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept.
      +
      18. +
    18. +
      void push_front();
      Insert a new element at the beginning of the space optimized circular buffer.

      + +

      +

      Exception Safety. Basic.

      +

      +

      +

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      +

      +

      +

      Complexity. Linear (in the size of the circular_buffer_space_optimized).

      +

      +

      +

      See Also:

      +

      push_back(const_reference), pop_back(), pop_front()

      +

      +

      +
      ++++ + + + + + + + + + + +

      Postconditions:

      if capacity().capacity() > 0 then front() == item
      + If the circular_buffer_space_optimized is full, the last element will be removed. If the capacity is 0, nothing will be inserted.
      +
      + The amount of allocated memory in the internal buffer may be predictively increased.

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T() throws. Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept.
      +
      19. +
    19. +
      void pop_back();
      Remove the last element from the space optimized circular buffer.

      + + +

      +

      Exception Safety. Basic.

      +

      +

      +

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      +

      +

      +

      Complexity. Linear (in the size of the circular_buffer_space_optimized).

      +

      +

      +

      See Also:

      +

      pop_front(), push_back(const_reference), push_front(const_reference)

      +

      +

      +
      ++++ + + + + + + + + + + + + + + +

      Requires:

      !empty()

      Postconditions:

      The last element is removed from the circular_buffer_space_optimized.
      +
      + The amount of allocated memory in the internal buffer may be predictively decreased.

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used).
      +
      20. +
    20. +
      void pop_front();
      Remove the first element from the space optimized circular buffer.

      + + +

      +

      Exception Safety. Basic.

      +

      +

      +

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      +

      +

      +

      Complexity. Linear (in the size of the circular_buffer_space_optimized).

      +

      +

      +

      See Also:

      +

      pop_back(), push_back(const_reference), push_front(const_reference)

      +

      +

      +
      ++++ + + + + + + + + + + + + + + +

      Requires:

      !empty()

      Postconditions:

      The first element is removed from the circular_buffer_space_optimized.
      +
      + The amount of allocated memory in the internal buffer may be predictively decreased.

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used).
      +
      21. +
    21. +
      iterator insert(iterator pos, param_value_type item);
      Insert an element at the specified position.

      + + + + +

      +

      Exception Safety. Basic.

      +

      +

      +

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      +

      +

      +

      Complexity. Linear (in the size of the circular_buffer_space_optimized).

      +

      +

      +

      See Also:

      +

      insert(iterator, size_type, value_type), insert(iterator, InputIterator, InputIterator), rinsert(iterator, value_type), rinsert(iterator, size_type, value_type), rinsert(iterator, InputIterator, InputIterator)

      +

      +

      +
      ++++ + + + + + + + + + + + + + + + + + + + + + + +

      Parameters:

      ++++ + + + + + + + + + + +

      item

      The element to be inserted.

      pos

      An iterator specifying the position where the item will be inserted.

      Requires:

      pos is a valid iterator pointing to the circular_buffer_space_optimized or its end.

      Postconditions:

      The item will be inserted at the position pos.
      + If the circular_buffer_space_optimized is full, the first element will be overwritten. If the circular_buffer_space_optimized is full and the pos points to begin(), then the item will not be inserted. If the capacity is 0, nothing will be inserted.
      +
      + The amount of allocated memory in the internal buffer may be predictively increased.

      Returns:

      Iterator to the inserted element or begin() if the item is not inserted. (See the Effect.)

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws. Whatever T::operator = (const T&) throws.
      +
      22. +
    22. +
      iterator insert(iterator pos, rvalue_type item);
      Insert an element at the specified position.

      + + + + +

      +

      Exception Safety. Basic.

      +

      +

      +

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      +

      +

      +

      Complexity. Linear (in the size of the circular_buffer_space_optimized).

      +

      +

      +

      See Also:

      +

      insert(iterator, size_type, value_type), insert(iterator, InputIterator, InputIterator), rinsert(iterator, value_type), rinsert(iterator, size_type, value_type), rinsert(iterator, InputIterator, InputIterator)

      +

      +

      +
      ++++ + + + + + + + + + + + + + + + + + + + + + + +

      Parameters:

      ++++ + + + + + + + + + + +

      item

      The element to be inserted.

      pos

      An iterator specifying the position where the item will be inserted.

      Requires:

      pos is a valid iterator pointing to the circular_buffer_space_optimized or its end.

      Postconditions:

      The item will be inserted at the position pos.
      + If the circular_buffer_space_optimized is full, the first element will be overwritten. If the circular_buffer_space_optimized is full and the pos points to begin(), then the item will not be inserted. If the capacity is 0, nothing will be inserted.
      +
      + The amount of allocated memory in the internal buffer may be predictively increased.

      Returns:

      Iterator to the inserted element or begin() if the item is not inserted. (See the Effect.)

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept.
      +
      23. +
    23. +
      iterator insert(iterator pos);
      Insert an element at the specified position.

      + + + + +

      +

      Exception Safety. Basic.

      +

      +

      +

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      +

      +

      +

      Complexity. Linear (in the size of the circular_buffer_space_optimized).

      +

      +

      +

      See Also:

      +

      insert(iterator, size_type, value_type), insert(iterator, InputIterator, InputIterator), rinsert(iterator, value_type), rinsert(iterator, size_type, value_type), rinsert(iterator, InputIterator, InputIterator)

      +

      +

      +
      ++++ + + + + + + + + + + + + + + + + + + + + + + +

      Parameters:

      ++++ + + + + +

      pos

      An iterator specifying the position where the item will be inserted.

      Requires:

      pos is a valid iterator pointing to the circular_buffer_space_optimized or its end.

      Postconditions:

      The item will be inserted at the position pos.
      + If the circular_buffer_space_optimized is full, the first element will be overwritten. If the circular_buffer_space_optimized is full and the pos points to begin(), then the item will not be inserted. If the capacity is 0, nothing will be inserted.
      +
      + The amount of allocated memory in the internal buffer may be predictively increased.

      Returns:

      Iterator to the inserted element or begin() if the item is not inserted. (See the Effect.)

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T() throws. Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept.
      +
      24. +
    24. +
      void insert(iterator pos, size_type n, param_value_type item);
      Insert n copies of the item at the specified position.

      + + + +

      +

      Exception Safety. Basic.

      +

      +

      +

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      +

      +

      +

      Complexity. Linear (in min[capacity().capacity(), size() + n]).

      +

      +

      +

      Example. Consider a circular_buffer_space_optimized with the capacity of 6 and the size of 4. Its internal buffer may look like the one below.
      +
      + |1|2|3|4| | |
      + p ___^
      +
      +After inserting 5 elements at the position p:
      +
      + insert(p, (size_t)5, 0);
      +
      +actually only 4 elements get inserted and elements 1 and 2 are overwritten. This is due to the fact the insert operation preserves the capacity. After insertion the internal buffer looks like this:
      +
      +|0|0|0|0|3|4|
      +
      +For comparison if the capacity would not be preserved the internal buffer would then result in |1|2|0|0|0|0|0|3|4|.

      +

      +

      +

      See Also:

      +

      insert(iterator, value_type), insert(iterator, InputIterator, InputIterator), rinsert(iterator, value_type), rinsert(iterator, size_type, value_type), rinsert(iterator, InputIterator, InputIterator)

      +

      +

      +
      ++++ + + + + + + + + + + + + + + + + + + +

      Parameters:

      ++++ + + + + + + + + + + + + + + +

      item

      The element whose copies will be inserted.

      n

      The number of items the to be inserted.

      pos

      An iterator specifying the position where the items will be inserted.

      Requires:

      pos is a valid iterator pointing to the circular_buffer_space_optimized or its end.

      Postconditions:

      The number of min[n, (pos - begin()) + reserve()] elements will be inserted at the position pos.
      +The number of min[pos - begin(), max[0, n - reserve()]] elements will be overwritten at the beginning of the circular_buffer_space_optimized.
      +(See Example for the explanation.)
      +
      + The amount of allocated memory in the internal buffer may be predictively increased.

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws. Whatever T::operator = (const T&) throws.
      +
      25. +
    25. +
      template<typename InputIterator> 
+  void insert(iterator pos, InputIterator first, InputIterator last);
      Insert the range [first, last) at the specified position.

      + + + +

      +

      Exception Safety. Basic.

      +

      +

      +

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      +

      +

      +

      Complexity. Linear (in [size() + std::distance(first, last)]; in min[capacity().capacity(), size() + std::distance(first, last)] if the InputIterator is a RandomAccessIterator).

      +

      +

      +

      Example. Consider a circular_buffer_space_optimized with the capacity of 6 and the size of 4. Its internal buffer may look like the one below.
      +
      + |1|2|3|4| | |
      + p ___^
      +
      +After inserting a range of elements at the position p:
      +
      + int array[] = { 5, 6, 7, 8, 9 };
      +insert(p, array, array + 5);
      +
      + actually only elements 6, 7, 8 and 9 from the specified range get inserted and elements 1 and 2 are overwritten. This is due to the fact the insert operation preserves the capacity. After insertion the internal buffer looks like this:
      +
      +|6|7|8|9|3|4|
      +
      +For comparison if the capacity would not be preserved the internal buffer would then result in |1|2|5|6|7|8|9|3|4|.

      +

      +

      +

      See Also:

      +

      insert(iterator, value_type), insert(iterator, size_type, value_type), rinsert(iterator, value_type), rinsert(iterator, size_type, value_type), rinsert(iterator, InputIterator, InputIterator)

      +

      +

      +
      ++++ + + + + + + + + + + + + + + + + + + +

      Parameters:

      ++++ + + + + + + + + + + + + + + +

      first

      The beginning of the range to be inserted.

      last

      The end of the range to be inserted.

      pos

      An iterator specifying the position where the range will be inserted.

      Requires:

      pos is a valid iterator pointing to the circular_buffer_space_optimized or its end.
      +Valid range [first, last) where first and last meet the requirements of an InputIterator.

      Postconditions:

      Elements from the range [first + max[0, distance(first, last) - (pos - begin()) - reserve()], last) will be inserted at the position pos.
      +The number of min[pos - begin(), max[0, distance(first, last) - reserve()]] elements will be overwritten at the beginning of the circular_buffer_space_optimized.
      +(See Example for the explanation.)
      +
      + The amount of allocated memory in the internal buffer may be predictively increased.

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept.
      +
      26. +
    26. +
      iterator rinsert(iterator pos, param_value_type item);
      Insert an element before the specified position.

      + + + + +

      +

      Exception Safety. Basic.

      +

      +

      +

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      +

      +

      +

      Complexity. Linear (in the size of the circular_buffer_space_optimized).

      +

      +

      +

      See Also:

      +

      rinsert(iterator, size_type, value_type), rinsert(iterator, InputIterator, InputIterator), insert(iterator, value_type), insert(iterator, size_type, value_type), insert(iterator, InputIterator, InputIterator)

      +

      +

      +
      ++++ + + + + + + + + + + + + + + + + + + + + + + +

      Parameters:

      ++++ + + + + + + + + + + +

      item

      The element to be inserted.

      pos

      An iterator specifying the position before which the item will be inserted.

      Requires:

      pos is a valid iterator pointing to the circular_buffer_space_optimized or its end.

      Postconditions:

      The item will be inserted before the position pos.
      + If the circular_buffer_space_optimized is full, the last element will be overwritten. If the circular_buffer_space_optimized is full and the pos points to end(), then the item will not be inserted. If the capacity is 0, nothing will be inserted.
      +
      + The amount of allocated memory in the internal buffer may be predictively increased.

      Returns:

      Iterator to the inserted element or end() if the item is not inserted. (See the Effect.)

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws. Whatever T::operator = (const T&) throws.
      +
      27. +
    27. +
      iterator rinsert(iterator pos, rvalue_type item);
      Insert an element before the specified position.

      + + + + +

      +

      Exception Safety. Basic.

      +

      +

      +

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      +

      +

      +

      Complexity. Linear (in the size of the circular_buffer_space_optimized).

      +

      +

      +

      See Also:

      +

      rinsert(iterator, size_type, value_type), rinsert(iterator, InputIterator, InputIterator), insert(iterator, value_type), insert(iterator, size_type, value_type), insert(iterator, InputIterator, InputIterator)

      +

      +

      +
      ++++ + + + + + + + + + + + + + + + + + + + + + + +

      Parameters:

      ++++ + + + + + + + + + + +

      item

      The element to be inserted.

      pos

      An iterator specifying the position before which the item will be inserted.

      Requires:

      pos is a valid iterator pointing to the circular_buffer_space_optimized or its end.

      Postconditions:

      The item will be inserted before the position pos.
      + If the circular_buffer_space_optimized is full, the last element will be overwritten. If the circular_buffer_space_optimized is full and the pos points to end(), then the item will not be inserted. If the capacity is 0, nothing will be inserted.
      +
      + The amount of allocated memory in the internal buffer may be predictively increased.

      Returns:

      Iterator to the inserted element or end() if the item is not inserted. (See the Effect.)

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept.
      +
      28. +
    28. +
      iterator rinsert(iterator pos);
      Insert an element before the specified position.

      + + + + +

      +

      Exception Safety. Basic.

      +

      +

      +

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      +

      +

      +

      Complexity. Linear (in the size of the circular_buffer_space_optimized).

      +

      +

      +

      See Also:

      +

      rinsert(iterator, size_type, value_type), rinsert(iterator, InputIterator, InputIterator), insert(iterator, value_type), insert(iterator, size_type, value_type), insert(iterator, InputIterator, InputIterator)

      +

      +

      +
      ++++ + + + + + + + + + + + + + + + + + + + + + + +

      Parameters:

      ++++ + + + + +

      pos

      An iterator specifying the position before which the item will be inserted.

      Requires:

      pos is a valid iterator pointing to the circular_buffer_space_optimized or its end.

      Postconditions:

      The item will be inserted before the position pos.
      + If the circular_buffer_space_optimized is full, the last element will be overwritten. If the circular_buffer_space_optimized is full and the pos points to end(), then the item will not be inserted. If the capacity is 0, nothing will be inserted.
      +
      + The amount of allocated memory in the internal buffer may be predictively increased.

      Returns:

      Iterator to the inserted element or end() if the item is not inserted. (See the Effect.)

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T() throws. Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept.
      +
      29. +
    29. +
      void rinsert(iterator pos, size_type n, param_value_type item);
      Insert n copies of the item before the specified position.

      + + + +

      +

      Exception Safety. Basic.

      +

      +

      +

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      +

      +

      +

      Complexity. Linear (in min[capacity().capacity(), size() + n]).

      +

      +

      +

      Example. Consider a circular_buffer_space_optimized with the capacity of 6 and the size of 4. Its internal buffer may look like the one below.
      +
      + |1|2|3|4| | |
      + p ___^
      +
      +After inserting 5 elements before the position p:
      +
      + rinsert(p, (size_t)5, 0);
      +
      +actually only 4 elements get inserted and elements 3 and 4 are overwritten. This is due to the fact the rinsert operation preserves the capacity. After insertion the internal buffer looks like this:
      +
      +|1|2|0|0|0|0|
      +
      +For comparison if the capacity would not be preserved the internal buffer would then result in |1|2|0|0|0|0|0|3|4|.

      +

      +

      +

      See Also:

      +

      rinsert(iterator, value_type), rinsert(iterator, InputIterator, InputIterator), insert(iterator, value_type), insert(iterator, size_type, value_type), insert(iterator, InputIterator, InputIterator)

      +

      +

      +
      ++++ + + + + + + + + + + + + + + + + + + +

      Parameters:

      ++++ + + + + + + + + + + + + + + +

      item

      The element whose copies will be inserted.

      n

      The number of items the to be inserted.

      pos

      An iterator specifying the position where the items will be inserted.

      Requires:

      pos is a valid iterator pointing to the circular_buffer_space_optimized or its end.

      Postconditions:

      The number of min[n, (end() - pos) + reserve()] elements will be inserted before the position pos.
      +The number of min[end() - pos, max[0, n - reserve()]] elements will be overwritten at the end of the circular_buffer_space_optimized.
      +(See Example for the explanation.)
      +
      + The amount of allocated memory in the internal buffer may be predictively increased.

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws. Whatever T::operator = (const T&) throws.
      +
      30. +
    30. +
      template<typename InputIterator> 
+  void rinsert(iterator pos, InputIterator first, InputIterator last);
      Insert the range [first, last) before the specified position.

      + + + +

      +

      Exception Safety. Basic.

      +

      +

      +

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      +

      +

      +

      Complexity. Linear (in [size() + std::distance(first, last)]; in min[capacity().capacity(), size() + std::distance(first, last)] if the InputIterator is a RandomAccessIterator).

      +

      +

      +

      Example. Consider a circular_buffer_space_optimized with the capacity of 6 and the size of 4. Its internal buffer may look like the one below.
      +
      + |1|2|3|4| | |
      + p ___^
      +
      +After inserting a range of elements before the position p:
      +
      + int array[] = { 5, 6, 7, 8, 9 };
      +insert(p, array, array + 5);
      +
      + actually only elements 5, 6, 7 and 8 from the specified range get inserted and elements 3 and 4 are overwritten. This is due to the fact the rinsert operation preserves the capacity. After insertion the internal buffer looks like this:
      +
      +|1|2|5|6|7|8|
      +
      +For comparison if the capacity would not be preserved the internal buffer would then result in |1|2|5|6|7|8|9|3|4|.

      +

      +

      +

      See Also:

      +

      rinsert(iterator, value_type), rinsert(iterator, size_type, value_type), insert(iterator, value_type), insert(iterator, size_type, value_type), insert(iterator, InputIterator, InputIterator)

      +

      +

      +
      ++++ + + + + + + + + + + + + + + + + + + +

      Parameters:

      ++++ + + + + + + + + + + + + + + +

      first

      The beginning of the range to be inserted.

      last

      The end of the range to be inserted.

      pos

      An iterator specifying the position where the range will be inserted.

      Requires:

      pos is a valid iterator pointing to the circular_buffer_space_optimized or its end.
      + Valid range [first, last) where first and last meet the requirements of an InputIterator.

      Postconditions:

      Elements from the range [first, last - max[0, distance(first, last) - (end() - pos) - reserve()]) will be inserted before the position pos.
      +The number of min[end() - pos, max[0, distance(first, last) - reserve()]] elements will be overwritten at the end of the circular_buffer.
      +(See Example for the explanation.)
      +
      + The amount of allocated memory in the internal buffer may be predictively increased.

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws. Whatever T::operator = (const T&) throws.
      +
      31. +
    31. +
      iterator erase(iterator pos);
      Remove an element at the specified position.

      + + + + +

      +

      Exception Safety. Basic.

      +

      +

      +

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      +

      +

      +

      Complexity. Linear (in the size of the circular_buffer_space_optimized).

      +

      +

      +

      See Also:

      +

      erase(iterator, iterator), rerase(iterator), rerase(iterator, iterator), clear()

      +

      +

      +
      ++++ + + + + + + + + + + + + + + + + + + + + + + +

      Parameters:

      ++++ + + + + +

      pos

      An iterator pointing at the element to be removed.

      Requires:

      pos is a valid iterator pointing to the circular_buffer_space_optimized (but not an end()).

      Postconditions:

      The element at the position pos is removed.
      +
      + The amount of allocated memory in the internal buffer may be predictively decreased.

      Returns:

      Iterator to the first element remaining beyond the removed element or end() if no such element exists.

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::operator = (const T&) throws or nothing if T::operator = (T&&) is noexcept.
      +
      32. +
    32. +
      iterator erase(iterator first, iterator last);
      Erase the range [first, last).

      + + + + +

      +

      Exception Safety. Basic.

      +

      +

      +

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      +

      +

      +

      Complexity. Linear (in the size of the circular_buffer_space_optimized).

      +

      +

      +

      See Also:

      +

      erase(iterator), rerase(iterator), rerase(iterator, iterator), clear()

      +

      +

      +
      ++++ + + + + + + + + + + + + + + + + + + + + + + +

      Parameters:

      ++++ + + + + + + + + + + +

      first

      The beginning of the range to be removed.

      last

      The end of the range to be removed.

      Requires:

      Valid range [first, last).

      Postconditions:

      The elements from the range [first, last) are removed. (If first == last nothing is removed.)
      +
      + The amount of allocated memory in the internal buffer may be predictively decreased.

      Returns:

      Iterator to the first element remaining beyond the removed elements or end() if no such element exists.

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::operator = (const T&) throws or nothing if T::operator = (T&&) is noexcept.
      +
      33. +
    33. +
      iterator rerase(iterator pos);
      Remove an element at the specified position.

      + + + + +

      +

      Exception Safety. Basic.

      +

      +

      +

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      +

      +

      +

      Complexity. Linear (in the size of the circular_buffer_space_optimized).

      +

      +

      +
      + + + + + +
      [Note]Note

      Basically there is no difference between erase(iterator) and this method. It is implemented only for consistency with the base circular_buffer.

      +

      +

      +

      See Also:

      +

      erase(iterator), erase(iterator, iterator), rerase(iterator, iterator), clear()

      +

      +

      +
      ++++ + + + + + + + + + + + + + + + + + + + + + + +

      Parameters:

      ++++ + + + + +

      pos

      An iterator pointing at the element to be removed.

      Requires:

      pos is a valid iterator pointing to the circular_buffer_space_optimized (but not an end()).
      +
      + The amount of allocated memory in the internal buffer may be predictively decreased.

      Postconditions:

      The element at the position pos is removed.

      Returns:

      Iterator to the first element remaining in front of the removed element or begin() if no such element exists.

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::operator = (const T&) throws or nothing if T::operator = (T&&) is noexcept.
      +
      34. +
    34. +
      iterator rerase(iterator first, iterator last);
      Erase the range [first, last).

      + + + + +

      +

      Exception Safety. Basic.

      +

      +

      +

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      +

      +

      +

      Complexity. Linear (in the size of the circular_buffer_space_optimized).

      +

      +

      +
      + + + + + +
      [Note]Note

      Basically there is no difference between erase(iterator, iterator) and this method. It is implemented only for consistency with the base <circular_buffer.

      +

      +

      +

      See Also:

      +

      erase(iterator), erase(iterator, iterator), rerase(iterator), clear()

      +

      +

      +
      ++++ + + + + + + + + + + + + + + + + + + + + + + +

      Parameters:

      ++++ + + + + + + + + + + +

      first

      The beginning of the range to be removed.

      last

      The end of the range to be removed.

      Requires:

      Valid range [first, last).

      Postconditions:

      The elements from the range [first, last) are removed. (If first == last nothing is removed.)
      +
      + The amount of allocated memory in the internal buffer may be predictively decreased.

      Returns:

      Iterator to the first element remaining in front of the removed elements or begin() if no such element exists.

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::operator = (const T&) throws or nothing if T::operator = (T&&) is noexcept.
      +
      35. +
    35. +
      void clear();
      Remove all stored elements from the space optimized circular buffer.

      + +

      +

      Exception Safety. Basic.

      +

      +

      +

      Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

      +

      +

      +

      Complexity. Linear (in the size of the circular_buffer_space_optimized).

      +

      +

      +

      See Also:

      +

      ~circular_buffer_space_optimized(), erase(iterator), erase(iterator, iterator), rerase(iterator), rerase(iterator, iterator)

      +

      +

      +
      ++++ + + + + + + + + + + +

      Postconditions:

      size() == 0
      +
      + The amount of allocated memory in the internal buffer may be predictively decreased.

      Throws:

      		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used).
      +
      36. +
    +
    +
    +

    +circular_buffer_space_optimized private member functions

    +
      +
    1. +
      void adjust_min_capacity();
      Adjust the amount of allocated memory.
      2. +
    2. +
      size_type ensure_reserve(size_type new_capacity, size_type buffer_size) const;
      Ensure the reserve for possible growth up.
      3. +
    3. +
      void check_low_capacity(size_type n = 1);
      Check for low capacity.
      4. +
    4. +
      void check_high_capacity();
      Check for high capacity.
      5. +
    5. +
      void reduce_capacity(const true_type &);
      Specialized method for reducing the capacity.
      6. +
    6. +
      void reduce_capacity(const false_type &);
      Specialized method for reducing the capacity.
      7. +
    7. +
      template<typename IntegralType> 
+  void insert(const iterator & pos, IntegralType n, IntegralType item, 
+              const true_type &);
      Specialized insert method.
      8. +
    8. +
      template<typename Iterator> 
+  void insert(const iterator & pos, Iterator first, Iterator last, 
+              const false_type &);
      Specialized insert method.
      9. +
    9. +
      template<typename IntegralType> 
+  void rinsert(const iterator & pos, IntegralType n, IntegralType item, 
+               const true_type &);
      Specialized rinsert method.
      10. +
    10. +
      template<typename Iterator> 
+  void rinsert(const iterator & pos, Iterator first, Iterator last, 
+               const false_type &);
      Specialized rinsert method.
      11. +
    +
    +
    +

    +circular_buffer_space_optimized private static functions

    +
      +
    1. +
      static size_type 
+init_capacity(const capacity_type & capacity_ctrl, size_type n);
      Determine the initial capacity.
      2. +
    2. +
      template<typename IntegralType> 
+  static size_type 
+  init_capacity(const capacity_type & capacity_ctrl, IntegralType n, 
+                IntegralType, const true_type &);
      Specialized method for determining the initial capacity.
      3. +
    3. +
      template<typename Iterator> 
+  static size_type 
+  init_capacity(const capacity_type & capacity_ctrl, Iterator first, 
+                Iterator last, const false_type &);
      Specialized method for determining the initial capacity.
      4. +
    4. +
      template<typename InputIterator> 
+  static size_type 
+  init_capacity(const capacity_type & capacity_ctrl, InputIterator, 
+                InputIterator, const std::input_iterator_tag &);
      Specialized method for determining the initial capacity.
      5. +
    5. +
      template<typename ForwardIterator> 
+  static size_type 
+  init_capacity(const capacity_type & capacity_ctrl, ForwardIterator first, 
+                ForwardIterator last, const std::forward_iterator_tag &);
      Specialized method for determining the initial capacity.
      6. +
    +
    +
    +
    + + + +
    Copyright © 2003-2013 Jan Gaspar

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/adaptive_pool.html b/doc/html/boost/container/adaptive_pool.html index be6f35f243..d52b50d0d6 100644 --- a/doc/html/boost/container/adaptive_pool.html +++ b/doc/html/boost/container/adaptive_pool.html @@ -57,38 +57,38 @@ }; // construct/copy/destruct - adaptive_pool() noexcept; - adaptive_pool(const adaptive_pool &) noexcept; + adaptive_pool() noexcept; + adaptive_pool(const adaptive_pool &) noexcept; template<typename T2> - adaptive_pool(const adaptive_pool< T2, NodesPerBlock, MaxFreeBlocks, OverheadPercent BOOST_CONTAINER_DOCIGN(BOOST_MOVE_I Version)> &) noexcept; - ~adaptive_pool(); + adaptive_pool(const adaptive_pool< T2, NodesPerBlock, MaxFreeBlocks, OverheadPercent BOOST_CONTAINER_DOCIGN(BOOST_MOVE_I Version)> &) noexcept; + ~adaptive_pool(); - // public member functions - BOOST_CONTAINER_DOCIGN(BOOST_STATIC_ASSERT((Version<=2))); - size_type max_size() const noexcept; - pointer allocate(size_type, const void * = 0); - void deallocate(const pointer &, size_type) noexcept; - pointer allocation_command(allocation_type, size_type, size_type &, + // public member functions + BOOST_CONTAINER_DOCIGN(BOOST_STATIC_ASSERT((Version<=2))); + size_type max_size() const noexcept; + pointer allocate(size_type, const void * = 0); + void deallocate(const pointer &, size_type) noexcept; + pointer allocation_command(allocation_type, size_type, size_type &, pointer &); - size_type size(pointer) const noexcept; - pointer allocate_one(); - void allocate_individual(std::size_t, multiallocation_chain &); - void deallocate_one(pointer) noexcept; - void deallocate_individual(multiallocation_chain &) noexcept; - void allocate_many(size_type, std::size_t, multiallocation_chain &); - void allocate_many(const size_type *, size_type, multiallocation_chain &); - void deallocate_many(multiallocation_chain &) noexcept; + size_type size(pointer) const noexcept; + pointer allocate_one(); + void allocate_individual(std::size_t, multiallocation_chain &); + void deallocate_one(pointer) noexcept; + void deallocate_individual(multiallocation_chain &) noexcept; + void allocate_many(size_type, std::size_t, multiallocation_chain &); + void allocate_many(const size_type *, size_type, multiallocation_chain &); + void deallocate_many(multiallocation_chain &) noexcept; - // public static functions - static void deallocate_free_blocks() noexcept; + // public static functions + static void deallocate_free_blocks() noexcept; - // friend functions - friend void swap(adaptive_pool &, adaptive_pool &) noexcept; - friend bool operator==(const adaptive_pool &, const adaptive_pool &) noexcept; - friend bool operator!=(const adaptive_pool &, const adaptive_pool &) noexcept; + // friend functions + friend void swap(adaptive_pool &, adaptive_pool &) noexcept; + friend bool operator==(const adaptive_pool &, const adaptive_pool &) noexcept; + friend bool operator!=(const adaptive_pool &, const adaptive_pool &) noexcept; - // private member functions - pointer priv_allocation_command(allocation_type, std::size_t, size_type &, + // private member functions + pointer priv_allocation_command(allocation_type, std::size_t, size_type &, pointer &); // public data members @@ -98,13 +98,13 @@ static const std::size_t real_nodes_per_block; };
    -

    Description

    +

    Description

    An STL node allocator that uses a modified DLMalloc as memory source.

    This node allocator shares a segregated storage between all instances of adaptive_pool with equal sizeof(T).

    NodesPerBlock is the number of nodes allocated at once when the allocator needs runs out of nodes. MaxFreeBlocks is the maximum number of totally free blocks that the adaptive node pool will hold. The rest of the totally free blocks will be deallocated to the memory manager.

    OverheadPercent is the (approximated) maximum size overhead (1-20%) of the allocator: (memory usable for nodes / total memory allocated from the memory allocator)

    -

    +

    adaptive_pool public types

    @@ -115,101 +115,101 @@
    • -

    +

    adaptive_pool public construct/copy/destruct

    1. -
      adaptive_pool() noexcept;
      Default constructor.
      2. +
      adaptive_pool() noexcept;
      Default constructor.
    2. -
      adaptive_pool(const adaptive_pool &) noexcept;
      Copy constructor from other adaptive_pool.
      3. +
      adaptive_pool(const adaptive_pool &) noexcept;
      Copy constructor from other adaptive_pool. 
    3. template<typename T2> 
-  adaptive_pool(const adaptive_pool< T2, NodesPerBlock, MaxFreeBlocks, OverheadPercent BOOST_CONTAINER_DOCIGN(BOOST_MOVE_I Version)> &) noexcept;
      Copy constructor from related adaptive_pool.
      4. + adaptive_pool(const adaptive_pool< T2, NodesPerBlock, MaxFreeBlocks, OverheadPercent BOOST_CONTAINER_DOCIGN(BOOST_MOVE_I Version)> &) noexcept;Copy constructor from related adaptive_pool.
    4. -
      ~adaptive_pool();
      Destructor.
      5. +
      ~adaptive_pool();
      Destructor.
    -

    -adaptive_pool public member functions

    +

    +adaptive_pool public member functions

      -
    1.  BOOST_CONTAINER_DOCIGN(BOOST_STATIC_ASSERT((Version<=2)));
      2. +
    2.  BOOST_CONTAINER_DOCIGN(BOOST_STATIC_ASSERT((Version<=2)));
    3. -
      size_type max_size() const noexcept;
      +
      size_type max_size() const noexcept;

      Returns the number of elements that could be allocated. Never throws

    4. -
      pointer allocate(size_type count, const void * = 0);
      +
      pointer allocate(size_type count, const void * = 0);

      Allocate memory for an array of count elements. Throws std::bad_alloc if there is no enough memory

    5. -
      void deallocate(const pointer & ptr, size_type count) noexcept;
      +
      void deallocate(const pointer & ptr, size_type count) noexcept;

      Deallocate allocated memory. Never throws

      6. -
    6. pointer allocation_command(allocation_type command, size_type limit_size, 
+
    7. pointer allocation_command(allocation_type command, size_type limit_size, 
                            size_type & prefer_in_recvd_out_size, 
                            pointer & reuse);
      8. 
 
    8. 
-
      size_type size(pointer p) const noexcept;
      
+
      size_type size(pointer p) const noexcept;
      
 
      Returns maximum the number of objects the previously allocated memory pointed by p can hold. 
      
 
      9. 
 
    9. 
-
      pointer allocate_one();
      
+
      pointer allocate_one();
      
 
      Allocates just one object. Memory allocated with this function must be deallocated only with deallocate_one(). Throws bad_alloc if there is no enough memory 
      
 
      10. 
 
    10. 
-
      void allocate_individual(std::size_t num_elements, 
+
      void allocate_individual(std::size_t num_elements, 
                          multiallocation_chain & chain);
      
 
      Allocates many elements of size == 1. Elements must be individually deallocated with deallocate_one() 
      
 
      11. 
 
    11. 
-
      void deallocate_one(pointer p) noexcept;
      
+
      void deallocate_one(pointer p) noexcept;
      
 
      Deallocates memory previously allocated with allocate_one(). You should never use deallocate_one to deallocate memory allocated with other functions different from allocate_one(). Never throws 
      
 
      12. 
-
    12. void deallocate_individual(multiallocation_chain & chain) noexcept;
      13. 
+
    13. void deallocate_individual(multiallocation_chain & chain) noexcept;
      14. 
 
    14. 
-
      void allocate_many(size_type elem_size, std::size_t n_elements, 
+
      void allocate_many(size_type elem_size, std::size_t n_elements, 
                    multiallocation_chain & chain);
      
 
      Allocates many elements of size elem_size. Elements must be individually deallocated with deallocate() 
      
 
      15. 
 
    15. 
-
      void allocate_many(const size_type * elem_sizes, size_type n_elements, 
+
      void allocate_many(const size_type * elem_sizes, size_type n_elements, 
                    multiallocation_chain & chain);
      
 
      Allocates n_elements elements, each one of size elem_sizes[i] Elements must be individually deallocated with deallocate() 
      
 
      16. 
-
    16. void deallocate_many(multiallocation_chain & chain) noexcept;
      17. 
+
    17. void deallocate_many(multiallocation_chain & chain) noexcept;
      18.
    -

    -adaptive_pool public static functions

    +

    +adaptive_pool public static functions

    1. -
      static void deallocate_free_blocks() noexcept;
      Deallocates all free blocks of the pool.
    +
    static void deallocate_free_blocks() noexcept;
    Deallocates all free blocks of the pool.
    -

    -adaptive_pool friend functions

    +

    +adaptive_pool friend functions

    1. -
      friend void swap(adaptive_pool &, adaptive_pool &) noexcept;
      +
      friend void swap(adaptive_pool &, adaptive_pool &) noexcept;

      Swaps allocators. Does not throw. If each allocator is placed in a different memory segment, the result is undefined.

    2. -
      friend bool operator==(const adaptive_pool &, const adaptive_pool &) noexcept;
      +
      friend bool operator==(const adaptive_pool &, const adaptive_pool &) noexcept;

      An allocator always compares to true, as memory allocated with one instance can be deallocated by another instance

    3. -
      friend bool operator!=(const adaptive_pool &, const adaptive_pool &) noexcept;
      +
      friend bool operator!=(const adaptive_pool &, const adaptive_pool &) noexcept;

      An allocator always compares to false, as memory allocated with one instance can be deallocated by another instance

    -

    -adaptive_pool private member functions

    -
    1. pointer priv_allocation_command(allocation_type command, 
+
      
+adaptive_pool private member functions
      
+
      1. pointer priv_allocation_command(allocation_type command, 
                                 std::size_t limit_size, 
                                 size_type & prefer_in_recvd_out_size, 
                                 pointer & reuse_ptr);
      
@@ -218,7 +218,7 @@
    -
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost/container/adaptive_pool/rebind.html b/doc/html/boost/container/adaptive_pool/rebind.html index e5e2b93000..6988baf79e 100644 --- a/doc/html/boost/container/adaptive_pool/rebind.html +++ b/doc/html/boost/container/adaptive_pool/rebind.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -39,13 +39,13 @@ typedef adaptive_pool< T2, NodesPerBlock, MaxFreeBlocks, OverheadPercent > other; };
    -

    Description

    +

    Description

    Obtains adaptive_pool from adaptive_pool

    -
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -53,7 +53,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/container/allocator.html b/doc/html/boost/container/allocator.html index 6d0799707f..21ae358cd2 100644 --- a/doc/html/boost/container/allocator.html +++ b/doc/html/boost/container/allocator.html @@ -32,7 +32,8 @@

    Synopsis

    // In header: <boost/container/allocator.hpp>
 
-template<typename T> 
+template<typename T, unsigned Version = 2, 
+         unsigned int AllocationDisableMask = 0> 
 class allocator {
 public:
   // types
@@ -53,137 +54,140 @@
   };
 
   // construct/copy/destruct
-  allocator() noexcept;
-  allocator(const allocator &) noexcept;
-  template<typename T2> allocator(const allocator< T2 > &) noexcept;
+  allocator() noexcept;
+  allocator(const allocator &) noexcept;
+  template<typename T2> allocator(const allocator< T2 > &) noexcept;
 
-  // public member functions
-  pointer allocate(size_type, const void * = 0);
-  void deallocate(pointer, size_type) noexcept;
-  size_type max_size() const noexcept;
-  pointer allocation_command(allocation_type, size_type, size_type &, 
+  // public member functions
+  pointer allocate(size_type, const void * = 0);
+  void deallocate(pointer, size_type) noexcept;
+  size_type max_size() const noexcept;
+  pointer allocation_command(allocation_type, size_type, size_type &, 
                              pointer &);
-  size_type size(pointer) const noexcept;
-  pointer allocate_one();
-  void allocate_individual(std::size_t, multiallocation_chain &);
-  void deallocate_one(pointer) noexcept;
-  void deallocate_individual(multiallocation_chain &) noexcept;
-  void allocate_many(size_type, std::size_t, multiallocation_chain &);
-  void allocate_many(const size_type *, size_type, multiallocation_chain &);
-  void deallocate_many(multiallocation_chain &) noexcept;
+  size_type size(pointer) const noexcept;
+  pointer allocate_one();
+  void allocate_individual(std::size_t, multiallocation_chain &);
+  void deallocate_one(pointer) noexcept;
+  void deallocate_individual(multiallocation_chain &) noexcept;
+  void allocate_many(size_type, std::size_t, multiallocation_chain &);
+  void allocate_many(const size_type *, size_type, multiallocation_chain &);
+  void deallocate_many(multiallocation_chain &) noexcept;
 
-  // friend functions
-  friend void swap(self_t &, self_t &) noexcept;
-  friend bool operator==(const allocator &, const allocator &) noexcept;
-  friend bool operator!=(const allocator &, const allocator &) noexcept;
+  // friend functions
+  friend void swap(self_t &, self_t &) noexcept;
+  friend bool operator==(const allocator &, const allocator &) noexcept;
+  friend bool operator!=(const allocator &, const allocator &) noexcept;
 
-  // private member functions
-  pointer priv_allocation_command(allocation_type, std::size_t, size_type &, 
+  // private member functions
+  pointer priv_allocation_command(allocation_type, std::size_t, size_type &, 
                                   pointer &);
 };
    -

    Description

    +

    Description

    +

    This class is an extended STL-compatible that offers advanced allocation mechanism (in-place expansion, shrinking, burst-allocation...)

    +

    This allocator is a wrapper around a modified DLmalloc. If Version is 1, the allocator is a STL conforming allocator. If Version is 2, the allocator offers advanced expand in place and burst allocation capabilities.

    +

    AllocationDisableMask works only if Version is 2 and it can be an inclusive OR of allocation types the user wants to disable.

    -

    +

    allocator public construct/copy/destruct

    1. -
      allocator() noexcept;
      +
      allocator() noexcept;

      Default constructor Never throws

    2. -
      allocator(const allocator &) noexcept;
      +
      allocator(const allocator &) noexcept;

      Constructor from other allocator. Never throws

    3. -
      template<typename T2> allocator(const allocator< T2 > &) noexcept;
      +
      template<typename T2> allocator(const allocator< T2 > &) noexcept;

      Constructor from related allocator. Never throws

    -

    -allocator public member functions

    +

    +allocator public member functions

    1. -
      pointer allocate(size_type count, const void * hint = 0);
      +
      pointer allocate(size_type count, const void * hint = 0);

      Allocates memory for an array of count elements. Throws std::bad_alloc if there is no enough memory If Version is 2, this allocated memory can only be deallocated with deallocate() or (for Version == 2) deallocate_many()

    2. -
      void deallocate(pointer ptr, size_type) noexcept;
      +
      void deallocate(pointer ptr, size_type) noexcept;

      Deallocates previously allocated memory. Never throws

    3. -
      size_type max_size() const noexcept;
      +
      size_type max_size() const noexcept;

      Returns the maximum number of elements that could be allocated. Never throws

    4. -
      pointer allocation_command(allocation_type command, size_type limit_size, 
+
      pointer allocation_command(allocation_type command, size_type limit_size, 
                            size_type & prefer_in_recvd_out_size, 
                            pointer & reuse);
      
 
      An advanced function that offers in-place expansion shrink to fit and new allocation capabilities. Memory allocated with this function can only be deallocated with deallocate() or deallocate_many(). This function is available only with Version == 2
    5. -
      size_type size(pointer p) const noexcept;
      +
      size_type size(pointer p) const noexcept;

      Returns maximum the number of objects the previously allocated memory pointed by p can hold. Memory must not have been allocated with allocate_one or allocate_individual. This function is available only with Version == 2

    6. -
      pointer allocate_one();
      +
      pointer allocate_one();

      Allocates just one object. Memory allocated with this function must be deallocated only with deallocate_one(). Throws bad_alloc if there is no enough memory This function is available only with Version == 2

    7. -
      void allocate_individual(std::size_t num_elements, 
+
      void allocate_individual(std::size_t num_elements, 
                          multiallocation_chain & chain);
      
 
      Allocates many elements of size == 1. Elements must be individually deallocated with deallocate_one() This function is available only with Version == 2
    8. -
      void deallocate_one(pointer p) noexcept;
      +
      void deallocate_one(pointer p) noexcept;

      Deallocates memory previously allocated with allocate_one(). You should never use deallocate_one to deallocate memory allocated with other functions different from allocate_one() or allocate_individual.

    9. -
      void deallocate_individual(multiallocation_chain & chain) noexcept;
      +
      void deallocate_individual(multiallocation_chain & chain) noexcept;

      Deallocates memory allocated with allocate_one() or allocate_individual(). This function is available only with Version == 2

    10. -
      void allocate_many(size_type elem_size, std::size_t n_elements, 
+
      void allocate_many(size_type elem_size, std::size_t n_elements, 
                    multiallocation_chain & chain);
      
 
      Allocates many elements of size elem_size. Elements must be individually deallocated with deallocate() This function is available only with Version == 2
    11. -
      void allocate_many(const size_type * elem_sizes, size_type n_elements, 
+
      void allocate_many(const size_type * elem_sizes, size_type n_elements, 
                    multiallocation_chain & chain);
      
 
      Allocates n_elements elements, each one of size elem_sizes[i] Elements must be individually deallocated with deallocate() This function is available only with Version == 2
    12. -
      void deallocate_many(multiallocation_chain & chain) noexcept;
      +
      void deallocate_many(multiallocation_chain & chain) noexcept;

      Deallocates several elements allocated by allocate_many(), allocate(), or allocation_command(). This function is available only with Version == 2

    -

    -allocator friend functions

    +

    +allocator friend functions

    1. -
      friend void swap(self_t &, self_t &) noexcept;
      +
      friend void swap(self_t &, self_t &) noexcept;

      Swaps two allocators, does nothing because this allocator is stateless

    2. -
      friend bool operator==(const allocator &, const allocator &) noexcept;
      +
      friend bool operator==(const allocator &, const allocator &) noexcept;

      An allocator always compares to true, as memory allocated with one instance can be deallocated by another instance

    3. -
      friend bool operator!=(const allocator &, const allocator &) noexcept;
      +
      friend bool operator!=(const allocator &, const allocator &) noexcept;

      An allocator always compares to false, as memory allocated with one instance can be deallocated by another instance

    -

    -allocator private member functions

    -
    1. pointer priv_allocation_command(allocation_type command, 
+
      
+allocator private member functions
      
+
      1. pointer priv_allocation_command(allocation_type command, 
                                 std::size_t limit_size, 
                                 size_type & prefer_in_recvd_out_size, 
                                 pointer & reuse_ptr);
      
@@ -192,7 +196,7 @@
    -
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost/container/allocator/rebind.html b/doc/html/boost/container/allocator/rebind.html index 017e807271..8d5ea316b0 100644 --- a/doc/html/boost/container/allocator/rebind.html +++ b/doc/html/boost/container/allocator/rebind.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -39,13 +39,13 @@ typedef allocator< T2, Version, AllocationDisableMask > other; };
    -

    Description

    +

    Description

    Obtains an allocator that allocates objects of type T2

    -
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -53,7 +53,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/container/allocator_arg.html b/doc/html/boost/container/allocator_arg.html index 0ef88c327d..3105667245 100644 --- a/doc/html/boost/container/allocator_arg.html +++ b/doc/html/boost/container/allocator_arg.html @@ -6,9 +6,9 @@ - + - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -30,17 +30,17 @@

    boost::container::allocator_arg

    Synopsis

    -
    // In header: <boost/container/scoped_allocator_fwd.hpp>
+
    // In header: <boost/container/uses_allocator_fwd.hpp>
 
 static allocator_arg_t allocator_arg;
    
 
    
-
    Description
    
+
    Description
    
 
    A instance of type allocator_arg_t
    -
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -48,7 +48,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/container/allocator_arg_t.html b/doc/html/boost/container/allocator_arg_t.html index 31b94606cf..9e6f1724cf 100644 --- a/doc/html/boost/container/allocator_arg_t.html +++ b/doc/html/boost/container/allocator_arg_t.html @@ -6,8 +6,8 @@ - - + + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -30,18 +30,18 @@

    allocator_arg_t

    Synopsis

    -
    // In header: <boost/container/scoped_allocator_fwd.hpp>
+
    // In header: <boost/container/uses_allocator_fwd.hpp>
 
 
-typedef const std::allocator_arg_t & allocator_arg_t;
    
+typedef unspecified allocator_arg_t;
    -

    Description

    +

    Description

    The allocator_arg_t struct is an empty structure type used as a unique type to disambiguate constructor and function overloading. Specifically, several types have constructors with allocator_arg_t as the first argument, immediately followed by an argument of a type that satisfies Allocator requirements

    -
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -49,7 +49,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/container/allocator_traits.html b/doc/html/boost/container/allocator_traits.html index ab648d8c10..5e076926fa 100644 --- a/doc/html/boost/container/allocator_traits.html +++ b/doc/html/boost/container/allocator_traits.html @@ -45,9 +45,9 @@ typedef see_documentation const_void_pointer; typedef see_documentation difference_type; typedef see_documentation size_type; - typedef see_documentation propagate_on_container_copy_assignment; - typedef see_documentation propagate_on_container_move_assignment; - typedef see_documentation propagate_on_container_swap; + typedef see_documentation propagate_on_container_copy_assignment; + typedef see_documentation propagate_on_container_move_assignment; + typedef see_documentation propagate_on_container_swap; typedef see_documentation is_always_equal; typedef see_documentation is_partially_propagable; typedef see_documentation rebind_alloc; @@ -60,23 +60,23 @@ typedef see_documentation type; }; - // public static functions - static pointer allocate(Allocator &, size_type); - static void deallocate(Allocator &, pointer, size_type); - static pointer allocate(Allocator &, size_type, const_void_pointer); - template<typename T> static void destroy(Allocator &, T *) noexcept; - static size_type max_size(const Allocator &) noexcept; - static Allocator select_on_container_copy_construction(const Allocator &); + // public static functions + static pointer allocate(Allocator &, size_type); + static void deallocate(Allocator &, pointer, size_type); + static pointer allocate(Allocator &, size_type, const_void_pointer); + template<typename T> static void destroy(Allocator &, T *) noexcept; + static size_type max_size(const Allocator &) noexcept; + static Allocator select_on_container_copy_construction(const Allocator &); template<typename T, class... Args> - static void construct(Allocator &, T *, Args &&...); - static bool storage_is_unpropagable(const Allocator &, pointer) noexcept; - static bool equal(const Allocator &, const Allocator &) noexcept; + static void construct(Allocator &, T *, Args &&...); + static bool storage_is_unpropagable(const Allocator &, pointer) noexcept; + static bool equal(const Allocator &, const Allocator &) noexcept; };
    -

    Description

    +

    Description

    The class template allocator_traits supplies a uniform interface to all allocator types. This class is a C++03-compatible implementation of std::allocator_traits

    -

    +

    allocator_traits public types

    @@ -123,17 +123,17 @@

  • -typedef see_documentation propagate_on_container_copy_assignment;

    +typedef see_documentation propagate_on_container_copy_assignment;

    Allocator::propagate_on_container_copy_assignment if such a type exists, otherwise a type with an internal constant static boolean member value == false.

  • -typedef see_documentation propagate_on_container_move_assignment;

    +typedef see_documentation propagate_on_container_move_assignment;

    Allocator::propagate_on_container_move_assignment if such a type exists, otherwise a type with an internal constant static boolean member value == false.

  • -typedef see_documentation propagate_on_container_swap;

    +typedef see_documentation propagate_on_container_swap;

    Allocator::propagate_on_container_swap if such a type exists, otherwise a type with an internal constant static boolean member value == false.

  • @@ -160,45 +160,45 @@
    • -

    -allocator_traits public static functions

    +

    +allocator_traits public static functions

    1. -
      static pointer allocate(Allocator & a, size_type n);
      +
      static pointer allocate(Allocator & a, size_type n);

      Returns: a.allocate(n)

    2. -
      static void deallocate(Allocator & a, pointer p, size_type n);
      +
      static void deallocate(Allocator & a, pointer p, size_type n);

      Returns: a.deallocate(p, n)

      Throws: Nothing

    3. -
      static pointer allocate(Allocator & a, size_type n, const_void_pointer p);
      +
      static pointer allocate(Allocator & a, size_type n, const_void_pointer p);

      Effects: calls a.allocate(n, p) if that call is well-formed; otherwise, invokes a.allocate(n)

    4. -
      template<typename T> static void destroy(Allocator & a, T * p) noexcept;
      +
      template<typename T> static void destroy(Allocator & a, T * p) noexcept;

      Effects: calls a.destroy(p) if that call is well-formed; otherwise, invokes p->~T().

    5. -
      static size_type max_size(const Allocator & a) noexcept;
      +
      static size_type max_size(const Allocator & a) noexcept;

      Returns: a.max_size() if that expression is well-formed; otherwise, numeric_limits<size_type>::max().

    6. -
      static Allocator select_on_container_copy_construction(const Allocator & a);
      +
      static Allocator select_on_container_copy_construction(const Allocator & a);

      Returns: a.select_on_container_copy_construction() if that expression is well-formed; otherwise, a. 

    7. template<typename T, class... Args> 
-  static void construct(Allocator & a, T * p, Args &&... args);
      + static void construct(Allocator & a, T * p, Args &&... args);

      Effects: calls a.construct(p, std::forward<Args>(args)...) if that call is well-formed; otherwise, invokes ::new (static_cast<void*>(p)) T(std::forward<Args>(args)...)

    8. -
      static bool storage_is_unpropagable(const Allocator & a, pointer p) noexcept;
      +
      static bool storage_is_unpropagable(const Allocator & a, pointer p) noexcept;

      Returns: a.storage_is_unpropagable(p) if is_partially_propagable::value is true; otherwise, false.

    9. -
      static bool equal(const Allocator & a, const Allocator & b) noexcept;
      +
      static bool equal(const Allocator & a, const Allocator & b) noexcept;

      Returns: true if is_always_equal::value == true, otherwise, a == b.

    @@ -207,7 +207,7 @@
    -
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost/container/allocator_traits/portable_rebind_alloc.html b/doc/html/boost/container/allocator_traits/portable_rebind_alloc.html index 5e3971a65c..98a2d9e8b9 100644 --- a/doc/html/boost/container/allocator_traits/portable_rebind_alloc.html +++ b/doc/html/boost/container/allocator_traits/portable_rebind_alloc.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -39,13 +39,13 @@ typedef see_documentation type; };
    -

    Description

    +

    Description

    Non-standard extension: Portable allocator rebind for C++03 and C++11 compilers. type is an allocator related to Allocator deduced deduced by rules explained in rebind_alloc.

    -
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -53,7 +53,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/container/basic_string.html b/doc/html/boost/container/basic_string.html index bf6639ded4..c05b800777 100644 --- a/doc/html/boost/container/basic_string.html +++ b/doc/html/boost/container/basic_string.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -53,148 +53,155 @@ typedef implementation_defined const_reverse_iterator; // construct/copy/destruct - basic_string(); - explicit basic_string(const allocator_type &) noexcept; - basic_string(const basic_string &); - basic_string(basic_string &&) noexcept; - basic_string(const basic_string &, const allocator_type &); - basic_string(basic_string &&, const allocator_type &); - basic_string(const basic_string &, size_type, size_type = npos, - const allocator_type & = allocator_type()); - basic_string(const CharT *, size_type, - const allocator_type & = allocator_type()); - basic_string(const CharT *, const allocator_type & = allocator_type()); - basic_string(size_type, CharT, const allocator_type & = allocator_type()); - basic_string(size_type, default_init_t, - const allocator_type & = allocator_type()); + basic_string(); + explicit basic_string(const allocator_type &) noexcept; + basic_string(const basic_string &); + basic_string(basic_string &&) noexcept; + basic_string(const basic_string &, const allocator_type &); + basic_string(basic_string &&, const allocator_type &); + basic_string(const basic_string &, size_type, size_type = npos); + basic_string(const basic_string &, size_type, size_type, + const allocator_type &); + basic_string(const CharT *, size_type); + basic_string(const CharT *, size_type, const allocator_type &); + basic_string(const CharT *); + basic_string(const CharT *, const allocator_type &); + basic_string(size_type, CharT); + basic_string(size_type, CharT, const allocator_type &); + basic_string(size_type, default_init_t); + basic_string(size_type, default_init_t, const allocator_type &); + template<typename InputIterator> basic_string(InputIterator, InputIterator); template<typename InputIterator> - basic_string(InputIterator, InputIterator, - const allocator_type & = allocator_type()); - basic_string & operator=(const basic_string &); + basic_string(InputIterator, InputIterator, const allocator_type &); + basic_string & operator=(const basic_string &); basic_string & - operator=(basic_string &&) noexcept(allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value)); - basic_string & operator=(const CharT *); - basic_string & operator=(CharT); - ~basic_string(); + operator=(basic_string &&) noexcept(allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value)); + basic_string & operator=(const CharT *); + basic_string & operator=(CharT); + ~basic_string(); - // public member functions - allocator_type get_allocator() const noexcept; - stored_allocator_type & get_stored_allocator() noexcept; - const stored_allocator_type & get_stored_allocator() const noexcept; - iterator begin() noexcept; - const_iterator begin() const noexcept; - iterator end() noexcept; - const_iterator end() const noexcept; - reverse_iterator rbegin() noexcept; - const_reverse_iterator rbegin() const noexcept; - reverse_iterator rend() noexcept; - const_reverse_iterator rend() const noexcept; - const_iterator cbegin() const noexcept; - const_iterator cend() const noexcept; - const_reverse_iterator crbegin() const noexcept; - const_reverse_iterator crend() const noexcept; - bool empty() const noexcept; - size_type size() const noexcept; - size_type length() const noexcept; - size_type max_size() const noexcept; - void resize(size_type, CharT); - void resize(size_type); - void resize(size_type, default_init_t); - size_type capacity() const noexcept; - void reserve(size_type); - void shrink_to_fit(); - reference operator[](size_type) noexcept; - const_reference operator[](size_type) const noexcept; - reference at(size_type); - const_reference at(size_type) const; - basic_string & operator+=(const basic_string &); - basic_string & operator+=(const CharT *); - basic_string & operator+=(CharT); - basic_string & append(const basic_string &); - basic_string & append(const basic_string &, size_type, size_type); - basic_string & append(const CharT *, size_type); - basic_string & append(const CharT *); - basic_string & append(size_type, CharT); - template<typename InputIter> basic_string & append(InputIter, InputIter); - void push_back(CharT); - basic_string & assign(const basic_string &); - basic_string & assign(basic_string &&) noexcept; - basic_string & assign(const basic_string &, size_type, size_type); - basic_string & assign(const CharT *, size_type); - basic_string & assign(const CharT *); - basic_string & assign(size_type, CharT); - basic_string & assign(const CharT *, const CharT *); - template<typename InputIter> basic_string & assign(InputIter, InputIter); - basic_string & insert(size_type, const basic_string &); - basic_string & insert(size_type, const basic_string &, size_type, size_type); - basic_string & insert(size_type, const CharT *, size_type); - basic_string & insert(size_type, const CharT *); - basic_string & insert(size_type, size_type, CharT); - iterator insert(const_iterator, CharT); - iterator insert(const_iterator, size_type, CharT); + // public member functions + allocator_type get_allocator() const noexcept; + stored_allocator_type & get_stored_allocator() noexcept; + const stored_allocator_type & get_stored_allocator() const noexcept; + iterator begin() noexcept; + const_iterator begin() const noexcept; + iterator end() noexcept; + const_iterator end() const noexcept; + reverse_iterator rbegin() noexcept; + const_reverse_iterator rbegin() const noexcept; + reverse_iterator rend() noexcept; + const_reverse_iterator rend() const noexcept; + const_iterator cbegin() const noexcept; + const_iterator cend() const noexcept; + const_reverse_iterator crbegin() const noexcept; + const_reverse_iterator crend() const noexcept; + bool empty() const noexcept; + size_type size() const noexcept; + size_type length() const noexcept; + size_type max_size() const noexcept; + void resize(size_type, CharT); + void resize(size_type); + void resize(size_type, default_init_t); + size_type capacity() const noexcept; + void reserve(size_type); + void shrink_to_fit(); + reference front() noexcept; + const_reference front() const noexcept; + reference back() noexcept; + const_reference back() const noexcept; + reference operator[](size_type) noexcept; + const_reference operator[](size_type) const noexcept; + reference at(size_type); + const_reference at(size_type) const; + basic_string & operator+=(const basic_string &); + basic_string & operator+=(const CharT *); + basic_string & operator+=(CharT); + basic_string & append(const basic_string &); + basic_string & append(const basic_string &, size_type, size_type); + basic_string & append(const CharT *, size_type); + basic_string & append(const CharT *); + basic_string & append(size_type, CharT); + template<typename InputIter> basic_string & append(InputIter, InputIter); + void push_back(CharT); + basic_string & assign(const basic_string &); + basic_string & assign(basic_string &&) noexcept; + basic_string & assign(const basic_string &, size_type, size_type); + basic_string & assign(const CharT *, size_type); + basic_string & assign(const CharT *); + basic_string & assign(size_type, CharT); + basic_string & assign(const CharT *, const CharT *); + template<typename InputIter> basic_string & assign(InputIter, InputIter); + basic_string & insert(size_type, const basic_string &); + basic_string & insert(size_type, const basic_string &, size_type, size_type); + basic_string & insert(size_type, const CharT *, size_type); + basic_string & insert(size_type, const CharT *); + basic_string & insert(size_type, size_type, CharT); + iterator insert(const_iterator, CharT); + iterator insert(const_iterator, size_type, CharT); template<typename InputIter> - iterator insert(const_iterator, InputIter, InputIter); - basic_string & erase(size_type = 0, size_type = npos); - iterator erase(const_iterator) noexcept; - iterator erase(const_iterator, const_iterator) noexcept; - void pop_back() noexcept; - void clear() noexcept; - basic_string & replace(size_type, size_type, const basic_string &); + iterator insert(const_iterator, InputIter, InputIter); + void pop_back() noexcept; + basic_string & erase(size_type = 0, size_type = npos); + iterator erase(const_iterator) noexcept; + iterator erase(const_iterator, const_iterator) noexcept; + void clear() noexcept; + basic_string & replace(size_type, size_type, const basic_string &); basic_string & - replace(size_type, size_type, const basic_string &, size_type, size_type); - basic_string & replace(size_type, size_type, const CharT *, size_type); - basic_string & replace(size_type, size_type, const CharT *); - basic_string & replace(size_type, size_type, size_type, CharT); - basic_string & replace(const_iterator, const_iterator, const basic_string &); + replace(size_type, size_type, const basic_string &, size_type, size_type); + basic_string & replace(size_type, size_type, const CharT *, size_type); + basic_string & replace(size_type, size_type, const CharT *); + basic_string & replace(size_type, size_type, size_type, CharT); + basic_string & replace(const_iterator, const_iterator, const basic_string &); basic_string & - replace(const_iterator, const_iterator, const CharT *, size_type); - basic_string & replace(const_iterator, const_iterator, const CharT *); - basic_string & replace(const_iterator, const_iterator, size_type, CharT); + replace(const_iterator, const_iterator, const CharT *, size_type); + basic_string & replace(const_iterator, const_iterator, const CharT *); + basic_string & replace(const_iterator, const_iterator, size_type, CharT); template<typename InputIter> basic_string & - replace(const_iterator, const_iterator, InputIter, InputIter); - size_type copy(CharT *, size_type, size_type = 0) const; - void swap(basic_string &) noexcept(allocator_traits_type::propagate_on_container_swap::value||allocator_traits_type::is_always_equal::value)); - const CharT * c_str() const noexcept; - const CharT * data() const noexcept; - size_type find(const basic_string &, size_type = 0) const; - size_type find(const CharT *, size_type, size_type) const; - size_type find(const CharT *, size_type = 0) const; - size_type find(CharT, size_type = 0) const; - size_type rfind(const basic_string &, size_type = npos) const; - size_type rfind(const CharT *, size_type, size_type) const; - size_type rfind(const CharT *, size_type = npos) const; - size_type rfind(CharT, size_type = npos) const; - size_type find_first_of(const basic_string &, size_type = 0) const; - size_type find_first_of(const CharT *, size_type, size_type) const; - size_type find_first_of(const CharT *, size_type = 0) const; - size_type find_first_of(CharT, size_type = 0) const; - size_type find_last_of(const basic_string &, size_type = npos) const; - size_type find_last_of(const CharT *, size_type, size_type) const; - size_type find_last_of(const CharT *, size_type = npos) const; - size_type find_last_of(CharT, size_type = npos) const; - size_type find_first_not_of(const basic_string &, size_type = 0) const; - size_type find_first_not_of(const CharT *, size_type, size_type) const; - size_type find_first_not_of(const CharT *, size_type = 0) const; - size_type find_first_not_of(CharT, size_type = 0) const; - size_type find_last_not_of(const basic_string &, size_type = npos) const; - size_type find_last_not_of(const CharT *, size_type, size_type) const; - size_type find_last_not_of(const CharT *, size_type = npos) const; - size_type find_last_not_of(CharT, size_type = npos) const; - basic_string substr(size_type = 0, size_type = npos) const; - int compare(const basic_string &) const; - int compare(size_type, size_type, const basic_string &) const; - int compare(size_type, size_type, const basic_string &, size_type, + replace(const_iterator, const_iterator, InputIter, InputIter); + size_type copy(CharT *, size_type, size_type = 0) const; + void swap(basic_string &) noexcept(allocator_traits_type::propagate_on_container_swap::value||allocator_traits_type::is_always_equal::value)); + const CharT * c_str() const noexcept; + const CharT * data() const noexcept; + size_type find(const basic_string &, size_type = 0) const; + size_type find(const CharT *, size_type, size_type) const; + size_type find(const CharT *, size_type = 0) const; + size_type find(CharT, size_type = 0) const; + size_type rfind(const basic_string &, size_type = npos) const; + size_type rfind(const CharT *, size_type, size_type) const; + size_type rfind(const CharT *, size_type = npos) const; + size_type rfind(CharT, size_type = npos) const; + size_type find_first_of(const basic_string &, size_type = 0) const; + size_type find_first_of(const CharT *, size_type, size_type) const; + size_type find_first_of(const CharT *, size_type = 0) const; + size_type find_first_of(CharT, size_type = 0) const; + size_type find_last_of(const basic_string &, size_type = npos) const; + size_type find_last_of(const CharT *, size_type, size_type) const; + size_type find_last_of(const CharT *, size_type = npos) const; + size_type find_last_of(CharT, size_type = npos) const; + size_type find_first_not_of(const basic_string &, size_type = 0) const; + size_type find_first_not_of(const CharT *, size_type, size_type) const; + size_type find_first_not_of(const CharT *, size_type = 0) const; + size_type find_first_not_of(CharT, size_type = 0) const; + size_type find_last_not_of(const basic_string &, size_type = npos) const; + size_type find_last_not_of(const CharT *, size_type, size_type) const; + size_type find_last_not_of(const CharT *, size_type = npos) const; + size_type find_last_not_of(CharT, size_type = npos) const; + basic_string substr(size_type = 0, size_type = npos) const; + int compare(const basic_string &) const; + int compare(size_type, size_type, const basic_string &) const; + int compare(size_type, size_type, const basic_string &, size_type, size_type) const; - int compare(const CharT *) const; - int compare(size_type, size_type, const CharT *, size_type) const; - int compare(size_type, size_type, const CharT *) const; + int compare(const CharT *) const; + int compare(size_type, size_type, const CharT *, size_type) const; + int compare(size_type, size_type, const CharT *) const; // public data members static const size_type npos; };
    -

    Description

    +

    Description

    The basic_string class represents a Sequence of characters. It contains all the usual operations of a Sequence, and, additionally, it contains standard string operations such as search and concatenation.

    The basic_string class is parameterized by character type, and by that type's Character Traits.

    This class has performance characteristics very much like vector<>, meaning, for example, that it does not perform reference-count or copy-on-write, and that concatenation of two strings is an O(N) operation.

    @@ -204,7 +211,7 @@

    -

    Template Parameters

    +

    Template Parameters

    1. typename CharT
      @@ -221,96 +228,117 @@
    -

    +

    basic_string public construct/copy/destruct

    1. -
      basic_string();
      +
      basic_string();

      Effects: Default constructs a basic_string.

      Throws: If allocator_type's default constructor throws.

    2. -
      explicit basic_string(const allocator_type & a) noexcept;
      +
      explicit basic_string(const allocator_type & a) noexcept;

      Effects: Constructs a basic_string taking the allocator as parameter.

      Throws: Nothing

    3. -
      basic_string(const basic_string & s);
      +
      basic_string(const basic_string & s);

      Effects: Copy constructs a basic_string.

      Postcondition: x == *this.

      Throws: If allocator_type's default constructor or allocation throws.

    4. -
      basic_string(basic_string && s) noexcept;
      +
      basic_string(basic_string && s) noexcept;

      Effects: Move constructor. Moves s's resources to *this.

      Throws: Nothing.

      Complexity: Constant.

    5. -
      basic_string(const basic_string & s, const allocator_type & a);
      +
      basic_string(const basic_string & s, const allocator_type & a);

      Effects: Copy constructs a basic_string using the specified allocator.

      Postcondition: x == *this.

      Throws: If allocation throws.

    6. -
      basic_string(basic_string && s, const allocator_type & a);
      +
      basic_string(basic_string && s, const allocator_type & a);

      Effects: Move constructor using the specified allocator. Moves s's resources to *this.

      Throws: If allocation throws.

      Complexity: Constant if a == s.get_allocator(), linear otherwise.

    7. -
      basic_string(const basic_string & s, size_type pos, size_type n = npos, 
-             const allocator_type & a = allocator_type());
      +
      basic_string(const basic_string & s, size_type pos, size_type n = npos);
      +

      Effects: Constructs a basic_string with a default-constructed allocator, and is initialized by a specific number of characters of the s string.

      +
      8. +
    8. +
      basic_string(const basic_string & s, size_type pos, size_type n, 
+             const allocator_type & a);

      Effects: Constructs a basic_string taking the allocator as parameter, and is initialized by a specific number of characters of the s string.

    9. -
      basic_string(const CharT * s, size_type n, 
-             const allocator_type & a = allocator_type());
      +
      basic_string(const CharT * s, size_type n);
      +

      Effects: Constructs a basic_string taking a default-constructed allocator, and is initialized by a specific number of characters of the s c-string.

      +
      10. +
    10. +
      basic_string(const CharT * s, size_type n, const allocator_type & a);

      Effects: Constructs a basic_string taking the allocator as parameter, and is initialized by a specific number of characters of the s c-string.

    11. -
      basic_string(const CharT * s, const allocator_type & a = allocator_type());
      +
      basic_string(const CharT * s);
      +

      Effects: Constructs a basic_string with a default-constructed allocator, and is initialized by the null-terminated s c-string.

      +
      12. +
    12. +
      basic_string(const CharT * s, const allocator_type & a);

      Effects: Constructs a basic_string taking the allocator as parameter, and is initialized by the null-terminated s c-string.

    13. -
      basic_string(size_type n, CharT c, 
-             const allocator_type & a = allocator_type());
      +
      basic_string(size_type n, CharT c);
      +

      Effects: Constructs a basic_string with a default-constructed allocator, and is initialized by n copies of c.

      +
      14. +
    14. +
      basic_string(size_type n, CharT c, const allocator_type & a);

      Effects: Constructs a basic_string taking the allocator as parameter, and is initialized by n copies of c.

    15. -
      basic_string(size_type n, default_init_t, 
-             const allocator_type & a = allocator_type());
      +
      basic_string(size_type n, default_init_t);
      +

      Effects: Constructs a basic_string with a default-constructed allocator, and is initialized by n default-initialized characters.

      +
      16. +
    16. +
      basic_string(size_type n, default_init_t, const allocator_type & a);

      Effects: Constructs a basic_string taking the allocator as parameter, and is initialized by n default-initialized characters. 

    17. template<typename InputIterator> 
-  basic_string(InputIterator f, InputIterator l, 
-               const allocator_type & a = allocator_type());
      + basic_string(InputIterator f, InputIterator l); +

      Effects: Constructs a basic_string with a default-constructed allocator, and a range of iterators.

      +
      18. +
    18. +
      template<typename InputIterator> 
+  basic_string(InputIterator f, InputIterator l, const allocator_type & a);

      Effects: Constructs a basic_string taking the allocator as parameter, and a range of iterators.

    19. -
      basic_string & operator=(const basic_string & x);
      +
      basic_string & operator=(const basic_string & x);

      Effects: Copy constructs a string.

      Postcondition: x == *this.

      Complexity: Linear to the elements x contains. 

    20. basic_string & 
-operator=(basic_string && x) noexcept(allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value));
      +operator=(basic_string && x) noexcept(allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value));

      Effects: Move constructor. Moves x's resources to *this.

      Throws: If allocator_traits_type::propagate_on_container_move_assignment is false and allocation throws

      Complexity: Constant if allocator_traits_type:: propagate_on_container_move_assignment is true or this->get>allocator() == x.get_allocator(). Linear otherwise.

    21. -
      basic_string & operator=(const CharT * s);
      +
      basic_string & operator=(const CharT * s);
      Effects: Assignment from a null-terminated c-string.
    22. -
      basic_string & operator=(CharT c);
      +
      basic_string & operator=(CharT c);
      Effects: Assignment from character.
    23. -
      ~basic_string();
      +
      ~basic_string();

      Effects: Destroys the basic_string. All used memory is deallocated.

      Throws: Nothing.

      Complexity: Constant.

      @@ -318,292 +346,320 @@
    -

    -basic_string public member functions

    +

    +basic_string public member functions

    1. -
      allocator_type get_allocator() const noexcept;
      +
      allocator_type get_allocator() const noexcept;

      Effects: Returns a copy of the internal allocator.

      Throws: If allocator's copy constructor throws.

      Complexity: Constant.

    2. -
      stored_allocator_type & get_stored_allocator() noexcept;
      +
      stored_allocator_type & get_stored_allocator() noexcept;

      Effects: Returns a reference to the internal allocator.

      Throws: Nothing

      Complexity: Constant.

      Note: Non-standard extension.

    3. -
      const stored_allocator_type & get_stored_allocator() const noexcept;
      +
      const stored_allocator_type & get_stored_allocator() const noexcept;

      Effects: Returns a reference to the internal allocator.

      Throws: Nothing

      Complexity: Constant.

      Note: Non-standard extension.

    4. -
      iterator begin() noexcept;
      +
      iterator begin() noexcept;

      Effects: Returns an iterator to the first element contained in the vector.

      Throws: Nothing.

      Complexity: Constant.

    5. -
      const_iterator begin() const noexcept;
      +
      const_iterator begin() const noexcept;

      Effects: Returns a const_iterator to the first element contained in the vector.

      Throws: Nothing.

      Complexity: Constant.

    6. -
      iterator end() noexcept;
      +
      iterator end() noexcept;

      Effects: Returns an iterator to the end of the vector.

      Throws: Nothing.

      Complexity: Constant.

    7. -
      const_iterator end() const noexcept;
      +
      const_iterator end() const noexcept;

      Effects: Returns a const_iterator to the end of the vector.

      Throws: Nothing.

      Complexity: Constant.

    8. -
      reverse_iterator rbegin() noexcept;
      +
      reverse_iterator rbegin() noexcept;

      Effects: Returns a reverse_iterator pointing to the beginning of the reversed vector.

      Throws: Nothing.

      Complexity: Constant.

    9. -
      const_reverse_iterator rbegin() const noexcept;
      +
      const_reverse_iterator rbegin() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed vector.

      Throws: Nothing.

      Complexity: Constant.

    10. -
      reverse_iterator rend() noexcept;
      +
      reverse_iterator rend() noexcept;

      Effects: Returns a reverse_iterator pointing to the end of the reversed vector.

      Throws: Nothing.

      Complexity: Constant.

    11. -
      const_reverse_iterator rend() const noexcept;
      +
      const_reverse_iterator rend() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed vector.

      Throws: Nothing.

      Complexity: Constant.

    12. -
      const_iterator cbegin() const noexcept;
      +
      const_iterator cbegin() const noexcept;

      Effects: Returns a const_iterator to the first element contained in the vector.

      Throws: Nothing.

      Complexity: Constant.

    13. -
      const_iterator cend() const noexcept;
      +
      const_iterator cend() const noexcept;

      Effects: Returns a const_iterator to the end of the vector.

      Throws: Nothing.

      Complexity: Constant.

    14. -
      const_reverse_iterator crbegin() const noexcept;
      +
      const_reverse_iterator crbegin() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed vector.

      Throws: Nothing.

      Complexity: Constant.

    15. -
      const_reverse_iterator crend() const noexcept;
      +
      const_reverse_iterator crend() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed vector.

      Throws: Nothing.

      Complexity: Constant.

    16. -
      bool empty() const noexcept;
      +
      bool empty() const noexcept;

      Effects: Returns true if the vector contains no elements.

      Throws: Nothing.

      Complexity: Constant.

    17. -
      size_type size() const noexcept;
      +
      size_type size() const noexcept;

      Effects: Returns the number of the elements contained in the vector.

      Throws: Nothing.

      Complexity: Constant.

    18. -
      size_type length() const noexcept;
      +
      size_type length() const noexcept;

      Effects: Returns the number of the elements contained in the vector.

      Throws: Nothing.

      Complexity: Constant.

    19. -
      size_type max_size() const noexcept;
      +
      size_type max_size() const noexcept;

      Effects: Returns the largest possible size of the vector.

      Throws: Nothing.

      Complexity: Constant.

    20. -
      void resize(size_type n, CharT c);
      +
      void resize(size_type n, CharT c);

      Effects: Inserts or erases elements at the end such that the size becomes n. New elements are copy constructed from x.

      Throws: If memory allocation throws

      Complexity: Linear to the difference between size() and new_size.

    21. -
      void resize(size_type n);
      +
      void resize(size_type n);

      Effects: Inserts or erases elements at the end such that the size becomes n. New elements are value initialized.

      Throws: If memory allocation throws

      Complexity: Linear to the difference between size() and new_size.

    22. -
      void resize(size_type n, default_init_t);
      +
      void resize(size_type n, default_init_t);

      Effects: Inserts or erases elements at the end such that the size becomes n. New elements are uninitialized.

      Throws: If memory allocation throws

      Complexity: Linear to the difference between size() and new_size.

      Note: Non-standard extension

    23. -
      size_type capacity() const noexcept;
      +
      size_type capacity() const noexcept;

      Effects: Number of elements for which memory has been allocated. capacity() is always greater than or equal to size().

      Throws: Nothing.

      Complexity: Constant.

    24. -
      void reserve(size_type res_arg);
      +
      void reserve(size_type res_arg);

      Effects: If n is less than or equal to capacity(), this call has no effect. Otherwise, it is a request for allocation of additional memory. If the request is successful, then capacity() is greater than or equal to n; otherwise, capacity() is unchanged. In either case, size() is unchanged.

      Throws: If memory allocation allocation throws

    25. -
      void shrink_to_fit();
      +
      void shrink_to_fit();

      Effects: Tries to deallocate the excess of memory created with previous allocations. The size of the string is unchanged

      Throws: Nothing

      Complexity: Linear to size().

    26. -
      reference operator[](size_type n) noexcept;
      +
      reference front() noexcept;
      +

      Requires: !empty()

      +

      Effects: Returns a reference to the first element of the container.

      +

      Throws: Nothing.

      +

      Complexity: Constant.

      +
      27. +
    27. +
      const_reference front() const noexcept;
      +

      Requires: !empty()

      +

      Effects: Returns a const reference to the first element of the container.

      +

      Throws: Nothing.

      +

      Complexity: Constant.

      +
      28. +
    28. +
      reference back() noexcept;
      +

      Requires: !empty()

      +

      Effects: Returns a reference to the last element of the container.

      +

      Throws: Nothing.

      +

      Complexity: Constant.

      +
      29. +
    29. +
      const_reference back() const noexcept;
      +

      Requires: !empty()

      +

      Effects: Returns a const reference to the last element of the container.

      +

      Throws: Nothing.

      +

      Complexity: Constant.

      +
      30. +
    30. +
      reference operator[](size_type n) noexcept;

      Requires: size() > n.

      Effects: Returns a reference to the nth element from the beginning of the container.

      Throws: Nothing.

      Complexity: Constant.

    31. -
      const_reference operator[](size_type n) const noexcept;
      +
      const_reference operator[](size_type n) const noexcept;

      Requires: size() > n.

      Effects: Returns a const reference to the nth element from the beginning of the container.

      Throws: Nothing.

      Complexity: Constant.

    32. -
      reference at(size_type n);
      +
      reference at(size_type n);

      Requires: size() > n.

      Effects: Returns a reference to the nth element from the beginning of the container.

      Throws: std::range_error if n >= size()

      Complexity: Constant.

    33. -
      const_reference at(size_type n) const;
      +
      const_reference at(size_type n) const;

      Requires: size() > n.

      Effects: Returns a const reference to the nth element from the beginning of the container.

      Throws: std::range_error if n >= size()

      Complexity: Constant.

    34. -
      basic_string & operator+=(const basic_string & s);
      +
      basic_string & operator+=(const basic_string & s);

      Effects: Calls append(str.data, str.size()).

      Returns: *this

    35. -
      basic_string & operator+=(const CharT * s);
      +
      basic_string & operator+=(const CharT * s);

      Effects: Calls append(s).

      Returns: *this

    36. -
      basic_string & operator+=(CharT c);
      +
      basic_string & operator+=(CharT c);

      Effects: Calls append(1, c).

      Returns: *this

    37. -
      basic_string & append(const basic_string & s);
      +
      basic_string & append(const basic_string & s);

      Effects: Calls append(str.data(), str.size()).

      Returns: *this

    38. -
      basic_string & append(const basic_string & s, size_type pos, size_type n);
      +
      basic_string & append(const basic_string & s, size_type pos, size_type n);

      Requires: pos <= str.size()

      Effects: Determines the effective length rlen of the string to append as the smaller of n and str.size() - pos and calls append(str.data() + pos, rlen).

      Throws: If memory allocation throws and out_of_range if pos > str.size()

      Returns: *this

    39. -
      basic_string & append(const CharT * s, size_type n);
      +
      basic_string & append(const CharT * s, size_type n);

      Requires: s points to an array of at least n elements of CharT.

      Effects: The function replaces the string controlled by *this with a string of length size() + n whose irst size() elements are a copy of the original string controlled by *this and whose remaining elements are a copy of the initial n elements of s.

      Throws: If memory allocation throws length_error if size() + n > max_size().

      Returns: *this

    40. -
      basic_string & append(const CharT * s);
      +
      basic_string & append(const CharT * s);

      Requires: s points to an array of at least traits::length(s) + 1 elements of CharT.

      Effects: Calls append(s, traits::length(s)).

      Returns: *this

    41. -
      basic_string & append(size_type n, CharT c);
      +
      basic_string & append(size_type n, CharT c);

      Effects: Equivalent to append(basic_string(n, c)).

      Returns: *this 

    42. template<typename InputIter> 
-  basic_string & append(InputIter first, InputIter last);
      + basic_string & append(InputIter first, InputIter last);

      Requires: [first,last) is a valid range.

      Effects: Equivalent to append(basic_string(first, last)).

      Returns: *this

    43. -
      void push_back(CharT c);
      +
      void push_back(CharT c);
      Effects: Equivalent to append(static_cast<size_type>(1), c).
    44. -
      basic_string & assign(const basic_string & s);
      +
      basic_string & assign(const basic_string & s);

      Effects: Equivalent to assign(str, 0, npos).

      Returns: *this

    45. -
      basic_string & assign(basic_string && ms) noexcept;
      +
      basic_string & assign(basic_string && ms) noexcept;

      Effects: The function replaces the string controlled by *this with a string of length str.size() whose elements are a copy of the string controlled by str. Leaves str in a valid but unspecified state.

      Throws: Nothing

      Returns: *this

    46. -
      basic_string & assign(const basic_string & s, size_type pos, size_type n);
      +
      basic_string & assign(const basic_string & s, size_type pos, size_type n);

      Requires: pos <= str.size()

      Effects: Determines the effective length rlen of the string to assign as the smaller of n and str.size() - pos and calls assign(str.data() + pos rlen).

      Throws: If memory allocation throws or out_of_range if pos > str.size().

      Returns: *this

    47. -
      basic_string & assign(const CharT * s, size_type n);
      +
      basic_string & assign(const CharT * s, size_type n);

      Requires: s points to an array of at least n elements of CharT.

      Effects: Replaces the string controlled by *this with a string of length n whose elements are a copy of those pointed to by s.

      Throws: If memory allocation throws or length_error if n > max_size().

      Returns: *this

    48. -
      basic_string & assign(const CharT * s);
      +
      basic_string & assign(const CharT * s);

      Requires: s points to an array of at least traits::length(s) + 1 elements of CharT.

      Effects: Calls assign(s, traits::length(s)).

      Returns: *this

    49. -
      basic_string & assign(size_type n, CharT c);
      +
      basic_string & assign(size_type n, CharT c);

      Effects: Equivalent to assign(basic_string(n, c)).

      Returns: *this

    50. -
      basic_string & assign(const CharT * first, const CharT * last);
      +
      basic_string & assign(const CharT * first, const CharT * last);

      Effects: Equivalent to assign(basic_string(first, last)). Returns: *this 

    51. template<typename InputIter> 
-  basic_string & assign(InputIter first, InputIter last);
      + basic_string & assign(InputIter first, InputIter last);

      Effects: Equivalent to assign(basic_string(first, last)).

      Returns: *this

    52. -
      basic_string & insert(size_type pos, const basic_string & s);
      +
      basic_string & insert(size_type pos, const basic_string & s);

      Requires: pos <= size().

      Effects: Calls insert(pos, str.data(), str.size()).

      Throws: If memory allocation throws or out_of_range if pos > size().

      @@ -611,85 +667,85 @@ 
    53. basic_string & 
-insert(size_type pos1, const basic_string & s, size_type pos2, size_type n);
      +insert(size_type pos1, const basic_string & s, size_type pos2, size_type n);

      Requires: pos1 <= size() and pos2 <= str.size()

      Effects: Determines the effective length rlen of the string to insert as the smaller of n and str.size() - pos2 and calls insert(pos1, str.data() + pos2, rlen).

      Throws: If memory allocation throws or out_of_range if pos1 > size() or pos2 > str.size().

      Returns: *this

    54. -
      basic_string & insert(size_type pos, const CharT * s, size_type n);
      +
      basic_string & insert(size_type pos, const CharT * s, size_type n);

      Requires: s points to an array of at least n elements of CharT and pos <= size().

      Effects: Replaces the string controlled by *this with a string of length size() + n whose first pos elements are a copy of the initial elements of the original string controlled by *this and whose next n elements are a copy of the elements in s and whose remaining elements are a copy of the remaining elements of the original string controlled by *this.

      Throws: If memory allocation throws, out_of_range if pos > size() or length_error if size() + n > max_size().

      Returns: *this

    55. -
      basic_string & insert(size_type pos, const CharT * s);
      +
      basic_string & insert(size_type pos, const CharT * s);

      Requires: pos <= size() and s points to an array of at least traits::length(s) + 1 elements of CharT

      Effects: Calls insert(pos, s, traits::length(s)).

      Throws: If memory allocation throws, out_of_range if pos > size() length_error if size() > max_size() - Traits::length(s)

      Returns: *this

    56. -
      basic_string & insert(size_type pos, size_type n, CharT c);
      +
      basic_string & insert(size_type pos, size_type n, CharT c);

      Effects: Equivalent to insert(pos, basic_string(n, c)).

      Throws: If memory allocation throws, out_of_range if pos > size() length_error if size() > max_size() - n

      Returns: *this

    57. -
      iterator insert(const_iterator p, CharT c);
      +
      iterator insert(const_iterator p, CharT c);

      Requires: p is a valid iterator on *this.

      Effects: inserts a copy of c before the character referred to by p.

      Returns: An iterator which refers to the copy of the inserted character.

    58. -
      iterator insert(const_iterator p, size_type n, CharT c);
      +
      iterator insert(const_iterator p, size_type n, CharT c);

      Requires: p is a valid iterator on *this.

      Effects: Inserts n copies of c before the character referred to by p.

      Returns: an iterator to the first inserted element or p if n is 0. 

    59. template<typename InputIter> 
-  iterator insert(const_iterator p, InputIter first, InputIter last);
      + iterator insert(const_iterator p, InputIter first, InputIter last);

      Requires: p is a valid iterator on *this. [first,last) is a valid range.

      Effects: Equivalent to insert(p - begin(), basic_string(first, last)).

      Returns: an iterator to the first inserted element or p if first == last.

    60. -
      basic_string & erase(size_type pos = 0, size_type n = npos);
      +
      void pop_back() noexcept;
      +

      Effects: Removes the last element from the container.

      +

      Throws: Nothing.

      +

      Complexity: Constant time.

      +
      61. +
    61. +
      basic_string & erase(size_type pos = 0, size_type n = npos);

      Requires: pos <= size()

      Effects: Determines the effective length xlen of the string to be removed as the smaller of n and size() - pos. The function then replaces the string controlled by *this with a string of length size() - xlen whose first pos elements are a copy of the initial elements of the original string controlled by *this, and whose remaining elements are a copy of the elements of the original string controlled by *this beginning at position pos + xlen.

      Throws: out_of_range if pos > size().

      Returns: *this

    62. -
      iterator erase(const_iterator p) noexcept;
      +
      iterator erase(const_iterator p) noexcept;

      Effects: Removes the character referred to by p.

      Throws: Nothing

      Returns: An iterator which points to the element immediately following p prior to the element being erased. If no such element exists, end() is returned.

    63. -
      iterator erase(const_iterator first, const_iterator last) noexcept;
      +
      iterator erase(const_iterator first, const_iterator last) noexcept;

      Requires: first and last are valid iterators on *this, defining a range [first,last).

      Effects: Removes the characters in the range [first,last).

      Throws: Nothing

      Returns: An iterator which points to the element pointed to by last prior to the other elements being erased. If no such element exists, end() is returned.

    64. -
      void pop_back() noexcept;
      -

      Requires: !empty()

      -

      Throws: Nothing

      -

      Effects: Equivalent to erase(size() - 1, 1).

      -
      65. -
    65. -
      void clear() noexcept;
      +
      void clear() noexcept;

      Effects: Erases all the elements of the vector.

      Throws: Nothing.

      Complexity: Linear to the number of elements in the vector.

    66. -
      basic_string & replace(size_type pos1, size_type n1, const basic_string & str);
      +
      basic_string & replace(size_type pos1, size_type n1, const basic_string & str);

      Requires: pos1 <= size().

      Effects: Calls replace(pos1, n1, str.data(), str.size()).

      Throws: if memory allocation throws or out_of_range if pos1 > size().

      @@ -697,7 +753,7 @@ 
    67. basic_string & 
-replace(size_type pos1, size_type n1, const basic_string & str, 
+replace(size_type pos1, size_type n1, const basic_string & str, 
         size_type pos2, size_type n2);

      Requires: pos1 <= size() and pos2 <= str.size().

      Effects: Determines the effective length rlen of the string to be inserted as the smaller of n2 and str.size() - pos2 and calls replace(pos1, n1, str.data() + pos2, rlen).

      @@ -706,21 +762,21 @@ 
    68. basic_string & 
-replace(size_type pos1, size_type n1, const CharT * s, size_type n2);
      +replace(size_type pos1, size_type n1, const CharT * s, size_type n2);

      Requires: pos1 <= size() and s points to an array of at least n2 elements of CharT.

      Effects: Determines the effective length xlen of the string to be removed as the smaller of n1 and size() - pos1. If size() - xlen >= max_size() - n2 throws length_error. Otherwise, the function replaces the string controlled by *this with a string of length size() - xlen + n2 whose first pos1 elements are a copy of the initial elements of the original string controlled by *this, whose next n2 elements are a copy of the initial n2 elements of s, and whose remaining elements are a copy of the elements of the original string controlled by *this beginning at position pos + xlen.

      Throws: if memory allocation throws, out_of_range if pos1 > size() or length_error if the length of the resulting string would exceed max_size()

      Returns: *this

    69. -
      basic_string & replace(size_type pos, size_type n1, const CharT * s);
      +
      basic_string & replace(size_type pos, size_type n1, const CharT * s);

      Requires: pos1 <= size() and s points to an array of at least n2 elements of CharT.

      Effects: Determines the effective length xlen of the string to be removed as the smaller of n1 and size() - pos1. If size() - xlen >= max_size() - n2 throws length_error. Otherwise, the function replaces the string controlled by *this with a string of length size() - xlen + n2 whose first pos1 elements are a copy of the initial elements of the original string controlled by *this, whose next n2 elements are a copy of the initial n2 elements of s, and whose remaining elements are a copy of the elements of the original string controlled by *this beginning at position pos + xlen.

      Throws: if memory allocation throws, out_of_range if pos1 > size() or length_error if the length of the resulting string would exceed max_size()

      Returns: *this

    70. -
      basic_string & replace(size_type pos1, size_type n1, size_type n2, CharT c);
      +
      basic_string & replace(size_type pos1, size_type n1, size_type n2, CharT c);

      Requires: pos1 <= size().

      Effects: Equivalent to replace(pos1, n1, basic_string(n2, c)).

      Throws: if memory allocation throws, out_of_range if pos1 > size() or length_error if the length of the resulting string would exceed max_size()

      @@ -728,7 +784,7 @@ 
    71. basic_string & 
-replace(const_iterator i1, const_iterator i2, const basic_string & str);
      +replace(const_iterator i1, const_iterator i2, const basic_string & str);

      Requires: [begin(),i1) and [i1,i2) are valid ranges.

      Effects: Calls replace(i1 - begin(), i2 - i1, str).

      Throws: if memory allocation throws

      @@ -736,14 +792,14 @@ 
    72. basic_string & 
-replace(const_iterator i1, const_iterator i2, const CharT * s, size_type n);
      +replace(const_iterator i1, const_iterator i2, const CharT * s, size_type n);

      Requires: [begin(),i1) and [i1,i2) are valid ranges and s points to an array of at least n elements

      Effects: Calls replace(i1 - begin(), i2 - i1, s, n).

      Throws: if memory allocation throws

      Returns: *this

    73. -
      basic_string & replace(const_iterator i1, const_iterator i2, const CharT * s);
      +
      basic_string & replace(const_iterator i1, const_iterator i2, const CharT * s);

      Requires: [begin(),i1) and [i1,i2) are valid ranges and s points to an array of at least traits::length(s) + 1 elements of CharT.

      Effects: Calls replace(i1 - begin(), i2 - i1, s, traits::length(s)).

      Throws: if memory allocation throws

      @@ -751,7 +807,7 @@ 
    74. basic_string & 
-replace(const_iterator i1, const_iterator i2, size_type n, CharT c);
      +replace(const_iterator i1, const_iterator i2, size_type n, CharT c);

      Requires: [begin(),i1) and [i1,i2) are valid ranges.

      Effects: Calls replace(i1 - begin(), i2 - i1, basic_string(n, c)).

      Throws: if memory allocation throws

      @@ -760,197 +816,197 @@ 
    75. template<typename InputIter> 
   basic_string & 
-  replace(const_iterator i1, const_iterator i2, InputIter j1, InputIter j2);
      + replace(const_iterator i1, const_iterator i2, InputIter j1, InputIter j2);

      Requires: [begin(),i1), [i1,i2) and [j1,j2) are valid ranges.

      Effects: Calls replace(i1 - begin(), i2 - i1, basic_string(j1, j2)).

      Throws: if memory allocation throws

      Returns: *this

    76. -
      size_type copy(CharT * s, size_type n, size_type pos = 0) const;
      +
      size_type copy(CharT * s, size_type n, size_type pos = 0) const;

      Requires: pos <= size()

      Effects: Determines the effective length rlen of the string to copy as the smaller of n and size() - pos. s shall designate an array of at least rlen elements. The function then replaces the string designated by s with a string of length rlen whose elements are a copy of the string controlled by *this beginning at position pos. The function does not append a null object to the string designated by s.

      Throws: if memory allocation throws, out_of_range if pos > size().

      Returns: rlen

    77. -
      void swap(basic_string & x) noexcept(allocator_traits_type::propagate_on_container_swap::value||allocator_traits_type::is_always_equal::value));
      +
      void swap(basic_string & x) noexcept(allocator_traits_type::propagate_on_container_swap::value||allocator_traits_type::is_always_equal::value));

      Effects: *this contains the same sequence of characters that was in s, s contains the same sequence of characters that was in *this.

      Throws: Nothing

    78. -
      const CharT * c_str() const noexcept;
      +
      const CharT * c_str() const noexcept;

      Requires: The program shall not alter any of the values stored in the character array.

      Returns: A pointer p such that p + i == &operator[](i) for each i in [0,size()].

      Complexity: constant time.

    79. -
      const CharT * data() const noexcept;
      +
      const CharT * data() const noexcept;

      Requires: The program shall not alter any of the values stored in the character array.

      Returns: A pointer p such that p + i == &operator[](i) for each i in [0,size()].

      Complexity: constant time.

    80. -
      size_type find(const basic_string & s, size_type pos = 0) const;
      +
      size_type find(const basic_string & s, size_type pos = 0) const;

      Effects: Determines the lowest position xpos, if possible, such that both of the following conditions obtain: 19 pos <= xpos and xpos + str.size() <= size(); 2) traits::eq(at(xpos+I), str.at(I)) for all elements I of the string controlled by str.

      Throws: Nothing

      Returns: xpos if the function can determine such a value for xpos. Otherwise, returns npos.

    81. -
      size_type find(const CharT * s, size_type pos, size_type n) const;
      +
      size_type find(const CharT * s, size_type pos, size_type n) const;

      Requires: s points to an array of at least n elements of CharT.

      Throws: Nothing

      Returns: find(basic_string<CharT,traits,Allocator>(s,n),pos).

    82. -
      size_type find(const CharT * s, size_type pos = 0) const;
      +
      size_type find(const CharT * s, size_type pos = 0) const;

      Requires: s points to an array of at least traits::length(s) + 1 elements of CharT.

      Throws: Nothing

      Returns: find(basic_string(s), pos).

    83. -
      size_type find(CharT c, size_type pos = 0) const;
      +
      size_type find(CharT c, size_type pos = 0) const;

      Throws: Nothing

      Returns: find(basic_string<CharT,traits,Allocator>(1,c), pos).

    84. -
      size_type rfind(const basic_string & str, size_type pos = npos) const;
      +
      size_type rfind(const basic_string & str, size_type pos = npos) const;

      Effects: Determines the highest position xpos, if possible, such that both of the following conditions obtain: a) xpos <= pos and xpos + str.size() <= size(); b) traits::eq(at(xpos+I), str.at(I)) for all elements I of the string controlled by str.

      Throws: Nothing

      Returns: xpos if the function can determine such a value for xpos. Otherwise, returns npos.

    85. -
      size_type rfind(const CharT * s, size_type pos, size_type n) const;
      +
      size_type rfind(const CharT * s, size_type pos, size_type n) const;

      Requires: s points to an array of at least n elements of CharT.

      Throws: Nothing

      Returns: rfind(basic_string(s, n), pos).

    86. -
      size_type rfind(const CharT * s, size_type pos = npos) const;
      +
      size_type rfind(const CharT * s, size_type pos = npos) const;

      Requires: pos <= size() and s points to an array of at least traits::length(s) + 1 elements of CharT.

      Throws: Nothing

      Returns: rfind(basic_string(s), pos).

    87. -
      size_type rfind(CharT c, size_type pos = npos) const;
      +
      size_type rfind(CharT c, size_type pos = npos) const;

      Throws: Nothing

      Returns: rfind(basic_string<CharT,traits,Allocator>(1,c),pos).

    88. -
      size_type find_first_of(const basic_string & s, size_type pos = 0) const;
      +
      size_type find_first_of(const basic_string & s, size_type pos = 0) const;

      Effects: Determines the lowest position xpos, if possible, such that both of the following conditions obtain: a) pos <= xpos and xpos < size(); b) traits::eq(at(xpos), str.at(I)) for some element I of the string controlled by str.

      Throws: Nothing

      Returns: xpos if the function can determine such a value for xpos. Otherwise, returns npos.

    89. -
      size_type find_first_of(const CharT * s, size_type pos, size_type n) const;
      +
      size_type find_first_of(const CharT * s, size_type pos, size_type n) const;

      Requires: s points to an array of at least n elements of CharT.

      Throws: Nothing

      Returns: find_first_of(basic_string(s, n), pos).

    90. -
      size_type find_first_of(const CharT * s, size_type pos = 0) const;
      +
      size_type find_first_of(const CharT * s, size_type pos = 0) const;

      Requires: s points to an array of at least traits::length(s) + 1 elements of CharT.

      Throws: Nothing

      Returns: find_first_of(basic_string(s), pos).

    91. -
      size_type find_first_of(CharT c, size_type pos = 0) const;
      +
      size_type find_first_of(CharT c, size_type pos = 0) const;

      Requires: s points to an array of at least traits::length(s) + 1 elements of CharT.

      Throws: Nothing

      Returns: find_first_of(basic_string<CharT,traits,Allocator>(1,c), pos).

    92. -
      size_type find_last_of(const basic_string & str, size_type pos = npos) const;
      +
      size_type find_last_of(const basic_string & str, size_type pos = npos) const;

      Effects: Determines the highest position xpos, if possible, such that both of the following conditions obtain: a) xpos <= pos and xpos < size(); b) traits::eq(at(xpos), str.at(I)) for some element I of the string controlled by str.

      Throws: Nothing

      Returns: xpos if the function can determine such a value for xpos. Otherwise, returns npos.

    93. -
      size_type find_last_of(const CharT * s, size_type pos, size_type n) const;
      +
      size_type find_last_of(const CharT * s, size_type pos, size_type n) const;

      Requires: s points to an array of at least n elements of CharT.

      Throws: Nothing

      Returns: find_last_of(basic_string(s, n), pos).

    94. -
      size_type find_last_of(const CharT * s, size_type pos = npos) const;
      +
      size_type find_last_of(const CharT * s, size_type pos = npos) const;

      Requires: s points to an array of at least traits::length(s) + 1 elements of CharT.

      Throws: Nothing

      Returns: find_last_of(basic_string<CharT,traits,Allocator>(1,c),pos).

    95. -
      size_type find_last_of(CharT c, size_type pos = npos) const;
      +
      size_type find_last_of(CharT c, size_type pos = npos) const;

      Throws: Nothing

      Returns: find_last_of(basic_string(s), pos).

    96. -
      size_type find_first_not_of(const basic_string & str, size_type pos = 0) const;
      +
      size_type find_first_not_of(const basic_string & str, size_type pos = 0) const;

      Effects: Determines the lowest position xpos, if possible, such that both of the following conditions obtain: a) pos <= xpos and xpos < size(); b) traits::eq(at(xpos), str.at(I)) for no element I of the string controlled by str.

      Throws: Nothing

      Returns: xpos if the function can determine such a value for xpos. Otherwise, returns npos.

    97. -
      size_type find_first_not_of(const CharT * s, size_type pos, size_type n) const;
      +
      size_type find_first_not_of(const CharT * s, size_type pos, size_type n) const;

      Requires: s points to an array of at least traits::length(s) + 1 elements of CharT.

      Throws: Nothing

      Returns: find_first_not_of(basic_string(s, n), pos).

    98. -
      size_type find_first_not_of(const CharT * s, size_type pos = 0) const;
      +
      size_type find_first_not_of(const CharT * s, size_type pos = 0) const;

      Requires: s points to an array of at least traits::length(s) + 1 elements of CharT.

      Throws: Nothing

      Returns: find_first_not_of(basic_string(s), pos).

    99. -
      size_type find_first_not_of(CharT c, size_type pos = 0) const;
      +
      size_type find_first_not_of(CharT c, size_type pos = 0) const;

      Throws: Nothing

      Returns: find_first_not_of(basic_string(1, c), pos).

    100. -
      size_type find_last_not_of(const basic_string & str, size_type pos = npos) const;
      +
      size_type find_last_not_of(const basic_string & str, size_type pos = npos) const;

      Effects: Determines the highest position xpos, if possible, such that both of the following conditions obtain: a) xpos <= pos and xpos < size(); b) traits::eq(at(xpos), str.at(I)) for no element I of the string controlled by str.

      Throws: Nothing

      Returns: xpos if the function can determine such a value for xpos. Otherwise, returns npos.

    101. -
      size_type find_last_not_of(const CharT * s, size_type pos, size_type n) const;
      +
      size_type find_last_not_of(const CharT * s, size_type pos, size_type n) const;

      Requires: s points to an array of at least n elements of CharT.

      Throws: Nothing

      Returns: find_last_not_of(basic_string(s, n), pos).

    102. -
      size_type find_last_not_of(const CharT * s, size_type pos = npos) const;
      +
      size_type find_last_not_of(const CharT * s, size_type pos = npos) const;

      Requires: s points to an array of at least traits::length(s) + 1 elements of CharT.

      Throws: Nothing

      Returns: find_last_not_of(basic_string(s), pos).

    103. -
      size_type find_last_not_of(CharT c, size_type pos = npos) const;
      +
      size_type find_last_not_of(CharT c, size_type pos = npos) const;

      Throws: Nothing

      Returns: find_last_not_of(basic_string(1, c), pos).

    104. -
      basic_string substr(size_type pos = 0, size_type n = npos) const;
      +
      basic_string substr(size_type pos = 0, size_type n = npos) const;

      Requires: Requires: pos <= size()

      Effects: Determines the effective length rlen of the string to copy as the smaller of n and size() - pos.

      Throws: If memory allocation throws or out_of_range if pos > size().

      Returns: basic_string<CharT,traits,Allocator>(data()+pos,rlen).

    105. -
      int compare(const basic_string & str) const;
      +
      int compare(const basic_string & str) const;

      Effects: Determines the effective length rlen of the string to copy as the smaller of size() and str.size(). The function then compares the two strings by calling traits::compare(data(), str.data(), rlen).

      Throws: Nothing

      Returns: The nonzero result if the result of the comparison is nonzero. Otherwise, returns a value < 0 if size() < str.size(), a 0 value if size() == str.size(), and value > 0 if size() > str.size()

    106. -
      int compare(size_type pos1, size_type n1, const basic_string & str) const;
      +
      int compare(size_type pos1, size_type n1, const basic_string & str) const;

      Requires: pos1 <= size()

      Effects: Determines the effective length rlen of the string to copy as the smaller of

      Throws: out_of_range if pos1 > size()

      Returns:basic_string(*this,pos1,n1).compare(str).

    107. -
      int compare(size_type pos1, size_type n1, const basic_string & str, 
+
      int compare(size_type pos1, size_type n1, const basic_string & str, 
             size_type pos2, size_type n2) const;
      
 
      Requires: pos1 <= size() and pos2 <= str.size()
      
 
      Effects: Determines the effective length rlen of the string to copy as the smaller of
      
@@ -958,18 +1014,18 @@
 
      Returns: basic_string(*this, pos1, n1).compare(basic_string(str, pos2, n2)).
    108. -
      int compare(const CharT * s) const;
      +
      int compare(const CharT * s) const;

      Throws: Nothing

      Returns: compare(basic_string(s)).

    109. -
      int compare(size_type pos1, size_type n1, const CharT * s, size_type n2) const;
      +
      int compare(size_type pos1, size_type n1, const CharT * s, size_type n2) const;

      Requires: pos1 > size() and s points to an array of at least n2 elements of CharT.

      Throws: out_of_range if pos1 > size()

      Returns: basic_string(*this, pos, n1).compare(basic_string(s, n2)).

    110. -
      int compare(size_type pos1, size_type n1, const CharT * s) const;
      +
      int compare(size_type pos1, size_type n1, const CharT * s) const;

      Requires: pos1 > size() and s points to an array of at least traits::length(s) + 1 elements of CharT.

      Throws: out_of_range if pos1 > size()

      Returns: basic_string(*this, pos, n1).compare(basic_string(s, n2)).

      @@ -980,7 +1036,7 @@
    -
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -988,7 +1044,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/container/construc_idm46583867843104.html b/doc/html/boost/container/construc_idm46583867843104.html new file mode 100644 index 0000000000..70b870401b --- /dev/null +++ b/doc/html/boost/container/construc_idm46583867843104.html @@ -0,0 +1,66 @@ + + + + +Struct template constructible_with_allocator_suffix + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct template constructible_with_allocator_suffix

    +

    boost::container::constructible_with_allocator_suffix

    +
    +

    Synopsis

    +
    // In header: <boost/container/uses_allocator.hpp>
+
+template<typename T> 
+struct constructible_with_allocator_suffix {
+
+  // public data members
+  static const bool value;
+};
    +
    +

    Description

    +

    Remark: if a specialization constructible_with_allocator_suffix<X>::value is true, indicates that T may be constructed with an allocator as its last constructor argument. Ideally, all constructors of T (including the copy and move constructors) should have a variant that accepts a final argument of allocator_type.

    +

    Requires: if a specialization constructible_with_allocator_suffix<X>::value is true, T must have a nested type, allocator_type and at least one constructor for which allocator_type is the last parameter. If not all constructors of T can be called with a final allocator_type argument, and if T is used in a context where a container must call such a constructor, then the program is ill-formed.

    +

    template <class T, class Allocator = allocator<T> > class Z { public: typedef Allocator allocator_type;

    +

    // Default constructor with optional allocator suffix Z(const allocator_type& a = allocator_type());

    +

    // Copy constructor and allocator-extended copy constructor Z(const Z& zz); Z(const Z& zz, const allocator_type& a); };

    +

    // Specialize trait for class template Z template <class T, class Allocator = allocator<T> > struct constructible_with_allocator_suffix<Z<T,Allocator> > { static const bool value = true; };

    +

    Note: This trait is a workaround inspired by "N2554: The Scoped A Model (Rev 2)" (Pablo Halpern, 2008-02-29) to backport the scoped allocator model to C++03, as in C++03 there is no mechanism to detect if a type can be constructed from arbitrary arguments. Applications aiming portability with several compilers should always define this trait.

    +

    In conforming C++11 compilers or compilers supporting SFINAE expressions (when BOOST_NO_SFINAE_EXPR is NOT defined), this trait is ignored and C++11 rules will be used to detect if a type should be constructed with suffix or prefix allocator arguments.

    +
    +
    + + + +
    Copyright © 2009-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/construc_idm46583867853472.html b/doc/html/boost/container/construc_idm46583867853472.html new file mode 100644 index 0000000000..98dfe31151 --- /dev/null +++ b/doc/html/boost/container/construc_idm46583867853472.html @@ -0,0 +1,68 @@ + + + + +Struct template constructible_with_allocator_prefix + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct template constructible_with_allocator_prefix

    +

    boost::container::constructible_with_allocator_prefix

    +
    +

    Synopsis

    +
    // In header: <boost/container/uses_allocator.hpp>
+
+template<typename T> 
+struct constructible_with_allocator_prefix {
+
+  // public data members
+  static const bool value;
+};
    +
    +

    Description

    +

    Remark: if a specialization constructible_with_allocator_prefix<X>::value is true, indicates that T may be constructed with allocator_arg and T::allocator_type as its first two constructor arguments. Ideally, all constructors of T (including the copy and move constructors) should have a variant that accepts these two initial arguments.

    +

    Requires: specialization constructible_with_allocator_prefix<X>::value is true, T must have a nested type, allocator_type and at least one constructor for which allocator_arg_t is the first parameter and allocator_type is the second parameter. If not all constructors of T can be called with these initial arguments, and if T is used in a context where a container must call such a constructor, then the program is ill-formed.

    +

    template <class T, class Allocator = allocator<T> > class Y { public: typedef Allocator allocator_type;

    +

    // Default constructor with and allocator-extended default constructor Y(); Y(allocator_arg_t, const allocator_type& a);

    +

    // Copy constructor and allocator-extended copy constructor Y(const Y& yy); Y(allocator_arg_t, const allocator_type& a, const Y& yy);

    +

    // Variadic constructor and allocator-extended variadic constructor template<class ...Args> Y(Args&& args...); template<class ...Args> Y(allocator_arg_t, const allocator_type& a, BOOST_FWD_REF(Args)... args); };

    +

    // Specialize trait for class template Y template <class T, class Allocator = allocator<T> > struct constructible_with_allocator_prefix<Y<T,Allocator> > { static const bool value = true; };

    +

    +

    Note: This trait is a workaround inspired by "N2554: The Scoped Allocator Model (Rev 2)" (Pablo Halpern, 2008-02-29) to backport the scoped allocator model to C++03, as in C++03 there is no mechanism to detect if a type can be constructed from arbitrary arguments. Applications aiming portability with several compilers should always define this trait.

    +

    In conforming C++11 compilers or compilers supporting SFINAE expressions (when BOOST_NO_SFINAE_EXPR is NOT defined), this trait is ignored and C++11 rules will be used to detect if a type should be constructed with suffix or prefix allocator arguments.

    +
    +
    + + + +
    Copyright © 2009-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/constructible__idp59903648.html b/doc/html/boost/container/constructible__idp59903648.html deleted file mode 100644 index 123712ff89..0000000000 --- a/doc/html/boost/container/constructible__idp59903648.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct template constructible_with_allocator_prefix - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template constructible_with_allocator_prefix

    -

    boost::container::constructible_with_allocator_prefix

    -
    -

    Synopsis

    -
    // In header: <boost/container/scoped_allocator.hpp>
-
-template<typename T> 
-struct constructible_with_allocator_prefix {
-
-  // public data members
-  static const bool value;
-};
    -
    -

    Description

    -

    Remark: if a specialization constructible_with_allocator_prefix<X>::value is true, indicates that T may be constructed with allocator_arg and T::allocator_type as its first two constructor arguments. Ideally, all constructors of T (including the copy and move constructors) should have a variant that accepts these two initial arguments.

    -

    Requires: specialization constructible_with_allocator_prefix<X>::value is true, T must have a nested type, allocator_type and at least one constructor for which allocator_arg_t is the first parameter and allocator_type is the second parameter. If not all constructors of T can be called with these initial arguments, and if T is used in a context where a container must call such a constructor, then the program is ill-formed.

    -

    template <class T, class Allocator = allocator<T> > class Y { public: typedef Allocator allocator_type;

    -

    // Default constructor with and allocator-extended default constructor Y(); Y(allocator_arg_t, const allocator_type& a);

    -

    // Copy constructor and allocator-extended copy constructor Y(const Y& yy); Y(allocator_arg_t, const allocator_type& a, const Y& yy);

    -

    // Variadic constructor and allocator-extended variadic constructor template<class ...Args> Y(Args&& args...); template<class ...Args> Y(allocator_arg_t, const allocator_type& a, BOOST_FWD_REF(Args)... args); };

    -

    // Specialize trait for class template Y template <class T, class Allocator = allocator<T> > struct constructible_with_allocator_prefix<Y<T,Allocator> > { static const bool value = true; };

    -

    -

    Note: This trait is a workaround inspired by "N2554: The Scoped Allocator Model (Rev 2)" (Pablo Halpern, 2008-02-29) to backport the scoped allocator model to C++03, as in C++03 there is no mechanism to detect if a type can be constructed from arbitrary arguments. Applications aiming portability with several compilers should always define this trait.

    -

    In conforming C++11 compilers or compilers supporting SFINAE expressions (when BOOST_NO_SFINAE_EXPR is NOT defined), this trait is ignored and C++11 rules will be used to detect if a type should be constructed with suffix or prefix allocator arguments.

    -
    -
    - - - -
    Copyright © 2009-2013 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/container/constructible__idp59914016.html b/doc/html/boost/container/constructible__idp59914016.html deleted file mode 100644 index 9dab0c2d58..0000000000 --- a/doc/html/boost/container/constructible__idp59914016.html +++ /dev/null @@ -1,66 +0,0 @@ - - - - -Struct template constructible_with_allocator_suffix - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template constructible_with_allocator_suffix

    -

    boost::container::constructible_with_allocator_suffix

    -
    -

    Synopsis

    -
    // In header: <boost/container/scoped_allocator.hpp>
-
-template<typename T> 
-struct constructible_with_allocator_suffix {
-
-  // public data members
-  static const bool value;
-};
    -
    -

    Description

    -

    Remark: if a specialization constructible_with_allocator_suffix<X>::value is true, indicates that T may be constructed with an allocator as its last constructor argument. Ideally, all constructors of T (including the copy and move constructors) should have a variant that accepts a final argument of allocator_type.

    -

    Requires: if a specialization constructible_with_allocator_suffix<X>::value is true, T must have a nested type, allocator_type and at least one constructor for which allocator_type is the last parameter. If not all constructors of T can be called with a final allocator_type argument, and if T is used in a context where a container must call such a constructor, then the program is ill-formed.

    -

    template <class T, class Allocator = allocator<T> > class Z { public: typedef Allocator allocator_type;

    -

    // Default constructor with optional allocator suffix Z(const allocator_type& a = allocator_type());

    -

    // Copy constructor and allocator-extended copy constructor Z(const Z& zz); Z(const Z& zz, const allocator_type& a); };

    -

    // Specialize trait for class template Z template <class T, class Allocator = allocator<T> > struct constructible_with_allocator_suffix<Z<T,Allocator> > { static const bool value = true; };

    -

    Note: This trait is a workaround inspired by "N2554: The Scoped A Model (Rev 2)" (Pablo Halpern, 2008-02-29) to backport the scoped allocator model to C++03, as in C++03 there is no mechanism to detect if a type can be constructed from arbitrary arguments. Applications aiming portability with several compilers should always define this trait.

    -

    In conforming C++11 compilers or compilers supporting SFINAE expressions (when BOOST_NO_SFINAE_EXPR is NOT defined), this trait is ignored and C++11 rules will be used to detect if a type should be constructed with suffix or prefix allocator arguments.

    -
    -
    - - - -
    Copyright © 2009-2013 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/container/default_init.html b/doc/html/boost/container/default_init.html index 958afcbeea..b830ef1681 100644 --- a/doc/html/boost/container/default_init.html +++ b/doc/html/boost/container/default_init.html @@ -34,13 +34,13 @@ static const default_init_t default_init;
    -

    Description

    +

    Description

    Value used to tag that the inserted values should be default initialized

    -
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost/container/default_init_t.html b/doc/html/boost/container/default_init_t.html index bf4cb7bb20..e68828cb83 100644 --- a/doc/html/boost/container/default_init_t.html +++ b/doc/html/boost/container/default_init_t.html @@ -36,13 +36,13 @@ struct default_init_t { };
    -

    Description

    +

    Description

    Type used to tag that the inserted values should be default initialized

    -
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost/container/deque.html b/doc/html/boost/container/deque.html index e4159b214f..5e6efa5505 100644 --- a/doc/html/boost/container/deque.html +++ b/doc/html/boost/container/deque.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -51,100 +51,100 @@ typedef implementation_defined const_reverse_iterator; // construct/copy/destruct - deque(); - explicit deque(const allocator_type &) noexcept; - explicit deque(size_type); - deque(size_type, default_init_t); - explicit deque(size_type, const allocator_type &); - deque(size_type, default_init_t, const allocator_type &); - deque(size_type, const value_type &, + deque(); + explicit deque(const allocator_type &) noexcept; + explicit deque(size_type); + deque(size_type, default_init_t); + explicit deque(size_type, const allocator_type &); + deque(size_type, default_init_t, const allocator_type &); + deque(size_type, const value_type &, const allocator_type & = allocator_type()); template<typename InIt> - deque(InIt, InIt, const allocator_type & = allocator_type()); - deque(std::initializer_list< value_type >, + deque(InIt, InIt, const allocator_type & = allocator_type()); + deque(std::initializer_list< value_type >, const allocator_type & = allocator_type()); - deque(const deque &); - deque(deque &&); - deque(const deque &, const allocator_type &); - deque(deque &&, const allocator_type &); - deque & operator=(const deque &); - deque & operator=(deque &&) noexcept(allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value)); - deque & operator=(std::initializer_list< value_type >); - ~deque(); + deque(const deque &); + deque(deque &&); + deque(const deque &, const allocator_type &); + deque(deque &&, const allocator_type &); + deque & operator=(const deque &); + deque & operator=(deque &&) noexcept(allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value)); + deque & operator=(std::initializer_list< value_type >); + ~deque(); - // public member functions - void assign(size_type, const T &); - template<typename InIt> void assign(InIt, InIt); - void assign(std::initializer_list< value_type >); - allocator_type get_allocator() const noexcept; - const stored_allocator_type & get_stored_allocator() const noexcept; - stored_allocator_type & get_stored_allocator() noexcept; - iterator begin() noexcept; - const_iterator begin() const noexcept; - iterator end() noexcept; - const_iterator end() const noexcept; - reverse_iterator rbegin() noexcept; - const_reverse_iterator rbegin() const noexcept; - reverse_iterator rend() noexcept; - const_reverse_iterator rend() const noexcept; - const_iterator cbegin() const noexcept; - const_iterator cend() const noexcept; - const_reverse_iterator crbegin() const noexcept; - const_reverse_iterator crend() const noexcept; - bool empty() const noexcept; - size_type size() const noexcept; - size_type max_size() const noexcept; - void resize(size_type); - void resize(size_type, default_init_t); - void resize(size_type, const value_type &); - void shrink_to_fit(); - reference front() noexcept; - const_reference front() const noexcept; - reference back() noexcept; - const_reference back() const noexcept; - reference operator[](size_type) noexcept; - const_reference operator[](size_type) const noexcept; - iterator nth(size_type) noexcept; - const_iterator nth(size_type) const noexcept; - size_type index_of(iterator) noexcept; - size_type index_of(const_iterator) const noexcept; - reference at(size_type); - const_reference at(size_type) const; - template<class... Args> void emplace_front(Args &&...); - template<class... Args> void emplace_back(Args &&...); - template<class... Args> iterator emplace(const_iterator, Args &&...); - void push_front(const T &); - void push_front(T &&); - void push_back(const T &); - void push_back(T &&); - iterator insert(const_iterator, const T &); - iterator insert(const_iterator, T &&); - iterator insert(const_iterator, size_type, const value_type &); - template<typename InIt> iterator insert(const_iterator, InIt, InIt); - iterator insert(const_iterator, std::initializer_list< value_type >); - void pop_front() noexcept; - void pop_back() noexcept; - iterator erase(const_iterator) noexcept; - iterator erase(const_iterator, const_iterator) noexcept; - void swap(deque &) noexcept(allocator_traits_type::propagate_on_container_swap::value||allocator_traits_type::is_always_equal::value)); - void clear() noexcept; + // public member functions + void assign(size_type, const T &); + template<typename InIt> void assign(InIt, InIt); + void assign(std::initializer_list< value_type >); + allocator_type get_allocator() const noexcept; + const stored_allocator_type & get_stored_allocator() const noexcept; + stored_allocator_type & get_stored_allocator() noexcept; + iterator begin() noexcept; + const_iterator begin() const noexcept; + iterator end() noexcept; + const_iterator end() const noexcept; + reverse_iterator rbegin() noexcept; + const_reverse_iterator rbegin() const noexcept; + reverse_iterator rend() noexcept; + const_reverse_iterator rend() const noexcept; + const_iterator cbegin() const noexcept; + const_iterator cend() const noexcept; + const_reverse_iterator crbegin() const noexcept; + const_reverse_iterator crend() const noexcept; + bool empty() const noexcept; + size_type size() const noexcept; + size_type max_size() const noexcept; + void resize(size_type); + void resize(size_type, default_init_t); + void resize(size_type, const value_type &); + void shrink_to_fit(); + reference front() noexcept; + const_reference front() const noexcept; + reference back() noexcept; + const_reference back() const noexcept; + reference operator[](size_type) noexcept; + const_reference operator[](size_type) const noexcept; + iterator nth(size_type) noexcept; + const_iterator nth(size_type) const noexcept; + size_type index_of(iterator) noexcept; + size_type index_of(const_iterator) const noexcept; + reference at(size_type); + const_reference at(size_type) const; + template<class... Args> void emplace_front(Args &&...); + template<class... Args> void emplace_back(Args &&...); + template<class... Args> iterator emplace(const_iterator, Args &&...); + void push_front(const T &); + void push_front(T &&); + void push_back(const T &); + void push_back(T &&); + iterator insert(const_iterator, const T &); + iterator insert(const_iterator, T &&); + iterator insert(const_iterator, size_type, const value_type &); + template<typename InIt> iterator insert(const_iterator, InIt, InIt); + iterator insert(const_iterator, std::initializer_list< value_type >); + void pop_front() noexcept; + void pop_back() noexcept; + iterator erase(const_iterator) noexcept; + iterator erase(const_iterator, const_iterator) noexcept; + void swap(deque &) noexcept(allocator_traits_type::propagate_on_container_swap::value||allocator_traits_type::is_always_equal::value)); + void clear() noexcept; - // friend functions - friend bool operator==(const deque &, const deque &); - friend bool operator!=(const deque &, const deque &); - friend bool operator<(const deque &, const deque &); - friend bool operator>(const deque &, const deque &); - friend bool operator<=(const deque &, const deque &); - friend bool operator>=(const deque &, const deque &); - friend void swap(deque &, deque &); + // friend functions + friend bool operator==(const deque &, const deque &); + friend bool operator!=(const deque &, const deque &); + friend bool operator<(const deque &, const deque &); + friend bool operator>(const deque &, const deque &); + friend bool operator<=(const deque &, const deque &); + friend bool operator>=(const deque &, const deque &); + friend void swap(deque &, deque &); };
    -

    Description

    +

    Description

    A double-ended queue is a sequence that supports random access to elements, constant time insertion and removal of elements at the end of the sequence, and linear time insertion and removal of elements in the middle.

    -

    Template Parameters

    +

    Template Parameters

    1. typename T
      @@ -157,51 +157,51 @@
    -

    +

    deque public construct/copy/destruct

    1. -
      deque();
      +
      deque();

      Effects: Default constructors a deque.

      Throws: If allocator_type's default constructor throws.

      Complexity: Constant.

    2. -
      explicit deque(const allocator_type & a) noexcept;
      +
      explicit deque(const allocator_type & a) noexcept;

      Effects: Constructs a deque taking the allocator as parameter.

      Throws: Nothing

      Complexity: Constant.

    3. -
      explicit deque(size_type n);
      +
      explicit deque(size_type n);

      Effects: Constructs a deque and inserts n value initialized values.

      Throws: If allocator_type's default constructor throws or T's value initialization throws.

      Complexity: Linear to n.

    4. -
      deque(size_type n, default_init_t);
      +
      deque(size_type n, default_init_t);

      Effects: Constructs a deque and inserts n default initialized values.

      Throws: If allocator_type's default constructor throws or T's default initialization or copy constructor throws.

      Complexity: Linear to n.

      Note: Non-standard extension

    5. -
      explicit deque(size_type n, const allocator_type & a);
      +
      explicit deque(size_type n, const allocator_type & a);

      Effects: Constructs a deque that will use a copy of allocator a and inserts n value initialized values.

      Throws: If allocator_type's default constructor throws or T's value initialization throws.

      Complexity: Linear to n.

    6. -
      deque(size_type n, default_init_t, const allocator_type & a);
      +
      deque(size_type n, default_init_t, const allocator_type & a);

      Effects: Constructs a deque that will use a copy of allocator a and inserts n default initialized values.

      Throws: If allocator_type's default constructor throws or T's default initialization or copy constructor throws.

      Complexity: Linear to n.

      Note: Non-standard extension

    7. -
      deque(size_type n, const value_type & value, 
+
      deque(size_type n, const value_type & value, 
       const allocator_type & a = allocator_type());
      
 
      Effects: Constructs a deque that will use a copy of allocator a and inserts n copies of value.
      
 
      Throws: If allocator_type's default constructor throws or T's copy constructor throws.
      
@@ -209,65 +209,65 @@
 
    8. template<typename InIt> 
-  deque(InIt first, InIt last, const allocator_type & a = allocator_type());
      + deque(InIt first, InIt last, const allocator_type & a = allocator_type());

      Effects: Constructs a deque that will use a copy of allocator a and inserts a copy of the range [first, last) in the deque.

      Throws: If allocator_type's default constructor throws or T's constructor taking a dereferenced InIt throws.

      Complexity: Linear to the range [first, last).

    9. -
      deque(std::initializer_list< value_type > il, 
+
      deque(std::initializer_list< value_type > il, 
       const allocator_type & a = allocator_type());
      
 
      Effects: Constructs a deque that will use a copy of allocator a and inserts a copy of the range [il.begin(), il.end()) in the deque.
      
 
      Throws: If allocator_type's default constructor throws or T's constructor taking a dereferenced std::initializer_list iterator throws.
      
 
      Complexity: Linear to the range [il.begin(), il.end()).
    10. -
      deque(const deque & x);
      +
      deque(const deque & x);

      Effects: Copy constructs a deque.

      Postcondition: x == *this.

      Complexity: Linear to the elements x contains.

    11. -
      deque(deque && x);
      +
      deque(deque && x);

      Effects: Move constructor. Moves x's resources to *this.

      Throws: If allocator_type's copy constructor throws.

      Complexity: Constant.

    12. -
      deque(const deque & x, const allocator_type & a);
      +
      deque(const deque & x, const allocator_type & a);

      Effects: Copy constructs a vector using the specified allocator.

      Postcondition: x == *this.

      Throws: If allocation throws or T's copy constructor throws.

      Complexity: Linear to the elements x contains.

    13. -
      deque(deque && x, const allocator_type & a);
      +
      deque(deque && x, const allocator_type & a);

      Effects: Move constructor using the specified allocator. Moves x's resources to *this if a == allocator_type(). Otherwise copies values from x to *this.

      Throws: If allocation or T's copy constructor throws.

      Complexity: Constant if a == x.get_allocator(), linear otherwise.

    14. -
      deque & operator=(const deque & x);
      +
      deque & operator=(const deque & x);

      Effects: Makes *this contain the same elements as x.

      Postcondition: this->size() == x.size(). *this contains a copy of each of x's elements.

      Throws: If memory allocation throws or T's copy constructor throws.

      Complexity: Linear to the number of elements in x.

    15. -
      deque & operator=(deque && x) noexcept(allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value));
      +
      deque & operator=(deque && x) noexcept(allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value));

      Effects: Move assignment. All x's values are transferred to *this.

      Throws: If allocator_traits_type::propagate_on_container_move_assignment is false and (allocation throws or value_type's move constructor throws)

      Complexity: Constant if allocator_traits_type:: propagate_on_container_move_assignment is true or this->get>allocator() == x.get_allocator(). Linear otherwise.

    16. -
      deque & operator=(std::initializer_list< value_type > il);
      +
      deque & operator=(std::initializer_list< value_type > il);

      Effects: Makes *this contain the same elements as il.

      Postcondition: this->size() == il.size(). *this contains a copy of each of x's elements.

      Throws: If memory allocation throws or T's copy constructor throws.

      Complexity: Linear to the number of elements in il.

    17. -
      ~deque();
      +
      ~deque();

      Effects: Destroys the deque. All stored values are destroyed and used memory is deallocated.

      Throws: Nothing.

      Complexity: Linear to the number of elements.

      @@ -275,206 +275,206 @@
    -

    -deque public member functions

    +

    +deque public member functions

    1. -
      void assign(size_type n, const T & val);
      +
      void assign(size_type n, const T & val);

      Effects: Assigns the n copies of val to *this.

      Throws: If memory allocation throws or T's copy constructor throws.

      Complexity: Linear to n.

    2. -
      template<typename InIt> void assign(InIt first, InIt last);
      +
      template<typename InIt> void assign(InIt first, InIt last);

      Effects: Assigns the the range [first, last) to *this.

      Throws: If memory allocation throws or T's constructor from dereferencing InIt throws.

      Complexity: Linear to n.

    3. -
      void assign(std::initializer_list< value_type > il);
      +
      void assign(std::initializer_list< value_type > il);

      Effects: Assigns the the range [il.begin(), il.end()) to *this.

      Throws: If memory allocation throws or T's constructor from dereferencing std::initializer_list iterator throws.

      Complexity: Linear to il.size().

    4. -
      allocator_type get_allocator() const noexcept;
      +
      allocator_type get_allocator() const noexcept;

      Effects: Returns a copy of the internal allocator.

      Throws: If allocator's copy constructor throws.

      Complexity: Constant.

    5. -
      const stored_allocator_type & get_stored_allocator() const noexcept;
      +
      const stored_allocator_type & get_stored_allocator() const noexcept;

      Effects: Returns a reference to the internal allocator.

      Throws: Nothing

      Complexity: Constant.

      Note: Non-standard extension.

    6. -
      stored_allocator_type & get_stored_allocator() noexcept;
      +
      stored_allocator_type & get_stored_allocator() noexcept;

      Effects: Returns a reference to the internal allocator.

      Throws: Nothing

      Complexity: Constant.

      Note: Non-standard extension.

    7. -
      iterator begin() noexcept;
      +
      iterator begin() noexcept;

      Effects: Returns an iterator to the first element contained in the deque.

      Throws: Nothing.

      Complexity: Constant.

    8. -
      const_iterator begin() const noexcept;
      +
      const_iterator begin() const noexcept;

      Effects: Returns a const_iterator to the first element contained in the deque.

      Throws: Nothing.

      Complexity: Constant.

    9. -
      iterator end() noexcept;
      +
      iterator end() noexcept;

      Effects: Returns an iterator to the end of the deque.

      Throws: Nothing.

      Complexity: Constant.

    10. -
      const_iterator end() const noexcept;
      +
      const_iterator end() const noexcept;

      Effects: Returns a const_iterator to the end of the deque.

      Throws: Nothing.

      Complexity: Constant.

    11. -
      reverse_iterator rbegin() noexcept;
      +
      reverse_iterator rbegin() noexcept;

      Effects: Returns a reverse_iterator pointing to the beginning of the reversed deque.

      Throws: Nothing.

      Complexity: Constant.

    12. -
      const_reverse_iterator rbegin() const noexcept;
      +
      const_reverse_iterator rbegin() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed deque.

      Throws: Nothing.

      Complexity: Constant.

    13. -
      reverse_iterator rend() noexcept;
      +
      reverse_iterator rend() noexcept;

      Effects: Returns a reverse_iterator pointing to the end of the reversed deque.

      Throws: Nothing.

      Complexity: Constant.

    14. -
      const_reverse_iterator rend() const noexcept;
      +
      const_reverse_iterator rend() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed deque.

      Throws: Nothing.

      Complexity: Constant.

    15. -
      const_iterator cbegin() const noexcept;
      +
      const_iterator cbegin() const noexcept;

      Effects: Returns a const_iterator to the first element contained in the deque.

      Throws: Nothing.

      Complexity: Constant.

    16. -
      const_iterator cend() const noexcept;
      +
      const_iterator cend() const noexcept;

      Effects: Returns a const_iterator to the end of the deque.

      Throws: Nothing.

      Complexity: Constant.

    17. -
      const_reverse_iterator crbegin() const noexcept;
      +
      const_reverse_iterator crbegin() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed deque.

      Throws: Nothing.

      Complexity: Constant.

    18. -
      const_reverse_iterator crend() const noexcept;
      +
      const_reverse_iterator crend() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed deque.

      Throws: Nothing.

      Complexity: Constant.

    19. -
      bool empty() const noexcept;
      +
      bool empty() const noexcept;

      Effects: Returns true if the deque contains no elements.

      Throws: Nothing.

      Complexity: Constant.

    20. -
      size_type size() const noexcept;
      +
      size_type size() const noexcept;

      Effects: Returns the number of the elements contained in the deque.

      Throws: Nothing.

      Complexity: Constant.

    21. -
      size_type max_size() const noexcept;
      +
      size_type max_size() const noexcept;

      Effects: Returns the largest possible size of the deque.

      Throws: Nothing.

      Complexity: Constant.

    22. -
      void resize(size_type new_size);
      +
      void resize(size_type new_size);

      Effects: Inserts or erases elements at the end such that the size becomes n. New elements are value initialized.

      Throws: If memory allocation throws, or T's constructor throws.

      Complexity: Linear to the difference between size() and new_size.

    23. -
      void resize(size_type new_size, default_init_t);
      +
      void resize(size_type new_size, default_init_t);

      Effects: Inserts or erases elements at the end such that the size becomes n. New elements are default initialized.

      Throws: If memory allocation throws, or T's constructor throws.

      Complexity: Linear to the difference between size() and new_size.

      Note: Non-standard extension

    24. -
      void resize(size_type new_size, const value_type & x);
      +
      void resize(size_type new_size, const value_type & x);

      Effects: Inserts or erases elements at the end such that the size becomes n. New elements are copy constructed from x.

      Throws: If memory allocation throws, or T's copy constructor throws.

      Complexity: Linear to the difference between size() and new_size.

    25. -
      void shrink_to_fit();
      +
      void shrink_to_fit();

      Effects: Tries to deallocate the excess of memory created with previous allocations. The size of the deque is unchanged

      Throws: If memory allocation throws.

      Complexity: Constant.

    26. -
      reference front() noexcept;
      +
      reference front() noexcept;

      Requires: !empty()

      Effects: Returns a reference to the first element of the container.

      Throws: Nothing.

      Complexity: Constant.

    27. -
      const_reference front() const noexcept;
      +
      const_reference front() const noexcept;

      Requires: !empty()

      Effects: Returns a const reference to the first element from the beginning of the container.

      Throws: Nothing.

      Complexity: Constant.

    28. -
      reference back() noexcept;
      +
      reference back() noexcept;

      Requires: !empty()

      Effects: Returns a reference to the last element of the container.

      Throws: Nothing.

      Complexity: Constant.

    29. -
      const_reference back() const noexcept;
      +
      const_reference back() const noexcept;

      Requires: !empty()

      Effects: Returns a const reference to the last element of the container.

      Throws: Nothing.

      Complexity: Constant.

    30. -
      reference operator[](size_type n) noexcept;
      +
      reference operator[](size_type n) noexcept;

      Requires: size() > n.

      Effects: Returns a reference to the nth element from the beginning of the container.

      Throws: Nothing.

      Complexity: Constant.

    31. -
      const_reference operator[](size_type n) const noexcept;
      +
      const_reference operator[](size_type n) const noexcept;

      Requires: size() > n.

      Effects: Returns a const reference to the nth element from the beginning of the container.

      Throws: Nothing.

      Complexity: Constant.

    32. -
      iterator nth(size_type n) noexcept;
      +
      iterator nth(size_type n) noexcept;

      Requires: size() >= n.

      Effects: Returns an iterator to the nth element from the beginning of the container. Returns end() if n == size().

      Throws: Nothing.

      @@ -482,7 +482,7 @@

      Note: Non-standard extension

    33. -
      const_iterator nth(size_type n) const noexcept;
      +
      const_iterator nth(size_type n) const noexcept;

      Requires: size() >= n.

      Effects: Returns a const_iterator to the nth element from the beginning of the container. Returns end() if n == size().

      Throws: Nothing.

      @@ -490,7 +490,7 @@

      Note: Non-standard extension

    34. -
      size_type index_of(iterator p) noexcept;
      +
      size_type index_of(iterator p) noexcept;

      Requires: size() >= n.

      Effects: Returns an iterator to the nth element from the beginning of the container. Returns end() if n == size().

      Throws: Nothing.

      @@ -498,7 +498,7 @@

      Note: Non-standard extension

    35. -
      size_type index_of(const_iterator p) const noexcept;
      +
      size_type index_of(const_iterator p) const noexcept;

      Requires: begin() <= p <= end().

      Effects: Returns the index of the element pointed by p and size() if p == end().

      Throws: Nothing.

      @@ -506,64 +506,64 @@

      Note: Non-standard extension

    36. -
      reference at(size_type n);
      +
      reference at(size_type n);

      Requires: size() > n.

      Effects: Returns a reference to the nth element from the beginning of the container.

      Throws: std::range_error if n >= size()

      Complexity: Constant.

    37. -
      const_reference at(size_type n) const;
      +
      const_reference at(size_type n) const;

      Requires: size() > n.

      Effects: Returns a const reference to the nth element from the beginning of the container.

      Throws: std::range_error if n >= size()

      Complexity: Constant.

    38. -
      template<class... Args> void emplace_front(Args &&... args);
      +
      template<class... Args> void emplace_front(Args &&... args);

      Effects: Inserts an object of type T constructed with std::forward<Args>(args)... in the beginning of the deque.

      Throws: If memory allocation throws or the in-place constructor throws.

      Complexity: Amortized constant time

    39. -
      template<class... Args> void emplace_back(Args &&... args);
      +
      template<class... Args> void emplace_back(Args &&... args);

      Effects: Inserts an object of type T constructed with std::forward<Args>(args)... in the end of the deque.

      Throws: If memory allocation throws or the in-place constructor throws.

      Complexity: Amortized constant time

    40. -
      template<class... Args> iterator emplace(const_iterator p, Args &&... args);
      +
      template<class... Args> iterator emplace(const_iterator p, Args &&... args);

      Requires: p must be a valid iterator of *this.

      Effects: Inserts an object of type T constructed with std::forward<Args>(args)... before p

      Throws: If memory allocation throws or the in-place constructor throws.

      Complexity: If p is end(), amortized constant time Linear time otherwise.

    41. -
      void push_front(const T & x);
      +
      void push_front(const T & x);

      Effects: Inserts a copy of x at the front of the deque.

      Throws: If memory allocation throws or T's copy constructor throws.

      Complexity: Amortized constant time.

    42. -
      void push_front(T && x);
      +
      void push_front(T && x);

      Effects: Constructs a new element in the front of the deque and moves the resources of x to this new element.

      Throws: If memory allocation throws.

      Complexity: Amortized constant time.

    43. -
      void push_back(const T & x);
      +
      void push_back(const T & x);

      Effects: Inserts a copy of x at the end of the deque.

      Throws: If memory allocation throws or T's copy constructor throws.

      Complexity: Amortized constant time.

    44. -
      void push_back(T && x);
      +
      void push_back(T && x);

      Effects: Constructs a new element in the end of the deque and moves the resources of x to this new element.

      Throws: If memory allocation throws.

      Complexity: Amortized constant time.

    45. -
      iterator insert(const_iterator p, const T & x);
      +
      iterator insert(const_iterator p, const T & x);

      Requires: p must be a valid iterator of *this.

      Effects: Insert a copy of x before p.

      Returns: an iterator to the inserted element.

      @@ -571,7 +571,7 @@

      Complexity: If p is end(), amortized constant time Linear time otherwise.

    46. -
      iterator insert(const_iterator p, T && x);
      +
      iterator insert(const_iterator p, T && x);

      Requires: p must be a valid iterator of *this.

      Effects: Insert a new element before p with x's resources.

      Returns: an iterator to the inserted element.

      @@ -579,7 +579,7 @@

      Complexity: If p is end(), amortized constant time Linear time otherwise.

    47. -
      iterator insert(const_iterator pos, size_type n, const value_type & x);
      +
      iterator insert(const_iterator pos, size_type n, const value_type & x);

      Requires: pos must be a valid iterator of *this.

      Effects: Insert n copies of x before pos.

      Returns: an iterator to the first inserted element or pos if n is 0.

      @@ -588,7 +588,7 @@ 
    48. template<typename InIt> 
-  iterator insert(const_iterator pos, InIt first, InIt last);
      + iterator insert(const_iterator pos, InIt first, InIt last);

      Requires: pos must be a valid iterator of *this.

      Effects: Insert a copy of the [first, last) range before pos.

      Returns: an iterator to the first inserted element or pos if first == last.

      @@ -596,7 +596,7 @@

      Complexity: Linear to distance [first, last).

    49. -
      iterator insert(const_iterator pos, std::initializer_list< value_type > il);
      +
      iterator insert(const_iterator pos, std::initializer_list< value_type > il);

      Requires: pos must be a valid iterator of *this.

      Effects: Insert a copy of the [il.begin(), il.end()) range before pos.

      Returns: an iterator to the first inserted element or pos if il.begin() == il.end().

      @@ -604,37 +604,37 @@

      Complexity: Linear to distance [il.begin(), il.end()).

    50. -
      void pop_front() noexcept;
      +
      void pop_front() noexcept;

      Effects: Removes the first element from the deque.

      Throws: Nothing.

      Complexity: Constant time.

    51. -
      void pop_back() noexcept;
      +
      void pop_back() noexcept;

      Effects: Removes the last element from the deque.

      Throws: Nothing.

      Complexity: Constant time.

    52. -
      iterator erase(const_iterator pos) noexcept;
      +
      iterator erase(const_iterator pos) noexcept;

      Effects: Erases the element at p.

      Throws: Nothing.

      Complexity: Linear to the elements between pos and the last element (if pos is near the end) or the first element if(pos is near the beginning). Constant if pos is the first or the last element.

    53. -
      iterator erase(const_iterator first, const_iterator last) noexcept;
      +
      iterator erase(const_iterator first, const_iterator last) noexcept;

      Effects: Erases the elements pointed by [first, last).

      Throws: Nothing.

      Complexity: Linear to the distance between first and last plus the elements between pos and the last element (if pos is near the end) or the first element if(pos is near the beginning).

    54. -
      void swap(deque & x) noexcept(allocator_traits_type::propagate_on_container_swap::value||allocator_traits_type::is_always_equal::value));
      +
      void swap(deque & x) noexcept(allocator_traits_type::propagate_on_container_swap::value||allocator_traits_type::is_always_equal::value));

      Effects: Swaps the contents of *this and x.

      Throws: Nothing.

      Complexity: Constant.

    55. -
      void clear() noexcept;
      +
      void clear() noexcept;

      Effects: Erases all the elements of the deque.

      Throws: Nothing.

      Complexity: Linear to the number of elements in the deque.

      @@ -642,41 +642,41 @@
    -

    -deque friend functions

    +

    +deque friend functions

    1. -
      friend bool operator==(const deque & x, const deque & y);
      +
      friend bool operator==(const deque & x, const deque & y);

      Effects: Returns true if x and y are equal

      Complexity: Linear to the number of elements in the container.

    2. -
      friend bool operator!=(const deque & x, const deque & y);
      +
      friend bool operator!=(const deque & x, const deque & y);

      Effects: Returns true if x and y are unequal

      Complexity: Linear to the number of elements in the container.

    3. -
      friend bool operator<(const deque & x, const deque & y);
      +
      friend bool operator<(const deque & x, const deque & y);

      Effects: Returns true if x is less than y

      Complexity: Linear to the number of elements in the container.

    4. -
      friend bool operator>(const deque & x, const deque & y);
      +
      friend bool operator>(const deque & x, const deque & y);

      Effects: Returns true if x is greater than y

      Complexity: Linear to the number of elements in the container.

    5. -
      friend bool operator<=(const deque & x, const deque & y);
      +
      friend bool operator<=(const deque & x, const deque & y);

      Effects: Returns true if x is equal or less than y

      Complexity: Linear to the number of elements in the container.

    6. -
      friend bool operator>=(const deque & x, const deque & y);
      +
      friend bool operator>=(const deque & x, const deque & y);

      Effects: Returns true if x is equal or greater than y

      Complexity: Linear to the number of elements in the container.

    7. -
      friend void swap(deque & x, deque & y);
      +
      friend void swap(deque & x, deque & y);

      Effects: x.swap(y)

      Complexity: Constant.

      8. @@ -686,7 +686,7 @@
    -
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -694,7 +694,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/container/erased_type.html b/doc/html/boost/container/erased_type.html new file mode 100644 index 0000000000..329f303a79 --- /dev/null +++ b/doc/html/boost/container/erased_type.html @@ -0,0 +1,56 @@ + + + + +Struct erased_type + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct erased_type

    +

    boost::container::erased_type

    +
    +

    Synopsis

    +
    // In header: <boost/container/uses_allocator_fwd.hpp>
+
+
+struct erased_type {
+};
    +
    +

    Description

    +

    The erased_type struct is an empty struct that serves as a placeholder for a type T in situations where the actual type T is determined at runtime. For example, the nested type, allocator_type, is an alias for erased_type in classes that use type-erased allocators.

    +
    +
    + + + +
    Copyright © 2009-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/flat_map.html b/doc/html/boost/container/flat_map.html index ec2b6ba21b..c6342fff35 100644 --- a/doc/html/boost/container/flat_map.html +++ b/doc/html/boost/container/flat_map.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -58,105 +58,105 @@ typedef implementation_defined movable_value_type; // construct/copy/destruct - flat_map(); - explicit flat_map(const Compare &, + flat_map(); + explicit flat_map(const Compare &, const allocator_type & = allocator_type()); - explicit flat_map(const allocator_type &); + explicit flat_map(const allocator_type &); template<typename InputIterator> - flat_map(InputIterator, InputIterator, const Compare & = Compare(), + flat_map(InputIterator, InputIterator, const Compare & = Compare(), const allocator_type & = allocator_type()); template<typename InputIterator> - flat_map(InputIterator, InputIterator, const allocator_type &); + flat_map(InputIterator, InputIterator, const allocator_type &); template<typename InputIterator> - flat_map(ordered_unique_range_t, InputIterator, InputIterator, + flat_map(ordered_unique_range_t, InputIterator, InputIterator, const Compare & = Compare(), const allocator_type & = allocator_type()); - flat_map(std::initializer_list< value_type >, const Compare & = Compare(), + flat_map(std::initializer_list< value_type >, const Compare & = Compare(), const allocator_type & = allocator_type()); - flat_map(std::initializer_list< value_type >, const allocator_type &); - flat_map(ordered_unique_range_t, std::initializer_list< value_type >, + flat_map(std::initializer_list< value_type >, const allocator_type &); + flat_map(ordered_unique_range_t, std::initializer_list< value_type >, const Compare & = Compare(), const allocator_type & = allocator_type()); - flat_map(const flat_map &); - flat_map(flat_map &&); - flat_map(const flat_map &, const allocator_type &); - flat_map(flat_map &&, const allocator_type &); - flat_map & operator=(const flat_map &); - flat_map & operator=(flat_map &&) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_move_assignable< Compare >::value)); - flat_map & operator=(std::initializer_list< value_type >); + flat_map(const flat_map &); + flat_map(flat_map &&); + flat_map(const flat_map &, const allocator_type &); + flat_map(flat_map &&, const allocator_type &); + flat_map & operator=(const flat_map &); + flat_map & operator=(flat_map &&) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_move_assignable< Compare >::value)); + flat_map & operator=(std::initializer_list< value_type >); - // public member functions - allocator_type get_allocator() const noexcept; - stored_allocator_type & get_stored_allocator() noexcept; - const stored_allocator_type & get_stored_allocator() const noexcept; - iterator begin() noexcept; - const_iterator begin() const noexcept; - iterator end() noexcept; - const_iterator end() const noexcept; - reverse_iterator rbegin() noexcept; - const_reverse_iterator rbegin() const noexcept; - reverse_iterator rend() noexcept; - const_reverse_iterator rend() const noexcept; - const_iterator cbegin() const noexcept; - const_iterator cend() const noexcept; - const_reverse_iterator crbegin() const noexcept; - const_reverse_iterator crend() const noexcept; - bool empty() const noexcept; - size_type size() const noexcept; - size_type max_size() const noexcept; - size_type capacity() const noexcept; - void reserve(size_type); - void shrink_to_fit(); - mapped_type & operator[](const key_type &); - mapped_type & operator[](key_type &&); - iterator nth(size_type) noexcept; - const_iterator nth(size_type) const noexcept; - size_type index_of(iterator) noexcept; - size_type index_of(const_iterator) const noexcept; - T & at(const key_type &); - const T & at(const key_type &) const; - template<class... Args> std::pair< iterator, bool > emplace(Args &&...); - template<class... Args> iterator emplace_hint(const_iterator, Args &&...); - std::pair< iterator, bool > insert(const value_type &); - std::pair< iterator, bool > insert(value_type &&); - std::pair< iterator, bool > insert(movable_value_type &&); - iterator insert(const_iterator, const value_type &); - iterator insert(const_iterator, value_type &&); - iterator insert(const_iterator, movable_value_type &&); - template<typename InputIterator> void insert(InputIterator, InputIterator); + // public member functions + allocator_type get_allocator() const noexcept; + stored_allocator_type & get_stored_allocator() noexcept; + const stored_allocator_type & get_stored_allocator() const noexcept; + iterator begin() noexcept; + const_iterator begin() const noexcept; + iterator end() noexcept; + const_iterator end() const noexcept; + reverse_iterator rbegin() noexcept; + const_reverse_iterator rbegin() const noexcept; + reverse_iterator rend() noexcept; + const_reverse_iterator rend() const noexcept; + const_iterator cbegin() const noexcept; + const_iterator cend() const noexcept; + const_reverse_iterator crbegin() const noexcept; + const_reverse_iterator crend() const noexcept; + bool empty() const noexcept; + size_type size() const noexcept; + size_type max_size() const noexcept; + size_type capacity() const noexcept; + void reserve(size_type); + void shrink_to_fit(); + mapped_type & operator[](const key_type &); + mapped_type & operator[](key_type &&); + iterator nth(size_type) noexcept; + const_iterator nth(size_type) const noexcept; + size_type index_of(iterator) noexcept; + size_type index_of(const_iterator) const noexcept; + T & at(const key_type &); + const T & at(const key_type &) const; + template<class... Args> std::pair< iterator, bool > emplace(Args &&...); + template<class... Args> iterator emplace_hint(const_iterator, Args &&...); + std::pair< iterator, bool > insert(const value_type &); + std::pair< iterator, bool > insert(value_type &&); + std::pair< iterator, bool > insert(movable_value_type &&); + iterator insert(const_iterator, const value_type &); + iterator insert(const_iterator, value_type &&); + iterator insert(const_iterator, movable_value_type &&); + template<typename InputIterator> void insert(InputIterator, InputIterator); template<typename InputIterator> - void insert(ordered_unique_range_t, InputIterator, InputIterator); - void insert(std::initializer_list< value_type >); - void insert(ordered_unique_range_t, std::initializer_list< value_type >); - iterator erase(const_iterator); - size_type erase(const key_type &); - iterator erase(const_iterator, const_iterator); - void swap(flat_map &) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_swappable< Compare >::value)); - void clear() noexcept; - key_compare key_comp() const; - value_compare value_comp() const; - iterator find(const key_type &); - const_iterator find(const key_type &) const; - size_type count(const key_type &) const; - iterator lower_bound(const key_type &); - const_iterator lower_bound(const key_type &) const; - iterator upper_bound(const key_type &); - const_iterator upper_bound(const key_type &) const; - std::pair< iterator, iterator > equal_range(const key_type &); + void insert(ordered_unique_range_t, InputIterator, InputIterator); + void insert(std::initializer_list< value_type >); + void insert(ordered_unique_range_t, std::initializer_list< value_type >); + iterator erase(const_iterator); + size_type erase(const key_type &); + iterator erase(const_iterator, const_iterator); + void swap(flat_map &) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_swappable< Compare >::value)); + void clear() noexcept; + key_compare key_comp() const; + value_compare value_comp() const; + iterator find(const key_type &); + const_iterator find(const key_type &) const; + size_type count(const key_type &) const; + iterator lower_bound(const key_type &); + const_iterator lower_bound(const key_type &) const; + iterator upper_bound(const key_type &); + const_iterator upper_bound(const key_type &) const; + std::pair< iterator, iterator > equal_range(const key_type &); std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; + equal_range(const key_type &) const; - // friend functions - friend bool operator==(const flat_map &, const flat_map &); - friend bool operator!=(const flat_map &, const flat_map &); - friend bool operator<(const flat_map &, const flat_map &); - friend bool operator>(const flat_map &, const flat_map &); - friend bool operator<=(const flat_map &, const flat_map &); - friend bool operator>=(const flat_map &, const flat_map &); - friend void swap(flat_map &, flat_map &); + // friend functions + friend bool operator==(const flat_map &, const flat_map &); + friend bool operator!=(const flat_map &, const flat_map &); + friend bool operator<(const flat_map &, const flat_map &); + friend bool operator>(const flat_map &, const flat_map &); + friend bool operator<=(const flat_map &, const flat_map &); + friend bool operator>=(const flat_map &, const flat_map &); + friend void swap(flat_map &, flat_map &); };
    -

    Description

    +

    Description

    A flat_map is a kind of associative container that supports unique keys (contains at most one of each key value) and provides for fast retrieval of values of another type T based on the keys. The flat_map class supports random-access iterators.

    A flat_map satisfies all of the requirements of a container and of a reversible container and of an associative container. A flat_map also provides most operations described for unique keys. For a flat_map<Key,T> the key_type is Key and the value_type is std::pair<Key,T> (unlike std::map<Key, T> which value_type is std::pair<const Key, T>).

    Compare is the ordering function for Keys (e.g. std::less<Key>).

    @@ -167,7 +167,7 @@

    -

    Template Parameters

    +

    Template Parameters

    1. typename Key
      @@ -185,30 +185,30 @@
    -

    +

    flat_map public construct/copy/destruct

    1. -
      flat_map();
      +
      flat_map();

      Effects: Default constructs an empty flat_map.

      Complexity: Constant.

    2. -
      explicit flat_map(const Compare & comp, 
+
      explicit flat_map(const Compare & comp, 
                   const allocator_type & a = allocator_type());
      
 
      Effects: Constructs an empty flat_map using the specified comparison object and allocator.
      
 
      Complexity: Constant.
    3. -
      explicit flat_map(const allocator_type & a);
      +
      explicit flat_map(const allocator_type & a);

      Effects: Constructs an empty flat_map using the specified allocator.

      Complexity: Constant. 

    4. template<typename InputIterator> 
-  flat_map(InputIterator first, InputIterator last, 
+  flat_map(InputIterator first, InputIterator last, 
            const Compare & comp = Compare(), 
            const allocator_type & a = allocator_type());

      Effects: Constructs an empty flat_map using the specified comparison object and allocator, and inserts elements from the range [first ,last ).

      @@ -216,13 +216,13 @@ 
    5. template<typename InputIterator> 
-  flat_map(InputIterator first, InputIterator last, const allocator_type & a);
      + flat_map(InputIterator first, InputIterator last, const allocator_type & a);

      Effects: Constructs an empty flat_map using the specified allocator, and inserts elements from the range [first ,last ).

      Complexity: Linear in N if the range [first ,last ) is already sorted using comp and otherwise N logN, where N is last - first. 

    6. template<typename InputIterator> 
-  flat_map(ordered_unique_range_t, InputIterator first, InputIterator last, 
+  flat_map(ordered_unique_range_t, InputIterator first, InputIterator last, 
            const Compare & comp = Compare(), 
            const allocator_type & a = allocator_type());

      Effects: Constructs an empty flat_map using the specified comparison object and allocator, and inserts elements from the ordered unique range [first ,last). This function is more efficient than the normal range creation for ordered ranges.

      @@ -231,19 +231,19 @@

      Note: Non-standard extension.

    7. -
      flat_map(std::initializer_list< value_type > il, 
+
      flat_map(std::initializer_list< value_type > il, 
          const Compare & comp = Compare(), 
          const allocator_type & a = allocator_type());
      
 
      Effects: Constructs an empty flat_map using the specified comparison object and allocator, and inserts elements from the range [il.begin() ,il.end()).
      
 
      Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using comp and otherwise N logN, where N is last - first.
    8. -
      flat_map(std::initializer_list< value_type > il, const allocator_type & a);
      +
      flat_map(std::initializer_list< value_type > il, const allocator_type & a);

      Effects: Constructs an empty flat_map using the specified allocator, and inserts elements from the range [il.begin() ,il.end()).

      Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using comp and otherwise N logN, where N is last - first.

    9. -
      flat_map(ordered_unique_range_t, std::initializer_list< value_type > il, 
+
      flat_map(ordered_unique_range_t, std::initializer_list< value_type > il, 
          const Compare & comp = Compare(), 
          const allocator_type & a = allocator_type());
      
 
      Effects: Constructs an empty flat_map using the specified comparison object and allocator, and inserts elements from the ordered unique range [il.begin(), il.end()). This function is more efficient than the normal range creation for ordered ranges.
      
@@ -252,186 +252,186 @@
 
      Note: Non-standard extension.
    10. -
      flat_map(const flat_map & x);
      +
      flat_map(const flat_map & x);

      Effects: Copy constructs a flat_map.

      Complexity: Linear in x.size().

    11. -
      flat_map(flat_map && x);
      +
      flat_map(flat_map && x);

      Effects: Move constructs a flat_map. Constructs *this using x's resources.

      Complexity: Constant.

      Postcondition: x is emptied.

    12. -
      flat_map(const flat_map & x, const allocator_type & a);
      +
      flat_map(const flat_map & x, const allocator_type & a);

      Effects: Copy constructs a flat_map using the specified allocator.

      Complexity: Linear in x.size().

    13. -
      flat_map(flat_map && x, const allocator_type & a);
      +
      flat_map(flat_map && x, const allocator_type & a);

      Effects: Move constructs a flat_map using the specified allocator. Constructs *this using x's resources.

      Complexity: Constant if x.get_allocator() == a, linear otherwise.

    14. -
      flat_map & operator=(const flat_map & x);
      +
      flat_map & operator=(const flat_map & x);

      Effects: Makes *this a copy of x.

      Complexity: Linear in x.size().

    15. -
      flat_map & operator=(flat_map && x) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_move_assignable< Compare >::value));
      +
      flat_map & operator=(flat_map && x) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_move_assignable< Compare >::value));

      Effects: Move constructs a flat_map. Constructs *this using x's resources.

      Throws: If allocator_traits_type::propagate_on_container_move_assignment is false and (allocation throws or value_type's move constructor throws)

      Complexity: Constant if allocator_traits_type:: propagate_on_container_move_assignment is true or this->get>allocator() == x.get_allocator(). Linear otherwise.

    16. -
      flat_map & operator=(std::initializer_list< value_type > il);
      +
      flat_map & operator=(std::initializer_list< value_type > il);
      Effects: Assign elements from il to *this
    -

    -flat_map public member functions

    +

    +flat_map public member functions

    1. -
      allocator_type get_allocator() const noexcept;
      +
      allocator_type get_allocator() const noexcept;

      Effects: Returns a copy of the allocator that was passed to the object's constructor.

      Complexity: Constant.

    2. -
      stored_allocator_type & get_stored_allocator() noexcept;
      +
      stored_allocator_type & get_stored_allocator() noexcept;

      Effects: Returns a reference to the internal allocator.

      Throws: Nothing

      Complexity: Constant.

      Note: Non-standard extension.

    3. -
      const stored_allocator_type & get_stored_allocator() const noexcept;
      +
      const stored_allocator_type & get_stored_allocator() const noexcept;

      Effects: Returns a reference to the internal allocator.

      Throws: Nothing

      Complexity: Constant.

      Note: Non-standard extension.

    4. -
      iterator begin() noexcept;
      +
      iterator begin() noexcept;

      Effects: Returns an iterator to the first element contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    5. -
      const_iterator begin() const noexcept;
      +
      const_iterator begin() const noexcept;

      Effects: Returns a const_iterator to the first element contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    6. -
      iterator end() noexcept;
      +
      iterator end() noexcept;

      Effects: Returns an iterator to the end of the container.

      Throws: Nothing.

      Complexity: Constant.

    7. -
      const_iterator end() const noexcept;
      +
      const_iterator end() const noexcept;

      Effects: Returns a const_iterator to the end of the container.

      Throws: Nothing.

      Complexity: Constant.

    8. -
      reverse_iterator rbegin() noexcept;
      +
      reverse_iterator rbegin() noexcept;

      Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    9. -
      const_reverse_iterator rbegin() const noexcept;
      +
      const_reverse_iterator rbegin() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    10. -
      reverse_iterator rend() noexcept;
      +
      reverse_iterator rend() noexcept;

      Effects: Returns a reverse_iterator pointing to the end of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    11. -
      const_reverse_iterator rend() const noexcept;
      +
      const_reverse_iterator rend() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    12. -
      const_iterator cbegin() const noexcept;
      +
      const_iterator cbegin() const noexcept;

      Effects: Returns a const_iterator to the first element contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    13. -
      const_iterator cend() const noexcept;
      +
      const_iterator cend() const noexcept;

      Effects: Returns a const_iterator to the end of the container.

      Throws: Nothing.

      Complexity: Constant.

    14. -
      const_reverse_iterator crbegin() const noexcept;
      +
      const_reverse_iterator crbegin() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    15. -
      const_reverse_iterator crend() const noexcept;
      +
      const_reverse_iterator crend() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    16. -
      bool empty() const noexcept;
      +
      bool empty() const noexcept;

      Effects: Returns true if the container contains no elements.

      Throws: Nothing.

      Complexity: Constant.

    17. -
      size_type size() const noexcept;
      +
      size_type size() const noexcept;

      Effects: Returns the number of the elements contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    18. -
      size_type max_size() const noexcept;
      +
      size_type max_size() const noexcept;

      Effects: Returns the largest possible size of the container.

      Throws: Nothing.

      Complexity: Constant.

    19. -
      size_type capacity() const noexcept;
      +
      size_type capacity() const noexcept;

      Effects: Number of elements for which memory has been allocated. capacity() is always greater than or equal to size().

      Throws: Nothing.

      Complexity: Constant.

    20. -
      void reserve(size_type cnt);
      +
      void reserve(size_type cnt);

      Effects: If n is less than or equal to capacity(), this call has no effect. Otherwise, it is a request for allocation of additional memory. If the request is successful, then capacity() is greater than or equal to n; otherwise, capacity() is unchanged. In either case, size() is unchanged.

      Throws: If memory allocation allocation throws or T's copy constructor throws.

      Note: If capacity() is less than "cnt", iterators and references to to values might be invalidated.

    21. -
      void shrink_to_fit();
      +
      void shrink_to_fit();
      Effects: Tries to deallocate the excess of memory created

      Throws: If memory allocation throws, or T's copy constructor throws.

      Complexity: Linear to size().

    22. -
      mapped_type & operator[](const key_type & k);
      +
      mapped_type & operator[](const key_type & k);

      Effects: If there is no key equivalent to x in the flat_map, inserts value_type(x, T()) into the flat_map.

      Returns: A reference to the mapped_type corresponding to x in *this.

      Complexity: Logarithmic.

    23. -
      mapped_type & operator[](key_type && k);
      +
      mapped_type & operator[](key_type && k);

      Effects: If there is no key equivalent to x in the flat_map, inserts value_type(move(x), T()) into the flat_map (the key is move-constructed)

      Returns: A reference to the mapped_type corresponding to x in *this.

      Complexity: Logarithmic.

    24. -
      iterator nth(size_type n) noexcept;
      +
      iterator nth(size_type n) noexcept;

      Requires: size() >= n.

      Effects: Returns an iterator to the nth element from the beginning of the container. Returns end() if n == size().

      Throws: Nothing.

      @@ -439,7 +439,7 @@

      Note: Non-standard extension

    25. -
      const_iterator nth(size_type n) const noexcept;
      +
      const_iterator nth(size_type n) const noexcept;

      Requires: size() >= n.

      Effects: Returns a const_iterator to the nth element from the beginning of the container. Returns end() if n == size().

      Throws: Nothing.

      @@ -447,7 +447,7 @@

      Note: Non-standard extension

    26. -
      size_type index_of(iterator p) noexcept;
      +
      size_type index_of(iterator p) noexcept;

      Requires: size() >= n.

      Effects: Returns an iterator to the nth element from the beginning of the container. Returns end() if n == size().

      Throws: Nothing.

      @@ -455,7 +455,7 @@

      Note: Non-standard extension

    27. -
      size_type index_of(const_iterator p) const noexcept;
      +
      size_type index_of(const_iterator p) const noexcept;

      Requires: begin() <= p <= end().

      Effects: Returns the index of the element pointed by p and size() if p == end().

      Throws: Nothing.

      @@ -463,19 +463,19 @@

      Note: Non-standard extension

    28. -
      T & at(const key_type & k);
      +
      T & at(const key_type & k);

      Returns: A reference to the element whose key is equivalent to x.

      Throws: An exception object of type out_of_range if no such element is present.

      Complexity: logarithmic.

    29. -
      const T & at(const key_type & k) const;
      +
      const T & at(const key_type & k) const;

      Returns: A reference to the element whose key is equivalent to x.

      Throws: An exception object of type out_of_range if no such element is present.

      Complexity: logarithmic.

    30. -
      template<class... Args> std::pair< iterator, bool > emplace(Args &&... args);
      +
      template<class... Args> std::pair< iterator, bool > emplace(Args &&... args);

      Effects: Inserts an object x of type T constructed with std::forward<Args>(args)... if and only if there is no element in the container with key equivalent to the key of x.

      Returns: The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of x.

      Complexity: Logarithmic search time plus linear insertion to the elements with bigger keys than x.

      @@ -483,49 +483,49 @@ 
    31. template<class... Args> 
-  iterator emplace_hint(const_iterator hint, Args &&... args);
      + iterator emplace_hint(const_iterator hint, Args &&... args);

      Effects: Inserts an object of type T constructed with std::forward<Args>(args)... in the container if and only if there is no element in the container with key equivalent to the key of x. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic search time (constant if x is inserted right before p) plus insertion linear to the elements with bigger keys than x.

      Note: If an element is inserted it might invalidate elements.

    32. -
      std::pair< iterator, bool > insert(const value_type & x);
      +
      std::pair< iterator, bool > insert(const value_type & x);

      Effects: Inserts x if and only if there is no element in the container with key equivalent to the key of x.

      Returns: The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of x.

      Complexity: Logarithmic search time plus linear insertion to the elements with bigger keys than x.

      Note: If an element is inserted it might invalidate elements.

    33. -
      std::pair< iterator, bool > insert(value_type && x);
      +
      std::pair< iterator, bool > insert(value_type && x);

      Effects: Inserts a new value_type move constructed from the pair if and only if there is no element in the container with key equivalent to the key of x.

      Returns: The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of x.

      Complexity: Logarithmic search time plus linear insertion to the elements with bigger keys than x.

      Note: If an element is inserted it might invalidate elements.

    34. -
      std::pair< iterator, bool > insert(movable_value_type && x);
      +
      std::pair< iterator, bool > insert(movable_value_type && x);

      Effects: Inserts a new value_type move constructed from the pair if and only if there is no element in the container with key equivalent to the key of x.

      Returns: The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of x.

      Complexity: Logarithmic search time plus linear insertion to the elements with bigger keys than x.

      Note: If an element is inserted it might invalidate elements.

    35. -
      iterator insert(const_iterator p, const value_type & x);
      +
      iterator insert(const_iterator p, const value_type & x);

      Effects: Inserts a copy of x in the container if and only if there is no element in the container with key equivalent to the key of x. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic search time (constant if x is inserted right before p) plus insertion linear to the elements with bigger keys than x.

      Note: If an element is inserted it might invalidate elements.

    36. -
      iterator insert(const_iterator p, value_type && x);
      +
      iterator insert(const_iterator p, value_type && x);

      Effects: Inserts an element move constructed from x in the container. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic search time (constant if x is inserted right before p) plus insertion linear to the elements with bigger keys than x.

      Note: If an element is inserted it might invalidate elements.

    37. -
      iterator insert(const_iterator p, movable_value_type && x);
      +
      iterator insert(const_iterator p, movable_value_type && x);

      Effects: Inserts an element move constructed from x in the container. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic search time (constant if x is inserted right before p) plus insertion linear to the elements with bigger keys than x.

      @@ -533,7 +533,7 @@ 
    38. template<typename InputIterator> 
-  void insert(InputIterator first, InputIterator last);
      + void insert(InputIterator first, InputIterator last);

      Requires: first, last are not iterators into *this.

      Effects: inserts each element from the range [first,last) if and only if there is no element with key equivalent to the key of that element.

      Complexity: At most N log(size()+N) (N is the distance from first to last) search time plus N*size() insertion time.

      @@ -541,7 +541,7 @@ 
    39. template<typename InputIterator> 
-  void insert(ordered_unique_range_t, InputIterator first, InputIterator last);
      + void insert(ordered_unique_range_t, InputIterator first, InputIterator last);

      Requires: first, last are not iterators into *this.

      Requires: [first ,last) must be ordered according to the predicate and must be unique values.

      Effects: inserts each element from the range [first,last) if and only if there is no element with key equivalent to the key of that element. This function is more efficient than the normal range creation for ordered ranges.

      @@ -550,13 +550,13 @@

      Note: Non-standard extension.

    40. -
      void insert(std::initializer_list< value_type > il);
      +
      void insert(std::initializer_list< value_type > il);

      Effects: inserts each element from the range [il.begin(), il.end()) if and only if there is no element with key equivalent to the key of that element.

      Complexity: At most N log(size()+N) (N is the distance from il.first() to il.end()) search time plus N*size() insertion time.

      Note: If an element is inserted it might invalidate elements.

    41. -
      void insert(ordered_unique_range_t, std::initializer_list< value_type > il);
      +
      void insert(ordered_unique_range_t, std::initializer_list< value_type > il);

      Requires: [il.begin(), il.end()) must be ordered according to the predicate and must be unique values.

      Effects: inserts each element from the range [il.begin(), il.end()) if and only if there is no element with key equivalent to the key of that element. This function is more efficient than the normal range creation for ordered ranges.

      Complexity: At most N log(size()+N) (N is the distance from first to last) search time plus N*size() insertion time.

      @@ -564,131 +564,131 @@

      Note: Non-standard extension.

    42. -
      iterator erase(const_iterator p);
      +
      iterator erase(const_iterator p);

      Effects: Erases the element pointed to by p.

      Returns: Returns an iterator pointing to the element immediately following q prior to the element being erased. If no such element exists, returns end().

      Complexity: Linear to the elements with keys bigger than p

      Note: Invalidates elements with keys not less than the erased element.

    43. -
      size_type erase(const key_type & x);
      +
      size_type erase(const key_type & x);

      Effects: Erases all elements in the container with key equivalent to x.

      Returns: Returns the number of erased elements.

      Complexity: Logarithmic search time plus erasure time linear to the elements with bigger keys.

    44. -
      iterator erase(const_iterator first, const_iterator last);
      +
      iterator erase(const_iterator first, const_iterator last);

      Effects: Erases all the elements in the range [first, last).

      Returns: Returns last.

      Complexity: size()*N where N is the distance from first to last.

      Complexity: Logarithmic search time plus erasure time linear to the elements with bigger keys.

    45. -
      void swap(flat_map & x) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_swappable< Compare >::value));
      +
      void swap(flat_map & x) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_swappable< Compare >::value));

      Effects: Swaps the contents of *this and x.

      Throws: Nothing.

      Complexity: Constant.

    46. -
      void clear() noexcept;
      +
      void clear() noexcept;

      Effects: erase(a.begin(),a.end()).

      Postcondition: size() == 0.

      Complexity: linear in size().

    47. -
      key_compare key_comp() const;
      +
      key_compare key_comp() const;

      Effects: Returns the comparison object out of which a was constructed.

      Complexity: Constant.

    48. -
      value_compare value_comp() const;
      +
      value_compare value_comp() const;

      Effects: Returns an object of value_compare constructed out of the comparison object.

      Complexity: Constant.

    49. -
      iterator find(const key_type & x);
      +
      iterator find(const key_type & x);

      Returns: An iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.

      Complexity: Logarithmic.

    50. -
      const_iterator find(const key_type & x) const;
      +
      const_iterator find(const key_type & x) const;

      Returns: A const_iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.

      -

      Complexity: Logarithmic.s

      +

      Complexity: Logarithmic.

    51. -
      size_type count(const key_type & x) const;
      +
      size_type count(const key_type & x) const;

      Returns: The number of elements with key equivalent to x.

      Complexity: log(size())+count(k)

    52. -
      iterator lower_bound(const key_type & x);
      +
      iterator lower_bound(const key_type & x);

      Returns: An iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.

      -

      Complexity: Logarithmic

      +

      Complexity: Logarithmic.

    53. -
      const_iterator lower_bound(const key_type & x) const;
      +
      const_iterator lower_bound(const key_type & x) const;

      Returns: A const iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.

      -

      Complexity: Logarithmic

      +

      Complexity: Logarithmic.

    54. -
      iterator upper_bound(const key_type & x);
      +
      iterator upper_bound(const key_type & x);

      Returns: An iterator pointing to the first element with key not less than x, or end() if such an element is not found.

      -

      Complexity: Logarithmic

      +

      Complexity: Logarithmic.

    55. -
      const_iterator upper_bound(const key_type & x) const;
      +
      const_iterator upper_bound(const key_type & x) const;

      Returns: A const iterator pointing to the first element with key not less than x, or end() if such an element is not found.

      -

      Complexity: Logarithmic

      +

      Complexity: Logarithmic.

    56. -
      std::pair< iterator, iterator > equal_range(const key_type & x);
      +
      std::pair< iterator, iterator > equal_range(const key_type & x);

      Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).

      -

      Complexity: Logarithmic

      +

      Complexity: Logarithmic. 

    57. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & x) const;
      +equal_range(const key_type & x) const;

      Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).

      -

      Complexity: Logarithmic

      +

      Complexity: Logarithmic.

    -

    -flat_map friend functions

    +

    +flat_map friend functions

    1. -
      friend bool operator==(const flat_map & x, const flat_map & y);
      +
      friend bool operator==(const flat_map & x, const flat_map & y);

      Effects: Returns true if x and y are equal

      Complexity: Linear to the number of elements in the container.

    2. -
      friend bool operator!=(const flat_map & x, const flat_map & y);
      +
      friend bool operator!=(const flat_map & x, const flat_map & y);

      Effects: Returns true if x and y are unequal

      Complexity: Linear to the number of elements in the container.

    3. -
      friend bool operator<(const flat_map & x, const flat_map & y);
      +
      friend bool operator<(const flat_map & x, const flat_map & y);

      Effects: Returns true if x is less than y

      Complexity: Linear to the number of elements in the container.

    4. -
      friend bool operator>(const flat_map & x, const flat_map & y);
      +
      friend bool operator>(const flat_map & x, const flat_map & y);

      Effects: Returns true if x is greater than y

      Complexity: Linear to the number of elements in the container.

    5. -
      friend bool operator<=(const flat_map & x, const flat_map & y);
      +
      friend bool operator<=(const flat_map & x, const flat_map & y);

      Effects: Returns true if x is equal or less than y

      Complexity: Linear to the number of elements in the container.

    6. -
      friend bool operator>=(const flat_map & x, const flat_map & y);
      +
      friend bool operator>=(const flat_map & x, const flat_map & y);

      Effects: Returns true if x is equal or greater than y

      Complexity: Linear to the number of elements in the container.

    7. -
      friend void swap(flat_map & x, flat_map & y);
      +
      friend void swap(flat_map & x, flat_map & y);

      Effects: x.swap(y)

      Complexity: Constant.

      8. @@ -698,7 +698,7 @@
    -
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -706,7 +706,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/container/flat_multimap.html b/doc/html/boost/container/flat_multimap.html index beb6fa15c9..20ba97dc86 100644 --- a/doc/html/boost/container/flat_multimap.html +++ b/doc/html/boost/container/flat_multimap.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -58,103 +58,103 @@ typedef implementation_defined movable_value_type; // construct/copy/destruct - flat_multimap(); - explicit flat_multimap(const Compare &, + flat_multimap(); + explicit flat_multimap(const Compare &, const allocator_type & = allocator_type()); - explicit flat_multimap(const allocator_type &); + explicit flat_multimap(const allocator_type &); template<typename InputIterator> - flat_multimap(InputIterator, InputIterator, const Compare & = Compare(), + flat_multimap(InputIterator, InputIterator, const Compare & = Compare(), const allocator_type & = allocator_type()); template<typename InputIterator> - flat_multimap(InputIterator, InputIterator, const allocator_type &); + flat_multimap(InputIterator, InputIterator, const allocator_type &); template<typename InputIterator> - flat_multimap(ordered_range_t, InputIterator, InputIterator, + flat_multimap(ordered_range_t, InputIterator, InputIterator, const Compare & = Compare(), const allocator_type & = allocator_type()); - flat_multimap(std::initializer_list< value_type >, + flat_multimap(std::initializer_list< value_type >, const Compare & = Compare(), const allocator_type & = allocator_type()); - flat_multimap(std::initializer_list< value_type >, const allocator_type &); - flat_multimap(ordered_range_t, std::initializer_list< value_type >, + flat_multimap(std::initializer_list< value_type >, const allocator_type &); + flat_multimap(ordered_range_t, std::initializer_list< value_type >, const Compare & = Compare(), const allocator_type & = allocator_type()); - flat_multimap(const flat_multimap &); - flat_multimap(flat_multimap &&); - flat_multimap(const flat_multimap &, const allocator_type &); - flat_multimap(flat_multimap &&, const allocator_type &); - flat_multimap & operator=(const flat_multimap &); + flat_multimap(const flat_multimap &); + flat_multimap(flat_multimap &&); + flat_multimap(const flat_multimap &, const allocator_type &); + flat_multimap(flat_multimap &&, const allocator_type &); + flat_multimap & operator=(const flat_multimap &); flat_multimap & - operator=(flat_multimap &&) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_move_assignable< Compare >::value)); - flat_multimap & operator=(std::initializer_list< value_type >); + operator=(flat_multimap &&) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_move_assignable< Compare >::value)); + flat_multimap & operator=(std::initializer_list< value_type >); - // public member functions - allocator_type get_allocator() const noexcept; - stored_allocator_type & get_stored_allocator() noexcept; - const stored_allocator_type & get_stored_allocator() const noexcept; - iterator begin() noexcept; - const_iterator begin() const noexcept; - iterator end() noexcept; - const_iterator end() const noexcept; - reverse_iterator rbegin() noexcept; - const_reverse_iterator rbegin() const noexcept; - reverse_iterator rend() noexcept; - const_reverse_iterator rend() const noexcept; - const_iterator cbegin() const noexcept; - const_iterator cend() const noexcept; - const_reverse_iterator crbegin() const noexcept; - const_reverse_iterator crend() const noexcept; - bool empty() const noexcept; - size_type size() const noexcept; - size_type max_size() const noexcept; - size_type capacity() const noexcept; - void reserve(size_type); - void shrink_to_fit(); - iterator nth(size_type) noexcept; - const_iterator nth(size_type) const noexcept; - size_type index_of(iterator) noexcept; - size_type index_of(const_iterator) const noexcept; - template<class... Args> iterator emplace(Args &&...); - template<class... Args> iterator emplace_hint(const_iterator, Args &&...); - iterator insert(const value_type &); - iterator insert(value_type &&); - iterator insert(impl_value_type &&); - iterator insert(const_iterator, const value_type &); - iterator insert(const_iterator, value_type &&); - iterator insert(const_iterator, impl_value_type &&); - template<typename InputIterator> void insert(InputIterator, InputIterator); + // public member functions + allocator_type get_allocator() const noexcept; + stored_allocator_type & get_stored_allocator() noexcept; + const stored_allocator_type & get_stored_allocator() const noexcept; + iterator begin() noexcept; + const_iterator begin() const noexcept; + iterator end() noexcept; + const_iterator end() const noexcept; + reverse_iterator rbegin() noexcept; + const_reverse_iterator rbegin() const noexcept; + reverse_iterator rend() noexcept; + const_reverse_iterator rend() const noexcept; + const_iterator cbegin() const noexcept; + const_iterator cend() const noexcept; + const_reverse_iterator crbegin() const noexcept; + const_reverse_iterator crend() const noexcept; + bool empty() const noexcept; + size_type size() const noexcept; + size_type max_size() const noexcept; + size_type capacity() const noexcept; + void reserve(size_type); + void shrink_to_fit(); + iterator nth(size_type) noexcept; + const_iterator nth(size_type) const noexcept; + size_type index_of(iterator) noexcept; + size_type index_of(const_iterator) const noexcept; + template<class... Args> iterator emplace(Args &&...); + template<class... Args> iterator emplace_hint(const_iterator, Args &&...); + iterator insert(const value_type &); + iterator insert(value_type &&); + iterator insert(impl_value_type &&); + iterator insert(const_iterator, const value_type &); + iterator insert(const_iterator, value_type &&); + iterator insert(const_iterator, impl_value_type &&); + template<typename InputIterator> void insert(InputIterator, InputIterator); template<typename InputIterator> - void insert(ordered_range_t, InputIterator, InputIterator); - void insert(std::initializer_list< value_type >); - void insert(ordered_range_t, std::initializer_list< value_type >); - iterator erase(const_iterator); - size_type erase(const key_type &); - iterator erase(const_iterator, const_iterator); - void swap(flat_multimap &) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_swappable< Compare >::value)); - void clear() noexcept; - key_compare key_comp() const; - value_compare value_comp() const; - iterator find(const key_type &); - const_iterator find(const key_type &) const; - size_type count(const key_type &) const; - iterator lower_bound(const key_type &); - const_iterator lower_bound(const key_type &) const; - iterator upper_bound(const key_type &); - const_iterator upper_bound(const key_type &) const; - std::pair< iterator, iterator > equal_range(const key_type &); + void insert(ordered_range_t, InputIterator, InputIterator); + void insert(std::initializer_list< value_type >); + void insert(ordered_range_t, std::initializer_list< value_type >); + iterator erase(const_iterator); + size_type erase(const key_type &); + iterator erase(const_iterator, const_iterator); + void swap(flat_multimap &) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_swappable< Compare >::value)); + void clear() noexcept; + key_compare key_comp() const; + value_compare value_comp() const; + iterator find(const key_type &); + const_iterator find(const key_type &) const; + size_type count(const key_type &) const; + iterator lower_bound(const key_type &); + const_iterator lower_bound(const key_type &) const; + iterator upper_bound(const key_type &); + const_iterator upper_bound(const key_type &) const; + std::pair< iterator, iterator > equal_range(const key_type &); std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; + equal_range(const key_type &) const; - // friend functions - friend bool operator==(const flat_multimap &, const flat_multimap &); - friend bool operator!=(const flat_multimap &, const flat_multimap &); - friend bool operator<(const flat_multimap &, const flat_multimap &); - friend bool operator>(const flat_multimap &, const flat_multimap &); - friend bool operator<=(const flat_multimap &, const flat_multimap &); - friend bool operator>=(const flat_multimap &, const flat_multimap &); - friend void swap(flat_multimap &, flat_multimap &); + // friend functions + friend bool operator==(const flat_multimap &, const flat_multimap &); + friend bool operator!=(const flat_multimap &, const flat_multimap &); + friend bool operator<(const flat_multimap &, const flat_multimap &); + friend bool operator>(const flat_multimap &, const flat_multimap &); + friend bool operator<=(const flat_multimap &, const flat_multimap &); + friend bool operator>=(const flat_multimap &, const flat_multimap &); + friend void swap(flat_multimap &, flat_multimap &); };
    -

    Description

    +

    Description

    A flat_multimap is a kind of associative container that supports equivalent keys (possibly containing multiple copies of the same key value) and provides for fast retrieval of values of another type T based on the keys. The flat_multimap class supports random-access iterators.

    A flat_multimap satisfies all of the requirements of a container and of a reversible container and of an associative container. For a flat_multimap<Key,T> the key_type is Key and the value_type is std::pair<Key,T> (unlike std::multimap<Key, T> which value_type is std::pair<const Key, T>).

    Compare is the ordering function for Keys (e.g. std::less<Key>).

    @@ -165,7 +165,7 @@

    -

    Template Parameters

    +

    Template Parameters

    1. typename Key
      @@ -183,30 +183,30 @@
    -

    +

    flat_multimap public construct/copy/destruct

    1. -
      flat_multimap();
      +
      flat_multimap();

      Effects: Default constructs an empty flat_map.

      Complexity: Constant.

    2. -
      explicit flat_multimap(const Compare & comp, 
+
      explicit flat_multimap(const Compare & comp, 
                        const allocator_type & a = allocator_type());
      
 
      Effects: Constructs an empty flat_multimap using the specified comparison object and allocator.
      
 
      Complexity: Constant.
    3. -
      explicit flat_multimap(const allocator_type & a);
      +
      explicit flat_multimap(const allocator_type & a);

      Effects: Constructs an empty flat_multimap using the specified allocator.

      Complexity: Constant. 

    4. template<typename InputIterator> 
-  flat_multimap(InputIterator first, InputIterator last, 
+  flat_multimap(InputIterator first, InputIterator last, 
                 const Compare & comp = Compare(), 
                 const allocator_type & a = allocator_type());

      Effects: Constructs an empty flat_multimap using the specified comparison object and allocator, and inserts elements from the range [first ,last ).

      @@ -214,14 +214,14 @@ 
    5. template<typename InputIterator> 
-  flat_multimap(InputIterator first, InputIterator last, 
+  flat_multimap(InputIterator first, InputIterator last, 
                 const allocator_type & a);

      Effects: Constructs an empty flat_multimap using the specified allocator, and inserts elements from the range [first ,last ).

      Complexity: Linear in N if the range [first ,last ) is already sorted using comp and otherwise N logN, where N is last - first. 

    6. template<typename InputIterator> 
-  flat_multimap(ordered_range_t, InputIterator first, InputIterator last, 
+  flat_multimap(ordered_range_t, InputIterator first, InputIterator last, 
                 const Compare & comp = Compare(), 
                 const allocator_type & a = allocator_type());

      Effects: Constructs an empty flat_multimap using the specified comparison object and allocator, and inserts elements from the ordered range [first ,last). This function is more efficient than the normal range creation for ordered ranges.

      @@ -230,20 +230,20 @@

      Note: Non-standard extension.

    7. -
      flat_multimap(std::initializer_list< value_type > il, 
+
      flat_multimap(std::initializer_list< value_type > il, 
               const Compare & comp = Compare(), 
               const allocator_type & a = allocator_type());
      
 
      Effects: Constructs an empty flat_map using the specified comparison object and allocator, and inserts elements from the range [il.begin(), il.end()).
      
 
      Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using comp and otherwise N logN, where N is last - first.
    8. -
      flat_multimap(std::initializer_list< value_type > il, 
+
      flat_multimap(std::initializer_list< value_type > il, 
               const allocator_type & a);
      
 
      Effects: Constructs an empty flat_map using the specified allocator, and inserts elements from the range [il.begin(), il.end()).
      
 
      Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using comp and otherwise N logN, where N is last - first.
    9. -
      flat_multimap(ordered_range_t, std::initializer_list< value_type > il, 
+
      flat_multimap(ordered_range_t, std::initializer_list< value_type > il, 
               const Compare & comp = Compare(), 
               const allocator_type & a = allocator_type());
      
 
      Effects: Constructs an empty flat_multimap using the specified comparison object and allocator, and inserts elements from the ordered range [il.begin(), il.end()). This function is more efficient than the normal range creation for ordered ranges.
      
@@ -252,176 +252,176 @@
 
      Note: Non-standard extension.
    10. -
      flat_multimap(const flat_multimap & x);
      +
      flat_multimap(const flat_multimap & x);

      Effects: Copy constructs a flat_multimap.

      Complexity: Linear in x.size().

    11. -
      flat_multimap(flat_multimap && x);
      +
      flat_multimap(flat_multimap && x);

      Effects: Move constructs a flat_multimap. Constructs *this using x's resources.

      Complexity: Constant.

      Postcondition: x is emptied.

    12. -
      flat_multimap(const flat_multimap & x, const allocator_type & a);
      +
      flat_multimap(const flat_multimap & x, const allocator_type & a);

      Effects: Copy constructs a flat_multimap using the specified allocator.

      Complexity: Linear in x.size().

    13. -
      flat_multimap(flat_multimap && x, const allocator_type & a);
      +
      flat_multimap(flat_multimap && x, const allocator_type & a);

      Effects: Move constructs a flat_multimap using the specified allocator. Constructs *this using x's resources.

      Complexity: Constant if a == x.get_allocator(), linear otherwise.

    14. -
      flat_multimap & operator=(const flat_multimap & x);
      +
      flat_multimap & operator=(const flat_multimap & x);

      Effects: Makes *this a copy of x.

      Complexity: Linear in x.size(). 

    15. flat_multimap & 
-operator=(flat_multimap && x) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_move_assignable< Compare >::value));
      +operator=(flat_multimap && x) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_move_assignable< Compare >::value));

      Effects: this->swap(x.get()).

      Complexity: Constant.

    16. -
      flat_multimap & operator=(std::initializer_list< value_type > il);
      +
      flat_multimap & operator=(std::initializer_list< value_type > il);

      Effects: Assign content of il to *this

      Complexity: Linear in il.size().

    -

    -flat_multimap public member functions

    +

    +flat_multimap public member functions

    1. -
      allocator_type get_allocator() const noexcept;
      +
      allocator_type get_allocator() const noexcept;

      Effects: Returns a copy of the allocator that was passed to the object's constructor.

      Complexity: Constant.

    2. -
      stored_allocator_type & get_stored_allocator() noexcept;
      +
      stored_allocator_type & get_stored_allocator() noexcept;

      Effects: Returns a reference to the internal allocator.

      Throws: Nothing

      Complexity: Constant.

      Note: Non-standard extension.

    3. -
      const stored_allocator_type & get_stored_allocator() const noexcept;
      +
      const stored_allocator_type & get_stored_allocator() const noexcept;

      Effects: Returns a reference to the internal allocator.

      Throws: Nothing

      Complexity: Constant.

      Note: Non-standard extension.

    4. -
      iterator begin() noexcept;
      +
      iterator begin() noexcept;

      Effects: Returns an iterator to the first element contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    5. -
      const_iterator begin() const noexcept;
      +
      const_iterator begin() const noexcept;

      Effects: Returns a const_iterator to the first element contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    6. -
      iterator end() noexcept;
      +
      iterator end() noexcept;

      Effects: Returns an iterator to the end of the container.

      Throws: Nothing.

      Complexity: Constant.

    7. -
      const_iterator end() const noexcept;
      +
      const_iterator end() const noexcept;

      Effects: Returns a const_iterator to the end of the container.

      Throws: Nothing.

      Complexity: Constant.

    8. -
      reverse_iterator rbegin() noexcept;
      +
      reverse_iterator rbegin() noexcept;

      Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    9. -
      const_reverse_iterator rbegin() const noexcept;
      +
      const_reverse_iterator rbegin() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    10. -
      reverse_iterator rend() noexcept;
      +
      reverse_iterator rend() noexcept;

      Effects: Returns a reverse_iterator pointing to the end of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    11. -
      const_reverse_iterator rend() const noexcept;
      +
      const_reverse_iterator rend() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    12. -
      const_iterator cbegin() const noexcept;
      +
      const_iterator cbegin() const noexcept;

      Effects: Returns a const_iterator to the first element contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    13. -
      const_iterator cend() const noexcept;
      +
      const_iterator cend() const noexcept;

      Effects: Returns a const_iterator to the end of the container.

      Throws: Nothing.

      Complexity: Constant.

    14. -
      const_reverse_iterator crbegin() const noexcept;
      +
      const_reverse_iterator crbegin() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    15. -
      const_reverse_iterator crend() const noexcept;
      +
      const_reverse_iterator crend() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    16. -
      bool empty() const noexcept;
      +
      bool empty() const noexcept;

      Effects: Returns true if the container contains no elements.

      Throws: Nothing.

      Complexity: Constant.

    17. -
      size_type size() const noexcept;
      +
      size_type size() const noexcept;

      Effects: Returns the number of the elements contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    18. -
      size_type max_size() const noexcept;
      +
      size_type max_size() const noexcept;

      Effects: Returns the largest possible size of the container.

      Throws: Nothing.

      Complexity: Constant.

    19. -
      size_type capacity() const noexcept;
      +
      size_type capacity() const noexcept;

      Effects: Number of elements for which memory has been allocated. capacity() is always greater than or equal to size().

      Throws: Nothing.

      Complexity: Constant.

    20. -
      void reserve(size_type cnt);
      +
      void reserve(size_type cnt);

      Effects: If n is less than or equal to capacity(), this call has no effect. Otherwise, it is a request for allocation of additional memory. If the request is successful, then capacity() is greater than or equal to n; otherwise, capacity() is unchanged. In either case, size() is unchanged.

      Throws: If memory allocation allocation throws or T's copy constructor throws.

      Note: If capacity() is less than "cnt", iterators and references to to values might be invalidated.

    21. -
      void shrink_to_fit();
      +
      void shrink_to_fit();
      Effects: Tries to deallocate the excess of memory created

      Throws: If memory allocation throws, or T's copy constructor throws.

      Complexity: Linear to size().

    22. -
      iterator nth(size_type n) noexcept;
      +
      iterator nth(size_type n) noexcept;

      Requires: size() >= n.

      Effects: Returns an iterator to the nth element from the beginning of the container. Returns end() if n == size().

      Throws: Nothing.

      @@ -429,7 +429,7 @@

      Note: Non-standard extension

    23. -
      const_iterator nth(size_type n) const noexcept;
      +
      const_iterator nth(size_type n) const noexcept;

      Requires: size() >= n.

      Effects: Returns a const_iterator to the nth element from the beginning of the container. Returns end() if n == size().

      Throws: Nothing.

      @@ -437,7 +437,7 @@

      Note: Non-standard extension

    24. -
      size_type index_of(iterator p) noexcept;
      +
      size_type index_of(iterator p) noexcept;

      Requires: size() >= n.

      Effects: Returns an iterator to the nth element from the beginning of the container. Returns end() if n == size().

      Throws: Nothing.

      @@ -445,7 +445,7 @@

      Note: Non-standard extension

    25. -
      size_type index_of(const_iterator p) const noexcept;
      +
      size_type index_of(const_iterator p) const noexcept;

      Requires: begin() <= p <= end().

      Effects: Returns the index of the element pointed by p and size() if p == end().

      Throws: Nothing.

      @@ -453,53 +453,53 @@

      Note: Non-standard extension

    26. -
      template<class... Args> iterator emplace(Args &&... args);
      +
      template<class... Args> iterator emplace(Args &&... args);

      Effects: Inserts an object of type T constructed with std::forward<Args>(args)... and returns the iterator pointing to the newly inserted element.

      Complexity: Logarithmic search time plus linear insertion to the elements with bigger keys than x.

      Note: If an element is inserted it might invalidate elements. 

    27. template<class... Args> 
-  iterator emplace_hint(const_iterator hint, Args &&... args);
      + iterator emplace_hint(const_iterator hint, Args &&... args);

      Effects: Inserts an object of type T constructed with std::forward<Args>(args)... in the container. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic search time (constant time if the value is to be inserted before p) plus linear insertion to the elements with bigger keys than x.

      Note: If an element is inserted it might invalidate elements.

    28. -
      iterator insert(const value_type & x);
      +
      iterator insert(const value_type & x);

      Effects: Inserts x and returns the iterator pointing to the newly inserted element.

      Complexity: Logarithmic search time plus linear insertion to the elements with bigger keys than x.

      Note: If an element is inserted it might invalidate elements.

    29. -
      iterator insert(value_type && x);
      +
      iterator insert(value_type && x);

      Effects: Inserts a new value move-constructed from x and returns the iterator pointing to the newly inserted element.

      Complexity: Logarithmic search time plus linear insertion to the elements with bigger keys than x.

      Note: If an element is inserted it might invalidate elements.

    30. -
      iterator insert(impl_value_type && x);
      +
      iterator insert(impl_value_type && x);

      Effects: Inserts a new value move-constructed from x and returns the iterator pointing to the newly inserted element.

      Complexity: Logarithmic search time plus linear insertion to the elements with bigger keys than x.

      Note: If an element is inserted it might invalidate elements.

    31. -
      iterator insert(const_iterator p, const value_type & x);
      +
      iterator insert(const_iterator p, const value_type & x);

      Effects: Inserts a copy of x in the container. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic search time (constant time if the value is to be inserted before p) plus linear insertion to the elements with bigger keys than x.

      Note: If an element is inserted it might invalidate elements.

    32. -
      iterator insert(const_iterator p, value_type && x);
      +
      iterator insert(const_iterator p, value_type && x);

      Effects: Inserts a value move constructed from x in the container. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic search time (constant time if the value is to be inserted before p) plus linear insertion to the elements with bigger keys than x.

      Note: If an element is inserted it might invalidate elements.

    33. -
      iterator insert(const_iterator p, impl_value_type && x);
      +
      iterator insert(const_iterator p, impl_value_type && x);

      Effects: Inserts a value move constructed from x in the container. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic search time (constant time if the value is to be inserted before p) plus linear insertion to the elements with bigger keys than x.

      @@ -507,7 +507,7 @@ 
    34. template<typename InputIterator> 
-  void insert(InputIterator first, InputIterator last);
      + void insert(InputIterator first, InputIterator last);

      Requires: first, last are not iterators into *this.

      Effects: inserts each element from the range [first,last) .

      Complexity: At most N log(size()+N) (N is the distance from first to last) search time plus N*size() insertion time.

      @@ -515,7 +515,7 @@ 
    35. template<typename InputIterator> 
-  void insert(ordered_range_t, InputIterator first, InputIterator last);
      + void insert(ordered_range_t, InputIterator first, InputIterator last);

      Requires: first, last are not iterators into *this.

      Requires: [first ,last) must be ordered according to the predicate.

      Effects: inserts each element from the range [first,last) if and only if there is no element with key equivalent to the key of that element. This function is more efficient than the normal range creation for ordered ranges.

      @@ -524,13 +524,13 @@

      Note: Non-standard extension.

    36. -
      void insert(std::initializer_list< value_type > il);
      +
      void insert(std::initializer_list< value_type > il);

      Effects: inserts each element from the range [il.begin(), il.end()) .

      Complexity: At most N log(size()+N) (N is the distance from first to last) search time plus N*size() insertion time.

      Note: If an element is inserted it might invalidate elements.

    37. -
      void insert(ordered_range_t, std::initializer_list< value_type > il);
      +
      void insert(ordered_range_t, std::initializer_list< value_type > il);

      Requires: [il.begin(), il.end()) must be ordered according to the predicate.

      Effects: inserts each element from the range [il.begin(), il.end()) if and only if there is no element with key equivalent to the key of that element. This function is more efficient than the normal range creation for ordered ranges.

      Complexity: At most N log(size()+N) (N is the distance from first to last) search time plus N*size() insertion time.

      @@ -538,131 +538,131 @@

      Note: Non-standard extension.

    38. -
      iterator erase(const_iterator p);
      +
      iterator erase(const_iterator p);

      Effects: Erases the element pointed to by p.

      Returns: Returns an iterator pointing to the element immediately following q prior to the element being erased. If no such element exists, returns end().

      Complexity: Linear to the elements with keys bigger than p

      Note: Invalidates elements with keys not less than the erased element.

    39. -
      size_type erase(const key_type & x);
      +
      size_type erase(const key_type & x);

      Effects: Erases all elements in the container with key equivalent to x.

      Returns: Returns the number of erased elements.

      Complexity: Logarithmic search time plus erasure time linear to the elements with bigger keys.

    40. -
      iterator erase(const_iterator first, const_iterator last);
      +
      iterator erase(const_iterator first, const_iterator last);

      Effects: Erases all the elements in the range [first, last).

      Returns: Returns last.

      Complexity: size()*N where N is the distance from first to last.

      Complexity: Logarithmic search time plus erasure time linear to the elements with bigger keys.

    41. -
      void swap(flat_multimap & x) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_swappable< Compare >::value));
      +
      void swap(flat_multimap & x) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_swappable< Compare >::value));

      Effects: Swaps the contents of *this and x.

      Throws: Nothing.

      Complexity: Constant.

    42. -
      void clear() noexcept;
      +
      void clear() noexcept;

      Effects: erase(a.begin(),a.end()).

      Postcondition: size() == 0.

      Complexity: linear in size().

    43. -
      key_compare key_comp() const;
      +
      key_compare key_comp() const;

      Effects: Returns the comparison object out of which a was constructed.

      Complexity: Constant.

    44. -
      value_compare value_comp() const;
      +
      value_compare value_comp() const;

      Effects: Returns an object of value_compare constructed out of the comparison object.

      Complexity: Constant.

    45. -
      iterator find(const key_type & x);
      +
      iterator find(const key_type & x);

      Returns: An iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.

      Complexity: Logarithmic.

    46. -
      const_iterator find(const key_type & x) const;
      +
      const_iterator find(const key_type & x) const;

      Returns: An const_iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.

      Complexity: Logarithmic.

    47. -
      size_type count(const key_type & x) const;
      +
      size_type count(const key_type & x) const;

      Returns: The number of elements with key equivalent to x.

      Complexity: log(size())+count(k)

    48. -
      iterator lower_bound(const key_type & x);
      +
      iterator lower_bound(const key_type & x);

      Returns: An iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.

      Complexity: Logarithmic

    49. -
      const_iterator lower_bound(const key_type & x) const;
      +
      const_iterator lower_bound(const key_type & x) const;

      Returns: A const iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.

      Complexity: Logarithmic

    50. -
      iterator upper_bound(const key_type & x);
      +
      iterator upper_bound(const key_type & x);

      Returns: An iterator pointing to the first element with key not less than x, or end() if such an element is not found.

      Complexity: Logarithmic

    51. -
      const_iterator upper_bound(const key_type & x) const;
      +
      const_iterator upper_bound(const key_type & x) const;

      Returns: A const iterator pointing to the first element with key not less than x, or end() if such an element is not found.

      Complexity: Logarithmic

    52. -
      std::pair< iterator, iterator > equal_range(const key_type & x);
      +
      std::pair< iterator, iterator > equal_range(const key_type & x);

      Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).

      Complexity: Logarithmic 

    53. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & x) const;
      +equal_range(const key_type & x) const;

      Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).

      Complexity: Logarithmic

    -

    -flat_multimap friend functions

    +

    +flat_multimap friend functions

    1. -
      friend bool operator==(const flat_multimap & x, const flat_multimap & y);
      +
      friend bool operator==(const flat_multimap & x, const flat_multimap & y);

      Effects: Returns true if x and y are equal

      Complexity: Linear to the number of elements in the container.

    2. -
      friend bool operator!=(const flat_multimap & x, const flat_multimap & y);
      +
      friend bool operator!=(const flat_multimap & x, const flat_multimap & y);

      Effects: Returns true if x and y are unequal

      Complexity: Linear to the number of elements in the container.

    3. -
      friend bool operator<(const flat_multimap & x, const flat_multimap & y);
      +
      friend bool operator<(const flat_multimap & x, const flat_multimap & y);

      Effects: Returns true if x is less than y

      Complexity: Linear to the number of elements in the container.

    4. -
      friend bool operator>(const flat_multimap & x, const flat_multimap & y);
      +
      friend bool operator>(const flat_multimap & x, const flat_multimap & y);

      Effects: Returns true if x is greater than y

      Complexity: Linear to the number of elements in the container.

    5. -
      friend bool operator<=(const flat_multimap & x, const flat_multimap & y);
      +
      friend bool operator<=(const flat_multimap & x, const flat_multimap & y);

      Effects: Returns true if x is equal or less than y

      Complexity: Linear to the number of elements in the container.

    6. -
      friend bool operator>=(const flat_multimap & x, const flat_multimap & y);
      +
      friend bool operator>=(const flat_multimap & x, const flat_multimap & y);

      Effects: Returns true if x is equal or greater than y

      Complexity: Linear to the number of elements in the container.

    7. -
      friend void swap(flat_multimap & x, flat_multimap & y);
      +
      friend void swap(flat_multimap & x, flat_multimap & y);

      Effects: x.swap(y)

      Complexity: Constant.

      8. @@ -672,7 +672,7 @@
    -
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -680,7 +680,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/container/flat_multiset.html b/doc/html/boost/container/flat_multiset.html index b898fe2c92..2add359adf 100644 --- a/doc/html/boost/container/flat_multiset.html +++ b/doc/html/boost/container/flat_multiset.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -56,101 +56,101 @@ typedef implementation_defined const_reverse_iterator; // construct/copy/destruct - explicit flat_multiset(); - explicit flat_multiset(const Compare &, + explicit flat_multiset(); + explicit flat_multiset(const Compare &, const allocator_type & = allocator_type()); - explicit flat_multiset(const allocator_type &); + explicit flat_multiset(const allocator_type &); template<typename InputIterator> - flat_multiset(InputIterator, InputIterator, const Compare & = Compare(), + flat_multiset(InputIterator, InputIterator, const Compare & = Compare(), const allocator_type & = allocator_type()); template<typename InputIterator> - flat_multiset(InputIterator, InputIterator, const allocator_type &); + flat_multiset(InputIterator, InputIterator, const allocator_type &); template<typename InputIterator> - flat_multiset(ordered_range_t, InputIterator, InputIterator, + flat_multiset(ordered_range_t, InputIterator, InputIterator, const Compare & = Compare(), const allocator_type & = allocator_type()); - flat_multiset(std::initializer_list< value_type >, + flat_multiset(std::initializer_list< value_type >, const Compare & = Compare(), const allocator_type & = allocator_type()); - flat_multiset(std::initializer_list< value_type >, const allocator_type &); - flat_multiset(ordered_unique_range_t, std::initializer_list< value_type >, + flat_multiset(std::initializer_list< value_type >, const allocator_type &); + flat_multiset(ordered_unique_range_t, std::initializer_list< value_type >, const Compare & = Compare(), const allocator_type & = allocator_type()); - flat_multiset(const flat_multiset &); - flat_multiset(flat_multiset &&); - flat_multiset(const flat_multiset &, const allocator_type &); - flat_multiset(flat_multiset &&, const allocator_type &); - flat_multiset & operator=(const flat_multiset &); + flat_multiset(const flat_multiset &); + flat_multiset(flat_multiset &&); + flat_multiset(const flat_multiset &, const allocator_type &); + flat_multiset(flat_multiset &&, const allocator_type &); + flat_multiset & operator=(const flat_multiset &); flat_multiset & - operator=(flat_multiset &&) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_move_assignable< Compare >::value)); - flat_multiset & operator=(std::initializer_list< value_type >); + operator=(flat_multiset &&) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_move_assignable< Compare >::value)); + flat_multiset & operator=(std::initializer_list< value_type >); - // public member functions - allocator_type get_allocator() const noexcept; - stored_allocator_type & get_stored_allocator() noexcept; - const stored_allocator_type & get_stored_allocator() const noexcept; - iterator begin() noexcept; - const_iterator begin() const; - const_iterator cbegin() const noexcept; - iterator end() noexcept; - const_iterator end() const noexcept; - const_iterator cend() const noexcept; - reverse_iterator rbegin() noexcept; - const_reverse_iterator rbegin() const noexcept; - const_reverse_iterator crbegin() const noexcept; - reverse_iterator rend() noexcept; - const_reverse_iterator rend() const noexcept; - const_reverse_iterator crend() const noexcept; - bool empty() const noexcept; - size_type size() const noexcept; - size_type max_size() const noexcept; - size_type capacity() const noexcept; - void reserve(size_type); - void shrink_to_fit(); - template<class... Args> iterator emplace(Args &&...); - template<class... Args> iterator emplace_hint(const_iterator, Args &&...); - iterator insert(const value_type &); - iterator insert(value_type &&); - iterator insert(const_iterator, const value_type &); - iterator insert(const_iterator, value_type &&); - template<typename InputIterator> void insert(InputIterator, InputIterator); + // public member functions + allocator_type get_allocator() const noexcept; + stored_allocator_type & get_stored_allocator() noexcept; + const stored_allocator_type & get_stored_allocator() const noexcept; + iterator begin() noexcept; + const_iterator begin() const; + const_iterator cbegin() const noexcept; + iterator end() noexcept; + const_iterator end() const noexcept; + const_iterator cend() const noexcept; + reverse_iterator rbegin() noexcept; + const_reverse_iterator rbegin() const noexcept; + const_reverse_iterator crbegin() const noexcept; + reverse_iterator rend() noexcept; + const_reverse_iterator rend() const noexcept; + const_reverse_iterator crend() const noexcept; + bool empty() const noexcept; + size_type size() const noexcept; + size_type max_size() const noexcept; + size_type capacity() const noexcept; + void reserve(size_type); + void shrink_to_fit(); + template<class... Args> iterator emplace(Args &&...); + template<class... Args> iterator emplace_hint(const_iterator, Args &&...); + iterator insert(const value_type &); + iterator insert(value_type &&); + iterator insert(const_iterator, const value_type &); + iterator insert(const_iterator, value_type &&); + template<typename InputIterator> void insert(InputIterator, InputIterator); template<typename InputIterator> - void insert(ordered_range_t, InputIterator, InputIterator); - void insert(std::initializer_list< value_type >); - void insert(ordered_range_t, std::initializer_list< value_type >); - iterator erase(const_iterator); - size_type erase(const key_type &); - iterator erase(const_iterator, const_iterator); - void swap(flat_multiset &) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_swappable< Compare >::value)); - void clear() noexcept; - key_compare key_comp() const; - value_compare value_comp() const; - iterator find(const key_type &); - const_iterator find(const key_type &) const; - iterator nth(size_type) noexcept; - const_iterator nth(size_type) const noexcept; - size_type index_of(iterator) noexcept; - size_type index_of(const_iterator) const noexcept; - size_type count(const key_type &) const; - iterator lower_bound(const key_type &); - const_iterator lower_bound(const key_type &) const; - iterator upper_bound(const key_type &); - const_iterator upper_bound(const key_type &) const; + void insert(ordered_range_t, InputIterator, InputIterator); + void insert(std::initializer_list< value_type >); + void insert(ordered_range_t, std::initializer_list< value_type >); + iterator erase(const_iterator); + size_type erase(const key_type &); + iterator erase(const_iterator, const_iterator); + void swap(flat_multiset &) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_swappable< Compare >::value)); + void clear() noexcept; + key_compare key_comp() const; + value_compare value_comp() const; + iterator find(const key_type &); + const_iterator find(const key_type &) const; + iterator nth(size_type) noexcept; + const_iterator nth(size_type) const noexcept; + size_type index_of(iterator) noexcept; + size_type index_of(const_iterator) const noexcept; + size_type count(const key_type &) const; + iterator lower_bound(const key_type &); + const_iterator lower_bound(const key_type &) const; + iterator upper_bound(const key_type &); + const_iterator upper_bound(const key_type &) const; std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; - std::pair< iterator, iterator > equal_range(const key_type &); + equal_range(const key_type &) const; + std::pair< iterator, iterator > equal_range(const key_type &); - // friend functions - friend bool operator==(const flat_multiset &, const flat_multiset &); - friend bool operator!=(const flat_multiset &, const flat_multiset &); - friend bool operator<(const flat_multiset &, const flat_multiset &); - friend bool operator>(const flat_multiset &, const flat_multiset &); - friend bool operator<=(const flat_multiset &, const flat_multiset &); - friend bool operator>=(const flat_multiset &, const flat_multiset &); - friend void swap(flat_multiset &, flat_multiset &); + // friend functions + friend bool operator==(const flat_multiset &, const flat_multiset &); + friend bool operator!=(const flat_multiset &, const flat_multiset &); + friend bool operator<(const flat_multiset &, const flat_multiset &); + friend bool operator>(const flat_multiset &, const flat_multiset &); + friend bool operator<=(const flat_multiset &, const flat_multiset &); + friend bool operator>=(const flat_multiset &, const flat_multiset &); + friend void swap(flat_multiset &, flat_multiset &); };
    -

    Description

    +

    Description

    flat_multiset is a Sorted Associative Container that stores objects of type Key.

    flat_multiset can store multiple copies of the same key value.

    flat_multiset is similar to std::multiset but it's implemented like an ordered vector. This means that inserting a new element into a flat_multiset invalidates previous iterators and references

    @@ -159,7 +159,7 @@

    -

    Template Parameters

    +

    Template Parameters

    1. typename Key
      @@ -176,30 +176,30 @@
    -

    +

    flat_multiset public construct/copy/destruct

    1. -
      explicit flat_multiset();
      +
      explicit flat_multiset();

      Effects: Default constructs an empty container.

      Complexity: Constant.

    2. -
      explicit flat_multiset(const Compare & comp, 
+
      explicit flat_multiset(const Compare & comp, 
                        const allocator_type & a = allocator_type());
      
 
      Effects: Constructs an empty container using the specified comparison object and allocator.
      
 
      Complexity: Constant.
    3. -
      explicit flat_multiset(const allocator_type & a);
      +
      explicit flat_multiset(const allocator_type & a);

      Effects: Constructs an empty container using the specified allocator.

      Complexity: Constant. 

    4. template<typename InputIterator> 
-  flat_multiset(InputIterator first, InputIterator last, 
+  flat_multiset(InputIterator first, InputIterator last, 
                 const Compare & comp = Compare(), 
                 const allocator_type & a = allocator_type());

      Effects: Constructs an empty container using the specified comparison object and allocator, and inserts elements from the range [first ,last ).

      @@ -207,14 +207,14 @@ 
    5. template<typename InputIterator> 
-  flat_multiset(InputIterator first, InputIterator last, 
+  flat_multiset(InputIterator first, InputIterator last, 
                 const allocator_type & a);

      Effects: Constructs an empty container using the specified allocator, and inserts elements from the range [first ,last ).

      Complexity: Linear in N if the range [first ,last ) is already sorted using comp and otherwise N logN, where N is last - first. 

    6. template<typename InputIterator> 
-  flat_multiset(ordered_range_t, InputIterator first, InputIterator last, 
+  flat_multiset(ordered_range_t, InputIterator first, InputIterator last, 
                 const Compare & comp = Compare(), 
                 const allocator_type & a = allocator_type());

      Effects: Constructs an empty flat_multiset using the specified comparison object and allocator, and inserts elements from the ordered range [first ,last ). This function is more efficient than the normal range creation for ordered ranges.

      @@ -223,20 +223,20 @@

      Note: Non-standard extension.

    7. -
      flat_multiset(std::initializer_list< value_type > il, 
+
      flat_multiset(std::initializer_list< value_type > il, 
               const Compare & comp = Compare(), 
               const allocator_type & a = allocator_type());
      
 
      Effects: Constructs an empty container using the specified comparison object and allocator, and inserts elements from the range [il.begin(), il.end()).
      
 
      Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using comp and otherwise N logN, where N is il.begin() - il.end().
    8. -
      flat_multiset(std::initializer_list< value_type > il, 
+
      flat_multiset(std::initializer_list< value_type > il, 
               const allocator_type & a);
      
 
      Effects: Constructs an empty container using the specified allocator, and inserts elements from the range [il.begin(), il.end()).
      
 
      Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using comp and otherwise N logN, where N is il.begin() - il.end().
    9. -
      flat_multiset(ordered_unique_range_t, std::initializer_list< value_type > il, 
+
      flat_multiset(ordered_unique_range_t, std::initializer_list< value_type > il, 
               const Compare & comp = Compare(), 
               const allocator_type & a = allocator_type());
      
 
      Effects: Constructs an empty container using the specified comparison object and allocator, and inserts elements from the ordered unique range [il.begin(), il.end()). This function is more efficient than the normal range creation for ordered ranges.
      
@@ -245,196 +245,209 @@
 
      Note: Non-standard extension.
    10. -
      flat_multiset(const flat_multiset & x);
      +
      flat_multiset(const flat_multiset & x);

      Effects: Copy constructs the container.

      Complexity: Linear in x.size().

      11. -
    11. flat_multiset(flat_multiset && x);
      12. -
    12. flat_multiset(const flat_multiset & x, const allocator_type & a);
      13. -
    13. flat_multiset(flat_multiset && x, const allocator_type & a);
    14. -
      flat_multiset & operator=(const flat_multiset & x);
      +
      flat_multiset(flat_multiset && x);
      +

      Effects: Move constructs thecontainer. Constructs *this using x's resources.

      +

      Complexity: Constant.

      +

      Postcondition: x is emptied.

      +
      15. +
    15. +
      flat_multiset(const flat_multiset & x, const allocator_type & a);
      +

      Effects: Copy constructs a container using the specified allocator.

      +

      Complexity: Linear in x.size().

      +
      16. +
    16. +
      flat_multiset(flat_multiset && x, const allocator_type & a);
      +

      Effects: Move constructs a container using the specified allocator. Constructs *this using x's resources.

      +

      Complexity: Constant if a == x.get_allocator(), linear otherwise

      +
      17. +
    17. +
      flat_multiset & operator=(const flat_multiset & x);

      Effects: Makes *this a copy of x.

      Complexity: Linear in x.size(). 

    18. flat_multiset & 
-operator=(flat_multiset && x) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_move_assignable< Compare >::value));
      +operator=(flat_multiset && x) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_move_assignable< Compare >::value));

      Throws: If allocator_traits_type::propagate_on_container_move_assignment is false and (allocation throws or value_type's move constructor throws)

      Complexity: Constant if allocator_traits_type:: propagate_on_container_move_assignment is true or this->get>allocator() == x.get_allocator(). Linear otherwise.

    19. -
      flat_multiset & operator=(std::initializer_list< value_type > il);
      +
      flat_multiset & operator=(std::initializer_list< value_type > il);

      Effects: Copy all elements from il to *this.

      Complexity: Linear in il.size().

    -

    -flat_multiset public member functions

    +

    +flat_multiset public member functions

    1. -
      allocator_type get_allocator() const noexcept;
      +
      allocator_type get_allocator() const noexcept;

      Effects: Returns a copy of the allocator that was passed to the object's constructor.

      Complexity: Constant.

    2. -
      stored_allocator_type & get_stored_allocator() noexcept;
      +
      stored_allocator_type & get_stored_allocator() noexcept;

      Effects: Returns a reference to the internal allocator.

      Throws: Nothing

      Complexity: Constant.

      Note: Non-standard extension.

    3. -
      const stored_allocator_type & get_stored_allocator() const noexcept;
      +
      const stored_allocator_type & get_stored_allocator() const noexcept;

      Effects: Returns a reference to the internal allocator.

      Throws: Nothing

      Complexity: Constant.

      Note: Non-standard extension.

    4. -
      iterator begin() noexcept;
      +
      iterator begin() noexcept;

      Effects: Returns an iterator to the first element contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    5. -
      const_iterator begin() const;
      +
      const_iterator begin() const;

      Effects: Returns a const_iterator to the first element contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    6. -
      const_iterator cbegin() const noexcept;
      +
      const_iterator cbegin() const noexcept;

      Effects: Returns a const_iterator to the first element contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    7. -
      iterator end() noexcept;
      +
      iterator end() noexcept;

      Effects: Returns an iterator to the end of the container.

      Throws: Nothing.

      Complexity: Constant.

    8. -
      const_iterator end() const noexcept;
      +
      const_iterator end() const noexcept;

      Effects: Returns a const_iterator to the end of the container.

      Throws: Nothing.

      Complexity: Constant.

    9. -
      const_iterator cend() const noexcept;
      +
      const_iterator cend() const noexcept;

      Effects: Returns a const_iterator to the end of the container.

      Throws: Nothing.

      Complexity: Constant.

    10. -
      reverse_iterator rbegin() noexcept;
      +
      reverse_iterator rbegin() noexcept;

      Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    11. -
      const_reverse_iterator rbegin() const noexcept;
      +
      const_reverse_iterator rbegin() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    12. -
      const_reverse_iterator crbegin() const noexcept;
      +
      const_reverse_iterator crbegin() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    13. -
      reverse_iterator rend() noexcept;
      +
      reverse_iterator rend() noexcept;

      Effects: Returns a reverse_iterator pointing to the end of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    14. -
      const_reverse_iterator rend() const noexcept;
      +
      const_reverse_iterator rend() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    15. -
      const_reverse_iterator crend() const noexcept;
      +
      const_reverse_iterator crend() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    16. -
      bool empty() const noexcept;
      +
      bool empty() const noexcept;

      Effects: Returns true if the container contains no elements.

      Throws: Nothing.

      Complexity: Constant.

    17. -
      size_type size() const noexcept;
      +
      size_type size() const noexcept;

      Effects: Returns the number of the elements contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    18. -
      size_type max_size() const noexcept;
      +
      size_type max_size() const noexcept;

      Effects: Returns the largest possible size of the container.

      Throws: Nothing.

      Complexity: Constant.

    19. -
      size_type capacity() const noexcept;
      +
      size_type capacity() const noexcept;

      Effects: Number of elements for which memory has been allocated. capacity() is always greater than or equal to size().

      Throws: Nothing.

      Complexity: Constant.

    20. -
      void reserve(size_type cnt);
      +
      void reserve(size_type cnt);

      Effects: If n is less than or equal to capacity(), this call has no effect. Otherwise, it is a request for allocation of additional memory. If the request is successful, then capacity() is greater than or equal to n; otherwise, capacity() is unchanged. In either case, size() is unchanged.

      Throws: If memory allocation allocation throws or Key's copy constructor throws.

      Note: If capacity() is less than "cnt", iterators and references to to values might be invalidated.

    21. -
      void shrink_to_fit();
      +
      void shrink_to_fit();
      Effects: Tries to deallocate the excess of memory created

      Throws: If memory allocation throws, or Key's copy constructor throws.

      Complexity: Linear to size().

    22. -
      template<class... Args> iterator emplace(Args &&... args);
      +
      template<class... Args> iterator emplace(Args &&... args);

      Effects: Inserts an object of type Key constructed with std::forward<Args>(args)... and returns the iterator pointing to the newly inserted element.

      Complexity: Logarithmic search time plus linear insertion to the elements with bigger keys than x.

      Note: If an element is inserted it might invalidate elements. 

    23. template<class... Args> 
-  iterator emplace_hint(const_iterator p, Args &&... args);
      + iterator emplace_hint(const_iterator p, Args &&... args);

      Effects: Inserts an object of type Key constructed with std::forward<Args>(args)... in the container. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic search time (constant if x is inserted right before p) plus insertion linear to the elements with bigger keys than x.

      Note: If an element is inserted it might invalidate elements.

    24. -
      iterator insert(const value_type & x);
      +
      iterator insert(const value_type & x);

      Effects: Inserts x and returns the iterator pointing to the newly inserted element.

      Complexity: Logarithmic search time plus linear insertion to the elements with bigger keys than x.

      Note: If an element is inserted it might invalidate elements.

    25. -
      iterator insert(value_type && x);
      +
      iterator insert(value_type && x);

      Effects: Inserts a new value_type move constructed from x and returns the iterator pointing to the newly inserted element.

      Complexity: Logarithmic search time plus linear insertion to the elements with bigger keys than x.

      Note: If an element is inserted it might invalidate elements.

    26. -
      iterator insert(const_iterator p, const value_type & x);
      +
      iterator insert(const_iterator p, const value_type & x);

      Effects: Inserts a copy of x in the container. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic search time (constant if x is inserted right before p) plus insertion linear to the elements with bigger keys than x.

      Note: If an element is inserted it might invalidate elements.

    27. -
      iterator insert(const_iterator p, value_type && x);
      +
      iterator insert(const_iterator p, value_type && x);

      Effects: Inserts a new value move constructed from x in the container. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic search time (constant if x is inserted right before p) plus insertion linear to the elements with bigger keys than x.

      @@ -442,7 +455,7 @@ 
    28. template<typename InputIterator> 
-  void insert(InputIterator first, InputIterator last);
      + void insert(InputIterator first, InputIterator last);

      Requires: first, last are not iterators into *this.

      Effects: inserts each element from the range [first,last) .

      Complexity: At most N log(size()+N) (N is the distance from first to last) search time plus N*size() insertion time.

      @@ -450,79 +463,79 @@ 
    29. template<typename InputIterator> 
-  void insert(ordered_range_t, InputIterator first, InputIterator last);
      + void insert(ordered_range_t, InputIterator first, InputIterator last);

      Requires: first, last are not iterators into *this and must be ordered according to the predicate.

      Effects: inserts each element from the range [first,last) .This function is more efficient than the normal range creation for ordered ranges.

      Complexity: At most N log(size()+N) (N is the distance from first to last) search time plus N*size() insertion time.

      Note: Non-standard extension. If an element is inserted it might invalidate elements.

    30. -
      void insert(std::initializer_list< value_type > il);
      +
      void insert(std::initializer_list< value_type > il);

      Effects: inserts each element from the range [il.begin(), il.end()).

      Complexity: At most N log(size()+N) (N is the distance from first to last) search time plus N*size() insertion time.

      Note: If an element is inserted it might invalidate elements.

    31. -
      void insert(ordered_range_t, std::initializer_list< value_type > il);
      +
      void insert(ordered_range_t, std::initializer_list< value_type > il);

      Requires: Range [il.begin(), il.end()) must be ordered according to the predicate.

      Effects: inserts each element from the range [il.begin(), il.end()). This function is more efficient than the normal range creation for ordered ranges.

      Complexity: At most N log(size()+N) (N is the distance from il.begin() to il.end()) search time plus N*size() insertion time.

      Note: Non-standard extension. If an element is inserted it might invalidate elements.

    32. -
      iterator erase(const_iterator p);
      +
      iterator erase(const_iterator p);

      Effects: Erases the element pointed to by p.

      Returns: Returns an iterator pointing to the element immediately following q prior to the element being erased. If no such element exists, returns end().

      Complexity: Linear to the elements with keys bigger than p

      Note: Invalidates elements with keys not less than the erased element.

    33. -
      size_type erase(const key_type & x);
      +
      size_type erase(const key_type & x);

      Effects: Erases all elements in the container with key equivalent to x.

      Returns: Returns the number of erased elements.

      Complexity: Logarithmic search time plus erasure time linear to the elements with bigger keys.

    34. -
      iterator erase(const_iterator first, const_iterator last);
      +
      iterator erase(const_iterator first, const_iterator last);

      Effects: Erases all the elements in the range [first, last).

      Returns: Returns last.

      Complexity: size()*N where N is the distance from first to last.

      Complexity: Logarithmic search time plus erasure time linear to the elements with bigger keys.

    35. -
      void swap(flat_multiset & x) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_swappable< Compare >::value));
      +
      void swap(flat_multiset & x) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_swappable< Compare >::value));

      Effects: Swaps the contents of *this and x.

      Throws: Nothing.

      Complexity: Constant.

    36. -
      void clear() noexcept;
      +
      void clear() noexcept;

      Effects: erase(a.begin(),a.end()).

      Postcondition: size() == 0.

      Complexity: linear in size().

    37. -
      key_compare key_comp() const;
      +
      key_compare key_comp() const;

      Effects: Returns the comparison object out of which a was constructed.

      Complexity: Constant.

    38. -
      value_compare value_comp() const;
      +
      value_compare value_comp() const;

      Effects: Returns an object of value_compare constructed out of the comparison object.

      Complexity: Constant.

    39. -
      iterator find(const key_type & x);
      +
      iterator find(const key_type & x);

      Returns: An iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.

      Complexity: Logarithmic.

    40. -
      const_iterator find(const key_type & x) const;
      +
      const_iterator find(const key_type & x) const;

      Returns: A const_iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.

      Complexity: Logarithmic.

    41. -
      iterator nth(size_type n) noexcept;
      +
      iterator nth(size_type n) noexcept;

      Requires: size() >= n.

      Effects: Returns an iterator to the nth element from the beginning of the container. Returns end() if n == size().

      Throws: Nothing.

      @@ -530,7 +543,7 @@

      Note: Non-standard extension

    42. -
      const_iterator nth(size_type n) const noexcept;
      +
      const_iterator nth(size_type n) const noexcept;

      Requires: size() >= n.

      Effects: Returns a const_iterator to the nth element from the beginning of the container. Returns end() if n == size().

      Throws: Nothing.

      @@ -538,7 +551,7 @@

      Note: Non-standard extension

    43. -
      size_type index_of(iterator p) noexcept;
      +
      size_type index_of(iterator p) noexcept;

      Requires: size() >= n.

      Effects: Returns an iterator to the nth element from the beginning of the container. Returns end() if n == size().

      Throws: Nothing.

      @@ -546,7 +559,7 @@

      Note: Non-standard extension

    44. -
      size_type index_of(const_iterator p) const noexcept;
      +
      size_type index_of(const_iterator p) const noexcept;

      Requires: begin() <= p <= end().

      Effects: Returns the index of the element pointed by p and size() if p == end().

      Throws: Nothing.

      @@ -554,79 +567,79 @@

      Note: Non-standard extension

    45. -
      size_type count(const key_type & x) const;
      +
      size_type count(const key_type & x) const;

      Returns: The number of elements with key equivalent to x.

      Complexity: log(size())+count(k)

    46. -
      iterator lower_bound(const key_type & x);
      +
      iterator lower_bound(const key_type & x);

      Returns: An iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.

      Complexity: Logarithmic

    47. -
      const_iterator lower_bound(const key_type & x) const;
      +
      const_iterator lower_bound(const key_type & x) const;

      Returns: A const iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.

      Complexity: Logarithmic

    48. -
      iterator upper_bound(const key_type & x);
      +
      iterator upper_bound(const key_type & x);

      Returns: An iterator pointing to the first element with key not less than x, or end() if such an element is not found.

      Complexity: Logarithmic

    49. -
      const_iterator upper_bound(const key_type & x) const;
      +
      const_iterator upper_bound(const key_type & x) const;

      Returns: A const iterator pointing to the first element with key not less than x, or end() if such an element is not found.

      Complexity: Logarithmic 

    50. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & x) const;
      +equal_range(const key_type & x) const;

      Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).

      Complexity: Logarithmic

    51. -
      std::pair< iterator, iterator > equal_range(const key_type & x);
      +
      std::pair< iterator, iterator > equal_range(const key_type & x);

      Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).

      Complexity: Logarithmic

    -

    -flat_multiset friend functions

    +

    +flat_multiset friend functions

    1. -
      friend bool operator==(const flat_multiset & x, const flat_multiset & y);
      +
      friend bool operator==(const flat_multiset & x, const flat_multiset & y);

      Effects: Returns true if x and y are equal

      Complexity: Linear to the number of elements in the container.

    2. -
      friend bool operator!=(const flat_multiset & x, const flat_multiset & y);
      +
      friend bool operator!=(const flat_multiset & x, const flat_multiset & y);

      Effects: Returns true if x and y are unequal

      Complexity: Linear to the number of elements in the container.

    3. -
      friend bool operator<(const flat_multiset & x, const flat_multiset & y);
      +
      friend bool operator<(const flat_multiset & x, const flat_multiset & y);

      Effects: Returns true if x is less than y

      Complexity: Linear to the number of elements in the container.

    4. -
      friend bool operator>(const flat_multiset & x, const flat_multiset & y);
      +
      friend bool operator>(const flat_multiset & x, const flat_multiset & y);

      Effects: Returns true if x is greater than y

      Complexity: Linear to the number of elements in the container.

    5. -
      friend bool operator<=(const flat_multiset & x, const flat_multiset & y);
      +
      friend bool operator<=(const flat_multiset & x, const flat_multiset & y);

      Effects: Returns true if x is equal or less than y

      Complexity: Linear to the number of elements in the container.

    6. -
      friend bool operator>=(const flat_multiset & x, const flat_multiset & y);
      +
      friend bool operator>=(const flat_multiset & x, const flat_multiset & y);

      Effects: Returns true if x is equal or greater than y

      Complexity: Linear to the number of elements in the container.

    7. -
      friend void swap(flat_multiset & x, flat_multiset & y);
      +
      friend void swap(flat_multiset & x, flat_multiset & y);

      Effects: x.swap(y)

      Complexity: Constant.

      8. @@ -636,7 +649,7 @@
    -
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -644,7 +657,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/container/flat_set.html b/doc/html/boost/container/flat_set.html index 9afaead7fd..e2c37e4fe6 100644 --- a/doc/html/boost/container/flat_set.html +++ b/doc/html/boost/container/flat_set.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -56,99 +56,99 @@ typedef implementation_defined const_reverse_iterator; // construct/copy/destruct - explicit flat_set(); - explicit flat_set(const Compare &, + explicit flat_set(); + explicit flat_set(const Compare &, const allocator_type & = allocator_type()); - explicit flat_set(const allocator_type &); + explicit flat_set(const allocator_type &); template<typename InputIterator> - flat_set(InputIterator, InputIterator, const Compare & = Compare(), + flat_set(InputIterator, InputIterator, const Compare & = Compare(), const allocator_type & = allocator_type()); template<typename InputIterator> - flat_set(InputIterator, InputIterator, const allocator_type &); + flat_set(InputIterator, InputIterator, const allocator_type &); template<typename InputIterator> - flat_set(ordered_unique_range_t, InputIterator, InputIterator, + flat_set(ordered_unique_range_t, InputIterator, InputIterator, const Compare & = Compare(), const allocator_type & = allocator_type()); - flat_set(std::initializer_list< value_type >, const Compare & = Compare(), + flat_set(std::initializer_list< value_type >, const Compare & = Compare(), const allocator_type & = allocator_type()); - flat_set(std::initializer_list< value_type >, const allocator_type &); - flat_set(ordered_unique_range_t, std::initializer_list< value_type >, + flat_set(std::initializer_list< value_type >, const allocator_type &); + flat_set(ordered_unique_range_t, std::initializer_list< value_type >, const Compare & = Compare(), const allocator_type & = allocator_type()); - flat_set(const flat_set &); - flat_set(flat_set &&); - flat_set(const flat_set &, const allocator_type &); - flat_set(flat_set &&, const allocator_type &); - flat_set & operator=(const flat_set &); - flat_set & operator=(flat_set &&) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_move_assignable< Compare >::value)); - flat_set & operator=(std::initializer_list< value_type >); + flat_set(const flat_set &); + flat_set(flat_set &&); + flat_set(const flat_set &, const allocator_type &); + flat_set(flat_set &&, const allocator_type &); + flat_set & operator=(const flat_set &); + flat_set & operator=(flat_set &&) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_move_assignable< Compare >::value)); + flat_set & operator=(std::initializer_list< value_type >); - // public member functions - allocator_type get_allocator() const noexcept; - stored_allocator_type & get_stored_allocator() noexcept; - const stored_allocator_type & get_stored_allocator() const noexcept; - iterator begin() noexcept; - const_iterator begin() const noexcept; - iterator end() noexcept; - const_iterator end() const noexcept; - reverse_iterator rbegin() noexcept; - const_reverse_iterator rbegin() const noexcept; - reverse_iterator rend() noexcept; - const_reverse_iterator rend() const noexcept; - const_iterator cbegin() const noexcept; - const_iterator cend() const noexcept; - const_reverse_iterator crbegin() const noexcept; - const_reverse_iterator crend() const noexcept; - bool empty() const noexcept; - size_type size() const noexcept; - size_type max_size() const noexcept; - size_type capacity() const noexcept; - void reserve(size_type); - void shrink_to_fit(); - template<class... Args> std::pair< iterator, bool > emplace(Args &&...); - template<class... Args> iterator emplace_hint(const_iterator, Args &&...); - std::pair< iterator, bool > insert(const value_type &); - std::pair< iterator, bool > insert(value_type &&); - iterator insert(const_iterator, const value_type &); - iterator insert(const_iterator, value_type &&); - template<typename InputIterator> void insert(InputIterator, InputIterator); + // public member functions + allocator_type get_allocator() const noexcept; + stored_allocator_type & get_stored_allocator() noexcept; + const stored_allocator_type & get_stored_allocator() const noexcept; + iterator begin() noexcept; + const_iterator begin() const noexcept; + iterator end() noexcept; + const_iterator end() const noexcept; + reverse_iterator rbegin() noexcept; + const_reverse_iterator rbegin() const noexcept; + reverse_iterator rend() noexcept; + const_reverse_iterator rend() const noexcept; + const_iterator cbegin() const noexcept; + const_iterator cend() const noexcept; + const_reverse_iterator crbegin() const noexcept; + const_reverse_iterator crend() const noexcept; + bool empty() const noexcept; + size_type size() const noexcept; + size_type max_size() const noexcept; + size_type capacity() const noexcept; + void reserve(size_type); + void shrink_to_fit(); + template<class... Args> std::pair< iterator, bool > emplace(Args &&...); + template<class... Args> iterator emplace_hint(const_iterator, Args &&...); + std::pair< iterator, bool > insert(const value_type &); + std::pair< iterator, bool > insert(value_type &&); + iterator insert(const_iterator, const value_type &); + iterator insert(const_iterator, value_type &&); + template<typename InputIterator> void insert(InputIterator, InputIterator); template<typename InputIterator> - void insert(ordered_unique_range_t, InputIterator, InputIterator); - void insert(std::initializer_list< value_type >); - void insert(ordered_unique_range_t, std::initializer_list< value_type >); - iterator erase(const_iterator); - size_type erase(const key_type &); - iterator erase(const_iterator, const_iterator); - void swap(flat_set &) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_swappable< Compare >::value)); - void clear() noexcept; - key_compare key_comp() const; - value_compare value_comp() const; - iterator find(const key_type &); - const_iterator find(const key_type &) const; - iterator nth(size_type) noexcept; - const_iterator nth(size_type) const noexcept; - size_type index_of(iterator) noexcept; - size_type index_of(const_iterator) const noexcept; - size_type count(const key_type &) const; - iterator lower_bound(const key_type &); - const_iterator lower_bound(const key_type &) const; - iterator upper_bound(const key_type &); - const_iterator upper_bound(const key_type &) const; + void insert(ordered_unique_range_t, InputIterator, InputIterator); + void insert(std::initializer_list< value_type >); + void insert(ordered_unique_range_t, std::initializer_list< value_type >); + iterator erase(const_iterator); + size_type erase(const key_type &); + iterator erase(const_iterator, const_iterator); + void swap(flat_set &) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_swappable< Compare >::value)); + void clear() noexcept; + key_compare key_comp() const; + value_compare value_comp() const; + iterator find(const key_type &); + const_iterator find(const key_type &) const; + iterator nth(size_type) noexcept; + const_iterator nth(size_type) const noexcept; + size_type index_of(iterator) noexcept; + size_type index_of(const_iterator) const noexcept; + size_type count(const key_type &) const; + iterator lower_bound(const key_type &); + const_iterator lower_bound(const key_type &) const; + iterator upper_bound(const key_type &); + const_iterator upper_bound(const key_type &) const; std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; - std::pair< iterator, iterator > equal_range(const key_type &); + equal_range(const key_type &) const; + std::pair< iterator, iterator > equal_range(const key_type &); - // friend functions - friend bool operator==(const flat_set &, const flat_set &); - friend bool operator!=(const flat_set &, const flat_set &); - friend bool operator<(const flat_set &, const flat_set &); - friend bool operator>(const flat_set &, const flat_set &); - friend bool operator<=(const flat_set &, const flat_set &); - friend bool operator>=(const flat_set &, const flat_set &); - friend void swap(flat_set &, flat_set &); + // friend functions + friend bool operator==(const flat_set &, const flat_set &); + friend bool operator!=(const flat_set &, const flat_set &); + friend bool operator<(const flat_set &, const flat_set &); + friend bool operator>(const flat_set &, const flat_set &); + friend bool operator<=(const flat_set &, const flat_set &); + friend bool operator>=(const flat_set &, const flat_set &); + friend void swap(flat_set &, flat_set &); };
    -

    Description

    +

    Description

    flat_set is a Sorted Associative Container that stores objects of type Key. It is also a Unique Associative Container, meaning that no two elements are the same.

    flat_set is similar to std::set but it's implemented like an ordered vector. This means that inserting a new element into a flat_set invalidates previous iterators and references

    Erasing an element of a flat_set invalidates iterators and references pointing to elements that come after (their keys are bigger) the erased element.

    @@ -156,7 +156,7 @@

    -

    Template Parameters

    +

    Template Parameters

    1. typename Key
      @@ -173,30 +173,30 @@
    -

    +

    flat_set public construct/copy/destruct

    1. -
      explicit flat_set();
      +
      explicit flat_set();

      Effects: Default constructs an empty container.

      Complexity: Constant.

    2. -
      explicit flat_set(const Compare & comp, 
+
      explicit flat_set(const Compare & comp, 
                   const allocator_type & a = allocator_type());
      
 
      Effects: Constructs an empty container using the specified comparison object and allocator.
      
 
      Complexity: Constant.
    3. -
      explicit flat_set(const allocator_type & a);
      +
      explicit flat_set(const allocator_type & a);

      Effects: Constructs an empty container using the specified allocator.

      Complexity: Constant. 

    4. template<typename InputIterator> 
-  flat_set(InputIterator first, InputIterator last, 
+  flat_set(InputIterator first, InputIterator last, 
            const Compare & comp = Compare(), 
            const allocator_type & a = allocator_type());

      Effects: Constructs an empty container using the specified comparison object and allocator, and inserts elements from the range [first ,last ).

      @@ -204,13 +204,13 @@ 
    5. template<typename InputIterator> 
-  flat_set(InputIterator first, InputIterator last, const allocator_type & a);
      + flat_set(InputIterator first, InputIterator last, const allocator_type & a);

      Effects: Constructs an empty container using the specified allocator, and inserts elements from the range [first ,last ).

      Complexity: Linear in N if the range [first ,last ) is already sorted using comp and otherwise N logN, where N is last - first. 

    6. template<typename InputIterator> 
-  flat_set(ordered_unique_range_t, InputIterator first, InputIterator last, 
+  flat_set(ordered_unique_range_t, InputIterator first, InputIterator last, 
            const Compare & comp = Compare(), 
            const allocator_type & a = allocator_type());

      Effects: Constructs an empty container using the specified comparison object and allocator, and inserts elements from the ordered unique range [first ,last). This function is more efficient than the normal range creation for ordered ranges.

      @@ -219,19 +219,19 @@

      Note: Non-standard extension.

    7. -
      flat_set(std::initializer_list< value_type > il, 
+
      flat_set(std::initializer_list< value_type > il, 
          const Compare & comp = Compare(), 
          const allocator_type & a = allocator_type());
      
 
      Effects: Constructs an empty container using the specified comparison object and allocator, and inserts elements from the range [il.begin(), il.end()).
      
 
      Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using comp and otherwise N logN, where N is il.begin() - il.end().
    8. -
      flat_set(std::initializer_list< value_type > il, const allocator_type & a);
      +
      flat_set(std::initializer_list< value_type > il, const allocator_type & a);

      Effects: Constructs an empty container using the specified allocator, and inserts elements from the range [il.begin(), il.end()).

      Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using comp and otherwise N logN, where N is il.begin() - il.end().

    9. -
      flat_set(ordered_unique_range_t, std::initializer_list< value_type > il, 
+
      flat_set(ordered_unique_range_t, std::initializer_list< value_type > il, 
          const Compare & comp = Compare(), 
          const allocator_type & a = allocator_type());
      
 
      Effects: Constructs an empty container using the specified comparison object and allocator, and inserts elements from the ordered unique range [il.begin(), il.end()). This function is more efficient than the normal range creation for ordered ranges.
      
@@ -240,175 +240,175 @@
 
      Note: Non-standard extension.
    10. -
      flat_set(const flat_set & x);
      +
      flat_set(const flat_set & x);

      Effects: Copy constructs the container.

      Complexity: Linear in x.size().

    11. -
      flat_set(flat_set && x);
      +
      flat_set(flat_set && x);

      Effects: Move constructs thecontainer. Constructs *this using x's resources.

      Complexity: Constant.

      Postcondition: x is emptied.

    12. -
      flat_set(const flat_set & x, const allocator_type & a);
      +
      flat_set(const flat_set & x, const allocator_type & a);

      Effects: Copy constructs a container using the specified allocator.

      Complexity: Linear in x.size().

    13. -
      flat_set(flat_set && x, const allocator_type & a);
      +
      flat_set(flat_set && x, const allocator_type & a);

      Effects: Move constructs a container using the specified allocator. Constructs *this using x's resources.

      Complexity: Constant if a == x.get_allocator(), linear otherwise

    14. -
      flat_set & operator=(const flat_set & x);
      +
      flat_set & operator=(const flat_set & x);

      Effects: Makes *this a copy of x.

      Complexity: Linear in x.size().

    15. -
      flat_set & operator=(flat_set && x) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_move_assignable< Compare >::value));
      +
      flat_set & operator=(flat_set && x) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_move_assignable< Compare >::value));

      Throws: If allocator_traits_type::propagate_on_container_move_assignment is false and (allocation throws or value_type's move constructor throws)

      Complexity: Constant if allocator_traits_type:: propagate_on_container_move_assignment is true or this->get>allocator() == x.get_allocator(). Linear otherwise.

    16. -
      flat_set & operator=(std::initializer_list< value_type > il);
      +
      flat_set & operator=(std::initializer_list< value_type > il);

      Effects: Copy all elements from il to *this.

      Complexity: Linear in il.size().

    -

    -flat_set public member functions

    +

    +flat_set public member functions

    1. -
      allocator_type get_allocator() const noexcept;
      +
      allocator_type get_allocator() const noexcept;

      Effects: Returns a copy of the allocator that was passed to the object's constructor.

      Complexity: Constant.

    2. -
      stored_allocator_type & get_stored_allocator() noexcept;
      +
      stored_allocator_type & get_stored_allocator() noexcept;

      Effects: Returns a reference to the internal allocator.

      Throws: Nothing

      Complexity: Constant.

      Note: Non-standard extension.

    3. -
      const stored_allocator_type & get_stored_allocator() const noexcept;
      +
      const stored_allocator_type & get_stored_allocator() const noexcept;

      Effects: Returns a reference to the internal allocator.

      Throws: Nothing

      Complexity: Constant.

      Note: Non-standard extension.

    4. -
      iterator begin() noexcept;
      +
      iterator begin() noexcept;

      Effects: Returns an iterator to the first element contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    5. -
      const_iterator begin() const noexcept;
      +
      const_iterator begin() const noexcept;

      Effects: Returns a const_iterator to the first element contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    6. -
      iterator end() noexcept;
      +
      iterator end() noexcept;

      Effects: Returns an iterator to the end of the container.

      Throws: Nothing.

      Complexity: Constant.

    7. -
      const_iterator end() const noexcept;
      +
      const_iterator end() const noexcept;

      Effects: Returns a const_iterator to the end of the container.

      Throws: Nothing.

      Complexity: Constant.

    8. -
      reverse_iterator rbegin() noexcept;
      +
      reverse_iterator rbegin() noexcept;

      Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    9. -
      const_reverse_iterator rbegin() const noexcept;
      +
      const_reverse_iterator rbegin() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    10. -
      reverse_iterator rend() noexcept;
      +
      reverse_iterator rend() noexcept;

      Effects: Returns a reverse_iterator pointing to the end of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    11. -
      const_reverse_iterator rend() const noexcept;
      +
      const_reverse_iterator rend() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    12. -
      const_iterator cbegin() const noexcept;
      +
      const_iterator cbegin() const noexcept;

      Effects: Returns a const_iterator to the first element contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    13. -
      const_iterator cend() const noexcept;
      +
      const_iterator cend() const noexcept;

      Effects: Returns a const_iterator to the end of the container.

      Throws: Nothing.

      Complexity: Constant.

    14. -
      const_reverse_iterator crbegin() const noexcept;
      +
      const_reverse_iterator crbegin() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    15. -
      const_reverse_iterator crend() const noexcept;
      +
      const_reverse_iterator crend() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    16. -
      bool empty() const noexcept;
      +
      bool empty() const noexcept;

      Effects: Returns true if the container contains no elements.

      Throws: Nothing.

      Complexity: Constant.

    17. -
      size_type size() const noexcept;
      +
      size_type size() const noexcept;

      Effects: Returns the number of the elements contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    18. -
      size_type max_size() const noexcept;
      +
      size_type max_size() const noexcept;

      Effects: Returns the largest possible size of the container.

      Throws: Nothing.

      Complexity: Constant.

    19. -
      size_type capacity() const noexcept;
      +
      size_type capacity() const noexcept;

      Effects: Number of elements for which memory has been allocated. capacity() is always greater than or equal to size().

      Throws: Nothing.

      Complexity: Constant.

    20. -
      void reserve(size_type cnt);
      +
      void reserve(size_type cnt);

      Effects: If n is less than or equal to capacity(), this call has no effect. Otherwise, it is a request for allocation of additional memory. If the request is successful, then capacity() is greater than or equal to n; otherwise, capacity() is unchanged. In either case, size() is unchanged.

      Throws: If memory allocation allocation throws or Key's copy constructor throws.

      Note: If capacity() is less than "cnt", iterators and references to to values might be invalidated.

    21. -
      void shrink_to_fit();
      +
      void shrink_to_fit();
      Effects: Tries to deallocate the excess of memory created

      Throws: If memory allocation throws, or Key's copy constructor throws.

      Complexity: Linear to size().

    22. -
      template<class... Args> std::pair< iterator, bool > emplace(Args &&... args);
      +
      template<class... Args> std::pair< iterator, bool > emplace(Args &&... args);

      Effects: Inserts an object x of type Key constructed with std::forward<Args>(args)... if and only if there is no element in the container with key equivalent to the key of x.

      Returns: The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of x.

      Complexity: Logarithmic search time plus linear insertion to the elements with bigger keys than x.

      @@ -416,35 +416,35 @@ 
    23. template<class... Args> 
-  iterator emplace_hint(const_iterator p, Args &&... args);
      + iterator emplace_hint(const_iterator p, Args &&... args);

      Effects: Inserts an object of type Key constructed with std::forward<Args>(args)... in the container if and only if there is no element in the container with key equivalent to the key of x. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic search time (constant if x is inserted right before p) plus insertion linear to the elements with bigger keys than x.

      Note: If an element is inserted it might invalidate elements.

    24. -
      std::pair< iterator, bool > insert(const value_type & x);
      +
      std::pair< iterator, bool > insert(const value_type & x);

      Effects: Inserts x if and only if there is no element in the container with key equivalent to the key of x.

      Returns: The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of x.

      Complexity: Logarithmic search time plus linear insertion to the elements with bigger keys than x.

      Note: If an element is inserted it might invalidate elements.

    25. -
      std::pair< iterator, bool > insert(value_type && x);
      +
      std::pair< iterator, bool > insert(value_type && x);

      Effects: Inserts a new value_type move constructed from the pair if and only if there is no element in the container with key equivalent to the key of x.

      Returns: The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of x.

      Complexity: Logarithmic search time plus linear insertion to the elements with bigger keys than x.

      Note: If an element is inserted it might invalidate elements.

    26. -
      iterator insert(const_iterator p, const value_type & x);
      +
      iterator insert(const_iterator p, const value_type & x);

      Effects: Inserts a copy of x in the container if and only if there is no element in the container with key equivalent to the key of x. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic search time (constant if x is inserted right before p) plus insertion linear to the elements with bigger keys than x.

      Note: If an element is inserted it might invalidate elements.

    27. -
      iterator insert(const_iterator p, value_type && x);
      +
      iterator insert(const_iterator p, value_type && x);

      Effects: Inserts an element move constructed from x in the container. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic search time (constant if x is inserted right before p) plus insertion linear to the elements with bigger keys than x.

      @@ -452,7 +452,7 @@ 
    28. template<typename InputIterator> 
-  void insert(InputIterator first, InputIterator last);
      + void insert(InputIterator first, InputIterator last);

      Requires: first, last are not iterators into *this.

      Effects: inserts each element from the range [first,last) if and only if there is no element with key equivalent to the key of that element.

      Complexity: At most N log(size()+N) (N is the distance from first to last) search time plus N*size() insertion time.

      @@ -460,79 +460,79 @@ 
    29. template<typename InputIterator> 
-  void insert(ordered_unique_range_t, InputIterator first, InputIterator last);
      + void insert(ordered_unique_range_t, InputIterator first, InputIterator last);

      Requires: first, last are not iterators into *this and must be ordered according to the predicate and must be unique values.

      Effects: inserts each element from the range [first,last) .This function is more efficient than the normal range creation for ordered ranges.

      Complexity: At most N log(size()+N) (N is the distance from first to last) search time plus N*size() insertion time.

      Note: Non-standard extension. If an element is inserted it might invalidate elements.

    30. -
      void insert(std::initializer_list< value_type > il);
      +
      void insert(std::initializer_list< value_type > il);

      Effects: inserts each element from the range [il.begin(), il.end()) if and only if there is no element with key equivalent to the key of that element.

      Complexity: At most N log(size()+N) (N is the distance from il.begin() to il.end()) search time plus N*size() insertion time.

      Note: If an element is inserted it might invalidate elements.

    31. -
      void insert(ordered_unique_range_t, std::initializer_list< value_type > il);
      +
      void insert(ordered_unique_range_t, std::initializer_list< value_type > il);

      Requires: Range [il.begin(), il.end()) must be ordered according to the predicate and must be unique values.

      Effects: inserts each element from the range [il.begin(), il.end()) .This function is more efficient than the normal range creation for ordered ranges.

      Complexity: At most N log(size()+N) (N is the distance from il.begin() to il.end()) search time plus N*size() insertion time.

      Note: Non-standard extension. If an element is inserted it might invalidate elements.

    32. -
      iterator erase(const_iterator p);
      +
      iterator erase(const_iterator p);

      Effects: Erases the element pointed to by p.

      Returns: Returns an iterator pointing to the element immediately following q prior to the element being erased. If no such element exists, returns end().

      Complexity: Linear to the elements with keys bigger than p

      Note: Invalidates elements with keys not less than the erased element.

    33. -
      size_type erase(const key_type & x);
      +
      size_type erase(const key_type & x);

      Effects: Erases all elements in the container with key equivalent to x.

      Returns: Returns the number of erased elements.

      Complexity: Logarithmic search time plus erasure time linear to the elements with bigger keys.

    34. -
      iterator erase(const_iterator first, const_iterator last);
      +
      iterator erase(const_iterator first, const_iterator last);

      Effects: Erases all the elements in the range [first, last).

      Returns: Returns last.

      Complexity: size()*N where N is the distance from first to last.

      Complexity: Logarithmic search time plus erasure time linear to the elements with bigger keys.

    35. -
      void swap(flat_set & x) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_swappable< Compare >::value));
      +
      void swap(flat_set & x) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_swappable< Compare >::value));

      Effects: Swaps the contents of *this and x.

      Throws: Nothing.

      Complexity: Constant.

    36. -
      void clear() noexcept;
      +
      void clear() noexcept;

      Effects: erase(a.begin(),a.end()).

      Postcondition: size() == 0.

      Complexity: linear in size().

    37. -
      key_compare key_comp() const;
      +
      key_compare key_comp() const;

      Effects: Returns the comparison object out of which a was constructed.

      Complexity: Constant.

    38. -
      value_compare value_comp() const;
      +
      value_compare value_comp() const;

      Effects: Returns an object of value_compare constructed out of the comparison object.

      Complexity: Constant.

    39. -
      iterator find(const key_type & x);
      +
      iterator find(const key_type & x);

      Returns: An iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.

      Complexity: Logarithmic.

    40. -
      const_iterator find(const key_type & x) const;
      +
      const_iterator find(const key_type & x) const;

      Returns: A const_iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.

      Complexity: Logarithmic.

    41. -
      iterator nth(size_type n) noexcept;
      +
      iterator nth(size_type n) noexcept;

      Requires: size() >= n.

      Effects: Returns an iterator to the nth element from the beginning of the container. Returns end() if n == size().

      Throws: Nothing.

      @@ -540,7 +540,7 @@

      Note: Non-standard extension

    42. -
      const_iterator nth(size_type n) const noexcept;
      +
      const_iterator nth(size_type n) const noexcept;

      Requires: size() >= n.

      Effects: Returns a const_iterator to the nth element from the beginning of the container. Returns end() if n == size().

      Throws: Nothing.

      @@ -548,7 +548,7 @@

      Note: Non-standard extension

    43. -
      size_type index_of(iterator p) noexcept;
      +
      size_type index_of(iterator p) noexcept;

      Requires: size() >= n.

      Effects: Returns an iterator to the nth element from the beginning of the container. Returns end() if n == size().

      Throws: Nothing.

      @@ -556,7 +556,7 @@

      Note: Non-standard extension

    44. -
      size_type index_of(const_iterator p) const noexcept;
      +
      size_type index_of(const_iterator p) const noexcept;

      Requires: begin() <= p <= end().

      Effects: Returns the index of the element pointed by p and size() if p == end().

      Throws: Nothing.

      @@ -564,79 +564,79 @@

      Note: Non-standard extension

    45. -
      size_type count(const key_type & x) const;
      +
      size_type count(const key_type & x) const;

      Returns: The number of elements with key equivalent to x.

      Complexity: log(size())+count(k)

    46. -
      iterator lower_bound(const key_type & x);
      +
      iterator lower_bound(const key_type & x);

      Returns: An iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.

      Complexity: Logarithmic

    47. -
      const_iterator lower_bound(const key_type & x) const;
      +
      const_iterator lower_bound(const key_type & x) const;

      Returns: A const iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.

      Complexity: Logarithmic

    48. -
      iterator upper_bound(const key_type & x);
      +
      iterator upper_bound(const key_type & x);

      Returns: An iterator pointing to the first element with key not less than x, or end() if such an element is not found.

      Complexity: Logarithmic

    49. -
      const_iterator upper_bound(const key_type & x) const;
      +
      const_iterator upper_bound(const key_type & x) const;

      Returns: A const iterator pointing to the first element with key not less than x, or end() if such an element is not found.

      Complexity: Logarithmic 

    50. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & x) const;
      +equal_range(const key_type & x) const;

      Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).

      Complexity: Logarithmic

    51. -
      std::pair< iterator, iterator > equal_range(const key_type & x);
      +
      std::pair< iterator, iterator > equal_range(const key_type & x);

      Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).

      Complexity: Logarithmic

    -

    -flat_set friend functions

    +

    +flat_set friend functions

    1. -
      friend bool operator==(const flat_set & x, const flat_set & y);
      +
      friend bool operator==(const flat_set & x, const flat_set & y);

      Effects: Returns true if x and y are equal

      Complexity: Linear to the number of elements in the container.

    2. -
      friend bool operator!=(const flat_set & x, const flat_set & y);
      +
      friend bool operator!=(const flat_set & x, const flat_set & y);

      Effects: Returns true if x and y are unequal

      Complexity: Linear to the number of elements in the container.

    3. -
      friend bool operator<(const flat_set & x, const flat_set & y);
      +
      friend bool operator<(const flat_set & x, const flat_set & y);

      Effects: Returns true if x is less than y

      Complexity: Linear to the number of elements in the container.

    4. -
      friend bool operator>(const flat_set & x, const flat_set & y);
      +
      friend bool operator>(const flat_set & x, const flat_set & y);

      Effects: Returns true if x is greater than y

      Complexity: Linear to the number of elements in the container.

    5. -
      friend bool operator<=(const flat_set & x, const flat_set & y);
      +
      friend bool operator<=(const flat_set & x, const flat_set & y);

      Effects: Returns true if x is equal or less than y

      Complexity: Linear to the number of elements in the container.

    6. -
      friend bool operator>=(const flat_set & x, const flat_set & y);
      +
      friend bool operator>=(const flat_set & x, const flat_set & y);

      Effects: Returns true if x is equal or greater than y

      Complexity: Linear to the number of elements in the container.

    7. -
      friend void swap(flat_set & x, flat_set & y);
      +
      friend void swap(flat_set & x, flat_set & y);

      Effects: x.swap(y)

      Complexity: Constant.

      8. @@ -646,7 +646,7 @@
    -
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -654,7 +654,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/container/list.html b/doc/html/boost/container/list.html index b27e41d1d6..97def0c1c0 100644 --- a/doc/html/boost/container/list.html +++ b/doc/html/boost/container/list.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -51,108 +51,108 @@ typedef implementation_defined const_reverse_iterator; // construct/copy/destruct - list(); - explicit list(const allocator_type &) noexcept; - explicit list(size_type); - list(size_type, const allocator_type &); - list(size_type, const T &, const Allocator & = Allocator()); - list(const list &); - list(list &&); - list(const list &, const allocator_type &); - list(list &&, const allocator_type &); - template<typename InpIt> list(InpIt, InpIt, const Allocator & = Allocator()); - list(std::initializer_list< value_type >, const Allocator & = Allocator()); - list & operator=(const list &); - list & operator=(list &&) noexcept(allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value)); - list & operator=(std::initializer_list< value_type >); - ~list(); + list(); + explicit list(const allocator_type &) noexcept; + explicit list(size_type); + list(size_type, const allocator_type &); + list(size_type, const T &, const Allocator & = Allocator()); + list(const list &); + list(list &&); + list(const list &, const allocator_type &); + list(list &&, const allocator_type &); + template<typename InpIt> list(InpIt, InpIt, const Allocator & = Allocator()); + list(std::initializer_list< value_type >, const Allocator & = Allocator()); + list & operator=(const list &); + list & operator=(list &&) noexcept(allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value)); + list & operator=(std::initializer_list< value_type >); + ~list(); - // public member functions - void assign(size_type, const T &); - template<typename InpIt> void assign(InpIt, InpIt); - void assign(std::initializer_list< value_type >); - allocator_type get_allocator() const noexcept; - stored_allocator_type & get_stored_allocator() noexcept; - const stored_allocator_type & get_stored_allocator() const noexcept; - iterator begin() noexcept; - const_iterator begin() const noexcept; - iterator end() noexcept; - const_iterator end() const noexcept; - reverse_iterator rbegin() noexcept; - const_reverse_iterator rbegin() const noexcept; - reverse_iterator rend() noexcept; - const_reverse_iterator rend() const noexcept; - const_iterator cbegin() const noexcept; - const_iterator cend() const noexcept; - const_reverse_iterator crbegin() const noexcept; - const_reverse_iterator crend() const noexcept; - bool empty() const noexcept; - size_type size() const noexcept; - size_type max_size() const noexcept; - void resize(size_type); - void resize(size_type, const T &); - reference front() noexcept; - const_reference front() const noexcept; - reference back() noexcept; - const_reference back() const noexcept; - template<class... Args> void emplace_back(Args &&...); - template<class... Args> void emplace_front(Args &&...); - template<class... Args> iterator emplace(const_iterator, Args &&...); - void push_front(const T &); - void push_front(T &&); - void push_back(const T &); - void push_back(T &&); - iterator insert(const_iterator, const T &); - iterator insert(const_iterator, T &&); - iterator insert(const_iterator, size_type, const T &); - template<typename InpIt> iterator insert(const_iterator, InpIt, InpIt); - iterator insert(const_iterator, std::initializer_list< value_type >); - void pop_front() noexcept; - void pop_back() noexcept; - iterator erase(const_iterator) noexcept; - iterator erase(const_iterator, const_iterator) noexcept; - void swap(list &) noexcept(allocator_traits_type::propagate_on_container_swap::value||allocator_traits_type::is_always_equal::value)); - void clear() noexcept; - void splice(const_iterator, list &) noexcept; - void splice(const_iterator, list &&) noexcept; - void splice(const_iterator, list &, const_iterator) noexcept; - void splice(const_iterator, list &&, const_iterator) noexcept; - void splice(const_iterator, list &, const_iterator, const_iterator) noexcept; - void splice(const_iterator, list &&, const_iterator, const_iterator) noexcept; - void splice(const_iterator, list &, const_iterator, const_iterator, + // public member functions + void assign(size_type, const T &); + template<typename InpIt> void assign(InpIt, InpIt); + void assign(std::initializer_list< value_type >); + allocator_type get_allocator() const noexcept; + stored_allocator_type & get_stored_allocator() noexcept; + const stored_allocator_type & get_stored_allocator() const noexcept; + iterator begin() noexcept; + const_iterator begin() const noexcept; + iterator end() noexcept; + const_iterator end() const noexcept; + reverse_iterator rbegin() noexcept; + const_reverse_iterator rbegin() const noexcept; + reverse_iterator rend() noexcept; + const_reverse_iterator rend() const noexcept; + const_iterator cbegin() const noexcept; + const_iterator cend() const noexcept; + const_reverse_iterator crbegin() const noexcept; + const_reverse_iterator crend() const noexcept; + bool empty() const noexcept; + size_type size() const noexcept; + size_type max_size() const noexcept; + void resize(size_type); + void resize(size_type, const T &); + reference front() noexcept; + const_reference front() const noexcept; + reference back() noexcept; + const_reference back() const noexcept; + template<class... Args> void emplace_back(Args &&...); + template<class... Args> void emplace_front(Args &&...); + template<class... Args> iterator emplace(const_iterator, Args &&...); + void push_front(const T &); + void push_front(T &&); + void push_back(const T &); + void push_back(T &&); + iterator insert(const_iterator, const T &); + iterator insert(const_iterator, T &&); + iterator insert(const_iterator, size_type, const T &); + template<typename InpIt> iterator insert(const_iterator, InpIt, InpIt); + iterator insert(const_iterator, std::initializer_list< value_type >); + void pop_front() noexcept; + void pop_back() noexcept; + iterator erase(const_iterator) noexcept; + iterator erase(const_iterator, const_iterator) noexcept; + void swap(list &) noexcept(allocator_traits_type::propagate_on_container_swap::value||allocator_traits_type::is_always_equal::value)); + void clear() noexcept; + void splice(const_iterator, list &) noexcept; + void splice(const_iterator, list &&) noexcept; + void splice(const_iterator, list &, const_iterator) noexcept; + void splice(const_iterator, list &&, const_iterator) noexcept; + void splice(const_iterator, list &, const_iterator, const_iterator) noexcept; + void splice(const_iterator, list &&, const_iterator, const_iterator) noexcept; + void splice(const_iterator, list &, const_iterator, const_iterator, size_type) noexcept; - void splice(const_iterator, list &&, const_iterator, const_iterator, + void splice(const_iterator, list &&, const_iterator, const_iterator, size_type) noexcept; - void remove(const T &); - template<typename Pred> void remove_if(Pred); - void unique(); - template<typename BinaryPredicate> void unique(BinaryPredicate); - void merge(list &); - void merge(list &&); + void remove(const T &); + template<typename Pred> void remove_if(Pred); + void unique(); + template<typename BinaryPredicate> void unique(BinaryPredicate); + void merge(list &); + void merge(list &&); template<typename StrictWeakOrdering> - void merge(list &, const StrictWeakOrdering &); + void merge(list &, const StrictWeakOrdering &); template<typename StrictWeakOrdering> - void merge(list &&, StrictWeakOrdering); - void sort(); - template<typename StrictWeakOrdering> void sort(StrictWeakOrdering); - void reverse() noexcept; + void merge(list &&, StrictWeakOrdering); + void sort(); + template<typename StrictWeakOrdering> void sort(StrictWeakOrdering); + void reverse() noexcept; - // friend functions - friend bool operator==(const list &, const list &); - friend bool operator!=(const list &, const list &); - friend bool operator<(const list &, const list &); - friend bool operator>(const list &, const list &); - friend bool operator<=(const list &, const list &); - friend bool operator>=(const list &, const list &); - friend void swap(list &, list &); + // friend functions + friend bool operator==(const list &, const list &); + friend bool operator!=(const list &, const list &); + friend bool operator<(const list &, const list &); + friend bool operator>(const list &, const list &); + friend bool operator<=(const list &, const list &); + friend bool operator>=(const list &, const list &); + friend void swap(list &, list &); };
    -

    Description

    +

    Description

    A list is a doubly linked list. That is, it is a Sequence that supports both forward and backward traversal, and (amortized) constant time insertion and removal of elements at the beginning or the end, or in the middle. Lists have the important property that insertion and splicing do not invalidate iterators to list elements, and that even removal invalidates only the iterators that point to the elements that are removed. The ordering of iterators may be changed (that is, list<T>::iterator might have a different predecessor or successor after a list operation than it did before), but the iterators themselves will not be invalidated or made to point to different elements unless that invalidation or mutation is explicit.

    -

    Template Parameters

    +

    Template Parameters

    1. typename T
      @@ -165,104 +165,104 @@
    -

    +

    list public construct/copy/destruct

    1. -
      list();
      +
      list();

      Effects: Default constructs a list.

      Throws: If allocator_type's default constructor throws.

      Complexity: Constant.

    2. -
      explicit list(const allocator_type & a) noexcept;
      +
      explicit list(const allocator_type & a) noexcept;

      Effects: Constructs a list taking the allocator as parameter.

      Throws: Nothing

      Complexity: Constant.

    3. -
      explicit list(size_type n);
      +
      explicit list(size_type n);

      Effects: Constructs a list and inserts n value-initialized value_types.

      Throws: If allocator_type's default constructor throws or T's default or copy constructor throws.

      Complexity: Linear to n.

    4. -
      list(size_type n, const allocator_type & a);
      +
      list(size_type n, const allocator_type & a);

      Effects: Constructs a list that will use a copy of allocator a and inserts n copies of value.

      Throws: If allocator_type's default constructor throws or T's default or copy constructor throws.

      Complexity: Linear to n.

    5. -
      list(size_type n, const T & value, const Allocator & a = Allocator());
      +
      list(size_type n, const T & value, const Allocator & a = Allocator());

      Effects: Constructs a list that will use a copy of allocator a and inserts n copies of value.

      Throws: If allocator_type's default constructor throws or T's default or copy constructor throws.

      Complexity: Linear to n.

    6. -
      list(const list & x);
      +
      list(const list & x);

      Effects: Copy constructs a list.

      Postcondition: x == *this.

      Throws: If allocator_type's default constructor throws.

      Complexity: Linear to the elements x contains.

    7. -
      list(list && x);
      +
      list(list && x);

      Effects: Move constructor. Moves x's resources to *this.

      Throws: If allocator_type's copy constructor throws.

      Complexity: Constant.

    8. -
      list(const list & x, const allocator_type & a);
      +
      list(const list & x, const allocator_type & a);

      Effects: Copy constructs a list using the specified allocator.

      Postcondition: x == *this.

      Throws: If allocator_type's default constructor or copy constructor throws.

      Complexity: Linear to the elements x contains.

    9. -
      list(list && x, const allocator_type & a);
      +
      list(list && x, const allocator_type & a);

      Effects: Move constructor sing the specified allocator. Moves x's resources to *this.

      Throws: If allocation or value_type's copy constructor throws.

      Complexity: Constant if a == x.get_allocator(), linear otherwise. 

    10. template<typename InpIt> 
-  list(InpIt first, InpIt last, const Allocator & a = Allocator());
      + list(InpIt first, InpIt last, const Allocator & a = Allocator());

      Effects: Constructs a list that will use a copy of allocator a and inserts a copy of the range [first, last) in the list.

      Throws: If allocator_type's default constructor throws or T's constructor taking a dereferenced InIt throws.

      Complexity: Linear to the range [first, last).

    11. -
      list(std::initializer_list< value_type > il, 
+
      list(std::initializer_list< value_type > il, 
      const Allocator & a = Allocator());
      
 
      Effects: Constructs a list that will use a copy of allocator a and inserts a copy of the range [il.begin(), il.end()) in the list.
      
 
      Throws: If allocator_type's default constructor throws or T's constructor taking a dereferenced std::initializer_list iterator throws.
      
 
      Complexity: Linear to the range [il.begin(), il.end()).
    12. -
      list & operator=(const list & x);
      +
      list & operator=(const list & x);

      Effects: Makes *this contain the same elements as x.

      Postcondition: this->size() == x.size(). *this contains a copy of each of x's elements.

      Throws: If memory allocation throws or T's copy constructor throws.

      Complexity: Linear to the number of elements in x.

    13. -
      list & operator=(list && x) noexcept(allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value));
      +
      list & operator=(list && x) noexcept(allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value));

      Effects: Move assignment. All x's values are transferred to *this.

      Postcondition: x.empty(). *this contains a the elements x had before the function.

      Throws: If allocator_traits_type::propagate_on_container_move_assignment is false and (allocation throws or value_type's move constructor throws)

      Complexity: Constant if allocator_traits_type:: propagate_on_container_move_assignment is true or this->get>allocator() == x.get_allocator(). Linear otherwise.

    14. -
      list & operator=(std::initializer_list< value_type > il);
      +
      list & operator=(std::initializer_list< value_type > il);

      Effects: Makes *this contain the same elements as il.

      Postcondition: this->size() == il.size(). *this contains a copy of each of x's elements.

      Throws: If memory allocation throws or T's copy constructor throws.

      Complexity: Linear to the number of elements in x.

    15. -
      ~list();
      +
      ~list();

      Effects: Destroys the list. All stored values are destroyed and used memory is deallocated.

      Throws: Nothing.

      Complexity: Linear to the number of elements.

      @@ -270,221 +270,222 @@
    -

    -list public member functions

    +

    +list public member functions

    1. -
      void assign(size_type n, const T & val);
      +
      void assign(size_type n, const T & val);

      Effects: Assigns the n copies of val to *this.

      Throws: If memory allocation throws or T's copy constructor throws.

      Complexity: Linear to n.

    2. -
      template<typename InpIt> void assign(InpIt first, InpIt last);
      +
      template<typename InpIt> void assign(InpIt first, InpIt last);

      Effects: Assigns the the range [first, last) to *this.

      Throws: If memory allocation throws or T's constructor from dereferencing InpIt throws.

      Complexity: Linear to n.

    3. -
      void assign(std::initializer_list< value_type > il);
      +
      void assign(std::initializer_list< value_type > il);

      Effects: Assigns the the range [il.begin(), il.end()) to *this.

      Throws: If memory allocation throws or T's constructor from dereferencing std::initializer_list iterator throws.

      Complexity: Linear to n.

    4. -
      allocator_type get_allocator() const noexcept;
      +
      allocator_type get_allocator() const noexcept;

      Effects: Returns a copy of the internal allocator.

      Throws: If allocator's copy constructor throws.

      Complexity: Constant.

    5. -
      stored_allocator_type & get_stored_allocator() noexcept;
      +
      stored_allocator_type & get_stored_allocator() noexcept;

      Effects: Returns a reference to the internal allocator.

      Throws: Nothing

      Complexity: Constant.

      Note: Non-standard extension.

    6. -
      const stored_allocator_type & get_stored_allocator() const noexcept;
      +
      const stored_allocator_type & get_stored_allocator() const noexcept;

      Effects: Returns a reference to the internal allocator.

      Throws: Nothing

      Complexity: Constant.

      Note: Non-standard extension.

    7. -
      iterator begin() noexcept;
      +
      iterator begin() noexcept;

      Effects: Returns an iterator to the first element contained in the list.

      Throws: Nothing.

      Complexity: Constant.

    8. -
      const_iterator begin() const noexcept;
      +
      const_iterator begin() const noexcept;

      Effects: Returns a const_iterator to the first element contained in the list.

      Throws: Nothing.

      Complexity: Constant.

    9. -
      iterator end() noexcept;
      +
      iterator end() noexcept;

      Effects: Returns an iterator to the end of the list.

      Throws: Nothing.

      Complexity: Constant.

    10. -
      const_iterator end() const noexcept;
      +
      const_iterator end() const noexcept;

      Effects: Returns a const_iterator to the end of the list.

      Throws: Nothing.

      Complexity: Constant.

    11. -
      reverse_iterator rbegin() noexcept;
      +
      reverse_iterator rbegin() noexcept;

      Effects: Returns a reverse_iterator pointing to the beginning of the reversed list.

      Throws: Nothing.

      Complexity: Constant.

    12. -
      const_reverse_iterator rbegin() const noexcept;
      +
      const_reverse_iterator rbegin() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed list.

      Throws: Nothing.

      Complexity: Constant.

    13. -
      reverse_iterator rend() noexcept;
      +
      reverse_iterator rend() noexcept;

      Effects: Returns a reverse_iterator pointing to the end of the reversed list.

      Throws: Nothing.

      Complexity: Constant.

    14. -
      const_reverse_iterator rend() const noexcept;
      +
      const_reverse_iterator rend() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed list.

      Throws: Nothing.

      Complexity: Constant.

    15. -
      const_iterator cbegin() const noexcept;
      +
      const_iterator cbegin() const noexcept;

      Effects: Returns a const_iterator to the first element contained in the list.

      Throws: Nothing.

      Complexity: Constant.

    16. -
      const_iterator cend() const noexcept;
      +
      const_iterator cend() const noexcept;

      Effects: Returns a const_iterator to the end of the list.

      Throws: Nothing.

      Complexity: Constant.

    17. -
      const_reverse_iterator crbegin() const noexcept;
      +
      const_reverse_iterator crbegin() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed list.

      Throws: Nothing.

      Complexity: Constant.

    18. -
      const_reverse_iterator crend() const noexcept;
      +
      const_reverse_iterator crend() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed list.

      Throws: Nothing.

      Complexity: Constant.

    19. -
      bool empty() const noexcept;
      +
      bool empty() const noexcept;

      Effects: Returns true if the list contains no elements.

      Throws: Nothing.

      Complexity: Constant.

    20. -
      size_type size() const noexcept;
      +
      size_type size() const noexcept;

      Effects: Returns the number of the elements contained in the list.

      Throws: Nothing.

      Complexity: Constant.

    21. -
      size_type max_size() const noexcept;
      +
      size_type max_size() const noexcept;

      Effects: Returns the largest possible size of the list.

      Throws: Nothing.

      Complexity: Constant.

    22. -
      void resize(size_type new_size);
      +
      void resize(size_type new_size);

      Effects: Inserts or erases elements at the end such that the size becomes n. New elements are value initialized.

      Throws: If memory allocation throws, or T's copy constructor throws.

      Complexity: Linear to the difference between size() and new_size.

    23. -
      void resize(size_type new_size, const T & x);
      +
      void resize(size_type new_size, const T & x);

      Effects: Inserts or erases elements at the end such that the size becomes n. New elements are copy constructed from x.

      Throws: If memory allocation throws, or T's copy constructor throws.

      Complexity: Linear to the difference between size() and new_size.

    24. -
      reference front() noexcept;
      +
      reference front() noexcept;

      Requires: !empty()

      Effects: Returns a reference to the first element from the beginning of the container.

      Throws: Nothing.

      Complexity: Constant.

    25. -
      const_reference front() const noexcept;
      +
      const_reference front() const noexcept;

      Requires: !empty()

      Effects: Returns a const reference to the first element from the beginning of the container.

      Throws: Nothing.

      Complexity: Constant.

    26. -
      reference back() noexcept;
      +
      reference back() noexcept;

      Requires: !empty()

      Effects: Returns a reference to the first element from the beginning of the container.

      Throws: Nothing.

      Complexity: Constant.

    27. -
      const_reference back() const noexcept;
      +
      const_reference back() const noexcept;

      Requires: !empty()

      Effects: Returns a const reference to the first element from the beginning of the container.

      Throws: Nothing.

      Complexity: Constant.

    28. -
      template<class... Args> void emplace_back(Args &&... args);
      +
      template<class... Args> void emplace_back(Args &&... args);

      Effects: Inserts an object of type T constructed with std::forward<Args>(args)... in the end of the list.

      Throws: If memory allocation throws or T's in-place constructor throws.

      Complexity: Constant

    29. -
      template<class... Args> void emplace_front(Args &&... args);
      +
      template<class... Args> void emplace_front(Args &&... args);

      Effects: Inserts an object of type T constructed with std::forward<Args>(args)... in the beginning of the list.

      Throws: If memory allocation throws or T's in-place constructor throws.

      Complexity: Constant

    30. -
      template<class... Args> iterator emplace(const_iterator p, Args &&... args);
      +
      template<class... Args> 
+  iterator emplace(const_iterator position, Args &&... args);

      Effects: Inserts an object of type T constructed with std::forward<Args>(args)... before p.

      Throws: If memory allocation throws or T's in-place constructor throws.

      Complexity: Constant

    31. -
      void push_front(const T & x);
      +
      void push_front(const T & x);

      Effects: Inserts a copy of x at the beginning of the list.

      Throws: If memory allocation throws or T's copy constructor throws.

      Complexity: Amortized constant time.

    32. -
      void push_front(T && x);
      +
      void push_front(T && x);

      Effects: Constructs a new element in the beginning of the list and moves the resources of x to this new element.

      Throws: If memory allocation throws.

      Complexity: Amortized constant time.

    33. -
      void push_back(const T & x);
      +
      void push_back(const T & x);

      Effects: Inserts a copy of x at the end of the list.

      Throws: If memory allocation throws or T's copy constructor throws.

      Complexity: Amortized constant time.

    34. -
      void push_back(T && x);
      +
      void push_back(T && x);

      Effects: Constructs a new element in the end of the list and moves the resources of x to this new element.

      Throws: If memory allocation throws.

      Complexity: Amortized constant time.

    35. -
      iterator insert(const_iterator p, const T & x);
      +
      iterator insert(const_iterator p, const T & x);

      Requires: p must be a valid iterator of *this.

      Effects: Insert a copy of x before p.

      Returns: an iterator to the inserted element.

      @@ -492,7 +493,7 @@

      Complexity: Amortized constant time.

    36. -
      iterator insert(const_iterator p, T && x);
      +
      iterator insert(const_iterator p, T && x);

      Requires: p must be a valid iterator of *this.

      Effects: Insert a new element before p with x's resources.

      Returns: an iterator to the inserted element.

      @@ -500,7 +501,7 @@

      Complexity: Amortized constant time.

    37. -
      iterator insert(const_iterator p, size_type n, const T & x);
      +
      iterator insert(const_iterator position, size_type n, const T & x);

      Requires: p must be a valid iterator of *this.

      Effects: Inserts n copies of x before p.

      Returns: an iterator to the first inserted element or p if n is 0.

      @@ -509,7 +510,7 @@ 
    38. template<typename InpIt> 
-  iterator insert(const_iterator p, InpIt first, InpIt last);
      + iterator insert(const_iterator p, InpIt first, InpIt last);

      Requires: p must be a valid iterator of *this.

      Effects: Insert a copy of the [first, last) range before p.

      Returns: an iterator to the first inserted element or p if first == last.

      @@ -517,7 +518,7 @@

      Complexity: Linear to distance [first, last).

    39. -
      iterator insert(const_iterator p, std::initializer_list< value_type > il);
      +
      iterator insert(const_iterator p, std::initializer_list< value_type > il);

      Requires: p must be a valid iterator of *this.

      Effects: Insert a copy of the [il.begin(), il.end()) range before p.

      Returns: an iterator to the first inserted element or p if if.begin() == il.end().

      @@ -525,45 +526,45 @@

      Complexity: Linear to distance [il.begin(), il.end()).

    40. -
      void pop_front() noexcept;
      +
      void pop_front() noexcept;

      Effects: Removes the first element from the list.

      Throws: Nothing.

      Complexity: Amortized constant time.

    41. -
      void pop_back() noexcept;
      +
      void pop_back() noexcept;

      Effects: Removes the last element from the list.

      Throws: Nothing.

      Complexity: Amortized constant time.

    42. -
      iterator erase(const_iterator p) noexcept;
      +
      iterator erase(const_iterator p) noexcept;

      Requires: p must be a valid iterator of *this.

      Effects: Erases the element at p p.

      Throws: Nothing.

      Complexity: Amortized constant time.

    43. -
      iterator erase(const_iterator first, const_iterator last) noexcept;
      +
      iterator erase(const_iterator first, const_iterator last) noexcept;

      Requires: first and last must be valid iterator to elements in *this.

      Effects: Erases the elements pointed by [first, last).

      Throws: Nothing.

      Complexity: Linear to the distance between first and last.

    44. -
      void swap(list & x) noexcept(allocator_traits_type::propagate_on_container_swap::value||allocator_traits_type::is_always_equal::value));
      +
      void swap(list & x) noexcept(allocator_traits_type::propagate_on_container_swap::value||allocator_traits_type::is_always_equal::value));

      Effects: Swaps the contents of *this and x.

      Throws: Nothing.

      Complexity: Constant.

    45. -
      void clear() noexcept;
      +
      void clear() noexcept;

      Effects: Erases all the elements of the list.

      Throws: Nothing.

      Complexity: Linear to the number of elements in the list.

    46. -
      void splice(const_iterator p, list & x) noexcept;
      +
      void splice(const_iterator p, list & x) noexcept;

      Requires: p must point to an element contained by the list. x != *this. this' allocator and x's allocator shall compare equal

      Effects: Transfers all the elements of list x to this list, before the the element pointed by p. No destructors or copy constructors are called.

      Throws: Nothing

      @@ -571,7 +572,7 @@

      Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.

    47. -
      void splice(const_iterator p, list && x) noexcept;
      +
      void splice(const_iterator p, list && x) noexcept;

      Requires: p must point to an element contained by the list. x != *this. this' allocator and x's allocator shall compare equal

      Effects: Transfers all the elements of list x to this list, before the the element pointed by p. No destructors or copy constructors are called.

      Throws: Nothing

      @@ -579,7 +580,7 @@

      Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.

    48. -
      void splice(const_iterator p, list & x, const_iterator i) noexcept;
      +
      void splice(const_iterator p, list & x, const_iterator i) noexcept;

      Requires: p must point to an element contained by this list. i must point to an element contained in list x. this' allocator and x's allocator shall compare equal

      Effects: Transfers the value pointed by i, from list x to this list, before the the element pointed by p. No destructors or copy constructors are called. If p == i or p == ++i, this function is a null operation.

      Throws: Nothing

      @@ -587,7 +588,7 @@

      Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.

    49. -
      void splice(const_iterator p, list && x, const_iterator i) noexcept;
      +
      void splice(const_iterator p, list && x, const_iterator i) noexcept;

      Requires: p must point to an element contained by this list. i must point to an element contained in list x. this' allocator and x's allocator shall compare equal.

      Effects: Transfers the value pointed by i, from list x to this list, before the the element pointed by p. No destructors or copy constructors are called. If p == i or p == ++i, this function is a null operation.

      Throws: Nothing

      @@ -595,7 +596,7 @@

      Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.

    50. -
      void splice(const_iterator p, list & x, const_iterator first, 
+
      void splice(const_iterator p, list & x, const_iterator first, 
             const_iterator last) noexcept;
      
 
      Requires: p must point to an element contained by this list. first and last must point to elements contained in list x. this' allocator and x's allocator shall compare equal
      
 
      Effects: Transfers the range pointed by first and last from list x to this list, before the the element pointed by p. No destructors or copy constructors are called.
      
@@ -604,7 +605,7 @@
 
      Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.
    51. -
      void splice(const_iterator p, list && x, const_iterator first, 
+
      void splice(const_iterator p, list && x, const_iterator first, 
             const_iterator last) noexcept;
      
 
      Requires: p must point to an element contained by this list. first and last must point to elements contained in list x. this' allocator and x's allocator shall compare equal.
      
 
      Effects: Transfers the range pointed by first and last from list x to this list, before the the element pointed by p. No destructors or copy constructors are called.
      
@@ -613,7 +614,7 @@
 
      Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.
    52. -
      void splice(const_iterator p, list & x, const_iterator first, 
+
      void splice(const_iterator p, list & x, const_iterator first, 
             const_iterator last, size_type n) noexcept;
      
 
      Requires: p must point to an element contained by this list. first and last must point to elements contained in list x. n == distance(first, last). this' allocator and x's allocator shall compare equal
      
 
      Effects: Transfers the range pointed by first and last from list x to this list, before the the element pointed by p. No destructors or copy constructors are called.
      
@@ -623,7 +624,7 @@
 
      Note: Non-standard extension
    53. -
      void splice(const_iterator p, list && x, const_iterator first, 
+
      void splice(const_iterator p, list && x, const_iterator first, 
             const_iterator last, size_type n) noexcept;
      
 
      Requires: p must point to an element contained by this list. first and last must point to elements contained in list x. n == distance(first, last). this' allocator and x's allocator shall compare equal
      
 
      Effects: Transfers the range pointed by first and last from list x to this list, before the the element pointed by p. No destructors or copy constructors are called.
      
@@ -633,42 +634,42 @@
 
      Note: Non-standard extension
    54. -
      void remove(const T & value);
      +
      void remove(const T & value);

      Effects: Removes all the elements that compare equal to value.

      Throws: If comparison throws.

      Complexity: Linear time. It performs exactly size() comparisons for equality.

      Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid.

    55. -
      template<typename Pred> void remove_if(Pred pred);
      +
      template<typename Pred> void remove_if(Pred pred);

      Effects: Removes all the elements for which a specified predicate is satisfied.

      Throws: If pred throws.

      Complexity: Linear time. It performs exactly size() calls to the predicate.

      Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid.

    56. -
      void unique();
      +
      void unique();

      Effects: Removes adjacent duplicate elements or adjacent elements that are equal from the list.

      Throws: If comparison throws.

      Complexity: Linear time (size()-1 comparisons equality comparisons).

      Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid.

    57. -
      template<typename BinaryPredicate> void unique(BinaryPredicate binary_pred);
      +
      template<typename BinaryPredicate> void unique(BinaryPredicate binary_pred);

      Effects: Removes adjacent duplicate elements or adjacent elements that satisfy some binary predicate from the list.

      Throws: If pred throws.

      Complexity: Linear time (size()-1 comparisons calls to pred()).

      Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid.

    58. -
      void merge(list & x);
      +
      void merge(list & x);

      Requires: The lists x and *this must be distinct.

      Effects: This function removes all of x's elements and inserts them in order into *this according to std::less<value_type>. The merge is stable; that is, if an element from *this is equivalent to one from x, then the element from *this will precede the one from x.

      Throws: If comparison throws.

      Complexity: This function is linear time: it performs at most size() + x.size() - 1 comparisons.

    59. -
      void merge(list && x);
      +
      void merge(list && x);

      Requires: The lists x and *this must be distinct.

      Effects: This function removes all of x's elements and inserts them in order into *this according to std::less<value_type>. The merge is stable; that is, if an element from *this is equivalent to one from x, then the element from *this will precede the one from x.

      Throws: If comparison throws.

      @@ -676,7 +677,7 @@ 
    60. template<typename StrictWeakOrdering> 
-  void merge(list & x, const StrictWeakOrdering & comp);
      + void merge(list & x, const StrictWeakOrdering & comp);

      Requires: p must be a comparison function that induces a strict weak ordering and both *this and x must be sorted according to that ordering The lists x and *this must be distinct.

      Effects: This function removes all of x's elements and inserts them in order into *this. The merge is stable; that is, if an element from *this is equivalent to one from x, then the element from *this will precede the one from x.

      Throws: If comp throws.

      @@ -685,7 +686,7 @@ 
    61. template<typename StrictWeakOrdering> 
-  void merge(list && x, StrictWeakOrdering comp);
      + void merge(list && x, StrictWeakOrdering comp);

      Requires: p must be a comparison function that induces a strict weak ordering and both *this and x must be sorted according to that ordering The lists x and *this must be distinct.

      Effects: This function removes all of x's elements and inserts them in order into *this. The merge is stable; that is, if an element from *this is equivalent to one from x, then the element from *this will precede the one from x.

      Throws: If comp throws.

      @@ -693,21 +694,21 @@

      Note: Iterators and references to *this are not invalidated.

    62. -
      void sort();
      +
      void sort();

      Effects: This function sorts the list *this according to std::less<value_type>. The sort is stable, that is, the relative order of equivalent elements is preserved.

      Throws: If comparison throws.

      Notes: Iterators and references are not invalidated.

      Complexity: The number of comparisons is approximately N log N, where N is the list's size.

    63. -
      template<typename StrictWeakOrdering> void sort(StrictWeakOrdering comp);
      +
      template<typename StrictWeakOrdering> void sort(StrictWeakOrdering comp);

      Effects: This function sorts the list *this according to std::less<value_type>. The sort is stable, that is, the relative order of equivalent elements is preserved.

      Throws: If comp throws.

      Notes: Iterators and references are not invalidated.

      Complexity: The number of comparisons is approximately N log N, where N is the list's size.

    64. -
      void reverse() noexcept;
      +
      void reverse() noexcept;

      Effects: Reverses the order of elements in the list.

      Throws: Nothing.

      Complexity: This function is linear time.

      @@ -716,41 +717,41 @@
    -

    -list friend functions

    +

    +list friend functions

    1. -
      friend bool operator==(const list & x, const list & y);
      +
      friend bool operator==(const list & x, const list & y);

      Effects: Returns true if x and y are equal

      Complexity: Linear to the number of elements in the container.

    2. -
      friend bool operator!=(const list & x, const list & y);
      +
      friend bool operator!=(const list & x, const list & y);

      Effects: Returns true if x and y are unequal

      Complexity: Linear to the number of elements in the container.

    3. -
      friend bool operator<(const list & x, const list & y);
      +
      friend bool operator<(const list & x, const list & y);

      Effects: Returns true if x is less than y

      Complexity: Linear to the number of elements in the container.

    4. -
      friend bool operator>(const list & x, const list & y);
      +
      friend bool operator>(const list & x, const list & y);

      Effects: Returns true if x is greater than y

      Complexity: Linear to the number of elements in the container.

    5. -
      friend bool operator<=(const list & x, const list & y);
      +
      friend bool operator<=(const list & x, const list & y);

      Effects: Returns true if x is equal or less than y

      Complexity: Linear to the number of elements in the container.

    6. -
      friend bool operator>=(const list & x, const list & y);
      +
      friend bool operator>=(const list & x, const list & y);

      Effects: Returns true if x is equal or greater than y

      Complexity: Linear to the number of elements in the container.

    7. -
      friend void swap(list & x, list & y);
      +
      friend void swap(list & x, list & y);

      Effects: x.swap(y)

      Complexity: Constant.

      8. @@ -760,7 +761,7 @@
    -
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -768,7 +769,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/container/map.html b/doc/html/boost/container/map.html index 1f266a06c9..17c8e49146 100644 --- a/doc/html/boost/container/map.html +++ b/doc/html/boost/container/map.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -60,103 +60,103 @@ typedef implementation_defined movable_value_type; // construct/copy/destruct - map(); - explicit map(const Compare &, const allocator_type & = allocator_type()); - explicit map(const allocator_type &); + map(); + explicit map(const Compare &, const allocator_type & = allocator_type()); + explicit map(const allocator_type &); template<typename InputIterator> - map(InputIterator, InputIterator, const Compare & = Compare(), + map(InputIterator, InputIterator, const Compare & = Compare(), const allocator_type & = allocator_type()); template<typename InputIterator> - map(InputIterator, InputIterator, const allocator_type &); + map(InputIterator, InputIterator, const allocator_type &); template<typename InputIterator> - map(ordered_unique_range_t, InputIterator, InputIterator, + map(ordered_unique_range_t, InputIterator, InputIterator, const Compare & = Compare(), const allocator_type & = allocator_type()); - map(std::initializer_list< value_type >, const Compare & = Compare(), + map(std::initializer_list< value_type >, const Compare & = Compare(), const allocator_type & = allocator_type()); - map(std::initializer_list< value_type >, const allocator_type &); - map(ordered_unique_range_t, std::initializer_list< value_type >, + map(std::initializer_list< value_type >, const allocator_type &); + map(ordered_unique_range_t, std::initializer_list< value_type >, const Compare & = Compare(), const allocator_type & = allocator_type()); - map(const map &); - map(map &&); - map(const map &, const allocator_type &); - map(map &&, const allocator_type &); - map & operator=(const map &); - map & operator=(map &&) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_move_assignable< Compare >::value)); - map & operator=(std::initializer_list< value_type >); + map(const map &); + map(map &&); + map(const map &, const allocator_type &); + map(map &&, const allocator_type &); + map & operator=(const map &); + map & operator=(map &&) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_move_assignable< Compare >::value)); + map & operator=(std::initializer_list< value_type >); - // public member functions - allocator_type get_allocator() const; - stored_allocator_type & get_stored_allocator() noexcept; - const stored_allocator_type & get_stored_allocator() const noexcept; - iterator begin() noexcept; - const_iterator begin() const noexcept; - const_iterator cbegin() const noexcept; - iterator end() noexcept; - const_iterator end() const noexcept; - const_iterator cend() const noexcept; - reverse_iterator rbegin() noexcept; - const_reverse_iterator rbegin() const noexcept; - const_reverse_iterator crbegin() const noexcept; - reverse_iterator rend() noexcept; - const_reverse_iterator rend() const noexcept; - const_reverse_iterator crend() const noexcept; - bool empty() const noexcept; - size_type size() const noexcept; - size_type max_size() const noexcept; - mapped_type & operator[](const key_type &); - mapped_type & operator[](key_type &&); - T & at(const key_type &); - const T & at(const key_type &) const; - std::pair< iterator, bool > insert(const value_type &); - std::pair< iterator, bool > insert(const nonconst_value_type &); - std::pair< iterator, bool > insert(nonconst_value_type &&); - std::pair< iterator, bool > insert(movable_value_type &&); - std::pair< iterator, bool > insert(value_type &&); - iterator insert(const_iterator, const value_type &); - iterator insert(const_iterator, nonconst_value_type &&); - iterator insert(const_iterator, movable_value_type &&); - iterator insert(const_iterator, const nonconst_value_type &); - iterator insert(const_iterator, value_type &&); - template<typename InputIterator> void insert(InputIterator, InputIterator); - void insert(std::initializer_list< value_type >); - template<class... Args> std::pair< iterator, bool > emplace(Args &&...); - template<class... Args> iterator emplace_hint(const_iterator, Args &&...); - iterator erase(const_iterator) noexcept; - size_type erase(const key_type &) noexcept; - iterator erase(const_iterator, const_iterator) noexcept; - void swap(map &) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_swappable< Compare >::value)); - key_compare key_comp() const; - value_compare value_comp() const; - iterator find(const key_type &); - const_iterator find(const key_type &) const; - size_type count(const key_type &) const; - iterator lower_bound(const key_type &); - const_iterator lower_bound(const key_type &) const; - iterator upper_bound(const key_type &); - const_iterator upper_bound(const key_type &) const; - std::pair< iterator, iterator > equal_range(const key_type &); + // public member functions + allocator_type get_allocator() const; + stored_allocator_type & get_stored_allocator() noexcept; + const stored_allocator_type & get_stored_allocator() const noexcept; + iterator begin() noexcept; + const_iterator begin() const noexcept; + const_iterator cbegin() const noexcept; + iterator end() noexcept; + const_iterator end() const noexcept; + const_iterator cend() const noexcept; + reverse_iterator rbegin() noexcept; + const_reverse_iterator rbegin() const noexcept; + const_reverse_iterator crbegin() const noexcept; + reverse_iterator rend() noexcept; + const_reverse_iterator rend() const noexcept; + const_reverse_iterator crend() const noexcept; + bool empty() const noexcept; + size_type size() const noexcept; + size_type max_size() const noexcept; + mapped_type & operator[](const key_type &); + mapped_type & operator[](key_type &&); + T & at(const key_type &); + const T & at(const key_type &) const; + std::pair< iterator, bool > insert(const value_type &); + std::pair< iterator, bool > insert(const nonconst_value_type &); + std::pair< iterator, bool > insert(nonconst_value_type &&); + std::pair< iterator, bool > insert(movable_value_type &&); + std::pair< iterator, bool > insert(value_type &&); + iterator insert(const_iterator, const value_type &); + iterator insert(const_iterator, nonconst_value_type &&); + iterator insert(const_iterator, movable_value_type &&); + iterator insert(const_iterator, const nonconst_value_type &); + iterator insert(const_iterator, value_type &&); + template<typename InputIterator> void insert(InputIterator, InputIterator); + void insert(std::initializer_list< value_type >); + template<class... Args> std::pair< iterator, bool > emplace(Args &&...); + template<class... Args> iterator emplace_hint(const_iterator, Args &&...); + iterator erase(const_iterator) noexcept; + size_type erase(const key_type &) noexcept; + iterator erase(const_iterator, const_iterator) noexcept; + void swap(map &) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_swappable< Compare >::value)); + key_compare key_comp() const; + value_compare value_comp() const; + iterator find(const key_type &); + const_iterator find(const key_type &) const; + size_type count(const key_type &) const; + iterator lower_bound(const key_type &); + const_iterator lower_bound(const key_type &) const; + iterator upper_bound(const key_type &); + const_iterator upper_bound(const key_type &) const; + std::pair< iterator, iterator > equal_range(const key_type &); std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; - void rebalance(); + equal_range(const key_type &) const; + void rebalance(); - // friend functions - friend bool operator==(const map &, const map &); - friend bool operator!=(const map &, const map &); - friend bool operator<(const map &, const map &); - friend bool operator>(const map &, const map &); - friend bool operator<=(const map &, const map &); - friend bool operator>=(const map &, const map &); - friend void swap(map &, map &); + // friend functions + friend bool operator==(const map &, const map &); + friend bool operator!=(const map &, const map &); + friend bool operator<(const map &, const map &); + friend bool operator>(const map &, const map &); + friend bool operator<=(const map &, const map &); + friend bool operator>=(const map &, const map &); + friend void swap(map &, map &); };
    -

    Description

    +

    Description

    A map is a kind of associative container that supports unique keys (contains at most one of each key value) and provides for fast retrieval of values of another type T based on the keys. The map class supports bidirectional iterators.

    A map satisfies all of the requirements of a container and of a reversible container and of an associative container. The value_type stored by this container is the value_type is std::pair<const Key, T>.

    -

    Template Parameters

    +

    Template Parameters

    1. typename Key
      @@ -181,30 +181,30 @@
    -

    +

    map public construct/copy/destruct

    1. -
      map();
      +
      map();

      Effects: Default constructs an empty map.

      Complexity: Constant.

    2. -
      explicit map(const Compare & comp, 
+
      explicit map(const Compare & comp, 
              const allocator_type & a = allocator_type());
      
 
      Effects: Constructs an empty map using the specified comparison object and allocator.
      
 
      Complexity: Constant.
    3. -
      explicit map(const allocator_type & a);
      +
      explicit map(const allocator_type & a);

      Effects: Constructs an empty map using the specified allocator.

      Complexity: Constant. 

    4. template<typename InputIterator> 
-  map(InputIterator first, InputIterator last, 
+  map(InputIterator first, InputIterator last, 
       const Compare & comp = Compare(), 
       const allocator_type & a = allocator_type());

      Effects: Constructs an empty map using the specified comparison object and allocator, and inserts elements from the range [first ,last ).

      @@ -212,13 +212,13 @@ 
    5. template<typename InputIterator> 
-  map(InputIterator first, InputIterator last, const allocator_type & a);
      + map(InputIterator first, InputIterator last, const allocator_type & a);

      Effects: Constructs an empty map using the specified allocator, and inserts elements from the range [first ,last ).

      Complexity: Linear in N if the range [first ,last ) is already sorted using comp and otherwise N logN, where N is last - first. 

    6. template<typename InputIterator> 
-  map(ordered_unique_range_t, InputIterator first, InputIterator last, 
+  map(ordered_unique_range_t, InputIterator first, InputIterator last, 
       const Compare & comp = Compare(), 
       const allocator_type & a = allocator_type());

      Effects: Constructs an empty map using the specified comparison object and allocator, and inserts elements from the ordered unique range [first ,last). This function is more efficient than the normal range creation for ordered ranges.

      @@ -227,18 +227,18 @@

      Note: Non-standard extension.

    7. -
      map(std::initializer_list< value_type > il, const Compare & comp = Compare(), 
+
      map(std::initializer_list< value_type > il, const Compare & comp = Compare(), 
     const allocator_type & a = allocator_type());
      
 
      Effects: Constructs an empty map using the specified comparison object and allocator, and inserts elements from the range [il.begin(), il.end()).
      
 
      Complexity: Linear in N if the range [first ,last ) is already sorted using comp and otherwise N logN, where N is il.first() - il.end().
    8. -
      map(std::initializer_list< value_type > il, const allocator_type & a);
      +
      map(std::initializer_list< value_type > il, const allocator_type & a);

      Effects: Constructs an empty map using the specified allocator, and inserts elements from the range [il.begin(), il.end()).

      Complexity: Linear in N if the range [first ,last ) is already sorted using comp and otherwise N logN, where N is il.first() - il.end().

    9. -
      map(ordered_unique_range_t, std::initializer_list< value_type > il, 
+
      map(ordered_unique_range_t, std::initializer_list< value_type > il, 
     const Compare & comp = Compare(), 
     const allocator_type & a = allocator_type());
      
 
      Effects: Constructs an empty set using the specified comparison object and allocator, and inserts elements from the ordered unique range [il.begin(), il.end()). This function is more efficient than the normal range creation for ordered ranges.
      
@@ -247,282 +247,282 @@
 
      Note: Non-standard extension.
    10. -
      map(const map & x);
      +
      map(const map & x);

      Effects: Copy constructs a map.

      Complexity: Linear in x.size().

    11. -
      map(map && x);
      +
      map(map && x);

      Effects: Move constructs a map. Constructs *this using x's resources.

      Complexity: Constant.

      Postcondition: x is emptied.

    12. -
      map(const map & x, const allocator_type & a);
      +
      map(const map & x, const allocator_type & a);

      Effects: Copy constructs a map using the specified allocator.

      Complexity: Linear in x.size().

    13. -
      map(map && x, const allocator_type & a);
      +
      map(map && x, const allocator_type & a);

      Effects: Move constructs a map using the specified allocator. Constructs *this using x's resources.

      Complexity: Constant if x == x.get_allocator(), linear otherwise.

      Postcondition: x is emptied.

    14. -
      map & operator=(const map & x);
      +
      map & operator=(const map & x);

      Effects: Makes *this a copy of x.

      Complexity: Linear in x.size().

    15. -
      map & operator=(map && x) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_move_assignable< Compare >::value));
      +
      map & operator=(map && x) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_move_assignable< Compare >::value));

      Effects: this->swap(x.get()).

      Throws: If allocator_traits_type::propagate_on_container_move_assignment is false and (allocation throws or value_type's move constructor throws)

      Complexity: Constant if allocator_traits_type:: propagate_on_container_move_assignment is true or this->get>allocator() == x.get_allocator(). Linear otherwise.

    16. -
      map & operator=(std::initializer_list< value_type > il);
      +
      map & operator=(std::initializer_list< value_type > il);

      Effects: Assign content of il to *this.

    -

    -map public member functions

    +

    +map public member functions

    1. -
      allocator_type get_allocator() const;
      +
      allocator_type get_allocator() const;

      Effects: Returns a copy of the allocator that was passed to the object's constructor.

      Complexity: Constant.

    2. -
      stored_allocator_type & get_stored_allocator() noexcept;
      +
      stored_allocator_type & get_stored_allocator() noexcept;

      Effects: Returns a reference to the internal allocator.

      Throws: Nothing

      Complexity: Constant.

      Note: Non-standard extension.

    3. -
      const stored_allocator_type & get_stored_allocator() const noexcept;
      +
      const stored_allocator_type & get_stored_allocator() const noexcept;

      Effects: Returns a reference to the internal allocator.

      Throws: Nothing

      Complexity: Constant.

      Note: Non-standard extension.

    4. -
      iterator begin() noexcept;
      +
      iterator begin() noexcept;

      Effects: Returns an iterator to the first element contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    5. -
      const_iterator begin() const noexcept;
      +
      const_iterator begin() const noexcept;

      Effects: Returns a const_iterator to the first element contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    6. -
      const_iterator cbegin() const noexcept;
      +
      const_iterator cbegin() const noexcept;

      Effects: Returns a const_iterator to the first element contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    7. -
      iterator end() noexcept;
      +
      iterator end() noexcept;

      Effects: Returns an iterator to the end of the container.

      Throws: Nothing.

      Complexity: Constant.

    8. -
      const_iterator end() const noexcept;
      +
      const_iterator end() const noexcept;

      Effects: Returns a const_iterator to the end of the container.

      Throws: Nothing.

      Complexity: Constant.

    9. -
      const_iterator cend() const noexcept;
      +
      const_iterator cend() const noexcept;

      Effects: Returns a const_iterator to the end of the container.

      Throws: Nothing.

      Complexity: Constant.

    10. -
      reverse_iterator rbegin() noexcept;
      +
      reverse_iterator rbegin() noexcept;

      Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    11. -
      const_reverse_iterator rbegin() const noexcept;
      +
      const_reverse_iterator rbegin() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    12. -
      const_reverse_iterator crbegin() const noexcept;
      +
      const_reverse_iterator crbegin() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    13. -
      reverse_iterator rend() noexcept;
      +
      reverse_iterator rend() noexcept;

      Effects: Returns a reverse_iterator pointing to the end of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    14. -
      const_reverse_iterator rend() const noexcept;
      +
      const_reverse_iterator rend() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    15. -
      const_reverse_iterator crend() const noexcept;
      +
      const_reverse_iterator crend() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    16. -
      bool empty() const noexcept;
      +
      bool empty() const noexcept;

      Effects: Returns true if the container contains no elements.

      Throws: Nothing.

      Complexity: Constant.

    17. -
      size_type size() const noexcept;
      +
      size_type size() const noexcept;

      Effects: Returns the number of the elements contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    18. -
      size_type max_size() const noexcept;
      +
      size_type max_size() const noexcept;

      Effects: Returns the largest possible size of the container.

      Throws: Nothing.

      Complexity: Constant.

    19. -
      mapped_type & operator[](const key_type & k);
      +
      mapped_type & operator[](const key_type & k);

      Effects: If there is no key equivalent to x in the map, inserts value_type(x, T()) into the map.

      Returns: A reference to the mapped_type corresponding to x in *this.

      Complexity: Logarithmic.

    20. -
      mapped_type & operator[](key_type && k);
      +
      mapped_type & operator[](key_type && k);

      Effects: If there is no key equivalent to x in the map, inserts value_type(boost::move(x), T()) into the map (the key is move-constructed)

      Returns: A reference to the mapped_type corresponding to x in *this.

      Complexity: Logarithmic.

    21. -
      T & at(const key_type & k);
      +
      T & at(const key_type & k);

      Returns: A reference to the element whose key is equivalent to x. Throws: An exception object of type out_of_range if no such element is present. Complexity: logarithmic.

    22. -
      const T & at(const key_type & k) const;
      +
      const T & at(const key_type & k) const;

      Returns: A reference to the element whose key is equivalent to x. Throws: An exception object of type out_of_range if no such element is present. Complexity: logarithmic.

    23. -
      std::pair< iterator, bool > insert(const value_type & x);
      +
      std::pair< iterator, bool > insert(const value_type & x);

      Effects: Inserts x if and only if there is no element in the container with key equivalent to the key of x.

      Returns: The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of x.

      Complexity: Logarithmic.

    24. -
      std::pair< iterator, bool > insert(const nonconst_value_type & x);
      +
      std::pair< iterator, bool > insert(const nonconst_value_type & x);

      Effects: Inserts a new value_type created from the pair if and only if there is no element in the container with key equivalent to the key of x.

      Returns: The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of x.

      Complexity: Logarithmic.

    25. -
      std::pair< iterator, bool > insert(nonconst_value_type && x);
      +
      std::pair< iterator, bool > insert(nonconst_value_type && x);

      Effects: Inserts a new value_type move constructed from the pair if and only if there is no element in the container with key equivalent to the key of x.

      Returns: The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of x.

      Complexity: Logarithmic.

    26. -
      std::pair< iterator, bool > insert(movable_value_type && x);
      +
      std::pair< iterator, bool > insert(movable_value_type && x);

      Effects: Inserts a new value_type move constructed from the pair if and only if there is no element in the container with key equivalent to the key of x.

      Returns: The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of x.

      Complexity: Logarithmic.

    27. -
      std::pair< iterator, bool > insert(value_type && x);
      +
      std::pair< iterator, bool > insert(value_type && x);

      Effects: Move constructs a new value from x if and only if there is no element in the container with key equivalent to the key of x.

      Returns: The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of x.

      Complexity: Logarithmic.

    28. -
      iterator insert(const_iterator p, const value_type & x);
      +
      iterator insert(const_iterator p, const value_type & x);

      Effects: Inserts a copy of x in the container if and only if there is no element in the container with key equivalent to the key of x. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic in general, but amortized constant if t is inserted right before p.

    29. -
      iterator insert(const_iterator p, nonconst_value_type && x);
      +
      iterator insert(const_iterator p, nonconst_value_type && x);

      Effects: Move constructs a new value from x if and only if there is no element in the container with key equivalent to the key of x. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic in general, but amortized constant if t is inserted right before p.

    30. -
      iterator insert(const_iterator p, movable_value_type && x);
      +
      iterator insert(const_iterator p, movable_value_type && x);

      Effects: Move constructs a new value from x if and only if there is no element in the container with key equivalent to the key of x. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic in general, but amortized constant if t is inserted right before p.

    31. -
      iterator insert(const_iterator p, const nonconst_value_type & x);
      +
      iterator insert(const_iterator p, const nonconst_value_type & x);

      Effects: Inserts a copy of x in the container. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic.

    32. -
      iterator insert(const_iterator p, value_type && x);
      +
      iterator insert(const_iterator p, value_type && x);

      Effects: Inserts an element move constructed from x in the container. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic. 

    33. template<typename InputIterator> 
-  void insert(InputIterator first, InputIterator last);
      + void insert(InputIterator first, InputIterator last);

      Requires: first, last are not iterators into *this.

      Effects: inserts each element from the range [first,last) if and only if there is no element with key equivalent to the key of that element.

      Complexity: At most N log(size()+N) (N is the distance from first to last)

    34. -
      void insert(std::initializer_list< value_type > il);
      +
      void insert(std::initializer_list< value_type > il);

      Effects: inserts each element from the range [il.begin(), il.end()) if and only if there is no element with key equivalent to the key of that element.

      Complexity: At most N log(size()+N) (N is the distance from il.begin() to il.end())

    35. -
      template<class... Args> std::pair< iterator, bool > emplace(Args &&... args);
      +
      template<class... Args> std::pair< iterator, bool > emplace(Args &&... args);

      Effects: Inserts an object x of type T constructed with std::forward<Args>(args)... in the container if and only if there is no element in the container with an equivalent key. p is a hint pointing to where the insert should start to search.

      Returns: The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of x.

      Complexity: Logarithmic in general, but amortized constant if t is inserted right before p. 

    36. template<class... Args> 
-  iterator emplace_hint(const_iterator p, Args &&... args);
      + iterator emplace_hint(const_iterator p, Args &&... args);

      Effects: Inserts an object of type T constructed with std::forward<Args>(args)... in the container if and only if there is no element in the container with an equivalent key. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic in general, but amortized constant if t is inserted right before p.

    37. -
      iterator erase(const_iterator p) noexcept;
      +
      iterator erase(const_iterator p) noexcept;

      Effects: Erases the element pointed to by p.

      Returns: Returns an iterator pointing to the element immediately following q prior to the element being erased. If no such element exists, returns end().

      Complexity: Amortized constant time

    38. -
      size_type erase(const key_type & x) noexcept;
      +
      size_type erase(const key_type & x) noexcept;

      Effects: Erases all elements in the container with key equivalent to x.

      Returns: Returns the number of erased elements.

      Complexity: log(size()) + count(k)

    39. -
      iterator erase(const_iterator first, const_iterator last) noexcept;
      +
      iterator erase(const_iterator first, const_iterator last) noexcept;

      Effects: Erases all the elements in the range [first, last).

      Returns: Returns last.

      Complexity: log(size())+N where N is the distance from first to last.

    40. -
      void swap(map & x) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_swappable< Compare >::value));
      +
      void swap(map & x) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_swappable< Compare >::value));

      Effects: Swaps the contents of *this and x.

      Throws: Nothing.

      Complexity: Constant. Effects: erase(a.begin(),a.end()).

      @@ -530,104 +530,104 @@

      Complexity: linear in size().

    41. -
      key_compare key_comp() const;
      +
      key_compare key_comp() const;

      Effects: Returns the comparison object out of which a was constructed.

      Complexity: Constant.

    42. -
      value_compare value_comp() const;
      +
      value_compare value_comp() const;

      Effects: Returns an object of value_compare constructed out of the comparison object.

      Complexity: Constant.

    43. -
      iterator find(const key_type & x);
      +
      iterator find(const key_type & x);

      Returns: An iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.

      Complexity: Logarithmic.

    44. -
      const_iterator find(const key_type & x) const;
      +
      const_iterator find(const key_type & x) const;

      Returns: A const_iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.

      Complexity: Logarithmic.

    45. -
      size_type count(const key_type & x) const;
      +
      size_type count(const key_type & x) const;

      Returns: The number of elements with key equivalent to x.

      Complexity: log(size())+count(k)

    46. -
      iterator lower_bound(const key_type & x);
      +
      iterator lower_bound(const key_type & x);

      Returns: An iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.

      Complexity: Logarithmic

    47. -
      const_iterator lower_bound(const key_type & x) const;
      +
      const_iterator lower_bound(const key_type & x) const;

      Returns: A const iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.

      Complexity: Logarithmic

    48. -
      iterator upper_bound(const key_type & x);
      +
      iterator upper_bound(const key_type & x);

      Returns: An iterator pointing to the first element with key not less than x, or end() if such an element is not found.

      Complexity: Logarithmic

    49. -
      const_iterator upper_bound(const key_type & x) const;
      +
      const_iterator upper_bound(const key_type & x) const;

      Returns: A const iterator pointing to the first element with key not less than x, or end() if such an element is not found.

      Complexity: Logarithmic

    50. -
      std::pair< iterator, iterator > equal_range(const key_type & x);
      +
      std::pair< iterator, iterator > equal_range(const key_type & x);

      Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).

      Complexity: Logarithmic 

    51. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & x) const;
      +equal_range(const key_type & x) const;

      Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).

      Complexity: Logarithmic

    52. -
      void rebalance();
      +
      void rebalance();

      Effects: Rebalances the tree. It's a no-op for Red-Black and AVL trees.

      Complexity: Linear

    -

    -map friend functions

    +

    +map friend functions

    1. -
      friend bool operator==(const map & x, const map & y);
      +
      friend bool operator==(const map & x, const map & y);

      Effects: Returns true if x and y are equal

      Complexity: Linear to the number of elements in the container.

    2. -
      friend bool operator!=(const map & x, const map & y);
      +
      friend bool operator!=(const map & x, const map & y);

      Effects: Returns true if x and y are unequal

      Complexity: Linear to the number of elements in the container.

    3. -
      friend bool operator<(const map & x, const map & y);
      +
      friend bool operator<(const map & x, const map & y);

      Effects: Returns true if x is less than y

      Complexity: Linear to the number of elements in the container.

    4. -
      friend bool operator>(const map & x, const map & y);
      +
      friend bool operator>(const map & x, const map & y);

      Effects: Returns true if x is greater than y

      Complexity: Linear to the number of elements in the container.

    5. -
      friend bool operator<=(const map & x, const map & y);
      +
      friend bool operator<=(const map & x, const map & y);

      Effects: Returns true if x is equal or less than y

      Complexity: Linear to the number of elements in the container.

    6. -
      friend bool operator>=(const map & x, const map & y);
      +
      friend bool operator>=(const map & x, const map & y);

      Effects: Returns true if x is equal or greater than y

      Complexity: Linear to the number of elements in the container.

    7. -
      friend void swap(map & x, map & y);
      +
      friend void swap(map & x, map & y);

      Effects: x.swap(y)

      Complexity: Constant.

      8. @@ -637,7 +637,7 @@
    -
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -645,7 +645,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/container/multimap.html b/doc/html/boost/container/multimap.html index 2addbaecb1..72fd3e6808 100644 --- a/doc/html/boost/container/multimap.html +++ b/doc/html/boost/container/multimap.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -59,100 +59,100 @@ typedef implementation_defined movable_value_type; // construct/copy/destruct - multimap(); - explicit multimap(const Compare &, + multimap(); + explicit multimap(const Compare &, const allocator_type & = allocator_type()); - explicit multimap(const allocator_type &); + explicit multimap(const allocator_type &); template<typename InputIterator> - multimap(InputIterator, InputIterator, const Compare & = Compare(), + multimap(InputIterator, InputIterator, const Compare & = Compare(), const allocator_type & = allocator_type()); template<typename InputIterator> - multimap(InputIterator, InputIterator, const allocator_type &); + multimap(InputIterator, InputIterator, const allocator_type &); template<typename InputIterator> - multimap(ordered_range_t, InputIterator, InputIterator, + multimap(ordered_range_t, InputIterator, InputIterator, const Compare & = Compare(), const allocator_type & = allocator_type()); - multimap(std::initializer_list< value_type >, const Compare & = Compare(), + multimap(std::initializer_list< value_type >, const Compare & = Compare(), const allocator_type & = allocator_type()); - multimap(std::initializer_list< value_type >, const allocator_type &); - multimap(ordered_range_t, std::initializer_list< value_type >, + multimap(std::initializer_list< value_type >, const allocator_type &); + multimap(ordered_range_t, std::initializer_list< value_type >, const Compare & = Compare(), const allocator_type & = allocator_type()); - multimap(const multimap &); - multimap(multimap &&); - multimap(const multimap &, const allocator_type &); - multimap(multimap &&, const allocator_type &); - multimap & operator=(const multimap &); - multimap & operator=(multimap &&) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_move_assignable< Compare >::value)); - multimap & operator=(std::initializer_list< value_type >); + multimap(const multimap &); + multimap(multimap &&); + multimap(const multimap &, const allocator_type &); + multimap(multimap &&, const allocator_type &); + multimap & operator=(const multimap &); + multimap & operator=(multimap &&) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_move_assignable< Compare >::value)); + multimap & operator=(std::initializer_list< value_type >); - // public member functions - allocator_type get_allocator() const; - stored_allocator_type & get_stored_allocator(); - const stored_allocator_type & get_stored_allocator() const; - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end() noexcept; - const_iterator end() const noexcept; - const_iterator cend() const noexcept; - reverse_iterator rbegin() noexcept; - const_reverse_iterator rbegin() const noexcept; - const_reverse_iterator crbegin() const noexcept; - reverse_iterator rend() noexcept; - const_reverse_iterator rend() const noexcept; - const_reverse_iterator crend() const noexcept; - bool empty() const; - size_type size() const; - size_type max_size() const; - template<class... Args> iterator emplace(Args &&...); - template<class... Args> iterator emplace_hint(const_iterator, Args &&...); - iterator insert(const value_type &); - iterator insert(const nonconst_value_type &); - iterator insert(nonconst_value_type &&); - iterator insert(movable_value_type &&); - iterator insert(const_iterator, const value_type &); - iterator insert(const_iterator, const nonconst_value_type &); - iterator insert(const_iterator, nonconst_value_type &&); - iterator insert(const_iterator, movable_value_type &&); - template<typename InputIterator> void insert(InputIterator, InputIterator); - void insert(std::initializer_list< value_type >); - iterator erase(const_iterator); - size_type erase(const key_type &); - iterator erase(const_iterator, const_iterator); - void swap(multiset &) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_swappable< Compare >::value)); - void clear() noexcept; - key_compare key_comp() const; - value_compare value_comp() const; - iterator find(const key_type &); - const_iterator find(const key_type &) const; - size_type count(const key_type &) const; - iterator lower_bound(const key_type &); - const_iterator lower_bound(const key_type &) const; - iterator upper_bound(const key_type &); - const_iterator upper_bound(const key_type &) const; - std::pair< iterator, iterator > equal_range(const key_type &); + // public member functions + allocator_type get_allocator() const; + stored_allocator_type & get_stored_allocator(); + const stored_allocator_type & get_stored_allocator() const; + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end() noexcept; + const_iterator end() const noexcept; + const_iterator cend() const noexcept; + reverse_iterator rbegin() noexcept; + const_reverse_iterator rbegin() const noexcept; + const_reverse_iterator crbegin() const noexcept; + reverse_iterator rend() noexcept; + const_reverse_iterator rend() const noexcept; + const_reverse_iterator crend() const noexcept; + bool empty() const; + size_type size() const; + size_type max_size() const; + template<class... Args> iterator emplace(Args &&...); + template<class... Args> iterator emplace_hint(const_iterator, Args &&...); + iterator insert(const value_type &); + iterator insert(const nonconst_value_type &); + iterator insert(nonconst_value_type &&); + iterator insert(movable_value_type &&); + iterator insert(const_iterator, const value_type &); + iterator insert(const_iterator, const nonconst_value_type &); + iterator insert(const_iterator, nonconst_value_type &&); + iterator insert(const_iterator, movable_value_type &&); + template<typename InputIterator> void insert(InputIterator, InputIterator); + void insert(std::initializer_list< value_type >); + iterator erase(const_iterator); + size_type erase(const key_type &); + iterator erase(const_iterator, const_iterator); + void swap(multiset &) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_swappable< Compare >::value)); + void clear() noexcept; + key_compare key_comp() const; + value_compare value_comp() const; + iterator find(const key_type &); + const_iterator find(const key_type &) const; + size_type count(const key_type &) const; + iterator lower_bound(const key_type &); + const_iterator lower_bound(const key_type &) const; + iterator upper_bound(const key_type &); + const_iterator upper_bound(const key_type &) const; + std::pair< iterator, iterator > equal_range(const key_type &); std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; - void rebalance(); + equal_range(const key_type &) const; + void rebalance(); - // friend functions - friend bool operator==(const multimap &, const multimap &); - friend bool operator!=(const multimap &, const multimap &); - friend bool operator<(const multimap &, const multimap &); - friend bool operator>(const multimap &, const multimap &); - friend bool operator<=(const multimap &, const multimap &); - friend bool operator>=(const multimap &, const multimap &); - friend void swap(multimap &, multimap &); + // friend functions + friend bool operator==(const multimap &, const multimap &); + friend bool operator!=(const multimap &, const multimap &); + friend bool operator<(const multimap &, const multimap &); + friend bool operator>(const multimap &, const multimap &); + friend bool operator<=(const multimap &, const multimap &); + friend bool operator>=(const multimap &, const multimap &); + friend void swap(multimap &, multimap &); };
    -

    Description

    +

    Description

    A multimap is a kind of associative container that supports equivalent keys (possibly containing multiple copies of the same key value) and provides for fast retrieval of values of another type T based on the keys. The multimap class supports bidirectional iterators.

    A multimap satisfies all of the requirements of a container and of a reversible container and of an associative container. The value_type stored by this container is the value_type is std::pair<const Key, T>.

    -

    Template Parameters

    +

    Template Parameters

    1. typename Key
      @@ -174,30 +174,30 @@
    -

    +

    multimap public construct/copy/destruct

    1. -
      multimap();
      +
      multimap();

      Effects: Default constructs an empty multimap.

      Complexity: Constant.

    2. -
      explicit multimap(const Compare & comp, 
+
      explicit multimap(const Compare & comp, 
                   const allocator_type & a = allocator_type());
      
 
      Effects: Constructs an empty multimap using the specified allocator.
      
 
      Complexity: Constant.
    3. -
      explicit multimap(const allocator_type & a);
      +
      explicit multimap(const allocator_type & a);

      Effects: Constructs an empty multimap using the specified comparison object and allocator.

      Complexity: Constant. 

    4. template<typename InputIterator> 
-  multimap(InputIterator first, InputIterator last, 
+  multimap(InputIterator first, InputIterator last, 
            const Compare & comp = Compare(), 
            const allocator_type & a = allocator_type());

      Effects: Constructs an empty multimap using the specified comparison object and allocator, and inserts elements from the range [first ,last ).

      @@ -205,13 +205,13 @@ 
    5. template<typename InputIterator> 
-  multimap(InputIterator first, InputIterator last, const allocator_type & a);
      + multimap(InputIterator first, InputIterator last, const allocator_type & a);

      Effects: Constructs an empty multimap using the specified allocator, and inserts elements from the range [first ,last ).

      Complexity: Linear in N if the range [first ,last ) is already sorted using comp and otherwise N logN, where N is last - first. 

    6. template<typename InputIterator> 
-  multimap(ordered_range_t, InputIterator first, InputIterator last, 
+  multimap(ordered_range_t, InputIterator first, InputIterator last, 
            const Compare & comp = Compare(), 
            const allocator_type & a = allocator_type());

      Effects: Constructs an empty multimap using the specified comparison object and allocator, and inserts elements from the ordered range [first ,last). This function is more efficient than the normal range creation for ordered ranges.

      @@ -220,19 +220,19 @@

      Note: Non-standard extension.

    7. -
      multimap(std::initializer_list< value_type > il, 
+
      multimap(std::initializer_list< value_type > il, 
          const Compare & comp = Compare(), 
          const allocator_type & a = allocator_type());
      
 
      Effects: Constructs an empty multimap using the specified comparison object and allocator, and inserts elements from the range [il.begin(), il.end()).
      
 
      Complexity: Linear in N if the range [first ,last ) is already sorted using comp and otherwise N logN, where N is il.first() - il.end().
    8. -
      multimap(std::initializer_list< value_type > il, const allocator_type & a);
      +
      multimap(std::initializer_list< value_type > il, const allocator_type & a);

      Effects: Constructs an empty multimap using the specified allocator, and inserts elements from the range [il.begin(), il.end()).

      Complexity: Linear in N if the range [first ,last ) is already sorted using comp and otherwise N logN, where N is il.first() - il.end().

    9. -
      multimap(ordered_range_t, std::initializer_list< value_type > il, 
+
      multimap(ordered_range_t, std::initializer_list< value_type > il, 
          const Compare & comp = Compare(), 
          const allocator_type & a = allocator_type());
      
 
      Effects: Constructs an empty set using the specified comparison object and allocator, and inserts elements from the ordered range [il.begin(), il.end()). This function is more efficient than the normal range creation for ordered ranges.
      
@@ -241,353 +241,353 @@
 
      Note: Non-standard extension.
    10. -
      multimap(const multimap & x);
      +
      multimap(const multimap & x);

      Effects: Copy constructs a multimap.

      Complexity: Linear in x.size().

    11. -
      multimap(multimap && x);
      +
      multimap(multimap && x);

      Effects: Move constructs a multimap. Constructs *this using x's resources.

      Complexity: Constant.

      Postcondition: x is emptied.

    12. -
      multimap(const multimap & x, const allocator_type & a);
      +
      multimap(const multimap & x, const allocator_type & a);

      Effects: Copy constructs a multimap.

      Complexity: Linear in x.size().

    13. -
      multimap(multimap && x, const allocator_type & a);
      +
      multimap(multimap && x, const allocator_type & a);

      Effects: Move constructs a multimap using the specified allocator. Constructs *this using x's resources. Complexity: Constant if a == x.get_allocator(), linear otherwise.

      Postcondition: x is emptied.

    14. -
      multimap & operator=(const multimap & x);
      +
      multimap & operator=(const multimap & x);

      Effects: Makes *this a copy of x.

      Complexity: Linear in x.size().

    15. -
      multimap & operator=(multimap && x) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_move_assignable< Compare >::value));
      +
      multimap & operator=(multimap && x) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_move_assignable< Compare >::value));

      Effects: this->swap(x.get()).

      Complexity: Constant.

    16. -
      multimap & operator=(std::initializer_list< value_type > il);
      +
      multimap & operator=(std::initializer_list< value_type > il);

      Effects: Assign content of il to *this.

    -

    -multimap public member functions

    +

    +multimap public member functions

    1. -
      allocator_type get_allocator() const;
      +
      allocator_type get_allocator() const;

      Effects: Returns a copy of the allocator that was passed to the object's constructor.

      Complexity: Constant.

    2. -
      stored_allocator_type & get_stored_allocator();
      +
      stored_allocator_type & get_stored_allocator();

      Effects: Returns a reference to the internal allocator.

      Throws: Nothing

      Complexity: Constant.

      Note: Non-standard extension.

    3. -
      const stored_allocator_type & get_stored_allocator() const;
      +
      const stored_allocator_type & get_stored_allocator() const;

      Effects: Returns a reference to the internal allocator.

      Throws: Nothing

      Complexity: Constant.

      Note: Non-standard extension.

    4. -
      iterator begin();
      +
      iterator begin();

      Effects: Returns an iterator to the first element contained in the container.

      Throws: Nothing.

      Complexity: Constant

    5. -
      const_iterator begin() const;
      +
      const_iterator begin() const;

      Effects: Returns a const_iterator to the first element contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    6. -
      const_iterator cbegin() const;
      +
      const_iterator cbegin() const;

      Effects: Returns a const_iterator to the first element contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    7. -
      iterator end() noexcept;
      +
      iterator end() noexcept;

      Effects: Returns an iterator to the end of the container.

      Throws: Nothing.

      Complexity: Constant.

    8. -
      const_iterator end() const noexcept;
      +
      const_iterator end() const noexcept;

      Effects: Returns a const_iterator to the end of the container.

      Throws: Nothing.

      Complexity: Constant.

    9. -
      const_iterator cend() const noexcept;
      +
      const_iterator cend() const noexcept;

      Effects: Returns a const_iterator to the end of the container.

      Throws: Nothing.

      Complexity: Constant.

    10. -
      reverse_iterator rbegin() noexcept;
      +
      reverse_iterator rbegin() noexcept;

      Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    11. -
      const_reverse_iterator rbegin() const noexcept;
      +
      const_reverse_iterator rbegin() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    12. -
      const_reverse_iterator crbegin() const noexcept;
      +
      const_reverse_iterator crbegin() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    13. -
      reverse_iterator rend() noexcept;
      +
      reverse_iterator rend() noexcept;

      Effects: Returns a reverse_iterator pointing to the end of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    14. -
      const_reverse_iterator rend() const noexcept;
      +
      const_reverse_iterator rend() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    15. -
      const_reverse_iterator crend() const noexcept;
      +
      const_reverse_iterator crend() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    16. -
      bool empty() const;
      +
      bool empty() const;

      Effects: Returns true if the container contains no elements.

      Throws: Nothing.

      Complexity: Constant.

    17. -
      size_type size() const;
      +
      size_type size() const;

      Effects: Returns the number of the elements contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    18. -
      size_type max_size() const;
      +
      size_type max_size() const;

      Effects: Returns the largest possible size of the container.

      Throws: Nothing.

      Complexity: Constant.

    19. -
      template<class... Args> iterator emplace(Args &&... args);
      +
      template<class... Args> iterator emplace(Args &&... args);

      Effects: Inserts an object of type T constructed with std::forward<Args>(args)... in the container. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic in general, but amortized constant if t is inserted right before p. 

    20. template<class... Args> 
-  iterator emplace_hint(const_iterator p, Args &&... args);
      + iterator emplace_hint(const_iterator p, Args &&... args);

      Effects: Inserts an object of type T constructed with std::forward<Args>(args)... in the container. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic in general, but amortized constant if t is inserted right before p.

    21. -
      iterator insert(const value_type & x);
      +
      iterator insert(const value_type & x);

      Effects: Inserts x and returns the iterator pointing to the newly inserted element.

      Complexity: Logarithmic.

    22. -
      iterator insert(const nonconst_value_type & x);
      +
      iterator insert(const nonconst_value_type & x);

      Effects: Inserts a new value constructed from x and returns the iterator pointing to the newly inserted element.

      Complexity: Logarithmic.

    23. -
      iterator insert(nonconst_value_type && x);
      +
      iterator insert(nonconst_value_type && x);

      Effects: Inserts a new value move-constructed from x and returns the iterator pointing to the newly inserted element.

      Complexity: Logarithmic.

    24. -
      iterator insert(movable_value_type && x);
      +
      iterator insert(movable_value_type && x);

      Effects: Inserts a new value move-constructed from x and returns the iterator pointing to the newly inserted element.

      Complexity: Logarithmic.

    25. -
      iterator insert(const_iterator p, const value_type & x);
      +
      iterator insert(const_iterator p, const value_type & x);

      Effects: Inserts a copy of x in the container. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic in general, but amortized constant if t is inserted right before p.

    26. -
      iterator insert(const_iterator p, const nonconst_value_type & x);
      +
      iterator insert(const_iterator p, const nonconst_value_type & x);

      Effects: Inserts a new value constructed from x in the container. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic in general, but amortized constant if t is inserted right before p.

    27. -
      iterator insert(const_iterator p, nonconst_value_type && x);
      +
      iterator insert(const_iterator p, nonconst_value_type && x);

      Effects: Inserts a new value move constructed from x in the container. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic in general, but amortized constant if t is inserted right before p.

    28. -
      iterator insert(const_iterator p, movable_value_type && x);
      +
      iterator insert(const_iterator p, movable_value_type && x);

      Effects: Inserts a new value move constructed from x in the container. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic in general, but amortized constant if t is inserted right before p. 

    29. template<typename InputIterator> 
-  void insert(InputIterator first, InputIterator last);
      + void insert(InputIterator first, InputIterator last);

      Requires: first, last are not iterators into *this.

      Effects: inserts each element from the range [first,last) .

      Complexity: At most N log(size()+N) (N is the distance from first to last)

    30. -
      void insert(std::initializer_list< value_type > il);
      +
      void insert(std::initializer_list< value_type > il);

      Effects: inserts each element from the range [il.begin(), il.end().

      Complexity: At most N log(size()+N) (N is the distance from il.begin() to il.end())

    31. -
      iterator erase(const_iterator p);
      +
      iterator erase(const_iterator p);

      Effects: Erases the element pointed to by p.

      Returns: Returns an iterator pointing to the element immediately following q prior to the element being erased. If no such element exists, returns end().

      Complexity: Amortized constant time

    32. -
      size_type erase(const key_type & x);
      +
      size_type erase(const key_type & x);

      Effects: Erases all elements in the container with key equivalent to x.

      Returns: Returns the number of erased elements.

      Complexity: log(size()) + count(k)

    33. -
      iterator erase(const_iterator first, const_iterator last);
      +
      iterator erase(const_iterator first, const_iterator last);

      Effects: Erases all the elements in the range [first, last).

      Returns: Returns last.

      Complexity: log(size())+N where N is the distance from first to last.

    34. -
      void swap(multiset & x) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_swappable< Compare >::value));
      +
      void swap(multiset & x) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_swappable< Compare >::value));

      Effects: Swaps the contents of *this and x.

      Throws: Nothing.

      Complexity: Constant.

    35. -
      void clear() noexcept;
      +
      void clear() noexcept;

      Effects: erase(a.begin(),a.end()).

      Postcondition: size() == 0.

      Complexity: linear in size().

    36. -
      key_compare key_comp() const;
      +
      key_compare key_comp() const;

      Effects: Returns the comparison object out of which a was constructed.

      Complexity: Constant.

    37. -
      value_compare value_comp() const;
      +
      value_compare value_comp() const;

      Effects: Returns an object of value_compare constructed out of the comparison object.

      Complexity: Constant.

    38. -
      iterator find(const key_type & x);
      +
      iterator find(const key_type & x);

      Returns: An iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.

      Complexity: Logarithmic.

    39. -
      const_iterator find(const key_type & x) const;
      +
      const_iterator find(const key_type & x) const;

      Returns: A const iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.

      Complexity: Logarithmic.

    40. -
      size_type count(const key_type & x) const;
      +
      size_type count(const key_type & x) const;

      Returns: The number of elements with key equivalent to x.

      Complexity: log(size())+count(k)

    41. -
      iterator lower_bound(const key_type & x);
      +
      iterator lower_bound(const key_type & x);

      Returns: An iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.

      Complexity: Logarithmic

    42. -
      const_iterator lower_bound(const key_type & x) const;
      +
      const_iterator lower_bound(const key_type & x) const;

      Returns: A const iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.

      Complexity: Logarithmic

    43. -
      iterator upper_bound(const key_type & x);
      +
      iterator upper_bound(const key_type & x);

      Returns: An iterator pointing to the first element with key not less than x, or end() if such an element is not found.

      Complexity: Logarithmic

    44. -
      const_iterator upper_bound(const key_type & x) const;
      +
      const_iterator upper_bound(const key_type & x) const;

      Returns: A const iterator pointing to the first element with key not less than x, or end() if such an element is not found.

      Complexity: Logarithmic

    45. -
      std::pair< iterator, iterator > equal_range(const key_type & x);
      +
      std::pair< iterator, iterator > equal_range(const key_type & x);

      Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).

      Complexity: Logarithmic 

    46. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & x) const;
      +equal_range(const key_type & x) const;

      Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).

      Complexity: Logarithmic

    47. -
      void rebalance();
      +
      void rebalance();

      Effects: Rebalances the tree. It's a no-op for Red-Black and AVL trees.

      Complexity: Linear

    -

    -multimap friend functions

    +

    +multimap friend functions

    1. -
      friend bool operator==(const multimap & x, const multimap & y);
      +
      friend bool operator==(const multimap & x, const multimap & y);

      Effects: Returns true if x and y are equal

      Complexity: Linear to the number of elements in the container.

    2. -
      friend bool operator!=(const multimap & x, const multimap & y);
      +
      friend bool operator!=(const multimap & x, const multimap & y);

      Effects: Returns true if x and y are unequal

      Complexity: Linear to the number of elements in the container.

    3. -
      friend bool operator<(const multimap & x, const multimap & y);
      +
      friend bool operator<(const multimap & x, const multimap & y);

      Effects: Returns true if x is less than y

      Complexity: Linear to the number of elements in the container.

    4. -
      friend bool operator>(const multimap & x, const multimap & y);
      +
      friend bool operator>(const multimap & x, const multimap & y);

      Effects: Returns true if x is greater than y

      Complexity: Linear to the number of elements in the container.

    5. -
      friend bool operator<=(const multimap & x, const multimap & y);
      +
      friend bool operator<=(const multimap & x, const multimap & y);

      Effects: Returns true if x is equal or less than y

      Complexity: Linear to the number of elements in the container.

    6. -
      friend bool operator>=(const multimap & x, const multimap & y);
      +
      friend bool operator>=(const multimap & x, const multimap & y);

      Effects: Returns true if x is equal or greater than y

      Complexity: Linear to the number of elements in the container.

    7. -
      friend void swap(multimap & x, multimap & y);
      +
      friend void swap(multimap & x, multimap & y);

      Effects: x.swap(y)

      Complexity: Constant.

      8. @@ -597,7 +597,7 @@
    -
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -605,7 +605,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/container/multiset.html b/doc/html/boost/container/multiset.html index 111ddc54c7..dd883e222e 100644 --- a/doc/html/boost/container/multiset.html +++ b/doc/html/boost/container/multiset.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -57,96 +57,96 @@ typedef implementation_defined const_reverse_iterator; // construct/copy/destruct - multiset(); - explicit multiset(const Compare &, + multiset(); + explicit multiset(const Compare &, const allocator_type & = allocator_type()); - explicit multiset(const allocator_type &); + explicit multiset(const allocator_type &); template<typename InputIterator> - multiset(InputIterator, InputIterator, const Compare & = Compare(), + multiset(InputIterator, InputIterator, const Compare & = Compare(), const allocator_type & = allocator_type()); template<typename InputIterator> - multiset(InputIterator, InputIterator, const allocator_type &); + multiset(InputIterator, InputIterator, const allocator_type &); template<typename InputIterator> - multiset(ordered_range_t, InputIterator, InputIterator, + multiset(ordered_range_t, InputIterator, InputIterator, const Compare & = Compare(), const allocator_type & = allocator_type()); - multiset(std::initializer_list< value_type >, const Compare & = Compare(), + multiset(std::initializer_list< value_type >, const Compare & = Compare(), const allocator_type & = allocator_type()); - multiset(std::initializer_list< value_type >, const allocator_type &); - multiset(ordered_unique_range_t, std::initializer_list< value_type >, + multiset(std::initializer_list< value_type >, const allocator_type &); + multiset(ordered_unique_range_t, std::initializer_list< value_type >, const Compare & = Compare(), const allocator_type & = allocator_type()); - multiset(const multiset &); - multiset(multiset &&); - multiset(const multiset &, const allocator_type &); - multiset(multiset &&, const allocator_type &); - multiset & operator=(const multiset &); - multiset & operator=(multiset &&) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_move_assignable< Compare >::value)); - multiset & operator=(std::initializer_list< value_type >); + multiset(const multiset &); + multiset(multiset &&); + multiset(const multiset &, const allocator_type &); + multiset(multiset &&, const allocator_type &); + multiset & operator=(const multiset &); + multiset & operator=(multiset &&) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_move_assignable< Compare >::value)); + multiset & operator=(std::initializer_list< value_type >); - // public member functions - allocator_type get_allocator() const; - stored_allocator_type & get_stored_allocator(); - const stored_allocator_type & get_stored_allocator() const; - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end() noexcept; - const_iterator end() const noexcept; - const_iterator cend() const noexcept; - reverse_iterator rbegin() noexcept; - const_reverse_iterator rbegin() const noexcept; - const_reverse_iterator crbegin() const noexcept; - reverse_iterator rend() noexcept; - const_reverse_iterator rend() const noexcept; - const_reverse_iterator crend() const noexcept; - bool empty() const; - size_type size() const; - size_type max_size() const; - template<class... Args> iterator emplace(Args &&...); - template<class... Args> iterator emplace_hint(const_iterator, Args &&...); - iterator insert(const value_type &); - iterator insert(value_type &&); - iterator insert(const_iterator, const value_type &); - iterator insert(const_iterator, value_type &&); - template<typename InputIterator> void insert(InputIterator, InputIterator); - void insert(std::initializer_list< value_type >); - iterator erase(const_iterator); - size_type erase(const key_type &); - iterator erase(const_iterator, const_iterator); - void swap(multiset &) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_swappable< Compare >::value)); - void clear() noexcept; - key_compare key_comp() const; - value_compare value_comp() const; - iterator find(const key_type &); - const_iterator find(const key_type &) const; - size_type count(const key_type &) const; - iterator lower_bound(const key_type &); - const_iterator lower_bound(const key_type &) const; - iterator upper_bound(const key_type &); - const_iterator upper_bound(const key_type &) const; + // public member functions + allocator_type get_allocator() const; + stored_allocator_type & get_stored_allocator(); + const stored_allocator_type & get_stored_allocator() const; + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end() noexcept; + const_iterator end() const noexcept; + const_iterator cend() const noexcept; + reverse_iterator rbegin() noexcept; + const_reverse_iterator rbegin() const noexcept; + const_reverse_iterator crbegin() const noexcept; + reverse_iterator rend() noexcept; + const_reverse_iterator rend() const noexcept; + const_reverse_iterator crend() const noexcept; + bool empty() const; + size_type size() const; + size_type max_size() const; + template<class... Args> iterator emplace(Args &&...); + template<class... Args> iterator emplace_hint(const_iterator, Args &&...); + iterator insert(const value_type &); + iterator insert(value_type &&); + iterator insert(const_iterator, const value_type &); + iterator insert(const_iterator, value_type &&); + template<typename InputIterator> void insert(InputIterator, InputIterator); + void insert(std::initializer_list< value_type >); + iterator erase(const_iterator); + size_type erase(const key_type &); + iterator erase(const_iterator, const_iterator); + void swap(multiset &) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_swappable< Compare >::value)); + void clear() noexcept; + key_compare key_comp() const; + value_compare value_comp() const; + iterator find(const key_type &); + const_iterator find(const key_type &) const; + size_type count(const key_type &) const; + iterator lower_bound(const key_type &); + const_iterator lower_bound(const key_type &) const; + iterator upper_bound(const key_type &); + const_iterator upper_bound(const key_type &) const; std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; - std::pair< iterator, iterator > equal_range(const key_type &); - void rebalance(); + equal_range(const key_type &) const; + std::pair< iterator, iterator > equal_range(const key_type &); + void rebalance(); - // friend functions - friend bool operator==(const multiset &, const multiset &); - friend bool operator!=(const multiset &, const multiset &); - friend bool operator<(const multiset &, const multiset &); - friend bool operator>(const multiset &, const multiset &); - friend bool operator<=(const multiset &, const multiset &); - friend bool operator>=(const multiset &, const multiset &); - friend void swap(multiset &, multiset &); + // friend functions + friend bool operator==(const multiset &, const multiset &); + friend bool operator!=(const multiset &, const multiset &); + friend bool operator<(const multiset &, const multiset &); + friend bool operator>(const multiset &, const multiset &); + friend bool operator<=(const multiset &, const multiset &); + friend bool operator>=(const multiset &, const multiset &); + friend void swap(multiset &, multiset &); };
    -

    Description

    +

    Description

    A multiset is a kind of associative container that supports equivalent keys (possibly contains multiple copies of the same key value) and provides for fast retrieval of the keys themselves. Class multiset supports bidirectional iterators.

    A multiset satisfies all of the requirements of a container and of a reversible container, and of an associative container). multiset also provides most operations described for duplicate keys.

    -

    Template Parameters

    +

    Template Parameters

    1. typename Key
      @@ -167,30 +167,30 @@
    -

    +

    multiset public construct/copy/destruct

    1. -
      multiset();
      +
      multiset();

      Effects: Default constructs an empty set.

      Complexity: Constant.

    2. -
      explicit multiset(const Compare & comp, 
+
      explicit multiset(const Compare & comp, 
                   const allocator_type & a = allocator_type());
      
 
      Effects: Constructs an empty set using the specified comparison object and allocator.
      
 
      Complexity: Constant.
    3. -
      explicit multiset(const allocator_type & a);
      +
      explicit multiset(const allocator_type & a);

      Effects: Constructs an empty set using the specified allocator object.

      Complexity: Constant. 

    4. template<typename InputIterator> 
-  multiset(InputIterator first, InputIterator last, 
+  multiset(InputIterator first, InputIterator last, 
            const Compare & comp = Compare(), 
            const allocator_type & a = allocator_type());

      Effects: Constructs an empty set using the specified comparison object and allocator, and inserts elements from the range [first ,last ).

      @@ -198,13 +198,13 @@ 
    5. template<typename InputIterator> 
-  multiset(InputIterator first, InputIterator last, const allocator_type & a);
      + multiset(InputIterator first, InputIterator last, const allocator_type & a);

      Effects: Constructs an empty set using the specified allocator, and inserts elements from the range [first ,last ).

      Complexity: Linear in N if the range [first ,last ) is already sorted using comp and otherwise N logN, where N is last - first. 

    6. template<typename InputIterator> 
-  multiset(ordered_range_t, InputIterator first, InputIterator last, 
+  multiset(ordered_range_t, InputIterator first, InputIterator last, 
            const Compare & comp = Compare(), 
            const allocator_type & a = allocator_type());

      Effects: Constructs an empty multiset using the specified comparison object and allocator, and inserts elements from the ordered range [first ,last ). This function is more efficient than the normal range creation for ordered ranges.

      @@ -213,19 +213,19 @@

      Note: Non-standard extension.

    7. -
      multiset(std::initializer_list< value_type > il, 
+
      multiset(std::initializer_list< value_type > il, 
          const Compare & comp = Compare(), 
          const allocator_type & a = allocator_type());
      
 
      Effects: Constructs an empty set using the specified comparison object and allocator, and inserts elements from the range [il.begin(), il.end()).
      
 
      Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using comp and otherwise N logN, where N is il.begin() - il.end().
    8. -
      multiset(std::initializer_list< value_type > il, const allocator_type & a);
      +
      multiset(std::initializer_list< value_type > il, const allocator_type & a);

      Effects: Constructs an empty set using the specified allocator, and inserts elements from the range [il.begin(), il.end()).

      Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using comp and otherwise N logN, where N is il.begin() - il.end().

    9. -
      multiset(ordered_unique_range_t, std::initializer_list< value_type > il, 
+
      multiset(ordered_unique_range_t, std::initializer_list< value_type > il, 
          const Compare & comp = Compare(), 
          const allocator_type & a = allocator_type());
      
 
      Effects: Constructs an empty set using the specified comparison object and allocator, and inserts elements from the ordered unique range [il.begin(), il.end()). This function is more efficient than the normal range creation for ordered ranges.
      
@@ -234,316 +234,333 @@
 
      Note: Non-standard extension.
    10. -
      multiset(const multiset & x);
      +
      multiset(const multiset & x);

      Effects: Copy constructs a set.

      Complexity: Linear in x.size().

      11. -
    11. multiset(multiset && x);
      12. -
    12. multiset(const multiset & x, const allocator_type & a);
      13. -
    13. multiset(multiset && x, const allocator_type & a);
    14. -
      multiset & operator=(const multiset & x);
      +
      multiset(multiset && x);
      +

      Effects: Move constructs a set. Constructs *this using x's resources.

      +

      Complexity: Constant.

      +

      Postcondition: x is emptied.

      +
      15. +
    15. +
      multiset(const multiset & x, const allocator_type & a);
      +

      Effects: Copy constructs a set using the specified allocator.

      +

      Complexity: Linear in x.size().

      +
      16. +
    16. +
      multiset(multiset && x, const allocator_type & a);
      +

      Effects: Move constructs a set using the specified allocator. Constructs *this using x's resources.

      +

      Complexity: Constant if a == x.get_allocator(), linear otherwise.

      +
      17. +
    17. +
      multiset & operator=(const multiset & x);

      Effects: Makes *this a copy of x.

      Complexity: Linear in x.size().

    18. -
      multiset & operator=(multiset && x) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_move_assignable< Compare >::value));
      +
      multiset & operator=(multiset && x) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_move_assignable< Compare >::value));

      Effects: this->swap(x.get()).

      Throws: If allocator_traits_type::propagate_on_container_move_assignment is false and (allocation throws or value_type's move constructor throws)

      Complexity: Constant if allocator_traits_type:: propagate_on_container_move_assignment is true or this->get>allocator() == x.get_allocator(). Linear otherwise.

      19. -
    19. multiset & operator=(std::initializer_list< value_type > il);
      20. +
    20. +
      multiset & operator=(std::initializer_list< value_type > il);
      +

      Effects: Copy all elements from il to *this.

      +

      Complexity: Linear in il.size().

      +
    -

    -multiset public member functions

    +

    +multiset public member functions

    1. -
      allocator_type get_allocator() const;
      +
      allocator_type get_allocator() const;

      Effects: Returns a copy of the allocator that was passed to the object's constructor.

      Complexity: Constant.

    2. -
      stored_allocator_type & get_stored_allocator();
      +
      stored_allocator_type & get_stored_allocator();

      Effects: Returns a reference to the internal allocator.

      Throws: Nothing

      Complexity: Constant.

      Note: Non-standard extension.

    3. -
      const stored_allocator_type & get_stored_allocator() const;
      +
      const stored_allocator_type & get_stored_allocator() const;

      Effects: Returns a reference to the internal allocator.

      Throws: Nothing

      Complexity: Constant.

      Note: Non-standard extension.

    4. -
      iterator begin();
      +
      iterator begin();

      Effects: Returns an iterator to the first element contained in the container.

      Throws: Nothing.

      Complexity: Constant

    5. -
      const_iterator begin() const;
      +
      const_iterator begin() const;

      Effects: Returns a const_iterator to the first element contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    6. -
      const_iterator cbegin() const;
      +
      const_iterator cbegin() const;

      Effects: Returns a const_iterator to the first element contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    7. -
      iterator end() noexcept;
      +
      iterator end() noexcept;

      Effects: Returns an iterator to the end of the container.

      Throws: Nothing.

      Complexity: Constant.

    8. -
      const_iterator end() const noexcept;
      +
      const_iterator end() const noexcept;

      Effects: Returns a const_iterator to the end of the container.

      Throws: Nothing.

      Complexity: Constant.

    9. -
      const_iterator cend() const noexcept;
      +
      const_iterator cend() const noexcept;

      Effects: Returns a const_iterator to the end of the container.

      Throws: Nothing.

      Complexity: Constant.

    10. -
      reverse_iterator rbegin() noexcept;
      +
      reverse_iterator rbegin() noexcept;

      Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    11. -
      const_reverse_iterator rbegin() const noexcept;
      +
      const_reverse_iterator rbegin() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    12. -
      const_reverse_iterator crbegin() const noexcept;
      +
      const_reverse_iterator crbegin() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    13. -
      reverse_iterator rend() noexcept;
      +
      reverse_iterator rend() noexcept;

      Effects: Returns a reverse_iterator pointing to the end of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    14. -
      const_reverse_iterator rend() const noexcept;
      +
      const_reverse_iterator rend() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    15. -
      const_reverse_iterator crend() const noexcept;
      +
      const_reverse_iterator crend() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    16. -
      bool empty() const;
      +
      bool empty() const;

      Effects: Returns true if the container contains no elements.

      Throws: Nothing.

      Complexity: Constant.

    17. -
      size_type size() const;
      +
      size_type size() const;

      Effects: Returns the number of the elements contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    18. -
      size_type max_size() const;
      +
      size_type max_size() const;

      Effects: Returns the largest possible size of the container.

      Throws: Nothing.

      Complexity: Constant.

    19. -
      template<class... Args> iterator emplace(Args &&... args);
      +
      template<class... Args> iterator emplace(Args &&... args);

      Effects: Inserts an object of type Key constructed with std::forward<Args>(args)... and returns the iterator pointing to the newly inserted element.

      Complexity: Logarithmic. 

    20. template<class... Args> 
-  iterator emplace_hint(const_iterator p, Args &&... args);
      + iterator emplace_hint(const_iterator p, Args &&... args);

      Effects: Inserts an object of type Key constructed with std::forward<Args>(args)...

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic in general, but amortized constant if t is inserted right before p.

    21. -
      iterator insert(const value_type & x);
      +
      iterator insert(const value_type & x);

      Effects: Inserts x and returns the iterator pointing to the newly inserted element.

      Complexity: Logarithmic.

    22. -
      iterator insert(value_type && x);
      +
      iterator insert(value_type && x);

      Effects: Inserts a copy of x in the container.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic in general, but amortized constant if t is inserted right before p.

    23. -
      iterator insert(const_iterator p, const value_type & x);
      +
      iterator insert(const_iterator p, const value_type & x);

      Effects: Inserts a copy of x in the container. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic in general, but amortized constant if t is inserted right before p.

    24. -
      iterator insert(const_iterator p, value_type && x);
      +
      iterator insert(const_iterator p, value_type && x);

      Effects: Inserts a value move constructed from x in the container. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic in general, but amortized constant if t is inserted right before p. 

    25. template<typename InputIterator> 
-  void insert(InputIterator first, InputIterator last);
      + void insert(InputIterator first, InputIterator last);

      Requires: first, last are not iterators into *this.

      Effects: inserts each element from the range [first,last) .

      Complexity: At most N log(size()+N) (N is the distance from first to last)

    26. -
      void insert(std::initializer_list< value_type > il);
      +
      void insert(std::initializer_list< value_type > il);

      Effects: inserts each element from the range [il.begin(),il.end()) if and only if there is no element with key equivalent to the key of that element.

      Complexity: At most N log(size()+N) (N is the distance from il.begin() to il.end())

    27. -
      iterator erase(const_iterator p);
      +
      iterator erase(const_iterator p);

      Effects: Erases the element pointed to by p.

      Returns: Returns an iterator pointing to the element immediately following q prior to the element being erased. If no such element exists, returns end().

      Complexity: Amortized constant time

    28. -
      size_type erase(const key_type & x);
      +
      size_type erase(const key_type & x);

      Effects: Erases all elements in the container with key equivalent to x.

      Returns: Returns the number of erased elements.

      Complexity: log(size()) + count(k)

    29. -
      iterator erase(const_iterator first, const_iterator last);
      +
      iterator erase(const_iterator first, const_iterator last);

      Effects: Erases all the elements in the range [first, last).

      Returns: Returns last.

      Complexity: log(size())+N where N is the distance from first to last.

    30. -
      void swap(multiset & x) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_swappable< Compare >::value));
      +
      void swap(multiset & x) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_swappable< Compare >::value));

      Effects: Swaps the contents of *this and x.

      Throws: Nothing.

      Complexity: Constant.

    31. -
      void clear() noexcept;
      +
      void clear() noexcept;

      Effects: erase(a.begin(),a.end()).

      Postcondition: size() == 0.

      Complexity: linear in size().

    32. -
      key_compare key_comp() const;
      +
      key_compare key_comp() const;

      Effects: Returns the comparison object out of which a was constructed.

      Complexity: Constant.

    33. -
      value_compare value_comp() const;
      +
      value_compare value_comp() const;

      Effects: Returns an object of value_compare constructed out of the comparison object.

      Complexity: Constant.

    34. -
      iterator find(const key_type & x);
      +
      iterator find(const key_type & x);

      Returns: An iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.

      Complexity: Logarithmic.

    35. -
      const_iterator find(const key_type & x) const;
      +
      const_iterator find(const key_type & x) const;

      Returns: A const_iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.

      Complexity: Logarithmic.

    36. -
      size_type count(const key_type & x) const;
      +
      size_type count(const key_type & x) const;

      Returns: The number of elements with key equivalent to x.

      Complexity: log(size())+count(k)

    37. -
      iterator lower_bound(const key_type & x);
      +
      iterator lower_bound(const key_type & x);

      Returns: An iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.

      Complexity: Logarithmic

    38. -
      const_iterator lower_bound(const key_type & x) const;
      +
      const_iterator lower_bound(const key_type & x) const;

      Returns: A const iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.

      Complexity: Logarithmic

    39. -
      iterator upper_bound(const key_type & x);
      +
      iterator upper_bound(const key_type & x);

      Returns: An iterator pointing to the first element with key not less than x, or end() if such an element is not found.

      Complexity: Logarithmic

    40. -
      const_iterator upper_bound(const key_type & x) const;
      +
      const_iterator upper_bound(const key_type & x) const;

      Returns: A const iterator pointing to the first element with key not less than x, or end() if such an element is not found.

      Complexity: Logarithmic 

    41. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & x) const;
      +equal_range(const key_type & x) const;

      Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).

      Complexity: Logarithmic

    42. -
      std::pair< iterator, iterator > equal_range(const key_type & x);
      +
      std::pair< iterator, iterator > equal_range(const key_type & x);

      Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).

      Complexity: Logarithmic

    43. -
      void rebalance();
      +
      void rebalance();

      Effects: Rebalances the tree. It's a no-op for Red-Black and AVL trees.

      Complexity: Linear

    -

    -multiset friend functions

    +

    +multiset friend functions

    1. -
      friend bool operator==(const multiset & x, const multiset & y);
      +
      friend bool operator==(const multiset & x, const multiset & y);

      Effects: Returns true if x and y are equal

      Complexity: Linear to the number of elements in the container.

    2. -
      friend bool operator!=(const multiset & x, const multiset & y);
      +
      friend bool operator!=(const multiset & x, const multiset & y);

      Effects: Returns true if x and y are unequal

      Complexity: Linear to the number of elements in the container.

    3. -
      friend bool operator<(const multiset & x, const multiset & y);
      +
      friend bool operator<(const multiset & x, const multiset & y);

      Effects: Returns true if x is less than y

      Complexity: Linear to the number of elements in the container.

    4. -
      friend bool operator>(const multiset & x, const multiset & y);
      +
      friend bool operator>(const multiset & x, const multiset & y);

      Effects: Returns true if x is greater than y

      Complexity: Linear to the number of elements in the container.

    5. -
      friend bool operator<=(const multiset & x, const multiset & y);
      +
      friend bool operator<=(const multiset & x, const multiset & y);

      Effects: Returns true if x is equal or less than y

      Complexity: Linear to the number of elements in the container.

    6. -
      friend bool operator>=(const multiset & x, const multiset & y);
      +
      friend bool operator>=(const multiset & x, const multiset & y);

      Effects: Returns true if x is equal or greater than y

      Complexity: Linear to the number of elements in the container.

    7. -
      friend void swap(multiset & x, multiset & y);
      +
      friend void swap(multiset & x, multiset & y);

      Effects: x.swap(y)

      Complexity: Constant.

      8. @@ -553,7 +570,7 @@
    -
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -561,7 +578,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/container/new_allo_idm46583871819392.html b/doc/html/boost/container/new_allo_idm46583871819392.html new file mode 100644 index 0000000000..729b805451 --- /dev/null +++ b/doc/html/boost/container/new_allo_idm46583871819392.html @@ -0,0 +1,117 @@ + + + + +Class new_allocator<void> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Class new_allocator<void>

    +

    boost::container::new_allocator<void> — Specialization of new_allocator for void types.

    +
    +

    Synopsis

    +
    // In header: <boost/container/new_allocator.hpp>
+
+
+class new_allocator<void> {
+public:
+  // types
+  typedef void                   value_type;                            
+  typedef void *                 pointer;                               
+  typedef const void *           const_pointer;                         
+  typedef implementation_defined propagate_on_container_move_assignment;  // A integral constant of type bool with value true. 
+  typedef implementation_defined is_always_equal;                         // A integral constant of type bool with value true. 
+
+  // member classes/structs/unions
+  template<typename T2> 
+  struct rebind {
+    // types
+    typedef new_allocator< T2 > other;
+  };
+
+  // construct/copy/destruct
+  new_allocator() noexcept;
+  new_allocator(const new_allocator &) noexcept;
+  template<typename T2> new_allocator(const new_allocator< T2 > &) noexcept;
+
+  // friend functions
+  friend void swap(new_allocator &, new_allocator &) noexcept;
+  friend bool operator==(const new_allocator &, const new_allocator &) noexcept;
+  friend bool operator!=(const new_allocator &, const new_allocator &) noexcept;
+};
    +
    +

    Description

    +
    +

    +new_allocator + public + construct/copy/destruct

    +
      +
    1. +
      new_allocator() noexcept;
      +

      Default constructor Never throws

      +
      2. +
    2. +
      new_allocator(const new_allocator &) noexcept;
      +

      Constructor from other new_allocator. Never throws

      +
      3. +
    3. +
      template<typename T2> new_allocator(const new_allocator< T2 > &) noexcept;
      +

      Constructor from related new_allocator. Never throws

      +
      4. +
    +
    +
    +

    +new_allocator friend functions

    +
      +
    1. +
      friend void swap(new_allocator &, new_allocator &) noexcept;
      +

      Swaps two allocators, does nothing because this new_allocator is stateless

      +
      2. +
    2. +
      friend bool operator==(const new_allocator &, const new_allocator &) noexcept;
      +

      An new_allocator always compares to true, as memory allocated with one instance can be deallocated by another instance

      +
      3. +
    3. +
      friend bool operator!=(const new_allocator &, const new_allocator &) noexcept;
      +

      An new_allocator always compares to false, as memory allocated with one instance can be deallocated by another instance

      +
      4. +
    +
    +
    +
    + + + +
    Copyright © 2009-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/new_allo_idm46583871819392/rebind.html b/doc/html/boost/container/new_allo_idm46583871819392/rebind.html new file mode 100644 index 0000000000..407c30543a --- /dev/null +++ b/doc/html/boost/container/new_allo_idm46583871819392/rebind.html @@ -0,0 +1,59 @@ + + + + +Struct template rebind + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct template rebind

    +

    boost::container::new_allocator<void>::rebind

    +
    +

    Synopsis

    +
    // In header: <boost/container/new_allocator.hpp>
+
+
+template<typename T2> 
+struct rebind {
+  // types
+  typedef new_allocator< T2 > other;
+};
    +
    +

    Description

    +

    Obtains an new_allocator that allocates objects of type T2

    +
    +
    + + + +
    Copyright © 2009-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/new_allocator.html b/doc/html/boost/container/new_allocator.html index 7b6866c21b..8e6a898b2e 100644 --- a/doc/html/boost/container/new_allocator.html +++ b/doc/html/boost/container/new_allocator.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -43,7 +43,7 @@ typedef const T & const_reference; typedef std::size_t size_type; typedef std::ptrdiff_t difference_type; - typedef implementation_defined propagate_on_container_move_assignment; // A integral constant of type bool with value true. + typedef implementation_defined propagate_on_container_move_assignment; // A integral constant of type bool with value true. typedef implementation_defined is_always_equal; // A integral constant of type bool with value true. // member classes/structs/unions @@ -54,87 +54,87 @@ }; // construct/copy/destruct - new_allocator() noexcept; - new_allocator(const new_allocator &) noexcept; - template<typename T2> new_allocator(const new_allocator< T2 > &) noexcept; + new_allocator() noexcept; + new_allocator(const new_allocator &) noexcept; + template<typename T2> new_allocator(const new_allocator< T2 > &) noexcept; - // public member functions - pointer allocate(size_type); - void deallocate(pointer, size_type) noexcept; - size_type max_size() const noexcept; + // public member functions + pointer allocate(size_type); + void deallocate(pointer, size_type) noexcept; + size_type max_size() const noexcept; - // friend functions - friend void swap(new_allocator &, new_allocator &) noexcept; - friend bool operator==(const new_allocator &, const new_allocator &) noexcept; - friend bool operator!=(const new_allocator &, const new_allocator &) noexcept; + // friend functions + friend void swap(new_allocator &, new_allocator &) noexcept; + friend bool operator==(const new_allocator &, const new_allocator &) noexcept; + friend bool operator!=(const new_allocator &, const new_allocator &) noexcept; };
    -

    Description

    +

    Description

    -

    +

    new_allocator public construct/copy/destruct

    1. -
      new_allocator() noexcept;
      +
      new_allocator() noexcept;

      Default constructor Never throws

    2. -
      new_allocator(const new_allocator &) noexcept;
      +
      new_allocator(const new_allocator &) noexcept;

      Constructor from other new_allocator. Never throws

    3. -
      template<typename T2> new_allocator(const new_allocator< T2 > &) noexcept;
      +
      template<typename T2> new_allocator(const new_allocator< T2 > &) noexcept;

      Constructor from related new_allocator. Never throws

    -

    -new_allocator public member functions

    +

    +new_allocator public member functions

    1. -
      pointer allocate(size_type count);
      +
      pointer allocate(size_type count);

      Allocates memory for an array of count elements. Throws std::bad_alloc if there is no enough memory

    2. -
      void deallocate(pointer ptr, size_type) noexcept;
      +
      void deallocate(pointer ptr, size_type) noexcept;

      Deallocates previously allocated memory. Never throws

    3. -
      size_type max_size() const noexcept;
      +
      size_type max_size() const noexcept;

      Returns the maximum number of elements that could be allocated. Never throws

    -

    -new_allocator friend functions

    +

    +new_allocator friend functions

    1. -
      friend void swap(new_allocator &, new_allocator &) noexcept;
      +
      friend void swap(new_allocator &, new_allocator &) noexcept;

      Swaps two allocators, does nothing because this new_allocator is stateless

    2. -
      friend bool operator==(const new_allocator &, const new_allocator &) noexcept;
      +
      friend bool operator==(const new_allocator &, const new_allocator &) noexcept;

      An new_allocator always compares to true, as memory allocated with one instance can be deallocated by another instance

    3. -
      friend bool operator!=(const new_allocator &, const new_allocator &) noexcept;
      +
      friend bool operator!=(const new_allocator &, const new_allocator &) noexcept;

      An new_allocator always compares to false, as memory allocated with one instance can be deallocated by another instance

    -

    Specializations

    -
    +

    Specializations

    +
    -
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -142,7 +142,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/container/new_allocator/rebind.html b/doc/html/boost/container/new_allocator/rebind.html index c1be44a11f..f216bd8a62 100644 --- a/doc/html/boost/container/new_allocator/rebind.html +++ b/doc/html/boost/container/new_allocator/rebind.html @@ -6,9 +6,9 @@ - + - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -39,13 +39,13 @@ typedef new_allocator< T2 > other; };
    -

    Description

    +

    Description

    Obtains an new_allocator that allocates objects of type T2

    -
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -53,7 +53,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/container/new_allocator__idp59775248.html b/doc/html/boost/container/new_allocator__idp59775248.html deleted file mode 100644 index 423f3b6907..0000000000 --- a/doc/html/boost/container/new_allocator__idp59775248.html +++ /dev/null @@ -1,117 +0,0 @@ - - - - -Class new_allocator<void> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Class new_allocator<void>

    -

    boost::container::new_allocator<void> — Specialization of new_allocator for void types.

    -
    -

    Synopsis

    -
    // In header: <boost/container/new_allocator.hpp>
-
-
-class new_allocator<void> {
-public:
-  // types
-  typedef void                   value_type;                            
-  typedef void *                 pointer;                               
-  typedef const void *           const_pointer;                         
-  typedef implementation_defined propagate_on_container_move_assignment;  // A integral constant of type bool with value true. 
-  typedef implementation_defined is_always_equal;                         // A integral constant of type bool with value true. 
-
-  // member classes/structs/unions
-  template<typename T2> 
-  struct rebind {
-    // types
-    typedef new_allocator< T2 > other;
-  };
-
-  // construct/copy/destruct
-  new_allocator() noexcept;
-  new_allocator(const new_allocator &) noexcept;
-  template<typename T2> new_allocator(const new_allocator< T2 > &) noexcept;
-
-  // friend functions
-  friend void swap(new_allocator &, new_allocator &) noexcept;
-  friend bool operator==(const new_allocator &, const new_allocator &) noexcept;
-  friend bool operator!=(const new_allocator &, const new_allocator &) noexcept;
-};
    -
    -

    Description

    -
    -

    -new_allocator - public - construct/copy/destruct

    -
      -
    1. -
      new_allocator() noexcept;
      -

      Default constructor Never throws

      -
      2. -
    2. -
      new_allocator(const new_allocator &) noexcept;
      -

      Constructor from other new_allocator. Never throws

      -
      3. -
    3. -
      template<typename T2> new_allocator(const new_allocator< T2 > &) noexcept;
      -

      Constructor from related new_allocator. Never throws

      -
      4. -
    -
    -
    -

    -new_allocator friend functions

    -
      -
    1. -
      friend void swap(new_allocator &, new_allocator &) noexcept;
      -

      Swaps two allocators, does nothing because this new_allocator is stateless

      -
      2. -
    2. -
      friend bool operator==(const new_allocator &, const new_allocator &) noexcept;
      -

      An new_allocator always compares to true, as memory allocated with one instance can be deallocated by another instance

      -
      3. -
    3. -
      friend bool operator!=(const new_allocator &, const new_allocator &) noexcept;
      -

      An new_allocator always compares to false, as memory allocated with one instance can be deallocated by another instance

      -
      4. -
    -
    -
    -
    - - - -
    Copyright © 2009-2013 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/container/new_allocator__idp59775248/rebind.html b/doc/html/boost/container/new_allocator__idp59775248/rebind.html deleted file mode 100644 index bd3f0a7fc0..0000000000 --- a/doc/html/boost/container/new_allocator__idp59775248/rebind.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Struct template rebind - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template rebind

    -

    boost::container::new_allocator<void>::rebind

    -
    -

    Synopsis

    -
    // In header: <boost/container/new_allocator.hpp>
-
-
-template<typename T2> 
-struct rebind {
-  // types
-  typedef new_allocator< T2 > other;
-};
    -
    -

    Description

    -

    Obtains an new_allocator that allocates objects of type T2

    -
    -
    - - - -
    Copyright © 2009-2013 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/container/new_allocator_bool.html b/doc/html/boost/container/new_allocator_bool.html deleted file mode 100644 index 816f71d66f..0000000000 --- a/doc/html/boost/container/new_allocator_bool.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template new_allocator_bool - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template new_allocator_bool

    -

    boost::container::new_allocator_bool

    -
    -

    Synopsis

    -
    // In header: <boost/container/new_allocator.hpp>
-
-template<bool Value> 
-struct new_allocator_bool {
-
-  // public data members
-  static const bool value;
-};
    -
    - - - -
    Copyright © 2009-2013 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/container/node_allocator.html b/doc/html/boost/container/node_allocator.html index 70b434daed..ebae41bf8d 100644 --- a/doc/html/boost/container/node_allocator.html +++ b/doc/html/boost/container/node_allocator.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -53,139 +53,139 @@ }; // construct/copy/destruct - node_allocator() noexcept; - node_allocator(const node_allocator &) noexcept; + node_allocator() noexcept; + node_allocator(const node_allocator &) noexcept; template<typename T2> - node_allocator(const node_allocator< T2, NodesPerBlock > &) noexcept; - ~node_allocator(); + node_allocator(const node_allocator< T2, NodesPerBlock > &) noexcept; + ~node_allocator(); - // public member functions - size_type max_size() const; - pointer allocate(size_type, const void * = 0); - void deallocate(const pointer &, size_type) noexcept; - pointer allocation_command(allocation_type, size_type, size_type &, + // public member functions + size_type max_size() const; + pointer allocate(size_type, const void * = 0); + void deallocate(const pointer &, size_type) noexcept; + pointer allocation_command(allocation_type, size_type, size_type &, pointer &); - size_type size(pointer) const noexcept; - pointer allocate_one(); - void allocate_individual(std::size_t, multiallocation_chain &); - void deallocate_one(pointer) noexcept; - void deallocate_individual(multiallocation_chain &) noexcept; - void allocate_many(size_type, std::size_t, multiallocation_chain &); - void allocate_many(const size_type *, size_type, multiallocation_chain &); - void deallocate_many(multiallocation_chain &) noexcept; + size_type size(pointer) const noexcept; + pointer allocate_one(); + void allocate_individual(std::size_t, multiallocation_chain &); + void deallocate_one(pointer) noexcept; + void deallocate_individual(multiallocation_chain &) noexcept; + void allocate_many(size_type, std::size_t, multiallocation_chain &); + void allocate_many(const size_type *, size_type, multiallocation_chain &); + void deallocate_many(multiallocation_chain &) noexcept; - // public static functions - static void deallocate_free_blocks() noexcept; + // public static functions + static void deallocate_free_blocks() noexcept; - // friend functions - friend void swap(self_t &, self_t &) noexcept; - friend bool operator==(const node_allocator &, const node_allocator &) noexcept; - friend bool operator!=(const node_allocator &, const node_allocator &) noexcept; + // friend functions + friend void swap(self_t &, self_t &) noexcept; + friend bool operator==(const node_allocator &, const node_allocator &) noexcept; + friend bool operator!=(const node_allocator &, const node_allocator &) noexcept; - // private member functions - pointer priv_allocation_command(allocation_type, std::size_t, size_type &, + // private member functions + pointer priv_allocation_command(allocation_type, std::size_t, size_type &, pointer &); };
    -

    Description

    +

    Description

    An STL node allocator that uses a modified DlMalloc as memory source.

    This node allocator shares a segregated storage between all instances of node_allocator with equal sizeof(T).

    NodesPerBlock is the number of nodes allocated at once when the allocator runs out of nodes

    -

    +

    node_allocator public construct/copy/destruct

    1. -
      node_allocator() noexcept;
      Default constructor.
      2. +
      node_allocator() noexcept;
      Default constructor.
    2. -
      node_allocator(const node_allocator &) noexcept;
      Copy constructor from other node_allocator.
      3. +
      node_allocator(const node_allocator &) noexcept;
      Copy constructor from other node_allocator. 
    3. template<typename T2> 
-  node_allocator(const node_allocator< T2, NodesPerBlock > &) noexcept;
      Copy constructor from related node_allocator.
      4. + node_allocator(const node_allocator< T2, NodesPerBlock > &) noexcept;Copy constructor from related node_allocator.
    4. -
      ~node_allocator();
      Destructor.
      5. +
      ~node_allocator();
      Destructor.
    -

    -node_allocator public member functions

    +

    +node_allocator public member functions

    1. -
      size_type max_size() const;
      +
      size_type max_size() const;

      Returns the number of elements that could be allocated. Never throws

    2. -
      pointer allocate(size_type count, const void * = 0);
      +
      pointer allocate(size_type count, const void * = 0);

      Allocate memory for an array of count elements. Throws std::bad_alloc if there is no enough memory

    3. -
      void deallocate(const pointer & ptr, size_type count) noexcept;
      +
      void deallocate(const pointer & ptr, size_type count) noexcept;

      Deallocate allocated memory. Never throws

      4. -
    4. pointer allocation_command(allocation_type command, size_type limit_size, 
+
    5. pointer allocation_command(allocation_type command, size_type limit_size, 
                            size_type & prefer_in_recvd_out_size, 
                            pointer & reuse);
      6. 
 
    6. 
-
      size_type size(pointer p) const noexcept;
      
+
      size_type size(pointer p) const noexcept;
      
 
      Returns maximum the number of objects the previously allocated memory pointed by p can hold. 
      
 
      7. 
 
    7. 
-
      pointer allocate_one();
      
+
      pointer allocate_one();
      
 
      Allocates just one object. Memory allocated with this function must be deallocated only with deallocate_one(). Throws bad_alloc if there is no enough memory 
      
 
      8. 
 
    8. 
-
      void allocate_individual(std::size_t num_elements, 
+
      void allocate_individual(std::size_t num_elements, 
                          multiallocation_chain & chain);
      
 
      Allocates many elements of size == 1. Elements must be individually deallocated with deallocate_one() 
      
 
      9. 
 
    9. 
-
      void deallocate_one(pointer p) noexcept;
      
+
      void deallocate_one(pointer p) noexcept;
      
 
      Deallocates memory previously allocated with allocate_one(). You should never use deallocate_one to deallocate memory allocated with other functions different from allocate_one(). Never throws 
      
 
      10. 
-
    10. void deallocate_individual(multiallocation_chain & chain) noexcept;
      11. 
+
    11. void deallocate_individual(multiallocation_chain & chain) noexcept;
      12. 
 
    12. 
-
      void allocate_many(size_type elem_size, std::size_t n_elements, 
+
      void allocate_many(size_type elem_size, std::size_t n_elements, 
                    multiallocation_chain & chain);
      
 
      Allocates many elements of size elem_size. Elements must be individually deallocated with deallocate() 
      
 
      13. 
 
    13. 
-
      void allocate_many(const size_type * elem_sizes, size_type n_elements, 
+
      void allocate_many(const size_type * elem_sizes, size_type n_elements, 
                    multiallocation_chain & chain);
      
 
      Allocates n_elements elements, each one of size elem_sizes[i] Elements must be individually deallocated with deallocate() 
      
 
      14. 
-
    14. void deallocate_many(multiallocation_chain & chain) noexcept;
      15. 
+
    15. void deallocate_many(multiallocation_chain & chain) noexcept;
      16.
    -

    -node_allocator public static functions

    +

    +node_allocator public static functions

    1. -
      static void deallocate_free_blocks() noexcept;
      Deallocates all free blocks of the pool.
    +
    static void deallocate_free_blocks() noexcept;
    Deallocates all free blocks of the pool.
    -

    -node_allocator friend functions

    +

    +node_allocator friend functions

    1. -
      friend void swap(self_t &, self_t &) noexcept;
      +
      friend void swap(self_t &, self_t &) noexcept;

      Swaps allocators. Does not throw. If each allocator is placed in a different memory segment, the result is undefined.

    2. -
      friend bool operator==(const node_allocator &, const node_allocator &) noexcept;
      +
      friend bool operator==(const node_allocator &, const node_allocator &) noexcept;

      An allocator always compares to true, as memory allocated with one instance can be deallocated by another instance

    3. -
      friend bool operator!=(const node_allocator &, const node_allocator &) noexcept;
      +
      friend bool operator!=(const node_allocator &, const node_allocator &) noexcept;

      An allocator always compares to false, as memory allocated with one instance can be deallocated by another instance

    -

    -node_allocator private member functions

    -
    1. pointer priv_allocation_command(allocation_type command, 
+
      
+node_allocator private member functions
      
+
      1. pointer priv_allocation_command(allocation_type command, 
                                 std::size_t limit_size, 
                                 size_type & prefer_in_recvd_out_size, 
                                 pointer & reuse);
      
@@ -194,7 +194,7 @@
    -
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -202,7 +202,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/container/node_allocator/rebind.html b/doc/html/boost/container/node_allocator/rebind.html index 52b878994d..df3bd585c0 100644 --- a/doc/html/boost/container/node_allocator/rebind.html +++ b/doc/html/boost/container/node_allocator/rebind.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -39,13 +39,13 @@ typedef node_allocator< T2, NodesPerBlock > other; };
    -

    Description

    +

    Description

    Obtains node_allocator from node_allocator

    -
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -53,7 +53,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/container/operator___idp62323648.html b/doc/html/boost/container/operator___idp62323648.html deleted file mode 100644 index bc438efa81..0000000000 --- a/doc/html/boost/container/operator___idp62323648.html +++ /dev/null @@ -1,93 +0,0 @@ - - - - -Function template operator== - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator==

    -

    boost::container::operator== — Checks if contents of two static_vectors are equal.

    -
    -

    Synopsis

    -
    // In header: <boost/container/static_vector.hpp>
-
-
-template<typename V, std::size_t C1, std::size_t C2> 
-  bool operator==(static_vector< V, C1 > const & x, 
-                  static_vector< V, C2 > const & y);
    -
    -

    Description

    -

    - -

    -

    Complexity. Linear O(N).

    -

    -

    -
    ---- - - - - - - - - - - -

    Parameters:

    ---- - - - - - - - - - - -

    x

    The first static_vector.

    y

    The second static_vector.

    Returns:

    true if containers have the same size and elements in both containers are equal.

    -
    -
    - - - -
    Copyright © 2009-2013 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/container/operator___idp62333664.html b/doc/html/boost/container/operator___idp62333664.html deleted file mode 100644 index d1dcc28687..0000000000 --- a/doc/html/boost/container/operator___idp62333664.html +++ /dev/null @@ -1,93 +0,0 @@ - - - - -Function template operator!= - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator!=

    -

    boost::container::operator!= — Checks if contents of two static_vectors are not equal.

    -
    -

    Synopsis

    -
    // In header: <boost/container/static_vector.hpp>
-
-
-template<typename V, std::size_t C1, std::size_t C2> 
-  bool operator!=(static_vector< V, C1 > const & x, 
-                  static_vector< V, C2 > const & y);
    -
    -

    Description

    -

    - -

    -

    Complexity. Linear O(N).

    -

    -

    -
    ---- - - - - - - - - - - -

    Parameters:

    ---- - - - - - - - - - - -

    x

    The first static_vector.

    y

    The second static_vector.

    Returns:

    true if containers have different size or elements in both containers are not equal.

    -
    -
    - - - -
    Copyright © 2009-2013 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/container/operator___idp62363664.html b/doc/html/boost/container/operator___idp62363664.html deleted file mode 100644 index 32262d7653..0000000000 --- a/doc/html/boost/container/operator___idp62363664.html +++ /dev/null @@ -1,93 +0,0 @@ - - - - -Function template operator<= - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator<=

    -

    boost::container::operator<= — Lexicographically compares static_vectors.

    -
    -

    Synopsis

    -
    // In header: <boost/container/static_vector.hpp>
-
-
-template<typename V, std::size_t C1, std::size_t C2> 
-  bool operator<=(static_vector< V, C1 > const & x, 
-                  static_vector< V, C2 > const & y);
    -
    -

    Description

    -

    - -

    -

    Complexity. Linear O(N).

    -

    -

    -
    ---- - - - - - - - - - - -

    Parameters:

    ---- - - - - - - - - - - -

    x

    The first static_vector.

    y

    The second static_vector.

    Returns:

    true if y don't compare lexicographically less than x.

    -
    -
    - - - -
    Copyright © 2009-2013 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/container/operator___idp62373648.html b/doc/html/boost/container/operator___idp62373648.html deleted file mode 100644 index a0a150d33d..0000000000 --- a/doc/html/boost/container/operator___idp62373648.html +++ /dev/null @@ -1,93 +0,0 @@ - - - - -Function template operator>= - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator>=

    -

    boost::container::operator>= — Lexicographically compares static_vectors.

    -
    -

    Synopsis

    -
    // In header: <boost/container/static_vector.hpp>
-
-
-template<typename V, std::size_t C1, std::size_t C2> 
-  bool operator>=(static_vector< V, C1 > const & x, 
-                  static_vector< V, C2 > const & y);
    -
    -

    Description

    -

    - -

    -

    Complexity. Linear O(N).

    -

    -

    -
    ---- - - - - - - - - - - -

    Parameters:

    ---- - - - - - - - - - - -

    x

    The first static_vector.

    y

    The second static_vector.

    Returns:

    true if x don't compare lexicographically less than y.

    -
    -
    - - - -
    Copyright © 2009-2013 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/container/operator_idm46583868786816.html b/doc/html/boost/container/operator_idm46583868786816.html new file mode 100644 index 0000000000..978d0662f6 --- /dev/null +++ b/doc/html/boost/container/operator_idm46583868786816.html @@ -0,0 +1,93 @@ + + + + +Function template operator>= + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator>=

    +

    boost::container::operator>= — Lexicographically compares static_vectors.

    +
    +

    Synopsis

    +
    // In header: <boost/container/static_vector.hpp>
+
+
+template<typename V, std::size_t C1, std::size_t C2> 
+  bool operator>=(static_vector< V, C1 > const & x, 
+                  static_vector< V, C2 > const & y);
    +
    +

    Description

    +

    + +

    +

    Complexity. Linear O(N).

    +

    +

    +
    ++++ + + + + + + + + + + +

    Parameters:

    ++++ + + + + + + + + + + +

    x

    The first static_vector.

    y

    The second static_vector.

    Returns:

    true if x don't compare lexicographically less than y.

    +
    +
    + + + +
    Copyright © 2009-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/operator_idm46583868796800.html b/doc/html/boost/container/operator_idm46583868796800.html new file mode 100644 index 0000000000..fbe7b14fec --- /dev/null +++ b/doc/html/boost/container/operator_idm46583868796800.html @@ -0,0 +1,93 @@ + + + + +Function template operator<= + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator<=

    +

    boost::container::operator<= — Lexicographically compares static_vectors.

    +
    +

    Synopsis

    +
    // In header: <boost/container/static_vector.hpp>
+
+
+template<typename V, std::size_t C1, std::size_t C2> 
+  bool operator<=(static_vector< V, C1 > const & x, 
+                  static_vector< V, C2 > const & y);
    +
    +

    Description

    +

    + +

    +

    Complexity. Linear O(N).

    +

    +

    +
    ++++ + + + + + + + + + + +

    Parameters:

    ++++ + + + + + + + + + + +

    x

    The first static_vector.

    y

    The second static_vector.

    Returns:

    true if y don't compare lexicographically less than x.

    +
    +
    + + + +
    Copyright © 2009-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/operator_idm46583868806784.html b/doc/html/boost/container/operator_idm46583868806784.html new file mode 100644 index 0000000000..8cd0658932 --- /dev/null +++ b/doc/html/boost/container/operator_idm46583868806784.html @@ -0,0 +1,93 @@ + + + + +Function template operator> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator>

    +

    boost::container::operator> — Lexicographically compares static_vectors.

    +
    +

    Synopsis

    +
    // In header: <boost/container/static_vector.hpp>
+
+
+template<typename V, std::size_t C1, std::size_t C2> 
+  bool operator>(static_vector< V, C1 > const & x, 
+                 static_vector< V, C2 > const & y);
    +
    +

    Description

    +

    + +

    +

    Complexity. Linear O(N).

    +

    +

    +
    ++++ + + + + + + + + + + +

    Parameters:

    ++++ + + + + + + + + + + +

    x

    The first static_vector.

    y

    The second static_vector.

    Returns:

    true if y compares lexicographically less than x.

    +
    +
    + + + +
    Copyright © 2009-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/operator_idm46583868816768.html b/doc/html/boost/container/operator_idm46583868816768.html new file mode 100644 index 0000000000..51b5a5596a --- /dev/null +++ b/doc/html/boost/container/operator_idm46583868816768.html @@ -0,0 +1,93 @@ + + + + +Function template operator< + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator<

    +

    boost::container::operator< — Lexicographically compares static_vectors.

    +
    +

    Synopsis

    +
    // In header: <boost/container/static_vector.hpp>
+
+
+template<typename V, std::size_t C1, std::size_t C2> 
+  bool operator<(static_vector< V, C1 > const & x, 
+                 static_vector< V, C2 > const & y);
    +
    +

    Description

    +

    + +

    +

    Complexity. Linear O(N).

    +

    +

    +
    ++++ + + + + + + + + + + +

    Parameters:

    ++++ + + + + + + + + + + +

    x

    The first static_vector.

    y

    The second static_vector.

    Returns:

    true if x compares lexicographically less than y.

    +
    +
    + + + +
    Copyright © 2009-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/operator_idm46583868826800.html b/doc/html/boost/container/operator_idm46583868826800.html new file mode 100644 index 0000000000..db4a0bdae0 --- /dev/null +++ b/doc/html/boost/container/operator_idm46583868826800.html @@ -0,0 +1,93 @@ + + + + +Function template operator!= + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator!=

    +

    boost::container::operator!= — Checks if contents of two static_vectors are not equal.

    +
    +

    Synopsis

    +
    // In header: <boost/container/static_vector.hpp>
+
+
+template<typename V, std::size_t C1, std::size_t C2> 
+  bool operator!=(static_vector< V, C1 > const & x, 
+                  static_vector< V, C2 > const & y);
    +
    +

    Description

    +

    + +

    +

    Complexity. Linear O(N).

    +

    +

    +
    ++++ + + + + + + + + + + +

    Parameters:

    ++++ + + + + + + + + + + +

    x

    The first static_vector.

    y

    The second static_vector.

    Returns:

    true if containers have different size or elements in both containers are not equal.

    +
    +
    + + + +
    Copyright © 2009-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/operator_idm46583868836816.html b/doc/html/boost/container/operator_idm46583868836816.html new file mode 100644 index 0000000000..dbde7ba75b --- /dev/null +++ b/doc/html/boost/container/operator_idm46583868836816.html @@ -0,0 +1,93 @@ + + + + +Function template operator== + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator==

    +

    boost::container::operator== — Checks if contents of two static_vectors are equal.

    +
    +

    Synopsis

    +
    // In header: <boost/container/static_vector.hpp>
+
+
+template<typename V, std::size_t C1, std::size_t C2> 
+  bool operator==(static_vector< V, C1 > const & x, 
+                  static_vector< V, C2 > const & y);
    +
    +

    Description

    +

    + +

    +

    Complexity. Linear O(N).

    +

    +

    +
    ++++ + + + + + + + + + + +

    Parameters:

    ++++ + + + + + + + + + + +

    x

    The first static_vector.

    y

    The second static_vector.

    Returns:

    true if containers have the same size and elements in both containers are equal.

    +
    +
    + + + +
    Copyright © 2009-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/operator_idp62343696.html b/doc/html/boost/container/operator_idp62343696.html deleted file mode 100644 index 01d0d19f0c..0000000000 --- a/doc/html/boost/container/operator_idp62343696.html +++ /dev/null @@ -1,93 +0,0 @@ - - - - -Function template operator< - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator<

    -

    boost::container::operator< — Lexicographically compares static_vectors.

    -
    -

    Synopsis

    -
    // In header: <boost/container/static_vector.hpp>
-
-
-template<typename V, std::size_t C1, std::size_t C2> 
-  bool operator<(static_vector< V, C1 > const & x, 
-                 static_vector< V, C2 > const & y);
    -
    -

    Description

    -

    - -

    -

    Complexity. Linear O(N).

    -

    -

    -
    ---- - - - - - - - - - - -

    Parameters:

    ---- - - - - - - - - - - -

    x

    The first static_vector.

    y

    The second static_vector.

    Returns:

    true if x compares lexicographically less than y.

    -
    -
    - - - -
    Copyright © 2009-2013 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/container/operator_idp62353680.html b/doc/html/boost/container/operator_idp62353680.html deleted file mode 100644 index ebf65e6f71..0000000000 --- a/doc/html/boost/container/operator_idp62353680.html +++ /dev/null @@ -1,93 +0,0 @@ - - - - -Function template operator> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator>

    -

    boost::container::operator> — Lexicographically compares static_vectors.

    -
    -

    Synopsis

    -
    // In header: <boost/container/static_vector.hpp>
-
-
-template<typename V, std::size_t C1, std::size_t C2> 
-  bool operator>(static_vector< V, C1 > const & x, 
-                 static_vector< V, C2 > const & y);
    -
    -

    Description

    -

    - -

    -

    Complexity. Linear O(N).

    -

    -

    -
    ---- - - - - - - - - - - -

    Parameters:

    ---- - - - - - - - - - - -

    x

    The first static_vector.

    y

    The second static_vector.

    Returns:

    true if y compares lexicographically less than x.

    -
    -
    - - - -
    Copyright © 2009-2013 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/container/optimize_size.html b/doc/html/boost/container/optimize_size.html index 9949cd7193..b5db0a168d 100644 --- a/doc/html/boost/container/optimize_size.html +++ b/doc/html/boost/container/optimize_size.html @@ -36,13 +36,13 @@ struct optimize_size { };
    -

    Description

    +

    Description

    This option setter specifies if node size is optimized storing rebalancing data masked into pointers for ordered associative containers

    -
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost/container/ordered_range.html b/doc/html/boost/container/ordered_range.html index 39c9d4733d..ad31225493 100644 --- a/doc/html/boost/container/ordered_range.html +++ b/doc/html/boost/container/ordered_range.html @@ -34,13 +34,13 @@ static const ordered_range_t ordered_range;
    -

    Description

    +

    Description

    Value used to tag that the input range is guaranteed to be ordered

    - + + + @@ -1854,7 +1882,7 @@ std::out_of_range is thrown if out of bound access is performed in -
    size_type index_of(const_iterator p) const;
    Returns the index of the element pointed by p.

    +

    size_type index_of(const_iterator p) const;
    Returns the index of the element pointed by p.

    @@ -1871,6 +1899,19 @@ std::out_of_range is thrown if out of bound access is performed in Parameters:

    +     + + @@ -1882,7 +1923,7 @@ std::out_of_range is thrown if out of bound access is performed in -
    reference front();
    Returns reference to the first element.

    +

    reference front();
    Returns reference to the first element.

    Throws. Nothing by default.

    @@ -1909,7 +1950,7 @@ std::out_of_range is thrown if out of bound access is performed in -
    const_reference front() const;
    Returns const reference to the first element.

    +

    const_reference front() const;
    Returns const reference to the first element.

    Throws. Nothing by default.

    @@ -1936,7 +1977,7 @@ std::out_of_range is thrown if out of bound access is performed in -
    reference back();
    Returns reference to the last element.

    +

    reference back();
    Returns reference to the last element.

    Throws. Nothing by default.

    @@ -1963,7 +2004,7 @@ std::out_of_range is thrown if out of bound access is performed in -
    const_reference back() const;
    Returns const reference to the first element.

    +

    const_reference back() const;
    Returns const reference to the first element.

    Throws. Nothing by default.

    @@ -1990,7 +2031,7 @@ std::out_of_range is thrown if out of bound access is performed in -
    Value * data() noexcept;
    Pointer such that [data(), data() + size()) is a valid range. For a non-empty vector data() == &front().

    Throws. Nothing.

    +
    Value * data() noexcept;
    Pointer such that [data(), data() + size()) is a valid range. For a non-empty vector data() == &front().

    Throws. Nothing.

    Complexity. Constant O(1).

    @@ -1998,7 +2039,7 @@ std::out_of_range is thrown if out of bound access is performed in -
    const Value * data() const noexcept;
    Const pointer such that [data(), data() + size()) is a valid range. For a non-empty vector data() == &front().

    Throws. Nothing.

    +
    const Value * data() const noexcept;
    Const pointer such that [data(), data() + size()) is a valid range. For a non-empty vector data() == &front().

    Throws. Nothing.

    Complexity. Constant O(1).

    @@ -2006,7 +2047,7 @@ std::out_of_range is thrown if out of bound access is performed in -
    iterator begin() noexcept;
    Returns iterator to the first element.

    +

    iterator begin() noexcept;
    Returns iterator to the first element.

    Throws. Nothing.

    @@ -2026,7 +2067,7 @@ std::out_of_range is thrown if out of bound access is performed in -

    const_iterator begin() const noexcept;
    Returns const iterator to the first element.

    +

    const_iterator begin() const noexcept;
    Returns const iterator to the first element.

    Throws. Nothing.

    @@ -2046,7 +2087,7 @@ std::out_of_range is thrown if out of bound access is performed in -

    const_iterator cbegin() const noexcept;
    Returns const iterator to the first element.

    +

    const_iterator cbegin() const noexcept;
    Returns const iterator to the first element.

    Throws. Nothing.

    @@ -2066,7 +2107,7 @@ std::out_of_range is thrown if out of bound access is performed in -

    iterator end() noexcept;
    Returns iterator to the one after the last element.

    +

    iterator end() noexcept;
    Returns iterator to the one after the last element.

    Throws. Nothing.

    @@ -2086,7 +2127,7 @@ std::out_of_range is thrown if out of bound access is performed in -

    const_iterator end() const noexcept;
    Returns const iterator to the one after the last element.

    +

    const_iterator end() const noexcept;
    Returns const iterator to the one after the last element.

    Throws. Nothing.

    @@ -2106,7 +2147,7 @@ std::out_of_range is thrown if out of bound access is performed in -

    const_iterator cend() const noexcept;
    Returns const iterator to the one after the last element.

    +

    const_iterator cend() const noexcept;
    Returns const iterator to the one after the last element.

    Throws. Nothing.

    @@ -2126,7 +2167,7 @@ std::out_of_range is thrown if out of bound access is performed in -

    reverse_iterator rbegin() noexcept;
    Returns reverse iterator to the first element of the reversed container.

    +

    reverse_iterator rbegin() noexcept;
    Returns reverse iterator to the first element of the reversed container.

    Throws. Nothing.

    @@ -2146,7 +2187,7 @@ std::out_of_range is thrown if out of bound access is performed in -

    const_reverse_iterator rbegin() const noexcept;
    Returns const reverse iterator to the first element of the reversed container.

    +

    const_reverse_iterator rbegin() const noexcept;
    Returns const reverse iterator to the first element of the reversed container.

    Throws. Nothing.

    @@ -2166,7 +2207,7 @@ std::out_of_range is thrown if out of bound access is performed in -

    const_reverse_iterator crbegin() const noexcept;
    Returns const reverse iterator to the first element of the reversed container.

    +

    const_reverse_iterator crbegin() const noexcept;
    Returns const reverse iterator to the first element of the reversed container.

    Throws. Nothing.

    @@ -2186,7 +2227,7 @@ std::out_of_range is thrown if out of bound access is performed in -

    reverse_iterator rend() noexcept;
    Returns reverse iterator to the one after the last element of the reversed container.

    +

    reverse_iterator rend() noexcept;
    Returns reverse iterator to the one after the last element of the reversed container.

    Throws. Nothing.

    @@ -2206,7 +2247,7 @@ std::out_of_range is thrown if out of bound access is performed in -

    const_reverse_iterator rend() const noexcept;
    Returns const reverse iterator to the one after the last element of the reversed container.

    +

    const_reverse_iterator rend() const noexcept;
    Returns const reverse iterator to the one after the last element of the reversed container.

    Throws. Nothing.

    @@ -2226,7 +2267,7 @@ std::out_of_range is thrown if out of bound access is performed in -

    const_reverse_iterator crend() const noexcept;
    Returns const reverse iterator to the one after the last element of the reversed container.

    +

    const_reverse_iterator crend() const noexcept;
    Returns const reverse iterator to the one after the last element of the reversed container.

    Throws. Nothing.

    @@ -2246,7 +2287,7 @@ std::out_of_range is thrown if out of bound access is performed in -

    size_type size() const noexcept;
    Returns the number of stored elements.

    +

    size_type size() const noexcept;
    Returns the number of stored elements.

    Throws. Nothing.

    @@ -2266,7 +2307,7 @@ std::out_of_range is thrown if out of bound access is performed in -

    bool empty() const noexcept;
    Queries if the container contains elements.

    +

    bool empty() const noexcept;
    Queries if the container contains elements.

    Throws. Nothing.

    @@ -2288,11 +2329,11 @@ std::out_of_range is thrown if out of bound access is performed in -

    -static_vector public static functions

    +

    +static_vector public static functions

    1. -
      static size_type capacity() noexcept;
      Returns container's capacity.

      +

      static size_type capacity() noexcept;
      Returns container's capacity.

      Throws. Nothing.

      @@ -2312,7 +2353,7 @@ std::out_of_range is thrown if out of bound access is performed in -

      static size_type max_size() noexcept;
      Returns container's capacity.

      +

      static size_type max_size() noexcept;
      Returns container's capacity.

      Throws. Nothing.

      @@ -2337,7 +2378,7 @@ std::out_of_range is thrown if out of bound access is performed in

    -
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost/container/ordered_range_t.html b/doc/html/boost/container/ordered_range_t.html index 906eb24e29..8185244039 100644 --- a/doc/html/boost/container/ordered_range_t.html +++ b/doc/html/boost/container/ordered_range_t.html @@ -36,13 +36,13 @@ struct ordered_range_t { };
    -

    Description

    +

    Description

    Type used to tag that the input range is guaranteed to be ordered

    - + + + + + + - + +
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost/container/ordered_unique_range.html b/doc/html/boost/container/ordered_unique_range.html index 82f4aaf805..a4b5cddb62 100644 --- a/doc/html/boost/container/ordered_unique_range.html +++ b/doc/html/boost/container/ordered_unique_range.html @@ -34,13 +34,13 @@ static const ordered_unique_range_t ordered_unique_range;
    -

    Description

    +

    Description

    Value used to tag that the input range is guaranteed to be ordered and unique

    -
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost/container/ordered_unique_range_t.html b/doc/html/boost/container/ordered_unique_range_t.html index a16ecac98d..c5c58ca8e2 100644 --- a/doc/html/boost/container/ordered_unique_range_t.html +++ b/doc/html/boost/container/ordered_unique_range_t.html @@ -36,13 +36,13 @@ struct ordered_unique_range_t : public boost::container::ordered_range_t { };
    -

    Description

    +

    Description

    Type used to tag that the input range is guaranteed to be ordered and unique

    -
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost/container/pmr/basic_string_of.html b/doc/html/boost/container/pmr/basic_string_of.html new file mode 100644 index 0000000000..97e103c438 --- /dev/null +++ b/doc/html/boost/container/pmr/basic_string_of.html @@ -0,0 +1,54 @@ + + + + +Struct template basic_string_of + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct template basic_string_of

    +

    boost::container::pmr::basic_string_of

    +
    +

    Synopsis

    +
    // In header: <boost/container/pmr/string.hpp>
+
+template<typename CharT, typename Traits = std::char_traits<CharT> > 
+struct basic_string_of {
+  // types
+  typedef boost::container::basic_string< CharT, Traits, polymorphic_allocator< CharT > > type;
+};
    +
    + + + +
    Copyright © 2009-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/pmr/deque_of.html b/doc/html/boost/container/pmr/deque_of.html new file mode 100644 index 0000000000..fdf204bb63 --- /dev/null +++ b/doc/html/boost/container/pmr/deque_of.html @@ -0,0 +1,54 @@ + + + + +Struct template deque_of + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct template deque_of

    +

    boost::container::pmr::deque_of

    +
    +

    Synopsis

    +
    // In header: <boost/container/pmr/deque.hpp>
+
+template<typename T> 
+struct deque_of {
+  // types
+  typedef boost::container::deque< T, polymorphic_allocator< T > > type;
+};
    +
    + + + +
    Copyright © 2009-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/pmr/flat_map_of.html b/doc/html/boost/container/pmr/flat_map_of.html new file mode 100644 index 0000000000..ab8eaab620 --- /dev/null +++ b/doc/html/boost/container/pmr/flat_map_of.html @@ -0,0 +1,55 @@ + + + + +Struct template flat_map_of + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct template flat_map_of

    +

    boost::container::pmr::flat_map_of

    +
    +

    Synopsis

    +
    // In header: <boost/container/pmr/flat_map.hpp>
+
+template<typename Key, typename T, typename Compare = std::less<Key>, 
+         typename Options = tree_assoc_defaults> 
+struct flat_map_of {
+  // types
+  typedef boost::container::flat_map< Key, T, Compare, polymorphic_allocator< std::pair< Key, T > > > type;
+};
    +
    + + + +
    Copyright © 2009-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/pmr/flat_multimap_of.html b/doc/html/boost/container/pmr/flat_multimap_of.html new file mode 100644 index 0000000000..fbf6e67109 --- /dev/null +++ b/doc/html/boost/container/pmr/flat_multimap_of.html @@ -0,0 +1,55 @@ + + + + +Struct template flat_multimap_of + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct template flat_multimap_of

    +

    boost::container::pmr::flat_multimap_of

    +
    +

    Synopsis

    +
    // In header: <boost/container/pmr/flat_map.hpp>
+
+template<typename Key, typename T, typename Compare = std::less<Key>, 
+         typename Options = tree_assoc_defaults> 
+struct flat_multimap_of {
+  // types
+  typedef boost::container::flat_multimap< Key, T, Compare, polymorphic_allocator< std::pair< Key, T > > > type;
+};
    +
    + + + +
    Copyright © 2009-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/pmr/flat_multiset_of.html b/doc/html/boost/container/pmr/flat_multiset_of.html new file mode 100644 index 0000000000..e66a8b58b4 --- /dev/null +++ b/doc/html/boost/container/pmr/flat_multiset_of.html @@ -0,0 +1,55 @@ + + + + +Struct template flat_multiset_of + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct template flat_multiset_of

    +

    boost::container::pmr::flat_multiset_of

    +
    +

    Synopsis

    +
    // In header: <boost/container/pmr/flat_set.hpp>
+
+template<typename Key, typename Compare = std::less<Key>, 
+         typename Options = tree_assoc_defaults> 
+struct flat_multiset_of {
+  // types
+  typedef boost::container::flat_multiset< Key, Compare, polymorphic_allocator< Key > > type;
+};
    +
    + + + +
    Copyright © 2009-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/pmr/flat_set_of.html b/doc/html/boost/container/pmr/flat_set_of.html new file mode 100644 index 0000000000..561123e5ec --- /dev/null +++ b/doc/html/boost/container/pmr/flat_set_of.html @@ -0,0 +1,55 @@ + + + + +Struct template flat_set_of + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct template flat_set_of

    +

    boost::container::pmr::flat_set_of

    +
    +

    Synopsis

    +
    // In header: <boost/container/pmr/flat_set.hpp>
+
+template<typename Key, typename Compare = std::less<Key>, 
+         typename Options = tree_assoc_defaults> 
+struct flat_set_of {
+  // types
+  typedef boost::container::flat_set< Key, Compare, polymorphic_allocator< Key > > type;
+};
    +
    + + + +
    Copyright © 2009-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/pmr/get_default_resource.html b/doc/html/boost/container/pmr/get_default_resource.html new file mode 100644 index 0000000000..7f12a2b806 --- /dev/null +++ b/doc/html/boost/container/pmr/get_default_resource.html @@ -0,0 +1,55 @@ + + + + +Function get_default_resource + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function get_default_resource

    +

    boost::container::pmr::get_default_resource

    +
    +

    Synopsis

    +
    // In header: <boost/container/pmr/global_resource.hpp>
+
+
+memory_resource * get_default_resource();
    +
    +

    Description

    +

    Returns: The current value of the default memory resource pointer.

    +
    +
    + + + +
    Copyright © 2009-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/pmr/list_of.html b/doc/html/boost/container/pmr/list_of.html new file mode 100644 index 0000000000..cccd8c3b53 --- /dev/null +++ b/doc/html/boost/container/pmr/list_of.html @@ -0,0 +1,54 @@ + + + + +Struct template list_of + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct template list_of

    +

    boost::container::pmr::list_of

    +
    +

    Synopsis

    +
    // In header: <boost/container/pmr/list.hpp>
+
+template<typename T> 
+struct list_of {
+  // types
+  typedef boost::container::list< T, polymorphic_allocator< T > > type;
+};
    +
    + + + +
    Copyright © 2009-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/pmr/map_of.html b/doc/html/boost/container/pmr/map_of.html new file mode 100644 index 0000000000..e8a5dc4353 --- /dev/null +++ b/doc/html/boost/container/pmr/map_of.html @@ -0,0 +1,55 @@ + + + + +Struct template map_of + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct template map_of

    +

    boost::container::pmr::map_of

    +
    +

    Synopsis

    +
    // In header: <boost/container/pmr/map.hpp>
+
+template<typename Key, typename T, typename Compare = std::less<Key>, 
+         typename Options = tree_assoc_defaults> 
+struct map_of {
+  // types
+  typedef boost::container::map< Key, T, Compare, polymorphic_allocator< std::pair< const Key, T > >, Options > type;
+};
    +
    + + + +
    Copyright © 2009-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/pmr/memory_resource.html b/doc/html/boost/container/pmr/memory_resource.html new file mode 100644 index 0000000000..d3ff08cb7c --- /dev/null +++ b/doc/html/boost/container/pmr/memory_resource.html @@ -0,0 +1,142 @@ + + + + +Class memory_resource + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Class memory_resource

    +

    boost::container::pmr::memory_resource

    +
    +

    Synopsis

    +
    // In header: <boost/container/pmr/memory_resource.hpp>
+
+
+class memory_resource {
+public:
+  // construct/copy/destruct
+  ~memory_resource();
+
+  // public member functions
+  void * allocate(std::size_t, std::size_t = max_align);
+  void deallocate(void *, std::size_t, std::size_t = max_align);
+  bool is_equal(const memory_resource &) const noexcept;
+
+  // friend functions
+  friend bool operator==(const memory_resource &, const memory_resource &) noexcept;
+  friend bool operator!=(const memory_resource &, const memory_resource &) noexcept;
+
+  // protected member functions
+  virtual void * do_allocate(std::size_t, std::size_t) = 0;
+  virtual void do_deallocate(void *, std::size_t, std::size_t) = 0;
+  virtual bool do_is_equal(const memory_resource &) const = 0;
+
+  // public data members
+  static constexpr std::size_t max_align;
+};
    +
    +

    Description

    +

    The memory_resource class is an abstract interface to an unbounded set of classes encapsulating memory resources.

    +
    +

    +memory_resource + public + construct/copy/destruct

    +
    1. +
      ~memory_resource();
      +

      Effects: Destroys this memory_resource.

      +
    +
    +
    +

    +memory_resource public member functions

    +
      +
    1. +
      void * allocate(std::size_t bytes, std::size_t alignment = max_align);
      +

      Effects: Equivalent to return do_allocate(bytes, alignment);

      +
      2. +
    2. +
      void deallocate(void * p, std::size_t bytes, 
+                std::size_t alignment = max_align);
      +

      Effects: Equivalent to return do_deallocate(bytes, alignment);

      +
      3. +
    3. +
      bool is_equal(const memory_resource & other) const noexcept;
      +

      Effects: Equivalent to return return do_is_equal(other);

      +
      4. +
    +
    +
    +

    +memory_resource friend functions

    +
      +
    1. +
      friend bool operator==(const memory_resource & a, const memory_resource & b) noexcept;
      +

      Returns: &a == &b || a.is_equal(b).

      +
      2. +
    2. +
      friend bool operator!=(const memory_resource & a, const memory_resource & b) noexcept;
      +

      Returns: !(a == b).

      +
      3. +
    +
    +
    +

    +memory_resource protected member functions

    +
      +
    1. +
      virtual void * do_allocate(std::size_t bytes, std::size_t alignment) = 0;
      +

      Requires: Alignment shall be a power of two.

      +

      Returns: A derived class shall implement this function to return a pointer to allocated storage with a size of at least bytes. The returned storage is aligned to the specified alignment, if such alignment is supported; otherwise it is aligned to max_align.

      +

      Throws: A derived class implementation shall throw an appropriate exception if it is unable to allocate memory with the requested size and alignment.

      +
      2. +
    2. +
      virtual void 
+do_deallocate(void * p, std::size_t bytes, std::size_t alignment) = 0;
      +

      Requires: p shall have been returned from a prior call to allocate(bytes, alignment) on a memory resource equal to *this, and the storage at p shall not yet have been deallocated.

      +

      Effects: A derived class shall implement this function to dispose of allocated storage.

      +

      Throws: Nothing.

      +
      3. +
    3. +
      virtual bool do_is_equal(const memory_resource & other) const = 0;
      +

      Returns: A derived class shall implement this function to return true if memory allocated from this can be deallocated from other and vice-versa; otherwise it shall return false. [Note: The most-derived type of other might not match the type of this. For a derived class, D, a typical implementation of this function will compute dynamic_cast<const D*>(&other) and go no further (i.e., return false) if it returns nullptr. - end note].

      +
      4. +
    +
    +
    +
    + + + +
    Copyright © 2009-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/pmr/monotonic_buffer_resource.html b/doc/html/boost/container/pmr/monotonic_buffer_resource.html new file mode 100644 index 0000000000..49b33f2390 --- /dev/null +++ b/doc/html/boost/container/pmr/monotonic_buffer_resource.html @@ -0,0 +1,193 @@ + + + + +Class monotonic_buffer_resource + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Class monotonic_buffer_resource

    +

    boost::container::pmr::monotonic_buffer_resource

    +
    +

    Synopsis

    +
    // In header: <boost/container/pmr/monotonic_buffer_resource.hpp>
+
+
+class monotonic_buffer_resource :
+  public boost::container::pmr::memory_resource
+{
+public:
+  // construct/copy/destruct
+  explicit monotonic_buffer_resource(memory_resource * = 0) noexcept;
+  explicit monotonic_buffer_resource(std::size_t, memory_resource * = 0) noexcept;
+  monotonic_buffer_resource(void *, std::size_t, memory_resource * = 0) noexcept;
+  monotonic_buffer_resource(const monotonic_buffer_resource &) = delete;
+  monotonic_buffer_resource 
+  operator=(const monotonic_buffer_resource &) = delete;
+  ~monotonic_buffer_resource();
+
+  // public member functions
+  void release() noexcept;
+  memory_resource * upstream_resource() const noexcept;
+  std::size_t remaining_storage(std::size_t, std::size_t &) const noexcept;
+  std::size_t remaining_storage(std::size_t = 1u) const noexcept;
+  const void * current_buffer() const noexcept;
+  std::size_t next_buffer_size() const noexcept;
+
+  // protected member functions
+  virtual void * do_allocate(std::size_t, std::size_t);
+  virtual void do_deallocate(void *, std::size_t, std::size_t) noexcept;
+  virtual bool do_is_equal(const memory_resource &) const noexcept;
+
+  // public data members
+  static const std::size_t initial_next_buffer_size;
+};
    +
    +

    Description

    +

    A monotonic_buffer_resource is a special-purpose memory resource intended for very fast memory allocations in situations where memory is used to build up a few objects and then is released all at once when the memory resource object is destroyed. It has the following qualities:

    +
      +

    • A call to deallocate has no effect, thus the amount of memory consumed increases monotonically until the resource is destroyed.

      • +

    • The program can supply an initial buffer, which the allocator uses to satisfy memory requests.

      • +

    • When the initial buffer (if any) is exhausted, it obtains additional buffers from an upstream memory resource supplied at construction. Each additional buffer is larger than the previous one, following a geometric progression.

      • +

    • It is intended for access from one thread of control at a time. Specifically, calls to allocate and deallocate do not synchronize with one another.

      • +

    • It owns the allocated memory and frees it on destruction, even if deallocate has not been called for some of the allocated blocks.

      • +
    +

    +

    +
    +

    +monotonic_buffer_resource + public + construct/copy/destruct

    +
      +
    1. +
      explicit monotonic_buffer_resource(memory_resource * upstream = 0) noexcept;
      +

      Requires: upstream shall be the address of a valid memory resource or nullptr

      +

      Effects: If upstream is not nullptr, sets the internal resource to upstream, to get_default_resource() otherwise. Sets the internal current_buffer to nullptr and the internal next_buffer_size to an implementation-defined size.

      +
      2. +
    2. +
      explicit monotonic_buffer_resource(std::size_t initial_size, 
+                                   memory_resource * upstream = 0) noexcept;
      +

      Requires: upstream shall be the address of a valid memory resource or nullptr and initial_size shall be greater than zero.

      +

      Effects: If upstream is not nullptr, sets the internal resource to upstream, to get_default_resource() otherwise. Sets the internal current_buffer to nullptr and next_buffer_size to at least initial_size.

      +
      3. +
    3. +
      monotonic_buffer_resource(void * buffer, std::size_t buffer_size, 
+                          memory_resource * upstream = 0) noexcept;
      +

      Requires: upstream shall be the address of a valid memory resource or nullptr, buffer_size shall be no larger than the number of bytes in buffer.

      +

      Effects: If upstream is not nullptr, sets the internal resource to upstream, to get_default_resource() otherwise. Sets the internal current_buffer to buffer, and next_buffer_size to buffer_size (but not less than an implementation-defined size), then increases next_buffer_size by an implementation-defined growth factor (which need not be integral).

      +
      4. +
    4. monotonic_buffer_resource(const monotonic_buffer_resource &) = delete;
      5. +
    5. monotonic_buffer_resource 
+operator=(const monotonic_buffer_resource &) = delete;
      6. +
    6. +
      ~monotonic_buffer_resource();
      +

      Effects: Calls this->release().

      +
      7. +
    +
    +
    +

    +monotonic_buffer_resource public member functions

    +
      +
    1. +
      void release() noexcept;
      +

      Effects: upstream_resource()->deallocate() as necessary to release all allocated memory. [Note: memory is released back to upstream_resource() even if some blocks that were allocated from this have not been deallocated from this. - end note]

      +
      2. +
    2. +
      memory_resource * upstream_resource() const noexcept;
      +

      Returns: The value of the internal resource.

      +
      3. +
    3. +
      std::size_t remaining_storage(std::size_t alignment, 
+                              std::size_t & wasted_due_to_alignment) const noexcept;
      +

      Returns: The number of bytes of storage available for the specified alignment and the number of bytes wasted due to the requested alignment.

      +

      Note: Non-standard extension.

      +
      4. +
    4. +
      std::size_t remaining_storage(std::size_t alignment = 1u) const noexcept;
      +

      Returns: The number of bytes of storage available for the specified alignment.

      +

      Note: Non-standard extension.

      +
      5. +
    5. +
      const void * current_buffer() const noexcept;
      +

      Returns: The number of bytes of storage available for the specified alignment.

      +

      Note: Non-standard extension.

      +
      6. +
    6. +
      std::size_t next_buffer_size() const noexcept;
      +

      Returns: The number of bytes that will be requested for the next buffer once the current one is exhausted.

      +

      Note: Non-standard extension.

      +
      7. +
    +
    +
    +

    +monotonic_buffer_resource protected member functions

    +
      +
    1. +
      virtual void * do_allocate(std::size_t bytes, std::size_t alignment);
      +

      Returns: A pointer to allocated storage with a size of at least bytes. The size and alignment of the allocated memory shall meet the requirements for a class derived from memory_resource.

      +

      Effects: If the unused space in the internal current_buffer can fit a block with the specified bytes and alignment, then allocate the return block from the internal current_buffer; otherwise sets the internal current_buffer to upstream_resource()->allocate(n, m), where n is not less than max(bytes, next_buffer_size) and m is not less than alignment, and increase next_buffer_size by an implementation-defined growth factor (which need not be integral), then allocate the return block from the newly-allocated internal current_buffer.

      +

      Throws: Nothing unless upstream_resource()->allocate() throws.

      +
      2. +
    2. +
      virtual void 
+do_deallocate(void * p, std::size_t bytes, std::size_t alignment) noexcept;
      +

      Effects: None

      +

      Throws: Nothing

      +

      Remarks: Memory used by this resource increases monotonically until its destruction.

      +
      3. +
    3. +
      virtual bool do_is_equal(const memory_resource & other) const noexcept;
      +

      Returns: this == dynamic_cast<const monotonic_buffer_resource*>(&other).

      +
      4. +
    +
    +
    +

    +monotonic_buffer_resource + public + public data members

    +
    1. +
      static const std::size_t initial_next_buffer_size;
      +

      The number of bytes that will be requested by the default in the first call to the upstream allocator

      +

      Note: Non-standard extension.

      +
    +
    +
    +
    + + + +
    Copyright © 2009-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/pmr/multimap_of.html b/doc/html/boost/container/pmr/multimap_of.html new file mode 100644 index 0000000000..f2eb01f461 --- /dev/null +++ b/doc/html/boost/container/pmr/multimap_of.html @@ -0,0 +1,55 @@ + + + + +Struct template multimap_of + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct template multimap_of

    +

    boost::container::pmr::multimap_of

    +
    +

    Synopsis

    +
    // In header: <boost/container/pmr/map.hpp>
+
+template<typename Key, typename T, typename Compare = std::less<Key>, 
+         typename Options = tree_assoc_defaults> 
+struct multimap_of {
+  // types
+  typedef boost::container::multimap< Key, T, Compare, polymorphic_allocator< std::pair< const Key, T > >, Options > type;
+};
    +
    + + + +
    Copyright © 2009-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/pmr/multiset_of.html b/doc/html/boost/container/pmr/multiset_of.html new file mode 100644 index 0000000000..200d223c90 --- /dev/null +++ b/doc/html/boost/container/pmr/multiset_of.html @@ -0,0 +1,55 @@ + + + + +Struct template multiset_of + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct template multiset_of

    +

    boost::container::pmr::multiset_of

    +
    +

    Synopsis

    +
    // In header: <boost/container/pmr/set.hpp>
+
+template<typename Key, typename Compare = std::less<Key>, 
+         typename Options = tree_assoc_defaults> 
+struct multiset_of {
+  // types
+  typedef boost::container::multiset< Key, Compare, polymorphic_allocator< Key >, Options > type;
+};
    +
    + + + +
    Copyright © 2009-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/pmr/new_delete_resource.html b/doc/html/boost/container/pmr/new_delete_resource.html new file mode 100644 index 0000000000..8da7af9dce --- /dev/null +++ b/doc/html/boost/container/pmr/new_delete_resource.html @@ -0,0 +1,55 @@ + + + + +Function new_delete_resource + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function new_delete_resource

    +

    boost::container::pmr::new_delete_resource

    +
    +

    Synopsis

    +
    // In header: <boost/container/pmr/global_resource.hpp>
+
+
+memory_resource * new_delete_resource();
    +
    +

    Description

    +

    Returns: A pointer to a static-duration object of a type derived from memory_resource that can serve as a resource for allocating memory using global operator new and global operator delete. The same value is returned every time this function is called. For return value p and memory resource r, p->is_equal(r) returns &r == p.

    +
    +
    + + + +
    Copyright © 2009-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/pmr/null_memory_resource.html b/doc/html/boost/container/pmr/null_memory_resource.html new file mode 100644 index 0000000000..efff404c80 --- /dev/null +++ b/doc/html/boost/container/pmr/null_memory_resource.html @@ -0,0 +1,55 @@ + + + + +Function null_memory_resource + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function null_memory_resource

    +

    boost::container::pmr::null_memory_resource

    +
    +

    Synopsis

    +
    // In header: <boost/container/pmr/global_resource.hpp>
+
+
+memory_resource * null_memory_resource();
    +
    +

    Description

    +

    Returns: A pointer to a static-duration object of a type derived from memory_resource for which allocate() always throws bad_alloc and for which deallocate() has no effect. The same value is returned every time this function is called. For return value p and memory resource r, p->is_equal(r) returns &r == p.

    +
    +
    + + + +
    Copyright © 2009-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/pmr/operator_idm46583871486800.html b/doc/html/boost/container/pmr/operator_idm46583871486800.html new file mode 100644 index 0000000000..be07d13054 --- /dev/null +++ b/doc/html/boost/container/pmr/operator_idm46583871486800.html @@ -0,0 +1,57 @@ + + + + +Function template operator!= + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator!=

    +

    boost::container::pmr::operator!=

    +
    +

    Synopsis

    +
    // In header: <boost/container/pmr/polymorphic_allocator.hpp>
+
+
+template<typename T1, typename T2> 
+  bool operator!=(const polymorphic_allocator< T1 > & a, 
+                  const polymorphic_allocator< T2 > & b);
    +
    +

    Description

    +

    Returns: ! (a == b).

    +
    +
    + + + +
    Copyright © 2009-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/pmr/operator_idm46583871492768.html b/doc/html/boost/container/pmr/operator_idm46583871492768.html new file mode 100644 index 0000000000..f09539c036 --- /dev/null +++ b/doc/html/boost/container/pmr/operator_idm46583871492768.html @@ -0,0 +1,57 @@ + + + + +Function template operator== + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator==

    +

    boost::container::pmr::operator==

    +
    +

    Synopsis

    +
    // In header: <boost/container/pmr/polymorphic_allocator.hpp>
+
+
+template<typename T1, typename T2> 
+  bool operator==(const polymorphic_allocator< T1 > & a, 
+                  const polymorphic_allocator< T2 > & b);
    +
    +

    Description

    +

    Returns: *a.resource() == *b.resource().

    +
    +
    + + + +
    Copyright © 2009-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/pmr/polymorphic_allocator.html b/doc/html/boost/container/pmr/polymorphic_allocator.html new file mode 100644 index 0000000000..fed6d9f264 --- /dev/null +++ b/doc/html/boost/container/pmr/polymorphic_allocator.html @@ -0,0 +1,141 @@ + + + + +Class template polymorphic_allocator + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Class template polymorphic_allocator

    +

    boost::container::pmr::polymorphic_allocator

    +
    +

    Synopsis

    +
    // In header: <boost/container/pmr/polymorphic_allocator.hpp>
+
+template<typename T> 
+class polymorphic_allocator {
+public:
+  // types
+  typedef T value_type;
+
+  // construct/copy/destruct
+  polymorphic_allocator() noexcept;
+  polymorphic_allocator(memory_resource *);
+  polymorphic_allocator(const polymorphic_allocator &);
+  template<typename U> 
+    polymorphic_allocator(const polymorphic_allocator< U > &) noexcept;
+  polymorphic_allocator & operator=(const polymorphic_allocator &);
+
+  // public member functions
+  T * allocate(size_t);
+  void deallocate(T *, size_t);
+  template<typename U, class... Args> void construct(U *, Args &&...);
+  template<typename U> void destroy(U *);
+  polymorphic_allocator select_on_container_copy_construction() const;
+  memory_resource * resource() const;
+};
    +
    +

    Description

    +

    A specialization of class template polymorphic_allocator conforms to the Allocator requirements. Constructed with different memory resources, different instances of the same specialization of polymorphic_allocator can exhibit entirely different allocation behavior. This runtime polymorphism allows objects that use polymorphic_allocator to behave as if they used different allocator types at run time even though they use the same static allocator type.

    +
    +

    +polymorphic_allocator + public + construct/copy/destruct

    +
      +
    1. +
      polymorphic_allocator() noexcept;
      +

      Effects: Sets m_resource to get_default_resource().

      +
      2. +
    2. +
      polymorphic_allocator(memory_resource * r);
      +

      Requires: r is non-null.

      +

      Effects: Sets m_resource to r.

      +

      Throws: Nothing

      +

      Notes: This constructor provides an implicit conversion from memory_resource*. Non-standard extension: if r is null m_resource is set to get_default_resource().

      +
      3. +
    3. +
      polymorphic_allocator(const polymorphic_allocator & other);
      +

      Effects: Sets m_resource to other.resource().

      +
      4. +
    4. +
      template<typename U> 
+  polymorphic_allocator(const polymorphic_allocator< U > & other) noexcept;
      +

      Effects: Sets m_resource to other.resource().

      +
      5. +
    5. +
      polymorphic_allocator & operator=(const polymorphic_allocator & other);
      +

      Effects: Sets m_resource to other.resource().

      +
      6. +
    +
    +
    +

    +polymorphic_allocator public member functions

    +
      +
    1. +
      T * allocate(size_t n);
      +

      Returns: Equivalent to static_cast<T*>(m_resource->allocate(n * sizeof(T), alignof(T))).

      +
      2. +
    2. +
      void deallocate(T * p, size_t n);
      +

      Requires: p was allocated from a memory resource, x, equal to *m_resource, using x.allocate(n * sizeof(T), alignof(T)).

      +

      Effects: Equivalent to m_resource->deallocate(p, n * sizeof(T), alignof(T)).

      +

      Throws: Nothing.

      +
      3. +
    3. +
      template<typename U, class... Args> void construct(U * p, Args &&... args);
      +

      Requires: Uses-allocator construction of T with allocator this->resource() and constructor arguments std::forward<Args>(args)... is well-formed. [Note: uses-allocator construction is always well formed for types that do not use allocators. - end note]

      +

      Effects: Construct a T object at p by uses-allocator construction with allocator this->resource() and constructor arguments std::forward<Args>(args)....

      +

      Throws: Nothing unless the constructor for T throws.

      +
      4. +
    4. +
      template<typename U> void destroy(U * p);
      +

      Effects: p->~U().

      +
      5. +
    5. +
      polymorphic_allocator select_on_container_copy_construction() const;
      +

      Returns: Equivalent to polymorphic_allocator().

      +
      6. +
    6. +
      memory_resource * resource() const;
      +

      Returns: m_resource.

      +
      7. +
    +
    +
    +
    + + + +
    Copyright © 2009-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/pmr/pool_options.html b/doc/html/boost/container/pmr/pool_options.html new file mode 100644 index 0000000000..0c9c58e689 --- /dev/null +++ b/doc/html/boost/container/pmr/pool_options.html @@ -0,0 +1,75 @@ + + + + +Struct pool_options + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct pool_options

    +

    boost::container::pmr::pool_options

    +
    +

    Synopsis

    +
    // In header: <boost/container/pmr/pool_options.hpp>
+
+
+struct pool_options {
+  // construct/copy/destruct
+  pool_options();
+
+  // public data members
+  std::size_t max_blocks_per_chunk;
+  std::size_t largest_required_pool_block;
+};
    +
    +

    Description

    +

    The members of pool_options comprise a set of constructor options for pool resources. The effect of each option on the pool resource behavior is described below:

    +
      +

    • std::size_t max_blocks_per_chunk: The maximum number of blocks that will be allocated at once from the upstream memory resource to replenish a pool. If the value of max_blocks_per_chunk is zero or is greater than an implementation-defined limit, that limit is used instead. The implementation may choose to use a smaller value than is specified in this field and may use different values for different pools.

      • +

    • std::size_t largest_required_pool_block: The largest allocation size that is required to be fulfilled using the pooling mechanism. Attempts to allocate a single block larger than this threshold will be allocated directly from the upstream memory resource. If largest_required_pool_block is zero or is greater than an implementation-defined limit, that limit is used instead. The implementation may choose a pass-through threshold larger than specified in this field.

      • +
    +

    +

    +
    +

    +pool_options + public + construct/copy/destruct

    +
    1. pool_options();
    +
    +
    +
    + + + +
    Copyright © 2009-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/pmr/resource_adaptor.html b/doc/html/boost/container/pmr/resource_adaptor.html new file mode 100644 index 0000000000..43ddb64ec1 --- /dev/null +++ b/doc/html/boost/container/pmr/resource_adaptor.html @@ -0,0 +1,55 @@ + + + + +Type definition resource_adaptor + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Type definition resource_adaptor

    +

    resource_adaptor

    +
    +

    Synopsis

    +
    // In header: <boost/container/pmr/resource_adaptor.hpp>
+
+
+typedef resource_adaptor_imp< typename allocator_traits< Allocator >::template rebind_alloc< char > > resource_adaptor;
    +
    +

    Description

    +

    resource_adaptor<Allocator> is rendered as an alias to resource_adaptor_imp class template such that Allocator is rebound to a char value type.

    +
    +
    + + + +
    Copyright © 2009-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/pmr/resource_adaptor_imp.html b/doc/html/boost/container/pmr/resource_adaptor_imp.html new file mode 100644 index 0000000000..6e988d553a --- /dev/null +++ b/doc/html/boost/container/pmr/resource_adaptor_imp.html @@ -0,0 +1,153 @@ + + + + +Class template resource_adaptor_imp + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Class template resource_adaptor_imp

    +

    boost::container::pmr::resource_adaptor_imp

    +
    +

    Synopsis

    +
    // In header: <boost/container/pmr/resource_adaptor.hpp>
+
+template<typename Allocator> 
+class resource_adaptor_imp : public boost::container::pmr::memory_resource {
+public:
+  // types
+  typedef Allocator allocator_type;
+
+  // construct/copy/destruct
+  resource_adaptor_imp();
+  resource_adaptor_imp(const resource_adaptor_imp &);
+  resource_adaptor_imp(resource_adaptor_imp &&);
+  explicit resource_adaptor_imp(const Allocator &);
+  explicit resource_adaptor_imp(Allocator &&);
+  resource_adaptor_imp & operator=(const resource_adaptor_imp &);
+  resource_adaptor_imp & operator=(resource_adaptor_imp &&);
+
+  // public member functions
+  allocator_type & get_allocator();
+  const allocator_type & get_allocator() const;
+
+  // protected member functions
+  virtual void * do_allocate(size_t, size_t);
+  virtual void do_deallocate(void *, size_t, size_t);
+  virtual bool do_is_equal(const memory_resource &) const noexcept;
+};
    +
    +

    Description

    +

    An instance of resource_adaptor<Allocator> is an adaptor that wraps a memory_resource interface around Allocator. In order that resource_adaptor<X<T>> and resource_adaptor<X<U>> are the same type for any allocator template X and types T and U, resource_adaptor<Allocator> is rendered as an alias to this class template such that Allocator is rebound to a char value type in every specialization of the class template. The requirements on this class template are defined below. In addition to the Allocator requirements, the parameter to resource_adaptor shall meet the following additional requirements:

    +
    +

    +

    +
    +

    +resource_adaptor_imp + public + construct/copy/destruct

    +
      +
    1. +
      resource_adaptor_imp();
      +

      Effects: Default constructs m_alloc.

      +
      2. +
    2. +
      resource_adaptor_imp(const resource_adaptor_imp & other);
      +

      Effects: Copy constructs m_alloc.

      +
      3. +
    3. +
      resource_adaptor_imp(resource_adaptor_imp && other);
      +

      Effects: Move constructs m_alloc.

      +
      4. +
    4. +
      explicit resource_adaptor_imp(const Allocator & a2);
      +

      Effects: Initializes m_alloc with a2.

      +
      5. +
    5. +
      explicit resource_adaptor_imp(Allocator && a2);
      +

      Effects: Initializes m_alloc with a2.

      +
      6. +
    6. +
      resource_adaptor_imp & operator=(const resource_adaptor_imp & other);
      +

      Effects: Copy assigns m_alloc.

      +
      7. +
    7. +
      resource_adaptor_imp & operator=(resource_adaptor_imp && other);
      +

      Effects: Move assigns m_alloc.

      +
      8. +
    +
    +
    +

    +resource_adaptor_imp public member functions

    +
      +
    1. +
      allocator_type & get_allocator();
      +Effects: Returns m_alloc.
      2. +
    2. +
      const allocator_type & get_allocator() const;
      +Effects: Returns m_alloc.
      3. +
    +
    +
    +

    +resource_adaptor_imp protected member functions

    +
      +
    1. +
      virtual void * do_allocate(size_t bytes, size_t alignment);
      +

      Returns: Allocated memory obtained by calling m_alloc.allocate. The size and alignment of the allocated memory shall meet the requirements for a class derived from memory_resource.

      +
      2. +
    2. +
      virtual void do_deallocate(void * p, size_t bytes, size_t alignment);
      +

      Requires: p was previously allocated using A.allocate, where A == m_alloc, and not subsequently deallocated.

      +

      Effects: Returns memory to the allocator using m_alloc.deallocate().

      +
      3. +
    3. +
      virtual bool do_is_equal(const memory_resource & other) const noexcept;
      +

      Let p be dynamic_cast<const resource_adaptor_imp*>(&other).

      +

      Returns: false if p is null, otherwise the value of m_alloc == p->m_alloc.

      +
      4. +
    +
    +
    +
    + + + +
    Copyright © 2009-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/pmr/set_default_resource.html b/doc/html/boost/container/pmr/set_default_resource.html new file mode 100644 index 0000000000..e5807d1566 --- /dev/null +++ b/doc/html/boost/container/pmr/set_default_resource.html @@ -0,0 +1,58 @@ + + + + +Function set_default_resource + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function set_default_resource

    +

    boost::container::pmr::set_default_resource

    +
    +

    Synopsis

    +
    // In header: <boost/container/pmr/global_resource.hpp>
+
+
+memory_resource * set_default_resource(memory_resource * r);
    +
    +

    Description

    +

    Effects: If r is non-null, sets the value of the default memory resource pointer to r, otherwise sets the default memory resource pointer to new_delete_resource().

    +

    Postconditions: get_default_resource() == r.

    +

    Returns: The previous value of the default memory resource pointer.

    +

    Remarks: Calling the set_default_resource and get_default_resource functions shall not incur a data race. A call to the set_default_resource function shall synchronize with subsequent calls to the set_default_resource and get_default_resource functions.

    +
    +
    + + + +
    Copyright © 2009-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/pmr/set_of.html b/doc/html/boost/container/pmr/set_of.html new file mode 100644 index 0000000000..b66ce8f969 --- /dev/null +++ b/doc/html/boost/container/pmr/set_of.html @@ -0,0 +1,55 @@ + + + + +Struct template set_of + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct template set_of

    +

    boost::container::pmr::set_of

    +
    +

    Synopsis

    +
    // In header: <boost/container/pmr/set.hpp>
+
+template<typename Key, typename Compare = std::less<Key>, 
+         typename Options = tree_assoc_defaults> 
+struct set_of {
+  // types
+  typedef boost::container::set< Key, Compare, polymorphic_allocator< Key >, Options > type;
+};
    +
    + + + +
    Copyright © 2009-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/pmr/slist_of.html b/doc/html/boost/container/pmr/slist_of.html new file mode 100644 index 0000000000..4d82d1c531 --- /dev/null +++ b/doc/html/boost/container/pmr/slist_of.html @@ -0,0 +1,54 @@ + + + + +Struct template slist_of + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct template slist_of

    +

    boost::container::pmr::slist_of

    +
    +

    Synopsis

    +
    // In header: <boost/container/pmr/slist.hpp>
+
+template<typename T> 
+struct slist_of {
+  // types
+  typedef boost::container::slist< T, polymorphic_allocator< T > > type;
+};
    +
    + + + +
    Copyright © 2009-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/pmr/small_vector_of.html b/doc/html/boost/container/pmr/small_vector_of.html new file mode 100644 index 0000000000..4b2d11889d --- /dev/null +++ b/doc/html/boost/container/pmr/small_vector_of.html @@ -0,0 +1,54 @@ + + + + +Struct template small_vector_of + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct template small_vector_of

    +

    boost::container::pmr::small_vector_of

    +
    +

    Synopsis

    +
    // In header: <boost/container/pmr/small_vector.hpp>
+
+template<typename T, std::size_t N> 
+struct small_vector_of {
+  // types
+  typedef boost::container::small_vector< T, N, polymorphic_allocator< T > > type;
+};
    +
    + + + +
    Copyright © 2009-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/pmr/stable_vector_of.html b/doc/html/boost/container/pmr/stable_vector_of.html new file mode 100644 index 0000000000..2f836af042 --- /dev/null +++ b/doc/html/boost/container/pmr/stable_vector_of.html @@ -0,0 +1,54 @@ + + + + +Struct template stable_vector_of + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct template stable_vector_of

    +

    boost::container::pmr::stable_vector_of

    +
    +

    Synopsis

    +
    // In header: <boost/container/pmr/stable_vector.hpp>
+
+template<typename T> 
+struct stable_vector_of {
+  // types
+  typedef boost::container::stable_vector< T, polymorphic_allocator< T > > type;
+};
    +
    + + + +
    Copyright © 2009-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/pmr/synchronized_pool_resource.html b/doc/html/boost/container/pmr/synchronized_pool_resource.html new file mode 100644 index 0000000000..0414923e0e --- /dev/null +++ b/doc/html/boost/container/pmr/synchronized_pool_resource.html @@ -0,0 +1,194 @@ + + + + +Class synchronized_pool_resource + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Class synchronized_pool_resource

    +

    boost::container::pmr::synchronized_pool_resource

    +
    +

    Synopsis

    +
    // In header: <boost/container/pmr/synchronized_pool_resource.hpp>
+
+
+class synchronized_pool_resource :
+  public boost::container::pmr::memory_resource
+{
+public:
+  // construct/copy/destruct
+  synchronized_pool_resource(const pool_options &, memory_resource *) noexcept;
+  synchronized_pool_resource() noexcept;
+  explicit synchronized_pool_resource(memory_resource *) noexcept;
+  explicit synchronized_pool_resource(const pool_options &) noexcept;
+  synchronized_pool_resource(const synchronized_pool_resource &) = delete;
+  synchronized_pool_resource 
+  operator=(const synchronized_pool_resource &) = delete;
+  ~synchronized_pool_resource();
+
+  // public member functions
+  void release();
+  memory_resource * upstream_resource() const;
+  pool_options options() const;
+  std::size_t pool_count() const;
+  std::size_t pool_index(std::size_t) const;
+  std::size_t pool_next_blocks_per_chunk(std::size_t) const;
+  std::size_t pool_block(std::size_t) const;
+  std::size_t pool_cached_blocks(std::size_t) const;
+
+  // protected member functions
+  virtual void * do_allocate(std::size_t, std::size_t);
+  virtual void do_deallocate(void *, std::size_t, std::size_t);
+  virtual bool do_is_equal(const memory_resource &) const noexcept;
+};
    +
    +

    Description

    +

    A synchronized_pool_resource is a general-purpose memory resources having the following qualities:

    +
      +

    • Each resource owns the allocated memory, and frees it on destruction, even if deallocate has not been called for some of the allocated blocks.

      • +

    • A pool resource consists of a collection of pools, serving requests for different block sizes. Each individual pool manages a collection of chunks that are in turn divided into blocks of uniform size, returned via calls to do_allocate. Each call to do_allocate(size, alignment) is dispatched to the pool serving the smallest blocks accommodating at least size bytes.

      • +

    • When a particular pool is exhausted, allocating a block from that pool results in the allocation of an additional chunk of memory from the upstream allocator (supplied at construction), thus replenishing the pool. With each successive replenishment, the chunk size obtained increases geometrically. [ Note: By allocating memory in chunks, the pooling strategy increases the chance that consecutive allocations will be close together in memory. - end note ]

      • +

    • Allocation requests that exceed the largest block size of any pool are fulfilled directly from the upstream allocator.

      • +

    • A pool_options struct may be passed to the pool resource constructors to tune the largest block size and the maximum chunk size.

      • +
    +

    +

    +

    A synchronized_pool_resource may be accessed from multiple threads without external synchronization and may have thread-specific pools to reduce synchronization costs.

    +
    +

    +synchronized_pool_resource + public + construct/copy/destruct

    +
      +
    1. +
      synchronized_pool_resource(const pool_options & opts, 
+                           memory_resource * upstream) noexcept;
      +

      Requires: upstream is the address of a valid memory resource.

      +

      Effects: Constructs a pool resource object that will obtain memory from upstream whenever the pool resource is unable to satisfy a memory request from its own internal data structures. The resulting object will hold a copy of upstream, but will not own the resource to which upstream points. [ Note: The intention is that calls to upstream->allocate() will be substantially fewer than calls to this->allocate() in most cases. - end note The behavior of the pooling mechanism is tuned according to the value of the opts argument.

      +

      Throws: Nothing unless upstream->allocate() throws. It is unspecified if or under what conditions this constructor calls upstream->allocate().

      +
      2. +
    2. +
      synchronized_pool_resource() noexcept;
      +

      Effects: Same as unsynchronized_pool_resource(pool_options(), get_default_resource()).

      +
      3. +
    3. +
      explicit synchronized_pool_resource(memory_resource * upstream) noexcept;
      +

      Effects: Same as unsynchronized_pool_resource(pool_options(), upstream).

      +
      4. +
    4. +
      explicit synchronized_pool_resource(const pool_options & opts) noexcept;
      +

      Effects: Same as unsynchronized_pool_resource(opts, get_default_resource()).

      +
      5. +
    5. synchronized_pool_resource(const synchronized_pool_resource &) = delete;
      6. +
    6. synchronized_pool_resource 
+operator=(const synchronized_pool_resource &) = delete;
      7. +
    7. +
      ~synchronized_pool_resource();
      +

      Effects: Calls this->release().

      +
      8. +
    +
    +
    +

    +synchronized_pool_resource public member functions

    +
      +
    1. +
      void release();
      +

      Effects: Calls Calls upstream_resource()->deallocate() as necessary to release all allocated memory. [ Note: memory is released back to upstream_resource() even if deallocate has not been called for some of the allocated blocks. - end note ]

      +
      2. +
    2. +
      memory_resource * upstream_resource() const;
      +

      Returns: The value of the upstream argument provided to the constructor of this object.

      +
      3. +
    3. +
      pool_options options() const;
      +

      Returns: The options that control the pooling behavior of this resource. The values in the returned struct may differ from those supplied to the pool resource constructor in that values of zero will be replaced with implementation-defined defaults and sizes may be rounded to unspecified granularity.

      +
      4. +
    4. +
      std::size_t pool_count() const;
      +

      Returns: The number of pools that will be used in the pool resource.

      +

      Note: Non-standard extension.

      +
      5. +
    5. +
      std::size_t pool_index(std::size_t bytes) const;
      +

      Returns: The index of the pool that will be used to serve the allocation of bytes. Returns pool_count() if bytes is bigger than options().largest_required_pool_block (no pool will be used to serve this).

      +

      Note: Non-standard extension.

      +
      6. +
    6. +
      std::size_t pool_next_blocks_per_chunk(std::size_t pool_idx) const;
      +

      Requires: pool_idx < pool_index()

      +

      Returns: The number blocks that will be allocated in the next chunk from the pool specified by pool_idx.

      +

      Note: Non-standard extension.

      +
      7. +
    7. +
      std::size_t pool_block(std::size_t pool_idx) const;
      +

      Requires: pool_idx < pool_index()

      +

      Returns: The number of bytes of the block that the specified pool_idx pool manages.

      +

      Note: Non-standard extension.

      +
      8. +
    8. +
      std::size_t pool_cached_blocks(std::size_t pool_idx) const;
      +

      Requires: pool_idx < pool_index()

      +

      Returns: The number of blocks that the specified pool_idx pool has cached and will be served without calling the upstream_allocator.

      +

      Note: Non-standard extension.

      +
      9. +
    +
    +
    +

    +synchronized_pool_resource protected member functions

    +
      +
    1. +
      virtual void * do_allocate(std::size_t bytes, std::size_t alignment);
      +

      Returns: A pointer to allocated storage with a size of at least bytes. The size and alignment of the allocated memory shall meet the requirements for a class derived from memory_resource.

      +

      Effects: If the pool selected for a block of size bytes is unable to satisfy the memory request from its own internal data structures, it will call upstream_resource()->allocate() to obtain more memory. If bytes is larger than that which the largest pool can handle, then memory will be allocated using upstream_resource()->allocate().

      +

      Throws: Nothing unless upstream_resource()->allocate() throws.

      +
      2. +
    2. +
      virtual void do_deallocate(void * p, std::size_t bytes, std::size_t alignment);
      +

      Effects: Return the memory at p to the pool. It is unspecified if or under what circumstances this operation will result in a call to upstream_resource()->deallocate().

      +

      Throws: Nothing.

      +
      3. +
    3. +
      virtual bool do_is_equal(const memory_resource & other) const noexcept;
      +

      Returns: this == dynamic_cast<const unsynchronized_pool_resource*>(&other).

      +
      4. +
    +
    +
    +
    + + + +
    Copyright © 2009-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/pmr/unsynchr_idm46583871327984.html b/doc/html/boost/container/pmr/unsynchr_idm46583871327984.html new file mode 100644 index 0000000000..d78097b946 --- /dev/null +++ b/doc/html/boost/container/pmr/unsynchr_idm46583871327984.html @@ -0,0 +1,194 @@ + + + + +Class unsynchronized_pool_resource + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Class unsynchronized_pool_resource

    +

    boost::container::pmr::unsynchronized_pool_resource

    +
    +

    Synopsis

    +
    // In header: <boost/container/pmr/unsynchronized_pool_resource.hpp>
+
+
+class unsynchronized_pool_resource :
+  public boost::container::pmr::memory_resource
+{
+public:
+  // construct/copy/destruct
+  unsynchronized_pool_resource(const pool_options &, memory_resource *) noexcept;
+  unsynchronized_pool_resource() noexcept;
+  explicit unsynchronized_pool_resource(memory_resource *) noexcept;
+  explicit unsynchronized_pool_resource(const pool_options &) noexcept;
+  unsynchronized_pool_resource(const unsynchronized_pool_resource &) = delete;
+  unsynchronized_pool_resource 
+  operator=(const unsynchronized_pool_resource &) = delete;
+  ~unsynchronized_pool_resource();
+
+  // public member functions
+  void release();
+  memory_resource * upstream_resource() const;
+  pool_options options() const;
+  std::size_t pool_count() const;
+  std::size_t pool_index(std::size_t) const;
+  std::size_t pool_next_blocks_per_chunk(std::size_t) const;
+  std::size_t pool_block(std::size_t) const;
+  std::size_t pool_cached_blocks(std::size_t) const;
+
+  // protected member functions
+  virtual void * do_allocate(std::size_t, std::size_t);
+  virtual void do_deallocate(void *, std::size_t, std::size_t);
+  virtual bool do_is_equal(const memory_resource &) const noexcept;
+};
    +
    +

    Description

    +

    A unsynchronized_pool_resource is a general-purpose memory resources having the following qualities:

    +
      +

    • Each resource owns the allocated memory, and frees it on destruction, even if deallocate has not been called for some of the allocated blocks.

      • +

    • A pool resource consists of a collection of pools, serving requests for different block sizes. Each individual pool manages a collection of chunks that are in turn divided into blocks of uniform size, returned via calls to do_allocate. Each call to do_allocate(size, alignment) is dispatched to the pool serving the smallest blocks accommodating at least size bytes.

      • +

    • When a particular pool is exhausted, allocating a block from that pool results in the allocation of an additional chunk of memory from the upstream allocator (supplied at construction), thus replenishing the pool. With each successive replenishment, the chunk size obtained increases geometrically. [ Note: By allocating memory in chunks, the pooling strategy increases the chance that consecutive allocations will be close together in memory. - end note ]

      • +

    • Allocation requests that exceed the largest block size of any pool are fulfilled directly from the upstream allocator.

      • +

    • A pool_options struct may be passed to the pool resource constructors to tune the largest block size and the maximum chunk size.

      • +
    +

    +

    +

    An unsynchronized_pool_resource class may not be accessed from multiple threads simultaneously and thus avoids the cost of synchronization entirely in single-threaded applications.

    +
    +

    +unsynchronized_pool_resource + public + construct/copy/destruct

    +
      +
    1. +
      unsynchronized_pool_resource(const pool_options & opts, 
+                             memory_resource * upstream) noexcept;
      +

      Requires: upstream is the address of a valid memory resource.

      +

      Effects: Constructs a pool resource object that will obtain memory from upstream whenever the pool resource is unable to satisfy a memory request from its own internal data structures. The resulting object will hold a copy of upstream, but will not own the resource to which upstream points. [ Note: The intention is that calls to upstream->allocate() will be substantially fewer than calls to this->allocate() in most cases. - end note The behavior of the pooling mechanism is tuned according to the value of the opts argument.

      +

      Throws: Nothing unless upstream->allocate() throws. It is unspecified if or under what conditions this constructor calls upstream->allocate().

      +
      2. +
    2. +
      unsynchronized_pool_resource() noexcept;
      +

      Effects: Same as unsynchronized_pool_resource(pool_options(), get_default_resource()).

      +
      3. +
    3. +
      explicit unsynchronized_pool_resource(memory_resource * upstream) noexcept;
      +

      Effects: Same as unsynchronized_pool_resource(pool_options(), upstream).

      +
      4. +
    4. +
      explicit unsynchronized_pool_resource(const pool_options & opts) noexcept;
      +

      Effects: Same as unsynchronized_pool_resource(opts, get_default_resource()).

      +
      5. +
    5. unsynchronized_pool_resource(const unsynchronized_pool_resource &) = delete;
      6. +
    6. unsynchronized_pool_resource 
+operator=(const unsynchronized_pool_resource &) = delete;
      7. +
    7. +
      ~unsynchronized_pool_resource();
      +

      Effects: Calls this->release().

      +
      8. +
    +
    +
    +

    +unsynchronized_pool_resource public member functions

    +
      +
    1. +
      void release();
      +

      Effects: Calls Calls upstream_resource()->deallocate() as necessary to release all allocated memory. [ Note: memory is released back to upstream_resource() even if deallocate has not been called for some of the allocated blocks. - end note ]

      +
      2. +
    2. +
      memory_resource * upstream_resource() const;
      +

      Returns: The value of the upstream argument provided to the constructor of this object.

      +
      3. +
    3. +
      pool_options options() const;
      +

      Returns: The options that control the pooling behavior of this resource. The values in the returned struct may differ from those supplied to the pool resource constructor in that values of zero will be replaced with implementation-defined defaults and sizes may be rounded to unspecified granularity.

      +
      4. +
    4. +
      std::size_t pool_count() const;
      +

      Returns: The number of pools that will be used in the pool resource.

      +

      Note: Non-standard extension.

      +
      5. +
    5. +
      std::size_t pool_index(std::size_t bytes) const;
      +

      Returns: The index of the pool that will be used to serve the allocation of bytes. Returns pool_count() if bytes is bigger than options().largest_required_pool_block (no pool will be used to serve this).

      +

      Note: Non-standard extension.

      +
      6. +
    6. +
      std::size_t pool_next_blocks_per_chunk(std::size_t pool_idx) const;
      +

      Requires: pool_idx < pool_index()

      +

      Returns: The number blocks that will be allocated in the next chunk from the pool specified by pool_idx.

      +

      Note: Non-standard extension.

      +
      7. +
    7. +
      std::size_t pool_block(std::size_t pool_idx) const;
      +

      Requires: pool_idx < pool_index()

      +

      Returns: The number of bytes of the block that the specified pool_idx pool manages.

      +

      Note: Non-standard extension.

      +
      8. +
    8. +
      std::size_t pool_cached_blocks(std::size_t pool_idx) const;
      +

      Requires: pool_idx < pool_index()

      +

      Returns: The number of blocks that the specified pool_idx pool has cached and will be served without calling the upstream_allocator.

      +

      Note: Non-standard extension.

      +
      9. +
    +
    +
    +

    +unsynchronized_pool_resource protected member functions

    +
      +
    1. +
      virtual void * do_allocate(std::size_t bytes, std::size_t alignment);
      +

      Returns: A pointer to allocated storage with a size of at least bytes. The size and alignment of the allocated memory shall meet the requirements for a class derived from memory_resource.

      +

      Effects: If the pool selected for a block of size bytes is unable to satisfy the memory request from its own internal data structures, it will call upstream_resource()->allocate() to obtain more memory. If bytes is larger than that which the largest pool can handle, then memory will be allocated using upstream_resource()->allocate().

      +

      Throws: Nothing unless upstream_resource()->allocate() throws.

      +
      2. +
    2. +
      virtual void do_deallocate(void * p, std::size_t bytes, std::size_t alignment);
      +

      Effects: Return the memory at p to the pool. It is unspecified if or under what circumstances this operation will result in a call to upstream_resource()->deallocate().

      +

      Throws: Nothing.

      +
      3. +
    3. +
      virtual bool do_is_equal(const memory_resource & other) const noexcept;
      +

      Returns: this == dynamic_cast<const unsynchronized_pool_resource*>(&other).

      +
      4. +
    +
    +
    +
    + + + +
    Copyright © 2009-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/pmr/vector_of.html b/doc/html/boost/container/pmr/vector_of.html new file mode 100644 index 0000000000..25d1d36134 --- /dev/null +++ b/doc/html/boost/container/pmr/vector_of.html @@ -0,0 +1,54 @@ + + + + +Struct template vector_of + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct template vector_of

    +

    boost::container::pmr::vector_of

    +
    +

    Synopsis

    +
    // In header: <boost/container/pmr/vector.hpp>
+
+template<typename T> 
+struct vector_of {
+  // types
+  typedef boost::container::vector< T, polymorphic_allocator< T > > type;
+};
    +
    + + + +
    Copyright © 2009-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/scoped_allocat_idp60083856.html b/doc/html/boost/container/scoped_allocat_idp60083856.html deleted file mode 100644 index a145b23639..0000000000 --- a/doc/html/boost/container/scoped_allocat_idp60083856.html +++ /dev/null @@ -1,71 +0,0 @@ - - - - -Struct template scoped_allocator_operator_equal - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template scoped_allocator_operator_equal

    -

    boost::container::scoped_allocator_operator_equal

    -
    -

    Synopsis

    -
    // In header: <boost/container/scoped_allocator.hpp>
-
-template<bool ZeroInner> 
-struct scoped_allocator_operator_equal {
-
-  // public static functions
-  template<typename IA> static bool equal_outer(const IA &, const IA &);
-  template<typename IA1, typename IA2> 
-    static bool equal_outer(const IA1 &, const IA2 &);
-  template<typename IA> static bool equal_inner(const IA &, const IA &);
-};
    -
    -

    Description

    -
    -

    -scoped_allocator_operator_equal public static functions

    -
      -
    1. template<typename IA> static bool equal_outer(const IA & l, const IA & r);
      2. -
    2. template<typename IA1, typename IA2> 
-  static bool equal_outer(const IA1 & l, const IA2 & r);
      3. -
    3. template<typename IA> static bool equal_inner(const IA & l, const IA & r);
      4. -
    -
    -
    -
    - - - -
    Copyright © 2009-2013 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/container/scoped_allocat_idp60096720.html b/doc/html/boost/container/scoped_allocat_idp60096720.html deleted file mode 100644 index cf40456a8e..0000000000 --- a/doc/html/boost/container/scoped_allocat_idp60096720.html +++ /dev/null @@ -1,67 +0,0 @@ - - - - -Struct scoped_allocator_operator_equal<true> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct scoped_allocator_operator_equal<true>

    -

    boost::container::scoped_allocator_operator_equal<true>

    -
    -

    Synopsis

    -
    // In header: <boost/container/scoped_allocator.hpp>
-
-
-struct scoped_allocator_operator_equal<true> :
-  public boost::container::scoped_allocator_operator_equal< false >
-{
-
-  // public static functions
-  template<typename IA1, typename IA2> 
-    static bool equal_inner(const IA1 &, const IA2 &);
-};
    -
    -

    Description

    -
    -

    -scoped_allocator_operator_equal public static functions

    -
    1. template<typename IA1, typename IA2> 
-  static bool equal_inner(const IA1 &, const IA2 &);
    -
    -
    -
    - - - -
    Copyright © 2009-2013 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/container/scoped_allocator_adaptor.html b/doc/html/boost/container/scoped_allocator_adaptor.html index 764eb4f369..7bbff18577 100644 --- a/doc/html/boost/container/scoped_allocator_adaptor.html +++ b/doc/html/boost/container/scoped_allocator_adaptor.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -47,9 +47,9 @@ typedef outer_traits_type::const_pointer const_pointer; typedef outer_traits_type::void_pointer void_pointer; typedef outer_traits_type::const_void_pointer const_void_pointer; - typedef base_type::propagate_on_container_copy_assignment propagate_on_container_copy_assignment; - typedef base_type::propagate_on_container_move_assignment propagate_on_container_move_assignment; - typedef base_type::propagate_on_container_swap propagate_on_container_swap; + typedef base_type::propagate_on_container_copy_assignment propagate_on_container_copy_assignment; + typedef base_type::propagate_on_container_move_assignment propagate_on_container_move_assignment; + typedef base_type::propagate_on_container_swap propagate_on_container_swap; typedef base_type::is_always_equal is_always_equal; // member classes/structs/unions @@ -60,59 +60,45 @@ }; // construct/copy/destruct - scoped_allocator_adaptor(); - scoped_allocator_adaptor(const scoped_allocator_adaptor &); - scoped_allocator_adaptor(scoped_allocator_adaptor &&); + scoped_allocator_adaptor(); + scoped_allocator_adaptor(const scoped_allocator_adaptor &); + scoped_allocator_adaptor(scoped_allocator_adaptor &&); template<typename OuterA2> - scoped_allocator_adaptor(OuterA2 &&, const InnerAllocs &...); + scoped_allocator_adaptor(OuterA2 &&, const InnerAllocs &...); template<typename OuterA2> - scoped_allocator_adaptor(const scoped_allocator_adaptor< OuterA2, InnerAllocs...> &); + scoped_allocator_adaptor(const scoped_allocator_adaptor< OuterA2, InnerAllocs...> &); template<typename OuterA2> - scoped_allocator_adaptor(scoped_allocator_adaptor< OuterA2, InnerAllocs...> &&); - scoped_allocator_adaptor & operator=(const scoped_allocator_adaptor &); - scoped_allocator_adaptor & operator=(scoped_allocator_adaptor &&); - ~scoped_allocator_adaptor(); + scoped_allocator_adaptor(scoped_allocator_adaptor< OuterA2, InnerAllocs...> &&); + scoped_allocator_adaptor & operator=(const scoped_allocator_adaptor &); + scoped_allocator_adaptor & operator=(scoped_allocator_adaptor &&); + ~scoped_allocator_adaptor(); - // public member functions - void swap(scoped_allocator_adaptor &); - outer_allocator_type & outer_allocator() noexcept; - const outer_allocator_type & outer_allocator() const noexcept; - inner_allocator_type & inner_allocator() noexcept; - inner_allocator_type const & inner_allocator() const noexcept; - size_type max_size() const noexcept; - template<typename T> void destroy(T *) noexcept; - pointer allocate(size_type); - pointer allocate(size_type, const_void_pointer); - void deallocate(pointer, size_type); - scoped_allocator_adaptor select_on_container_copy_construction() const; - template<typename T, class... Args> void construct(T *, Args &&...); - template<typename T1, typename T2> void construct(std::pair< T1, T2 > *); - template<typename T1, typename T2> void construct(unspecified); - template<typename T1, typename T2, typename U, typename V> - void construct(std::pair< T1, T2 > *, U &&, V &&); - template<typename T1, typename T2, typename U, typename V> - void construct(unspecified, U &&, V &&); - template<typename T1, typename T2, typename U, typename V> - void construct(std::pair< T1, T2 > *, const std::pair< U, V > &); - template<typename T1, typename T2, typename U, typename V> - void construct(unspecified, unspecified); - template<typename T1, typename T2, typename U, typename V> - void construct(std::pair< T1, T2 > *, std::pair< U, V > &&); - template<typename T1, typename T2, typename U, typename V> - void construct(unspecified, unspecified); + // public member functions + void swap(scoped_allocator_adaptor &); + outer_allocator_type & outer_allocator() noexcept; + const outer_allocator_type & outer_allocator() const noexcept; + inner_allocator_type & inner_allocator() noexcept; + inner_allocator_type const & inner_allocator() const noexcept; + size_type max_size() const noexcept; + template<typename T> void destroy(T *) noexcept; + pointer allocate(size_type); + pointer allocate(size_type, const_void_pointer); + void deallocate(pointer, size_type); + scoped_allocator_adaptor select_on_container_copy_construction() const; + template<typename T, class... Args> void construct(T *, Args &&...); - // friend functions - friend void swap(scoped_allocator_adaptor &, scoped_allocator_adaptor &); + // friend functions + friend void swap(scoped_allocator_adaptor &, scoped_allocator_adaptor &); };
    -

    Description

    +

    Description

    This class is a C++03-compatible implementation of std::scoped_allocator_adaptor. The class template scoped_allocator_adaptor is an allocator template that specifies the memory resource (the outer allocator) to be used by a container (as any other allocator does) and also specifies an inner allocator resource to be passed to the constructor of every element within the container.

    This adaptor is instantiated with one outer and zero or more inner allocator types. If instantiated with only one allocator type, the inner allocator becomes the scoped_allocator_adaptor itself, thus using the same allocator resource for the container and every element within the container and, if the elements themselves are containers, each of their elements recursively. If instantiated with more than one allocator, the first allocator is the outer allocator for use by the container, the second allocator is passed to the constructors of the container's elements, and, if the elements themselves are containers, the third allocator is passed to the elements' elements, and so on. If containers are nested to a depth greater than the number of allocators, the last allocator is used repeatedly, as in the single-allocator case, for any remaining recursions.

    [Note: The scoped_allocator_adaptor is derived from the outer allocator type so it can be substituted for the outer allocator type in most expressions. -end note]

    In the construct member functions, OUTERMOST(x) is x if x does not have an outer_allocator() member function and OUTERMOST(x.outer_allocator()) otherwise; OUTERMOST_ALLOC_TRAITS(x) is allocator_traits<decltype(OUTERMOST(x))>.

    [Note: OUTERMOST(x) and OUTERMOST_ALLOC_TRAITS(x) are recursive operations. It is incumbent upon the definition of outer_allocator() to ensure that the recursion terminates. It will terminate for all instantiations of scoped_allocator_adaptor. -end note]

    -

    +

    scoped_allocator_adaptor public types

    @@ -129,147 +115,133 @@

  • -typedef base_type::propagate_on_container_copy_assignment propagate_on_container_copy_assignment;

    -

    Type: A type with a constant boolean value == true if allocator_traits<Allocator>::propagate_on_container_copy_assignment::value is true for any Allocator in the set of OuterAlloc and InnerAllocs..., false otherwise.

    +typedef base_type::propagate_on_container_copy_assignment propagate_on_container_copy_assignment;

    +

    Type: A type with a constant boolean value == true if allocator_traits<Allocator>:: propagate_on_container_copy_assignment::value is true for any Allocator in the set of OuterAlloc and InnerAllocs..., false otherwise.

  • -typedef base_type::propagate_on_container_move_assignment propagate_on_container_move_assignment;

    -

    Type: A type with a constant boolean value == true if allocator_traits<Allocator>::propagate_on_container_move_assignment::value is true for any Allocator in the set of OuterAlloc and InnerAllocs..., false otherwise.

    +typedef base_type::propagate_on_container_move_assignment propagate_on_container_move_assignment;

    +

    Type: A type with a constant boolean value == true if allocator_traits<Allocator>:: propagate_on_container_move_assignment::value is true for any Allocator in the set of OuterAlloc and InnerAllocs..., false otherwise.

  • -typedef base_type::propagate_on_container_swap propagate_on_container_swap;

    -

    Type: A type with a constant boolean value == true if allocator_traits<Allocator>::propagate_on_container_swap::value is true for any Allocator in the set of OuterAlloc and InnerAllocs..., false otherwise.

    +typedef base_type::propagate_on_container_swap propagate_on_container_swap;

    +

    Type: A type with a constant boolean value == true if allocator_traits<Allocator>:: propagate_on_container_swap::value is true for any Allocator in the set of OuterAlloc and InnerAllocs..., false otherwise.

  • typedef base_type::is_always_equal is_always_equal;

    -

    Type: A type with a constant boolean value == true if allocator_traits<Allocator>::is_always_equal::value is true for all Allocator in the set of OuterAlloc and InnerAllocs..., false otherwise.

    +

    Type: A type with a constant boolean value == true if allocator_traits<Allocator>:: is_always_equal::value is true for all Allocator in the set of OuterAlloc and InnerAllocs..., false otherwise.

    • -

    +

    scoped_allocator_adaptor public construct/copy/destruct

    1. -
      scoped_allocator_adaptor();
      +
      scoped_allocator_adaptor();

      Effects: value-initializes the OuterAlloc base class and the inner allocator object.

    2. -
      scoped_allocator_adaptor(const scoped_allocator_adaptor & other);
      +
      scoped_allocator_adaptor(const scoped_allocator_adaptor & other);

      Effects: initializes each allocator within the adaptor with the corresponding allocator from other.

    3. -
      scoped_allocator_adaptor(scoped_allocator_adaptor && other);
      +
      scoped_allocator_adaptor(scoped_allocator_adaptor && other);

      Effects: move constructs each allocator within the adaptor with the corresponding allocator from other. 

    4. template<typename OuterA2> 
-  scoped_allocator_adaptor(OuterA2 && outerAlloc, 
+  scoped_allocator_adaptor(OuterA2 && outerAlloc, 
                            const InnerAllocs &... innerAllocs);

      Requires: OuterAlloc shall be constructible from OuterA2.

      Effects: initializes the OuterAlloc base class with boost::forward<OuterA2>(outerAlloc) and inner with innerAllocs...(hence recursively initializing each allocator within the adaptor with the corresponding allocator from the argument list). 

    5. template<typename OuterA2> 
-  scoped_allocator_adaptor(const scoped_allocator_adaptor< OuterA2, InnerAllocs...> & other);
      + scoped_allocator_adaptor(const scoped_allocator_adaptor< OuterA2, InnerAllocs...> & other);

      Requires: OuterAlloc shall be constructible from OuterA2.

      Effects: initializes each allocator within the adaptor with the corresponding allocator from other. 

    6. template<typename OuterA2> 
-  scoped_allocator_adaptor(scoped_allocator_adaptor< OuterA2, InnerAllocs...> && other);
      + scoped_allocator_adaptor(scoped_allocator_adaptor< OuterA2, InnerAllocs...> && other);

      Requires: OuterAlloc shall be constructible from OuterA2.

      Effects: initializes each allocator within the adaptor with the corresponding allocator rvalue from other.

      7. -
    7. scoped_allocator_adaptor & operator=(const scoped_allocator_adaptor & other);
      8. -
    8. scoped_allocator_adaptor & operator=(scoped_allocator_adaptor && other);
      9. -
    9. ~scoped_allocator_adaptor();
      10. +
    10. scoped_allocator_adaptor & operator=(const scoped_allocator_adaptor & other);
      11. +
    11. scoped_allocator_adaptor & operator=(scoped_allocator_adaptor && other);
      12. +
    12. ~scoped_allocator_adaptor();
    -

    -scoped_allocator_adaptor public member functions

    +

    +scoped_allocator_adaptor public member functions

    1. -
      void swap(scoped_allocator_adaptor & r);
      +
      void swap(scoped_allocator_adaptor & r);

      Effects: swaps *this with r.

    2. -
      outer_allocator_type & outer_allocator() noexcept;
      +
      outer_allocator_type & outer_allocator() noexcept;

      Returns: static_cast<OuterAlloc&>(*this).

    3. -
      const outer_allocator_type & outer_allocator() const noexcept;
      +
      const outer_allocator_type & outer_allocator() const noexcept;

      Returns: static_cast<const OuterAlloc&>(*this).

    4. -
      inner_allocator_type & inner_allocator() noexcept;
      +
      inner_allocator_type & inner_allocator() noexcept;

      Returns: *this if sizeof...(InnerAllocs) is zero; otherwise, inner.

    5. -
      inner_allocator_type const & inner_allocator() const noexcept;
      +
      inner_allocator_type const & inner_allocator() const noexcept;

      Returns: *this if sizeof...(InnerAllocs) is zero; otherwise, inner.

    6. -
      size_type max_size() const noexcept;
      -

      Returns: allocator_traits<OuterAlloc>::max_size(outer_allocator()).

      +
      size_type max_size() const noexcept;
      +

      Returns: allocator_traits<OuterAlloc>:: max_size(outer_allocator()).

    7. -
      template<typename T> void destroy(T * p) noexcept;
      -

      Effects: calls OUTERMOST_ALLOC_TRAITS(*this)::destroy(OUTERMOST(*this), p).

      +
      template<typename T> void destroy(T * p) noexcept;
      +

      Effects: calls OUTERMOST_ALLOC_TRAITS(*this):: destroy(OUTERMOST(*this), p).

    8. -
      pointer allocate(size_type n);
      +
      pointer allocate(size_type n);

      Returns: allocator_traits<OuterAlloc>::allocate(outer_allocator(), n).

    9. -
      pointer allocate(size_type n, const_void_pointer hint);
      +
      pointer allocate(size_type n, const_void_pointer hint);

      Returns: allocator_traits<OuterAlloc>::allocate(outer_allocator(), n, hint).

    10. -
      void deallocate(pointer p, size_type n);
      +
      void deallocate(pointer p, size_type n);

      Effects: allocator_traits<OuterAlloc>::deallocate(outer_allocator(), p, n).

    11. -
      scoped_allocator_adaptor select_on_container_copy_construction() const;
      +
      scoped_allocator_adaptor select_on_container_copy_construction() const;

      Returns: A new scoped_allocator_adaptor object where each allocator Allocator in the adaptor is initialized from the result of calling allocator_traits<Allocator>::select_on_container_copy_construction() on the corresponding allocator in *this.

    12. -
      template<typename T, class... Args> void construct(T * p, Args &&... args);
      -

      Effects: 1) If uses_allocator<T, inner_allocator_type>::value is false calls OUTERMOST_ALLOC_TRAITS(*this)::construct (OUTERMOST(*this), p, std::forward<Args>(args)...).

      -

      2) Otherwise, if uses_allocator<T, inner_allocator_type>::value is true and is_constructible<T, allocator_arg_t, inner_allocator_type, Args...>::value is true, calls OUTERMOST_ALLOC_TRAITS(*this)::construct(OUTERMOST(*this), p, allocator_arg, inner_allocator(), std::forward<Args>(args)...).

      +
      template<typename T, class... Args> void construct(T * p, Args &&... args);
      +

      Effects: 1) If uses_allocator<T, inner_allocator_type>::value is false calls OUTERMOST_ALLOC_TRAITS(*this):: construct(OUTERMOST(*this), p, std::forward<Args>(args)...).

      +

      2) Otherwise, if uses_allocator<T, inner_allocator_type>::value is true and is_constructible<T, allocator_arg_t, inner_allocator_type, Args...>:: value is true, calls OUTERMOST_ALLOC_TRAITS(*this):: construct(OUTERMOST(*this), p, allocator_arg, inner_allocator(), std::forward<Args>(args)...).

      [Note: In compilers without advanced decltype SFINAE support, is_constructible can't be implemented so that condition will be replaced by constructible_with_allocator_prefix<T>::value. -end note]

      -

      3) Otherwise, if uses_allocator<T, inner_allocator_type>::value is true and is_constructible<T, Args..., inner_allocator_type>::value is true, calls OUTERMOST_ALLOC_TRAITS(*this)::construct(OUTERMOST(*this), p, std::forward<Args>(args)..., inner_allocator()).

      -

      [Note: In compilers without advanced decltype SFINAE support, is_constructible can't be implemented so that condition will be replaced by constructible_with_allocator_suffix<T>::value. -end note]

      +

      3) Otherwise, if uses_allocator<T, inner_allocator_type>::value is true and is_constructible<T, Args..., inner_allocator_type>:: value is true, calls OUTERMOST_ALLOC_TRAITS(*this):: construct(OUTERMOST(*this), p, std::forward<Args>(args)..., inner_allocator()).

      +

      [Note: In compilers without advanced decltype SFINAE support, is_constructible can't be implemented so that condition will be replaced by constructible_with_allocator_suffix<T>:: value. -end note]

      4) Otherwise, the program is ill-formed.

      [Note: An error will result if uses_allocator evaluates to true but the specific constructor does not take an allocator. This definition prevents a silent failure to pass an inner allocator to a contained element. -end note]

      13. -
    13. template<typename T1, typename T2> void construct(std::pair< T1, T2 > * p);
      14. -
    14. template<typename T1, typename T2> void construct(unspecified p);
      15. -
    15. template<typename T1, typename T2, typename U, typename V> 
-  void construct(std::pair< T1, T2 > * p, U && x, V && y);
      16. -
    16. template<typename T1, typename T2, typename U, typename V> 
-  void construct(unspecified p, U && x, V && y);
      17. -
    17. template<typename T1, typename T2, typename U, typename V> 
-  void construct(std::pair< T1, T2 > * p, const std::pair< U, V > & x);
      18. -
    18. template<typename T1, typename T2, typename U, typename V> 
-  void construct(unspecified p, unspecified x);
      19. -
    19. template<typename T1, typename T2, typename U, typename V> 
-  void construct(std::pair< T1, T2 > * p, std::pair< U, V > && x);
      20. -
    20. template<typename T1, typename T2, typename U, typename V> 
-  void construct(unspecified p, unspecified x);
    -

    -scoped_allocator_adaptor friend functions

    +

    +scoped_allocator_adaptor friend functions

    1. -
      friend void swap(scoped_allocator_adaptor & l, scoped_allocator_adaptor & r);
      +
      friend void swap(scoped_allocator_adaptor & l, scoped_allocator_adaptor & r);

      Effects: swaps *this with r.

    @@ -277,7 +249,7 @@ -
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -285,7 +257,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/container/scoped_allocator_adaptor/rebind.html b/doc/html/boost/container/scoped_allocator_adaptor/rebind.html index 54e3c9722e..776c0639ae 100644 --- a/doc/html/boost/container/scoped_allocator_adaptor/rebind.html +++ b/doc/html/boost/container/scoped_allocator_adaptor/rebind.html @@ -6,9 +6,9 @@ - + - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -39,13 +39,13 @@ typedef scoped_allocator_adaptor< typename outer_traits_type::template portable_rebind_alloc< U >::type, InnerAllocs...> other; };
    -

    Description

    +

    Description

    Type: Rebinds scoped allocator to typedef scoped_allocator_adaptor < typename outer_traits_type::template portable_rebind_alloc<U>::type , InnerAllocs... >

    -
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -53,7 +53,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/container/set.html b/doc/html/boost/container/set.html index 9d50853dcf..22395a4729 100644 --- a/doc/html/boost/container/set.html +++ b/doc/html/boost/container/set.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -57,98 +57,98 @@ typedef implementation_defined const_reverse_iterator; // construct/copy/destruct - set(); - explicit set(const Compare &, const allocator_type & = allocator_type()); - explicit set(const allocator_type &); + set(); + explicit set(const Compare &, const allocator_type & = allocator_type()); + explicit set(const allocator_type &); template<typename InputIterator> - set(InputIterator, InputIterator, const Compare & = Compare(), + set(InputIterator, InputIterator, const Compare & = Compare(), const allocator_type & = allocator_type()); template<typename InputIterator> - set(InputIterator, InputIterator, const allocator_type &); + set(InputIterator, InputIterator, const allocator_type &); template<typename InputIterator> - set(ordered_unique_range_t, InputIterator, InputIterator, + set(ordered_unique_range_t, InputIterator, InputIterator, const Compare & = Compare(), const allocator_type & = allocator_type()); - set(std::initializer_list< value_type >, const Compare & = Compare(), + set(std::initializer_list< value_type >, const Compare & = Compare(), const allocator_type & = allocator_type()); - set(std::initializer_list< value_type >, const allocator_type &); - set(ordered_unique_range_t, std::initializer_list< value_type >, + set(std::initializer_list< value_type >, const allocator_type &); + set(ordered_unique_range_t, std::initializer_list< value_type >, const Compare & = Compare(), const allocator_type & = allocator_type()); - set(const set &); - set(set &&); - set(const set &, const allocator_type &); - set(set &&, const allocator_type &); - set & operator=(const set &); - set & operator=(set &&) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_move_assignable< Compare >::value)); - set & operator=(std::initializer_list< value_type >); + set(const set &); + set(set &&); + set(const set &, const allocator_type &); + set(set &&, const allocator_type &); + set & operator=(const set &); + set & operator=(set &&) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_move_assignable< Compare >::value)); + set & operator=(std::initializer_list< value_type >); - // public member functions - allocator_type get_allocator() const; - stored_allocator_type & get_stored_allocator(); - const stored_allocator_type & get_stored_allocator() const; - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end(); - const_iterator end() const; - const_iterator cend() const; - reverse_iterator rbegin(); - const_reverse_iterator rbegin() const; - const_reverse_iterator crbegin() const; - reverse_iterator rend(); - const_reverse_iterator rend() const; - const_reverse_iterator crend() const; - bool empty() const; - size_type size() const; - size_type max_size() const; - template<class... Args> std::pair< iterator, bool > emplace(Args &&...); - template<class... Args> iterator emplace_hint(const_iterator, Args &&...); - std::pair< iterator, bool > insert(const value_type &); - std::pair< iterator, bool > insert(value_type &&); - iterator insert(const_iterator, const value_type &); - iterator insert(const_iterator, value_type &&); - template<typename InputIterator> void insert(InputIterator, InputIterator); - void insert(std::initializer_list< value_type >); - iterator erase(const_iterator); - size_type erase(const key_type &); - iterator erase(const_iterator, const_iterator); - void swap(set &) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_swappable< Compare >::value)); - void clear(); - key_compare key_comp() const; - value_compare value_comp() const; - iterator find(const key_type &); - const_iterator find(const key_type &) const; - size_type count(const key_type &) const; - size_type count(const key_type &); - iterator lower_bound(const key_type &); - const_iterator lower_bound(const key_type &) const; - iterator upper_bound(const key_type &); - const_iterator upper_bound(const key_type &) const; - std::pair< iterator, iterator > equal_range(const key_type &); + // public member functions + allocator_type get_allocator() const; + stored_allocator_type & get_stored_allocator(); + const stored_allocator_type & get_stored_allocator() const; + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end(); + const_iterator end() const; + const_iterator cend() const; + reverse_iterator rbegin(); + const_reverse_iterator rbegin() const; + const_reverse_iterator crbegin() const; + reverse_iterator rend(); + const_reverse_iterator rend() const; + const_reverse_iterator crend() const; + bool empty() const; + size_type size() const; + size_type max_size() const; + template<class... Args> std::pair< iterator, bool > emplace(Args &&...); + template<class... Args> iterator emplace_hint(const_iterator, Args &&...); + std::pair< iterator, bool > insert(const value_type &); + std::pair< iterator, bool > insert(value_type &&); + iterator insert(const_iterator, const value_type &); + iterator insert(const_iterator, value_type &&); + template<typename InputIterator> void insert(InputIterator, InputIterator); + void insert(std::initializer_list< value_type >); + iterator erase(const_iterator); + size_type erase(const key_type &); + iterator erase(const_iterator, const_iterator); + void swap(set &) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_swappable< Compare >::value)); + void clear(); + key_compare key_comp() const; + value_compare value_comp() const; + iterator find(const key_type &); + const_iterator find(const key_type &) const; + size_type count(const key_type &) const; + size_type count(const key_type &); + iterator lower_bound(const key_type &); + const_iterator lower_bound(const key_type &) const; + iterator upper_bound(const key_type &); + const_iterator upper_bound(const key_type &) const; + std::pair< iterator, iterator > equal_range(const key_type &); std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; - std::pair< iterator, iterator > equal_range(const key_type &); + equal_range(const key_type &) const; + std::pair< iterator, iterator > equal_range(const key_type &); std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; - void rebalance(); + equal_range(const key_type &) const; + void rebalance(); - // friend functions - friend bool operator==(const set &, const set &); - friend bool operator!=(const set &, const set &); - friend bool operator<(const set &, const set &); - friend bool operator>(const set &, const set &); - friend bool operator<=(const set &, const set &); - friend bool operator>=(const set &, const set &); - friend void swap(set &, set &); + // friend functions + friend bool operator==(const set &, const set &); + friend bool operator!=(const set &, const set &); + friend bool operator<(const set &, const set &); + friend bool operator>(const set &, const set &); + friend bool operator<=(const set &, const set &); + friend bool operator>=(const set &, const set &); + friend void swap(set &, set &); };
    -

    Description

    +

    Description

    A set is a kind of associative container that supports unique keys (contains at most one of each key value) and provides for fast retrieval of the keys themselves. Class set supports bidirectional iterators.

    A set satisfies all of the requirements of a container and of a reversible container , and of an associative container. A set also provides most operations described in for unique keys.

    -

    Template Parameters

    +

    Template Parameters

    1. typename Key
      @@ -169,30 +169,30 @@
    -

    +

    set public construct/copy/destruct

    1. -
      set();
      +
      set();

      Effects: Default constructs an empty set.

      Complexity: Constant.

    2. -
      explicit set(const Compare & comp, 
+
      explicit set(const Compare & comp, 
              const allocator_type & a = allocator_type());
      
 
      Effects: Constructs an empty set using the specified comparison object and allocator.
      
 
      Complexity: Constant.
    3. -
      explicit set(const allocator_type & a);
      +
      explicit set(const allocator_type & a);

      Effects: Constructs an empty set using the specified allocator object.

      Complexity: Constant. 

    4. template<typename InputIterator> 
-  set(InputIterator first, InputIterator last, 
+  set(InputIterator first, InputIterator last, 
       const Compare & comp = Compare(), 
       const allocator_type & a = allocator_type());

      Effects: Constructs an empty set using the specified comparison object and allocator, and inserts elements from the range [first ,last ).

      @@ -200,13 +200,13 @@ 
    5. template<typename InputIterator> 
-  set(InputIterator first, InputIterator last, const allocator_type & a);
      + set(InputIterator first, InputIterator last, const allocator_type & a);

      Effects: Constructs an empty set using the specified allocator, and inserts elements from the range [first ,last ).

      Complexity: Linear in N if the range [first ,last ) is already sorted using comp and otherwise N logN, where N is last - first. 

    6. template<typename InputIterator> 
-  set(ordered_unique_range_t, InputIterator first, InputIterator last, 
+  set(ordered_unique_range_t, InputIterator first, InputIterator last, 
       const Compare & comp = Compare(), 
       const allocator_type & a = allocator_type());

      Effects: Constructs an empty set using the specified comparison object and allocator, and inserts elements from the ordered unique range [first ,last). This function is more efficient than the normal range creation for ordered ranges.

      @@ -215,18 +215,18 @@

      Note: Non-standard extension.

    7. -
      set(std::initializer_list< value_type > il, const Compare & comp = Compare(), 
+
      set(std::initializer_list< value_type > il, const Compare & comp = Compare(), 
     const allocator_type & a = allocator_type());
      
 
      Effects: Constructs an empty set using the specified comparison object and allocator, and inserts elements from the range [il.begin(), il.end()).
      
 
      Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using comp and otherwise N logN, where N is il.begin() - il.end().
    8. -
      set(std::initializer_list< value_type > il, const allocator_type & a);
      +
      set(std::initializer_list< value_type > il, const allocator_type & a);

      Effects: Constructs an empty set using the specified allocator, and inserts elements from the range [il.begin(), il.end()).

      Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using comp and otherwise N logN, where N is il.begin() - il.end().

    9. -
      set(ordered_unique_range_t, std::initializer_list< value_type > il, 
+
      set(ordered_unique_range_t, std::initializer_list< value_type > il, 
     const Compare & comp = Compare(), 
     const allocator_type & a = allocator_type());
      
 
      Effects: Constructs an empty set using the specified comparison object and allocator, and inserts elements from the ordered unique range [il.begin(), il.end()). This function is more efficient than the normal range creation for ordered ranges.
      
@@ -235,155 +235,159 @@
 
      Note: Non-standard extension.
    10. -
      set(const set & x);
      +
      set(const set & x);

      Effects: Copy constructs a set.

      Complexity: Linear in x.size().

    11. -
      set(set && x);
      +
      set(set && x);

      Effects: Move constructs a set. Constructs *this using x's resources.

      Complexity: Constant.

      Postcondition: x is emptied.

    12. -
      set(const set & x, const allocator_type & a);
      +
      set(const set & x, const allocator_type & a);

      Effects: Copy constructs a set using the specified allocator.

      Complexity: Linear in x.size().

    13. -
      set(set && x, const allocator_type & a);
      +
      set(set && x, const allocator_type & a);

      Effects: Move constructs a set using the specified allocator. Constructs *this using x's resources.

      Complexity: Constant if a == x.get_allocator(), linear otherwise.

    14. -
      set & operator=(const set & x);
      +
      set & operator=(const set & x);

      Effects: Makes *this a copy of x.

      Complexity: Linear in x.size().

    15. -
      set & operator=(set && x) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_move_assignable< Compare >::value));
      +
      set & operator=(set && x) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_move_assignable< Compare >::value));

      Effects: this->swap(x.get()).

      Throws: If allocator_traits_type::propagate_on_container_move_assignment is false and (allocation throws or value_type's move constructor throws)

      Complexity: Constant if allocator_traits_type:: propagate_on_container_move_assignment is true or this->get>allocator() == x.get_allocator(). Linear otherwise.

      16. -
    16. set & operator=(std::initializer_list< value_type > il);
      17. +
    17. +
      set & operator=(std::initializer_list< value_type > il);
      +

      Effects: Copy all elements from il to *this.

      +

      Complexity: Linear in il.size().

      +
    -

    -set public member functions

    +

    +set public member functions

    1. -
      allocator_type get_allocator() const;
      +
      allocator_type get_allocator() const;

      Effects: Returns a copy of the allocator that was passed to the object's constructor.

      Complexity: Constant.

    2. -
      stored_allocator_type & get_stored_allocator();
      +
      stored_allocator_type & get_stored_allocator();

      Effects: Returns a reference to the internal allocator.

      Throws: Nothing

      Complexity: Constant.

      Note: Non-standard extension.

    3. -
      const stored_allocator_type & get_stored_allocator() const;
      +
      const stored_allocator_type & get_stored_allocator() const;

      Effects: Returns a reference to the internal allocator.

      Throws: Nothing

      Complexity: Constant.

      Note: Non-standard extension.

    4. -
      iterator begin();
      +
      iterator begin();

      Effects: Returns an iterator to the first element contained in the container.

      Throws: Nothing.

      Complexity: Constant

    5. -
      const_iterator begin() const;
      +
      const_iterator begin() const;

      Effects: Returns a const_iterator to the first element contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    6. -
      const_iterator cbegin() const;
      +
      const_iterator cbegin() const;

      Effects: Returns a const_iterator to the first element contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    7. -
      iterator end();
      +
      iterator end();

      Effects: Returns an iterator to the end of the container.

      Throws: Nothing.

      Complexity: Constant.

    8. -
      const_iterator end() const;
      +
      const_iterator end() const;

      Effects: Returns a const_iterator to the end of the container.

      Throws: Nothing.

      Complexity: Constant.

    9. -
      const_iterator cend() const;
      +
      const_iterator cend() const;

      Effects: Returns a const_iterator to the end of the container.

      Throws: Nothing.

      Complexity: Constant.

    10. -
      reverse_iterator rbegin();
      +
      reverse_iterator rbegin();

      Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    11. -
      const_reverse_iterator rbegin() const;
      +
      const_reverse_iterator rbegin() const;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    12. -
      const_reverse_iterator crbegin() const;
      +
      const_reverse_iterator crbegin() const;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    13. -
      reverse_iterator rend();
      +
      reverse_iterator rend();

      Effects: Returns a reverse_iterator pointing to the end of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    14. -
      const_reverse_iterator rend() const;
      +
      const_reverse_iterator rend() const;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    15. -
      const_reverse_iterator crend() const;
      +
      const_reverse_iterator crend() const;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    16. -
      bool empty() const;
      +
      bool empty() const;

      Effects: Returns true if the container contains no elements.

      Throws: Nothing.

      Complexity: Constant.

    17. -
      size_type size() const;
      +
      size_type size() const;

      Effects: Returns the number of the elements contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    18. -
      size_type max_size() const;
      +
      size_type max_size() const;

      Effects: Returns the largest possible size of the container.

      Throws: Nothing.

      Complexity: Constant.

    19. -
      template<class... Args> std::pair< iterator, bool > emplace(Args &&... args);
      +
      template<class... Args> std::pair< iterator, bool > emplace(Args &&... args);

      Effects: Inserts an object x of type Key constructed with std::forward<Args>(args)... if and only if there is no element in the container with equivalent value. and returns the iterator pointing to the newly inserted element.

      Returns: The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of x.

      Throws: If memory allocation throws or Key's in-place constructor throws.

      @@ -391,192 +395,192 @@ 
    20. template<class... Args> 
-  iterator emplace_hint(const_iterator p, Args &&... args);
      + iterator emplace_hint(const_iterator p, Args &&... args);

      Effects: Inserts an object of type Key constructed with std::forward<Args>(args)... if and only if there is no element in the container with equivalent value. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic.

    21. -
      std::pair< iterator, bool > insert(const value_type & x);
      +
      std::pair< iterator, bool > insert(const value_type & x);

      Effects: Inserts x if and only if there is no element in the container with key equivalent to the key of x.

      Returns: The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of x.

      Complexity: Logarithmic.

    22. -
      std::pair< iterator, bool > insert(value_type && x);
      +
      std::pair< iterator, bool > insert(value_type && x);

      Effects: Move constructs a new value from x if and only if there is no element in the container with key equivalent to the key of x.

      Returns: The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of x.

      Complexity: Logarithmic.

    23. -
      iterator insert(const_iterator p, const value_type & x);
      +
      iterator insert(const_iterator p, const value_type & x);

      Effects: Inserts a copy of x in the container if and only if there is no element in the container with key equivalent to the key of x. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic in general, but amortized constant if t is inserted right before p.

    24. -
      iterator insert(const_iterator p, value_type && x);
      +
      iterator insert(const_iterator p, value_type && x);

      Effects: Inserts an element move constructed from x in the container. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic. 

    25. template<typename InputIterator> 
-  void insert(InputIterator first, InputIterator last);
      + void insert(InputIterator first, InputIterator last);

      Requires: first, last are not iterators into *this.

      Effects: inserts each element from the range [first,last) if and only if there is no element with key equivalent to the key of that element.

      Complexity: At most N log(size()+N) (N is the distance from first to last)

    26. -
      void insert(std::initializer_list< value_type > il);
      +
      void insert(std::initializer_list< value_type > il);

      Effects: inserts each element from the range [il.begin(),il.end()) if and only if there is no element with key equivalent to the key of that element.

      Complexity: At most N log(size()+N) (N is the distance from il.begin() to il.end())

    27. -
      iterator erase(const_iterator p);
      +
      iterator erase(const_iterator p);

      Effects: Erases the element pointed to by p.

      Returns: Returns an iterator pointing to the element immediately following q prior to the element being erased. If no such element exists, returns end().

      Complexity: Amortized constant time

    28. -
      size_type erase(const key_type & x);
      +
      size_type erase(const key_type & x);

      Effects: Erases all elements in the container with key equivalent to x.

      Returns: Returns the number of erased elements.

      Complexity: log(size()) + count(k)

    29. -
      iterator erase(const_iterator first, const_iterator last);
      +
      iterator erase(const_iterator first, const_iterator last);

      Effects: Erases all the elements in the range [first, last).

      Returns: Returns last.

      Complexity: log(size())+N where N is the distance from first to last.

    30. -
      void swap(set & x) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_swappable< Compare >::value));
      +
      void swap(set & x) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_swappable< Compare >::value));

      Effects: Swaps the contents of *this and x.

      Throws: Nothing.

      Complexity: Constant.

    31. -
      void clear();
      +
      void clear();

      Effects: erase(a.begin(),a.end()).

      Postcondition: size() == 0.

      Complexity: linear in size().

    32. -
      key_compare key_comp() const;
      +
      key_compare key_comp() const;

      Effects: Returns the comparison object out of which a was constructed.

      Complexity: Constant.

    33. -
      value_compare value_comp() const;
      +
      value_compare value_comp() const;

      Effects: Returns an object of value_compare constructed out of the comparison object.

      Complexity: Constant.

    34. -
      iterator find(const key_type & x);
      +
      iterator find(const key_type & x);

      Returns: An iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.

      Complexity: Logarithmic.

    35. -
      const_iterator find(const key_type & x) const;
      +
      const_iterator find(const key_type & x) const;

      Returns: A const_iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.

      Complexity: Logarithmic.

    36. -
      size_type count(const key_type & x) const;
      +
      size_type count(const key_type & x) const;

      Returns: The number of elements with key equivalent to x.

      Complexity: log(size())+count(k)

    37. -
      size_type count(const key_type & x);
      +
      size_type count(const key_type & x);

      Returns: The number of elements with key equivalent to x.

      Complexity: log(size())+count(k)

    38. -
      iterator lower_bound(const key_type & x);
      +
      iterator lower_bound(const key_type & x);

      Returns: An iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.

      Complexity: Logarithmic

    39. -
      const_iterator lower_bound(const key_type & x) const;
      +
      const_iterator lower_bound(const key_type & x) const;

      Returns: A const iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.

      Complexity: Logarithmic

    40. -
      iterator upper_bound(const key_type & x);
      +
      iterator upper_bound(const key_type & x);

      Returns: An iterator pointing to the first element with key not less than x, or end() if such an element is not found.

      Complexity: Logarithmic

    41. -
      const_iterator upper_bound(const key_type & x) const;
      +
      const_iterator upper_bound(const key_type & x) const;

      Returns: A const iterator pointing to the first element with key not less than x, or end() if such an element is not found.

      Complexity: Logarithmic

    42. -
      std::pair< iterator, iterator > equal_range(const key_type & x);
      +
      std::pair< iterator, iterator > equal_range(const key_type & x);

      Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).

      Complexity: Logarithmic 

    43. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & x) const;
      +equal_range(const key_type & x) const;

      Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).

      Complexity: Logarithmic

    44. -
      std::pair< iterator, iterator > equal_range(const key_type & x);
      +
      std::pair< iterator, iterator > equal_range(const key_type & x);

      Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).

      Complexity: Logarithmic 

    45. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & x) const;
      +equal_range(const key_type & x) const;

      Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).

      Complexity: Logarithmic

    46. -
      void rebalance();
      +
      void rebalance();

      Effects: Rebalances the tree. It's a no-op for Red-Black and AVL trees.

      Complexity: Linear

    -

    -set friend functions

    +

    +set friend functions

    1. -
      friend bool operator==(const set & x, const set & y);
      +
      friend bool operator==(const set & x, const set & y);

      Effects: Returns true if x and y are equal

      Complexity: Linear to the number of elements in the container.

    2. -
      friend bool operator!=(const set & x, const set & y);
      +
      friend bool operator!=(const set & x, const set & y);

      Effects: Returns true if x and y are unequal

      Complexity: Linear to the number of elements in the container.

    3. -
      friend bool operator<(const set & x, const set & y);
      +
      friend bool operator<(const set & x, const set & y);

      Effects: Returns true if x is less than y

      Complexity: Linear to the number of elements in the container.

    4. -
      friend bool operator>(const set & x, const set & y);
      +
      friend bool operator>(const set & x, const set & y);

      Effects: Returns true if x is greater than y

      Complexity: Linear to the number of elements in the container.

    5. -
      friend bool operator<=(const set & x, const set & y);
      +
      friend bool operator<=(const set & x, const set & y);

      Effects: Returns true if x is equal or less than y

      Complexity: Linear to the number of elements in the container.

    6. -
      friend bool operator>=(const set & x, const set & y);
      +
      friend bool operator>=(const set & x, const set & y);

      Effects: Returns true if x is equal or greater than y

      Complexity: Linear to the number of elements in the container.

    7. -
      friend void swap(set & x, set & y);
      +
      friend void swap(set & x, set & y);

      Effects: x.swap(y)

      Complexity: Constant.

      8. @@ -586,7 +590,7 @@
    -
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -594,7 +598,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/container/slist.html b/doc/html/boost/container/slist.html index 0a909e2495..fa31b74b33 100644 --- a/doc/html/boost/container/slist.html +++ b/doc/html/boost/container/slist.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -49,113 +49,113 @@ typedef implementation_defined const_iterator; // construct/copy/destruct - slist(); - explicit slist(const allocator_type &) noexcept; - explicit slist(size_type); - slist(size_type, const allocator_type &); - explicit slist(size_type, const value_type &, + slist(); + explicit slist(const allocator_type &) noexcept; + explicit slist(size_type); + slist(size_type, const allocator_type &); + explicit slist(size_type, const value_type &, const allocator_type & = allocator_type()); template<typename InpIt> - slist(InpIt, InpIt, const allocator_type & = allocator_type()); - slist(std::initializer_list< value_type >, + slist(InpIt, InpIt, const allocator_type & = allocator_type()); + slist(std::initializer_list< value_type >, const allocator_type & = allocator_type()); - slist(const slist &); - slist(slist &&); - slist(const slist &, const allocator_type &); - slist(slist &&, const allocator_type &); - slist & operator=(const slist &); - slist & operator=(slist &&) noexcept(allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value)); - slist & operator=(std::initializer_list< value_type >); - ~slist(); + slist(const slist &); + slist(slist &&); + slist(const slist &, const allocator_type &); + slist(slist &&, const allocator_type &); + slist & operator=(const slist &); + slist & operator=(slist &&) noexcept(allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value)); + slist & operator=(std::initializer_list< value_type >); + ~slist(); - // public member functions - void assign(size_type, const T &); - template<typename InpIt> void assign(InpIt, InpIt); - void assign(std::initializer_list< value_type >); - allocator_type get_allocator() const noexcept; - stored_allocator_type & get_stored_allocator() noexcept; - const stored_allocator_type & get_stored_allocator() const noexcept; - iterator before_begin() noexcept; - const_iterator before_begin() const noexcept; - iterator begin() noexcept; - const_iterator begin() const noexcept; - iterator end() noexcept; - const_iterator end() const noexcept; - const_iterator cbefore_begin() const noexcept; - const_iterator cbegin() const noexcept; - const_iterator cend() const noexcept; - iterator previous(iterator) noexcept; - const_iterator previous(const_iterator); - bool empty() const; - size_type size() const; - size_type max_size() const; - void resize(size_type); - void resize(size_type, const T &); - reference front(); - const_reference front() const; - template<class... Args> void emplace_front(Args &&...); - template<class... Args> iterator emplace_after(const_iterator, Args &&...); - void push_front(const T &); - void push_front(T &&); - iterator insert_after(const_iterator, const T &); - iterator insert_after(const_iterator, T &&); - iterator insert_after(const_iterator, size_type, const value_type &); - template<typename InpIt> iterator insert_after(const_iterator, InpIt, InpIt); - iterator insert_after(const_iterator, std::initializer_list< value_type >); - void pop_front(); - iterator erase_after(const_iterator); - iterator erase_after(const_iterator, const_iterator); - void swap(slist &) noexcept(allocator_traits_type::propagate_on_container_swap::value||allocator_traits_type::is_always_equal::value)); - void clear(); - void splice_after(const_iterator, slist &) noexcept; - void splice_after(const_iterator, slist &&) noexcept; - void splice_after(const_iterator, slist &, const_iterator) noexcept; - void splice_after(const_iterator, slist &&, const_iterator) noexcept; - void splice_after(const_iterator, slist &, const_iterator, const_iterator) noexcept; - void splice_after(const_iterator, slist &&, const_iterator, const_iterator) noexcept; - void splice_after(const_iterator, slist &, const_iterator, const_iterator, + // public member functions + void assign(size_type, const T &); + template<typename InpIt> void assign(InpIt, InpIt); + void assign(std::initializer_list< value_type >); + allocator_type get_allocator() const noexcept; + stored_allocator_type & get_stored_allocator() noexcept; + const stored_allocator_type & get_stored_allocator() const noexcept; + iterator before_begin() noexcept; + const_iterator before_begin() const noexcept; + iterator begin() noexcept; + const_iterator begin() const noexcept; + iterator end() noexcept; + const_iterator end() const noexcept; + const_iterator cbefore_begin() const noexcept; + const_iterator cbegin() const noexcept; + const_iterator cend() const noexcept; + iterator previous(iterator) noexcept; + const_iterator previous(const_iterator); + bool empty() const; + size_type size() const; + size_type max_size() const; + void resize(size_type); + void resize(size_type, const T &); + reference front(); + const_reference front() const; + template<class... Args> void emplace_front(Args &&...); + template<class... Args> iterator emplace_after(const_iterator, Args &&...); + void push_front(const T &); + void push_front(T &&); + iterator insert_after(const_iterator, const T &); + iterator insert_after(const_iterator, T &&); + iterator insert_after(const_iterator, size_type, const value_type &); + template<typename InpIt> iterator insert_after(const_iterator, InpIt, InpIt); + iterator insert_after(const_iterator, std::initializer_list< value_type >); + void pop_front(); + iterator erase_after(const_iterator); + iterator erase_after(const_iterator, const_iterator); + void swap(slist &) noexcept(allocator_traits_type::propagate_on_container_swap::value||allocator_traits_type::is_always_equal::value)); + void clear(); + void splice_after(const_iterator, slist &) noexcept; + void splice_after(const_iterator, slist &&) noexcept; + void splice_after(const_iterator, slist &, const_iterator) noexcept; + void splice_after(const_iterator, slist &&, const_iterator) noexcept; + void splice_after(const_iterator, slist &, const_iterator, const_iterator) noexcept; + void splice_after(const_iterator, slist &&, const_iterator, const_iterator) noexcept; + void splice_after(const_iterator, slist &, const_iterator, const_iterator, size_type) noexcept; - void splice_after(const_iterator, slist &&, const_iterator, const_iterator, + void splice_after(const_iterator, slist &&, const_iterator, const_iterator, size_type) noexcept; - void remove(const T &); - template<typename Pred> void remove_if(Pred); - void unique(); - template<typename Pred> void unique(Pred); - void merge(slist &); - void merge(slist &&); + void remove(const T &); + template<typename Pred> void remove_if(Pred); + void unique(); + template<typename Pred> void unique(Pred); + void merge(slist &); + void merge(slist &&); template<typename StrictWeakOrdering> - void merge(slist &, StrictWeakOrdering); + void merge(slist &, StrictWeakOrdering); template<typename StrictWeakOrdering> - void merge(slist &&, StrictWeakOrdering); - void sort(); - template<typename StrictWeakOrdering> void sort(StrictWeakOrdering); - void reverse() noexcept; - template<class... Args> iterator emplace(const_iterator, Args &&...); - iterator insert(const_iterator, const T &); - iterator insert(const_iterator, T &&); - iterator insert(const_iterator, size_type, const value_type &); - template<typename InIter> iterator insert(const_iterator, InIter, InIter); - iterator insert(const_iterator, std::initializer_list< value_type >); - iterator erase(const_iterator) noexcept; - iterator erase(const_iterator, const_iterator) noexcept; - void splice(const_iterator, slist &) noexcept; - void splice(const_iterator, slist &&) noexcept; - void splice(const_iterator, slist &, const_iterator) noexcept; - void splice(const_iterator, slist &&, const_iterator) noexcept; - void splice(const_iterator, slist &, const_iterator, const_iterator) noexcept; - void splice(const_iterator, slist &&, const_iterator, const_iterator) noexcept; + void merge(slist &&, StrictWeakOrdering); + void sort(); + template<typename StrictWeakOrdering> void sort(StrictWeakOrdering); + void reverse() noexcept; + template<class... Args> iterator emplace(const_iterator, Args &&...); + iterator insert(const_iterator, const T &); + iterator insert(const_iterator, T &&); + iterator insert(const_iterator, size_type, const value_type &); + template<typename InIter> iterator insert(const_iterator, InIter, InIter); + iterator insert(const_iterator, std::initializer_list< value_type >); + iterator erase(const_iterator) noexcept; + iterator erase(const_iterator, const_iterator) noexcept; + void splice(const_iterator, slist &) noexcept; + void splice(const_iterator, slist &&) noexcept; + void splice(const_iterator, slist &, const_iterator) noexcept; + void splice(const_iterator, slist &&, const_iterator) noexcept; + void splice(const_iterator, slist &, const_iterator, const_iterator) noexcept; + void splice(const_iterator, slist &&, const_iterator, const_iterator) noexcept; - // friend functions - friend bool operator==(const slist &, const slist &); - friend bool operator!=(const slist &, const slist &); - friend bool operator<(const slist &, const slist &); - friend bool operator>(const slist &, const slist &); - friend bool operator<=(const slist &, const slist &); - friend bool operator>=(const slist &, const slist &); - friend void swap(slist &, slist &); + // friend functions + friend bool operator==(const slist &, const slist &); + friend bool operator!=(const slist &, const slist &); + friend bool operator<(const slist &, const slist &); + friend bool operator>(const slist &, const slist &); + friend bool operator<=(const slist &, const slist &); + friend bool operator>=(const slist &, const slist &); + friend void swap(slist &, slist &); };
    -

    Description

    +

    Description

    An slist is a singly linked list: a list where each element is linked to the next element, but not to the previous element. That is, it is a Sequence that supports forward but not backward traversal, and (amortized) constant time insertion and removal of elements. Slists, like lists, have the important property that insertion and splicing do not invalidate iterators to list elements, and that even removal invalidates only the iterators that point to the elements that are removed. The ordering of iterators may be changed (that is, slist<T>::iterator might have a different predecessor or successor after a list operation than it did before), but the iterators themselves will not be invalidated or made to point to different elements unless that invalidation or mutation is explicit.

    The main difference between slist and list is that list's iterators are bidirectional iterators, while slist's iterators are forward iterators. This means that slist is less versatile than list; frequently, however, bidirectional iterators are unnecessary. You should usually use slist unless you actually need the extra functionality of list, because singly linked lists are smaller and faster than double linked lists.

    Important performance note: like every other Sequence, slist defines the member functions insert and erase. Using these member functions carelessly, however, can result in disastrously slow programs. The problem is that insert's first argument is an iterator p, and that it inserts the new element(s) before p. This means that insert must find the iterator just before p; this is a constant-time operation for list, since list has bidirectional iterators, but for slist it must find that iterator by traversing the list from the beginning up to p. In other words: insert and erase are slow operations anywhere but near the beginning of the slist.

    @@ -163,7 +163,7 @@

    -

    Template Parameters

    +

    Template Parameters

    1. typename T
      @@ -176,37 +176,37 @@
    -

    +

    slist public construct/copy/destruct

    1. -
      slist();
      +
      slist();

      Effects: Constructs a list taking the allocator as parameter.

      Throws: If allocator_type's copy constructor throws.

      Complexity: Constant.

    2. -
      explicit slist(const allocator_type & a) noexcept;
      +
      explicit slist(const allocator_type & a) noexcept;

      Effects: Constructs a list taking the allocator as parameter.

      Throws: Nothing

      Complexity: Constant.

    3. -
      explicit slist(size_type n);
      +
      explicit slist(size_type n);

      Effects: Constructs a list and inserts n value-initialized value_types.

      Throws: If allocator_type's default constructor throws or T's default or copy constructor throws.

      Complexity: Linear to n.

    4. -
      slist(size_type n, const allocator_type & a);
      +
      slist(size_type n, const allocator_type & a);

      Effects: Constructs a list that will use a copy of allocator a and inserts n copies of value.

      Throws: If allocator_type's default constructor throws or T's default or copy constructor throws.

      Complexity: Linear to n.

    5. -
      explicit slist(size_type n, const value_type & x, 
+
      explicit slist(size_type n, const value_type & x, 
                const allocator_type & a = allocator_type());
      
 
      Effects: Constructs a list that will use a copy of allocator a and inserts n copies of value.
      
 
      Throws: If allocator_type's default constructor throws or T's default or copy constructor throws.
      
@@ -214,65 +214,65 @@
 
    6. template<typename InpIt> 
-  slist(InpIt first, InpIt last, const allocator_type & a = allocator_type());
      + slist(InpIt first, InpIt last, const allocator_type & a = allocator_type());

      Effects: Constructs a list that will use a copy of allocator a and inserts a copy of the range [first, last) in the list.

      Throws: If allocator_type's default constructor throws or T's constructor taking a dereferenced InIt throws.

      Complexity: Linear to the range [first, last).

    7. -
      slist(std::initializer_list< value_type > il, 
+
      slist(std::initializer_list< value_type > il, 
       const allocator_type & a = allocator_type());
      
 
      Effects: Constructs a list that will use a copy of allocator a and inserts a copy of the range [il.begin(), il.end()) in the list.
      
 
      Throws: If allocator_type's default constructor throws or T's constructor taking a dereferenced std::initializer_list iterator throws.
      
 
      Complexity: Linear to the range [il.begin(), il.end()).
    8. -
      slist(const slist & x);
      +
      slist(const slist & x);

      Effects: Copy constructs a list. Postcondition: x == *this.

      Throws: If allocator_type's default constructor

      Complexity: Linear to the elements x contains.

    9. -
      slist(slist && x);
      +
      slist(slist && x);

      Effects: Move constructor. Moves x's resources to *this.

      Throws: If allocator_type's copy constructor throws.

      Complexity: Constant.

    10. -
      slist(const slist & x, const allocator_type & a);
      +
      slist(const slist & x, const allocator_type & a);

      Effects: Copy constructs a list using the specified allocator.

      Postcondition: x == *this.

      Throws: If allocator_type's default constructor

      Complexity: Linear to the elements x contains.

    11. -
      slist(slist && x, const allocator_type & a);
      +
      slist(slist && x, const allocator_type & a);

      Effects: Move constructor using the specified allocator. Moves x's resources to *this.

      Throws: If allocation or value_type's copy constructor throws.

      Complexity: Constant if a == x.get_allocator(), linear otherwise.

    12. -
      slist & operator=(const slist & x);
      +
      slist & operator=(const slist & x);

      Effects: Makes *this contain the same elements as x.

      Postcondition: this->size() == x.size(). *this contains a copy of each of x's elements.

      Throws: If memory allocation throws or T's copy constructor throws.

      Complexity: Linear to the number of elements in x.

    13. -
      slist & operator=(slist && x) noexcept(allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value));
      +
      slist & operator=(slist && x) noexcept(allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value));

      Effects: Makes *this contain the same elements as x.

      Postcondition: this->size() == x.size(). *this contains a copy of each of x's elements.

      Throws: If allocator_traits_type::propagate_on_container_move_assignment is false and (allocation throws or value_type's move constructor throws)

      Complexity: Constant if allocator_traits_type:: propagate_on_container_move_assignment is true or this->get>allocator() == x.get_allocator(). Linear otherwise.

    14. -
      slist & operator=(std::initializer_list< value_type > il);
      +
      slist & operator=(std::initializer_list< value_type > il);

      Effects: Makes *this contain the same elements as in il.

      Postcondition: this->size() == il.size(). *this contains a copy of each of il's elements.

      Throws: If allocator_traits_type::propagate_on_container_move_assignment is false and (allocation throws or value_type's move constructor throws)

    15. -
      ~slist();
      +
      ~slist();

      Effects: Destroys the list. All stored values are destroyed and used memory is deallocated.

      Throws: Nothing.

      Complexity: Linear to the number of elements.

      @@ -280,186 +280,186 @@
    -

    -slist public member functions

    +

    +slist public member functions

    1. -
      void assign(size_type n, const T & val);
      +
      void assign(size_type n, const T & val);

      Effects: Assigns the n copies of val to *this.

      Throws: If memory allocation throws or T's copy constructor throws.

      Complexity: Linear to n.

    2. -
      template<typename InpIt> void assign(InpIt first, InpIt last);
      +
      template<typename InpIt> void assign(InpIt first, InpIt last);

      Effects: Assigns the range [first, last) to *this.

      Throws: If memory allocation throws or T's constructor from dereferencing InpIt throws.

      Complexity: Linear to n.

    3. -
      void assign(std::initializer_list< value_type > il);
      +
      void assign(std::initializer_list< value_type > il);

      Effects: Assigns the range [il.begin(), il.end()) to *this.

      Throws: If memory allocation throws or T's constructor from dereferencing std::initializer_list iterator throws.

      Complexity: Linear to range [il.begin(), il.end()).

    4. -
      allocator_type get_allocator() const noexcept;
      +
      allocator_type get_allocator() const noexcept;

      Effects: Returns a copy of the internal allocator.

      Throws: If allocator's copy constructor throws.

      Complexity: Constant.

    5. -
      stored_allocator_type & get_stored_allocator() noexcept;
      +
      stored_allocator_type & get_stored_allocator() noexcept;

      Effects: Returns a reference to the internal allocator.

      Throws: Nothing

      Complexity: Constant.

      Note: Non-standard extension.

    6. -
      const stored_allocator_type & get_stored_allocator() const noexcept;
      +
      const stored_allocator_type & get_stored_allocator() const noexcept;

      Effects: Returns a reference to the internal allocator.

      Throws: Nothing

      Complexity: Constant.

      Note: Non-standard extension.

    7. -
      iterator before_begin() noexcept;
      +
      iterator before_begin() noexcept;

      Effects: Returns a non-dereferenceable iterator that, when incremented, yields begin(). This iterator may be used as the argument to insert_after, erase_after, etc.

      Throws: Nothing.

      Complexity: Constant.

    8. -
      const_iterator before_begin() const noexcept;
      +
      const_iterator before_begin() const noexcept;

      Effects: Returns a non-dereferenceable const_iterator that, when incremented, yields begin(). This iterator may be used as the argument to insert_after, erase_after, etc.

      Throws: Nothing.

      Complexity: Constant.

    9. -
      iterator begin() noexcept;
      +
      iterator begin() noexcept;

      Effects: Returns an iterator to the first element contained in the list.

      Throws: Nothing.

      Complexity: Constant.

    10. -
      const_iterator begin() const noexcept;
      +
      const_iterator begin() const noexcept;

      Effects: Returns a const_iterator to the first element contained in the list.

      Throws: Nothing.

      Complexity: Constant.

    11. -
      iterator end() noexcept;
      +
      iterator end() noexcept;

      Effects: Returns an iterator to the end of the list.

      Throws: Nothing.

      Complexity: Constant.

    12. -
      const_iterator end() const noexcept;
      +
      const_iterator end() const noexcept;

      Effects: Returns a const_iterator to the end of the list.

      Throws: Nothing.

      Complexity: Constant.

    13. -
      const_iterator cbefore_begin() const noexcept;
      +
      const_iterator cbefore_begin() const noexcept;

      Effects: Returns a non-dereferenceable const_iterator that, when incremented, yields begin(). This iterator may be used as the argument to insert_after, erase_after, etc.

      Throws: Nothing.

      Complexity: Constant.

    14. -
      const_iterator cbegin() const noexcept;
      +
      const_iterator cbegin() const noexcept;

      Effects: Returns a const_iterator to the first element contained in the list.

      Throws: Nothing.

      Complexity: Constant.

    15. -
      const_iterator cend() const noexcept;
      +
      const_iterator cend() const noexcept;

      Effects: Returns a const_iterator to the end of the list.

      Throws: Nothing.

      Complexity: Constant.

    16. -
      iterator previous(iterator p) noexcept;
      +
      iterator previous(iterator p) noexcept;

      Returns: The iterator to the element before i in the sequence. Returns the end-iterator, if either i is the begin-iterator or the sequence is empty.

      Throws: Nothing.

      Complexity: Linear to the number of elements before i.

      Note: Non-standard extension.

    17. -
      const_iterator previous(const_iterator p);
      +
      const_iterator previous(const_iterator p);

      Returns: The const_iterator to the element before i in the sequence. Returns the end-const_iterator, if either i is the begin-const_iterator or the sequence is empty.

      Throws: Nothing.

      Complexity: Linear to the number of elements before i.

      Note: Non-standard extension.

    18. -
      bool empty() const;
      +
      bool empty() const;

      Effects: Returns true if the list contains no elements.

      Throws: Nothing.

      Complexity: Constant.

    19. -
      size_type size() const;
      +
      size_type size() const;

      Effects: Returns the number of the elements contained in the list.

      Throws: Nothing.

      Complexity: Constant.

    20. -
      size_type max_size() const;
      +
      size_type max_size() const;

      Effects: Returns the largest possible size of the list.

      Throws: Nothing.

      Complexity: Constant.

    21. -
      void resize(size_type new_size);
      +
      void resize(size_type new_size);

      Effects: Inserts or erases elements at the end such that the size becomes n. New elements are value initialized.

      Throws: If memory allocation throws, or T's copy constructor throws.

      Complexity: Linear to the difference between size() and new_size.

    22. -
      void resize(size_type new_size, const T & x);
      +
      void resize(size_type new_size, const T & x);

      Effects: Inserts or erases elements at the end such that the size becomes n. New elements are copy constructed from x.

      Throws: If memory allocation throws, or T's copy constructor throws.

      Complexity: Linear to the difference between size() and new_size.

    23. -
      reference front();
      +
      reference front();

      Requires: !empty()

      Effects: Returns a reference to the first element from the beginning of the container.

      Throws: Nothing.

      Complexity: Constant.

    24. -
      const_reference front() const;
      +
      const_reference front() const;

      Requires: !empty()

      Effects: Returns a const reference to the first element from the beginning of the container.

      Throws: Nothing.

      Complexity: Constant.

    25. -
      template<class... Args> void emplace_front(Args &&... args);
      +
      template<class... Args> void emplace_front(Args &&... args);

      Effects: Inserts an object of type T constructed with std::forward<Args>(args)... in the front of the list

      Throws: If memory allocation throws or T's copy constructor throws.

      Complexity: Amortized constant time. 

    26. template<class... Args> 
-  iterator emplace_after(const_iterator prev, Args &&... args);
      + iterator emplace_after(const_iterator prev, Args &&... args);

      Effects: Inserts an object of type T constructed with std::forward<Args>(args)... after prev

      Throws: If memory allocation throws or T's in-place constructor throws.

      Complexity: Constant

    27. -
      void push_front(const T & x);
      +
      void push_front(const T & x);

      Effects: Inserts a copy of x at the beginning of the list.

      Throws: If memory allocation throws or T's copy constructor throws.

      Complexity: Amortized constant time.

    28. -
      void push_front(T && x);
      +
      void push_front(T && x);

      Effects: Constructs a new element in the beginning of the list and moves the resources of x to this new element.

      Throws: If memory allocation throws.

      Complexity: Amortized constant time.

    29. -
      iterator insert_after(const_iterator prev_p, const T & x);
      +
      iterator insert_after(const_iterator prev_p, const T & x);

      Requires: p must be a valid iterator of *this.

      Effects: Inserts a copy of the value after prev_p.

      Returns: An iterator to the inserted element.

      @@ -468,7 +468,7 @@

      Note: Does not affect the validity of iterators and references of previous values.

    30. -
      iterator insert_after(const_iterator prev_p, T && x);
      +
      iterator insert_after(const_iterator prev_p, T && x);

      Requires: prev_p must be a valid iterator of *this.

      Effects: Inserts a move constructed copy object from the value after the p pointed by prev_p.

      Returns: An iterator to the inserted element.

      @@ -477,7 +477,7 @@

      Note: Does not affect the validity of iterators and references of previous values.

    31. -
      iterator insert_after(const_iterator prev_p, size_type n, 
+
      iterator insert_after(const_iterator prev_p, size_type n, 
                       const value_type & x);
      
 
      Requires: prev_p must be a valid iterator of *this.
      
 
      Effects: Inserts n copies of x after prev_p.
      
@@ -488,7 +488,7 @@
 
    32. template<typename InpIt> 
-  iterator insert_after(const_iterator prev_p, InpIt first, InpIt last);
      + iterator insert_after(const_iterator prev_p, InpIt first, InpIt last);

      Requires: prev_p must be a valid iterator of *this.

      Effects: Inserts the range pointed by [first, last) after prev_p.

      Returns: an iterator to the last inserted element or prev_p if first == last.

      @@ -497,7 +497,7 @@

      Note: Does not affect the validity of iterators and references of previous values.

    33. -
      iterator insert_after(const_iterator prev_p, 
+
      iterator insert_after(const_iterator prev_p, 
                       std::initializer_list< value_type > il);
      
 
      Requires: prev_p must be a valid iterator of *this.
      
 
      Effects: Inserts the range pointed by [il.begin(), il.end()) after prev_p.
      
@@ -507,13 +507,13 @@
 
      Note: Does not affect the validity of iterators and references of previous values.
    34. -
      void pop_front();
      +
      void pop_front();

      Effects: Removes the first element from the list.

      Throws: Nothing.

      Complexity: Amortized constant time.

    35. -
      iterator erase_after(const_iterator prev_p);
      +
      iterator erase_after(const_iterator prev_p);

      Effects: Erases the element after the element pointed by prev_p of the list.

      Returns: the first element remaining beyond the removed elements, or end() if no such element exists.

      Throws: Nothing.

      @@ -521,7 +521,7 @@

      Note: Does not invalidate iterators or references to non erased elements.

    36. -
      iterator erase_after(const_iterator before_first, const_iterator last);
      +
      iterator erase_after(const_iterator before_first, const_iterator last);

      Effects: Erases the range (before_first, last) from the list.

      Returns: the first element remaining beyond the removed elements, or end() if no such element exists.

      Throws: Nothing.

      @@ -529,19 +529,19 @@

      Note: Does not invalidate iterators or references to non erased elements.

    37. -
      void swap(slist & x) noexcept(allocator_traits_type::propagate_on_container_swap::value||allocator_traits_type::is_always_equal::value));
      +
      void swap(slist & x) noexcept(allocator_traits_type::propagate_on_container_swap::value||allocator_traits_type::is_always_equal::value));

      Effects: Swaps the contents of *this and x.

      Throws: Nothing.

      Complexity: Linear to the number of elements on *this and x.

    38. -
      void clear();
      +
      void clear();

      Effects: Erases all the elements of the list.

      Throws: Nothing.

      Complexity: Linear to the number of elements in the list.

    39. -
      void splice_after(const_iterator prev_p, slist & x) noexcept;
      +
      void splice_after(const_iterator prev_p, slist & x) noexcept;

      Requires: p must point to an element contained by the list. x != *this

      Effects: Transfers all the elements of list x to this list, after the the element pointed by p. No destructors or copy constructors are called.

      Throws: std::runtime_error if this' allocator and x's allocator are not equal.

      @@ -549,7 +549,7 @@

      Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.

    40. -
      void splice_after(const_iterator prev_p, slist && x) noexcept;
      +
      void splice_after(const_iterator prev_p, slist && x) noexcept;

      Requires: p must point to an element contained by the list. x != *this

      Effects: Transfers all the elements of list x to this list, after the the element pointed by p. No destructors or copy constructors are called.

      Throws: std::runtime_error if this' allocator and x's allocator are not equal.

      @@ -557,7 +557,7 @@

      Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.

    41. -
      void splice_after(const_iterator prev_p, slist & x, const_iterator prev) noexcept;
      +
      void splice_after(const_iterator prev_p, slist & x, const_iterator prev) noexcept;

      Requires: prev_p must be a valid iterator of this. i must point to an element contained in list x. this' allocator and x's allocator shall compare equal.

      Effects: Transfers the value pointed by i, from list x to this list, after the element pointed by prev_p. If prev_p == prev or prev_p == ++prev, this function is a null operation.

      Throws: Nothing

      @@ -565,7 +565,7 @@

      Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.

    42. -
      void splice_after(const_iterator prev_p, slist && x, const_iterator prev) noexcept;
      +
      void splice_after(const_iterator prev_p, slist && x, const_iterator prev) noexcept;

      Requires: prev_p must be a valid iterator of this. i must point to an element contained in list x. this' allocator and x's allocator shall compare equal.

      Effects: Transfers the value pointed by i, from list x to this list, after the element pointed by prev_p. If prev_p == prev or prev_p == ++prev, this function is a null operation.

      Throws: Nothing

      @@ -573,7 +573,7 @@

      Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.

    43. -
      void splice_after(const_iterator prev_p, slist & x, 
+
      void splice_after(const_iterator prev_p, slist & x, 
                   const_iterator before_first, const_iterator before_last) noexcept;
      
 
      Requires: prev_p must be a valid iterator of this. before_first and before_last must be valid iterators of x. prev_p must not be contained in [before_first, before_last) range. this' allocator and x's allocator shall compare equal.
      
 
      Effects: Transfers the range [before_first + 1, before_last + 1) from list x to this list, after the element pointed by prev_p.
      
@@ -582,7 +582,7 @@
 
      Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.
    44. -
      void splice_after(const_iterator prev_p, slist && x, 
+
      void splice_after(const_iterator prev_p, slist && x, 
                   const_iterator before_first, const_iterator before_last) noexcept;
      
 
      Requires: prev_p must be a valid iterator of this. before_first and before_last must be valid iterators of x. prev_p must not be contained in [before_first, before_last) range. this' allocator and x's allocator shall compare equal.
      
 
      Effects: Transfers the range [before_first + 1, before_last + 1) from list x to this list, after the element pointed by prev_p.
      
@@ -591,7 +591,7 @@
 
      Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.
    45. -
      void splice_after(const_iterator prev_p, slist & x, 
+
      void splice_after(const_iterator prev_p, slist & x, 
                   const_iterator before_first, const_iterator before_last, 
                   size_type n) noexcept;
      
 
      Requires: prev_p must be a valid iterator of this. before_first and before_last must be valid iterators of x. prev_p must not be contained in [before_first, before_last) range. n == distance(before_first, before_last). this' allocator and x's allocator shall compare equal.
      
@@ -601,7 +601,7 @@
 
      Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.
    46. -
      void splice_after(const_iterator prev_p, slist && x, 
+
      void splice_after(const_iterator prev_p, slist && x, 
                   const_iterator before_first, const_iterator before_last, 
                   size_type n) noexcept;
      
 
      Requires: prev_p must be a valid iterator of this. before_first and before_last must be valid iterators of x. prev_p must not be contained in [before_first, before_last) range. n == distance(before_first, before_last). this' allocator and x's allocator shall compare equal.
      
@@ -611,42 +611,42 @@
 
      Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.
    47. -
      void remove(const T & value);
      +
      void remove(const T & value);

      Effects: Removes all the elements that compare equal to value.

      Throws: Nothing.

      Complexity: Linear time. It performs exactly size() comparisons for equality.

      Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid.

    48. -
      template<typename Pred> void remove_if(Pred pred);
      +
      template<typename Pred> void remove_if(Pred pred);

      Effects: Removes all the elements for which a specified predicate is satisfied.

      Throws: If pred throws.

      Complexity: Linear time. It performs exactly size() calls to the predicate.

      Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid.

    49. -
      void unique();
      +
      void unique();

      Effects: Removes adjacent duplicate elements or adjacent elements that are equal from the list.

      Throws: If comparison throws.

      Complexity: Linear time (size()-1 comparisons equality comparisons).

      Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid.

    50. -
      template<typename Pred> void unique(Pred pred);
      +
      template<typename Pred> void unique(Pred pred);

      Effects: Removes adjacent duplicate elements or adjacent elements that satisfy some binary predicate from the list.

      Throws: If pred throws.

      Complexity: Linear time (size()-1 comparisons calls to pred()).

      Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid.

    51. -
      void merge(slist & x);
      +
      void merge(slist & x);

      Requires: The lists x and *this must be distinct.

      Effects: This function removes all of x's elements and inserts them in order into *this according to std::less<value_type>. The merge is stable; that is, if an element from *this is equivalent to one from x, then the element from *this will precede the one from x.

      Throws: If comparison throws.

      Complexity: This function is linear time: it performs at most size() + x.size() - 1 comparisons.

    52. -
      void merge(slist && x);
      +
      void merge(slist && x);

      Requires: The lists x and *this must be distinct.

      Effects: This function removes all of x's elements and inserts them in order into *this according to std::less<value_type>. The merge is stable; that is, if an element from *this is equivalent to one from x, then the element from *this will precede the one from x.

      Throws: If comparison throws.

      @@ -654,7 +654,7 @@ 
    53. template<typename StrictWeakOrdering> 
-  void merge(slist & x, StrictWeakOrdering comp);
      + void merge(slist & x, StrictWeakOrdering comp);

      Requires: p must be a comparison function that induces a strict weak ordering and both *this and x must be sorted according to that ordering The lists x and *this must be distinct.

      Effects: This function removes all of x's elements and inserts them in order into *this. The merge is stable; that is, if an element from *this is equivalent to one from x, then the element from *this will precede the one from x.

      Throws: If comp throws.

      @@ -663,7 +663,7 @@ 
    54. template<typename StrictWeakOrdering> 
-  void merge(slist && x, StrictWeakOrdering comp);
      + void merge(slist && x, StrictWeakOrdering comp);

      Requires: p must be a comparison function that induces a strict weak ordering and both *this and x must be sorted according to that ordering The lists x and *this must be distinct.

      Effects: This function removes all of x's elements and inserts them in order into *this. The merge is stable; that is, if an element from *this is equivalent to one from x, then the element from *this will precede the one from x.

      Throws: If comp throws.

      @@ -671,34 +671,34 @@

      Note: Iterators and references to *this are not invalidated.

    55. -
      void sort();
      +
      void sort();

      Effects: This function sorts the list *this according to std::less<value_type>. The sort is stable, that is, the relative order of equivalent elements is preserved.

      Throws: If comparison throws.

      Notes: Iterators and references are not invalidated.

      Complexity: The number of comparisons is approximately N log N, where N is the list's size.

    56. -
      template<typename StrictWeakOrdering> void sort(StrictWeakOrdering comp);
      +
      template<typename StrictWeakOrdering> void sort(StrictWeakOrdering comp);

      Effects: This function sorts the list *this according to std::less<value_type>. The sort is stable, that is, the relative order of equivalent elements is preserved.

      Throws: If comp throws.

      Notes: Iterators and references are not invalidated.

      Complexity: The number of comparisons is approximately N log N, where N is the list's size.

    57. -
      void reverse() noexcept;
      +
      void reverse() noexcept;

      Effects: Reverses the order of elements in the list.

      Throws: Nothing.

      Complexity: This function is linear time.

      Note: Iterators and references are not invalidated

    58. -
      template<class... Args> iterator emplace(const_iterator p, Args &&... args);
      +
      template<class... Args> iterator emplace(const_iterator p, Args &&... args);

      Effects: Inserts an object of type T constructed with std::forward<Args>(args)... before p

      Throws: If memory allocation throws or T's in-place constructor throws.

      Complexity: Linear to the elements before p

    59. -
      iterator insert(const_iterator p, const T & x);
      +
      iterator insert(const_iterator p, const T & x);

      Requires: p must be a valid iterator of *this.

      Effects: Insert a copy of x before p.

      Returns: an iterator to the inserted element.

      @@ -706,7 +706,7 @@

      Complexity: Linear to the elements before p.

    60. -
      iterator insert(const_iterator prev_p, T && x);
      +
      iterator insert(const_iterator prev_p, T && x);

      Requires: p must be a valid iterator of *this.

      Effects: Insert a new element before p with x's resources.

      Returns: an iterator to the inserted element.

      @@ -714,7 +714,7 @@

      Complexity: Linear to the elements before p.

    61. -
      iterator insert(const_iterator p, size_type n, const value_type & x);
      +
      iterator insert(const_iterator p, size_type n, const value_type & x);

      Requires: p must be a valid iterator of *this.

      Effects: Inserts n copies of x before p.

      Returns: an iterator to the first inserted element or p if n == 0.

      @@ -723,7 +723,7 @@ 
    62. template<typename InIter> 
-  iterator insert(const_iterator p, InIter first, InIter last);
      + iterator insert(const_iterator p, InIter first, InIter last);

      Requires: p must be a valid iterator of *this.

      Effects: Insert a copy of the [first, last) range before p.

      Returns: an iterator to the first inserted element or p if first == last.

      @@ -731,7 +731,7 @@

      Complexity: Linear to distance [first, last) plus linear to the elements before p.

    63. -
      iterator insert(const_iterator p, std::initializer_list< value_type > il);
      +
      iterator insert(const_iterator p, std::initializer_list< value_type > il);

      Requires: p must be a valid iterator of *this.

      Effects: Insert a copy of the [il.begin(), il.end()) range before p.

      Returns: an iterator to the first inserted element or p if il.begin() == il.end().

      @@ -739,21 +739,21 @@

      Complexity: Linear to the range [il.begin(), il.end()) plus linear to the elements before p.

    64. -
      iterator erase(const_iterator p) noexcept;
      +
      iterator erase(const_iterator p) noexcept;

      Requires: p must be a valid iterator of *this.

      Effects: Erases the element at p p.

      Throws: Nothing.

      Complexity: Linear to the number of elements before p.

    65. -
      iterator erase(const_iterator first, const_iterator last) noexcept;
      +
      iterator erase(const_iterator first, const_iterator last) noexcept;

      Requires: first and last must be valid iterator to elements in *this.

      Effects: Erases the elements pointed by [first, last).

      Throws: Nothing.

      Complexity: Linear to the distance between first and last plus linear to the elements before first.

    66. -
      void splice(const_iterator p, slist & x) noexcept;
      +
      void splice(const_iterator p, slist & x) noexcept;

      Requires: p must point to an element contained by the list. x != *this. this' allocator and x's allocator shall compare equal

      Effects: Transfers all the elements of list x to this list, before the the element pointed by p. No destructors or copy constructors are called.

      Throws: Nothing

      @@ -761,7 +761,7 @@

      Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.

    67. -
      void splice(const_iterator p, slist && x) noexcept;
      +
      void splice(const_iterator p, slist && x) noexcept;

      Requires: p must point to an element contained by the list. x != *this. this' allocator and x's allocator shall compare equal

      Effects: Transfers all the elements of list x to this list, before the the element pointed by p. No destructors or copy constructors are called.

      Throws: Nothing

      @@ -769,7 +769,7 @@

      Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.

    68. -
      void splice(const_iterator p, slist & x, const_iterator i) noexcept;
      +
      void splice(const_iterator p, slist & x, const_iterator i) noexcept;

      Requires: p must point to an element contained by this list. i must point to an element contained in list x. this' allocator and x's allocator shall compare equal

      Effects: Transfers the value pointed by i, from list x to this list, before the the element pointed by p. No destructors or copy constructors are called. If p == i or p == ++i, this function is a null operation.

      Throws: Nothing

      @@ -777,7 +777,7 @@

      Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.

    69. -
      void splice(const_iterator p, slist && x, const_iterator i) noexcept;
      +
      void splice(const_iterator p, slist && x, const_iterator i) noexcept;

      Requires: p must point to an element contained by this list. i must point to an element contained in list x. this' allocator and x's allocator shall compare equal.

      Effects: Transfers the value pointed by i, from list x to this list, before the the element pointed by p. No destructors or copy constructors are called. If p == i or p == ++i, this function is a null operation.

      Throws: Nothing

      @@ -785,7 +785,7 @@

      Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.

    70. -
      void splice(const_iterator p, slist & x, const_iterator first, 
+
      void splice(const_iterator p, slist & x, const_iterator first, 
             const_iterator last) noexcept;
      
 
      Requires: p must point to an element contained by this list. first and last must point to elements contained in list x.
      
 
      Effects: Transfers the range pointed by first and last from list x to this list, before the the element pointed by p. No destructors or copy constructors are called. this' allocator and x's allocator shall compare equal.
      
@@ -794,7 +794,7 @@
 
      Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.
    71. -
      void splice(const_iterator p, slist && x, const_iterator first, 
+
      void splice(const_iterator p, slist && x, const_iterator first, 
             const_iterator last) noexcept;
      
 
      Requires: p must point to an element contained by this list. first and last must point to elements contained in list x. this' allocator and x's allocator shall compare equal
      
 
      Effects: Transfers the range pointed by first and last from list x to this list, before the the element pointed by p. No destructors or copy constructors are called.
      
@@ -805,41 +805,41 @@
    -

    -slist friend functions

    +

    +slist friend functions

    1. -
      friend bool operator==(const slist & x, const slist & y);
      +
      friend bool operator==(const slist & x, const slist & y);

      Effects: Returns true if x and y are equal

      Complexity: Linear to the number of elements in the container.

    2. -
      friend bool operator!=(const slist & x, const slist & y);
      +
      friend bool operator!=(const slist & x, const slist & y);

      Effects: Returns true if x and y are unequal

      Complexity: Linear to the number of elements in the container.

    3. -
      friend bool operator<(const slist & x, const slist & y);
      +
      friend bool operator<(const slist & x, const slist & y);

      Effects: Returns true if x is less than y

      Complexity: Linear to the number of elements in the container.

    4. -
      friend bool operator>(const slist & x, const slist & y);
      +
      friend bool operator>(const slist & x, const slist & y);

      Effects: Returns true if x is greater than y

      Complexity: Linear to the number of elements in the container.

    5. -
      friend bool operator<=(const slist & x, const slist & y);
      +
      friend bool operator<=(const slist & x, const slist & y);

      Effects: Returns true if x is equal or less than y

      Complexity: Linear to the number of elements in the container.

    6. -
      friend bool operator>=(const slist & x, const slist & y);
      +
      friend bool operator>=(const slist & x, const slist & y);

      Effects: Returns true if x is equal or greater than y

      Complexity: Linear to the number of elements in the container.

    7. -
      friend void swap(slist & x, slist & y);
      +
      friend void swap(slist & x, slist & y);

      Effects: x.swap(y)

      Complexity: Constant.

      8. @@ -849,7 +849,7 @@
    -
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -857,7 +857,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/container/small_vector.html b/doc/html/boost/container/small_vector.html index be28689d93..2c245f0809 100644 --- a/doc/html/boost/container/small_vector.html +++ b/doc/html/boost/container/small_vector.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -38,31 +38,31 @@ { public: // construct/copy/destruct - small_vector(); - explicit small_vector(size_type); - explicit small_vector(const allocator_type &); - small_vector(size_type, const allocator_type &); - small_vector(const small_vector &); - small_vector(const small_vector &, const allocator_type &); - small_vector(small_vector &&); - small_vector(small_vector &&, const allocator_type &); - small_vector(std::initializer_list< value_type >, + small_vector(); + explicit small_vector(size_type); + explicit small_vector(const allocator_type &); + small_vector(size_type, const allocator_type &); + small_vector(const small_vector &); + small_vector(const small_vector &, const allocator_type &); + small_vector(small_vector &&); + small_vector(small_vector &&, const allocator_type &); + small_vector(std::initializer_list< value_type >, const allocator_type & = allocator_type()); - small_vector & operator=(const small_vector &); - small_vector & operator=(small_vector &&); + small_vector & operator=(const small_vector &); + small_vector & operator=(small_vector &&); - // public member functions - void swap(small_vector &); + // public member functions + void swap(small_vector &); };
    -

    Description

    +

    Description

    small_vector is a vector-like container optimized for the case when it contains few elements. It contains some preallocated elements in-place, which can avoid the use of dynamic storage allocation when the actual number of elements is below that preallocated threshold.

    small_vector<T, N, Allocator> is convertible to small_vector_base<T, Allocator> that is independent from the preallocated element capacity, so client code does not need to be templated on that N argument.

    All boost::container::vector member functions are inherited. See vector documentation for details.

    -

    Template Parameters

    +

    Template Parameters

    1. typename T
      @@ -79,35 +79,35 @@
    -

    +

    small_vector public construct/copy/destruct

      -
    1. small_vector();
      2. -
    2. explicit small_vector(size_type n);
      3. -
    3. explicit small_vector(const allocator_type & a);
      4. -
    4. small_vector(size_type n, const allocator_type & a);
      5. -
    5. small_vector(const small_vector & other);
      6. -
    6. small_vector(const small_vector & other, const allocator_type & a);
      7. -
    7. small_vector(small_vector && other);
      8. -
    8. small_vector(small_vector && other, const allocator_type & a);
      9. -
    9. small_vector(std::initializer_list< value_type > il, 
+
    10. small_vector();
      11. 
+
    11. explicit small_vector(size_type n);
      12. 
+
    12. explicit small_vector(const allocator_type & a);
      13. 
+
    13. small_vector(size_type n, const allocator_type & a);
      14. 
+
    14. small_vector(const small_vector & other);
      15. 
+
    15. small_vector(const small_vector & other, const allocator_type & a);
      16. 
+
    16. small_vector(small_vector && other);
      17. 
+
    17. small_vector(small_vector && other, const allocator_type & a);
      18. 
+
    18. small_vector(std::initializer_list< value_type > il, 
              const allocator_type & a = allocator_type());
      19. 
-
    19. small_vector & operator=(const small_vector & other);
      20. 
-
    20. small_vector & operator=(small_vector && other);
      21. 
+
    21. small_vector & operator=(const small_vector & other);
      22. 
+
    22. small_vector & operator=(small_vector && other);
      23.
    -

    -small_vector public member functions

    -
    1. void swap(small_vector & other);
    +

    +small_vector public member functions

    +
    1. void swap(small_vector & other);
    -
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -115,7 +115,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/container/small_vector_allocator.html b/doc/html/boost/container/small_vector_allocator.html index 43b2268a30..7e808355c7 100644 --- a/doc/html/boost/container/small_vector_allocator.html +++ b/doc/html/boost/container/small_vector_allocator.html @@ -45,11 +45,11 @@ typedef allocator_traits< Allocator >::difference_type difference_type; typedef allocator_traits< Allocator >::void_pointer void_pointer; typedef allocator_traits< Allocator >::const_void_pointer const_void_pointer; - typedef allocator_traits< Allocator >::propagate_on_container_copy_assignment propagate_on_container_copy_assignment; - typedef allocator_traits< Allocator >::propagate_on_container_move_assignment propagate_on_container_move_assignment; - typedef allocator_traits< Allocator >::propagate_on_container_swap propagate_on_container_swap; - typedef implementation_defined is_always_equal; // An integral constant with member ::value == false - typedef implementation_defined is_partially_propagable; // An integral constant with member ::value == true + typedef allocator_traits< Allocator >::propagate_on_container_copy_assignment propagate_on_container_copy_assignment; + typedef allocator_traits< Allocator >::propagate_on_container_move_assignment propagate_on_container_move_assignment; + typedef allocator_traits< Allocator >::propagate_on_container_swap propagate_on_container_swap; + typedef implementation_defined is_always_equal; // An integral constant with member value == false + typedef implementation_defined is_partially_propagable; // An integral constant with member value == true // member classes/structs/unions template<typename T2> @@ -59,38 +59,38 @@ }; // construct/copy/destruct - template<class... Args> explicit small_vector_allocator(Args &&...); - small_vector_allocator(const small_vector_allocator &) noexcept; - small_vector_allocator(small_vector_allocator &&) noexcept; + template<class... Args> explicit small_vector_allocator(Args &&...); + small_vector_allocator(const small_vector_allocator &) noexcept; + small_vector_allocator(small_vector_allocator &&) noexcept; template<typename OtherAllocator> - small_vector_allocator(const small_vector_allocator< OtherAllocator > &) noexcept; + small_vector_allocator(const small_vector_allocator< OtherAllocator > &) noexcept; template<typename OtherAllocator> - small_vector_allocator(small_vector_allocator< OtherAllocator > &&) noexcept; - small_vector_allocator & operator=(const small_vector_allocator &) noexcept; - small_vector_allocator & operator=(small_vector_allocator &&) noexcept; + small_vector_allocator(small_vector_allocator< OtherAllocator > &&) noexcept; + small_vector_allocator & operator=(const small_vector_allocator &) noexcept; + small_vector_allocator & operator=(small_vector_allocator &&) noexcept; template<typename OtherAllocator> small_vector_allocator & - operator=(const small_vector_allocator< OtherAllocator > &) noexcept; + operator=(const small_vector_allocator< OtherAllocator > &) noexcept; template<typename OtherAllocator> small_vector_allocator & - operator=(small_vector_allocator< OtherAllocator > &&) noexcept; + operator=(small_vector_allocator< OtherAllocator > &&) noexcept; - // public member functions - pointer allocate(size_type, const_void_pointer = const_void_pointer()); - void deallocate(pointer, size_type) noexcept; - size_type max_size() const noexcept; - small_vector_allocator select_on_container_copy_construction() const; - bool storage_is_unpropagable(pointer) const; + // public member functions + pointer allocate(size_type, const_void_pointer = const_void_pointer()); + void deallocate(pointer, size_type) noexcept; + size_type max_size() const noexcept; + small_vector_allocator select_on_container_copy_construction() const; + bool storage_is_unpropagable(pointer) const; - // friend functions - friend void swap(small_vector_allocator &, small_vector_allocator &) noexcept; - friend bool operator==(const small_vector_allocator &, + // friend functions + friend void swap(small_vector_allocator &, small_vector_allocator &) noexcept; + friend bool operator==(const small_vector_allocator &, const small_vector_allocator &) noexcept; - friend bool operator!=(const small_vector_allocator &, + friend bool operator!=(const small_vector_allocator &, const small_vector_allocator &) noexcept; };
    -

    Description

    +

    Description

    A non-standard allocator used to implement small_vector. Users should never use it directly. It is described here for documentation purposes.

    This allocator inherits from a standard-conforming allocator and forwards member functions to the standard allocator except when internal storage is being used as memory source.

    This allocator is a "partially_propagable" allocator and defines is_partially_propagable as true_type.

    @@ -98,88 +98,88 @@

    boost::container::vector supports partially propagable allocators fallbacking to deep copy/swap/move operations when internal storage is being used to store vector elements.

    small_vector_allocator assumes that will be instantiated as boost::container::vector< T, small_vector_allocator<Allocator> > and internal storage can be obtained downcasting that vector to small_vector_base<T>.

    -

    +

    small_vector_allocator public construct/copy/destruct

    1. -
      template<class... Args> explicit small_vector_allocator(Args &&... args);
      Constructor from arbitrary arguments.
      2. +
      template<class... Args> explicit small_vector_allocator(Args &&... args);
      Constructor from arbitrary arguments.
    2. -
      small_vector_allocator(const small_vector_allocator & other) noexcept;
      +
      small_vector_allocator(const small_vector_allocator & other) noexcept;

      Constructor from other small_vector_allocator. Never throws

    3. -
      small_vector_allocator(small_vector_allocator && other) noexcept;
      +
      small_vector_allocator(small_vector_allocator && other) noexcept;

      Move constructor from small_vector_allocator. Never throws 

    4. template<typename OtherAllocator> 
-  small_vector_allocator(const small_vector_allocator< OtherAllocator > & other) noexcept;
      + small_vector_allocator(const small_vector_allocator< OtherAllocator > & other) noexcept;

      Constructor from related small_vector_allocator. Never throws 

    5. template<typename OtherAllocator> 
-  small_vector_allocator(small_vector_allocator< OtherAllocator > && other) noexcept;
      + small_vector_allocator(small_vector_allocator< OtherAllocator > && other) noexcept;

      Move constructor from related small_vector_allocator. Never throws 

    6. small_vector_allocator & 
-operator=(const small_vector_allocator & other) noexcept;
      +operator=(const small_vector_allocator & other) noexcept;

      Assignment from other small_vector_allocator. Never throws

    7. -
      small_vector_allocator & operator=(small_vector_allocator && other) noexcept;
      +
      small_vector_allocator & operator=(small_vector_allocator && other) noexcept;

      Move constructor from other small_vector_allocator. Never throws 

    8. template<typename OtherAllocator> 
   small_vector_allocator & 
-  operator=(const small_vector_allocator< OtherAllocator > & other) noexcept;
      + operator=(const small_vector_allocator< OtherAllocator > & other) noexcept;

      Assignment from related small_vector_allocator. Never throws 

    9. template<typename OtherAllocator> 
   small_vector_allocator & 
-  operator=(small_vector_allocator< OtherAllocator > && other) noexcept;
      + operator=(small_vector_allocator< OtherAllocator > && other) noexcept;

      Move assignment from related small_vector_allocator. Never throws

    -

    -small_vector_allocator public member functions

    +

    +small_vector_allocator public member functions

    1. -
      pointer allocate(size_type count, 
+
      pointer allocate(size_type count, 
                  const_void_pointer hint = const_void_pointer());
      Allocates storage from the standard-conforming allocator.
    2. -
      void deallocate(pointer ptr, size_type n) noexcept;
      +
      void deallocate(pointer ptr, size_type n) noexcept;

      Deallocates previously allocated memory. Never throws

    3. -
      size_type max_size() const noexcept;
      +
      size_type max_size() const noexcept;

      Returns the maximum number of elements that could be allocated. Never throws

      4. -
    4. small_vector_allocator select_on_container_copy_construction() const;
      5. -
    5. bool storage_is_unpropagable(pointer p) const;
      6. +
    6. small_vector_allocator select_on_container_copy_construction() const;
      7. +
    7. bool storage_is_unpropagable(pointer p) const;
    -

    -small_vector_allocator friend functions

    +

    +small_vector_allocator friend functions

    1. -
      friend void swap(small_vector_allocator & l, small_vector_allocator & r) noexcept;
      +
      friend void swap(small_vector_allocator & l, small_vector_allocator & r) noexcept;

      Swaps two allocators, does nothing because this small_vector_allocator is stateless

    2. -
      friend bool operator==(const small_vector_allocator & l, 
+
      friend bool operator==(const small_vector_allocator & l, 
                        const small_vector_allocator & r) noexcept;
      
 
      An small_vector_allocator always compares to true, as memory allocated with one instance can be deallocated by another instance (except for unpropagable storage)
    3. -
      friend bool operator!=(const small_vector_allocator & l, 
+
      friend bool operator!=(const small_vector_allocator & l, 
                        const small_vector_allocator & r) noexcept;
      
 
      An small_vector_allocator always compares to false, as memory allocated with one instance can be deallocated by another instance
      4. @@ -189,7 +189,7 @@
    -
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost/container/small_vector_allocator/rebind.html b/doc/html/boost/container/small_vector_allocator/rebind.html index 4a441e7593..b96e11338c 100644 --- a/doc/html/boost/container/small_vector_allocator/rebind.html +++ b/doc/html/boost/container/small_vector_allocator/rebind.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -39,13 +39,13 @@ typedef allocator_traits< Allocator >::template rebind_alloc< T2 >::type other; };
    -

    Description

    +

    Description

    Obtains an small_vector_allocator that allocates objects of type T2

    -
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -53,7 +53,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/container/small_vector_base.html b/doc/html/boost/container/small_vector_base.html index ad16041b2c..5b7838d6a3 100644 --- a/doc/html/boost/container/small_vector_base.html +++ b/doc/html/boost/container/small_vector_base.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -37,38 +37,46 @@ { public: // construct/copy/destruct - small_vector_base & operator=(const small_vector_base &); - small_vector_base & operator=(small_vector_base &&); + small_vector_base & operator=(const small_vector_base &); + small_vector_base & operator=(small_vector_base &&); - // public member functions - void swap(small_vector_base &); + // public member functions + void swap(small_vector_base &); };
    -

    Description

    -

    This class consists of common code from all small_vector<T, N> types that don't depend on the "N" template parameter. This class is non-copyable and non-destructible, so this class tipically used as reference argument to functions that read or write small vectors. Since small_vector<T, N> derives from small_vector_base<T>, the conversion to small_vector_base is implicit:

    -

    //Clients can pass any small_vector<Foo, N>. void read_any_small_vector_of_foo(const small_vector_base<Foo> &in_parameter); void modify_any_small_vector_of_foo(small_vector_base<Foo> &out_parameter);

    -

    void some_function() { small_vector<Foo, 8> myvector; read_any_small_vector_of_foo(myvector); // Reads myvector modify_any_small_vector_of_foo(myvector); // Modifies myvector }

    +

    Description

    +

    This class consists of common code from all small_vector<T, N> types that don't depend on the "N" template parameter. This class is non-copyable and non-destructible, so this class tipically used as reference argument to functions that read or write small vectors. Since small_vector<T, N> derives from small_vector_base<T>, the conversion to small_vector_base is implicit <preformatted></preformatted>

    +

    <preformatted>//Clients can pass any small_vector<Foo, N>. +void read_any_small_vector_of_foo(const small_vector_base<Foo> &in_parameter);</preformatted>

    +

    <preformatted>void modify_any_small_vector_of_foo(small_vector_base<Foo> &out_parameter);</preformatted>

    +

    <preformatted>void some_function() +{</preformatted>

    +

    <preformatted> small_vector<Foo, 8> myvector;</preformatted>

    +

    <preformatted> read_any_small_vector_of_foo(myvector); // Reads myvector</preformatted>

    +

    <preformatted> modify_any_small_vector_of_foo(myvector); // Modifies myvector</preformatted>

    +

    <preformatted>} +</preformatted>

    All boost::container:vector member functions are inherited. See vector documentation for details.

    -

    +

    small_vector_base public construct/copy/destruct

      -
    1. small_vector_base & operator=(const small_vector_base & other);
      2. -
    2. small_vector_base & operator=(small_vector_base && other);
      3. +
    3. small_vector_base & operator=(const small_vector_base & other);
      4. +
    4. small_vector_base & operator=(small_vector_base && other);
    -

    -small_vector_base public member functions

    -
    1. void swap(small_vector_base & other);
    +

    +small_vector_base public member functions

    +
    1. void swap(small_vector_base & other);
    -
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -76,7 +84,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/container/stable_vector.html b/doc/html/boost/container/stable_vector.html index 8690880548..c62431d811 100644 --- a/doc/html/boost/container/stable_vector.html +++ b/doc/html/boost/container/stable_vector.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -51,96 +51,96 @@ typedef implementation_defined const_reverse_iterator; // construct/copy/destruct - stable_vector(); - explicit stable_vector(const allocator_type &) noexcept; - explicit stable_vector(size_type); - stable_vector(size_type, default_init_t); - explicit stable_vector(size_type, const allocator_type &); - stable_vector(size_type, default_init_t, const allocator_type &); - stable_vector(size_type, const T &, + stable_vector(); + explicit stable_vector(const allocator_type &) noexcept; + explicit stable_vector(size_type); + stable_vector(size_type, default_init_t); + explicit stable_vector(size_type, const allocator_type &); + stable_vector(size_type, default_init_t, const allocator_type &); + stable_vector(size_type, const T &, const allocator_type & = allocator_type()); template<typename InputIterator> - stable_vector(InputIterator, InputIterator, + stable_vector(InputIterator, InputIterator, const allocator_type & = allocator_type()); - stable_vector(const stable_vector &); - stable_vector(std::initializer_list< value_type >, + stable_vector(const stable_vector &); + stable_vector(std::initializer_list< value_type >, const allocator_type & = allocator_type()); - stable_vector(stable_vector &&); - stable_vector(const stable_vector &, const allocator_type &); - stable_vector(stable_vector &&, const allocator_type &); - stable_vector & operator=(const stable_vector &); + stable_vector(stable_vector &&); + stable_vector(const stable_vector &, const allocator_type &); + stable_vector(stable_vector &&, const allocator_type &); + stable_vector & operator=(const stable_vector &); stable_vector & - operator=(stable_vector &&) noexcept(allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value)); - stable_vector & operator=(std::initializer_list< value_type >); - ~stable_vector(); + operator=(stable_vector &&) noexcept(allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value)); + stable_vector & operator=(std::initializer_list< value_type >); + ~stable_vector(); - // public member functions - void assign(size_type, const T &); - template<typename InputIterator> void assign(InputIterator, InputIterator); - void assign(std::initializer_list< value_type >); - allocator_type get_allocator() const; - const stored_allocator_type & get_stored_allocator() const noexcept; - stored_allocator_type & get_stored_allocator() noexcept; - iterator begin() noexcept; - const_iterator begin() const noexcept; - iterator end() noexcept; - const_iterator end() const noexcept; - reverse_iterator rbegin() noexcept; - const_reverse_iterator rbegin() const noexcept; - reverse_iterator rend() noexcept; - const_reverse_iterator rend() const noexcept; - const_iterator cbegin() const noexcept; - const_iterator cend() const noexcept; - const_reverse_iterator crbegin() const noexcept; - const_reverse_iterator crend() const noexcept; - bool empty() const noexcept; - size_type size() const noexcept; - size_type max_size() const noexcept; - void resize(size_type); - void resize(size_type, default_init_t); - void resize(size_type, const T &); - size_type capacity() const noexcept; - void reserve(size_type); - void shrink_to_fit(); - reference front() noexcept; - const_reference front() const noexcept; - reference back() noexcept; - const_reference back() const noexcept; - reference operator[](size_type) noexcept; - const_reference operator[](size_type) const noexcept; - iterator nth(size_type) noexcept; - const_iterator nth(size_type) const noexcept; - size_type index_of(iterator) noexcept; - size_type index_of(const_iterator) const noexcept; - reference at(size_type); - const_reference at(size_type) const; - template<class... Args> void emplace_back(Args &&...); - template<class... Args> iterator emplace(const_iterator, Args &&...); - void push_back(const T &); - void push_back(T &&); - iterator insert(const_iterator, const T &); - iterator insert(const_iterator, T &&); - iterator insert(const_iterator, size_type, const T &); - iterator insert(const_iterator, std::initializer_list< value_type >); + // public member functions + void assign(size_type, const T &); + template<typename InputIterator> void assign(InputIterator, InputIterator); + void assign(std::initializer_list< value_type >); + allocator_type get_allocator() const; + const stored_allocator_type & get_stored_allocator() const noexcept; + stored_allocator_type & get_stored_allocator() noexcept; + iterator begin() noexcept; + const_iterator begin() const noexcept; + iterator end() noexcept; + const_iterator end() const noexcept; + reverse_iterator rbegin() noexcept; + const_reverse_iterator rbegin() const noexcept; + reverse_iterator rend() noexcept; + const_reverse_iterator rend() const noexcept; + const_iterator cbegin() const noexcept; + const_iterator cend() const noexcept; + const_reverse_iterator crbegin() const noexcept; + const_reverse_iterator crend() const noexcept; + bool empty() const noexcept; + size_type size() const noexcept; + size_type max_size() const noexcept; + void resize(size_type); + void resize(size_type, default_init_t); + void resize(size_type, const T &); + size_type capacity() const noexcept; + void reserve(size_type); + void shrink_to_fit(); + reference front() noexcept; + const_reference front() const noexcept; + reference back() noexcept; + const_reference back() const noexcept; + reference operator[](size_type) noexcept; + const_reference operator[](size_type) const noexcept; + iterator nth(size_type) noexcept; + const_iterator nth(size_type) const noexcept; + size_type index_of(iterator) noexcept; + size_type index_of(const_iterator) const noexcept; + reference at(size_type); + const_reference at(size_type) const; + template<class... Args> void emplace_back(Args &&...); + template<class... Args> iterator emplace(const_iterator, Args &&...); + void push_back(const T &); + void push_back(T &&); + iterator insert(const_iterator, const T &); + iterator insert(const_iterator, T &&); + iterator insert(const_iterator, size_type, const T &); + iterator insert(const_iterator, std::initializer_list< value_type >); template<typename InputIterator> - iterator insert(const_iterator, InputIterator, InputIterator); - void pop_back() noexcept; - iterator erase(const_iterator) noexcept; - iterator erase(const_iterator, const_iterator) noexcept; - void swap(stable_vector &) noexcept(allocator_traits_type::propagate_on_container_swap::value||allocator_traits_type::is_always_equal::value)); - void clear() noexcept; + iterator insert(const_iterator, InputIterator, InputIterator); + void pop_back() noexcept; + iterator erase(const_iterator) noexcept; + iterator erase(const_iterator, const_iterator) noexcept; + void swap(stable_vector &) noexcept(allocator_traits_type::propagate_on_container_swap::value||allocator_traits_type::is_always_equal::value)); + void clear() noexcept; - // friend functions - friend bool operator==(const stable_vector &, const stable_vector &); - friend bool operator!=(const stable_vector &, const stable_vector &); - friend bool operator<(const stable_vector &, const stable_vector &); - friend bool operator>(const stable_vector &, const stable_vector &); - friend bool operator<=(const stable_vector &, const stable_vector &); - friend bool operator>=(const stable_vector &, const stable_vector &); - friend void swap(stable_vector &, stable_vector &); + // friend functions + friend bool operator==(const stable_vector &, const stable_vector &); + friend bool operator!=(const stable_vector &, const stable_vector &); + friend bool operator<(const stable_vector &, const stable_vector &); + friend bool operator>(const stable_vector &, const stable_vector &); + friend bool operator<=(const stable_vector &, const stable_vector &); + friend bool operator>=(const stable_vector &, const stable_vector &); + friend void swap(stable_vector &, stable_vector &); };
    -

    Description

    +

    Description

    Originally developed by Joaquin M. Lopez Munoz, stable_vector is a std::vector drop-in replacement implemented as a node container, offering iterator and reference stability.

    Here are the details taken from the author's blog (Introducing stable_vector):

    We present stable_vector, a fully STL-compliant stable container that provides most of the features of std::vector except element contiguity.

    @@ -150,7 +150,7 @@

    -

    Template Parameters

    +

    Template Parameters

    1. typename T
      @@ -163,51 +163,51 @@
    -

    +

    stable_vector public construct/copy/destruct

    1. -
      stable_vector();
      +
      stable_vector();

      Effects: Default constructs a stable_vector.

      Throws: If allocator_type's default constructor throws.

      Complexity: Constant.

    2. -
      explicit stable_vector(const allocator_type & al) noexcept;
      +
      explicit stable_vector(const allocator_type & al) noexcept;

      Effects: Constructs a stable_vector taking the allocator as parameter.

      Throws: Nothing

      Complexity: Constant.

    3. -
      explicit stable_vector(size_type n);
      +
      explicit stable_vector(size_type n);

      Effects: Constructs a stable_vector and inserts n value initialized values.

      Throws: If allocator_type's default constructor throws or T's default or copy constructor throws.

      Complexity: Linear to n.

    4. -
      stable_vector(size_type n, default_init_t);
      +
      stable_vector(size_type n, default_init_t);

      Effects: Constructs a stable_vector and inserts n default initialized values.

      Throws: If allocator_type's default constructor throws or T's default or copy constructor throws.

      Complexity: Linear to n.

      Note: Non-standard extension

    5. -
      explicit stable_vector(size_type n, const allocator_type & a);
      +
      explicit stable_vector(size_type n, const allocator_type & a);

      Effects: Constructs a stable_vector that will use a copy of allocator a and inserts n value initialized values.

      Throws: If allocator_type's default constructor throws or T's default or copy constructor throws.

      Complexity: Linear to n.

    6. -
      stable_vector(size_type n, default_init_t, const allocator_type & a);
      +
      stable_vector(size_type n, default_init_t, const allocator_type & a);

      Effects: Constructs a stable_vector that will use a copy of allocator a and inserts n default initialized values.

      Throws: If allocator_type's default constructor throws or T's default or copy constructor throws.

      Complexity: Linear to n.

      Note: Non-standard extension

    7. -
      stable_vector(size_type n, const T & t, 
+
      stable_vector(size_type n, const T & t, 
               const allocator_type & al = allocator_type());
      
 
      Effects: Constructs a stable_vector that will use a copy of allocator a and inserts n copies of value.
      
 
      Throws: If allocator_type's default constructor throws or T's default or copy constructor throws.
      
@@ -215,45 +215,45 @@
 
    8. template<typename InputIterator> 
-  stable_vector(InputIterator first, InputIterator last, 
+  stable_vector(InputIterator first, InputIterator last, 
                 const allocator_type & al = allocator_type());

      Effects: Constructs a stable_vector that will use a copy of allocator a and inserts a copy of the range [first, last) in the stable_vector.

      Throws: If allocator_type's default constructor throws or T's constructor taking a dereferenced InIt throws.

      Complexity: Linear to the range [first, last).

    9. -
      stable_vector(const stable_vector & x);
      +
      stable_vector(const stable_vector & x);

      Effects: Copy constructs a stable_vector.

      Postcondition: x == *this.

      Complexity: Linear to the elements x contains.

    10. -
      stable_vector(std::initializer_list< value_type > il, 
+
      stable_vector(std::initializer_list< value_type > il, 
               const allocator_type & l = allocator_type());
      
 
      Effects: Constructs a stable_vector that will use a copy of allocator a and inserts a copy of the range [il.begin(), il.last()) in the stable_vector
      
 
      Throws: If allocator_type's default constructor throws or T's constructor taking a dereferenced initializer_list iterator throws.
      
 
      Complexity: Linear to the range [il.begin(), il.end()).
    11. -
      stable_vector(stable_vector && x);
      +
      stable_vector(stable_vector && x);

      Effects: Move constructor. Moves x's resources to *this.

      Throws: If allocator_type's copy constructor throws.

      Complexity: Constant.

    12. -
      stable_vector(const stable_vector & x, const allocator_type & a);
      +
      stable_vector(const stable_vector & x, const allocator_type & a);

      Effects: Copy constructs a stable_vector using the specified allocator.

      Postcondition: x == *this.

      Complexity: Linear to the elements x contains.

    13. -
      stable_vector(stable_vector && x, const allocator_type & a);
      +
      stable_vector(stable_vector && x, const allocator_type & a);

      Effects: Move constructor using the specified allocator. Moves x's resources to *this.

      Throws: If allocator_type's copy constructor throws.

      Complexity: Constant if a == x.get_allocator(), linear otherwise

    14. -
      stable_vector & operator=(const stable_vector & x);
      +
      stable_vector & operator=(const stable_vector & x);

      Effects: Makes *this contain the same elements as x.

      Postcondition: this->size() == x.size(). *this contains a copy of each of x's elements.

      Throws: If memory allocation throws or T's copy constructor throws.

      @@ -261,19 +261,19 @@ 
    15. stable_vector & 
-operator=(stable_vector && x) noexcept(allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value));
      +operator=(stable_vector && x) noexcept(allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value));

      Effects: Move assignment. All x's values are transferred to *this.

      Postcondition: x.empty(). *this contains a the elements x had before the function.

      Throws: If allocator_traits_type::propagate_on_container_move_assignment is false and (allocation throws or T's move constructor throws)

      Complexity: Constant if allocator_traits_type:: propagate_on_container_move_assignment is true or this->get>allocator() == x.get_allocator(). Linear otherwise.

    16. -
      stable_vector & operator=(std::initializer_list< value_type > il);
      +
      stable_vector & operator=(std::initializer_list< value_type > il);

      Effects: Make *this container contains elements from il.

      Complexity: Linear to the range [il.begin(), il.end()).

    17. -
      ~stable_vector();
      +
      ~stable_vector();

      Effects: Destroys the stable_vector. All stored values are destroyed and used memory is deallocated.

      Throws: Nothing.

      Complexity: Linear to the number of elements.

      @@ -281,217 +281,217 @@
    -

    -stable_vector public member functions

    +

    +stable_vector public member functions

    1. -
      void assign(size_type n, const T & t);
      +
      void assign(size_type n, const T & t);

      Effects: Assigns the n copies of val to *this.

      Throws: If memory allocation throws or T's copy constructor throws.

      Complexity: Linear to n. 

    2. template<typename InputIterator> 
-  void assign(InputIterator first, InputIterator last);
      + void assign(InputIterator first, InputIterator last);

      Effects: Assigns the the range [first, last) to *this.

      Throws: If memory allocation throws or T's constructor from dereferencing InpIt throws.

      Complexity: Linear to n.

    3. -
      void assign(std::initializer_list< value_type > il);
      +
      void assign(std::initializer_list< value_type > il);

      Effects: Assigns the the range [il.begin(), il.end()) to *this.

      Throws: If memory allocation throws or T's constructor from dereferencing initializer_list iterator throws.

    4. -
      allocator_type get_allocator() const;
      +
      allocator_type get_allocator() const;

      Effects: Returns a copy of the internal allocator.

      Throws: If allocator's copy constructor throws.

      Complexity: Constant.

    5. -
      const stored_allocator_type & get_stored_allocator() const noexcept;
      +
      const stored_allocator_type & get_stored_allocator() const noexcept;

      Effects: Returns a reference to the internal allocator.

      Throws: Nothing

      Complexity: Constant.

      Note: Non-standard extension.

    6. -
      stored_allocator_type & get_stored_allocator() noexcept;
      +
      stored_allocator_type & get_stored_allocator() noexcept;

      Effects: Returns a reference to the internal allocator.

      Throws: Nothing

      Complexity: Constant.

      Note: Non-standard extension.

    7. -
      iterator begin() noexcept;
      +
      iterator begin() noexcept;

      Effects: Returns an iterator to the first element contained in the stable_vector.

      Throws: Nothing.

      Complexity: Constant.

    8. -
      const_iterator begin() const noexcept;
      +
      const_iterator begin() const noexcept;

      Effects: Returns a const_iterator to the first element contained in the stable_vector.

      Throws: Nothing.

      Complexity: Constant.

    9. -
      iterator end() noexcept;
      +
      iterator end() noexcept;

      Effects: Returns an iterator to the end of the stable_vector.

      Throws: Nothing.

      Complexity: Constant.

    10. -
      const_iterator end() const noexcept;
      +
      const_iterator end() const noexcept;

      Effects: Returns a const_iterator to the end of the stable_vector.

      Throws: Nothing.

      Complexity: Constant.

    11. -
      reverse_iterator rbegin() noexcept;
      +
      reverse_iterator rbegin() noexcept;

      Effects: Returns a reverse_iterator pointing to the beginning of the reversed stable_vector.

      Throws: Nothing.

      Complexity: Constant.

    12. -
      const_reverse_iterator rbegin() const noexcept;
      +
      const_reverse_iterator rbegin() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed stable_vector.

      Throws: Nothing.

      Complexity: Constant.

    13. -
      reverse_iterator rend() noexcept;
      +
      reverse_iterator rend() noexcept;

      Effects: Returns a reverse_iterator pointing to the end of the reversed stable_vector.

      Throws: Nothing.

      Complexity: Constant.

    14. -
      const_reverse_iterator rend() const noexcept;
      +
      const_reverse_iterator rend() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed stable_vector.

      Throws: Nothing.

      Complexity: Constant.

    15. -
      const_iterator cbegin() const noexcept;
      +
      const_iterator cbegin() const noexcept;

      Effects: Returns a const_iterator to the first element contained in the stable_vector.

      Throws: Nothing.

      Complexity: Constant.

    16. -
      const_iterator cend() const noexcept;
      +
      const_iterator cend() const noexcept;

      Effects: Returns a const_iterator to the end of the stable_vector.

      Throws: Nothing.

      Complexity: Constant.

    17. -
      const_reverse_iterator crbegin() const noexcept;
      +
      const_reverse_iterator crbegin() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed stable_vector.

      Throws: Nothing.

      Complexity: Constant.

    18. -
      const_reverse_iterator crend() const noexcept;
      +
      const_reverse_iterator crend() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed stable_vector.

      Throws: Nothing.

      Complexity: Constant.

    19. -
      bool empty() const noexcept;
      +
      bool empty() const noexcept;

      Effects: Returns true if the stable_vector contains no elements.

      Throws: Nothing.

      Complexity: Constant.

    20. -
      size_type size() const noexcept;
      +
      size_type size() const noexcept;

      Effects: Returns the number of the elements contained in the stable_vector.

      Throws: Nothing.

      Complexity: Constant.

    21. -
      size_type max_size() const noexcept;
      +
      size_type max_size() const noexcept;

      Effects: Returns the largest possible size of the stable_vector.

      Throws: Nothing.

      Complexity: Constant.

    22. -
      void resize(size_type n);
      +
      void resize(size_type n);

      Effects: Inserts or erases elements at the end such that the size becomes n. New elements are value initialized.

      Throws: If memory allocation throws, or T's value initialization throws.

      Complexity: Linear to the difference between size() and new_size.

    23. -
      void resize(size_type n, default_init_t);
      +
      void resize(size_type n, default_init_t);

      Effects: Inserts or erases elements at the end such that the size becomes n. New elements are default initialized.

      Throws: If memory allocation throws, or T's default initialization throws.

      Complexity: Linear to the difference between size() and new_size.

      Note: Non-standard extension

    24. -
      void resize(size_type n, const T & t);
      +
      void resize(size_type n, const T & t);

      Effects: Inserts or erases elements at the end such that the size becomes n. New elements are copy constructed from x.

      Throws: If memory allocation throws, or T's copy constructor throws.

      Complexity: Linear to the difference between size() and new_size.

    25. -
      size_type capacity() const noexcept;
      +
      size_type capacity() const noexcept;

      Effects: Number of elements for which memory has been allocated. capacity() is always greater than or equal to size().

      Throws: Nothing.

      Complexity: Constant.

    26. -
      void reserve(size_type n);
      +
      void reserve(size_type n);

      Effects: If n is less than or equal to capacity(), this call has no effect. Otherwise, it is a request for allocation of additional memory. If the request is successful, then capacity() is greater than or equal to n; otherwise, capacity() is unchanged. In either case, size() is unchanged.

      Throws: If memory allocation allocation throws.

    27. -
      void shrink_to_fit();
      +
      void shrink_to_fit();

      Effects: Tries to deallocate the excess of memory created with previous allocations. The size of the stable_vector is unchanged

      Throws: If memory allocation throws.

      Complexity: Linear to size().

    28. -
      reference front() noexcept;
      +
      reference front() noexcept;

      Requires: !empty()

      Effects: Returns a reference to the first element of the container.

      Throws: Nothing.

      Complexity: Constant.

    29. -
      const_reference front() const noexcept;
      +
      const_reference front() const noexcept;

      Requires: !empty()

      Effects: Returns a const reference to the first element of the container.

      Throws: Nothing.

      Complexity: Constant.

    30. -
      reference back() noexcept;
      +
      reference back() noexcept;

      Requires: !empty()

      Effects: Returns a reference to the last element of the container.

      Throws: Nothing.

      Complexity: Constant.

    31. -
      const_reference back() const noexcept;
      +
      const_reference back() const noexcept;

      Requires: !empty()

      Effects: Returns a const reference to the last element of the container.

      Throws: Nothing.

      Complexity: Constant.

    32. -
      reference operator[](size_type n) noexcept;
      +
      reference operator[](size_type n) noexcept;

      Requires: size() > n.

      Effects: Returns a reference to the nth element from the beginning of the container.

      Throws: Nothing.

      Complexity: Constant.

    33. -
      const_reference operator[](size_type n) const noexcept;
      +
      const_reference operator[](size_type n) const noexcept;

      Requires: size() > n.

      Effects: Returns a const reference to the nth element from the beginning of the container.

      Throws: Nothing.

      Complexity: Constant.

    34. -
      iterator nth(size_type n) noexcept;
      +
      iterator nth(size_type n) noexcept;

      Requires: size() >= n.

      Effects: Returns an iterator to the nth element from the beginning of the container. Returns end() if n == size().

      Throws: Nothing.

      @@ -499,7 +499,7 @@

      Note: Non-standard extension

    35. -
      const_iterator nth(size_type n) const noexcept;
      +
      const_iterator nth(size_type n) const noexcept;

      Requires: size() >= n.

      Effects: Returns a const_iterator to the nth element from the beginning of the container. Returns end() if n == size().

      Throws: Nothing.

      @@ -507,7 +507,7 @@

      Note: Non-standard extension

    36. -
      size_type index_of(iterator p) noexcept;
      +
      size_type index_of(iterator p) noexcept;

      Requires: begin() <= p <= end().

      Effects: Returns the index of the element pointed by p and size() if p == end().

      Throws: Nothing.

      @@ -515,7 +515,7 @@

      Note: Non-standard extension

    37. -
      size_type index_of(const_iterator p) const noexcept;
      +
      size_type index_of(const_iterator p) const noexcept;

      Requires: begin() <= p <= end().

      Effects: Returns the index of the element pointed by p and size() if p == end().

      Throws: Nothing.

      @@ -523,46 +523,46 @@

      Note: Non-standard extension

    38. -
      reference at(size_type n);
      +
      reference at(size_type n);

      Requires: size() > n.

      Effects: Returns a reference to the nth element from the beginning of the container.

      Throws: std::range_error if n >= size()

      Complexity: Constant.

    39. -
      const_reference at(size_type n) const;
      +
      const_reference at(size_type n) const;

      Requires: size() > n.

      Effects: Returns a const reference to the nth element from the beginning of the container.

      Throws: std::range_error if n >= size()

      Complexity: Constant.

    40. -
      template<class... Args> void emplace_back(Args &&... args);
      +
      template<class... Args> void emplace_back(Args &&... args);

      Effects: Inserts an object of type T constructed with std::forward<Args>(args)... in the end of the stable_vector.

      Throws: If memory allocation throws or the in-place constructor throws.

      Complexity: Amortized constant time.

    41. -
      template<class... Args> iterator emplace(const_iterator p, Args &&... args);
      +
      template<class... Args> iterator emplace(const_iterator p, Args &&... args);

      Requires: p must be a valid iterator of *this.

      Effects: Inserts an object of type T constructed with std::forward<Args>(args)... before p

      Throws: If memory allocation throws or the in-place constructor throws.

      Complexity: If p is end(), amortized constant time Linear time otherwise.

    42. -
      void push_back(const T & x);
      +
      void push_back(const T & x);

      Effects: Inserts a copy of x at the end of the stable_vector.

      Throws: If memory allocation throws or T's copy constructor throws.

      Complexity: Amortized constant time.

    43. -
      void push_back(T && x);
      +
      void push_back(T && x);

      Effects: Constructs a new element in the end of the stable_vector and moves the resources of x to this new element.

      Throws: If memory allocation throws.

      Complexity: Amortized constant time.

    44. -
      iterator insert(const_iterator p, const T & x);
      +
      iterator insert(const_iterator p, const T & x);

      Requires: p must be a valid iterator of *this.

      Effects: Insert a copy of x before p.

      Returns: An iterator to the inserted element.

      @@ -570,7 +570,7 @@

      Complexity: If p is end(), amortized constant time Linear time otherwise.

    45. -
      iterator insert(const_iterator p, T && x);
      +
      iterator insert(const_iterator p, T && x);

      Requires: p must be a valid iterator of *this.

      Effects: Insert a new element before p with x's resources.

      Returns: an iterator to the inserted element.

      @@ -578,7 +578,7 @@

      Complexity: If p is end(), amortized constant time Linear time otherwise.

    46. -
      iterator insert(const_iterator p, size_type n, const T & t);
      +
      iterator insert(const_iterator p, size_type n, const T & t);

      Requires: p must be a valid iterator of *this.

      Effects: Insert n copies of x before p.

      Returns: an iterator to the first inserted element or p if n is 0.

      @@ -586,7 +586,7 @@

      Complexity: Linear to n.

    47. -
      iterator insert(const_iterator p, std::initializer_list< value_type > il);
      +
      iterator insert(const_iterator p, std::initializer_list< value_type > il);
      Requires: p must be a valid iterator of *this.

      Requires: p must be a valid iterator of *this.

      Effects: Insert a copy of the [il.begin(), il.end()) range before p.

      Returns: an iterator to the first inserted element or p if first == last.

      @@ -594,7 +594,7 @@ 
    48. template<typename InputIterator> 
-  iterator insert(const_iterator p, InputIterator first, InputIterator last);
      + iterator insert(const_iterator p, InputIterator first, InputIterator last);

      Requires: pos must be a valid iterator of *this.

      Effects: Insert a copy of the [first, last) range before p.

      Returns: an iterator to the first inserted element or p if first == last.

      @@ -602,31 +602,31 @@

      Complexity: Linear to distance [first, last).

    49. -
      void pop_back() noexcept;
      +
      void pop_back() noexcept;

      Effects: Removes the last element from the stable_vector.

      Throws: Nothing.

      Complexity: Constant time.

    50. -
      iterator erase(const_iterator p) noexcept;
      +
      iterator erase(const_iterator p) noexcept;

      Effects: Erases the element at p.

      Throws: Nothing.

      Complexity: Linear to the elements between p and the last element. Constant if p is the last element.

    51. -
      iterator erase(const_iterator first, const_iterator last) noexcept;
      +
      iterator erase(const_iterator first, const_iterator last) noexcept;

      Effects: Erases the elements pointed by [first, last).

      Throws: Nothing.

      Complexity: Linear to the distance between first and last plus linear to the elements between p and the last element.

    52. -
      void swap(stable_vector & x) noexcept(allocator_traits_type::propagate_on_container_swap::value||allocator_traits_type::is_always_equal::value));
      +
      void swap(stable_vector & x) noexcept(allocator_traits_type::propagate_on_container_swap::value||allocator_traits_type::is_always_equal::value));

      Effects: Swaps the contents of *this and x.

      Throws: Nothing.

      Complexity: Constant.

    53. -
      void clear() noexcept;
      +
      void clear() noexcept;

      Effects: Erases all the elements of the stable_vector.

      Throws: Nothing.

      Complexity: Linear to the number of elements in the stable_vector.

      @@ -634,41 +634,41 @@
    -

    -stable_vector friend functions

    +

    +stable_vector friend functions

    1. -
      friend bool operator==(const stable_vector & x, const stable_vector & y);
      +
      friend bool operator==(const stable_vector & x, const stable_vector & y);

      Effects: Returns true if x and y are equal

      Complexity: Linear to the number of elements in the container.

    2. -
      friend bool operator!=(const stable_vector & x, const stable_vector & y);
      +
      friend bool operator!=(const stable_vector & x, const stable_vector & y);

      Effects: Returns true if x and y are unequal

      Complexity: Linear to the number of elements in the container.

    3. -
      friend bool operator<(const stable_vector & x, const stable_vector & y);
      +
      friend bool operator<(const stable_vector & x, const stable_vector & y);

      Effects: Returns true if x is less than y

      Complexity: Linear to the number of elements in the container.

    4. -
      friend bool operator>(const stable_vector & x, const stable_vector & y);
      +
      friend bool operator>(const stable_vector & x, const stable_vector & y);

      Effects: Returns true if x is greater than y

      Complexity: Linear to the number of elements in the container.

    5. -
      friend bool operator<=(const stable_vector & x, const stable_vector & y);
      +
      friend bool operator<=(const stable_vector & x, const stable_vector & y);

      Effects: Returns true if x is equal or less than y

      Complexity: Linear to the number of elements in the container.

    6. -
      friend bool operator>=(const stable_vector & x, const stable_vector & y);
      +
      friend bool operator>=(const stable_vector & x, const stable_vector & y);

      Effects: Returns true if x is equal or greater than y

      Complexity: Linear to the number of elements in the container.

    7. -
      friend void swap(stable_vector & x, stable_vector & y);
      +
      friend void swap(stable_vector & x, stable_vector & y);

      Effects: x.swap(y)

      Complexity: Constant.

      8. @@ -678,7 +678,7 @@
    -
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -686,7 +686,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/container/static_vector.html b/doc/html/boost/container/static_vector.html index 69fe10bf2e..cb3402523d 100644 --- a/doc/html/boost/container/static_vector.html +++ b/doc/html/boost/container/static_vector.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -49,85 +49,85 @@ typedef base_t::const_reverse_iterator const_reverse_iterator; // The const reverse iterator. // construct/copy/destruct - static_vector() noexcept; - explicit static_vector(size_type); - static_vector(size_type, default_init_t); - static_vector(size_type, value_type const &); - template<typename Iterator> static_vector(Iterator, Iterator); - static_vector(std::initializer_list< value_type >); - static_vector(static_vector const &); + static_vector() noexcept; + explicit static_vector(size_type); + static_vector(size_type, default_init_t); + static_vector(size_type, value_type const &); + template<typename Iterator> static_vector(Iterator, Iterator); + static_vector(std::initializer_list< value_type >); + static_vector(static_vector const &); template<std::size_t C> - static_vector(static_vector< value_type, C > const &); - static_vector(static_vector &&); - template<std::size_t C> static_vector(static_vector< value_type, C > &&); - static_vector & operator=(const static_vector &); - static_vector & operator=(std::initializer_list< value_type >); + static_vector(static_vector< value_type, C > const &); + static_vector(static_vector &&); + template<std::size_t C> static_vector(static_vector< value_type, C > &&); + static_vector & operator=(const static_vector &); + static_vector & operator=(std::initializer_list< value_type >); template<std::size_t C> - static_vector & operator=(static_vector< value_type, C > const &); - static_vector & operator=(static_vector &&); + static_vector & operator=(static_vector< value_type, C > const &); + static_vector & operator=(static_vector &&); template<std::size_t C> - static_vector & operator=(static_vector< value_type, C > &&); - ~static_vector(); + static_vector & operator=(static_vector< value_type, C > &&); + ~static_vector(); - // public member functions - void swap(static_vector &); - template<std::size_t C> void swap(static_vector< value_type, C > &); - void resize(size_type); - void resize(size_type, default_init_t); - void resize(size_type, value_type const &); - void reserve(size_type) noexcept; - void push_back(value_type const &); - void push_back(value_type &&); - void pop_back(); - iterator insert(const_iterator, value_type const &); - iterator insert(const_iterator, value_type &&); - iterator insert(const_iterator, size_type, value_type const &); + // public member functions + void swap(static_vector &); + template<std::size_t C> void swap(static_vector< value_type, C > &); + void resize(size_type); + void resize(size_type, default_init_t); + void resize(size_type, value_type const &); + void reserve(size_type) noexcept; + void push_back(value_type const &); + void push_back(value_type &&); + void pop_back(); + iterator insert(const_iterator, value_type const &); + iterator insert(const_iterator, value_type &&); + iterator insert(const_iterator, size_type, value_type const &); template<typename Iterator> - iterator insert(const_iterator, Iterator, Iterator); - iterator insert(const_iterator, std::initializer_list< value_type >); - iterator erase(const_iterator); - iterator erase(const_iterator, const_iterator); - template<typename Iterator> void assign(Iterator, Iterator); - void assign(std::initializer_list< value_type >); - void assign(size_type, value_type const &); - template<class... Args> void emplace_back(Args &&...); - template<class... Args> iterator emplace(const_iterator, Args &&...); - void clear() noexcept; - reference at(size_type); - const_reference at(size_type) const; - reference operator[](size_type); - const_reference operator[](size_type) const; - iterator nth(size_type); - const_iterator nth(size_type) const; - size_type index_of(iterator); - size_type index_of(const_iterator) const; - reference front(); - const_reference front() const; - reference back(); - const_reference back() const; - Value * data() noexcept; - const Value * data() const noexcept; - iterator begin() noexcept; - const_iterator begin() const noexcept; - const_iterator cbegin() const noexcept; - iterator end() noexcept; - const_iterator end() const noexcept; - const_iterator cend() const noexcept; - reverse_iterator rbegin() noexcept; - const_reverse_iterator rbegin() const noexcept; - const_reverse_iterator crbegin() const noexcept; - reverse_iterator rend() noexcept; - const_reverse_iterator rend() const noexcept; - const_reverse_iterator crend() const noexcept; - size_type size() const noexcept; - bool empty() const noexcept; + iterator insert(const_iterator, Iterator, Iterator); + iterator insert(const_iterator, std::initializer_list< value_type >); + iterator erase(const_iterator); + iterator erase(const_iterator, const_iterator); + template<typename Iterator> void assign(Iterator, Iterator); + void assign(std::initializer_list< value_type >); + void assign(size_type, value_type const &); + template<class... Args> void emplace_back(Args &&...); + template<class... Args> iterator emplace(const_iterator, Args &&...); + void clear() noexcept; + reference at(size_type); + const_reference at(size_type) const; + reference operator[](size_type); + const_reference operator[](size_type) const; + iterator nth(size_type); + const_iterator nth(size_type) const; + size_type index_of(iterator); + size_type index_of(const_iterator) const; + reference front(); + const_reference front() const; + reference back(); + const_reference back() const; + Value * data() noexcept; + const Value * data() const noexcept; + iterator begin() noexcept; + const_iterator begin() const noexcept; + const_iterator cbegin() const noexcept; + iterator end() noexcept; + const_iterator end() const noexcept; + const_iterator cend() const noexcept; + reverse_iterator rbegin() noexcept; + const_reverse_iterator rbegin() const noexcept; + const_reverse_iterator crbegin() const noexcept; + reverse_iterator rend() noexcept; + const_reverse_iterator rend() const noexcept; + const_reverse_iterator crend() const noexcept; + size_type size() const noexcept; + bool empty() const noexcept; - // public static functions - static size_type capacity() noexcept; - static size_type max_size() noexcept; + // public static functions + static size_type capacity() noexcept; + static size_type max_size() noexcept; };
    -

    Description

    +

    Description

    static_vector is a sequence container like boost::container::vector with contiguous storage that can change in size, along with the static allocation, low overhead, and fixed capacity of boost::array.

    A static_vector is a sequence that supports random access to elements, constant time insertion and removal of elements at the end, and linear time insertion and removal of elements at the beginning or in the middle. The number of elements in a static_vector may vary dynamically up to a fixed capacity because elements are stored within the object itself similarly to an array. However, objects are initialized as they are inserted into static_vector unlike C arrays or std::array which must construct all elements on instantiation. The behavior of static_vector enables the use of statically allocated elements in cases with complex object lifetime requirements that would otherwise not be trivially possible.

    Error Handling. Insertion beyond the capacity result in throwing std::bad_alloc() if exceptions are enabled or calling throw_bad_alloc() if not enabled.

    @@ -136,7 +136,7 @@ std::out_of_range is thrown if out of bound access is performed in -

    Template Parameters

    +

    Template Parameters

    1. typename Value
      @@ -149,13 +149,13 @@ std::out_of_range is thrown if out of bound access is performed in -

      +

      static_vector public construct/copy/destruct

      1. -
        static_vector() noexcept;
        Constructs an empty static_vector.

        Throws. Nothing.

        +
        static_vector() noexcept;
        Constructs an empty static_vector.

        Throws. Nothing.

        Complexity. Constant O(1).

        @@ -163,7 +163,7 @@ std::out_of_range is thrown if out of bound access is performed in -
        explicit static_vector(size_type count);
        Constructs a static_vector containing count value initialized values.

        +

        explicit static_vector(size_type count);
        Constructs a static_vector containing count value initialized values.

        Throws. If Value's value initialization throws.

        @@ -199,7 +199,7 @@ std::out_of_range is thrown if out of bound access is performed in -
        static_vector(size_type count, default_init_t);
        Constructs a static_vector containing count default initialized values.

        +

        static_vector(size_type count, default_init_t);
        Constructs a static_vector containing count default initialized values.

        Throws. If Value's default initialization throws.

        @@ -238,7 +238,7 @@ std::out_of_range is thrown if out of bound access is performed in -
        static_vector(size_type count, value_type const & value);
        Constructs a static_vector containing count copies of value.

        +

        static_vector(size_type count, value_type const & value);
        Constructs a static_vector containing count copies of value.

        Throws. If Value's copy constructor throws.

        @@ -280,7 +280,7 @@ std::out_of_range is thrown if out of bound access is performed in -
        template<typename Iterator> static_vector(Iterator first, Iterator last);
        Constructs a static_vector containing copy of a range [first, last).

        +

        template<typename Iterator> static_vector(Iterator first, Iterator last);
        Constructs a static_vector containing copy of a range [first, last).

        Throws. If Value's constructor taking a dereferenced Iterator throws.

        @@ -329,7 +329,7 @@ std::out_of_range is thrown if out of bound access is performed in -
        static_vector(std::initializer_list< value_type > il);
        Constructs a static_vector containing copy of a range [il.begin(), il.end()).

        +

        static_vector(std::initializer_list< value_type > il);
        Constructs a static_vector containing copy of a range [il.begin(), il.end()).

        Throws. If Value's constructor taking a dereferenced std::initializer_list throws.

        @@ -369,7 +369,7 @@ std::out_of_range is thrown if out of bound access is performed in -
        static_vector(static_vector const & other);
        Constructs a copy of other static_vector.

        +

        static_vector(static_vector const & other);
        Constructs a copy of other static_vector.

        Throws. If Value's copy constructor throws.

        @@ -399,7 +399,7 @@ std::out_of_range is thrown if out of bound access is performed in 

        template<std::size_t C> 
-  static_vector(static_vector< value_type, C > const & other);
        Constructs a copy of other static_vector.

        + static_vector(static_vector< value_type, C > const & other);Constructs a copy of other static_vector.

        Throws. If Value's copy constructor throws.

        @@ -435,7 +435,7 @@ std::out_of_range is thrown if out of bound access is performed in -
        static_vector(static_vector && other);
        Move constructor. Moves Values stored in the other static_vector to this one.

        +

        static_vector(static_vector && other);
        Move constructor. Moves Values stored in the other static_vector to this one.

        Throws. 

          @@ -470,7 +470,7 @@ std::out_of_range is thrown if out of bound access is performed in -
          template<std::size_t C> static_vector(static_vector< value_type, C > && other);
          Move constructor. Moves Values stored in the other static_vector to this one.

          +

          template<std::size_t C> static_vector(static_vector< value_type, C > && other);
          Move constructor. Moves Values stored in the other static_vector to this one.

          Throws. 

          @@ -512,7 +512,7 @@ std::out_of_range is thrown if out of bound access is performed in -
          static_vector & operator=(const static_vector & other);
          Copy assigns Values stored in the other static_vector to this one.

          +

          static_vector & operator=(const static_vector & other);
          Copy assigns Values stored in the other static_vector to this one.

          Throws. If Value's copy constructor or copy assignment throws.

          @@ -541,7 +541,7 @@ std::out_of_range is thrown if out of bound access is performed in -

          static_vector & operator=(std::initializer_list< value_type > il);
          Copy assigns Values stored in std::initializer_list to *this.

          +

          static_vector & operator=(std::initializer_list< value_type > il);
          Copy assigns Values stored in std::initializer_list to *this.

          Throws. If Value's copy constructor or copy assignment throws.

          @@ -571,7 +571,7 @@ std::out_of_range is thrown if out of bound access is performed in 

          template<std::size_t C> 
-  static_vector & operator=(static_vector< value_type, C > const & other);
          Copy assigns Values stored in the other static_vector to this one.

          + static_vector & operator=(static_vector< value_type, C > const & other);Copy assigns Values stored in the other static_vector to this one.

          Throws. If Value's copy constructor or copy assignment throws.

          @@ -607,7 +607,7 @@ std::out_of_range is thrown if out of bound access is performed in -
          static_vector & operator=(static_vector && other);
          Move assignment. Moves Values stored in the other static_vector to this one.

          +

          static_vector & operator=(static_vector && other);
          Move assignment. Moves Values stored in the other static_vector to this one.

          Throws. 

            @@ -643,7 +643,7 @@ std::out_of_range is thrown if out of bound access is performed in 
            template<std::size_t C> 
-  static_vector & operator=(static_vector< value_type, C > && other);
            Move assignment. Moves Values stored in the other static_vector to this one.

            + static_vector & operator=(static_vector< value_type, C > && other);Move assignment. Moves Values stored in the other static_vector to this one.

            Throws. 

            @@ -685,7 +685,7 @@ std::out_of_range is thrown if out of bound access is performed in -
            ~static_vector();
            Destructor. Destroys Values stored in this container.

            Throws. Nothing

            +
            ~static_vector();
            Destructor. Destroys Values stored in this container.

            Throws. Nothing

            Complexity. Linear O(N).

            @@ -695,11 +695,11 @@ std::out_of_range is thrown if out of bound access is performed in -

            -static_vector public member functions

            +

            +static_vector public member functions

            1. -
              void swap(static_vector & other);
              Swaps contents of the other static_vector and this one.

              +

              void swap(static_vector & other);
              Swaps contents of the other static_vector and this one.

              Throws. 

                @@ -734,7 +734,7 @@ std::out_of_range is thrown if out of bound access is performed in -
                template<std::size_t C> void swap(static_vector< value_type, C > & other);
                Swaps contents of the other static_vector and this one.

                +

                template<std::size_t C> void swap(static_vector< value_type, C > & other);
                Swaps contents of the other static_vector and this one.

                Throws. 

                @@ -776,7 +776,7 @@ std::out_of_range is thrown if out of bound access is performed in -
                void resize(size_type count);
                Inserts or erases elements at the end such that the size becomes count. New elements are value initialized.

                +

                void resize(size_type count);
                Inserts or erases elements at the end such that the size becomes count. New elements are value initialized.

                Throws. If Value's value initialization throws.

                @@ -812,7 +812,7 @@ std::out_of_range is thrown if out of bound access is performed in -
                void resize(size_type count, default_init_t);
                Inserts or erases elements at the end such that the size becomes count. New elements are default initialized.

                +

                void resize(size_type count, default_init_t);
                Inserts or erases elements at the end such that the size becomes count. New elements are default initialized.

                Throws. If Value's default initialization throws.

                @@ -851,7 +851,7 @@ std::out_of_range is thrown if out of bound access is performed in -
                void resize(size_type count, value_type const & value);
                Inserts or erases elements at the end such that the size becomes count. New elements are copy constructed from value.

                +

                void resize(size_type count, value_type const & value);
                Inserts or erases elements at the end such that the size becomes count. New elements are copy constructed from value.

                Throws. If Value's copy constructor throws.

                @@ -893,7 +893,7 @@ std::out_of_range is thrown if out of bound access is performed in -
                void reserve(size_type count) noexcept;
                This call has no effect because the Capacity of this container is constant.

                +

                void reserve(size_type count) noexcept;
                This call has no effect because the Capacity of this container is constant.

                Throws. Nothing.

                @@ -929,7 +929,7 @@ std::out_of_range is thrown if out of bound access is performed in -
                void push_back(value_type const & value);
                Adds a copy of value at the end.

                +

                void push_back(value_type const & value);
                Adds a copy of value at the end.

                Throws. If Value's copy constructor throws.

                @@ -965,7 +965,7 @@ std::out_of_range is thrown if out of bound access is performed in -
                void push_back(value_type && value);
                Moves value to the end.

                +

                void push_back(value_type && value);
                Moves value to the end.

                Throws. If Value's move constructor throws.

                @@ -1001,7 +1001,7 @@ std::out_of_range is thrown if out of bound access is performed in -
                void pop_back();
                Destroys last value and decreases the size.

                +

                void pop_back();
                Destroys last value and decreases the size.

                Throws. Nothing by default.

                @@ -1021,7 +1021,7 @@ std::out_of_range is thrown if out of bound access is performed in -

                iterator insert(const_iterator p, value_type const & value);
                Inserts a copy of element at p.

                +

                iterator insert(const_iterator p, value_type const & value);
                Inserts a copy of element at p.

                Throws. 

                @@ -1076,7 +1076,7 @@ std::out_of_range is thrown if out of bound access is performed in -
                iterator insert(const_iterator p, value_type && value);
                Inserts a move-constructed element at p.

                +

                iterator insert(const_iterator p, value_type && value);
                Inserts a move-constructed element at p.

                Throws. If Value's move constructor or move assignment throws.

                @@ -1125,7 +1125,7 @@ std::out_of_range is thrown if out of bound access is performed in -
                iterator insert(const_iterator p, size_type count, value_type const & value);
                Inserts a count copies of value at p.

                +

                iterator insert(const_iterator p, size_type count, value_type const & value);
                Inserts a count copies of value at p.

                Throws. 

                @@ -1185,7 +1185,7 @@ std::out_of_range is thrown if out of bound access is performed in 
                template<typename Iterator> 
-  iterator insert(const_iterator p, Iterator first, Iterator last);
                Inserts a copy of a range [first, last) at p.

                + iterator insert(const_iterator p, Iterator first, Iterator last);Inserts a copy of a range [first, last) at p.

                Throws. 

                @@ -1245,7 +1245,7 @@ std::out_of_range is thrown if out of bound access is performed in -
                iterator insert(const_iterator p, std::initializer_list< value_type > il);
                Inserts a copy of a range [il.begin(), il.end()) at p.

                +

                iterator insert(const_iterator p, std::initializer_list< value_type > il);
                Inserts a copy of a range [il.begin(), il.end()) at p.

                Throws. 

                @@ -1297,7 +1297,7 @@ std::out_of_range is thrown if out of bound access is performed in -
                iterator erase(const_iterator p);
                Erases Value from p.

                +

                iterator erase(const_iterator p);
                Erases Value from p.

                Throws. If Value's move assignment throws.

                @@ -1333,7 +1333,7 @@ std::out_of_range is thrown if out of bound access is performed in -
                iterator erase(const_iterator first, const_iterator last);
                Erases Values from a range [first, last).

                +

                iterator erase(const_iterator first, const_iterator last);
                Erases Values from a range [first, last).

                Throws. If Value's move assignment throws.

                @@ -1382,7 +1382,7 @@ std::out_of_range is thrown if out of bound access is performed in -
                template<typename Iterator> void assign(Iterator first, Iterator last);
                Assigns a range [first, last) of Values to this container.

                +

                template<typename Iterator> void assign(Iterator first, Iterator last);
                Assigns a range [first, last) of Values to this container.

                Throws. If Value's copy constructor or copy assignment throws,

                @@ -1424,7 +1424,7 @@ std::out_of_range is thrown if out of bound access is performed in -
                void assign(std::initializer_list< value_type > il);
                Assigns a range [il.begin(), il.end()) of Values to this container.

                +

                void assign(std::initializer_list< value_type > il);
                Assigns a range [il.begin(), il.end()) of Values to this container.

                Throws. If Value's copy constructor or copy assignment throws,

                @@ -1438,14 +1438,29 @@ std::out_of_range is thrown if out of bound access is performed in

    Parameters:

    ++++ + + + +

    il

    std::initializer_list with values used to construct new content of this container.

    Requires:

    distance(il.begin(), il.end()) <= capacity()
  • -
    void assign(size_type count, value_type const & value);
    Assigns a count copies of value to this container.

    +

    void assign(size_type count, value_type const & value);
    Assigns a count copies of value to this container.

    Throws. If Value's copy constructor or copy assignment throws.

    @@ -1487,7 +1502,7 @@ std::out_of_range is thrown if out of bound access is performed in -
    template<class... Args> void emplace_back(Args &&... args);
    Inserts a Value constructed with std::forward<Args>(args)... in the end of the container.

    +

    template<class... Args> void emplace_back(Args &&... args);
    Inserts a Value constructed with std::forward<Args>(args)... in the end of the container.

    Throws. If in-place constructor throws or Value's move constructor throws.

    @@ -1523,7 +1538,7 @@ std::out_of_range is thrown if out of bound access is performed in -
    template<class... Args> iterator emplace(const_iterator p, Args &&... args);
    Inserts a Value constructed with std::forward<Args>(args)... before p.

    +

    template<class... Args> iterator emplace(const_iterator p, Args &&... args);
    Inserts a Value constructed with std::forward<Args>(args)... before p.

    Throws. If in-place constructor throws or if Value's move constructor or move assignment throws.

    @@ -1572,7 +1587,7 @@ std::out_of_range is thrown if out of bound access is performed in -
    void clear() noexcept;
    Removes all elements from the container.

    Throws. Nothing.

    +
    void clear() noexcept;
    Removes all elements from the container.

    Throws. Nothing.

    Complexity. Constant O(1).

    @@ -1580,7 +1595,7 @@ std::out_of_range is thrown if out of bound access is performed in -
    reference at(size_type i);
    Returns reference to the i-th element.

    +

    reference at(size_type i);
    Returns reference to the i-th element.

    @@ -1621,7 +1636,7 @@ std::out_of_range is thrown if out of bound access is performed in -
    const_reference at(size_type i) const;
    Returns const reference to the i-th element.

    +

    const_reference at(size_type i) const;
    Returns const reference to the i-th element.

    @@ -1662,7 +1677,7 @@ std::out_of_range is thrown if out of bound access is performed in -
    reference operator[](size_type i);
    Returns reference to the i-th element.

    +

    reference operator[](size_type i);
    Returns reference to the i-th element.

    @@ -1703,7 +1718,7 @@ std::out_of_range is thrown if out of bound access is performed in -
    const_reference operator[](size_type i) const;
    Returns const reference to the i-th element.

    +

    const_reference operator[](size_type i) const;
    Returns const reference to the i-th element.

    @@ -1744,7 +1759,7 @@ std::out_of_range is thrown if out of bound access is performed in -
    iterator nth(size_type i);
    Returns a iterator to the i-th element.

    +

    iterator nth(size_type i);
    Returns a iterator to the i-th element.

    @@ -1785,7 +1800,7 @@ std::out_of_range is thrown if out of bound access is performed in -
    const_iterator nth(size_type i) const;
    Returns a const_iterator to the i-th element.

    +

    const_iterator nth(size_type i) const;
    Returns a const_iterator to the i-th element.

    @@ -1826,7 +1841,7 @@ std::out_of_range is thrown if out of bound access is performed in -
    size_type index_of(iterator p);
    Returns the index of the element pointed by p.

    +

    size_type index_of(iterator p);
    Returns the index of the element pointed by p.

    @@ -1843,6 +1858,19 @@ std::out_of_range is thrown if out of bound access is performed in Parameters:

    • ++++ + + + + +

    p

    An iterator to the element.

    Requires:

    begin() <= p <= end()
    ++++ + + + + +

    p

    A const_iterator to the element.

    Requires:

    begin() <= p <= end()
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -2345,7 +2386,7 @@ std::out_of_range is thrown if out of bound access is performed in -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/container/string.html b/doc/html/boost/container/string.html index 9de1322d7d..f89f9dce46 100644 --- a/doc/html/boost/container/string.html +++ b/doc/html/boost/container/string.html @@ -35,13 +35,13 @@ typedef basic_string< char,std::char_traits< char >,new_allocator< char > > string;
    -

    Description

    +

    Description

    Typedef for a basic_string of narrow characters

    -
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost/container/swap_idm46583868776832.html b/doc/html/boost/container/swap_idm46583868776832.html new file mode 100644 index 0000000000..8ab305f691 --- /dev/null +++ b/doc/html/boost/container/swap_idm46583868776832.html @@ -0,0 +1,86 @@ + + + + +Function template swap + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template swap

    +

    boost::container::swap — Swaps contents of two static_vectors.

    +
    +

    Synopsis

    +
    // In header: <boost/container/static_vector.hpp>
+
+
+template<typename V, std::size_t C1, std::size_t C2> 
+  void swap(static_vector< V, C1 > & x, static_vector< V, C2 > & y);
    +
    +

    Description

    +

    This function calls static_vector::swap().

    +

    +

    +

    Complexity. Linear O(N).

    +

    +

    +
    ++++ + + + + +

    Parameters:

    ++++ + + + + + + + + + + +

    x

    The first static_vector.

    y

    The second static_vector.

    +
    +
    + + + +
    Copyright © 2009-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/swap_idp62383632.html b/doc/html/boost/container/swap_idp62383632.html deleted file mode 100644 index 2d458c0983..0000000000 --- a/doc/html/boost/container/swap_idp62383632.html +++ /dev/null @@ -1,86 +0,0 @@ - - - - -Function template swap - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template swap

    -

    boost::container::swap — Swaps contents of two static_vectors.

    -
    -

    Synopsis

    -
    // In header: <boost/container/static_vector.hpp>
-
-
-template<typename V, std::size_t C1, std::size_t C2> 
-  void swap(static_vector< V, C1 > & x, static_vector< V, C2 > & y);
    -
    -

    Description

    -

    This function calls static_vector::swap().

    -

    -

    -

    Complexity. Linear O(N).

    -

    -

    -
    ---- - - - - -

    Parameters:

    ---- - - - - - - - - - - -

    x

    The first static_vector.

    y

    The second static_vector.

    -
    -
    - - - -
    Copyright © 2009-2013 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/container/throw_bad_alloc.html b/doc/html/boost/container/throw_bad_alloc.html index b2d412ac04..559a3805cd 100644 --- a/doc/html/boost/container/throw_bad_alloc.html +++ b/doc/html/boost/container/throw_bad_alloc.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -35,7 +35,7 @@ void throw_bad_alloc();
    -

    Description

    +

    Description

    Exception callback called by Boost.Container when fails to allocate the requested storage space.

    • @@ -54,7 +54,7 @@
    -
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -62,7 +62,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/container/throw_length_error.html b/doc/html/boost/container/throw_length_error.html index 9f46b699ef..2b0c326efe 100644 --- a/doc/html/boost/container/throw_length_error.html +++ b/doc/html/boost/container/throw_length_error.html @@ -35,7 +35,7 @@ void throw_length_error(const char * str);
    -

    Description

    +

    Description

    Exception callback called by Boost.Container to signal errors resizing.

    • @@ -54,7 +54,7 @@
    -
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost/container/throw_logic_error.html b/doc/html/boost/container/throw_logic_error.html index 2242a5aae8..e659dfe49c 100644 --- a/doc/html/boost/container/throw_logic_error.html +++ b/doc/html/boost/container/throw_logic_error.html @@ -35,7 +35,7 @@ void throw_logic_error(const char * str);
    -

    Description

    +

    Description

    Exception callback called by Boost.Container to report errors in the internal logical of the program, such as violation of logical preconditions or class invariants.

    • @@ -54,7 +54,7 @@
    -
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost/container/throw_out_of_range.html b/doc/html/boost/container/throw_out_of_range.html index 2be52bbcc4..e8d523f0a6 100644 --- a/doc/html/boost/container/throw_out_of_range.html +++ b/doc/html/boost/container/throw_out_of_range.html @@ -35,7 +35,7 @@ void throw_out_of_range(const char * str);
    -

    Description

    +

    Description

    Exception callback called by Boost.Container to signal arguments out of range.

    • @@ -54,7 +54,7 @@
    -
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost/container/throw_runtime_error.html b/doc/html/boost/container/throw_runtime_error.html index 17b6c41801..0407a76c2d 100644 --- a/doc/html/boost/container/throw_runtime_error.html +++ b/doc/html/boost/container/throw_runtime_error.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -35,7 +35,7 @@ void throw_runtime_error(const char * str);
    -

    Description

    +

    Description

    Exception callback called by Boost.Container to report errors that can only be detected during runtime.

    • @@ -54,7 +54,7 @@
    -
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -62,7 +62,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/container/tree_assoc_defaults.html b/doc/html/boost/container/tree_assoc_defaults.html index 68285643f8..2b56340b17 100644 --- a/doc/html/boost/container/tree_assoc_defaults.html +++ b/doc/html/boost/container/tree_assoc_defaults.html @@ -35,7 +35,7 @@ typedef implementation_defined tree_assoc_defaults;
    -

    Description

    +

    Description

    Default options for tree-based associative containers

    • tree_type<red_black_tree>

      • @@ -47,7 +47,7 @@
    -
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost/container/tree_assoc_options.html b/doc/html/boost/container/tree_assoc_options.html index 24dc43591c..6a1c57f858 100644 --- a/doc/html/boost/container/tree_assoc_options.html +++ b/doc/html/boost/container/tree_assoc_options.html @@ -38,13 +38,13 @@ typedef implementation_defined type; };
    -

    Description

    +

    Description

    Helper metafunction to combine options into a single type to be used by boost::container::set, boost::container::multiset boost::container::map and boost::container::multimap. Supported options are: boost::container::optimize_size and boost::container::tree_type

    -
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost/container/tree_type.html b/doc/html/boost/container/tree_type.html index 3b5e6bf35d..05c77869b2 100644 --- a/doc/html/boost/container/tree_type.html +++ b/doc/html/boost/container/tree_type.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -36,13 +36,13 @@ struct tree_type { };
    -

    Description

    +

    Description

    This option setter specifies the underlying tree type (red-black, AVL, Scapegoat or Splay) for ordered associative containers

    -
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -50,7 +50,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/container/tree_type_enum.html b/doc/html/boost/container/tree_type_enum.html index 8c2c1e18e7..d9e3e8d498 100644 --- a/doc/html/boost/container/tree_type_enum.html +++ b/doc/html/boost/container/tree_type_enum.html @@ -36,13 +36,13 @@ enum tree_type_enum { red_black_tree, avl_tree, scapegoat_tree, splay_tree };
    -

    Description

    +

    Description

    Enumeration used to configure ordered associative containers with a concrete tree implementation.

    -
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost/container/uses_allocator.html b/doc/html/boost/container/uses_allocator.html index f9bfc6404d..9e854f037e 100644 --- a/doc/html/boost/container/uses_allocator.html +++ b/doc/html/boost/container/uses_allocator.html @@ -6,9 +6,9 @@ - - - + + + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -30,20 +30,20 @@

    boost::container::uses_allocator

    Synopsis

    -
    // In header: <boost/container/scoped_allocator.hpp>
+
    // In header: <boost/container/uses_allocator.hpp>
 
 template<typename T, typename Allocator> 
 struct uses_allocator {
 };
    
 
    
-
    Description
    
-
    Remark: Automatically detects if T has a nested allocator_type that is convertible from Allocator. Meets the BinaryTypeTrait requirements ([meta.rqmts] 20.4.1). A program may specialize this type to define uses_allocator<X>::value as true for a T of user-defined type if T does not have a nested allocator_type but is nonetheless constructible using the specified Allocator.
    
-
    Result: uses_allocator<T, Allocator>::value== true if Convertible<Allocator,T::allocator_type>, false otherwise. 
    
+
    Description
    
+
    Remark: Automatically detects whether T has a nested allocator_type that is convertible from Allocator. Meets the BinaryTypeTrait requirements ([meta.rqmts] 20.4.1). A program may specialize this type to define uses_allocator<X>::value as true for a T of user-defined type if T does not have a nested allocator_type but is nonetheless constructible using the specified Allocator where either: the first argument of a constructor has type allocator_arg_t and the second argument has type Alloc or the last argument of a constructor has type Alloc.
    
+
    Result: uses_allocator<T, Allocator>::value== true if a type T::allocator_type exists and either is_convertible<Alloc, T::allocator_type>::value != false or T::allocator_type is an alias erased_type. False otherwise.
    -
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -51,7 +51,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/container/vector.html b/doc/html/boost/container/vector.html index c00a8d48dc..d3d582188e 100644 --- a/doc/html/boost/container/vector.html +++ b/doc/html/boost/container/vector.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -51,102 +51,102 @@ typedef implementation_defined const_reverse_iterator; // construct/copy/destruct - vector() noexcept; - explicit vector(const allocator_type &) noexcept; - explicit vector(size_type); - vector(size_type, default_init_t); - explicit vector(size_type, const allocator_type &); - vector(size_type, default_init_t, const allocator_type &); - vector(size_type, const T &); - vector(size_type, const T &, const allocator_type &); - template<typename InIt> vector(InIt, InIt); - template<typename InIt> vector(InIt, InIt, const allocator_type &); - vector(const vector &); - vector(vector &&) noexcept; - vector(std::initializer_list< value_type >, + vector() noexcept; + explicit vector(const allocator_type &) noexcept; + explicit vector(size_type); + vector(size_type, default_init_t); + explicit vector(size_type, const allocator_type &); + vector(size_type, default_init_t, const allocator_type &); + vector(size_type, const T &); + vector(size_type, const T &, const allocator_type &); + template<typename InIt> vector(InIt, InIt); + template<typename InIt> vector(InIt, InIt, const allocator_type &); + vector(const vector &); + vector(vector &&) noexcept; + vector(std::initializer_list< value_type >, const allocator_type & = allocator_type()); - vector(const vector &, const allocator_type &); - vector(vector &&, const allocator_type &); - vector & operator=(const vector &); - vector & operator=(std::initializer_list< value_type >); - vector & operator=(vector &&) noexcept(allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value)); - ~vector(); + vector(const vector &, const allocator_type &); + vector(vector &&, const allocator_type &); + vector & operator=(const vector &); + vector & operator=(std::initializer_list< value_type >); + vector & operator=(vector &&) noexcept(allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value)); + ~vector(); - // public member functions - template<typename InIt> void assign(InIt, InIt last ); - void assign(std::initializer_list< T >); - template<typename FwdIt> void assign(FwdIt, FwdIt last ); - void assign(size_type, const value_type &); - allocator_type get_allocator() const noexcept; - stored_allocator_type & get_stored_allocator() noexcept; - const stored_allocator_type & get_stored_allocator() const noexcept; - iterator begin() noexcept; - const_iterator begin() const noexcept; - iterator end() noexcept; - const_iterator end() const noexcept; - reverse_iterator rbegin() noexcept; - const_reverse_iterator rbegin() const noexcept; - reverse_iterator rend() noexcept; - const_reverse_iterator rend() const noexcept; - const_iterator cbegin() const noexcept; - const_iterator cend() const noexcept; - const_reverse_iterator crbegin() const noexcept; - const_reverse_iterator crend() const noexcept; - bool empty() const noexcept; - size_type size() const noexcept; - size_type max_size() const noexcept; - void resize(size_type); - void resize(size_type, default_init_t); - void resize(size_type, const T &); - size_type capacity() const noexcept; - void reserve(size_type); - void shrink_to_fit(); - reference front() noexcept; - const_reference front() const noexcept; - reference back() noexcept; - const_reference back() const noexcept; - reference operator[](size_type) noexcept; - const_reference operator[](size_type) const noexcept; - iterator nth(size_type) noexcept; - const_iterator nth(size_type) const noexcept; - size_type index_of(iterator) noexcept; - size_type index_of(const_iterator) const noexcept; - reference at(size_type); - const_reference at(size_type) const; - T * data() noexcept; - const T * data() const noexcept; - template<class... Args> void emplace_back(Args &&...); - template<class... Args> bool stable_emplace_back(Args &&...); - template<class... Args> iterator emplace(const_iterator, Args &&...); - void push_back(const T &); - void push_back(T &&); - iterator insert(const_iterator, const T &); - iterator insert(const_iterator, T &&); - iterator insert(const_iterator, size_type, const T &); - template<typename InIt> iterator insert(const_iterator, InIt, InIt); - iterator insert(const_iterator, std::initializer_list< value_type >); - void pop_back() noexcept; - iterator erase(const_iterator); - iterator erase(const_iterator, const_iterator); - void swap(vector &) noexcept(((allocator_traits_type::propagate_on_container_swap::value||allocator_traits_type::is_always_equal::value)&&!container_detail::is_version< Allocator, 0 >::value))); - void clear() noexcept; + // public member functions + template<typename InIt> void assign(InIt, InIt last ); + void assign(std::initializer_list< T >); + template<typename FwdIt> void assign(FwdIt, FwdIt last ); + void assign(size_type, const value_type &); + allocator_type get_allocator() const noexcept; + stored_allocator_type & get_stored_allocator() noexcept; + const stored_allocator_type & get_stored_allocator() const noexcept; + iterator begin() noexcept; + const_iterator begin() const noexcept; + iterator end() noexcept; + const_iterator end() const noexcept; + reverse_iterator rbegin() noexcept; + const_reverse_iterator rbegin() const noexcept; + reverse_iterator rend() noexcept; + const_reverse_iterator rend() const noexcept; + const_iterator cbegin() const noexcept; + const_iterator cend() const noexcept; + const_reverse_iterator crbegin() const noexcept; + const_reverse_iterator crend() const noexcept; + bool empty() const noexcept; + size_type size() const noexcept; + size_type max_size() const noexcept; + void resize(size_type); + void resize(size_type, default_init_t); + void resize(size_type, const T &); + size_type capacity() const noexcept; + void reserve(size_type); + void shrink_to_fit(); + reference front() noexcept; + const_reference front() const noexcept; + reference back() noexcept; + const_reference back() const noexcept; + reference operator[](size_type) noexcept; + const_reference operator[](size_type) const noexcept; + iterator nth(size_type) noexcept; + const_iterator nth(size_type) const noexcept; + size_type index_of(iterator) noexcept; + size_type index_of(const_iterator) const noexcept; + reference at(size_type); + const_reference at(size_type) const; + T * data() noexcept; + const T * data() const noexcept; + template<class... Args> void emplace_back(Args &&...); + template<class... Args> bool stable_emplace_back(Args &&...); + template<class... Args> iterator emplace(const_iterator, Args &&...); + void push_back(const T &); + void push_back(T &&); + iterator insert(const_iterator, const T &); + iterator insert(const_iterator, T &&); + iterator insert(const_iterator, size_type, const T &); + template<typename InIt> iterator insert(const_iterator, InIt, InIt); + iterator insert(const_iterator, std::initializer_list< value_type >); + void pop_back() noexcept; + iterator erase(const_iterator); + iterator erase(const_iterator, const_iterator); + void swap(vector &) noexcept(((allocator_traits_type::propagate_on_container_swap::value||allocator_traits_type::is_always_equal::value)&&!container_detail::is_version< Allocator, 0 >::value))); + void clear() noexcept; - // friend functions - friend bool operator==(const vector &, const vector &); - friend bool operator!=(const vector &, const vector &); - friend bool operator<(const vector &, const vector &); - friend bool operator>(const vector &, const vector &); - friend bool operator<=(const vector &, const vector &); - friend bool operator>=(const vector &, const vector &); - friend void swap(vector &, vector &); + // friend functions + friend bool operator==(const vector &, const vector &); + friend bool operator!=(const vector &, const vector &); + friend bool operator<(const vector &, const vector &); + friend bool operator>(const vector &, const vector &); + friend bool operator<=(const vector &, const vector &); + friend bool operator>=(const vector &, const vector &); + friend void swap(vector &, vector &); };
    -

    Description

    +

    Description

    A vector is a sequence that supports random access to elements, constant time insertion and removal of elements at the end, and linear time insertion and removal of elements at the beginning or in the middle. The number of elements in a vector may vary dynamically; memory management is automatic.

    -

    Template Parameters

    +

    Template Parameters

    1. typename T
      @@ -159,127 +159,127 @@
    -

    +

    vector public construct/copy/destruct

    1. -
      vector() noexcept;
      +
      vector() noexcept;

      Effects: Constructs a vector taking the allocator as parameter.

      Throws: Nothing.

      Complexity: Constant.

    2. -
      explicit vector(const allocator_type & a) noexcept;
      +
      explicit vector(const allocator_type & a) noexcept;

      Effects: Constructs a vector taking the allocator as parameter.

      Throws: Nothing

      Complexity: Constant.

    3. -
      explicit vector(size_type n);
      +
      explicit vector(size_type n);

      Effects: Constructs a vector and inserts n value initialized values.

      Throws: If allocator_type's allocation throws or T's value initialization throws.

      Complexity: Linear to n.

    4. -
      vector(size_type n, default_init_t);
      +
      vector(size_type n, default_init_t);

      Effects: Constructs a vector that will use a copy of allocator a and inserts n default initialized values.

      Throws: If allocator_type's allocation throws or T's default initialization throws.

      Complexity: Linear to n.

      Note: Non-standard extension

    5. -
      explicit vector(size_type n, const allocator_type & a);
      +
      explicit vector(size_type n, const allocator_type & a);

      Effects: Constructs a vector that will use a copy of allocator a and inserts n value initialized values.

      Throws: If allocator_type's allocation throws or T's value initialization throws.

      Complexity: Linear to n.

    6. -
      vector(size_type n, default_init_t, const allocator_type & a);
      +
      vector(size_type n, default_init_t, const allocator_type & a);

      Effects: Constructs a vector that will use a copy of allocator a and inserts n default initialized values.

      Throws: If allocator_type's allocation throws or T's default initialization throws.

      Complexity: Linear to n.

      Note: Non-standard extension

    7. -
      vector(size_type n, const T & value);
      +
      vector(size_type n, const T & value);

      Effects: Constructs a vector and inserts n copies of value.

      Throws: If allocator_type's allocation throws or T's copy constructor throws.

      Complexity: Linear to n.

    8. -
      vector(size_type n, const T & value, const allocator_type & a);
      +
      vector(size_type n, const T & value, const allocator_type & a);

      Effects: Constructs a vector that will use a copy of allocator a and inserts n copies of value.

      Throws: If allocation throws or T's copy constructor throws.

      Complexity: Linear to n.

    9. -
      template<typename InIt> vector(InIt first, InIt last);
      +
      template<typename InIt> vector(InIt first, InIt last);

      Effects: Constructs a vector and inserts a copy of the range [first, last) in the vector.

      Throws: If allocator_type's allocation throws or T's constructor taking a dereferenced InIt throws.

      Complexity: Linear to the range [first, last). 

    10. template<typename InIt> 
-  vector(InIt first, InIt last, const allocator_type & a);
      + vector(InIt first, InIt last, const allocator_type & a);

      Effects: Constructs a vector that will use a copy of allocator a and inserts a copy of the range [first, last) in the vector.

      Throws: If allocator_type's allocation throws or T's constructor taking a dereferenced InIt throws.

      Complexity: Linear to the range [first, last).

    11. -
      vector(const vector & x);
      +
      vector(const vector & x);

      Effects: Copy constructs a vector.

      Postcondition: x == *this.

      Throws: If allocator_type's allocation throws or T's copy constructor throws.

      Complexity: Linear to the elements x contains.

    12. -
      vector(vector && x) noexcept;
      +
      vector(vector && x) noexcept;

      Effects: Move constructor. Moves x's resources to *this.

      Throws: Nothing

      Complexity: Constant.

    13. -
      vector(std::initializer_list< value_type > il, 
+
      vector(std::initializer_list< value_type > il, 
        const allocator_type & a = allocator_type());
      
 
      Effects: Constructs a vector that will use a copy of allocator a and inserts a copy of the range [il.begin(), il.last()) in the vector
      
 
      Throws: If T's constructor taking a dereferenced initializer_list iterator throws.
      
 
      Complexity: Linear to the range [il.begin(), il.end()).
    14. -
      vector(const vector & x, const allocator_type & a);
      defined(BOOST_CONTAINER_DOXYGEN_INVOKED)

      Effects: Copy constructs a vector using the specified allocator.

      +
      vector(const vector & x, const allocator_type & a);
      defined(BOOST_CONTAINER_DOXYGEN_INVOKED)

      Effects: Copy constructs a vector using the specified allocator.

      Postcondition: x == *this.

      Throws: If allocation throws or T's copy constructor throws.

      Complexity: Linear to the elements x contains.

    15. -
      vector(vector && x, const allocator_type & a);
      +
      vector(vector && x, const allocator_type & a);

      Effects: Move constructor using the specified allocator. Moves x's resources to *this if a == allocator_type(). Otherwise copies values from x to *this.

      Throws: If allocation or T's copy constructor throws.

      Complexity: Constant if a == x.get_allocator(), linear otherwise.

    16. -
      vector & operator=(const vector & x);
      +
      vector & operator=(const vector & x);

      Effects: Makes *this contain the same elements as x.

      Postcondition: this->size() == x.size(). *this contains a copy of each of x's elements.

      Throws: If memory allocation throws or T's copy/move constructor/assignment throws.

      Complexity: Linear to the number of elements in x.

    17. -
      vector & operator=(std::initializer_list< value_type > il);
      +
      vector & operator=(std::initializer_list< value_type > il);

      Effects: Make *this container contains elements from il.

      Complexity: Linear to the range [il.begin(), il.end()).

    18. -
      vector & operator=(vector && x) noexcept(allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value));
      +
      vector & operator=(vector && x) noexcept(allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value));

      Effects: Move assignment. All x's values are transferred to *this.

      Postcondition: x.empty(). *this contains a the elements x had before the function.

      Throws: If allocator_traits_type::propagate_on_container_move_assignment is false and (allocation throws or value_type's move constructor throws)

      Complexity: Constant if allocator_traits_type:: propagate_on_container_move_assignment is true or this->get>allocator() == x.get_allocator(). Linear otherwise.

    19. -
      ~vector();
      +
      ~vector();

      Effects: Destroys the vector. All stored values are destroyed and used memory is deallocated.

      Throws: Nothing.

      Complexity: Linear to the number of elements.

      @@ -287,224 +287,224 @@
    -

    -vector public member functions

    +

    +vector public member functions

    1. template<typename InIt> 
-  void assign(InIt first, InIt last  BOOST_CONTAINER_DOCIGN);
      + void assign(InIt first, InIt last BOOST_CONTAINER_DOCIGN);

      Effects: Assigns the the range [first, last) to *this.

      Throws: If memory allocation throws or T's copy/move constructor/assignment or T's constructor/assignment from dereferencing InpIt throws.

      Complexity: Linear to n.

    2. -
      void assign(std::initializer_list< T > il);
      +
      void assign(std::initializer_list< T > il);

      Effects: Assigns the the range [il.begin(), il.end()) to *this.

      Throws: If memory allocation throws or T's constructor from dereferencing iniializer_list iterator throws. 

    3. template<typename FwdIt> 
-  void assign(FwdIt first, FwdIt last  BOOST_CONTAINER_DOCIGN);
      + void assign(FwdIt first, FwdIt last BOOST_CONTAINER_DOCIGN);

      Effects: Assigns the the range [first, last) to *this.

      Throws: If memory allocation throws or T's copy/move constructor/assignment or T's constructor/assignment from dereferencing InpIt throws.

      Complexity: Linear to n.

    4. -
      void assign(size_type n, const value_type & val);
      +
      void assign(size_type n, const value_type & val);

      Effects: Assigns the n copies of val to *this.

      Throws: If memory allocation throws or T's copy/move constructor/assignment throws.

      Complexity: Linear to n.

    5. -
      allocator_type get_allocator() const noexcept;
      +
      allocator_type get_allocator() const noexcept;

      Effects: Returns a copy of the internal allocator.

      Throws: If allocator's copy constructor throws.

      Complexity: Constant.

    6. -
      stored_allocator_type & get_stored_allocator() noexcept;
      +
      stored_allocator_type & get_stored_allocator() noexcept;

      Effects: Returns a reference to the internal allocator.

      Throws: Nothing

      Complexity: Constant.

      Note: Non-standard extension.

    7. -
      const stored_allocator_type & get_stored_allocator() const noexcept;
      +
      const stored_allocator_type & get_stored_allocator() const noexcept;

      Effects: Returns a reference to the internal allocator.

      Throws: Nothing

      Complexity: Constant.

      Note: Non-standard extension.

    8. -
      iterator begin() noexcept;
      +
      iterator begin() noexcept;

      Effects: Returns an iterator to the first element contained in the vector.

      Throws: Nothing.

      Complexity: Constant.

    9. -
      const_iterator begin() const noexcept;
      +
      const_iterator begin() const noexcept;

      Effects: Returns a const_iterator to the first element contained in the vector.

      Throws: Nothing.

      Complexity: Constant.

    10. -
      iterator end() noexcept;
      +
      iterator end() noexcept;

      Effects: Returns an iterator to the end of the vector.

      Throws: Nothing.

      Complexity: Constant.

    11. -
      const_iterator end() const noexcept;
      +
      const_iterator end() const noexcept;

      Effects: Returns a const_iterator to the end of the vector.

      Throws: Nothing.

      Complexity: Constant.

    12. -
      reverse_iterator rbegin() noexcept;
      +
      reverse_iterator rbegin() noexcept;

      Effects: Returns a reverse_iterator pointing to the beginning of the reversed vector.

      Throws: Nothing.

      Complexity: Constant.

    13. -
      const_reverse_iterator rbegin() const noexcept;
      +
      const_reverse_iterator rbegin() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed vector.

      Throws: Nothing.

      Complexity: Constant.

    14. -
      reverse_iterator rend() noexcept;
      +
      reverse_iterator rend() noexcept;

      Effects: Returns a reverse_iterator pointing to the end of the reversed vector.

      Throws: Nothing.

      Complexity: Constant.

    15. -
      const_reverse_iterator rend() const noexcept;
      +
      const_reverse_iterator rend() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed vector.

      Throws: Nothing.

      Complexity: Constant.

    16. -
      const_iterator cbegin() const noexcept;
      +
      const_iterator cbegin() const noexcept;

      Effects: Returns a const_iterator to the first element contained in the vector.

      Throws: Nothing.

      Complexity: Constant.

    17. -
      const_iterator cend() const noexcept;
      +
      const_iterator cend() const noexcept;

      Effects: Returns a const_iterator to the end of the vector.

      Throws: Nothing.

      Complexity: Constant.

    18. -
      const_reverse_iterator crbegin() const noexcept;
      +
      const_reverse_iterator crbegin() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed vector.

      Throws: Nothing.

      Complexity: Constant.

    19. -
      const_reverse_iterator crend() const noexcept;
      +
      const_reverse_iterator crend() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed vector.

      Throws: Nothing.

      Complexity: Constant.

    20. -
      bool empty() const noexcept;
      +
      bool empty() const noexcept;

      Effects: Returns true if the vector contains no elements.

      Throws: Nothing.

      Complexity: Constant.

    21. -
      size_type size() const noexcept;
      +
      size_type size() const noexcept;

      Effects: Returns the number of the elements contained in the vector.

      Throws: Nothing.

      Complexity: Constant.

    22. -
      size_type max_size() const noexcept;
      +
      size_type max_size() const noexcept;

      Effects: Returns the largest possible size of the vector.

      Throws: Nothing.

      Complexity: Constant.

    23. -
      void resize(size_type new_size);
      +
      void resize(size_type new_size);

      Effects: Inserts or erases elements at the end such that the size becomes n. New elements are value initialized.

      Throws: If memory allocation throws, or T's copy/move or value initialization throws.

      Complexity: Linear to the difference between size() and new_size.

    24. -
      void resize(size_type new_size, default_init_t);
      +
      void resize(size_type new_size, default_init_t);

      Effects: Inserts or erases elements at the end such that the size becomes n. New elements are default initialized.

      Throws: If memory allocation throws, or T's copy/move or default initialization throws.

      Complexity: Linear to the difference between size() and new_size.

      Note: Non-standard extension

    25. -
      void resize(size_type new_size, const T & x);
      +
      void resize(size_type new_size, const T & x);

      Effects: Inserts or erases elements at the end such that the size becomes n. New elements are copy constructed from x.

      Throws: If memory allocation throws, or T's copy/move constructor throws.

      Complexity: Linear to the difference between size() and new_size.

    26. -
      size_type capacity() const noexcept;
      +
      size_type capacity() const noexcept;

      Effects: Number of elements for which memory has been allocated. capacity() is always greater than or equal to size().

      Throws: Nothing.

      Complexity: Constant.

    27. -
      void reserve(size_type new_cap);
      +
      void reserve(size_type new_cap);

      Effects: If n is less than or equal to capacity(), this call has no effect. Otherwise, it is a request for allocation of additional memory. If the request is successful, then capacity() is greater than or equal to n; otherwise, capacity() is unchanged. In either case, size() is unchanged.

      Throws: If memory allocation allocation throws or T's copy/move constructor throws.

    28. -
      void shrink_to_fit();
      +
      void shrink_to_fit();

      Effects: Tries to deallocate the excess of memory created with previous allocations. The size of the vector is unchanged

      Throws: If memory allocation throws, or T's copy/move constructor throws.

      Complexity: Linear to size().

    29. -
      reference front() noexcept;
      +
      reference front() noexcept;

      Requires: !empty()

      Effects: Returns a reference to the first element of the container.

      Throws: Nothing.

      Complexity: Constant.

    30. -
      const_reference front() const noexcept;
      +
      const_reference front() const noexcept;

      Requires: !empty()

      Effects: Returns a const reference to the first element of the container.

      Throws: Nothing.

      Complexity: Constant.

    31. -
      reference back() noexcept;
      +
      reference back() noexcept;

      Requires: !empty()

      Effects: Returns a reference to the last element of the container.

      Throws: Nothing.

      Complexity: Constant.

    32. -
      const_reference back() const noexcept;
      +
      const_reference back() const noexcept;

      Requires: !empty()

      Effects: Returns a const reference to the last element of the container.

      Throws: Nothing.

      Complexity: Constant.

    33. -
      reference operator[](size_type n) noexcept;
      +
      reference operator[](size_type n) noexcept;

      Requires: size() > n.

      Effects: Returns a reference to the nth element from the beginning of the container.

      Throws: Nothing.

      Complexity: Constant.

    34. -
      const_reference operator[](size_type n) const noexcept;
      +
      const_reference operator[](size_type n) const noexcept;

      Requires: size() > n.

      Effects: Returns a const reference to the nth element from the beginning of the container.

      Throws: Nothing.

      Complexity: Constant.

    35. -
      iterator nth(size_type n) noexcept;
      +
      iterator nth(size_type n) noexcept;

      Requires: size() >= n.

      Effects: Returns an iterator to the nth element from the beginning of the container. Returns end() if n == size().

      Throws: Nothing.

      @@ -512,7 +512,7 @@

      Note: Non-standard extension

    36. -
      const_iterator nth(size_type n) const noexcept;
      +
      const_iterator nth(size_type n) const noexcept;

      Requires: size() >= n.

      Effects: Returns a const_iterator to the nth element from the beginning of the container. Returns end() if n == size().

      Throws: Nothing.

      @@ -520,7 +520,7 @@

      Note: Non-standard extension

    37. -
      size_type index_of(iterator p) noexcept;
      +
      size_type index_of(iterator p) noexcept;

      Requires: size() >= n.

      Effects: Returns an iterator to the nth element from the beginning of the container. Returns end() if n == size().

      Throws: Nothing.

      @@ -528,7 +528,7 @@

      Note: Non-standard extension

    38. -
      size_type index_of(const_iterator p) const noexcept;
      +
      size_type index_of(const_iterator p) const noexcept;

      Requires: begin() <= p <= end().

      Effects: Returns the index of the element pointed by p and size() if p == end().

      Throws: Nothing.

      @@ -536,39 +536,39 @@

      Note: Non-standard extension

    39. -
      reference at(size_type n);
      +
      reference at(size_type n);

      Requires: size() > n.

      Effects: Returns a reference to the nth element from the beginning of the container.

      Throws: std::range_error if n >= size()

      Complexity: Constant.

    40. -
      const_reference at(size_type n) const;
      +
      const_reference at(size_type n) const;

      Requires: size() > n.

      Effects: Returns a const reference to the nth element from the beginning of the container.

      Throws: std::range_error if n >= size()

      Complexity: Constant.

    41. -
      T * data() noexcept;
      +
      T * data() noexcept;

      Returns: A pointer such that [data(),data() + size()) is a valid range. For a non-empty vector, data() == &front().

      Throws: Nothing.

      Complexity: Constant.

    42. -
      const T * data() const noexcept;
      +
      const T * data() const noexcept;

      Returns: A pointer such that [data(),data() + size()) is a valid range. For a non-empty vector, data() == &front().

      Throws: Nothing.

      Complexity: Constant.

    43. -
      template<class... Args> void emplace_back(Args &&... args);
      +
      template<class... Args> void emplace_back(Args &&... args);

      Effects: Inserts an object of type T constructed with std::forward<Args>(args)... in the end of the vector.

      Throws: If memory allocation throws or the in-place constructor throws or T's copy/move constructor throws.

      Complexity: Amortized constant time.

    44. -
      template<class... Args> bool stable_emplace_back(Args &&... args);
      +
      template<class... Args> bool stable_emplace_back(Args &&... args);

      Effects: Inserts an object of type T constructed with std::forward<Args>(args)... in the end of the vector.

      Throws: If the in-place constructor throws.

      Complexity: Constant time.

      @@ -576,40 +576,40 @@ 
    45. template<class... Args> 
-  iterator emplace(const_iterator position, Args &&... args);
      + iterator emplace(const_iterator position, Args &&... args);

      Requires: position must be a valid iterator of *this.

      Effects: Inserts an object of type T constructed with std::forward<Args>(args)... before position

      Throws: If memory allocation throws or the in-place constructor throws or T's copy/move constructor/assignment throws.

      Complexity: If position is end(), amortized constant time Linear time otherwise.

    46. -
      void push_back(const T & x);
      +
      void push_back(const T & x);

      Effects: Inserts a copy of x at the end of the vector.

      Throws: If memory allocation throws or T's copy/move constructor throws.

      Complexity: Amortized constant time.

    47. -
      void push_back(T && x);
      +
      void push_back(T && x);

      Effects: Constructs a new element in the end of the vector and moves the resources of x to this new element.

      Throws: If memory allocation throws or T's copy/move constructor throws.

      Complexity: Amortized constant time.

    48. -
      iterator insert(const_iterator position, const T & x);
      +
      iterator insert(const_iterator position, const T & x);

      Requires: position must be a valid iterator of *this.

      Effects: Insert a copy of x before position.

      Throws: If memory allocation throws or T's copy/move constructor/assignment throws.

      Complexity: If position is end(), amortized constant time Linear time otherwise.

    49. -
      iterator insert(const_iterator position, T && x);
      +
      iterator insert(const_iterator position, T && x);

      Requires: position must be a valid iterator of *this.

      Effects: Insert a new element before position with x's resources.

      Throws: If memory allocation throws.

      Complexity: If position is end(), amortized constant time Linear time otherwise.

    50. -
      iterator insert(const_iterator p, size_type n, const T & x);
      +
      iterator insert(const_iterator p, size_type n, const T & x);

      Requires: p must be a valid iterator of *this.

      Effects: Insert n copies of x before pos.

      Returns: an iterator to the first inserted element or p if n is 0.

      @@ -618,7 +618,7 @@ 
    51. template<typename InIt> 
-  iterator insert(const_iterator pos, InIt first, InIt last);
      + iterator insert(const_iterator pos, InIt first, InIt last);

      Requires: p must be a valid iterator of *this.

      Effects: Insert a copy of the [first, last) range before pos.

      Returns: an iterator to the first inserted element or pos if first == last.

      @@ -626,7 +626,7 @@

      Complexity: Linear to boost::container::iterator_distance [first, last).

    52. -
      iterator insert(const_iterator position, 
+
      iterator insert(const_iterator position, 
                 std::initializer_list< value_type > il);
      
 
      Requires: p must be a valid iterator of *this. num, must be equal to boost::container::iterator_distance(first, last)
      
 
      Effects: Insert a copy of the [first, last) range before pos.
      
@@ -639,31 +639,31 @@
 
      Complexity: Linear to the range [il.begin(), il.end()).
    53. -
      void pop_back() noexcept;
      -

      Effects: Removes the last element from the vector.

      +
      void pop_back() noexcept;
      +

      Effects: Removes the last element from the container.

      Throws: Nothing.

      Complexity: Constant time.

    54. -
      iterator erase(const_iterator position);
      +
      iterator erase(const_iterator position);

      Effects: Erases the element at position pos.

      Throws: Nothing.

      Complexity: Linear to the elements between pos and the last element. Constant if pos is the last element.

    55. -
      iterator erase(const_iterator first, const_iterator last);
      +
      iterator erase(const_iterator first, const_iterator last);

      Effects: Erases the elements pointed by [first, last).

      Throws: Nothing.

      Complexity: Linear to the distance between first and last plus linear to the elements between pos and the last element.

    56. -
      void swap(vector & x) noexcept(((allocator_traits_type::propagate_on_container_swap::value||allocator_traits_type::is_always_equal::value)&&!container_detail::is_version< Allocator, 0 >::value)));
      +
      void swap(vector & x) noexcept(((allocator_traits_type::propagate_on_container_swap::value||allocator_traits_type::is_always_equal::value)&&!container_detail::is_version< Allocator, 0 >::value)));

      Effects: Swaps the contents of *this and x.

      Throws: Nothing.

      Complexity: Constant.

    57. -
      void clear() noexcept;
      +
      void clear() noexcept;

      Effects: Erases all the elements of the vector.

      Throws: Nothing.

      Complexity: Linear to the number of elements in the container.

      @@ -671,41 +671,41 @@
    -

    -vector friend functions

    +

    +vector friend functions

    1. -
      friend bool operator==(const vector & x, const vector & y);
      +
      friend bool operator==(const vector & x, const vector & y);

      Effects: Returns true if x and y are equal

      Complexity: Linear to the number of elements in the container.

    2. -
      friend bool operator!=(const vector & x, const vector & y);
      +
      friend bool operator!=(const vector & x, const vector & y);

      Effects: Returns true if x and y are unequal

      Complexity: Linear to the number of elements in the container.

    3. -
      friend bool operator<(const vector & x, const vector & y);
      +
      friend bool operator<(const vector & x, const vector & y);

      Effects: Returns true if x is less than y

      Complexity: Linear to the number of elements in the container.

    4. -
      friend bool operator>(const vector & x, const vector & y);
      +
      friend bool operator>(const vector & x, const vector & y);

      Effects: Returns true if x is greater than y

      Complexity: Linear to the number of elements in the container.

    5. -
      friend bool operator<=(const vector & x, const vector & y);
      +
      friend bool operator<=(const vector & x, const vector & y);

      Effects: Returns true if x is equal or less than y

      Complexity: Linear to the number of elements in the container.

    6. -
      friend bool operator>=(const vector & x, const vector & y);
      +
      friend bool operator>=(const vector & x, const vector & y);

      Effects: Returns true if x is equal or greater than y

      Complexity: Linear to the number of elements in the container.

    7. -
      friend void swap(vector & x, vector & y);
      +
      friend void swap(vector & x, vector & y);

      Effects: x.swap(y)

      Complexity: Constant.

      8. @@ -715,7 +715,7 @@
    -
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -723,7 +723,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/container/wstring.html b/doc/html/boost/container/wstring.html index a031153fbc..01b1287ef1 100644 --- a/doc/html/boost/container/wstring.html +++ b/doc/html/boost/container/wstring.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -35,13 +35,13 @@ typedef basic_string< wchar_t,std::char_traits< wchar_t >,new_allocator< wchar_t > > wstring;
    -

    Description

    +

    Description

    Typedef for a basic_string of narrow characters

    -
    Copyright © 2009-2013 Ion Gaztanaga

    +

    Copyright © 2009-2015 Ion Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -49,7 +49,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/copy_or_move.html b/doc/html/boost/copy_or_move.html index f55175c029..0348a9c5c3 100644 --- a/doc/html/boost/copy_or_move.html +++ b/doc/html/boost/copy_or_move.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -35,7 +35,7 @@ template<typename I, typename F> F copy_or_move(I f, I l, F r);
    -

    Description

    +

    Description

    Effects: 

    for (; first != last; ++result, ++first)
    *result = *first;
@@ -54,7 +54,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/date_time/acst_dst_trait.html b/doc/html/boost/date_time/acst_dst_trait.html index 5ca4e77a68..7f64b8456d 100644 --- a/doc/html/boost/date_time/acst_dst_trait.html +++ b/doc/html/boost/date_time/acst_dst_trait.html @@ -41,32 +41,32 @@ typedef date_time::last_kday_of_month< date_type > start_rule_functor; typedef date_time::last_kday_of_month< date_type > end_rule_functor; - // public static functions - static day_of_week_type start_day(year_type); - static month_type start_month(year_type); - static day_of_week_type end_day(year_type); - static month_type end_month(year_type); - static int dst_start_offset_minutes(); - static int dst_end_offset_minutes(); - static int dst_shift_length_minutes(); - static date_type local_dst_start_day(year_type); - static date_type local_dst_end_day(year_type); + // public static functions + static day_of_week_type start_day(year_type); + static month_type start_month(year_type); + static day_of_week_type end_day(year_type); + static month_type end_month(year_type); + static int dst_start_offset_minutes(); + static int dst_end_offset_minutes(); + static int dst_shift_length_minutes(); + static date_type local_dst_start_day(year_type); + static date_type local_dst_end_day(year_type); };
    -

    Description

    +

    Description

    -

    -acst_dst_trait public static functions

    +

    +acst_dst_trait public static functions

      -
    1. static day_of_week_type start_day(year_type);
      2. -
    2. static month_type start_month(year_type);
      3. -
    3. static day_of_week_type end_day(year_type);
      4. -
    4. static month_type end_month(year_type);
      5. -
    5. static int dst_start_offset_minutes();
      6. -
    6. static int dst_end_offset_minutes();
      7. -
    7. static int dst_shift_length_minutes();
      8. -
    8. static date_type local_dst_start_day(year_type year);
      9. -
    9. static date_type local_dst_end_day(year_type year);
      10. +
    10. static day_of_week_type start_day(year_type);
      11. +
    11. static month_type start_month(year_type);
      12. +
    12. static day_of_week_type end_day(year_type);
      13. +
    13. static month_type end_month(year_type);
      14. +
    14. static int dst_start_offset_minutes();
      15. +
    15. static int dst_end_offset_minutes();
      16. +
    16. static int dst_shift_length_minutes();
      17. +
    17. static date_type local_dst_start_day(year_type year);
      18. +
    18. static date_type local_dst_end_day(year_type year);
    diff --git a/doc/html/boost/date_time/all_date_names_put.html b/doc/html/boost/date_time/all_date_names_put.html index b953dae335..ea2fc8f3fa 100644 --- a/doc/html/boost/date_time/all_date_names_put.html +++ b/doc/html/boost/date_time/all_date_names_put.html @@ -45,38 +45,38 @@ typedef Config::special_value_enum special_value_enum; // construct/copy/destruct - all_date_names_put(const charT *const, const charT *const, + all_date_names_put(const charT *const, const charT *const, const charT *const, const charT *const, const charT *const, charT = '-', ymd_order_spec = ymd_order_iso, month_format_spec = month_as_short_string); - // public member functions - const charT *const * get_short_month_names() const; - const charT *const * get_long_month_names() const; - const charT *const * get_special_value_names() const; - const charT *const * get_short_weekday_names() const; - const charT *const * get_long_weekday_names() const; + // public member functions + const charT *const * get_short_month_names() const; + const charT *const * get_long_month_names() const; + const charT *const * get_special_value_names() const; + const charT *const * get_short_weekday_names() const; + const charT *const * get_long_weekday_names() const; - // protected member functions - virtual void do_put_month_short(iter_type &, month_enum) const; - virtual void do_put_month_long(iter_type &, month_enum) const; - virtual void do_put_special_value(iter_type &, special_value_enum) const; - virtual void do_put_weekday_short(iter_type &, weekday_enum) const; - virtual void do_put_weekday_long(iter_type &, weekday_enum) const; - virtual void do_month_sep_char(iter_type &) const; - virtual void do_day_sep_char(iter_type &) const; - virtual ymd_order_spec do_date_order() const; - virtual month_format_spec do_month_format() const; + // protected member functions + virtual void do_put_month_short(iter_type &, month_enum) const; + virtual void do_put_month_long(iter_type &, month_enum) const; + virtual void do_put_special_value(iter_type &, special_value_enum) const; + virtual void do_put_weekday_short(iter_type &, weekday_enum) const; + virtual void do_put_weekday_long(iter_type &, weekday_enum) const; + virtual void do_month_sep_char(iter_type &) const; + virtual void do_day_sep_char(iter_type &) const; + virtual ymd_order_spec do_date_order() const; + virtual month_format_spec do_month_format() const; };
    -

    Description

    +

    Description

    -

    +

    all_date_names_put public construct/copy/destruct

    -
    1. all_date_names_put(const charT *const month_short_names, 
+
      1. all_date_names_put(const charT *const month_short_names, 
                    const charT *const month_long_names, 
                    const charT *const special_value_names, 
                    const charT *const weekday_short_names, 
@@ -86,37 +86,37 @@
                    month_format_spec month_format = month_as_short_string);
    -

    -all_date_names_put public member functions

    +

    +all_date_names_put public member functions

      -
    1. const charT *const * get_short_month_names() const;
      2. -
    2. const charT *const * get_long_month_names() const;
      3. -
    3. const charT *const * get_special_value_names() const;
      4. -
    4. const charT *const * get_short_weekday_names() const;
      5. -
    5. const charT *const * get_long_weekday_names() const;
      6. +
    6. const charT *const * get_short_month_names() const;
      7. +
    7. const charT *const * get_long_month_names() const;
      8. +
    8. const charT *const * get_special_value_names() const;
      9. +
    9. const charT *const * get_short_weekday_names() const;
      10. +
    10. const charT *const * get_long_weekday_names() const;
    -

    -all_date_names_put protected member functions

    +

    +all_date_names_put protected member functions

    1. -
      virtual void do_put_month_short(iter_type & oitr, month_enum moy) const;
      Generic facet that takes array of chars.
      2. +
      virtual void do_put_month_short(iter_type & oitr, month_enum moy) const;
      Generic facet that takes array of chars.
    2. -
      virtual void do_put_month_long(iter_type & oitr, month_enum moy) const;
      Long month names.
      3. +
      virtual void do_put_month_long(iter_type & oitr, month_enum moy) const;
      Long month names. 
    3. virtual void 
-do_put_special_value(iter_type & oitr, special_value_enum sv) const;
      Special values names.
      4. -
    4. virtual void do_put_weekday_short(iter_type & oitr, weekday_enum wd) const;
      5. -
    5. virtual void do_put_weekday_long(iter_type & oitr, weekday_enum wd) const;
      6. +do_put_special_value(iter_type & oitr, special_value_enum sv) const;Special values names. +
    6. virtual void do_put_weekday_short(iter_type & oitr, weekday_enum wd) const;
      7. +
    7. virtual void do_put_weekday_long(iter_type & oitr, weekday_enum wd) const;
    8. -
      virtual void do_month_sep_char(iter_type & oitr) const;
      char between year-month
      9. +
      virtual void do_month_sep_char(iter_type & oitr) const;
      char between year-month
    9. -
      virtual void do_day_sep_char(iter_type & oitr) const;
      Char to separate month-day.
      10. +
      virtual void do_day_sep_char(iter_type & oitr) const;
      Char to separate month-day.
    10. -
      virtual ymd_order_spec do_date_order() const;
      Set the date ordering.
      11. +
      virtual ymd_order_spec do_date_order() const;
      Set the date ordering.
    11. -
      virtual month_format_spec do_month_format() const;
      Set the date ordering.
      12. +
      virtual month_format_spec do_month_format() const;
      Set the date ordering.
    diff --git a/doc/html/boost/date_time/bad_field_count.html b/doc/html/boost/date_time/bad_field_count.html index 2162b9b5dd..979714d18a 100644 --- a/doc/html/boost/date_time/bad_field_count.html +++ b/doc/html/boost/date_time/bad_field_count.html @@ -36,16 +36,16 @@ class bad_field_count : public out_of_range { public: // construct/copy/destruct - bad_field_count(const std::string &); + bad_field_count(const std::string &); };
    -

    Description

    +

    Description

    -

    +

    bad_field_count public construct/copy/destruct

    -
    1. bad_field_count(const std::string & s);
    +
    1. bad_field_count(const std::string & s);
    diff --git a/doc/html/boost/date_time/base_time.html b/doc/html/boost/date_time/base_time.html index 08f7bc4268..f76ed9f0a6 100644 --- a/doc/html/boost/date_time/base_time.html +++ b/doc/html/boost/date_time/base_time.html @@ -38,7 +38,7 @@ { public: // types - typedef void _is_boost_date_time_time_point; + typedef void _is_boost_date_time_time_point; typedef T time_type; typedef time_system::time_rep_type time_rep_type; typedef time_system::date_type date_type; @@ -46,94 +46,94 @@ typedef time_system::time_duration_type time_duration_type; // construct/copy/destruct - base_time(const date_type &, const time_duration_type &, + base_time(const date_type &, const time_duration_type &, dst_flags = not_dst); - base_time(special_values); - base_time(const time_rep_type &); + base_time(special_values); + base_time(const time_rep_type &); - // public member functions - date_type date() const; - time_duration_type time_of_day() const; - std::string zone_name(bool = false) const; - std::string zone_abbrev(bool = false) const; - std::string zone_as_posix_string() const; - bool is_not_a_date_time() const; - bool is_infinity() const; - bool is_pos_infinity() const; - bool is_neg_infinity() const; - bool is_special() const; - bool operator==(const time_type &) const; - bool operator<(const time_type &) const; - time_duration_type operator-(const time_type &) const; - time_type operator+(const date_duration_type &) const; - time_type operator+=(const date_duration_type &); - time_type operator-(const date_duration_type &) const; - time_type operator-=(const date_duration_type &); - time_type operator+(const time_duration_type &) const; - time_type operator+=(const time_duration_type &); - time_type operator-(const time_duration_type &) const; - time_type operator-=(const time_duration_type &); + // public member functions + date_type date() const; + time_duration_type time_of_day() const; + std::string zone_name(bool = false) const; + std::string zone_abbrev(bool = false) const; + std::string zone_as_posix_string() const; + bool is_not_a_date_time() const; + bool is_infinity() const; + bool is_pos_infinity() const; + bool is_neg_infinity() const; + bool is_special() const; + bool operator==(const time_type &) const; + bool operator<(const time_type &) const; + time_duration_type operator-(const time_type &) const; + time_type operator+(const date_duration_type &) const; + time_type operator+=(const date_duration_type &); + time_type operator-(const date_duration_type &) const; + time_type operator-=(const date_duration_type &); + time_type operator+(const time_duration_type &) const; + time_type operator+=(const time_duration_type &); + time_type operator-(const time_duration_type &) const; + time_type operator-=(const time_duration_type &); };
    -

    Description

    +

    Description

    This class is a skeleton for the interface of a temporal type with a resolution that is higher than a day. It is intended that this class be the base class and that the actual time class be derived using the BN pattern. In this way, the derived class can make decisions such as 'should there be a default constructor' and what should it set its value to, should there be optional constructors say allowing only an time_durations that generate a time from a clock,etc. So, in fact multiple time types can be created for a time_system with different construction policies, and all of them can perform basic operations by only writing a copy constructor. Finally, compiler errors are also shorter.

    The real behavior of the time class is provided by the time_system template parameter. This class must provide all the logic for addition, subtraction, as well as define all the interface types.

    -

    +

    base_time public construct/copy/destruct

      -
    1. base_time(const date_type & day, const time_duration_type & td, 
+
    2. base_time(const date_type & day, const time_duration_type & td, 
           dst_flags dst = not_dst);
      3. 
-
    3. base_time(special_values sv);
      4. 
-
    4. base_time(const time_rep_type & rhs);
      5. 
+
    5. base_time(special_values sv);
      6. 
+
    6. base_time(const time_rep_type & rhs);
      7.
    -

    -base_time public member functions

    +

    +base_time public member functions

      -
    1. date_type date() const;
      2. -
    2. time_duration_type time_of_day() const;
      3. +
    3. date_type date() const;
      4. +
    4. time_duration_type time_of_day() const;
    5. -
      std::string zone_name(bool = false) const;
      +
      std::string zone_name(bool = false) const;

      Optional bool parameter will return time zone as an offset (ie "+07:00"). Empty string is returned for classes that do not use a time_zone

    6. -
      std::string zone_abbrev(bool = false) const;
      +
      std::string zone_abbrev(bool = false) const;

      Optional bool parameter will return time zone as an offset (ie "+07:00"). Empty string is returned for classes that do not use a time_zone

    7. -
      std::string zone_as_posix_string() const;
      An empty string is returned for classes that do not use a time_zone.
      8. +
      std::string zone_as_posix_string() const;
      An empty string is returned for classes that do not use a time_zone.
    8. -
      bool is_not_a_date_time() const;
      check to see if date is not a value
      9. +
      bool is_not_a_date_time() const;
      check to see if date is not a value
    9. -
      bool is_infinity() const;
      check to see if date is one of the infinity values
      10. +
      bool is_infinity() const;
      check to see if date is one of the infinity values
    10. -
      bool is_pos_infinity() const;
      check to see if date is greater than all possible dates
      11. +
      bool is_pos_infinity() const;
      check to see if date is greater than all possible dates
    11. -
      bool is_neg_infinity() const;
      check to see if date is greater than all possible dates
      12. +
      bool is_neg_infinity() const;
      check to see if date is greater than all possible dates
    12. -
      bool is_special() const;
      check to see if time is a special value
      13. +
      bool is_special() const;
      check to see if time is a special value
    13. -
      bool operator==(const time_type & rhs) const;
      Equality operator <ndash></ndash> others generated by boost::equality_comparable.
      14. +
      bool operator==(const time_type & rhs) const;
      Equality operator <ndash></ndash> others generated by boost::equality_comparable.
    14. -
      bool operator<(const time_type & rhs) const;
      Equality operator <ndash></ndash> others generated by boost::less_than_comparable.
      15. +
      bool operator<(const time_type & rhs) const;
      Equality operator <ndash></ndash> others generated by boost::less_than_comparable.
    15. -
      time_duration_type operator-(const time_type & rhs) const;
      difference between two times
      16. +
      time_duration_type operator-(const time_type & rhs) const;
      difference between two times
    16. -
      time_type operator+(const date_duration_type & dd) const;
      add date durations
      17. -
    17. time_type operator+=(const date_duration_type & dd);
      18. +
      time_type operator+(const date_duration_type & dd) const;
      add date durations +
    18. time_type operator+=(const date_duration_type & dd);
    19. -
      time_type operator-(const date_duration_type & dd) const;
      subtract date durations
      20. -
    20. time_type operator-=(const date_duration_type & dd);
      21. +
      time_type operator-(const date_duration_type & dd) const;
      subtract date durations +
    21. time_type operator-=(const date_duration_type & dd);
    22. -
      time_type operator+(const time_duration_type & td) const;
      add time durations
      23. -
    23. time_type operator+=(const time_duration_type & td);
      24. +
      time_type operator+(const time_duration_type & td) const;
      add time durations +
    24. time_type operator+=(const time_duration_type & td);
    25. -
      time_type operator-(const time_duration_type & rhs) const;
      subtract time durations
      26. -
    26. time_type operator-=(const time_duration_type & td);
      27. +
      time_type operator-(const time_duration_type & rhs) const;
      subtract time durations +
    27. time_type operator-=(const time_duration_type & td);
    diff --git a/doc/html/boost/date_time/c_local_adjustor.html b/doc/html/boost/date_time/c_local_adjustor.html index 0767e4613f..79f70f813e 100644 --- a/doc/html/boost/date_time/c_local_adjustor.html +++ b/doc/html/boost/date_time/c_local_adjustor.html @@ -40,17 +40,17 @@ typedef time_type::date_type date_type; typedef date_type::duration_type date_duration_type; - // public static functions - static time_type utc_to_local(const time_type &); + // public static functions + static time_type utc_to_local(const time_type &); };
    -

    Description

    +

    Description

    Warning!!! This class assumes that timezone settings of the machine are correct. This can be a very dangerous assumption.

    -

    -c_local_adjustor public static functions

    +

    +c_local_adjustor public static functions

    1. -
      static time_type utc_to_local(const time_type & t);
      Convert a utc time to local time.
    +
    static time_type utc_to_local(const time_type & t);
    Convert a utc time to local time.
    diff --git a/doc/html/boost/date_time/c_time.html b/doc/html/boost/date_time/c_time.html index 445a1ecdc0..5d5a003655 100644 --- a/doc/html/boost/date_time/c_time.html +++ b/doc/html/boost/date_time/c_time.html @@ -35,27 +35,27 @@ struct c_time { - // public static functions - static std::tm * localtime(const std::time_t *, std::tm *); - static std::tm * gmtime(const std::time_t *, std::tm *); - static std::tm * localtime(const std::time_t *, std::tm *); - static std::tm * gmtime(const std::time_t *, std::tm *); + // public static functions + static std::tm * localtime(const std::time_t *, std::tm *); + static std::tm * gmtime(const std::time_t *, std::tm *); + static std::tm * localtime(const std::time_t *, std::tm *); + static std::tm * gmtime(const std::time_t *, std::tm *); };
    -

    Description

    +

    Description

    Provides a uniform interface to some ctime functions and their '_r' counterparts. The '_r' functions require a pointer to a user created std::tm struct whereas the regular functions use a staticly created struct and return a pointer to that. These wrapper functions require the user to create a std::tm struct and send in a pointer to it. This struct may be used to store the resulting time. The returned pointer may or may not point to this struct, however, it will point to the result of the corresponding function. All functions do proper checking of the C function results and throw exceptions on error. Therefore the functions will never return NULL.

    -

    -c_time public static functions

    +

    +c_time public static functions

    1. -
      static std::tm * localtime(const std::time_t * t, std::tm * result);
      requires a pointer to a user created std::tm struct
      2. +
      static std::tm * localtime(const std::time_t * t, std::tm * result);
      requires a pointer to a user created std::tm struct
    2. -
      static std::tm * gmtime(const std::time_t * t, std::tm * result);
      requires a pointer to a user created std::tm struct
      3. +
      static std::tm * gmtime(const std::time_t * t, std::tm * result);
      requires a pointer to a user created std::tm struct
    3. -
      static std::tm * localtime(const std::time_t * t, std::tm * result);
      requires a pointer to a user created std::tm struct
      4. +
      static std::tm * localtime(const std::time_t * t, std::tm * result);
      requires a pointer to a user created std::tm struct
    4. -
      static std::tm * gmtime(const std::time_t * t, std::tm * result);
      requires a pointer to a user created std::tm struct
      5. +
      static std::tm * gmtime(const std::time_t * t, std::tm * result);
      requires a pointer to a user created std::tm struct
    diff --git a/doc/html/boost/date_time/convert_string_type.html b/doc/html/boost/date_time/convert_string_type.html index cfbd57cf04..d3382254c6 100644 --- a/doc/html/boost/date_time/convert_string_type.html +++ b/doc/html/boost/date_time/convert_string_type.html @@ -37,7 +37,7 @@ std::basic_string< OutputT > convert_string_type(const std::basic_string< InputT > & inp_str);
    -

    Description

    +

    Description

    Converts a wstring to a string (or a string to wstring). If both template parameters are of same type, a copy of the input string is returned.

    diff --git a/doc/html/boost/date_time/convert_to_lower.html b/doc/html/boost/date_time/convert_to_lower.html index 6722d87fb4..e3f5063a24 100644 --- a/doc/html/boost/date_time/convert_to_lower.html +++ b/doc/html/boost/date_time/convert_to_lower.html @@ -35,7 +35,7 @@ std::string convert_to_lower(std::string inp);
    -

    Description

    +

    Description

    This function simply takes a string, and changes all the characters in that string to lowercase (according to the default system locale). In the event that a compiler does not support locales, the old C style tolower() is used.

    diff --git a/doc/html/boost/date_time/counted_time_rep.html b/doc/html/boost/date_time/counted_time_rep.html index a88614ea08..6b174c1001 100644 --- a/doc/html/boost/date_time/counted_time_rep.html +++ b/doc/html/boost/date_time/counted_time_rep.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -45,56 +45,56 @@ typedef config::resolution_traits resolution_traits; // construct/copy/destruct - counted_time_rep(const date_type &, const time_duration_type &); - explicit counted_time_rep(int_type); - explicit counted_time_rep(impl_type); + counted_time_rep(const date_type &, const time_duration_type &); + explicit counted_time_rep(int_type); + explicit counted_time_rep(impl_type); - // public member functions - date_type date() const; - unsigned long day_count() const; - int_type time_count() const; - int_type tod() const; - bool is_pos_infinity() const; - bool is_neg_infinity() const; - bool is_not_a_date_time() const; - bool is_special() const; - impl_type get_rep() const; + // public member functions + date_type date() const; + unsigned long day_count() const; + int_type time_count() const; + int_type tod() const; + bool is_pos_infinity() const; + bool is_neg_infinity() const; + bool is_not_a_date_time() const; + bool is_special() const; + impl_type get_rep() const; - // public static functions - static int_type frac_sec_per_day(); + // public static functions + static int_type frac_sec_per_day(); };
    -

    Description

    +

    Description

    -

    +

    counted_time_rep public construct/copy/destruct

      -
    1. counted_time_rep(const date_type & d, const time_duration_type & time_of_day);
      2. -
    2. explicit counted_time_rep(int_type count);
      3. -
    3. explicit counted_time_rep(impl_type count);
      4. +
    4. counted_time_rep(const date_type & d, const time_duration_type & time_of_day);
      5. +
    5. explicit counted_time_rep(int_type count);
      6. +
    6. explicit counted_time_rep(impl_type count);
    -

    -counted_time_rep public member functions

    +

    +counted_time_rep public member functions

      -
    1. date_type date() const;
      2. -
    2. unsigned long day_count() const;
      3. -
    3. int_type time_count() const;
      4. -
    4. int_type tod() const;
      5. -
    5. bool is_pos_infinity() const;
      6. -
    6. bool is_neg_infinity() const;
      7. -
    7. bool is_not_a_date_time() const;
      8. -
    8. bool is_special() const;
      9. -
    9. impl_type get_rep() const;
      10. +
    10. date_type date() const;
      11. +
    11. unsigned long day_count() const;
      12. +
    12. int_type time_count() const;
      13. +
    13. int_type tod() const;
      14. +
    14. bool is_pos_infinity() const;
      15. +
    15. bool is_neg_infinity() const;
      16. +
    16. bool is_not_a_date_time() const;
      17. +
    17. bool is_special() const;
      18. +
    18. impl_type get_rep() const;
    -

    -counted_time_rep public static functions

    -
    1. static int_type frac_sec_per_day();
    +

    +counted_time_rep public static functions

    +
    1. static int_type frac_sec_per_day();
    @@ -106,7 +106,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/date_time/counted_time_system.html b/doc/html/boost/date_time/counted_time_system.html index 3c318a3704..9905131e15 100644 --- a/doc/html/boost/date_time/counted_time_system.html +++ b/doc/html/boost/date_time/counted_time_system.html @@ -43,55 +43,55 @@ typedef time_rep_type::date_type date_type; typedef time_rep_type::date_duration_type date_duration_type; - // public static functions - template<typename T> static void unused_var(const T &); + // public static functions + template<typename T> static void unused_var(const T &); static time_rep_type - get_time_rep(const date_type &, const time_duration_type &, + get_time_rep(const date_type &, const time_duration_type &, date_time::dst_flags = not_dst); - static time_rep_type get_time_rep(special_values); - static date_type get_date(const time_rep_type &); - static time_duration_type get_time_of_day(const time_rep_type &); - static std::string zone_name(const time_rep_type &); - static bool is_equal(const time_rep_type &, const time_rep_type &); - static bool is_less(const time_rep_type &, const time_rep_type &); + static time_rep_type get_time_rep(special_values); + static date_type get_date(const time_rep_type &); + static time_duration_type get_time_of_day(const time_rep_type &); + static std::string zone_name(const time_rep_type &); + static bool is_equal(const time_rep_type &, const time_rep_type &); + static bool is_less(const time_rep_type &, const time_rep_type &); static time_rep_type - add_days(const time_rep_type &, const date_duration_type &); + add_days(const time_rep_type &, const date_duration_type &); static time_rep_type - subtract_days(const time_rep_type &, const date_duration_type &); + subtract_days(const time_rep_type &, const date_duration_type &); static time_rep_type - subtract_time_duration(const time_rep_type &, const time_duration_type &); + subtract_time_duration(const time_rep_type &, const time_duration_type &); static time_rep_type - add_time_duration(const time_rep_type &, time_duration_type); + add_time_duration(const time_rep_type &, time_duration_type); static time_duration_type - subtract_times(const time_rep_type &, const time_rep_type &); + subtract_times(const time_rep_type &, const time_rep_type &); };
    -

    Description

    +

    Description

    -

    -counted_time_system public static functions

    +

    +counted_time_system public static functions

      -
    1. template<typename T> static void unused_var(const T &);
      2. +
    2. template<typename T> static void unused_var(const T &);
    3. static time_rep_type 
-get_time_rep(const date_type & day, const time_duration_type & tod, 
+get_time_rep(const date_type & day, const time_duration_type & tod, 
              date_time::dst_flags dst = not_dst);
      4. -
    4. static time_rep_type get_time_rep(special_values sv);
      5. -
    5. static date_type get_date(const time_rep_type & val);
      6. -
    6. static time_duration_type get_time_of_day(const time_rep_type & val);
      7. -
    7. static std::string zone_name(const time_rep_type &);
      8. -
    8. static bool is_equal(const time_rep_type & lhs, const time_rep_type & rhs);
      9. -
    9. static bool is_less(const time_rep_type & lhs, const time_rep_type & rhs);
      10. +
    10. static time_rep_type get_time_rep(special_values sv);
      11. +
    11. static date_type get_date(const time_rep_type & val);
      12. +
    12. static time_duration_type get_time_of_day(const time_rep_type & val);
      13. +
    13. static std::string zone_name(const time_rep_type &);
      14. +
    14. static bool is_equal(const time_rep_type & lhs, const time_rep_type & rhs);
      15. +
    15. static bool is_less(const time_rep_type & lhs, const time_rep_type & rhs);
    16. static time_rep_type 
-add_days(const time_rep_type & base, const date_duration_type & dd);
      17. +add_days(const time_rep_type & base, const date_duration_type & dd); 
    17. static time_rep_type 
-subtract_days(const time_rep_type & base, const date_duration_type & dd);
      18. +subtract_days(const time_rep_type & base, const date_duration_type & dd); 
    18. static time_rep_type 
-subtract_time_duration(const time_rep_type & base, 
+subtract_time_duration(const time_rep_type & base, 
                        const time_duration_type & td);
    19. static time_rep_type 
-add_time_duration(const time_rep_type & base, time_duration_type td);
      20. +add_time_duration(const time_rep_type & base, time_duration_type td); 
    20. static time_duration_type 
-subtract_times(const time_rep_type & lhs, const time_rep_type & rhs);
      21. +subtract_times(const time_rep_type & lhs, const time_rep_type & rhs);
    diff --git a/doc/html/boost/date_time/data_not_accessible.html b/doc/html/boost/date_time/data_not_accessible.html index 5f66885398..5fba71c089 100644 --- a/doc/html/boost/date_time/data_not_accessible.html +++ b/doc/html/boost/date_time/data_not_accessible.html @@ -36,19 +36,19 @@ class data_not_accessible : public logic_error { public: // construct/copy/destruct - data_not_accessible(); - data_not_accessible(const std::string &); + data_not_accessible(); + data_not_accessible(const std::string &); };
    -

    Description

    +

    Description

    -

    +

    data_not_accessible public construct/copy/destruct

      -
    1. data_not_accessible();
      2. -
    2. data_not_accessible(const std::string & filespec);
      3. +
    3. data_not_accessible();
      4. +
    4. data_not_accessible(const std::string & filespec);
    diff --git a/doc/html/boost/date_time/date.html b/doc/html/boost/date_time/date.html index d2045f4eff..e7914699fc 100644 --- a/doc/html/boost/date_time/date.html +++ b/doc/html/boost/date_time/date.html @@ -51,82 +51,82 @@ typedef calendar::day_of_week_type day_of_week_type; // construct/copy/destruct - date(year_type, month_type, day_type); - date(const ymd_type &); - explicit date(date_int_type); - explicit date(date_rep_type); + date(year_type, month_type, day_type); + date(const ymd_type &); + explicit date(date_int_type); + explicit date(date_rep_type); - // public member functions - year_type year() const; - month_type month() const; - day_type day() const; - day_of_week_type day_of_week() const; - ymd_type year_month_day() const; - bool operator<(const date_type &) const; - bool operator==(const date_type &) const; - bool is_special() const; - bool is_not_a_date() const; - bool is_infinity() const; - bool is_pos_infinity() const; - bool is_neg_infinity() const; - special_values as_special() const; - duration_type operator-(const date_type &) const; - date_type operator-(const duration_type &) const; - date_type operator-=(const duration_type &); - date_rep_type day_count() const; - date_type operator+(const duration_type &) const; - date_type operator+=(const duration_type &); + // public member functions + year_type year() const; + month_type month() const; + day_type day() const; + day_of_week_type day_of_week() const; + ymd_type year_month_day() const; + bool operator<(const date_type &) const; + bool operator==(const date_type &) const; + bool is_special() const; + bool is_not_a_date() const; + bool is_infinity() const; + bool is_pos_infinity() const; + bool is_neg_infinity() const; + special_values as_special() const; + duration_type operator-(const date_type &) const; + date_type operator-(const duration_type &) const; + date_type operator-=(const duration_type &); + date_rep_type day_count() const; + date_type operator+(const duration_type &) const; + date_type operator+=(const duration_type &); };
    -

    Description

    +

    Description

    The date template represents an interface shell for a date class that is based on a year-month-day system such as the gregorian or iso systems. It provides basic operations to enable calculation and comparisons.

    Theory

    This date representation fundamentally departs from the C tm struct approach. The goal for this type is to provide efficient date operations (add, subtract) and storage (minimize space to represent) in a concrete class. Thus, the date uses a count internally to represent a particular date. The calendar parameter defines the policies for converting the the year-month-day and internal counted form here. Applications that need to perform heavy formatting of the same date repeatedly will perform better by using the year-month-day representation.

    Internally the date uses a day number to represent the date. This is a monotonic time representation. This representation allows for fast comparison as well as simplifying the creation of writing numeric operations. Essentially, the internal day number is like adjusted julian day. The adjustment is determined by the Epoch date which is represented as day 1 of the calendar. Day 0 is reserved for negative infinity so that any actual date is automatically greater than negative infinity. When a date is constructed from a date or formatted for output, the appropriate conversions are applied to create the year, month, day representations.

    -

    +

    date public construct/copy/destruct

      -
    1. date(year_type y, month_type m, day_type d);
      2. -
    2. date(const ymd_type & ymd);
      3. +
    3. date(year_type y, month_type m, day_type d);
      4. +
    4. date(const ymd_type & ymd);
    5. -
      explicit date(date_int_type days);
      +
      explicit date(date_int_type days);

      This is a private constructor which allows for the creation of new dates. It is not exposed to users since that would require class users to understand the inner workings of the date class.

      6. -
    6. explicit date(date_rep_type days);
      7. +
    7. explicit date(date_rep_type days);
    -

    -date public member functions

    +

    +date public member functions

      -
    1. year_type year() const;
      2. -
    2. month_type month() const;
      3. -
    3. day_type day() const;
      4. -
    4. day_of_week_type day_of_week() const;
      5. -
    5. ymd_type year_month_day() const;
      6. -
    6. bool operator<(const date_type & rhs) const;
      7. -
    7. bool operator==(const date_type & rhs) const;
      8. +
    8. year_type year() const;
      9. +
    9. month_type month() const;
      10. +
    10. day_type day() const;
      11. +
    11. day_of_week_type day_of_week() const;
      12. +
    12. ymd_type year_month_day() const;
      13. +
    13. bool operator<(const date_type & rhs) const;
      14. +
    14. bool operator==(const date_type & rhs) const;
    15. -
      bool is_special() const;
      check to see if date is a special value
      16. +
      bool is_special() const;
      check to see if date is a special value
    16. -
      bool is_not_a_date() const;
      check to see if date is not a value
      17. +
      bool is_not_a_date() const;
      check to see if date is not a value
    17. -
      bool is_infinity() const;
      check to see if date is one of the infinity values
      18. +
      bool is_infinity() const;
      check to see if date is one of the infinity values
    18. -
      bool is_pos_infinity() const;
      check to see if date is greater than all possible dates
      19. +
      bool is_pos_infinity() const;
      check to see if date is greater than all possible dates
    19. -
      bool is_neg_infinity() const;
      check to see if date is greater than all possible dates
      20. +
      bool is_neg_infinity() const;
      check to see if date is greater than all possible dates
    20. -
      special_values as_special() const;
      return as a special value or a not_special if a normal date
      21. -
    21. duration_type operator-(const date_type & d) const;
      22. -
    22. date_type operator-(const duration_type & dd) const;
      23. -
    23. date_type operator-=(const duration_type & dd);
      24. -
    24. date_rep_type day_count() const;
      25. -
    25. date_type operator+(const duration_type & dd) const;
      26. -
    26. date_type operator+=(const duration_type & dd);
      27. +
      special_values as_special() const;
      return as a special value or a not_special if a normal date +
    27. duration_type operator-(const date_type & d) const;
      28. +
    28. date_type operator-(const duration_type & dd) const;
      29. +
    29. date_type operator-=(const duration_type & dd);
      30. +
    30. date_rep_type day_count() const;
      31. +
    31. date_type operator+(const duration_type & dd) const;
      32. +
    32. date_type operator+=(const duration_type & dd);
    diff --git a/doc/html/boost/date_time/date_duration.html b/doc/html/boost/date_time/date_duration.html index 8ce48d7ba1..e567415c21 100644 --- a/doc/html/boost/date_time/date_duration.html +++ b/doc/html/boost/date_time/date_duration.html @@ -41,73 +41,73 @@ typedef duration_rep_traits::impl_type duration_rep; // construct/copy/destruct - explicit date_duration(duration_rep); - date_duration(special_values); - date_duration(const date_duration< duration_rep_traits > &); + explicit date_duration(duration_rep); + date_duration(special_values); + date_duration(const date_duration< duration_rep_traits > &); - // public member functions - duration_rep get_rep() const; - bool is_special() const; - duration_rep_type days() const; - bool operator==(const date_duration &) const; - bool operator<(const date_duration &) const; - date_duration & operator-=(const date_duration &); - date_duration & operator+=(const date_duration &); - date_duration operator-() const; - date_duration & operator/=(int); - bool is_negative() const; + // public member functions + duration_rep get_rep() const; + bool is_special() const; + duration_rep_type days() const; + bool operator==(const date_duration &) const; + bool operator<(const date_duration &) const; + date_duration & operator-=(const date_duration &); + date_duration & operator+=(const date_duration &); + date_duration operator-() const; + date_duration & operator/=(int); + bool is_negative() const; - // public static functions - static date_duration unit(); + // public static functions + static date_duration unit(); };
    -

    Description

    +

    Description

    -

    +

    date_duration public construct/copy/destruct

    1. -
      explicit date_duration(duration_rep day_count);
      Construct from a day count.
      2. +
      explicit date_duration(duration_rep day_count);
      Construct from a day count.
    2. -
      date_duration(special_values sv);
      +
      date_duration(special_values sv);

      construct from special_values - only works when instantiated with duration_traits_adapted

    3. -
      date_duration(const date_duration< duration_rep_traits > & other);
      Construct from another date_duration (Copy Constructor)
      4. +
      date_duration(const date_duration< duration_rep_traits > & other);
      Construct from another date_duration (Copy Constructor)
    -

    -date_duration public member functions

    +

    +date_duration public member functions

    1. -
      duration_rep get_rep() const;
      returns days_ as it's instantiated type - used for streaming
      2. -
    2. bool is_special() const;
      3. +
      duration_rep get_rep() const;
      returns days_ as it's instantiated type - used for streaming +
    3. bool is_special() const;
    4. -
      duration_rep_type days() const;
      returns days as value, not object.
      5. +
      duration_rep_type days() const;
      returns days as value, not object.
    5. -
      bool operator==(const date_duration & rhs) const;
      Equality.
      6. +
      bool operator==(const date_duration & rhs) const;
      Equality.
    6. -
      bool operator<(const date_duration & rhs) const;
      Less.
      7. +
      bool operator<(const date_duration & rhs) const;
      Less.
    7. -
      date_duration & operator-=(const date_duration & rhs);
      Subtract another duration <ndash></ndash> result is signed.
      8. +
      date_duration & operator-=(const date_duration & rhs);
      Subtract another duration <ndash></ndash> result is signed.
    8. -
      date_duration & operator+=(const date_duration & rhs);
      Add a duration <ndash></ndash> result is signed.
      9. +
      date_duration & operator+=(const date_duration & rhs);
      Add a duration <ndash></ndash> result is signed.
    9. -
      date_duration operator-() const;
      unary- Allows for dd = -date_duration(2); -> dd == -2
      10. +
      date_duration operator-() const;
      unary- Allows for dd = -date_duration(2); -> dd == -2
    10. -
      date_duration & operator/=(int divisor);
      Division operations on a duration with an integer.
      11. +
      date_duration & operator/=(int divisor);
      Division operations on a duration with an integer.
    11. -
      bool is_negative() const;
      return sign information
      12. +
      bool is_negative() const;
      return sign information
    -

    -date_duration public static functions

    +

    +date_duration public static functions

    1. -
      static date_duration unit();
      Returns the smallest duration <ndash></ndash> used by to calculate 'end'.
    +
    static date_duration unit();
    Returns the smallest duration <ndash></ndash> used by to calculate 'end'.
    diff --git a/doc/html/boost/date_time/date_facet.html b/doc/html/boost/date_time/date_facet.html index acaa5b5ef3..42565aeca0 100644 --- a/doc/html/boost/date_time/date_facet.html +++ b/doc/html/boost/date_time/date_facet.html @@ -45,7 +45,7 @@ typedef std::basic_string< CharT > string_type; typedef CharT char_type; typedef boost::date_time::period_formatter< CharT > period_formatter_type; - typedef boost::date_time::special_values_formatter< CharT > special_values_formatter_type; + typedef boost::date_time::special_values_formatter< CharT > special_values_formatter_type; typedef std::vector< std::basic_string< CharT > > input_collection_type; typedef date_generator_formatter< date_type, CharT > date_gen_formatter_type; typedef partial_date< date_type > partial_date_type; @@ -56,49 +56,49 @@ typedef first_kday_before< date_type > kday_before_type; // construct/copy/destruct - explicit date_facet(::size_t = 0); - explicit date_facet(const char_type *, const input_collection_type &, + explicit date_facet(::size_t = 0); + explicit date_facet(const char_type *, const input_collection_type &, ::size_t = 0); - explicit date_facet(const char_type *, + explicit date_facet(const char_type *, period_formatter_type = period_formatter_type(), - special_values_formatter_type = special_values_formatter_type(), + special_values_formatter_type = special_values_formatter_type(), date_gen_formatter_type = date_gen_formatter_type(), ::size_t = 0); - // public member functions - std::locale::id & __get_id(void) const; - void format(const char_type *const); - virtual void set_iso_format(); - virtual void set_iso_extended_format(); - void month_format(const char_type *const); - void weekday_format(const char_type *const); - void period_formatter(period_formatter_type); - void special_values_formatter(const special_values_formatter_type &); - void short_weekday_names(const input_collection_type &); - void long_weekday_names(const input_collection_type &); - void short_month_names(const input_collection_type &); - void long_month_names(const input_collection_type &); - void date_gen_phrase_strings(const input_collection_type &, + // public member functions + std::locale::id & __get_id(void) const; + void format(const char_type *const); + virtual void set_iso_format(); + virtual void set_iso_extended_format(); + void month_format(const char_type *const); + void weekday_format(const char_type *const); + void period_formatter(period_formatter_type); + void special_values_formatter(const special_values_formatter_type &); + void short_weekday_names(const input_collection_type &); + void long_weekday_names(const input_collection_type &); + void short_month_names(const input_collection_type &); + void long_month_names(const input_collection_type &); + void date_gen_phrase_strings(const input_collection_type &, typename date_gen_formatter_type::phrase_elements = date_gen_formatter_type::first); - OutItrT put(OutItrT, std::ios_base &, char_type, const date_type &) const; - OutItrT put(OutItrT, std::ios_base &, char_type, const duration_type &) const; - OutItrT put(OutItrT, std::ios_base &, char_type, const month_type &) const; - OutItrT put(OutItrT, std::ios_base &, char_type, const day_type &) const; - OutItrT put(OutItrT, std::ios_base &, char_type, const day_of_week_type &) const; - OutItrT put(OutItrT, std::ios_base &, char_type, const period_type &) const; - OutItrT put(OutItrT, std::ios_base &, char_type, const partial_date_type &) const; - OutItrT put(OutItrT, std::ios_base &, char_type, const nth_kday_type &) const; - OutItrT put(OutItrT, std::ios_base &, char_type, const first_kday_type &) const; - OutItrT put(OutItrT, std::ios_base &, char_type, const last_kday_type &) const; - OutItrT put(OutItrT, std::ios_base &, char_type, const kday_before_type &) const; - OutItrT put(OutItrT, std::ios_base &, char_type, const kday_after_type &) const; + OutItrT put(OutItrT, std::ios_base &, char_type, const date_type &) const; + OutItrT put(OutItrT, std::ios_base &, char_type, const duration_type &) const; + OutItrT put(OutItrT, std::ios_base &, char_type, const month_type &) const; + OutItrT put(OutItrT, std::ios_base &, char_type, const day_type &) const; + OutItrT put(OutItrT, std::ios_base &, char_type, const day_of_week_type &) const; + OutItrT put(OutItrT, std::ios_base &, char_type, const period_type &) const; + OutItrT put(OutItrT, std::ios_base &, char_type, const partial_date_type &) const; + OutItrT put(OutItrT, std::ios_base &, char_type, const nth_kday_type &) const; + OutItrT put(OutItrT, std::ios_base &, char_type, const first_kday_type &) const; + OutItrT put(OutItrT, std::ios_base &, char_type, const last_kday_type &) const; + OutItrT put(OutItrT, std::ios_base &, char_type, const kday_before_type &) const; + OutItrT put(OutItrT, std::ios_base &, char_type, const kday_after_type &) const; - // protected member functions + // protected member functions virtual OutItrT - do_put_special(OutItrT, std::ios_base &, char_type, + do_put_special(OutItrT, std::ios_base &, char_type, const boost::date_time::special_values) const; virtual OutItrT - do_put_tm(OutItrT, std::ios_base &, char_type, const tm &, string_type) const; + do_put_tm(OutItrT, std::ios_base &, char_type, const tm &, string_type) const; // public data members static const char_type long_weekday_format; @@ -113,7 +113,7 @@ static std::locale::id id; };
    -

    Description

    +

    Description

    Class that provides format based I/O facet for date types.

    This class allows the formatting of dates by using format string. Format strings are:

      @@ -128,76 +128,76 @@

      Default month format == b Default weekday format == a

      -

      +

      date_facet public construct/copy/destruct

        -
      1. explicit date_facet(::size_t a_ref = 0);
        2. -
      2. explicit date_facet(const char_type * format_str, 
+
      3. explicit date_facet(::size_t a_ref = 0);
        4. 
+
      4. explicit date_facet(const char_type * format_str, 
                     const input_collection_type & short_names, 
                     ::size_t ref_count = 0);
        5. 
-
      5. explicit date_facet(const char_type * format_str, 
+
      6. explicit date_facet(const char_type * format_str, 
                     period_formatter_type per_formatter = period_formatter_type(), 
-                    special_values_formatter_type sv_formatter = special_values_formatter_type(), 
+                    special_values_formatter_type sv_formatter = special_values_formatter_type(), 
                     date_gen_formatter_type dg_formatter = date_gen_formatter_type(), 
                     ::size_t ref_count = 0);
        7.
      -

      -date_facet public member functions

      +

      +date_facet public member functions

        -
      1. std::locale::id & __get_id(void) const;
        2. -
      2. void format(const char_type *const format_str);
        3. -
      3. virtual void set_iso_format();
        4. -
      4. virtual void set_iso_extended_format();
        5. -
      5. void month_format(const char_type *const format_str);
        6. -
      6. void weekday_format(const char_type *const format_str);
        7. -
      7. void period_formatter(period_formatter_type per_formatter);
        8. -
      8. void special_values_formatter(const special_values_formatter_type & svf);
        9. -
      9. void short_weekday_names(const input_collection_type & short_names);
        10. -
      10. void long_weekday_names(const input_collection_type & long_names);
        11. -
      11. void short_month_names(const input_collection_type & short_names);
        12. -
      12. void long_month_names(const input_collection_type & long_names);
        13. -
      13. void date_gen_phrase_strings(const input_collection_type & new_strings, 
+
      14. std::locale::id & __get_id(void) const;
        15. 
+
      15. void format(const char_type *const format_str);
        16. 
+
      16. virtual void set_iso_format();
        17. 
+
      17. virtual void set_iso_extended_format();
        18. 
+
      18. void month_format(const char_type *const format_str);
        19. 
+
      19. void weekday_format(const char_type *const format_str);
        20. 
+
      20. void period_formatter(period_formatter_type per_formatter);
        21. 
+
      21. void special_values_formatter(const special_values_formatter_type & svf);
        22. 
+
      22. void short_weekday_names(const input_collection_type & short_names);
        23. 
+
      23. void long_weekday_names(const input_collection_type & long_names);
        24. 
+
      24. void short_month_names(const input_collection_type & short_names);
        25. 
+
      25. void long_month_names(const input_collection_type & long_names);
        26. 
+
      26. void date_gen_phrase_strings(const input_collection_type & new_strings, 
                              typename date_gen_formatter_type::phrase_elements beg_pos = date_gen_formatter_type::first);
        27. 
-
      27. OutItrT put(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
+
      28. OutItrT put(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
             const date_type & d) const;
        29. 
-
      29. OutItrT put(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
+
      30. OutItrT put(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
             const duration_type & dd) const;
        31. 
-
      31. OutItrT put(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
+
      32. OutItrT put(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
             const month_type & m) const;
        33. 
 
      33. 
-
        OutItrT put(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
+
        OutItrT put(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
             const day_type & day) const;
        puts the day of month 
        34. 
-
      34. OutItrT put(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
+
      35. OutItrT put(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
             const day_of_week_type & dow) const;
        36. 
-
      36. OutItrT put(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
+
      37. OutItrT put(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
             const period_type & p) const;
        38. 
-
      38. OutItrT put(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
+
      39. OutItrT put(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
             const partial_date_type & pd) const;
        40. 
-
      40. OutItrT put(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
+
      41. OutItrT put(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
             const nth_kday_type & nkd) const;
        42. 
-
      42. OutItrT put(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
+
      43. OutItrT put(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
             const first_kday_type & fkd) const;
        44. 
-
      44. OutItrT put(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
+
      45. OutItrT put(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
             const last_kday_type & lkd) const;
        46. 
-
      46. OutItrT put(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
+
      47. OutItrT put(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
             const kday_before_type & fkb) const;
        48. 
-
      48. OutItrT put(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
+
      49. OutItrT put(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
             const kday_after_type & fka) const;
        50.
      -

      -date_facet protected member functions

      +

      +date_facet protected member functions

      1. virtual OutItrT 
-do_put_special(OutItrT next, std::ios_base &, char_type, 
+do_put_special(OutItrT next, std::ios_base &, char_type, 
                const boost::date_time::special_values sv) const;
      2. virtual OutItrT 
-do_put_tm(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
+do_put_tm(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
           const tm & tm_value, string_type a_format) const;
      diff --git a/doc/html/boost/date_time/date_formatter.html b/doc/html/boost/date_time/date_formatter.html index f45c1ad047..8d36de7eb7 100644 --- a/doc/html/boost/date_time/date_formatter.html +++ b/doc/html/boost/date_time/date_formatter.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -38,20 +38,20 @@ // types typedef std::basic_string< charT > string_type; - // public static functions - static string_type date_to_string(date_type); - static std::string date_to_string(date_type); + // public static functions + static string_type date_to_string(date_type); + static std::string date_to_string(date_type); };
    -

    Description

    +

    Description

    -

    -date_formatter public static functions

    +

    +date_formatter public static functions

    1. -
      static string_type date_to_string(date_type d);
      Convert to a date to standard string using format policies.
      2. +
      static string_type date_to_string(date_type d);
      Convert to a date to standard string using format policies.
    2. -
      static std::string date_to_string(date_type d);
      Convert to a date to standard string using format policies.
      3. +
      static std::string date_to_string(date_type d);
      Convert to a date to standard string using format policies.
    @@ -64,7 +64,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/date_time/date_generator_formatter.html b/doc/html/boost/date_time/date_generator_formatter.html index 6853e0d2f0..9345efad61 100644 --- a/doc/html/boost/date_time/date_generator_formatter.html +++ b/doc/html/boost/date_time/date_generator_formatter.html @@ -51,36 +51,36 @@ before, after, of, number_of_phrase_elements }; // construct/copy/destruct - date_generator_formatter(); - date_generator_formatter(const string_type &, const string_type &, + date_generator_formatter(); + date_generator_formatter(const string_type &, const string_type &, const string_type &, const string_type &, const string_type &, const string_type &, const string_type &, const string_type &, const string_type &); - // public member functions - void elements(const collection_type &, phrase_elements = first); + // public member functions + void elements(const collection_type &, phrase_elements = first); template<typename facet_type> - OutItrT put_partial_date(OutItrT, std::ios_base &, CharT, + OutItrT put_partial_date(OutItrT, std::ios_base &, CharT, const partial_date_type &, const facet_type &) const; template<typename facet_type> - OutItrT put_nth_kday(OutItrT, std::ios_base &, CharT, + OutItrT put_nth_kday(OutItrT, std::ios_base &, CharT, const nth_kday_type &, const facet_type &) const; template<typename facet_type> - OutItrT put_first_kday(OutItrT, std::ios_base &, CharT, + OutItrT put_first_kday(OutItrT, std::ios_base &, CharT, const first_kday_type &, const facet_type &) const; template<typename facet_type> - OutItrT put_last_kday(OutItrT, std::ios_base &, CharT, + OutItrT put_last_kday(OutItrT, std::ios_base &, CharT, const last_kday_type &, const facet_type &) const; template<typename facet_type> - OutItrT put_kday_before(OutItrT, std::ios_base &, CharT, + OutItrT put_kday_before(OutItrT, std::ios_base &, CharT, const kday_before_type &, const facet_type &) const; template<typename facet_type> - OutItrT put_kday_after(OutItrT, std::ios_base &, CharT, + OutItrT put_kday_after(OutItrT, std::ios_base &, CharT, const kday_after_type &, const facet_type &) const; - // private member functions - OutItrT put_string(OutItrT, const string_type &) const; + // private member functions + OutItrT put_string(OutItrT, const string_type &) const; // public data members static const char_type first_string; @@ -94,7 +94,7 @@ static const char_type of_string; };
    -

    Description

    +

    Description

    Formatting of date_generators follows specific orders for the various types of date_generators.

    • partial_date => "dd Month"

      • @@ -107,15 +107,15 @@

      -

      +

      date_generator_formatter public construct/copy/destruct

      1. -
        date_generator_formatter();
        Default format elements used.
        2. +
        date_generator_formatter();
        Default format elements used.
      2. -
        date_generator_formatter(const string_type & first_str, 
+
        date_generator_formatter(const string_type & first_str, 
                          const string_type & second_str, 
                          const string_type & third_str, 
                          const string_type & fourth_str, 
@@ -127,11 +127,11 @@
      -

      -date_generator_formatter public member functions

      +

      +date_generator_formatter public member functions

      1. -
        void elements(const collection_type & new_strings, 
+
        void elements(const collection_type & new_strings, 
               phrase_elements beg_pos = first);
        Replace the set of phrase elements with those contained in new_strings. 
        The order of the strings in the given collection is important. They must follow:
        
 
        • first, second, third, fourth, fifth, last, before, after, of.
        
 
        
@@ -144,39 +144,39 @@
 
      2. template<typename facet_type> 
-  OutItrT put_partial_date(OutItrT next, std::ios_base & a_ios, CharT a_fill, 
+  OutItrT put_partial_date(OutItrT next, std::ios_base & a_ios, CharT a_fill, 
                            const partial_date_type & pd, 
                            const facet_type & facet) const;
        Put a partial_date => "dd Month". 
      3. template<typename facet_type> 
-  OutItrT put_nth_kday(OutItrT next, std::ios_base & a_ios, CharT a_fill, 
+  OutItrT put_nth_kday(OutItrT next, std::ios_base & a_ios, CharT a_fill, 
                        const nth_kday_type & nkd, const facet_type & facet) const;
        Put an nth_day_of_the_week_in_month => "nth weekday of month". 
      4. template<typename facet_type> 
-  OutItrT put_first_kday(OutItrT next, std::ios_base & a_ios, CharT a_fill, 
+  OutItrT put_first_kday(OutItrT next, std::ios_base & a_ios, CharT a_fill, 
                          const first_kday_type & fkd, 
                          const facet_type & facet) const;
        Put a first_day_of_the_week_in_month => "first weekday of month". 
      5. template<typename facet_type> 
-  OutItrT put_last_kday(OutItrT next, std::ios_base & a_ios, CharT a_fill, 
+  OutItrT put_last_kday(OutItrT next, std::ios_base & a_ios, CharT a_fill, 
                         const last_kday_type & lkd, const facet_type & facet) const;
        Put a last_day_of_the_week_in_month => "last weekday of month". 
      6. template<typename facet_type> 
-  OutItrT put_kday_before(OutItrT next, std::ios_base & a_ios, CharT a_fill, 
+  OutItrT put_kday_before(OutItrT next, std::ios_base & a_ios, CharT a_fill, 
                           const kday_before_type & fkb, 
                           const facet_type & facet) const;
        Put a first_day_of_the_week_before => "weekday before". 
      7. template<typename facet_type> 
-  OutItrT put_kday_after(OutItrT next, std::ios_base & a_ios, CharT a_fill, 
+  OutItrT put_kday_after(OutItrT next, std::ios_base & a_ios, CharT a_fill, 
                          const kday_after_type & fka, 
                          const facet_type & facet) const;
        Put a first_day_of_the_week_after => "weekday after".
      -

      -date_generator_formatter private member functions

      +

      +date_generator_formatter private member functions

      1. -
        OutItrT put_string(OutItrT next, const string_type & str) const;
        helper function to put the various member string into stream
      +
      OutItrT put_string(OutItrT next, const string_type & str) const;
      helper function to put the various member string into stream
    diff --git a/doc/html/boost/date_time/date_generator_parser.html b/doc/html/boost/date_time/date_generator_parser.html index c5d53fc608..51aca70e6f 100644 --- a/doc/html/boost/date_time/date_generator_parser.html +++ b/doc/html/boost/date_time/date_generator_parser.html @@ -56,47 +56,47 @@ before, after, of, number_of_phrase_elements }; // construct/copy/destruct - date_generator_parser(); - date_generator_parser(const string_type &, const string_type &, + date_generator_parser(); + date_generator_parser(const string_type &, const string_type &, const string_type &, const string_type &, const string_type &, const string_type &, const string_type &, const string_type &, const string_type &); - // public member functions - void element_strings(const string_type &, const string_type &, + // public member functions + void element_strings(const string_type &, const string_type &, const string_type &, const string_type &, const string_type &, const string_type &, const string_type &, const string_type &, const string_type &); - void element_strings(const collection_type &); + void element_strings(const collection_type &); template<typename facet_type> partial_date_type - get_partial_date_type(stream_itr_type &, stream_itr_type &, + get_partial_date_type(stream_itr_type &, stream_itr_type &, std::ios_base &, const facet_type &) const; template<typename facet_type> nth_kday_type - get_nth_kday_type(stream_itr_type &, stream_itr_type &, std::ios_base &, + get_nth_kday_type(stream_itr_type &, stream_itr_type &, std::ios_base &, const facet_type &) const; template<typename facet_type> first_kday_type - get_first_kday_type(stream_itr_type &, stream_itr_type &, std::ios_base &, + get_first_kday_type(stream_itr_type &, stream_itr_type &, std::ios_base &, const facet_type &) const; template<typename facet_type> last_kday_type - get_last_kday_type(stream_itr_type &, stream_itr_type &, std::ios_base &, + get_last_kday_type(stream_itr_type &, stream_itr_type &, std::ios_base &, const facet_type &) const; template<typename facet_type> kday_before_type - get_kday_before_type(stream_itr_type &, stream_itr_type &, + get_kday_before_type(stream_itr_type &, stream_itr_type &, std::ios_base &, const facet_type &) const; template<typename facet_type> kday_after_type - get_kday_after_type(stream_itr_type &, stream_itr_type &, std::ios_base &, + get_kday_after_type(stream_itr_type &, stream_itr_type &, std::ios_base &, const facet_type &) const; - // private member functions - void extract_element(stream_itr_type &, stream_itr_type &, + // private member functions + void extract_element(stream_itr_type &, stream_itr_type &, typename date_generator_parser::phrase_elements) const; // public data members @@ -111,7 +111,7 @@ static const char_type of_string; };
    -

    Description

    +

    Description

    The elements of a date_generator "phrase" are parsed from the input stream in a particular order. All elements are required and the order in which they appear cannot change, however, the elements themselves can be changed. The default elements and their order are as follows:

    • partial_date => "dd Month"

      • @@ -125,15 +125,15 @@

      Weekday and Month names and formats are handled via the date_input_facet.

      -

      +

      date_generator_parser public construct/copy/destruct

      1. -
        date_generator_parser();
        Creates a date_generator_parser with the default set of "element_strings".
        2. +
        date_generator_parser();
        Creates a date_generator_parser with the default set of "element_strings".
      2. -
        date_generator_parser(const string_type & first_str, 
+
        date_generator_parser(const string_type & first_str, 
                       const string_type & second_str, 
                       const string_type & third_str, 
                       const string_type & fourth_str, 
@@ -145,11 +145,11 @@
      -

      -date_generator_parser public member functions

      +

      +date_generator_parser public member functions

      1. -
        void element_strings(const string_type & first_str, 
+
        void element_strings(const string_type & first_str, 
                      const string_type & second_str, 
                      const string_type & third_str, 
                      const string_type & fourth_str, 
@@ -158,44 +158,44 @@
                      const string_type & before_str, 
                      const string_type & after_str, 
                      const string_type & of_str);
        Replace strings that determine nth week for generator.
        2. -
      2. void element_strings(const collection_type & col);
        3. +
      3. void element_strings(const collection_type & col);
      4. template<typename facet_type> 
   partial_date_type 
-  get_partial_date_type(stream_itr_type & sitr, stream_itr_type & stream_end, 
+  get_partial_date_type(stream_itr_type & sitr, stream_itr_type & stream_end, 
                         std::ios_base & a_ios, const facet_type & facet) const;
        returns partial_date parsed from stream 
      5. template<typename facet_type> 
   nth_kday_type 
-  get_nth_kday_type(stream_itr_type & sitr, stream_itr_type & stream_end, 
+  get_nth_kday_type(stream_itr_type & sitr, stream_itr_type & stream_end, 
                     std::ios_base & a_ios, const facet_type & facet) const;
        returns nth_kday_of_week parsed from stream 
      6. template<typename facet_type> 
   first_kday_type 
-  get_first_kday_type(stream_itr_type & sitr, stream_itr_type & stream_end, 
+  get_first_kday_type(stream_itr_type & sitr, stream_itr_type & stream_end, 
                       std::ios_base & a_ios, const facet_type & facet) const;
        returns first_kday_of_week parsed from stream 
      7. template<typename facet_type> 
   last_kday_type 
-  get_last_kday_type(stream_itr_type & sitr, stream_itr_type & stream_end, 
+  get_last_kday_type(stream_itr_type & sitr, stream_itr_type & stream_end, 
                      std::ios_base & a_ios, const facet_type & facet) const;
        returns last_kday_of_week parsed from stream 
      8. template<typename facet_type> 
   kday_before_type 
-  get_kday_before_type(stream_itr_type & sitr, stream_itr_type & stream_end, 
+  get_kday_before_type(stream_itr_type & sitr, stream_itr_type & stream_end, 
                        std::ios_base & a_ios, const facet_type & facet) const;
        returns first_kday_of_week parsed from stream 
      9. template<typename facet_type> 
   kday_after_type 
-  get_kday_after_type(stream_itr_type & sitr, stream_itr_type & stream_end, 
+  get_kday_after_type(stream_itr_type & sitr, stream_itr_type & stream_end, 
                       std::ios_base & a_ios, const facet_type & facet) const;
        returns first_kday_of_week parsed from stream
      -

      -date_generator_parser private member functions

      +

      +date_generator_parser private member functions

      1. -
        void extract_element(stream_itr_type & sitr, stream_itr_type & stream_end, 
+
        void extract_element(stream_itr_type & sitr, stream_itr_type & stream_end, 
                      typename date_generator_parser::phrase_elements ele) const;
        Extracts phrase element from input. Throws ios_base::failure on error.
    diff --git a/doc/html/boost/date_time/date_input_facet.html b/doc/html/boost/date_time/date_input_facet.html index 6a7a81b8d1..839f27befc 100644 --- a/doc/html/boost/date_time/date_input_facet.html +++ b/doc/html/boost/date_time/date_input_facet.html @@ -58,46 +58,46 @@ typedef first_kday_before< date_type > kday_before_type; // construct/copy/destruct - explicit date_input_facet(::size_t = 0); - explicit date_input_facet(const string_type &, ::size_t = 0); - explicit date_input_facet(const string_type &, + explicit date_input_facet(::size_t = 0); + explicit date_input_facet(const string_type &, ::size_t = 0); + explicit date_input_facet(const string_type &, const format_date_parser_type &, const special_values_parser_type &, const period_parser_type &, const date_gen_parser_type &, ::size_t = 0); - // public member functions - void format(const char_type *const); - virtual void set_iso_format(); - virtual void set_iso_extended_format(); - void month_format(const char_type *const); - void weekday_format(const char_type *const); - void year_format(const char_type *const); - void period_parser(period_parser_type); - void short_weekday_names(const input_collection_type &); - void long_weekday_names(const input_collection_type &); - void short_month_names(const input_collection_type &); - void long_month_names(const input_collection_type &); - void date_gen_element_strings(const input_collection_type &); - void date_gen_element_strings(const string_type &, const string_type &, + // public member functions + void format(const char_type *const); + virtual void set_iso_format(); + virtual void set_iso_extended_format(); + void month_format(const char_type *const); + void weekday_format(const char_type *const); + void year_format(const char_type *const); + void period_parser(period_parser_type); + void short_weekday_names(const input_collection_type &); + void long_weekday_names(const input_collection_type &); + void short_month_names(const input_collection_type &); + void long_month_names(const input_collection_type &); + void date_gen_element_strings(const input_collection_type &); + void date_gen_element_strings(const string_type &, const string_type &, const string_type &, const string_type &, const string_type &, const string_type &, const string_type &, const string_type &, const string_type &); - void special_values_parser(special_values_parser_type); - InItrT get(InItrT &, InItrT &, std::ios_base &, date_type &) const; - InItrT get(InItrT &, InItrT &, std::ios_base &, month_type &) const; - InItrT get(InItrT &, InItrT &, std::ios_base &, day_of_week_type &) const; - InItrT get(InItrT &, InItrT &, std::ios_base &, day_type &) const; - InItrT get(InItrT &, InItrT &, std::ios_base &, year_type &) const; - InItrT get(InItrT &, InItrT &, std::ios_base &, duration_type &) const; - InItrT get(InItrT &, InItrT &, std::ios_base &, period_type &) const; - InItrT get(InItrT &, InItrT &, std::ios_base &, nth_kday_type &) const; - InItrT get(InItrT &, InItrT &, std::ios_base &, partial_date_type &) const; - InItrT get(InItrT &, InItrT &, std::ios_base &, first_kday_type &) const; - InItrT get(InItrT &, InItrT &, std::ios_base &, last_kday_type &) const; - InItrT get(InItrT &, InItrT &, std::ios_base &, kday_before_type &) const; - InItrT get(InItrT &, InItrT &, std::ios_base &, kday_after_type &) const; + void special_values_parser(special_values_parser_type); + InItrT get(InItrT &, InItrT &, std::ios_base &, date_type &) const; + InItrT get(InItrT &, InItrT &, std::ios_base &, month_type &) const; + InItrT get(InItrT &, InItrT &, std::ios_base &, day_of_week_type &) const; + InItrT get(InItrT &, InItrT &, std::ios_base &, day_type &) const; + InItrT get(InItrT &, InItrT &, std::ios_base &, year_type &) const; + InItrT get(InItrT &, InItrT &, std::ios_base &, duration_type &) const; + InItrT get(InItrT &, InItrT &, std::ios_base &, period_type &) const; + InItrT get(InItrT &, InItrT &, std::ios_base &, nth_kday_type &) const; + InItrT get(InItrT &, InItrT &, std::ios_base &, partial_date_type &) const; + InItrT get(InItrT &, InItrT &, std::ios_base &, first_kday_type &) const; + InItrT get(InItrT &, InItrT &, std::ios_base &, last_kday_type &) const; + InItrT get(InItrT &, InItrT &, std::ios_base &, kday_before_type &) const; + InItrT get(InItrT &, InItrT &, std::ios_base &, kday_after_type &) const; // public data members static const char_type long_weekday_format; @@ -114,16 +114,16 @@ static std::locale::id id; };
    -

    Description

    +

    Description

    -

    +

    date_input_facet public construct/copy/destruct

      -
    1. explicit date_input_facet(::size_t a_ref = 0);
      2. -
    2. explicit date_input_facet(const string_type & format_str, ::size_t a_ref = 0);
      3. -
    3. explicit date_input_facet(const string_type & format_str, 
+
    4. explicit date_input_facet(::size_t a_ref = 0);
      5. 
+
    5. explicit date_input_facet(const string_type & format_str, ::size_t a_ref = 0);
      6. 
+
    6. explicit date_input_facet(const string_type & format_str, 
                           const format_date_parser_type & date_parser, 
                           const special_values_parser_type & sv_parser, 
                           const period_parser_type & per_parser, 
@@ -132,22 +132,22 @@
    -

    -date_input_facet public member functions

    +

    +date_input_facet public member functions

      -
    1. void format(const char_type *const format_str);
      2. -
    2. virtual void set_iso_format();
      3. -
    3. virtual void set_iso_extended_format();
      4. -
    4. void month_format(const char_type *const format_str);
      5. -
    5. void weekday_format(const char_type *const format_str);
      6. -
    6. void year_format(const char_type *const format_str);
      7. -
    7. void period_parser(period_parser_type per_parser);
      8. -
    8. void short_weekday_names(const input_collection_type & weekday_names);
      9. -
    9. void long_weekday_names(const input_collection_type & weekday_names);
      10. -
    10. void short_month_names(const input_collection_type & month_names);
      11. -
    11. void long_month_names(const input_collection_type & month_names);
      12. -
    12. void date_gen_element_strings(const input_collection_type & col);
      13. -
    13. void date_gen_element_strings(const string_type & first, 
+
    14. void format(const char_type *const format_str);
      15. 
+
    15. virtual void set_iso_format();
      16. 
+
    16. virtual void set_iso_extended_format();
      17. 
+
    17. void month_format(const char_type *const format_str);
      18. 
+
    18. void weekday_format(const char_type *const format_str);
      19. 
+
    19. void year_format(const char_type *const format_str);
      20. 
+
    20. void period_parser(period_parser_type per_parser);
      21. 
+
    21. void short_weekday_names(const input_collection_type & weekday_names);
      22. 
+
    22. void long_weekday_names(const input_collection_type & weekday_names);
      23. 
+
    23. void short_month_names(const input_collection_type & month_names);
      24. 
+
    24. void long_month_names(const input_collection_type & month_names);
      25. 
+
    25. void date_gen_element_strings(const input_collection_type & col);
      26. 
+
    26. void date_gen_element_strings(const string_type & first, 
                               const string_type & second, 
                               const string_type & third, 
                               const string_type & fourth, 
@@ -156,27 +156,27 @@
                               const string_type & before, 
                               const string_type & after, 
                               const string_type & of);
      27. 
-
    27. void special_values_parser(special_values_parser_type sv_parser);
      28. 
-
    28. InItrT get(InItrT & from, InItrT & to, std::ios_base &, date_type & d) const;
      29. 
-
    29. InItrT get(InItrT & from, InItrT & to, std::ios_base &, month_type & m) const;
      30. 
-
    30. InItrT get(InItrT & from, InItrT & to, std::ios_base &, day_of_week_type & wd) const;
      31. 
+
    31. void special_values_parser(special_values_parser_type sv_parser);
      32. 
+
    32. InItrT get(InItrT & from, InItrT & to, std::ios_base &, date_type & d) const;
      33. 
+
    33. InItrT get(InItrT & from, InItrT & to, std::ios_base &, month_type & m) const;
      34. 
+
    34. InItrT get(InItrT & from, InItrT & to, std::ios_base &, day_of_week_type & wd) const;
      35. 
 
    35. 
-
      InItrT get(InItrT & from, InItrT & to, std::ios_base &, day_type & d) const;
      Expects 1 or 2 digit day range: 1-31. 
      36. 
-
    36. InItrT get(InItrT & from, InItrT & to, std::ios_base &, year_type & y) const;
      37. 
-
    37. InItrT get(InItrT & from, InItrT & to, std::ios_base & a_ios, 
+
      InItrT get(InItrT & from, InItrT & to, std::ios_base &, day_type & d) const;
      Expects 1 or 2 digit day range: 1-31. 
      38. 
+
    38. InItrT get(InItrT & from, InItrT & to, std::ios_base &, year_type & y) const;
      39. 
+
    39. InItrT get(InItrT & from, InItrT & to, std::ios_base & a_ios, 
            duration_type & dd) const;
      40. 
-
    40. InItrT get(InItrT & from, InItrT & to, std::ios_base & a_ios, period_type & p) const;
      41. 
-
    41. InItrT get(InItrT & from, InItrT & to, std::ios_base & a_ios, 
+
    42. InItrT get(InItrT & from, InItrT & to, std::ios_base & a_ios, period_type & p) const;
      43. 
+
    43. InItrT get(InItrT & from, InItrT & to, std::ios_base & a_ios, 
            nth_kday_type & nkd) const;
      44. 
-
    44. InItrT get(InItrT & from, InItrT & to, std::ios_base & a_ios, 
+
    45. InItrT get(InItrT & from, InItrT & to, std::ios_base & a_ios, 
            partial_date_type & pd) const;
      46. 
-
    46. InItrT get(InItrT & from, InItrT & to, std::ios_base & a_ios, 
+
    47. InItrT get(InItrT & from, InItrT & to, std::ios_base & a_ios, 
            first_kday_type & fkd) const;
      48. 
-
    48. InItrT get(InItrT & from, InItrT & to, std::ios_base & a_ios, 
+
    49. InItrT get(InItrT & from, InItrT & to, std::ios_base & a_ios, 
            last_kday_type & lkd) const;
      50. 
-
    50. InItrT get(InItrT & from, InItrT & to, std::ios_base & a_ios, 
+
    51. InItrT get(InItrT & from, InItrT & to, std::ios_base & a_ios, 
            kday_before_type & fkb) const;
      52. 
-
    52. InItrT get(InItrT & from, InItrT & to, std::ios_base & a_ios, 
+
    53. InItrT get(InItrT & from, InItrT & to, std::ios_base & a_ios, 
            kday_after_type & fka) const;
      54.
    diff --git a/doc/html/boost/date_time/date_itr.html b/doc/html/boost/date_time/date_itr.html index d5fde18ef3..bb076ad305 100644 --- a/doc/html/boost/date_time/date_itr.html +++ b/doc/html/boost/date_time/date_itr.html @@ -39,27 +39,27 @@ typedef date_type::duration_type duration_type; // construct/copy/destruct - date_itr(date_type, int = 1); + date_itr(date_type, int = 1); - // private member functions - virtual duration_type get_offset(const date_type &) const; - virtual duration_type get_neg_offset(const date_type &) const; + // private member functions + virtual duration_type get_offset(const date_type &) const; + virtual duration_type get_neg_offset(const date_type &) const; };
    -

    Description

    +

    Description

    -

    +

    date_itr public construct/copy/destruct

    -
    1. date_itr(date_type d, int factor = 1);
    +
    1. date_itr(date_type d, int factor = 1);
    -

    -date_itr private member functions

    +

    +date_itr private member functions

      -
    1. virtual duration_type get_offset(const date_type & current) const;
      2. -
    2. virtual duration_type get_neg_offset(const date_type & current) const;
      3. +
    3. virtual duration_type get_offset(const date_type & current) const;
      4. +
    4. virtual duration_type get_neg_offset(const date_type & current) const;
    diff --git a/doc/html/boost/date_time/date_itr_base.html b/doc/html/boost/date_time/date_itr_base.html index 3af4e30a28..2bb7b2d0e9 100644 --- a/doc/html/boost/date_time/date_itr_base.html +++ b/doc/html/boost/date_time/date_itr_base.html @@ -41,55 +41,55 @@ typedef std::input_iterator_tag iterator_category; // construct/copy/destruct - date_itr_base(date_type); - ~date_itr_base(); + date_itr_base(date_type); + ~date_itr_base(); - // public member functions - date_itr_base & operator++(); - date_itr_base & operator--(); - virtual duration_type get_offset(const date_type &) const = 0; - virtual duration_type get_neg_offset(const date_type &) const = 0; - date_type operator*(); - date_type * operator->(); - bool operator<(const date_type &); - bool operator<=(const date_type &); - bool operator>(const date_type &); - bool operator>=(const date_type &); - bool operator==(const date_type &); - bool operator!=(const date_type &); + // public member functions + date_itr_base & operator++(); + date_itr_base & operator--(); + virtual duration_type get_offset(const date_type &) const = 0; + virtual duration_type get_neg_offset(const date_type &) const = 0; + date_type operator*(); + date_type * operator->(); + bool operator<(const date_type &); + bool operator<=(const date_type &); + bool operator>(const date_type &); + bool operator>=(const date_type &); + bool operator==(const date_type &); + bool operator!=(const date_type &); };
    -

    Description

    +

    Description

    This class provides the skeleton for the creation of iterators. New and interesting interators can be created by plugging in a new function that derives the next value from the current state. generation of various types of -based information.

    Template Parameters

    date_type

    The date_type is a concrete date_type. The date_type must define a duration_type and a calendar_type.

    -

    +

    date_itr_base public construct/copy/destruct

      -
    1. date_itr_base(date_type d);
      2. -
    2. ~date_itr_base();
      3. +
    3. date_itr_base(date_type d);
      4. +
    4. ~date_itr_base();
    -

    -date_itr_base public member functions

    +

    +date_itr_base public member functions

      -
    1. date_itr_base & operator++();
      2. -
    2. date_itr_base & operator--();
      3. -
    3. virtual duration_type get_offset(const date_type & current) const = 0;
      4. -
    4. virtual duration_type get_neg_offset(const date_type & current) const = 0;
      5. -
    5. date_type operator*();
      6. -
    6. date_type * operator->();
      7. -
    7. bool operator<(const date_type & d);
      8. -
    8. bool operator<=(const date_type & d);
      9. -
    9. bool operator>(const date_type & d);
      10. -
    10. bool operator>=(const date_type & d);
      11. -
    11. bool operator==(const date_type & d);
      12. -
    12. bool operator!=(const date_type & d);
      13. +
    13. date_itr_base & operator++();
      14. +
    14. date_itr_base & operator--();
      15. +
    15. virtual duration_type get_offset(const date_type & current) const = 0;
      16. +
    16. virtual duration_type get_neg_offset(const date_type & current) const = 0;
      17. +
    17. date_type operator*();
      18. +
    18. date_type * operator->();
      19. +
    19. bool operator<(const date_type & d);
      20. +
    20. bool operator<=(const date_type & d);
      21. +
    21. bool operator>(const date_type & d);
      22. +
    22. bool operator>=(const date_type & d);
      23. +
    23. bool operator==(const date_type & d);
      24. +
    24. bool operator!=(const date_type & d);
    diff --git a/doc/html/boost/date_time/date_names_put.html b/doc/html/boost/date_time/date_names_put.html index 98456e6f84..e3089f93c7 100644 --- a/doc/html/boost/date_time/date_names_put.html +++ b/doc/html/boost/date_time/date_names_put.html @@ -46,36 +46,36 @@ typedef charT char_type; // construct/copy/destruct - date_names_put(); + date_names_put(); - // public member functions - std::locale::id & __get_id(void) const; - void put_special_value(iter_type &, special_value_enum) const; - void put_month_short(iter_type &, month_enum) const; - void put_month_long(iter_type &, month_enum) const; - void put_weekday_short(iter_type &, weekday_enum) const; - void put_weekday_long(iter_type &, weekday_enum) const; - bool has_date_sep_chars() const; - void year_sep_char(iter_type &) const; - void month_sep_char(iter_type &) const; - void day_sep_char(iter_type &) const; - ymd_order_spec date_order() const; - month_format_spec month_format() const; + // public member functions + std::locale::id & __get_id(void) const; + void put_special_value(iter_type &, special_value_enum) const; + void put_month_short(iter_type &, month_enum) const; + void put_month_long(iter_type &, month_enum) const; + void put_weekday_short(iter_type &, weekday_enum) const; + void put_weekday_long(iter_type &, weekday_enum) const; + bool has_date_sep_chars() const; + void year_sep_char(iter_type &) const; + void month_sep_char(iter_type &) const; + void day_sep_char(iter_type &) const; + ymd_order_spec date_order() const; + month_format_spec month_format() const; - // protected member functions - virtual void do_put_month_short(iter_type &, month_enum) const; - virtual void do_put_month_long(iter_type &, month_enum) const; - virtual void do_put_special_value(iter_type &, special_value_enum) const; - virtual void do_put_weekday_short(iter_type &, weekday_enum) const; - virtual void do_put_weekday_long(iter_type &, weekday_enum) const; - virtual bool do_has_date_sep_chars() const; - virtual void do_year_sep_char(iter_type &) const; - virtual void do_month_sep_char(iter_type &) const; - virtual void do_day_sep_char(iter_type &) const; - virtual ymd_order_spec do_date_order() const; - virtual month_format_spec do_month_format() const; - void put_string(iter_type &, const charT *const) const; - void put_string(iter_type &, const string_type &) const; + // protected member functions + virtual void do_put_month_short(iter_type &, month_enum) const; + virtual void do_put_month_long(iter_type &, month_enum) const; + virtual void do_put_special_value(iter_type &, special_value_enum) const; + virtual void do_put_weekday_short(iter_type &, weekday_enum) const; + virtual void do_put_weekday_long(iter_type &, weekday_enum) const; + virtual bool do_has_date_sep_chars() const; + virtual void do_year_sep_char(iter_type &) const; + virtual void do_month_sep_char(iter_type &) const; + virtual void do_day_sep_char(iter_type &) const; + virtual ymd_order_spec do_date_order() const; + virtual month_format_spec do_month_format() const; + void put_string(iter_type &, const charT *const) const; + void put_string(iter_type &, const string_type &) const; // public data members static const char_type default_special_value_names; @@ -83,7 +83,7 @@ static std::locale::id id; // Generate storage location for a std::locale::id. };
    -

    Description

    +

    Description

    This class is a base class for date facets used to localize the names of months and the names of days in the week.

    Requirements of Config

      @@ -94,59 +94,59 @@

      (see langer & kreft p334).

      -

      +

      date_names_put public construct/copy/destruct

      -
      1. date_names_put();
      +
      1. date_names_put();
      -

      -date_names_put public member functions

      +

      +date_names_put public member functions

        -
      1. std::locale::id & __get_id(void) const;
        2. -
      2. void put_special_value(iter_type & oitr, special_value_enum sv) const;
        3. -
      3. void put_month_short(iter_type & oitr, month_enum moy) const;
        4. -
      4. void put_month_long(iter_type & oitr, month_enum moy) const;
        5. -
      5. void put_weekday_short(iter_type & oitr, weekday_enum wd) const;
        6. -
      6. void put_weekday_long(iter_type & oitr, weekday_enum wd) const;
        7. -
      7. bool has_date_sep_chars() const;
        8. -
      8. void year_sep_char(iter_type & oitr) const;
        9. +
      9. std::locale::id & __get_id(void) const;
        10. +
      10. void put_special_value(iter_type & oitr, special_value_enum sv) const;
        11. +
      11. void put_month_short(iter_type & oitr, month_enum moy) const;
        12. +
      12. void put_month_long(iter_type & oitr, month_enum moy) const;
        13. +
      13. void put_weekday_short(iter_type & oitr, weekday_enum wd) const;
        14. +
      14. void put_weekday_long(iter_type & oitr, weekday_enum wd) const;
        15. +
      15. bool has_date_sep_chars() const;
        16. +
      16. void year_sep_char(iter_type & oitr) const;
      17. -
        void month_sep_char(iter_type & oitr) const;
        char between year-month
        18. +
        void month_sep_char(iter_type & oitr) const;
        char between year-month
      18. -
        void day_sep_char(iter_type & oitr) const;
        Char to separate month-day.
        19. +
        void day_sep_char(iter_type & oitr) const;
        Char to separate month-day.
      19. -
        ymd_order_spec date_order() const;
        Determines the order to put the date elements.
        20. +
        ymd_order_spec date_order() const;
        Determines the order to put the date elements.
      20. -
        month_format_spec month_format() const;
        Determines if month is displayed as integer, short or long string.
        21. +
        month_format_spec month_format() const;
        Determines if month is displayed as integer, short or long string.
      -

      -date_names_put protected member functions

      +

      +date_names_put protected member functions

      1. -
        virtual void do_put_month_short(iter_type & oitr, month_enum moy) const;
        Default facet implementation uses month_type defaults.
        2. +
        virtual void do_put_month_short(iter_type & oitr, month_enum moy) const;
        Default facet implementation uses month_type defaults.
      2. -
        virtual void do_put_month_long(iter_type & oitr, month_enum moy) const;
        Default facet implementation uses month_type defaults.
        3. +
        virtual void do_put_month_long(iter_type & oitr, month_enum moy) const;
        Default facet implementation uses month_type defaults. 
      3. virtual void 
-do_put_special_value(iter_type & oitr, special_value_enum sv) const;
        Default facet implementation for special value types.
        4. -
      4. virtual void do_put_weekday_short(iter_type &, weekday_enum) const;
        5. -
      5. virtual void do_put_weekday_long(iter_type &, weekday_enum) const;
        6. -
      6. virtual bool do_has_date_sep_chars() const;
        7. -
      7. virtual void do_year_sep_char(iter_type & oitr) const;
        8. +do_put_special_value(iter_type & oitr, special_value_enum sv) const;Default facet implementation for special value types. +
      8. virtual void do_put_weekday_short(iter_type &, weekday_enum) const;
        9. +
      9. virtual void do_put_weekday_long(iter_type &, weekday_enum) const;
        10. +
      10. virtual bool do_has_date_sep_chars() const;
        11. +
      11. virtual void do_year_sep_char(iter_type & oitr) const;
      12. -
        virtual void do_month_sep_char(iter_type & oitr) const;
        char between year-month
        13. +
        virtual void do_month_sep_char(iter_type & oitr) const;
        char between year-month
      13. -
        virtual void do_day_sep_char(iter_type & oitr) const;
        Char to separate month-day.
        14. +
        virtual void do_day_sep_char(iter_type & oitr) const;
        Char to separate month-day.
      14. -
        virtual ymd_order_spec do_date_order() const;
        Default for date order.
        15. +
        virtual ymd_order_spec do_date_order() const;
        Default for date order.
      15. -
        virtual month_format_spec do_month_format() const;
        Default month format.
        16. -
      16. void put_string(iter_type & oi, const charT *const s) const;
        17. -
      17. void put_string(iter_type & oi, const string_type & s1) const;
        18. +
        virtual month_format_spec do_month_format() const;
        Default month format. +
      18. void put_string(iter_type & oi, const charT *const s) const;
        19. +
      19. void put_string(iter_type & oi, const string_type & s1) const;
    diff --git a/doc/html/boost/date_time/day_calc_dst_rule.html b/doc/html/boost/date_time/day_calc_dst_rule.html index c6567599f5..9569a67fa7 100644 --- a/doc/html/boost/date_time/day_calc_dst_rule.html +++ b/doc/html/boost/date_time/day_calc_dst_rule.html @@ -44,34 +44,34 @@ typedef spec::end_rule end_rule; // construct/copy/destruct - day_calc_dst_rule(start_rule, end_rule); + day_calc_dst_rule(start_rule, end_rule); - // public member functions - virtual date_type start_day(year_type) const; - virtual std::string start_rule_as_string() const; - virtual date_type end_day(year_type) const; - virtual std::string end_rule_as_string() const; + // public member functions + virtual date_type start_day(year_type) const; + virtual std::string start_rule_as_string() const; + virtual date_type end_day(year_type) const; + virtual std::string end_rule_as_string() const; };
    -

    Description

    +

    Description

    This class is used to generate specific sets of dst rules

    -

    +

    day_calc_dst_rule public construct/copy/destruct

    -
    1. day_calc_dst_rule(start_rule dst_start, end_rule dst_end);
    +
    1. day_calc_dst_rule(start_rule dst_start, end_rule dst_end);
    -

    -day_calc_dst_rule public member functions

    +

    +day_calc_dst_rule public member functions

      -
    1. virtual date_type start_day(year_type y) const;
      2. -
    2. virtual std::string start_rule_as_string() const;
      3. -
    3. virtual date_type end_day(year_type y) const;
      4. -
    4. virtual std::string end_rule_as_string() const;
      5. +
    5. virtual date_type start_day(year_type y) const;
      6. +
    6. virtual std::string start_rule_as_string() const;
      7. +
    7. virtual date_type end_day(year_type y) const;
      8. +
    8. virtual std::string end_rule_as_string() const;
    diff --git a/doc/html/boost/date_time/day_clock.html b/doc/html/boost/date_time/day_clock.html index 536934510f..d459b04215 100644 --- a/doc/html/boost/date_time/day_clock.html +++ b/doc/html/boost/date_time/day_clock.html @@ -38,39 +38,39 @@ // types typedef date_type::ymd_type ymd_type; - // public static functions - static date_type local_day(); - static date_type::ymd_type local_day_ymd(); - static date_type::ymd_type universal_day_ymd(); - static date_type universal_day(); + // public static functions + static date_type local_day(); + static date_type::ymd_type local_day_ymd(); + static date_type::ymd_type universal_day_ymd(); + static date_type universal_day(); - // private static functions - static ::std::tm * get_local_time(std::tm &); - static ::std::tm * get_universal_time(std::tm &); + // private static functions + static ::std::tm * get_local_time(std::tm &); + static ::std::tm * get_universal_time(std::tm &); };
    -

    Description

    +

    Description

    This clock uses Posix interfaces as its implementation and hence uses the timezone settings of the operating system. Incorrect user settings will result in incorrect results for the calls to local_day.

    -

    -day_clock public static functions

    +

    +day_clock public static functions

    1. -
      static date_type local_day();
      Get the local day as a date type.
      2. +
      static date_type local_day();
      Get the local day as a date type.
    2. -
      static date_type::ymd_type local_day_ymd();
      Get the local day as a ymd_type.
      3. +
      static date_type::ymd_type local_day_ymd();
      Get the local day as a ymd_type.
    3. -
      static date_type::ymd_type universal_day_ymd();
      Get the current day in universal date as a ymd_type.
      4. +
      static date_type::ymd_type universal_day_ymd();
      Get the current day in universal date as a ymd_type.
    4. -
      static date_type universal_day();
      Get the UTC day as a date type.
      5. +
      static date_type universal_day();
      Get the UTC day as a date type.
    -

    -day_clock private static functions

    +

    +day_clock private static functions

      -
    1. static ::std::tm * get_local_time(std::tm & result);
      2. -
    2. static ::std::tm * get_universal_time(std::tm & result);
      3. +
    3. static ::std::tm * get_local_time(std::tm & result);
      4. +
    4. static ::std::tm * get_universal_time(std::tm & result);
    diff --git a/doc/html/boost/date_time/day_functor.html b/doc/html/boost/date_time/day_functor.html index 95a1d565d6..4366b8ee97 100644 --- a/doc/html/boost/date_time/day_functor.html +++ b/doc/html/boost/date_time/day_functor.html @@ -39,27 +39,27 @@ typedef date_type::duration_type duration_type; // construct/copy/destruct - day_functor(int); + day_functor(int); - // public member functions - duration_type get_offset(const date_type &) const; - duration_type get_neg_offset(const date_type &) const; + // public member functions + duration_type get_offset(const date_type &) const; + duration_type get_neg_offset(const date_type &) const; };
    -

    Description

    +

    Description

    -

    +

    day_functor public construct/copy/destruct

    -
    1. day_functor(int f);
    +
    1. day_functor(int f);
    -

    -day_functor public member functions

    +

    +day_functor public member functions

      -
    1. duration_type get_offset(const date_type & d) const;
      2. -
    2. duration_type get_neg_offset(const date_type & d) const;
      3. +
    3. duration_type get_offset(const date_type & d) const;
      4. +
    4. duration_type get_neg_offset(const date_type & d) const;
    diff --git a/doc/html/boost/date_time/days_before_weekday.html b/doc/html/boost/date_time/days_before_weekday.html index 6dbd75fc17..8c29b3ede5 100644 --- a/doc/html/boost/date_time/days_before_weekday.html +++ b/doc/html/boost/date_time/days_before_weekday.html @@ -37,7 +37,7 @@ date_type::duration_type days_before_weekday(const date_type & d, const weekday_type & wd);
    -

    Description

    +

    Description

    Calculates the number of days since the previous weekday If the date given falls on a Sunday and the given weekday is Tuesday the result will be 5 days. The answer will be a positive number because Tuesday is 5 days before Sunday, not -5 days before.

    diff --git a/doc/html/boost/date_time/days_until_weekday.html b/doc/html/boost/date_time/days_until_weekday.html index 62de3ef6a3..9273e5def1 100644 --- a/doc/html/boost/date_time/days_until_weekday.html +++ b/doc/html/boost/date_time/days_until_weekday.html @@ -37,7 +37,7 @@ date_type::duration_type days_until_weekday(const date_type & d, const weekday_type & wd);
    -

    Description

    +

    Description

    Calculates the number of days until the next weekday. If the date given falls on a Sunday and the given weekday is Tuesday the result will be 2 days

    diff --git a/doc/html/boost/date_time/dst_adjustment_offsets.html b/doc/html/boost/date_time/dst_adjustment_offsets.html index 7c326c8bdc..cf85378fb6 100644 --- a/doc/html/boost/date_time/dst_adjustment_offsets.html +++ b/doc/html/boost/date_time/dst_adjustment_offsets.html @@ -36,7 +36,7 @@ class dst_adjustment_offsets { public: // construct/copy/destruct - dst_adjustment_offsets(const time_duration_type &, + dst_adjustment_offsets(const time_duration_type &, const time_duration_type &, const time_duration_type &); @@ -46,15 +46,15 @@ time_duration_type dst_end_offset_; // Time past midnight on end transition day that dst ends. };
    -

    Description

    +

    Description

    -

    +

    dst_adjustment_offsets public construct/copy/destruct

    -
    1. dst_adjustment_offsets(const time_duration_type & dst_adjust, 
+
      1. dst_adjustment_offsets(const time_duration_type & dst_adjust, 
                        const time_duration_type & dst_start_offset, 
                        const time_duration_type & dst_end_offset);
    diff --git a/doc/html/boost/date_time/dst_calc_engine.html b/doc/html/boost/date_time/dst_calc_engine.html index 23ce6daa58..b69d579d49 100644 --- a/doc/html/boost/date_time/dst_calc_engine.html +++ b/doc/html/boost/date_time/dst_calc_engine.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -40,30 +40,30 @@ typedef date_type::calendar_type calendar_type; typedef dst_calculator< date_type, time_duration_type > dstcalc; - // public static functions + // public static functions static time_is_dst_result - local_is_dst(const date_type &, const time_duration_type &); - static bool is_dst_boundary_day(date_type); - static time_duration_type dst_offset(); - static date_type local_dst_start_day(year_type); - static date_type local_dst_end_day(year_type); + local_is_dst(const date_type &, const time_duration_type &); + static bool is_dst_boundary_day(date_type); + static time_duration_type dst_offset(); + static date_type local_dst_start_day(year_type); + static date_type local_dst_end_day(year_type); };
    -

    Description

    +

    Description

    -

    -dst_calc_engine public static functions

    +

    +dst_calc_engine public static functions

    1. static time_is_dst_result 
-local_is_dst(const date_type & d, const time_duration_type & td);
      Calculates if the given local time is dst or not.

      Determines if the time is really in DST or not. Also checks for invalid and ambiguous. +local_is_dst(const date_type & d, const time_duration_type & td);Calculates if the given local time is dst or not.

      Determines if the time is really in DST or not. Also checks for invalid and ambiguous.

      2. -
    2. static bool is_dst_boundary_day(date_type d);
      3. +
    3. static bool is_dst_boundary_day(date_type d);
    4. -
      static time_duration_type dst_offset();
      The time of day for the dst transition (eg: typically 01:00:00 or 02:00:00)
      5. -
    5. static date_type local_dst_start_day(year_type year);
      6. -
    6. static date_type local_dst_end_day(year_type year);
      7. +
      static time_duration_type dst_offset();
      The time of day for the dst transition (eg: typically 01:00:00 or 02:00:00) +
    7. static date_type local_dst_start_day(year_type year);
      8. +
    8. static date_type local_dst_end_day(year_type year);
    @@ -76,7 +76,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/date_time/dst_calculator.html b/doc/html/boost/date_time/dst_calculator.html index 270f461ba3..2b3df3e23b 100644 --- a/doc/html/boost/date_time/dst_calculator.html +++ b/doc/html/boost/date_time/dst_calculator.html @@ -39,30 +39,30 @@ typedef time_duration_type_ time_duration_type; typedef date_type_ date_type; - // public static functions + // public static functions static time_is_dst_result - process_local_dst_start_day(const time_duration_type &, unsigned int, long); + process_local_dst_start_day(const time_duration_type &, unsigned int, long); static time_is_dst_result - process_local_dst_end_day(const time_duration_type &, unsigned int, long); + process_local_dst_end_day(const time_duration_type &, unsigned int, long); static time_is_dst_result - local_is_dst(const date_type &, const time_duration_type &, + local_is_dst(const date_type &, const time_duration_type &, const date_type &, const time_duration_type &, const date_type &, const time_duration_type &, const time_duration_type &); static time_is_dst_result - local_is_dst(const date_type &, const time_duration_type &, + local_is_dst(const date_type &, const time_duration_type &, const date_type &, unsigned int, const date_type &, unsigned int, long); };
    -

    Description

    +

    Description

    -

    -dst_calculator public static functions

    +

    +dst_calculator public static functions

    1. static time_is_dst_result 
-process_local_dst_start_day(const time_duration_type & time_of_day, 
+process_local_dst_start_day(const time_duration_type & time_of_day, 
                             unsigned int dst_start_offset_minutes, 
                             long dst_length_minutes);
      Check the local time offset when on dst start day.

      On this dst transition, the time label between the transition boundary and the boudary + the offset are invalid times. If before the boundary then still not in dst. @@ -99,7 +99,7 @@ 

    2. static time_is_dst_result 
-process_local_dst_end_day(const time_duration_type & time_of_day, 
+process_local_dst_end_day(const time_duration_type & time_of_day, 
                           unsigned int dst_end_offset_minutes, 
                           long dst_length_minutes);
      Check the local time offset when on the last day of dst.

      This is the calculation for the DST end day. On that day times prior to the conversion time - dst_length (1 am in US) are still in dst. Times between the above and the switch time are ambiguous. Times after the start_offset are not in dst. @@ -132,7 +132,7 @@ 

    3. static time_is_dst_result 
-local_is_dst(const date_type & current_day, 
+local_is_dst(const date_type & current_day, 
              const time_duration_type & time_of_day, 
              const date_type & dst_start_day, 
              const time_duration_type & dst_start_offset, 
@@ -185,7 +185,7 @@
 
    4. static time_is_dst_result 
-local_is_dst(const date_type & current_day, 
+local_is_dst(const date_type & current_day, 
              const time_duration_type & time_of_day, 
              const date_type & dst_start_day, 
              unsigned int dst_start_offset_minutes, 
diff --git a/doc/html/boost/date_time/dst_day_calc_rule.html b/doc/html/boost/date_time/dst_day_calc_rule.html
index 286ef77ae2..caecf0c77c 100644
--- a/doc/html/boost/date_time/dst_day_calc_rule.html
+++ b/doc/html/boost/date_time/dst_day_calc_rule.html
@@ -39,31 +39,31 @@
   typedef date_type::year_type year_type;
 
   // construct/copy/destruct
-  ~dst_day_calc_rule();
+  ~dst_day_calc_rule();
 
-  // public member functions
-  virtual date_type start_day(year_type) const = 0;
-  virtual std::string start_rule_as_string() const = 0;
-  virtual date_type end_day(year_type) const = 0;
-  virtual std::string end_rule_as_string() const = 0;
+  // public member functions
+  virtual date_type start_day(year_type) const = 0;
+  virtual std::string start_rule_as_string() const = 0;
+  virtual date_type end_day(year_type) const = 0;
+  virtual std::string end_rule_as_string() const = 0;
 };
    -

    Description

    +

    Description

    -

    +

    dst_day_calc_rule public construct/copy/destruct

    -
    1. ~dst_day_calc_rule();
    +
    1. ~dst_day_calc_rule();
    -

    -dst_day_calc_rule public member functions

    +

    +dst_day_calc_rule public member functions

      -
    1. virtual date_type start_day(year_type y) const = 0;
      2. -
    2. virtual std::string start_rule_as_string() const = 0;
      3. -
    3. virtual date_type end_day(year_type y) const = 0;
      4. -
    4. virtual std::string end_rule_as_string() const = 0;
      5. +
    5. virtual date_type start_day(year_type y) const = 0;
      6. +
    6. virtual std::string start_rule_as_string() const = 0;
      7. +
    7. virtual date_type end_day(year_type y) const = 0;
      8. +
    8. virtual std::string end_rule_as_string() const = 0;
    diff --git a/doc/html/boost/date_time/duration_traits_adapted.html b/doc/html/boost/date_time/duration_traits_adapted.html index 66f7a8034f..e56fd065f2 100644 --- a/doc/html/boost/date_time/duration_traits_adapted.html +++ b/doc/html/boost/date_time/duration_traits_adapted.html @@ -38,16 +38,16 @@ typedef long int_type; typedef boost::date_time::int_adapter< long > impl_type; - // public static functions - static int_type as_number(impl_type); + // public static functions + static int_type as_number(impl_type); };
    -

    Description

    +

    Description

    Struct for instantiating date_duration WITH special values functionality. Allows for transparent implementation of either date_duration<long> or date_duration<int_adapter<long> >

    -

    -duration_traits_adapted public static functions

    -
    1. static int_type as_number(impl_type i);
    +

    +duration_traits_adapted public static functions

    +
    1. static int_type as_number(impl_type i);
    diff --git a/doc/html/boost/date_time/duration_traits_long.html b/doc/html/boost/date_time/duration_traits_long.html index 772b9eaa36..e729ab6ad2 100644 --- a/doc/html/boost/date_time/duration_traits_long.html +++ b/doc/html/boost/date_time/duration_traits_long.html @@ -38,16 +38,16 @@ typedef long int_type; typedef long impl_type; - // public static functions - static int_type as_number(impl_type); + // public static functions + static int_type as_number(impl_type); };
    -

    Description

    +

    Description

    Struct for instantiating date_duration with NO special values functionality. Allows for transparent implementation of either date_duration<long> or date_duration<int_adapter<long> >

    -

    -duration_traits_long public static functions

    -
    1. static int_type as_number(impl_type i);
    +

    +duration_traits_long public static functions

    +
    1. static int_type as_number(impl_type i);
    diff --git a/doc/html/boost/date_time/dynamic__idm45507110490096.html b/doc/html/boost/date_time/dynamic__idm45507110490096.html new file mode 100644 index 0000000000..ba92f68d52 --- /dev/null +++ b/doc/html/boost/date_time/dynamic__idm45507110490096.html @@ -0,0 +1,76 @@ + + + + +Class template dynamic_local_time_adjustor + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Class template dynamic_local_time_adjustor

    +

    boost::date_time::dynamic_local_time_adjustor — Allow sliding utc adjustment with fixed dst rules.

    +
    +

    Synopsis

    +
    // In header: <boost/date_time/local_time_adjustor.hpp>
+
+template<typename time_type, typename dst_rules> 
+class dynamic_local_time_adjustor : public dst_rules {
+public:
+  // types
+  typedef time_type::time_duration_type time_duration_type;
+  typedef time_type::date_type          date_type;         
+
+  // construct/copy/destruct
+  dynamic_local_time_adjustor(time_duration_type);
+
+  // public member functions
+  time_duration_type utc_offset(bool);
+};
    +
    +

    Description

    +
    +

    +dynamic_local_time_adjustor + public + construct/copy/destruct

    +
    1. dynamic_local_time_adjustor(time_duration_type utc_offset);
    +
    +
    +

    +dynamic_local_time_adjustor public member functions

    +
    1. +
      time_duration_type utc_offset(bool is_dst);
      Presumes local time.
    +
    +
    +
    + + + +
    Copyright © 2001-2005 CrystalClear Software, Inc

    Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/date_time/dynamic_local_idp103052208.html b/doc/html/boost/date_time/dynamic_local_idp103052208.html deleted file mode 100644 index 300bc30623..0000000000 --- a/doc/html/boost/date_time/dynamic_local_idp103052208.html +++ /dev/null @@ -1,76 +0,0 @@ - - - - -Class template dynamic_local_time_adjustor - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Class template dynamic_local_time_adjustor

    -

    boost::date_time::dynamic_local_time_adjustor — Allow sliding utc adjustment with fixed dst rules.

    -
    -

    Synopsis

    -
    // In header: <boost/date_time/local_time_adjustor.hpp>
-
-template<typename time_type, typename dst_rules> 
-class dynamic_local_time_adjustor : public dst_rules {
-public:
-  // types
-  typedef time_type::time_duration_type time_duration_type;
-  typedef time_type::date_type          date_type;         
-
-  // construct/copy/destruct
-  dynamic_local_time_adjustor(time_duration_type);
-
-  // public member functions
-  time_duration_type utc_offset(bool);
-};
    -
    -

    Description

    -
    -

    -dynamic_local_time_adjustor - public - construct/copy/destruct

    -
    1. dynamic_local_time_adjustor(time_duration_type utc_offset);
    -
    -
    -

    -dynamic_local_time_adjustor public member functions

    -
    1. -
      time_duration_type utc_offset(bool is_dst);
      Presumes local time.
    -
    -
    -
    - - - -
    Copyright © 2001-2005 CrystalClear Software, Inc

    Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/date_time/eu_dst_trait.html b/doc/html/boost/date_time/eu_dst_trait.html index 13f4eccdcc..8edc1f3d2d 100644 --- a/doc/html/boost/date_time/eu_dst_trait.html +++ b/doc/html/boost/date_time/eu_dst_trait.html @@ -41,19 +41,19 @@ typedef date_time::last_kday_of_month< date_type > start_rule_functor; typedef date_time::last_kday_of_month< date_type > end_rule_functor; - // public static functions - static day_of_week_type start_day(year_type); - static month_type start_month(year_type); - static day_of_week_type end_day(year_type); - static month_type end_month(year_type); - static int dst_start_offset_minutes(); - static int dst_end_offset_minutes(); - static int dst_shift_length_minutes(); - static date_type local_dst_start_day(year_type); - static date_type local_dst_end_day(year_type); + // public static functions + static day_of_week_type start_day(year_type); + static month_type start_month(year_type); + static day_of_week_type end_day(year_type); + static month_type end_month(year_type); + static int dst_start_offset_minutes(); + static int dst_end_offset_minutes(); + static int dst_shift_length_minutes(); + static date_type local_dst_start_day(year_type); + static date_type local_dst_end_day(year_type); };
    -

    Description

    +

    Description

    These amount to the following:

    • Start of dst day is last Sunday in March

      • @@ -65,18 +65,18 @@

      -

      -eu_dst_trait public static functions

      +

      +eu_dst_trait public static functions

        -
      1. static day_of_week_type start_day(year_type);
        2. -
      2. static month_type start_month(year_type);
        3. -
      3. static day_of_week_type end_day(year_type);
        4. -
      4. static month_type end_month(year_type);
        5. -
      5. static int dst_start_offset_minutes();
        6. -
      6. static int dst_end_offset_minutes();
        7. -
      7. static int dst_shift_length_minutes();
        8. -
      8. static date_type local_dst_start_day(year_type year);
        9. -
      9. static date_type local_dst_end_day(year_type year);
        10. +
      10. static day_of_week_type start_day(year_type);
        11. +
      11. static month_type start_month(year_type);
        12. +
      12. static day_of_week_type end_day(year_type);
        13. +
      13. static month_type end_month(year_type);
        14. +
      14. static int dst_start_offset_minutes();
        15. +
      15. static int dst_end_offset_minutes();
        16. +
      16. static int dst_shift_length_minutes();
        17. +
      17. static date_type local_dst_start_day(year_type year);
        18. +
      18. static date_type local_dst_end_day(year_type year);
    diff --git a/doc/html/boost/date_time/find_match.html b/doc/html/boost/date_time/find_match.html index 3b9c1df8ba..654207ebc6 100644 --- a/doc/html/boost/date_time/find_match.html +++ b/doc/html/boost/date_time/find_match.html @@ -38,7 +38,7 @@ const charT *const * long_names, short size, const std::basic_string< charT > & s);
    -

    Description

    +

    Description

    find_match searches both arrays for a match to 's'. Both arrays must contain 'size' elements. The index of the match is returned. If no match is found, 'size' is returned. Ex. "Jan" returns 0, "Dec" returns 11, "Tue" returns 2. 'size' can be sent in with: (greg_month::max)() (which 12), (greg_weekday::max)() + 1 (which is 7) or date_time::NumSpecialValues

    diff --git a/doc/html/boost/date_time/first_kday_after.html b/doc/html/boost/date_time/first_kday_after.html index c0f15ffd6c..8f4cd6c008 100644 --- a/doc/html/boost/date_time/first_kday_after.html +++ b/doc/html/boost/date_time/first_kday_after.html @@ -41,14 +41,14 @@ typedef date_type::duration_type duration_type; // construct/copy/destruct - first_kday_after(day_of_week_type); + first_kday_after(day_of_week_type); - // public member functions - date_type get_date(date_type) const; - day_of_week_type day_of_week() const; + // public member functions + date_type get_date(date_type) const; + day_of_week_type day_of_week() const; };
    -

    Description

    +

    Description

    Date generator that takes a date and finds kday after 

    typedef boost::date_time::first_kday_after<date> firstkdayafter;
 firstkdayafter fkaf(Monday);
@@ -56,19 +56,19 @@

    -

    +

    first_kday_after public construct/copy/destruct

    -
    1. first_kday_after(day_of_week_type dow);
    +
    1. first_kday_after(day_of_week_type dow);
    -

    -first_kday_after public member functions

    +

    +first_kday_after public member functions

    1. -
      date_type get_date(date_type start_day) const;
      Return next kday given.
      2. -
    2. day_of_week_type day_of_week() const;
      3. +
      date_type get_date(date_type start_day) const;
      Return next kday given. +
    3. day_of_week_type day_of_week() const;
    diff --git a/doc/html/boost/date_time/first_kday_before.html b/doc/html/boost/date_time/first_kday_before.html index c309d578da..9be9e29055 100644 --- a/doc/html/boost/date_time/first_kday_before.html +++ b/doc/html/boost/date_time/first_kday_before.html @@ -41,14 +41,14 @@ typedef date_type::duration_type duration_type; // construct/copy/destruct - first_kday_before(day_of_week_type); + first_kday_before(day_of_week_type); - // public member functions - date_type get_date(date_type) const; - day_of_week_type day_of_week() const; + // public member functions + date_type get_date(date_type) const; + day_of_week_type day_of_week() const; };
    -

    Description

    +

    Description

    Date generator that takes a date and finds kday after 

    typedef boost::date_time::first_kday_before<date> firstkdaybefore;
 firstkdaybefore fkbf(Monday);
@@ -56,19 +56,19 @@

    -

    +

    first_kday_before public construct/copy/destruct

    -
    1. first_kday_before(day_of_week_type dow);
    +
    1. first_kday_before(day_of_week_type dow);
    -

    -first_kday_before public member functions

    +

    +first_kday_before public member functions

    1. -
      date_type get_date(date_type start_day) const;
      Return next kday given.
      2. -
    2. day_of_week_type day_of_week() const;
      3. +
      date_type get_date(date_type start_day) const;
      Return next kday given. +
    3. day_of_week_type day_of_week() const;
    diff --git a/doc/html/boost/date_time/first_kday_of_month.html b/doc/html/boost/date_time/first_kday_of_month.html index 79f2a9d1dc..5829de0ec7 100644 --- a/doc/html/boost/date_time/first_kday_of_month.html +++ b/doc/html/boost/date_time/first_kday_of_month.html @@ -45,24 +45,24 @@ typedef date_type::duration_type duration_type; // construct/copy/destruct - first_kday_of_month(day_of_week_type, month_type); + first_kday_of_month(day_of_week_type, month_type); - // public member functions - virtual date_type get_date(year_type) const; - month_type month() const; - day_of_week_type day_of_week() const; - virtual std::string to_string() const; + // public member functions + virtual date_type get_date(year_type) const; + month_type month() const; + day_of_week_type day_of_week() const; + virtual std::string to_string() const; };
    -

    Description

    +

    Description

    Similar to nth_kday_of_month, but requires less paramters

    -

    +

    first_kday_of_month public construct/copy/destruct

    1. -
      first_kday_of_month(day_of_week_type dow, month_type m);
      Specify the first 'Sunday' in 'April' spec.

      +

      first_kday_of_month(day_of_week_type dow, month_type m);
      Specify the first 'Sunday' in 'April' spec.

      @@ -92,15 +92,15 @@
      -

      -first_kday_of_month public member functions

      +

      +first_kday_of_month public member functions

      1. -
        virtual date_type get_date(year_type year) const;
        Return a concrete date when provided with a year specific year.
        2. -
      2. month_type month() const;
        3. -
      3. day_of_week_type day_of_week() const;
        4. +
        virtual date_type get_date(year_type year) const;
        Return a concrete date when provided with a year specific year. +
      4. month_type month() const;
        5. +
      5. day_of_week_type day_of_week() const;
      6. -
        virtual std::string to_string() const;
        Returns string suitable for use in POSIX time zone string.

        Returns a string formatted as "M4.1.0" ==> 1st Sunday in April.

        +
        virtual std::string to_string() const;
        Returns string suitable for use in POSIX time zone string.

        Returns a string formatted as "M4.1.0" ==> 1st Sunday in April.

      diff --git a/doc/html/boost/date_time/fixed_st_idm45507094246048.html b/doc/html/boost/date_time/fixed_st_idm45507094246048.html new file mode 100644 index 0000000000..cdf82a5ade --- /dev/null +++ b/doc/html/boost/date_time/fixed_st_idm45507094246048.html @@ -0,0 +1,57 @@ + + + + +Function template fixed_string_to_int + + + + + + + + +
      + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Function template fixed_string_to_int

      +

      boost::date_time::fixed_string_to_int — Helper function for parsing fixed length strings into integers.

      +
      +

      Synopsis

      +
      // In header: <boost/date_time/format_date_parser.hpp>
+
+
+template<typename int_type, typename charT> 
+  int_type fixed_string_to_int(std::istreambuf_iterator< charT > & itr, 
+                               std::istreambuf_iterator< charT > & stream_end, 
+                               parse_match_result< charT > & mr, 
+                               unsigned int length);
      +
      +

      Description

      +

      Will consume 'length' number of characters from stream. Consumed character are transfered to parse_match_result struct. Returns '-1' if no number can be parsed or incorrect number of digits in stream.

      +
      +
      + + + +
      Copyright © 2001-2005 CrystalClear Software, Inc

      Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/date_time/fixed_st_idm45507095938400.html b/doc/html/boost/date_time/fixed_st_idm45507095938400.html new file mode 100644 index 0000000000..c5bfd6ee9c --- /dev/null +++ b/doc/html/boost/date_time/fixed_st_idm45507095938400.html @@ -0,0 +1,57 @@ + + + + +Function template fixed_string_to_int + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Function template fixed_string_to_int

      +

      boost::date_time::fixed_string_to_int — Helper function for parsing fixed length strings into integers.

      +
      +

      Synopsis

      +
      // In header: <boost/date_time/format_date_parser.hpp>
+
+
+template<typename int_type, typename charT> 
+  int_type fixed_string_to_int(std::istreambuf_iterator< charT > & itr, 
+                               std::istreambuf_iterator< charT > & stream_end, 
+                               parse_match_result< charT > & mr, 
+                               unsigned int length, const charT & fill_char);
      +
      +

      Description

      +

      Will consume 'length' number of characters from stream. Consumed character are transfered to parse_match_result struct. Returns '-1' if no number can be parsed or incorrect number of digits in stream.

      +
      +
      + + + +
      Copyright © 2001-2005 CrystalClear Software, Inc

      Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/date_time/fixed_string__idp103198160.html b/doc/html/boost/date_time/fixed_string__idp103198160.html deleted file mode 100644 index 13b2d150b6..0000000000 --- a/doc/html/boost/date_time/fixed_string__idp103198160.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function template fixed_string_to_int - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Function template fixed_string_to_int

      -

      boost::date_time::fixed_string_to_int — Helper function for parsing fixed length strings into integers.

      -
      -

      Synopsis

      -
      // In header: <boost/date_time/format_date_parser.hpp>
-
-
-template<typename int_type, typename charT> 
-  int_type fixed_string_to_int(std::istreambuf_iterator< charT > & itr, 
-                               std::istreambuf_iterator< charT > & stream_end, 
-                               parse_match_result< charT > & mr, 
-                               unsigned int length);
      -
      -

      Description

      -

      Will consume 'length' number of characters from stream. Consumed character are transfered to parse_match_result struct. Returns '-1' if no number can be parsed or incorrect number of digits in stream.

      -
      -
      - - - -
      Copyright © 2001-2005 CrystalClear Software, Inc

      Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/date_time/fixed_string_t_idp96468336.html b/doc/html/boost/date_time/fixed_string_t_idp96468336.html deleted file mode 100644 index 5242122aab..0000000000 --- a/doc/html/boost/date_time/fixed_string_t_idp96468336.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function template fixed_string_to_int - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Function template fixed_string_to_int

      -

      boost::date_time::fixed_string_to_int — Helper function for parsing fixed length strings into integers.

      -
      -

      Synopsis

      -
      // In header: <boost/date_time/format_date_parser.hpp>
-
-
-template<typename int_type, typename charT> 
-  int_type fixed_string_to_int(std::istreambuf_iterator< charT > & itr, 
-                               std::istreambuf_iterator< charT > & stream_end, 
-                               parse_match_result< charT > & mr, 
-                               unsigned int length, const charT & fill_char);
      -
      -

      Description

      -

      Will consume 'length' number of characters from stream. Consumed character are transfered to parse_match_result struct. Returns '-1' if no number can be parsed or incorrect number of digits in stream.

      -
      -
      - - - -
      Copyright © 2001-2005 CrystalClear Software, Inc

      Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/date_time/format_date_parser.html b/doc/html/boost/date_time/format_date_parser.html index c8609418b1..e0957265d9 100644 --- a/doc/html/boost/date_time/format_date_parser.html +++ b/doc/html/boost/date_time/format_date_parser.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      @@ -51,52 +51,52 @@ typedef std::vector< std::basic_string< charT > > input_collection_type; // construct/copy/destruct - format_date_parser(const string_type &, const input_collection_type &, + format_date_parser(const string_type &, const input_collection_type &, const input_collection_type &, const input_collection_type &, const input_collection_type &); - format_date_parser(const string_type &, const std::locale &); - format_date_parser(const format_date_parser< date_type, charT > &); + format_date_parser(const string_type &, const std::locale &); + format_date_parser(const format_date_parser< date_type, charT > &); - // public member functions - string_type format() const; - void format(string_type); - void short_month_names(const input_collection_type &); - void long_month_names(const input_collection_type &); - void short_weekday_names(const input_collection_type &); - void long_weekday_names(const input_collection_type &); - date_type parse_date(const string_type &, const string_type &, + // public member functions + string_type format() const; + void format(string_type); + void short_month_names(const input_collection_type &); + void long_month_names(const input_collection_type &); + void short_weekday_names(const input_collection_type &); + void long_weekday_names(const input_collection_type &); + date_type parse_date(const string_type &, const string_type &, const special_values_parser< date_type, charT > &) const; - date_type parse_date(std::istreambuf_iterator< charT > &, + date_type parse_date(std::istreambuf_iterator< charT > &, std::istreambuf_iterator< charT > &, const special_values_parser< date_type, charT > &) const; - date_type parse_date(std::istreambuf_iterator< charT > &, + date_type parse_date(std::istreambuf_iterator< charT > &, std::istreambuf_iterator< charT > &, string_type, const special_values_parser< date_type, charT > &) const; - month_type parse_month(std::istreambuf_iterator< charT > &, + month_type parse_month(std::istreambuf_iterator< charT > &, std::istreambuf_iterator< charT > &, string_type) const; - month_type parse_month(std::istreambuf_iterator< charT > &, + month_type parse_month(std::istreambuf_iterator< charT > &, std::istreambuf_iterator< charT > &, string_type, match_results &) const; - day_type parse_var_day_of_month(std::istreambuf_iterator< charT > &, + day_type parse_var_day_of_month(std::istreambuf_iterator< charT > &, std::istreambuf_iterator< charT > &) const; - day_type parse_day_of_month(std::istreambuf_iterator< charT > &, + day_type parse_day_of_month(std::istreambuf_iterator< charT > &, std::istreambuf_iterator< charT > &) const; day_of_week_type - parse_weekday(std::istreambuf_iterator< charT > &, + parse_weekday(std::istreambuf_iterator< charT > &, std::istreambuf_iterator< charT > &, string_type) const; day_of_week_type - parse_weekday(std::istreambuf_iterator< charT > &, + parse_weekday(std::istreambuf_iterator< charT > &, std::istreambuf_iterator< charT > &, string_type, match_results &) const; - year_type parse_year(std::istreambuf_iterator< charT > &, + year_type parse_year(std::istreambuf_iterator< charT > &, std::istreambuf_iterator< charT > &, string_type) const; - year_type parse_year(std::istreambuf_iterator< charT > &, + year_type parse_year(std::istreambuf_iterator< charT > &, std::istreambuf_iterator< charT > &, string_type, match_results &) const; };
      -

      Description

      +

      Description

      The following is the set of recognized format specifiers

      • a - Short weekday name

        • @@ -119,71 +119,71 @@

        todo <ndash></ndash> Another interesting feature that this approach could provide is an option to fill in any missing fields with the current values from the clock. So if you have m-d the parser would detect the missing year value and fill it in using the clock.

        todo <ndash></ndash> What to do with the x. x in the classic facet is just bad...

        -

        +

        format_date_parser public construct/copy/destruct

          -
        1. format_date_parser(const string_type & format_str, 
+
        2. format_date_parser(const string_type & format_str, 
                    const input_collection_type & month_short_names, 
                    const input_collection_type & month_long_names, 
                    const input_collection_type & weekday_short_names, 
                    const input_collection_type & weekday_long_names);
          3. 
-
        3. format_date_parser(const string_type & format_str, const std::locale & locale);
          4. 
-
        4. format_date_parser(const format_date_parser< date_type, charT > & fdp);
          5. 
+
        5. format_date_parser(const string_type & format_str, const std::locale & locale);
          6. 
+
        6. format_date_parser(const format_date_parser< date_type, charT > & fdp);
          7.
        -

        -format_date_parser public member functions

        +

        +format_date_parser public member functions

          -
        1. string_type format() const;
          2. -
        2. void format(string_type format_str);
          3. -
        3. void short_month_names(const input_collection_type & month_names);
          4. -
        4. void long_month_names(const input_collection_type & month_names);
          5. -
        5. void short_weekday_names(const input_collection_type & weekday_names);
          6. -
        6. void long_weekday_names(const input_collection_type & weekday_names);
          7. -
        7. date_type parse_date(const string_type & value, 
+
        8. string_type format() const;
          9. 
+
        9. void format(string_type format_str);
          10. 
+
        10. void short_month_names(const input_collection_type & month_names);
          11. 
+
        11. void long_month_names(const input_collection_type & month_names);
          12. 
+
        12. void short_weekday_names(const input_collection_type & weekday_names);
          13. 
+
        13. void long_weekday_names(const input_collection_type & weekday_names);
          14. 
+
        14. date_type parse_date(const string_type & value, 
                      const string_type & format_str, 
                      const special_values_parser< date_type, charT > & sv_parser) const;
          15. 
-
        15. date_type parse_date(std::istreambuf_iterator< charT > & sitr, 
+
        16. date_type parse_date(std::istreambuf_iterator< charT > & sitr, 
                      std::istreambuf_iterator< charT > & stream_end, 
                      const special_values_parser< date_type, charT > & sv_parser) const;
          17. 
 
        17. 
-
          date_type parse_date(std::istreambuf_iterator< charT > & sitr, 
+
          date_type parse_date(std::istreambuf_iterator< charT > & sitr, 
                      std::istreambuf_iterator< charT > & stream_end, 
                      string_type format_str, 
                      const special_values_parser< date_type, charT > & sv_parser) const;
          
 
          Of all the objects that the format_date_parser can parse, only a date can be a special value. Therefore, only parse_date checks for special_values. 
          
 
          18. 
 
        18. 
-
          month_type parse_month(std::istreambuf_iterator< charT > & sitr, 
+
          month_type parse_month(std::istreambuf_iterator< charT > & sitr, 
                        std::istreambuf_iterator< charT > & stream_end, 
                        string_type format_str) const;
          Throws bad_month if unable to parse. 
          19. 
 
        19. 
-
          month_type parse_month(std::istreambuf_iterator< charT > & sitr, 
+
          month_type parse_month(std::istreambuf_iterator< charT > & sitr, 
                        std::istreambuf_iterator< charT > & stream_end, 
                        string_type format_str, match_results & mr) const;
          Throws bad_month if unable to parse. 
          20. 
 
        20. 
-
          day_type parse_var_day_of_month(std::istreambuf_iterator< charT > & sitr, 
+
          day_type parse_var_day_of_month(std::istreambuf_iterator< charT > & sitr, 
                                 std::istreambuf_iterator< charT > & stream_end) const;
          Expects 1 or 2 digits 1-31. Throws bad_day_of_month if unable to parse. 
          21. 
 
        21. 
-
          day_type parse_day_of_month(std::istreambuf_iterator< charT > & sitr, 
+
          day_type parse_day_of_month(std::istreambuf_iterator< charT > & sitr, 
                             std::istreambuf_iterator< charT > & stream_end) const;
          Expects 2 digits 01-31. Throws bad_day_of_month if unable to parse. 
          22. 
 
        22. day_of_week_type 
-parse_weekday(std::istreambuf_iterator< charT > & sitr, 
+parse_weekday(std::istreambuf_iterator< charT > & sitr, 
               std::istreambuf_iterator< charT > & stream_end, 
               string_type format_str) const;
          23. 
 
        23. day_of_week_type 
-parse_weekday(std::istreambuf_iterator< charT > & sitr, 
+parse_weekday(std::istreambuf_iterator< charT > & sitr, 
               std::istreambuf_iterator< charT > & stream_end, 
               string_type format_str, match_results & mr) const;
          24. 
 
        24. 
-
          year_type parse_year(std::istreambuf_iterator< charT > & sitr, 
+
          year_type parse_year(std::istreambuf_iterator< charT > & sitr, 
                      std::istreambuf_iterator< charT > & stream_end, 
                      string_type format_str) const;
          throws bad_year if unable to parse 
          25. 
 
        25. 
-
          year_type parse_year(std::istreambuf_iterator< charT > & sitr, 
+
          year_type parse_year(std::istreambuf_iterator< charT > & sitr, 
                      std::istreambuf_iterator< charT > & stream_end, 
                      string_type format_str, match_results & mr) const;
          throws bad_year if unable to parse 
          26.
        @@ -198,7 +198,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/date_time/from_str_idm45507086264992.html b/doc/html/boost/date_time/from_str_idm45507086264992.html new file mode 100644 index 0000000000..569a139e6e --- /dev/null +++ b/doc/html/boost/date_time/from_str_idm45507086264992.html @@ -0,0 +1,55 @@ + + + + +Function template from_stream_type + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template from_stream_type

    +

    boost::date_time::from_stream_type — Helper function for 'date gregorian::from_stream()'.

    +
    +

    Synopsis

    +
    // In header: <boost/date_time/date_parsing.hpp>
+
+
+template<typename date_type, typename iterator_type> 
+  date_type from_stream_type(iterator_type & beg, iterator_type const & end, 
+                             wchar_t);
    +
    +

    Description

    +

    Creates a string from the iterators that reference the begining & end of a wstring. All elements are used in output string

    +
    +
    + + + +
    Copyright © 2001-2005 CrystalClear Software, Inc

    Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/date_time/from_str_idm45507108860000.html b/doc/html/boost/date_time/from_str_idm45507108860000.html new file mode 100644 index 0000000000..d42766d4b0 --- /dev/null +++ b/doc/html/boost/date_time/from_str_idm45507108860000.html @@ -0,0 +1,55 @@ + + + + +Function template from_stream_type + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template from_stream_type

    +

    boost::date_time::from_stream_type — Helper function for 'date gregorian::from_stream()'.

    +
    +

    Synopsis

    +
    // In header: <boost/date_time/date_parsing.hpp>
+
+
+template<typename date_type, typename iterator_type> 
+  date_type from_stream_type(iterator_type & beg, iterator_type const &, 
+                             std::string const &);
    +
    +

    Description

    +

    Returns the first string found in the stream referenced by the begining & end iterators

    +
    +
    + + + +
    Copyright © 2001-2005 CrystalClear Software, Inc

    Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/date_time/from_str_idm45507110254160.html b/doc/html/boost/date_time/from_str_idm45507110254160.html new file mode 100644 index 0000000000..94b9fbecad --- /dev/null +++ b/doc/html/boost/date_time/from_str_idm45507110254160.html @@ -0,0 +1,55 @@ + + + + +Function template from_stream_type + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template from_stream_type

    +

    boost::date_time::from_stream_type — Helper function for 'date gregorian::from_stream()'.

    +
    +

    Synopsis

    +
    // In header: <boost/date_time/date_parsing.hpp>
+
+
+template<typename date_type, typename iterator_type> 
+  date_type from_stream_type(iterator_type & beg, iterator_type const & end, 
+                             char);
    +
    +

    Description

    +

    Creates a string from the iterators that reference the begining & end of a char[] or string. All elements are used in output string

    +
    +
    + + + +
    Copyright © 2001-2005 CrystalClear Software, Inc

    Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/date_time/from_str_idm45507131471248.html b/doc/html/boost/date_time/from_str_idm45507131471248.html new file mode 100644 index 0000000000..8c8da99eda --- /dev/null +++ b/doc/html/boost/date_time/from_str_idm45507131471248.html @@ -0,0 +1,55 @@ + + + + +Function template from_stream_type + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template from_stream_type

    +

    boost::date_time::from_stream_type — Helper function for 'date gregorian::from_stream()'.

    +
    +

    Synopsis

    +
    // In header: <boost/date_time/date_parsing.hpp>
+
+
+template<typename date_type, typename iterator_type> 
+  date_type from_stream_type(iterator_type & beg, iterator_type const &, 
+                             std::wstring const &);
    +
    +

    Description

    +

    Creates a string from the first wstring found in the stream referenced by the begining & end iterators

    +
    +
    + + + +
    Copyright © 2001-2005 CrystalClear Software, Inc

    Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/date_time/from_stream_t_idp102084000.html b/doc/html/boost/date_time/from_stream_t_idp102084000.html deleted file mode 100644 index 3631d5d7c6..0000000000 --- a/doc/html/boost/date_time/from_stream_t_idp102084000.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Function template from_stream_type - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template from_stream_type

    -

    boost::date_time::from_stream_type — Helper function for 'date gregorian::from_stream()'.

    -
    -

    Synopsis

    -
    // In header: <boost/date_time/date_parsing.hpp>
-
-
-template<typename date_type, typename iterator_type> 
-  date_type from_stream_type(iterator_type & beg, iterator_type const &, 
-                             std::string const &);
    -
    -

    Description

    -

    Returns the first string found in the stream referenced by the begining & end iterators

    -
    -
    - - - -
    Copyright © 2001-2005 CrystalClear Software, Inc

    Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/date_time/from_stream_t_idp103304976.html b/doc/html/boost/date_time/from_stream_t_idp103304976.html deleted file mode 100644 index d0164a9dda..0000000000 --- a/doc/html/boost/date_time/from_stream_t_idp103304976.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Function template from_stream_type - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template from_stream_type

    -

    boost::date_time::from_stream_type — Helper function for 'date gregorian::from_stream()'.

    -
    -

    Synopsis

    -
    // In header: <boost/date_time/date_parsing.hpp>
-
-
-template<typename date_type, typename iterator_type> 
-  date_type from_stream_type(iterator_type & beg, iterator_type const & end, 
-                             wchar_t);
    -
    -

    Description

    -

    Creates a string from the iterators that reference the begining & end of a wstring. All elements are used in output string

    -
    -
    - - - -
    Copyright © 2001-2005 CrystalClear Software, Inc

    Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/date_time/from_stream_ty_idp73045008.html b/doc/html/boost/date_time/from_stream_ty_idp73045008.html deleted file mode 100644 index 5e5dc78eed..0000000000 --- a/doc/html/boost/date_time/from_stream_ty_idp73045008.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Function template from_stream_type - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template from_stream_type

    -

    boost::date_time::from_stream_type — Helper function for 'date gregorian::from_stream()'.

    -
    -

    Synopsis

    -
    // In header: <boost/date_time/date_parsing.hpp>
-
-
-template<typename date_type, typename iterator_type> 
-  date_type from_stream_type(iterator_type & beg, iterator_type const &, 
-                             std::wstring const &);
    -
    -

    Description

    -

    Creates a string from the first wstring found in the stream referenced by the begining & end iterators

    -
    -
    - - - -
    Copyright © 2001-2005 CrystalClear Software, Inc

    Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/date_time/from_stream_ty_idp94879648.html b/doc/html/boost/date_time/from_stream_ty_idp94879648.html deleted file mode 100644 index 57d28b6d5c..0000000000 --- a/doc/html/boost/date_time/from_stream_ty_idp94879648.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Function template from_stream_type - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template from_stream_type

    -

    boost::date_time::from_stream_type — Helper function for 'date gregorian::from_stream()'.

    -
    -

    Synopsis

    -
    // In header: <boost/date_time/date_parsing.hpp>
-
-
-template<typename date_type, typename iterator_type> 
-  date_type from_stream_type(iterator_type & beg, iterator_type const & end, 
-                             char);
    -
    -

    Description

    -

    Creates a string from the iterators that reference the begining & end of a char[] or string. All elements are used in output string

    -
    -
    - - - -
    Copyright © 2001-2005 CrystalClear Software, Inc

    Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/date_time/gather_month_strings.html b/doc/html/boost/date_time/gather_month_strings.html index d97d8ef0e7..6f8fd9ba12 100644 --- a/doc/html/boost/date_time/gather_month_strings.html +++ b/doc/html/boost/date_time/gather_month_strings.html @@ -37,7 +37,7 @@ std::vector< std::basic_string< charT > > gather_month_strings(const std::locale & locale, bool short_strings = true);
    -

    Description

    +

    Description

    Using the time_put facet, this function creates a collection of all the month strings from a locale. This is handy when building custom date parsers or formatters that need to be localized.

    diff --git a/doc/html/boost/date_time/gather_weekday_strings.html b/doc/html/boost/date_time/gather_weekday_strings.html index f4eb899670..0d58f98ee9 100644 --- a/doc/html/boost/date_time/gather_weekday_strings.html +++ b/doc/html/boost/date_time/gather_weekday_strings.html @@ -38,7 +38,7 @@ gather_weekday_strings(const std::locale & locale, bool short_strings = true);

    -

    Description

    +

    Description

    Using the time_put facet, this function creates a collection of all the weekday strings from a locale starting with the string for 'Sunday'. This is handy when building custom date parsers or formatters that need to be localized.

    diff --git a/doc/html/boost/date_time/gregorian_calendar_base.html b/doc/html/boost/date_time/gregorian_calendar_base.html index bbf9b97e81..6f9256bf48 100644 --- a/doc/html/boost/date_time/gregorian_calendar_base.html +++ b/doc/html/boost/date_time/gregorian_calendar_base.html @@ -42,40 +42,40 @@ typedef ymd_type::year_type year_type; // Type to hold a stand alone year value (eg: 2002) typedef date_int_type_ date_int_type; // Define the integer type to use for internal calculations. - // public static functions - static unsigned short day_of_week(const ymd_type &); - static int week_number(const ymd_type &); - static date_int_type day_number(const ymd_type &); - static date_int_type julian_day_number(const ymd_type &); - static date_int_type modjulian_day_number(const ymd_type &); - static ymd_type from_day_number(date_int_type); - static ymd_type from_julian_day_number(date_int_type); - static ymd_type from_modjulian_day_number(date_int_type); - static bool is_leap_year(year_type); - static unsigned short end_of_month_day(year_type, month_type); - static ymd_type epoch(); - static unsigned short days_in_week(); + // public static functions + static unsigned short day_of_week(const ymd_type &); + static int week_number(const ymd_type &); + static date_int_type day_number(const ymd_type &); + static date_int_type julian_day_number(const ymd_type &); + static date_int_type modjulian_day_number(const ymd_type &); + static ymd_type from_day_number(date_int_type); + static ymd_type from_julian_day_number(date_int_type); + static ymd_type from_modjulian_day_number(date_int_type); + static bool is_leap_year(year_type); + static unsigned short end_of_month_day(year_type, month_type); + static ymd_type epoch(); + static unsigned short days_in_week(); };

    -

    Description

    +

    Description

    This is a parameterized implementation of a proleptic Gregorian Calendar that can be used in the creation of date systems or just to perform calculations. All the methods of this class are static functions, so the intent is to never create instances of this class.

    -

    -gregorian_calendar_base public static functions

    +

    +gregorian_calendar_base public static functions

      -
    1. static unsigned short day_of_week(const ymd_type & ymd);
      2. -
    2. static int week_number(const ymd_type & ymd);
      3. -
    3. static date_int_type day_number(const ymd_type & ymd);
      4. -
    4. static date_int_type julian_day_number(const ymd_type & ymd);
      5. -
    5. static date_int_type modjulian_day_number(const ymd_type & ymd);
      6. -
    6. static ymd_type from_day_number(date_int_type);
      7. -
    7. static ymd_type from_julian_day_number(date_int_type);
      8. -
    8. static ymd_type from_modjulian_day_number(date_int_type);
      9. -
    9. static bool is_leap_year(year_type);
      10. -
    10. static unsigned short end_of_month_day(year_type y, month_type m);
      11. -
    11. static ymd_type epoch();
      12. -
    12. static unsigned short days_in_week();
      13. +
    13. static unsigned short day_of_week(const ymd_type & ymd);
      14. +
    14. static int week_number(const ymd_type & ymd);
      15. +
    15. static date_int_type day_number(const ymd_type & ymd);
      16. +
    16. static date_int_type julian_day_number(const ymd_type & ymd);
      17. +
    17. static date_int_type modjulian_day_number(const ymd_type & ymd);
      18. +
    18. static ymd_type from_day_number(date_int_type);
      19. +
    19. static ymd_type from_julian_day_number(date_int_type);
      20. +
    20. static ymd_type from_modjulian_day_number(date_int_type);
      21. +
    21. static bool is_leap_year(year_type);
      22. +
    22. static unsigned short end_of_month_day(year_type y, month_type m);
      23. +
    23. static ymd_type epoch();
      24. +
    24. static unsigned short days_in_week();
    diff --git a/doc/html/boost/date_time/int_adapter.html b/doc/html/boost/date_time/int_adapter.html index 7b1f824190..7ed09eb07e 100644 --- a/doc/html/boost/date_time/int_adapter.html +++ b/doc/html/boost/date_time/int_adapter.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -39,58 +39,58 @@ typedef int_type_ int_type; // construct/copy/destruct - int_adapter(int_type); + int_adapter(int_type); - // public member functions - bool is_infinity() const; - bool is_pos_infinity() const; - bool is_neg_infinity() const; - bool is_nan() const; - bool is_special() const; - bool operator==(const int_adapter &) const; - bool operator==(const int &) const; - bool operator!=(const int_adapter &) const; - bool operator!=(const int &) const; - bool operator<(const int_adapter &) const; - bool operator<(const int &) const; - bool operator>(const int_adapter &) const; - int_type as_number() const; - special_values as_special() const; + // public member functions + bool is_infinity() const; + bool is_pos_infinity() const; + bool is_neg_infinity() const; + bool is_nan() const; + bool is_special() const; + bool operator==(const int_adapter &) const; + bool operator==(const int &) const; + bool operator!=(const int_adapter &) const; + bool operator!=(const int &) const; + bool operator<(const int_adapter &) const; + bool operator<(const int &) const; + bool operator>(const int_adapter &) const; + int_type as_number() const; + special_values as_special() const; template<typename rhs_type> - int_adapter operator+(const int_adapter< rhs_type > &) const; - int_adapter operator+(const int_type) const; + int_adapter operator+(const int_adapter< rhs_type > &) const; + int_adapter operator+(const int_type) const; template<typename rhs_type> - int_adapter operator-(const int_adapter< rhs_type > &) const; - int_adapter operator-(const int_type) const; - int_adapter operator*(const int_adapter &) const; - int_adapter operator*(const int) const; - int_adapter operator/(const int_adapter &) const; - int_adapter operator/(const int) const; - int_adapter operator%(const int_adapter &) const; - int_adapter operator%(const int) const; + int_adapter operator-(const int_adapter< rhs_type > &) const; + int_adapter operator-(const int_type) const; + int_adapter operator*(const int_adapter &) const; + int_adapter operator*(const int) const; + int_adapter operator/(const int_adapter &) const; + int_adapter operator/(const int) const; + int_adapter operator%(const int_adapter &) const; + int_adapter operator%(const int) const; - // public static functions - static bool has_infinity(); - static const int_adapter pos_infinity(); - static const int_adapter neg_infinity(); - static const int_adapter not_a_number(); - static int_adapter max BOOST_PREVENT_MACRO_SUBSTITUTION(); - static int_adapter min BOOST_PREVENT_MACRO_SUBSTITUTION(); - static int_adapter from_special(special_values); - static bool is_inf(int_type); - static bool is_neg_inf(int_type); - static bool is_pos_inf(int_type); - static bool is_not_a_number(int_type); - static special_values to_special(int_type); - static int_type maxcount(); + // public static functions + static bool has_infinity(); + static const int_adapter pos_infinity(); + static const int_adapter neg_infinity(); + static const int_adapter not_a_number(); + static int_adapter max BOOST_PREVENT_MACRO_SUBSTITUTION(); + static int_adapter min BOOST_PREVENT_MACRO_SUBSTITUTION(); + static int_adapter from_special(special_values); + static bool is_inf(int_type); + static bool is_neg_inf(int_type); + static bool is_pos_inf(int_type); + static bool is_not_a_number(int_type); + static special_values to_special(int_type); + static int_type maxcount(); - // private member functions - int compare(const int_adapter &) const; - int_adapter mult_div_specials(const int_adapter &) const; - int_adapter mult_div_specials(const int &) const; + // private member functions + int compare(const int_adapter &) const; + int_adapter mult_div_specials(const int_adapter &) const; + int_adapter mult_div_specials(const int &) const; };
    -

    Description

    +

    Description

    This class is used internally in counted date/time representations. It adds the floating point like features of infinities and not a number. It also provides mathmatical operations with consideration to special values following these rules: 

    +infinity  -  infinity  == Not A Number (NAN)
  infinity  *  non-zero  == infinity
@@ -101,90 +101,90 @@

    -

    +

    int_adapter public construct/copy/destruct

    -
    1. int_adapter(int_type v);
    +
    1. int_adapter(int_type v);
    -

    -int_adapter public member functions

    +

    +int_adapter public member functions

      -
    1. bool is_infinity() const;
      2. -
    2. bool is_pos_infinity() const;
      3. -
    3. bool is_neg_infinity() const;
      4. -
    4. bool is_nan() const;
      5. -
    5. bool is_special() const;
      6. -
    6. bool operator==(const int_adapter & rhs) const;
      7. -
    7. bool operator==(const int & rhs) const;
      8. -
    8. bool operator!=(const int_adapter & rhs) const;
      9. -
    9. bool operator!=(const int & rhs) const;
      10. -
    10. bool operator<(const int_adapter & rhs) const;
      11. -
    11. bool operator<(const int & rhs) const;
      12. -
    12. bool operator>(const int_adapter & rhs) const;
      13. -
    13. int_type as_number() const;
      14. +
    14. bool is_infinity() const;
      15. +
    15. bool is_pos_infinity() const;
      16. +
    16. bool is_neg_infinity() const;
      17. +
    17. bool is_nan() const;
      18. +
    18. bool is_special() const;
      19. +
    19. bool operator==(const int_adapter & rhs) const;
      20. +
    20. bool operator==(const int & rhs) const;
      21. +
    21. bool operator!=(const int_adapter & rhs) const;
      22. +
    22. bool operator!=(const int & rhs) const;
      23. +
    23. bool operator<(const int_adapter & rhs) const;
      24. +
    24. bool operator<(const int & rhs) const;
      25. +
    25. bool operator>(const int_adapter & rhs) const;
      26. +
    26. int_type as_number() const;
    27. -
      special_values as_special() const;
      Returns either special value type or is_not_special.
      28. +
      special_values as_special() const;
      Returns either special value type or is_not_special. 
    28. template<typename rhs_type> 
-  int_adapter operator+(const int_adapter< rhs_type > & rhs) const;
      + int_adapter operator+(const int_adapter< rhs_type > & rhs) const;

      Operator allows for adding dissimilar int_adapter types. The return type will match that of the the calling object's type

      29. -
    29. int_adapter operator+(const int_type rhs) const;
      30. +
    30. int_adapter operator+(const int_type rhs) const;
    31. template<typename rhs_type> 
-  int_adapter operator-(const int_adapter< rhs_type > & rhs) const;
      + int_adapter operator-(const int_adapter< rhs_type > & rhs) const;

      Operator allows for subtracting dissimilar int_adapter types. The return type will match that of the the calling object's type

      32. -
    32. int_adapter operator-(const int_type rhs) const;
      33. -
    33. int_adapter operator*(const int_adapter & rhs) const;
      34. +
    34. int_adapter operator-(const int_type rhs) const;
      35. +
    35. int_adapter operator*(const int_adapter & rhs) const;
    36. -
      int_adapter operator*(const int rhs) const;
      +
      int_adapter operator*(const int rhs) const;

      Provided for cases when automatic conversion from 'int' to 'int_adapter' causes incorrect results.

      37. -
    37. int_adapter operator/(const int_adapter & rhs) const;
      38. +
    38. int_adapter operator/(const int_adapter & rhs) const;
    39. -
      int_adapter operator/(const int rhs) const;
      +
      int_adapter operator/(const int rhs) const;

      Provided for cases when automatic conversion from 'int' to 'int_adapter' causes incorrect results.

      40. -
    40. int_adapter operator%(const int_adapter & rhs) const;
      41. +
    41. int_adapter operator%(const int_adapter & rhs) const;
    42. -
      int_adapter operator%(const int rhs) const;
      +
      int_adapter operator%(const int rhs) const;

      Provided for cases when automatic conversion from 'int' to 'int_adapter' causes incorrect results.

    -

    -int_adapter public static functions

    +

    +int_adapter public static functions

      -
    1. static bool has_infinity();
      2. -
    2. static const int_adapter pos_infinity();
      3. -
    3. static const int_adapter neg_infinity();
      4. -
    4. static const int_adapter not_a_number();
      5. -
    5. static int_adapter max BOOST_PREVENT_MACRO_SUBSTITUTION();
      6. -
    6. static int_adapter min BOOST_PREVENT_MACRO_SUBSTITUTION();
      7. -
    7. static int_adapter from_special(special_values sv);
      8. -
    8. static bool is_inf(int_type v);
      9. -
    9. static bool is_neg_inf(int_type v);
      10. -
    10. static bool is_pos_inf(int_type v);
      11. -
    11. static bool is_not_a_number(int_type v);
      12. +
    12. static bool has_infinity();
      13. +
    13. static const int_adapter pos_infinity();
      14. +
    14. static const int_adapter neg_infinity();
      15. +
    15. static const int_adapter not_a_number();
      16. +
    16. static int_adapter max BOOST_PREVENT_MACRO_SUBSTITUTION();
      17. +
    17. static int_adapter min BOOST_PREVENT_MACRO_SUBSTITUTION();
      18. +
    18. static int_adapter from_special(special_values sv);
      19. +
    19. static bool is_inf(int_type v);
      20. +
    20. static bool is_neg_inf(int_type v);
      21. +
    21. static bool is_pos_inf(int_type v);
      22. +
    22. static bool is_not_a_number(int_type v);
    23. -
      static special_values to_special(int_type v);
      Returns either special value type or is_not_special.
      24. -
    24. static int_type maxcount();
      25. +
      static special_values to_special(int_type v);
      Returns either special value type or is_not_special. +
    25. static int_type maxcount();
    -

    -int_adapter private member functions

    +

    +int_adapter private member functions

    1. -
      int compare(const int_adapter & rhs) const;
      returns -1, 0, 1, or 2 if 'this' is <, ==, >, or 'nan comparison' rhs
      2. +
      int compare(const int_adapter & rhs) const;
      returns -1, 0, 1, or 2 if 'this' is <, ==, >, or 'nan comparison' rhs
    2. -
      int_adapter mult_div_specials(const int_adapter & rhs) const;
      Assumes at least 'this' or 'rhs' is a special value.
      3. +
      int_adapter mult_div_specials(const int_adapter & rhs) const;
      Assumes at least 'this' or 'rhs' is a special value.
    3. -
      int_adapter mult_div_specials(const int & rhs) const;
      Assumes 'this' is a special value.
      4. +
      int_adapter mult_div_specials(const int & rhs) const;
      Assumes 'this' is a special value.
    @@ -197,7 +197,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/date_time/iso_extended_format.html b/doc/html/boost/date_time/iso_extended_format.html index e7866b1e7b..ee9be1fa26 100644 --- a/doc/html/boost/date_time/iso_extended_format.html +++ b/doc/html/boost/date_time/iso_extended_format.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -36,16 +36,16 @@ class iso_extended_format : public boost::date_time::iso_format_base< charT > { public: - // public static functions - static bool has_date_sep_chars(); + // public static functions + static bool has_date_sep_chars(); };
    -

    Description

    +

    Description

    -

    -iso_extended_format public static functions

    +

    +iso_extended_format public static functions

    1. -
      static bool has_date_sep_chars();
      Extended format needs char separators.
    +
    static bool has_date_sep_chars();
    Extended format needs char separators.
    @@ -57,7 +57,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/date_time/iso_form_idm45507101202000.html b/doc/html/boost/date_time/iso_form_idm45507101202000.html new file mode 100644 index 0000000000..6bd032553a --- /dev/null +++ b/doc/html/boost/date_time/iso_form_idm45507101202000.html @@ -0,0 +1,118 @@ + + + + +Class iso_format_base<wchar_t> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Class iso_format_base<wchar_t>

    +

    boost::date_time::iso_format_base<wchar_t> — Class to provide common iso formatting spec.

    +
    +

    Synopsis

    +
    // In header: <boost/date_time/iso_format.hpp>
+
+
+class iso_format_base<wchar_t> {
+public:
+
+  // public static functions
+  static month_format_spec month_format();
+  static const wchar_t * not_a_date();
+  static const wchar_t * pos_infinity();
+  static const wchar_t * neg_infinity();
+  static wchar_t year_sep_char();
+  static wchar_t month_sep_char();
+  static wchar_t day_sep_char();
+  static wchar_t hour_sep_char();
+  static wchar_t minute_sep_char();
+  static wchar_t second_sep_char();
+  static wchar_t period_start_char();
+  static wchar_t time_start_char();
+  static wchar_t week_start_char();
+  static wchar_t period_sep_char();
+  static wchar_t time_sep_char();
+  static wchar_t fractional_time_sep_char();
+  static bool is_component_sep(wchar_t);
+  static bool is_fractional_time_sep(wchar_t);
+  static bool is_timezone_sep(wchar_t);
+  static wchar_t element_sep_char();
+};
    +
    +

    Description

    +
    +

    +iso_format_base public static functions

    +
      +
    1. +
      static month_format_spec month_format();
      Describe month format <ndash></ndash> its an integer in iso format.
      2. +
    2. +
      static const wchar_t * not_a_date();
      String used printed is date is invalid.
      3. +
    3. +
      static const wchar_t * pos_infinity();
      String used to for positive infinity value.
      4. +
    4. +
      static const wchar_t * neg_infinity();
      String used to for positive infinity value.
      5. +
    5. +
      static wchar_t year_sep_char();
      ISO char for a year <ndash></ndash> used in durations.
      6. +
    6. +
      static wchar_t month_sep_char();
      ISO char for a month.
      7. +
    7. +
      static wchar_t day_sep_char();
      ISO char for a day.
      8. +
    8. +
      static wchar_t hour_sep_char();
      char for minute
      9. +
    9. +
      static wchar_t minute_sep_char();
      char for minute
      10. +
    10. +
      static wchar_t second_sep_char();
      char for second
      11. +
    11. +
      static wchar_t period_start_char();
      ISO char for a period.
      12. +
    12. +
      static wchar_t time_start_char();
      Used in time in mixed strings to set start of time.
      13. +
    13. +
      static wchar_t week_start_char();
      Used in mixed strings to identify start of a week number.
      14. +
    14. +
      static wchar_t period_sep_char();
      Separators for periods.
      15. +
    15. +
      static wchar_t time_sep_char();
      Separator for hh:mm:ss.
      16. +
    16. +
      static wchar_t fractional_time_sep_char();
      Preferred Separator for hh:mm:ss,decimal_fraction.
      17. +
    17. static bool is_component_sep(wchar_t sep);
      18. +
    18. static bool is_fractional_time_sep(wchar_t sep);
      19. +
    19. static bool is_timezone_sep(wchar_t sep);
      20. +
    20. static wchar_t element_sep_char();
      21. +
    +
    +
    +
    + + + +
    Copyright © 2001-2005 CrystalClear Software, Inc

    Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/date_time/iso_format.html b/doc/html/boost/date_time/iso_format.html index 01e195c79e..ae2d63278f 100644 --- a/doc/html/boost/date_time/iso_format.html +++ b/doc/html/boost/date_time/iso_format.html @@ -36,16 +36,16 @@ class iso_format : public boost::date_time::iso_format_base< charT > { public: - // public static functions - static bool has_date_sep_chars(); + // public static functions + static bool has_date_sep_chars(); };
    -

    Description

    +

    Description

    -

    -iso_format public static functions

    +

    +iso_format public static functions

    1. -
      static bool has_date_sep_chars();
      The ios standard format doesn't use char separators.
    +
    static bool has_date_sep_chars();
    The ios standard format doesn't use char separators.
    diff --git a/doc/html/boost/date_time/iso_format_ba_idp104759696.html b/doc/html/boost/date_time/iso_format_ba_idp104759696.html deleted file mode 100644 index 962a7bdec1..0000000000 --- a/doc/html/boost/date_time/iso_format_ba_idp104759696.html +++ /dev/null @@ -1,118 +0,0 @@ - - - - -Class iso_format_base<wchar_t> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Class iso_format_base<wchar_t>

    -

    boost::date_time::iso_format_base<wchar_t> — Class to provide common iso formatting spec.

    -
    -

    Synopsis

    -
    // In header: <boost/date_time/iso_format.hpp>
-
-
-class iso_format_base<wchar_t> {
-public:
-
-  // public static functions
-  static month_format_spec month_format();
-  static const wchar_t * not_a_date();
-  static const wchar_t * pos_infinity();
-  static const wchar_t * neg_infinity();
-  static wchar_t year_sep_char();
-  static wchar_t month_sep_char();
-  static wchar_t day_sep_char();
-  static wchar_t hour_sep_char();
-  static wchar_t minute_sep_char();
-  static wchar_t second_sep_char();
-  static wchar_t period_start_char();
-  static wchar_t time_start_char();
-  static wchar_t week_start_char();
-  static wchar_t period_sep_char();
-  static wchar_t time_sep_char();
-  static wchar_t fractional_time_sep_char();
-  static bool is_component_sep(wchar_t);
-  static bool is_fractional_time_sep(wchar_t);
-  static bool is_timezone_sep(wchar_t);
-  static wchar_t element_sep_char();
-};
    -
    -

    Description

    -
    -

    -iso_format_base public static functions

    -
      -
    1. -
      static month_format_spec month_format();
      Describe month format <ndash></ndash> its an integer in iso format.
      2. -
    2. -
      static const wchar_t * not_a_date();
      String used printed is date is invalid.
      3. -
    3. -
      static const wchar_t * pos_infinity();
      String used to for positive infinity value.
      4. -
    4. -
      static const wchar_t * neg_infinity();
      String used to for positive infinity value.
      5. -
    5. -
      static wchar_t year_sep_char();
      ISO char for a year <ndash></ndash> used in durations.
      6. -
    6. -
      static wchar_t month_sep_char();
      ISO char for a month.
      7. -
    7. -
      static wchar_t day_sep_char();
      ISO char for a day.
      8. -
    8. -
      static wchar_t hour_sep_char();
      char for minute
      9. -
    9. -
      static wchar_t minute_sep_char();
      char for minute
      10. -
    10. -
      static wchar_t second_sep_char();
      char for second
      11. -
    11. -
      static wchar_t period_start_char();
      ISO char for a period.
      12. -
    12. -
      static wchar_t time_start_char();
      Used in time in mixed strings to set start of time.
      13. -
    13. -
      static wchar_t week_start_char();
      Used in mixed strings to identify start of a week number.
      14. -
    14. -
      static wchar_t period_sep_char();
      Separators for periods.
      15. -
    15. -
      static wchar_t time_sep_char();
      Separator for hh:mm:ss.
      16. -
    16. -
      static wchar_t fractional_time_sep_char();
      Preferred Separator for hh:mm:ss,decimal_fraction.
      17. -
    17. static bool is_component_sep(wchar_t sep);
      18. -
    18. static bool is_fractional_time_sep(wchar_t sep);
      19. -
    19. static bool is_timezone_sep(wchar_t sep);
      20. -
    20. static wchar_t element_sep_char();
      21. -
    -
    -
    -
    - - - -
    Copyright © 2001-2005 CrystalClear Software, Inc

    Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/date_time/iso_format_base.html b/doc/html/boost/date_time/iso_format_base.html index 41a86a6dd6..aa8c6a8eaa 100644 --- a/doc/html/boost/date_time/iso_format_base.html +++ b/doc/html/boost/date_time/iso_format_base.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -36,75 +36,75 @@ class iso_format_base { public: - // public static functions - static month_format_spec month_format(); - static const charT * not_a_date(); - static const charT * pos_infinity(); - static const charT * neg_infinity(); - static charT year_sep_char(); - static charT month_sep_char(); - static charT day_sep_char(); - static charT hour_sep_char(); - static charT minute_sep_char(); - static charT second_sep_char(); - static charT period_start_char(); - static charT time_start_char(); - static charT week_start_char(); - static charT period_sep_char(); - static charT time_sep_char(); - static charT fractional_time_sep_char(); - static bool is_component_sep(charT); - static bool is_fractional_time_sep(charT); - static bool is_timezone_sep(charT); - static charT element_sep_char(); + // public static functions + static month_format_spec month_format(); + static const charT * not_a_date(); + static const charT * pos_infinity(); + static const charT * neg_infinity(); + static charT year_sep_char(); + static charT month_sep_char(); + static charT day_sep_char(); + static charT hour_sep_char(); + static charT minute_sep_char(); + static charT second_sep_char(); + static charT period_start_char(); + static charT time_start_char(); + static charT week_start_char(); + static charT period_sep_char(); + static charT time_sep_char(); + static charT fractional_time_sep_char(); + static bool is_component_sep(charT); + static bool is_fractional_time_sep(charT); + static bool is_timezone_sep(charT); + static charT element_sep_char(); };
    -

    Description

    +

    Description

    -

    -iso_format_base public static functions

    +

    +iso_format_base public static functions

    1. -
      static month_format_spec month_format();
      Describe month format <ndash></ndash> its an integer in iso format.
      2. +
      static month_format_spec month_format();
      Describe month format <ndash></ndash> its an integer in iso format.
    2. -
      static const charT * not_a_date();
      String used printed is date is invalid.
      3. +
      static const charT * not_a_date();
      String used printed is date is invalid.
    3. -
      static const charT * pos_infinity();
      String used to for positive infinity value.
      4. +
      static const charT * pos_infinity();
      String used to for positive infinity value.
    4. -
      static const charT * neg_infinity();
      String used to for positive infinity value.
      5. +
      static const charT * neg_infinity();
      String used to for positive infinity value.
    5. -
      static charT year_sep_char();
      ISO char for a year <ndash></ndash> used in durations.
      6. +
      static charT year_sep_char();
      ISO char for a year <ndash></ndash> used in durations.
    6. -
      static charT month_sep_char();
      ISO char for a month.
      7. +
      static charT month_sep_char();
      ISO char for a month.
    7. -
      static charT day_sep_char();
      ISO char for a day.
      8. +
      static charT day_sep_char();
      ISO char for a day.
    8. -
      static charT hour_sep_char();
      char for minute
      9. +
      static charT hour_sep_char();
      char for minute
    9. -
      static charT minute_sep_char();
      char for minute
      10. +
      static charT minute_sep_char();
      char for minute
    10. -
      static charT second_sep_char();
      char for second
      11. +
      static charT second_sep_char();
      char for second
    11. -
      static charT period_start_char();
      ISO char for a period.
      12. +
      static charT period_start_char();
      ISO char for a period.
    12. -
      static charT time_start_char();
      Used in time in mixed strings to set start of time.
      13. +
      static charT time_start_char();
      Used in time in mixed strings to set start of time.
    13. -
      static charT week_start_char();
      Used in mixed strings to identify start of a week number.
      14. +
      static charT week_start_char();
      Used in mixed strings to identify start of a week number.
    14. -
      static charT period_sep_char();
      Separators for periods.
      15. +
      static charT period_sep_char();
      Separators for periods.
    15. -
      static charT time_sep_char();
      Separator for hh:mm:ss.
      16. +
      static charT time_sep_char();
      Separator for hh:mm:ss.
    16. -
      static charT fractional_time_sep_char();
      Preferred Separator for hh:mm:ss,decimal_fraction.
      17. -
    17. static bool is_component_sep(charT sep);
      18. -
    18. static bool is_fractional_time_sep(charT sep);
      19. -
    19. static bool is_timezone_sep(charT sep);
      20. -
    20. static charT element_sep_char();
      21. +
      static charT fractional_time_sep_char();
      Preferred Separator for hh:mm:ss,decimal_fraction. +
    21. static bool is_component_sep(charT sep);
      22. +
    22. static bool is_fractional_time_sep(charT sep);
      23. +
    23. static bool is_timezone_sep(charT sep);
      24. +
    24. static charT element_sep_char();
    -

    Specializations

    -
    +

    Specializations

    +
    @@ -116,7 +116,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/date_time/last_kday_of_month.html b/doc/html/boost/date_time/last_kday_of_month.html index b6a6c7a3e4..b39e794269 100644 --- a/doc/html/boost/date_time/last_kday_of_month.html +++ b/doc/html/boost/date_time/last_kday_of_month.html @@ -45,25 +45,25 @@ typedef date_type::duration_type duration_type; // construct/copy/destruct - last_kday_of_month(day_of_week_type, month_type); + last_kday_of_month(day_of_week_type, month_type); - // public member functions - virtual date_type get_date(year_type) const; - month_type month() const; - day_of_week_type day_of_week() const; - virtual std::string to_string() const; + // public member functions + virtual date_type get_date(year_type) const; + month_type month() const; + day_of_week_type day_of_week() const; + virtual std::string to_string() const; };
    -

    Description

    +

    Description

    Useful generator functor for finding holidays and daylight savings Get the last day of the month and then calculate the difference to the last previous day.

    -

    +

    last_kday_of_month public construct/copy/destruct

    1. -
      last_kday_of_month(day_of_week_type dow, month_type m);
      Specify the date spec like last 'Sunday' in 'April' spec.

      +

      last_kday_of_month(day_of_week_type dow, month_type m);
      Specify the date spec like last 'Sunday' in 'April' spec.

      @@ -93,15 +93,15 @@
      -

      -last_kday_of_month public member functions

      +

      +last_kday_of_month public member functions

      1. -
        virtual date_type get_date(year_type year) const;
        Return a concrete date when provided with a year specific year.
        2. -
      2. month_type month() const;
        3. -
      3. day_of_week_type day_of_week() const;
        4. +
        virtual date_type get_date(year_type year) const;
        Return a concrete date when provided with a year specific year. +
      4. month_type month() const;
        5. +
      5. day_of_week_type day_of_week() const;
      6. -
        virtual std::string to_string() const;
        Returns string suitable for use in POSIX time zone string.

        Returns a string formatted as "M4.5.0" ==> last Sunday in April.

        +
        virtual std::string to_string() const;
        Returns string suitable for use in POSIX time zone string.

        Returns a string formatted as "M4.5.0" ==> last Sunday in April.

      diff --git a/doc/html/boost/date_time/local_adjustor.html b/doc/html/boost/date_time/local_adjustor.html index 2d7e171618..1590e8d902 100644 --- a/doc/html/boost/date_time/local_adjustor.html +++ b/doc/html/boost/date_time/local_adjustor.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      @@ -40,13 +40,13 @@ typedef time_type::date_type date_type; typedef static_local_time_adjustor< time_type, dst_rule, utc_adjustment< time_duration_type, utc_offset > > dst_adjustor; - // public static functions - static time_type utc_to_local(const time_type &); + // public static functions + static time_type utc_to_local(const time_type &); static time_type - local_to_utc(const time_type &, date_time::dst_flags = date_time::calculate); + local_to_utc(const time_type &, date_time::dst_flags = date_time::calculate); };
      -

      Description

      +

      Description

      Use this template to create the timezone to utc convertors as required.

      This class will also work for other regions that don't use dst and have a utc offset which is an integral number of hours.

      Template Parameters -time_type <ndash></ndash> Time class to use -utc_offset <ndash></ndash> Number hours local time is adjust from utc -use_dst <ndash></ndash> true (default) if region uses dst, false otherwise For example:

      @@ -59,14 +59,14 @@

      -

      -local_adjustor public static functions

      +

      +local_adjustor public static functions

      1. -
        static time_type utc_to_local(const time_type & t);
        Convert a utc time to local time.
        2. +
        static time_type utc_to_local(const time_type & t);
        Convert a utc time to local time. 
      2. static time_type 
-local_to_utc(const time_type & t, 
+local_to_utc(const time_type & t, 
              date_time::dst_flags dst = date_time::calculate);
        Convert a local time to utc.
      @@ -80,7 +80,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/date_time/microsec_clock.html b/doc/html/boost/date_time/microsec_clock.html index 2b0a09fad0..bcd0fb6fb7 100644 --- a/doc/html/boost/date_time/microsec_clock.html +++ b/doc/html/boost/date_time/microsec_clock.html @@ -40,35 +40,35 @@ typedef time_type::time_duration_type time_duration_type; typedef time_duration_type::rep_type resolution_traits_type; - // public static functions + // public static functions template<typename time_zone_type> - static time_type local_time(shared_ptr< time_zone_type >); - static time_type local_time(); - static time_type universal_time(); + static time_type local_time(shared_ptr< time_zone_type >); + static time_type local_time(); + static time_type universal_time(); - // private static functions - static time_type create_time(time_converter); + // private static functions + static time_type create_time(time_converter); };
      -

      Description

      +

      Description

      A high precision clock that measures the local time at a resolution up to microseconds and adjusts to the resolution of the time system. For example, for the a library configuration with nano second resolution, the last 3 places of the fractional seconds will always be 000 since there are 1000 nano-seconds in a micro second.

      -

      -microsec_clock public static functions

      +

      +microsec_clock public static functions

      1. template<typename time_zone_type> 
-  static time_type local_time(shared_ptr< time_zone_type > tz_ptr);
        return a local time object for the given zone, based on computer clock
        2. + static time_type local_time(shared_ptr< time_zone_type > tz_ptr);return a local time object for the given zone, based on computer clock
      2. -
        static time_type local_time();
        Returns the local time based on computer clock settings.
        3. +
        static time_type local_time();
        Returns the local time based on computer clock settings.
      3. -
        static time_type universal_time();
        Returns the UTC time based on computer settings.
        4. +
        static time_type universal_time();
        Returns the UTC time based on computer settings.
      -

      -microsec_clock private static functions

      -
      1. static time_type create_time(time_converter converter);
      +

      +microsec_clock private static functions

      +
      1. static time_type create_time(time_converter converter);
      diff --git a/doc/html/boost/date_time/month_formatter.html b/doc/html/boost/date_time/month_formatter.html index 2acf153a1b..60b9a07857 100644 --- a/doc/html/boost/date_time/month_formatter.html +++ b/doc/html/boost/date_time/month_formatter.html @@ -36,23 +36,23 @@ class month_formatter { public: - // public static functions - static ostream_type & format_month(const month_type &, ostream_type &); - static std::ostream & format_month(const month_type &, std::ostream &); + // public static functions + static ostream_type & format_month(const month_type &, ostream_type &); + static std::ostream & format_month(const month_type &, std::ostream &); };
    -

    Description

    +

    Description

    -

    -month_formatter public static functions

    +

    +month_formatter public static functions

    1. static ostream_type & 
-format_month(const month_type & month, ostream_type & os);
      Formats a month as as string into an ostream.

      This function demands that month_type provide functions for converting to short and long strings if that capability is used.

      +format_month(const month_type & month, ostream_type & os);Formats a month as as string into an ostream.

      This function demands that month_type provide functions for converting to short and long strings if that capability is used. 

    2. static std::ostream & 
-format_month(const month_type & month, std::ostream & os);
      Formats a month as as string into an ostream.

      This function demands that month_type provide functions for converting to short and long strings if that capability is used.

      +format_month(const month_type & month, std::ostream & os);Formats a month as as string into an ostream.

      This function demands that month_type provide functions for converting to short and long strings if that capability is used.

    diff --git a/doc/html/boost/date_time/month_functor.html b/doc/html/boost/date_time/month_functor.html index e57b739dec..5f19665dc3 100644 --- a/doc/html/boost/date_time/month_functor.html +++ b/doc/html/boost/date_time/month_functor.html @@ -42,29 +42,29 @@ typedef cal_type::day_type day_type; // construct/copy/destruct - month_functor(int); + month_functor(int); - // public member functions - duration_type get_offset(const date_type &) const; - duration_type get_neg_offset(const date_type &) const; + // public member functions + duration_type get_offset(const date_type &) const; + duration_type get_neg_offset(const date_type &) const; };
    -

    Description

    +

    Description

    This adjustment function provides the logic for 'month-based' advancement on a ymd based calendar. The policy it uses to handle the non existant end of month days is to back up to the last day of the month. Also, if the starting date is the last day of a month, this functor will attempt to adjust to the end of the month.

    -

    +

    month_functor public construct/copy/destruct

    -
    1. month_functor(int f);
    +
    1. month_functor(int f);
    -

    -month_functor public member functions

    +

    +month_functor public member functions

      -
    1. duration_type get_offset(const date_type & d) const;
      2. +
    2. duration_type get_offset(const date_type & d) const;
    3. -
      duration_type get_neg_offset(const date_type & d) const;
      Returns a negative duration_type.
      4. +
      duration_type get_neg_offset(const date_type & d) const;
      Returns a negative duration_type.
    diff --git a/doc/html/boost/date_time/months_duration.html b/doc/html/boost/date_time/months_duration.html index d8b0eab037..bdbcfa6583 100644 --- a/doc/html/boost/date_time/months_duration.html +++ b/doc/html/boost/date_time/months_duration.html @@ -36,64 +36,64 @@ class months_duration { public: // construct/copy/destruct - months_duration(int_rep); - months_duration(special_values); + months_duration(int_rep); + months_duration(special_values); - // public member functions - int_rep number_of_months() const; - duration_type get_neg_offset(const date_type &) const; - duration_type get_offset(const date_type &) const; - bool operator==(const months_type &) const; - bool operator!=(const months_type &) const; - months_type operator+(const months_type &) const; - months_type & operator+=(const months_type &); - months_type operator-(const months_type &) const; - months_type & operator-=(const months_type &); - months_type operator*(const int_type) const; - months_type & operator*=(const int_type); - months_type operator/(const int_type) const; - months_type & operator/=(const int_type); - months_type operator+(const years_type &) const; - months_type & operator+=(const years_type &); - months_type operator-(const years_type &) const; - months_type & operator-=(const years_type &); + // public member functions + int_rep number_of_months() const; + duration_type get_neg_offset(const date_type &) const; + duration_type get_offset(const date_type &) const; + bool operator==(const months_type &) const; + bool operator!=(const months_type &) const; + months_type operator+(const months_type &) const; + months_type & operator+=(const months_type &); + months_type operator-(const months_type &) const; + months_type & operator-=(const months_type &); + months_type operator*(const int_type) const; + months_type & operator*=(const int_type); + months_type operator/(const int_type) const; + months_type & operator/=(const int_type); + months_type operator+(const years_type &) const; + months_type & operator+=(const years_type &); + months_type operator-(const years_type &) const; + months_type & operator-=(const years_type &); };
    -

    Description

    +

    Description

    A logical month enables things like: "date(2002,Mar,2) + months(2) -> 2002-May2". If the date is a last day-of-the-month, the result will also be a last-day-of-the-month.

    -

    +

    months_duration public construct/copy/destruct

      -
    1. months_duration(int_rep num);
      2. -
    2. months_duration(special_values sv);
      3. +
    3. months_duration(int_rep num);
      4. +
    4. months_duration(special_values sv);
    -

    -months_duration public member functions

    +

    +months_duration public member functions

      -
    1. int_rep number_of_months() const;
      2. +
    2. int_rep number_of_months() const;
    3. -
      duration_type get_neg_offset(const date_type & d) const;
      returns a negative duration
      4. -
    4. duration_type get_offset(const date_type & d) const;
      5. -
    5. bool operator==(const months_type & rhs) const;
      6. -
    6. bool operator!=(const months_type & rhs) const;
      7. -
    7. months_type operator+(const months_type & rhs) const;
      8. -
    8. months_type & operator+=(const months_type & rhs);
      9. -
    9. months_type operator-(const months_type & rhs) const;
      10. -
    10. months_type & operator-=(const months_type & rhs);
      11. -
    11. months_type operator*(const int_type rhs) const;
      12. -
    12. months_type & operator*=(const int_type rhs);
      13. -
    13. months_type operator/(const int_type rhs) const;
      14. -
    14. months_type & operator/=(const int_type rhs);
      15. -
    15. months_type operator+(const years_type & y) const;
      16. -
    16. months_type & operator+=(const years_type & y);
      17. -
    17. months_type operator-(const years_type & y) const;
      18. -
    18. months_type & operator-=(const years_type & y);
      19. +
      duration_type get_neg_offset(const date_type & d) const;
      returns a negative duration +
    19. duration_type get_offset(const date_type & d) const;
      20. +
    20. bool operator==(const months_type & rhs) const;
      21. +
    21. bool operator!=(const months_type & rhs) const;
      22. +
    22. months_type operator+(const months_type & rhs) const;
      23. +
    23. months_type & operator+=(const months_type & rhs);
      24. +
    24. months_type operator-(const months_type & rhs) const;
      25. +
    25. months_type & operator-=(const months_type & rhs);
      26. +
    26. months_type operator*(const int_type rhs) const;
      27. +
    27. months_type & operator*=(const int_type rhs);
      28. +
    28. months_type operator/(const int_type rhs) const;
      29. +
    29. months_type & operator/=(const int_type rhs);
      30. +
    30. months_type operator+(const years_type & y) const;
      31. +
    31. months_type & operator+=(const years_type & y);
      32. +
    32. months_type operator-(const years_type & y) const;
      33. +
    33. months_type & operator-=(const years_type & y);
    diff --git a/doc/html/boost/date_time/next_weekday.html b/doc/html/boost/date_time/next_weekday.html index 0206978db0..7f6f8ebc08 100644 --- a/doc/html/boost/date_time/next_weekday.html +++ b/doc/html/boost/date_time/next_weekday.html @@ -36,7 +36,7 @@ template<typename date_type, typename weekday_type> date_type next_weekday(const date_type & d, const weekday_type & wd);
    -

    Description

    +

    Description

    Generates a date object representing the date of the following weekday from the given date. If the date given is 2004-May-9 (a Sunday) and the given weekday is Tuesday then the resulting date will be 2004-May-11.

    diff --git a/doc/html/boost/date_time/nth_kday_of_month.html b/doc/html/boost/date_time/nth_kday_of_month.html index d6366fd8f7..9db673fe35 100644 --- a/doc/html/boost/date_time/nth_kday_of_month.html +++ b/doc/html/boost/date_time/nth_kday_of_month.html @@ -47,39 +47,39 @@ enum week_num { first = =1, second, third, fourth, fifth }; // construct/copy/destruct - nth_kday_of_month(week_num, day_of_week_type, month_type); + nth_kday_of_month(week_num, day_of_week_type, month_type); - // public member functions - virtual date_type get_date(year_type) const; - month_type month() const; - week_num nth_week() const; - day_of_week_type day_of_week() const; - const char * nth_week_as_str() const; - virtual std::string to_string() const; + // public member functions + virtual date_type get_date(year_type) const; + month_type month() const; + week_num nth_week() const; + day_of_week_type day_of_week() const; + const char * nth_week_as_str() const; + virtual std::string to_string() const; };
    -

    Description

    +

    Description

    Based on the idea in Cal. Calc. for finding holidays that are the 'first Monday of September'. When instantiated with 'fifth' kday of month, the result will be the last kday of month which can be the fourth or fifth depending on the structure of the month.

    The algorithm here basically guesses for the first day of the month. Then finds the first day of the correct type. That is, if the first of the month is a Tuesday and it needs Wenesday then we simply increment by a day and then we can add the length of a week until we get to the 'nth kday'. There are probably more efficient algorithms based on using a mod 7, but this one works reasonably well for basic applications.

    -

    +

    nth_kday_of_month public construct/copy/destruct

    -
    1. nth_kday_of_month(week_num week_no, day_of_week_type dow, month_type m);
    +
    1. nth_kday_of_month(week_num week_no, day_of_week_type dow, month_type m);
    -

    -nth_kday_of_month public member functions

    +

    +nth_kday_of_month public member functions

    1. -
      virtual date_type get_date(year_type y) const;
      Return a concrete date when provided with a year specific year.
      2. -
    2. month_type month() const;
      3. -
    3. week_num nth_week() const;
      4. -
    4. day_of_week_type day_of_week() const;
      5. -
    5. const char * nth_week_as_str() const;
      6. +
      virtual date_type get_date(year_type y) const;
      Return a concrete date when provided with a year specific year. +
    6. month_type month() const;
      7. +
    7. week_num nth_week() const;
      8. +
    8. day_of_week_type day_of_week() const;
      9. +
    9. const char * nth_week_as_str() const;
    10. -
      virtual std::string to_string() const;
      Returns string suitable for use in POSIX time zone string.

      Returns a string formatted as "M4.3.0" ==> 3rd Sunday in April.

      +
      virtual std::string to_string() const;
      Returns string suitable for use in POSIX time zone string.

      Returns a string formatted as "M4.3.0" ==> 3rd Sunday in April.

    diff --git a/doc/html/boost/date_time/null_dst_rules.html b/doc/html/boost/date_time/null_dst_rules.html index 305a1e39a9..b027516beb 100644 --- a/doc/html/boost/date_time/null_dst_rules.html +++ b/doc/html/boost/date_time/null_dst_rules.html @@ -39,30 +39,30 @@ typedef time_duration_type_ time_duration_type; typedef date_type_ date_type; - // public static functions + // public static functions static time_is_dst_result - local_is_dst(const date_type &, const time_duration_type &); + local_is_dst(const date_type &, const time_duration_type &); static time_is_dst_result - utc_is_dst(const date_type &, const time_duration_type &); - static bool is_dst_boundary_day(date_type); - static time_duration_type dst_offset(); + utc_is_dst(const date_type &, const time_duration_type &); + static bool is_dst_boundary_day(date_type); + static time_duration_type dst_offset(); };
    -

    Description

    +

    Description

    -

    -null_dst_rules public static functions

    +

    +null_dst_rules public static functions

    1. static time_is_dst_result 
-local_is_dst(const date_type &, const time_duration_type &);
      Calculates if the given local time is dst or not.

      +local_is_dst(const date_type &, const time_duration_type &);Calculates if the given local time is dst or not. 

    2. static time_is_dst_result 
-utc_is_dst(const date_type &, const time_duration_type &);
      Calculates if the given utc time is in dst.
      3. -
    3. static bool is_dst_boundary_day(date_type);
      4. -
    4. static time_duration_type dst_offset();
      5. +utc_is_dst(const date_type &, const time_duration_type &);Calculates if the given utc time is in dst. +
    5. static bool is_dst_boundary_day(date_type);
      6. +
    6. static time_duration_type dst_offset();
    diff --git a/doc/html/boost/date_time/operator_idm45507093183424.html b/doc/html/boost/date_time/operator_idm45507093183424.html new file mode 100644 index 0000000000..14e69c088a --- /dev/null +++ b/doc/html/boost/date_time/operator_idm45507093183424.html @@ -0,0 +1,57 @@ + + + + +Function template operator<< + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator<<

    +

    boost::date_time::operator<<

    +
    +

    Synopsis

    +
    // In header: <boost/date_time/int_adapter.hpp>
+
+
+template<typename charT, typename traits, typename int_type> 
+  std::basic_ostream< charT, traits > & 
+  operator<<(std::basic_ostream< charT, traits > & os, 
+             const int_adapter< int_type > & ia);
    +
    +

    Description

    +

    Expected output is either a numeric representation or a special values representation.
    + Ex. "12", "+infinity", "not-a-number", etc.

    +
    +
    + + + +
    Copyright © 2001-2005 CrystalClear Software, Inc

    Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/date_time/operator_idp102086480.html b/doc/html/boost/date_time/operator_idp102086480.html deleted file mode 100644 index 83619b288d..0000000000 --- a/doc/html/boost/date_time/operator_idp102086480.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function template operator<< - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator<<

    -

    boost::date_time::operator<<

    -
    -

    Synopsis

    -
    // In header: <boost/date_time/int_adapter.hpp>
-
-
-template<typename charT, typename traits, typename int_type> 
-  std::basic_ostream< charT, traits > & 
-  operator<<(std::basic_ostream< charT, traits > & os, 
-             const int_adapter< int_type > & ia);
    -
    -

    Description

    -

    Expected output is either a numeric representation or a special values representation.
    - Ex. "12", "+infinity", "not-a-number", etc.

    -
    -
    - - - -
    Copyright © 2001-2005 CrystalClear Software, Inc

    Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/date_time/ostream__idm45507093288816.html b/doc/html/boost/date_time/ostream__idm45507093288816.html new file mode 100644 index 0000000000..c2880e70d1 --- /dev/null +++ b/doc/html/boost/date_time/ostream__idm45507093288816.html @@ -0,0 +1,66 @@ + + + + +Class template ostream_time_duration_formatter + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Class template ostream_time_duration_formatter

    +

    boost::date_time::ostream_time_duration_formatter — Put a time type into a stream using appropriate facets.

    +
    +

    Synopsis

    +
    // In header: <boost/date_time/time_formatting_streams.hpp>
+
+template<typename time_duration_type, typename charT = char> 
+class ostream_time_duration_formatter {
+public:
+  // types
+  typedef std::basic_ostream< charT >                 ostream_type;           
+  typedef time_duration_type::fractional_seconds_type fractional_seconds_type;
+
+  // public static functions
+  static void duration_put(const time_duration_type &, ostream_type &);
+};
    +
    +

    Description

    +
    +

    +ostream_time_duration_formatter public static functions

    +
    1. +
      static void duration_put(const time_duration_type & td, ostream_type & os);
      Put time into an ostream.
    +
    +
    +
    + + + +
    Copyright © 2001-2005 CrystalClear Software, Inc

    Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/date_time/ostream__idm45507132748752.html b/doc/html/boost/date_time/ostream__idm45507132748752.html new file mode 100644 index 0000000000..f644fa88c7 --- /dev/null +++ b/doc/html/boost/date_time/ostream__idm45507132748752.html @@ -0,0 +1,67 @@ + + + + +Class template ostream_time_period_formatter + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Class template ostream_time_period_formatter

    +

    boost::date_time::ostream_time_period_formatter — Put a time period into a stream using appropriate facets.

    +
    +

    Synopsis

    +
    // In header: <boost/date_time/time_formatting_streams.hpp>
+
+template<typename time_period_type, typename charT = char> 
+class ostream_time_period_formatter {
+public:
+  // types
+  typedef std::basic_ostream< charT >                ostream_type;  
+  typedef time_period_type::point_type               time_type;     
+  typedef ostream_time_formatter< time_type, charT > time_formatter;
+
+  // public static functions
+  static void period_put(const time_period_type &, ostream_type &);
+};
    +
    +

    Description

    +
    +

    +ostream_time_period_formatter public static functions

    +
    1. +
      static void period_put(const time_period_type & tp, ostream_type & os);
      Put time into an ostream.
    +
    +
    +
    + + + +
    Copyright © 2001-2005 CrystalClear Software, Inc

    Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/date_time/ostream_date_formatter.html b/doc/html/boost/date_time/ostream_date_formatter.html index 9d896451f1..080ce16458 100644 --- a/doc/html/boost/date_time/ostream_date_formatter.html +++ b/doc/html/boost/date_time/ostream_date_formatter.html @@ -39,21 +39,21 @@ typedef std::basic_ostream< charT > ostream_type; typedef date_type::ymd_type ymd_type; - // public static functions - static void date_put(const date_type &, ostream_type &, const facet_type &); - static void date_put(const date_type &, ostream_type &); + // public static functions + static void date_put(const date_type &, ostream_type &, const facet_type &); + static void date_put(const date_type &, ostream_type &); };
    -

    Description

    +

    Description

    -

    -ostream_date_formatter public static functions

    +

    +ostream_date_formatter public static functions

    1. -
      static void date_put(const date_type & d, ostream_type & os, 
+
      static void date_put(const date_type & d, ostream_type & os, 
                      const facet_type & f);
      Put date into an ostream.
    2. -
      static void date_put(const date_type & d, ostream_type & os);
      Put date into an ostream.
      3. +
      static void date_put(const date_type & d, ostream_type & os);
      Put date into an ostream.
    diff --git a/doc/html/boost/date_time/ostream_month_formatter.html b/doc/html/boost/date_time/ostream_month_formatter.html index 6203446756..0481cdcb77 100644 --- a/doc/html/boost/date_time/ostream_month_formatter.html +++ b/doc/html/boost/date_time/ostream_month_formatter.html @@ -39,17 +39,17 @@ typedef facet_type::month_type month_type; typedef std::basic_ostream< charT > ostream_type; - // public static functions - static void format_month(const month_type &, ostream_type &, + // public static functions + static void format_month(const month_type &, ostream_type &, const facet_type &); };
    -

    Description

    +

    Description

    -

    -ostream_month_formatter public static functions

    +

    +ostream_month_formatter public static functions

    1. -
      static void format_month(const month_type & month, ostream_type & os, 
+
      static void format_month(const month_type & month, ostream_type & os, 
                          const facet_type & f);
      Formats a month as as string into an output iterator.
    diff --git a/doc/html/boost/date_time/ostream_time_d_idp75152960.html b/doc/html/boost/date_time/ostream_time_d_idp75152960.html deleted file mode 100644 index 7c7b5e937a..0000000000 --- a/doc/html/boost/date_time/ostream_time_d_idp75152960.html +++ /dev/null @@ -1,66 +0,0 @@ - - - - -Class template ostream_time_duration_formatter - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Class template ostream_time_duration_formatter

    -

    boost::date_time::ostream_time_duration_formatter — Put a time type into a stream using appropriate facets.

    -
    -

    Synopsis

    -
    // In header: <boost/date_time/time_formatting_streams.hpp>
-
-template<typename time_duration_type, typename charT = char> 
-class ostream_time_duration_formatter {
-public:
-  // types
-  typedef std::basic_ostream< charT >                 ostream_type;           
-  typedef time_duration_type::fractional_seconds_type fractional_seconds_type;
-
-  // public static functions
-  static void duration_put(const time_duration_type &, ostream_type &);
-};
    -
    -

    Description

    -
    -

    -ostream_time_duration_formatter public static functions

    -
    1. -
      static void duration_put(const time_duration_type & td, ostream_type & os);
      Put time into an ostream.
    -
    -
    -
    - - - -
    Copyright © 2001-2005 CrystalClear Software, Inc

    Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/date_time/ostream_time_formatter.html b/doc/html/boost/date_time/ostream_time_formatter.html index 2632b64555..2dc1957bfd 100644 --- a/doc/html/boost/date_time/ostream_time_formatter.html +++ b/doc/html/boost/date_time/ostream_time_formatter.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -39,18 +39,18 @@ typedef std::basic_ostream< charT > ostream_type; typedef time_type::date_type date_type; typedef time_type::time_duration_type time_duration_type; - typedef ostream_time_duration_formatter< time_duration_type, charT > duration_formatter; + typedef ostream_time_duration_formatter< time_duration_type, charT > duration_formatter; - // public static functions - static void time_put(const time_type &, ostream_type &); + // public static functions + static void time_put(const time_type &, ostream_type &); };
    -

    Description

    +

    Description

    -

    -ostream_time_formatter public static functions

    +

    +ostream_time_formatter public static functions

    1. -
      static void time_put(const time_type & t, ostream_type & os);
      Put time into an ostream.
    +
    static void time_put(const time_type & t, ostream_type & os);
    Put time into an ostream.
    @@ -62,7 +62,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/date_time/ostream_time_p_idp94853696.html b/doc/html/boost/date_time/ostream_time_p_idp94853696.html deleted file mode 100644 index 5f2f64800d..0000000000 --- a/doc/html/boost/date_time/ostream_time_p_idp94853696.html +++ /dev/null @@ -1,67 +0,0 @@ - - - - -Class template ostream_time_period_formatter - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Class template ostream_time_period_formatter

    -

    boost::date_time::ostream_time_period_formatter — Put a time period into a stream using appropriate facets.

    -
    -

    Synopsis

    -
    // In header: <boost/date_time/time_formatting_streams.hpp>
-
-template<typename time_period_type, typename charT = char> 
-class ostream_time_period_formatter {
-public:
-  // types
-  typedef std::basic_ostream< charT >                ostream_type;  
-  typedef time_period_type::point_type               time_type;     
-  typedef ostream_time_formatter< time_type, charT > time_formatter;
-
-  // public static functions
-  static void period_put(const time_period_type &, ostream_type &);
-};
    -
    -

    Description

    -
    -

    -ostream_time_period_formatter public static functions

    -
    1. -
      static void period_put(const time_period_type & tp, ostream_type & os);
      Put time into an ostream.
    -
    -
    -
    - - - -
    Copyright © 2001-2005 CrystalClear Software, Inc

    Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/date_time/ostream_weekday_formatter.html b/doc/html/boost/date_time/ostream_weekday_formatter.html index 95cfde6129..448c0de6c1 100644 --- a/doc/html/boost/date_time/ostream_weekday_formatter.html +++ b/doc/html/boost/date_time/ostream_weekday_formatter.html @@ -39,17 +39,17 @@ typedef facet_type::month_type month_type; typedef std::basic_ostream< charT > ostream_type; - // public static functions - static void format_weekday(const weekday_type &, ostream_type &, + // public static functions + static void format_weekday(const weekday_type &, ostream_type &, const facet_type &, bool); };
    -

    Description

    +

    Description

    -

    -ostream_weekday_formatter public static functions

    +

    +ostream_weekday_formatter public static functions

    1. -
      static void format_weekday(const weekday_type & wd, ostream_type & os, 
+
      static void format_weekday(const weekday_type & wd, ostream_type & os, 
                            const facet_type & f, bool as_long_string);
      Formats a month as as string into an output iterator.
    diff --git a/doc/html/boost/date_time/ostream_ymd_formatter.html b/doc/html/boost/date_time/ostream_ymd_formatter.html index 455efdf6ca..732b2350d5 100644 --- a/doc/html/boost/date_time/ostream_ymd_formatter.html +++ b/doc/html/boost/date_time/ostream_ymd_formatter.html @@ -41,16 +41,16 @@ typedef std::basic_ostream< charT > ostream_type; typedef std::basic_string< charT > foo_type; - // public static functions - static void ymd_put(ymd_type, ostream_type &, const facet_type &); + // public static functions + static void ymd_put(ymd_type, ostream_type &, const facet_type &); };
    -

    Description

    +

    Description

    -

    -ostream_ymd_formatter public static functions

    +

    +ostream_ymd_formatter public static functions

    1. -
      static void ymd_put(ymd_type ymd, ostream_type & os, const facet_type & f);
      Convert ymd to a standard string formatting policies.

      This is standard code for handling date formatting with year-month-day based date information. This function uses the format_type to control whether the string will contain separator characters, and if so what the character will be. In addtion, it can format the month as either an integer or a string as controled by the formatting policy

      +
      static void ymd_put(ymd_type ymd, ostream_type & os, const facet_type & f);
      Convert ymd to a standard string formatting policies.

      This is standard code for handling date formatting with year-month-day based date information. This function uses the format_type to control whether the string will contain separator characters, and if so what the character will be. In addtion, it can format the month as either an integer or a string as controled by the formatting policy

    diff --git a/doc/html/boost/date_time/parse_date.html b/doc/html/boost/date_time/parse_date.html index 7c6b0bdfb3..371389d516 100644 --- a/doc/html/boost/date_time/parse_date.html +++ b/doc/html/boost/date_time/parse_date.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -36,7 +36,7 @@ template<typename date_type> date_type parse_date(const std::string & s, int order_spec = ymd_order_iso);
    -

    Description

    +

    Description

    Accepted formats are: "2003-02-10" or " 2003-Feb-10" or "2003-Feburary-10" The order in which the Month, Day, & Year appear in the argument string can be accomodated by passing in the appropriate ymd_order_spec

    @@ -48,7 +48,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/date_time/parse_de_idm45507103907392.html b/doc/html/boost/date_time/parse_de_idm45507103907392.html new file mode 100644 index 0000000000..3116391d5a --- /dev/null +++ b/doc/html/boost/date_time/parse_de_idm45507103907392.html @@ -0,0 +1,55 @@ + + + + +Function template parse_delimited_time_duration + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template parse_delimited_time_duration

    +

    boost::date_time::parse_delimited_time_duration — Creates a time_duration object from a delimited string.

    +
    +

    Synopsis

    +
    // In header: <boost/date_time/time_parsing.hpp>
+
+
+template<typename time_duration> 
+  time_duration parse_delimited_time_duration(const std::string & s);
    +
    +

    Description

    +

    Expected format for string is "[-]h[h][:mm][:ss][.fff]". If the number of fractional digits provided is greater than the precision of the time duration type then the extra digits are truncated.

    +

    A negative duration will be created if the first character in string is a '-', all other '-' will be treated as delimiters. Accepted delimiters are "-:,.".

    +
    +
    + + + +
    Copyright © 2001-2005 CrystalClear Software, Inc

    Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/date_time/parse_delimit_idp112715600.html b/doc/html/boost/date_time/parse_delimit_idp112715600.html deleted file mode 100644 index 593d450946..0000000000 --- a/doc/html/boost/date_time/parse_delimit_idp112715600.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Function template parse_delimited_time_duration - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template parse_delimited_time_duration

    -

    boost::date_time::parse_delimited_time_duration — Creates a time_duration object from a delimited string.

    -
    -

    Synopsis

    -
    // In header: <boost/date_time/time_parsing.hpp>
-
-
-template<typename time_duration> 
-  time_duration parse_delimited_time_duration(const std::string & s);
    -
    -

    Description

    -

    Expected format for string is "[-]h[h][:mm][:ss][.fff]". If the number of fractional digits provided is greater than the precision of the time duration type then the extra digits are truncated.

    -

    A negative duration will be created if the first character in string is a '-', all other '-' will be treated as delimiters. Accepted delimiters are "-:,.".

    -
    -
    - - - -
    Copyright © 2001-2005 CrystalClear Software, Inc

    Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/date_time/parse_match_result.html b/doc/html/boost/date_time/parse_match_result.html index bf7c41fcf2..3bd75c2531 100644 --- a/doc/html/boost/date_time/parse_match_result.html +++ b/doc/html/boost/date_time/parse_match_result.html @@ -40,12 +40,12 @@ enum PARSE_STATE { PARSE_ERROR = = -1 }; // construct/copy/destruct - parse_match_result(); + parse_match_result(); - // public member functions - string_type remaining() const; - charT last_char() const; - bool has_remaining() const; + // public member functions + string_type remaining() const; + charT last_char() const; + bool has_remaining() const; // public data members string_type cache; @@ -53,22 +53,22 @@ short current_match; };
    -

    Description

    +

    Description

    -

    +

    parse_match_result public construct/copy/destruct

    -
    1. parse_match_result();
    +
    1. parse_match_result();
    -

    -parse_match_result public member functions

    +

    +parse_match_result public member functions

      -
    1. string_type remaining() const;
      2. -
    2. charT last_char() const;
      3. +
    3. string_type remaining() const;
      4. +
    4. charT last_char() const;
    5. -
      bool has_remaining() const;
      Returns true if more characters were parsed than was necessary.

      Should be used in conjunction with last_char() to get the remaining character.

      +
      bool has_remaining() const;
      Returns true if more characters were parsed than was necessary.

      Should be used in conjunction with last_char() to get the remaining character.

    diff --git a/doc/html/boost/date_time/partial_date.html b/doc/html/boost/date_time/partial_date.html index ad4b452b07..fc43b09035 100644 --- a/doc/html/boost/date_time/partial_date.html +++ b/doc/html/boost/date_time/partial_date.html @@ -46,20 +46,20 @@ typedef duration_type::duration_rep duration_rep; // construct/copy/destruct - partial_date(day_type, month_type); - partial_date(duration_rep); + partial_date(day_type, month_type); + partial_date(duration_rep); - // public member functions - virtual date_type get_date(year_type) const; - date_type operator()(year_type) const; - bool operator==(const partial_date &) const; - bool operator<(const partial_date &) const; - month_type month() const; - day_type day() const; - virtual std::string to_string() const; + // public member functions + virtual date_type get_date(year_type) const; + date_type operator()(year_type) const; + bool operator==(const partial_date &) const; + bool operator<(const partial_date &) const; + month_type month() const; + day_type day() const; + virtual std::string to_string() const; };
    -

    Description

    +

    Description

    Example usage: 

    partial_date pd(1, Jan);
 partial_date pd2(70);
@@ -68,36 +68,36 @@

    -

    +

    partial_date public construct/copy/destruct

      -
    1. partial_date(day_type d, month_type m);
      2. +
    2. partial_date(day_type d, month_type m);
    3. -
      partial_date(duration_rep days);
      Partial date created from number of days into year. Range 1-366.

      Allowable values range from 1 to 366. 1=Jan1, 366=Dec31. If argument exceeds range, partial_date will be created with closest in-range value. 60 will always be Feb29, if get_date() is called with a non-leap year an exception will be thrown

      +
      partial_date(duration_rep days);
      Partial date created from number of days into year. Range 1-366.

      Allowable values range from 1 to 366. 1=Jan1, 366=Dec31. If argument exceeds range, partial_date will be created with closest in-range value. 60 will always be Feb29, if get_date() is called with a non-leap year an exception will be thrown

    -

    -partial_date public member functions

    +

    +partial_date public member functions

    1. -
      virtual date_type get_date(year_type y) const;
      Return a concrete date when provided with a year specific year.

      Will throw an 'invalid_argument' exception if a partial_date object, instantiated with Feb-29, has get_date called with a non-leap year. Example:

      +
      virtual date_type get_date(year_type y) const;
      Return a concrete date when provided with a year specific year.

      Will throw an 'invalid_argument' exception if a partial_date object, instantiated with Feb-29, has get_date called with a non-leap year. Example: 

      partial_date pd(29, Feb);
 pd.get_date(2003); // throws invalid_argument exception
 pg.get_date(2000); // returns 2000-2-29

      2. -
    2. date_type operator()(year_type y) const;
      3. -
    3. bool operator==(const partial_date & rhs) const;
      4. -
    4. bool operator<(const partial_date & rhs) const;
      5. -
    5. month_type month() const;
      6. -
    6. day_type day() const;
      7. +
    7. date_type operator()(year_type y) const;
      8. +
    8. bool operator==(const partial_date & rhs) const;
      9. +
    9. bool operator<(const partial_date & rhs) const;
      10. +
    10. month_type month() const;
      11. +
    11. day_type day() const;
    12. -
      virtual std::string to_string() const;
      Returns string suitable for use in POSIX time zone string.

      Returns string formatted with up to 3 digits: Jan-01 == "0" Feb-29 == "58" Dec-31 == "365"

      +
      virtual std::string to_string() const;
      Returns string suitable for use in POSIX time zone string.

      Returns string formatted with up to 3 digits: Jan-01 == "0" Feb-29 == "58" Dec-31 == "365"

    diff --git a/doc/html/boost/date_time/period.html b/doc/html/boost/date_time/period.html index d1b45fbadb..fe90fb39a5 100644 --- a/doc/html/boost/date_time/period.html +++ b/doc/html/boost/date_time/period.html @@ -41,72 +41,72 @@ typedef duration_rep duration_type; // construct/copy/destruct - period(point_rep, point_rep); - period(point_rep, duration_rep); + period(point_rep, point_rep); + period(point_rep, duration_rep); - // public member functions - point_rep begin() const; - point_rep end() const; - point_rep last() const; - duration_rep length() const; - bool is_null() const; - bool operator==(const period &) const; - bool operator<(const period &) const; - void shift(const duration_rep &); - void expand(const duration_rep &); - bool contains(const point_rep &) const; - bool contains(const period &) const; - bool intersects(const period &) const; - bool is_adjacent(const period &) const; - bool is_before(const point_rep &) const; - bool is_after(const point_rep &) const; - period intersection(const period &) const; - period merge(const period &) const; - period span(const period &) const; + // public member functions + point_rep begin() const; + point_rep end() const; + point_rep last() const; + duration_rep length() const; + bool is_null() const; + bool operator==(const period &) const; + bool operator<(const period &) const; + void shift(const duration_rep &); + void expand(const duration_rep &); + bool contains(const point_rep &) const; + bool contains(const period &) const; + bool intersects(const period &) const; + bool is_adjacent(const period &) const; + bool is_before(const point_rep &) const; + bool is_after(const point_rep &) const; + period intersection(const period &) const; + period merge(const period &) const; + period span(const period &) const; };
    -

    Description

    +

    Description

    This template uses a class to represent a time point within the period and another class to represent a duration. As a result, this class is not appropriate for use when the number and duration representation are the same (eg: in the regular number domain).

    A period can be specified by providing either the begining point and a duration or the begining point and the end point( end is NOT part of the period but 1 unit past it. A period will be "invalid" if either end_point <= begin_point or the given duration is <= 0. Any valid period will return false for is_null().

    Zero length periods are also considered invalid. Zero length periods are periods where the begining and end points are the same, or, the given duration is zero. For a zero length period, the last point will be one unit less than the begining point.

    In the case that the begin and last are the same, the period has a length of one unit.

    The best way to handle periods is usually to provide a begining point and a duration. So, day1 + 7 days is a week period which includes all of the first day and 6 more days (eg: Sun to Sat).

    -

    +

    period public construct/copy/destruct

    1. -
      period(point_rep first_point, point_rep end_point);
      create a period from begin to last eg: [begin,end)

      If end <= begin then the period will be invalid

      +
      period(point_rep first_point, point_rep end_point);
      create a period from begin to last eg: [begin,end)

      If end <= begin then the period will be invalid

    2. -
      period(point_rep first_point, duration_rep len);
      create a period as [begin, begin+len)

      If len is <= 0 then the period will be invalid

      +
      period(point_rep first_point, duration_rep len);
      create a period as [begin, begin+len)

      If len is <= 0 then the period will be invalid

    -

    -period public member functions

    +

    +period public member functions

    1. -
      point_rep begin() const;
      Return the first element in the period.
      2. +
      point_rep begin() const;
      Return the first element in the period.
    2. -
      point_rep end() const;
      Return one past the last element.
      3. +
      point_rep end() const;
      Return one past the last element.
    3. -
      point_rep last() const;
      Return the last item in the period.
      4. +
      point_rep last() const;
      Return the last item in the period.
    4. -
      duration_rep length() const;
      Return the length of the period.
      5. +
      duration_rep length() const;
      Return the length of the period.
    5. -
      bool is_null() const;
      True if period is ill formed (length is zero or less)
      6. +
      bool is_null() const;
      True if period is ill formed (length is zero or less)
    6. -
      bool operator==(const period & rhs) const;
      Equality operator.
      7. +
      bool operator==(const period & rhs) const;
      Equality operator.
    7. -
      bool operator<(const period & rhs) const;
      Strict as defined by rhs.last <= lhs.last.
      8. +
      bool operator<(const period & rhs) const;
      Strict as defined by rhs.last <= lhs.last.
    8. -
      void shift(const duration_rep & d);
      Shift the start and end by the specified amount.
      9. +
      void shift(const duration_rep & d);
      Shift the start and end by the specified amount.
    9. -
      void expand(const duration_rep & d);
      +
      void expand(const duration_rep & d);

      Expands the size of the period by the duration on both ends.

      So before expand 

              [-------]
@@ -121,23 +121,23 @@
    10. -
      bool contains(const point_rep & point) const;
      True if the point is inside the period, zero length periods contain no points.
      11. +
      bool contains(const point_rep & point) const;
      True if the point is inside the period, zero length periods contain no points.
    11. -
      bool contains(const period & other) const;
      True if this period fully contains (or equals) the other period.
      12. +
      bool contains(const period & other) const;
      True if this period fully contains (or equals) the other period.
    12. -
      bool intersects(const period & other) const;
      True if the periods overlap in any way.
      13. +
      bool intersects(const period & other) const;
      True if the periods overlap in any way.
    13. -
      bool is_adjacent(const period & other) const;
      True if periods are next to each other without a gap.
      14. +
      bool is_adjacent(const period & other) const;
      True if periods are next to each other without a gap.
    14. -
      bool is_before(const point_rep & point) const;
      True if all of the period is prior to the passed point or end <= t.
      15. +
      bool is_before(const point_rep & point) const;
      True if all of the period is prior to the passed point or end <= t.
    15. -
      bool is_after(const point_rep & point) const;
      True if all of the period is prior or t < start.
      16. +
      bool is_after(const point_rep & point) const;
      True if all of the period is prior or t < start.
    16. -
      period intersection(const period & other) const;
      Returns the period of intersection or invalid range no intersection.
      17. +
      period intersection(const period & other) const;
      Returns the period of intersection or invalid range no intersection.
    17. -
      period merge(const period & other) const;
      Returns the union of intersecting periods <ndash></ndash> or null period.
      18. +
      period merge(const period & other) const;
      Returns the union of intersecting periods <ndash></ndash> or null period.
    18. -
      period span(const period & other) const;
      Combine two periods with earliest start and latest end.

      Combines two periods and any gap between them such that start = min(p1.start, p2.start) end = max(p1.end , p2.end)

      +
      period span(const period & other) const;
      Combine two periods with earliest start and latest end.

      Combines two periods and any gap between them such that start = min(p1.start, p2.start) end = max(p1.end , p2.end) 

             [---p1---)
                       [---p2---)
 result:
diff --git a/doc/html/boost/date_time/period_formatter.html b/doc/html/boost/date_time/period_formatter.html
index b7298f4f81..ba109e62a5 100644
--- a/doc/html/boost/date_time/period_formatter.html
+++ b/doc/html/boost/date_time/period_formatter.html
@@ -45,22 +45,22 @@
   enum range_display_options { AS_OPEN_RANGE, AS_CLOSED_RANGE };
 
   // construct/copy/destruct
-  period_formatter(range_display_options = AS_CLOSED_RANGE, 
+  period_formatter(range_display_options = AS_CLOSED_RANGE, 
                    const char_type *const = default_period_separator, 
                    const char_type *const = default_period_start_delimeter, 
                    const char_type *const = default_period_open_range_end_delimeter, 
                    const char_type *const = default_period_closed_range_end_delimeter);
 
-  // public member functions
-  OutItrT put_period_separator(OutItrT &) const;
-  OutItrT put_period_start_delimeter(OutItrT &) const;
-  OutItrT put_period_end_delimeter(OutItrT &) const;
-  range_display_options range_option() const;
-  void range_option(range_display_options) const;
-  void delimiter_strings(const string_type &, const string_type &, 
+  // public member functions
+  OutItrT put_period_separator(OutItrT &) const;
+  OutItrT put_period_start_delimeter(OutItrT &) const;
+  OutItrT put_period_end_delimeter(OutItrT &) const;
+  range_display_options range_option() const;
+  void range_option(range_display_options) const;
+  void delimiter_strings(const string_type &, const string_type &, 
                          const string_type &, const string_type &);
   template<typename period_type, typename facet_type> 
-    OutItrT put_period(OutItrT, std::ios_base &, char_type, 
+    OutItrT put_period(OutItrT, std::ios_base &, char_type, 
                        const period_type &, const facet_type &) const;
 
   // public data members
@@ -70,7 +70,7 @@
   static const char_type default_period_closed_range_end_delimeter;
 };
    -

    Description

    +

    Description

    Provides settings for the following:

    • period_separator <ndash></ndash> default '/'

      • @@ -89,35 +89,35 @@

      where the date formatting is controlled by the date facet

      -

      +

      period_formatter public construct/copy/destruct

      1. -
        period_formatter(range_display_options range_option_in = AS_CLOSED_RANGE, 
+
        period_formatter(range_display_options range_option_in = AS_CLOSED_RANGE, 
                  const char_type *const period_separator = default_period_separator, 
                  const char_type *const period_start_delimeter = default_period_start_delimeter, 
                  const char_type *const period_open_range_end_delimeter = default_period_open_range_end_delimeter, 
                  const char_type *const period_closed_range_end_delimeter = default_period_closed_range_end_delimeter);
        Constructor that sets up period formatter options <ndash></ndash> default should suffice most cases.
      -

      -period_formatter public member functions

      +

      +period_formatter public member functions

      1. -
        OutItrT put_period_separator(OutItrT & oitr) const;
        Puts the characters between period elements into stream <ndash></ndash> default is /.
        2. +
        OutItrT put_period_separator(OutItrT & oitr) const;
        Puts the characters between period elements into stream <ndash></ndash> default is /.
      2. -
        OutItrT put_period_start_delimeter(OutItrT & oitr) const;
        Puts the period start characters into stream <ndash></ndash> default is [.
        3. +
        OutItrT put_period_start_delimeter(OutItrT & oitr) const;
        Puts the period start characters into stream <ndash></ndash> default is [.
      3. -
        OutItrT put_period_end_delimeter(OutItrT & oitr) const;
        Puts the period end characters into stream as controled by open/closed range setting.
        4. -
      4. range_display_options range_option() const;
        5. +
        OutItrT put_period_end_delimeter(OutItrT & oitr) const;
        Puts the period end characters into stream as controled by open/closed range setting. +
      5. range_display_options range_option() const;
      6. -
        void range_option(range_display_options option) const;
        Reset the range_option control.
        7. -
      7. void delimiter_strings(const string_type &, const string_type &, 
+
        void range_option(range_display_options option) const;
        Reset the range_option control.
        8. +
      8. void delimiter_strings(const string_type &, const string_type &, 
                        const string_type &, const string_type &);
      9. template<typename period_type, typename facet_type> 
-  OutItrT put_period(OutItrT next, std::ios_base & a_ios, char_type a_fill, 
+  OutItrT put_period(OutItrT next, std::ios_base & a_ios, char_type a_fill, 
                      const period_type & p, const facet_type & facet) const;
        Generic code to output a period <ndash></ndash> no matter the period type.

        This generic code will output any period using a facet to to output the 'elements'. For example, in the case of a date_period the elements will be instances of a date which will be formatted according the to setup in the passed facet parameter.

        The steps for formatting a period are always the same:

          diff --git a/doc/html/boost/date_time/period_parser.html b/doc/html/boost/date_time/period_parser.html index 96ba3aa284..9564ecfa08 100644 --- a/doc/html/boost/date_time/period_parser.html +++ b/doc/html/boost/date_time/period_parser.html @@ -46,26 +46,26 @@ enum period_range_option { AS_OPEN_RANGE, AS_CLOSED_RANGE }; // construct/copy/destruct - period_parser(period_range_option = AS_CLOSED_RANGE, + period_parser(period_range_option = AS_CLOSED_RANGE, const char_type *const = default_period_separator, const char_type *const = default_period_start_delimeter, const char_type *const = default_period_open_range_end_delimeter, const char_type *const = default_period_closed_range_end_delimeter); - period_parser(const period_parser< date_type, CharT > &); + period_parser(const period_parser< date_type, CharT > &); - // public member functions - period_range_option range_option() const; - void range_option(period_range_option); - collection_type delimiter_strings() const; - void delimiter_strings(const string_type &, const string_type &, + // public member functions + period_range_option range_option() const; + void range_option(period_range_option); + collection_type delimiter_strings() const; + void delimiter_strings(const string_type &, const string_type &, const string_type &, const string_type &); template<typename period_type, typename duration_type, typename facet_type> - period_type get_period(stream_itr_type &, stream_itr_type &, + period_type get_period(stream_itr_type &, stream_itr_type &, std::ios_base &, const period_type &, const duration_type &, const facet_type &) const; - // private member functions - void consume_delim(stream_itr_type &, stream_itr_type &, + // private member functions + void consume_delim(stream_itr_type &, stream_itr_type &, const string_type &) const; // public data members @@ -75,7 +75,7 @@ static const char_type default_period_closed_range_end_delimeter; };
        -

        Description

        +

        Description

        Provides settings for the following:

        • period_separator <ndash></ndash> default '/'

          • @@ -91,34 +91,34 @@

          where the date format is controlled by the date facet

          -

          +

          period_parser public construct/copy/destruct

          1. -
            period_parser(period_range_option range_opt = AS_CLOSED_RANGE, 
+
            period_parser(period_range_option range_opt = AS_CLOSED_RANGE, 
               const char_type *const period_separator = default_period_separator, 
               const char_type *const period_start_delimeter = default_period_start_delimeter, 
               const char_type *const period_open_range_end_delimeter = default_period_open_range_end_delimeter, 
               const char_type *const period_closed_range_end_delimeter = default_period_closed_range_end_delimeter);
            Constructor that sets up period parser options.
            2. -
          2. period_parser(const period_parser< date_type, CharT > & p_parser);
            3. +
          3. period_parser(const period_parser< date_type, CharT > & p_parser);
          -

          -period_parser public member functions

          +

          +period_parser public member functions

            -
          1. period_range_option range_option() const;
            2. -
          2. void range_option(period_range_option option);
            3. -
          3. collection_type delimiter_strings() const;
            4. -
          4. void delimiter_strings(const string_type & separator, 
+
          5. period_range_option range_option() const;
            6. 
+
          6. void range_option(period_range_option option);
            7. 
+
          7. collection_type delimiter_strings() const;
            8. 
+
          8. void delimiter_strings(const string_type & separator, 
                        const string_type & start_delim, 
                        const string_type & open_end_delim, 
                        const string_type & closed_end_delim);
            9. 
 
          9. 
 
            template<typename period_type, typename duration_type, typename facet_type> 
-  period_type get_period(stream_itr_type & sitr, stream_itr_type & stream_end, 
+  period_type get_period(stream_itr_type & sitr, stream_itr_type & stream_end, 
                          std::ios_base & a_ios, const period_type &, 
                          const duration_type & dur_unit, 
                          const facet_type & facet) const;
            Generic code to parse a period <ndash></ndash> no matter the period type. 
            This generic code will parse any period using a facet to to get the 'elements'. For example, in the case of a date_period the elements will be instances of a date which will be parsed according the to setup in the passed facet parameter.
            
@@ -141,10 +141,10 @@
          -

          -period_parser private member functions

          +

          +period_parser private member functions

          1. -
            void consume_delim(stream_itr_type & sitr, stream_itr_type & stream_end, 
+
            void consume_delim(stream_itr_type & sitr, stream_itr_type & stream_end, 
                    const string_type & delim) const;
            throws ios_base::failure if delimiter and parsed data do not match
        diff --git a/doc/html/boost/date_time/previous_weekday.html b/doc/html/boost/date_time/previous_weekday.html index 35db1c3c87..52630df2e1 100644 --- a/doc/html/boost/date_time/previous_weekday.html +++ b/doc/html/boost/date_time/previous_weekday.html @@ -36,7 +36,7 @@ template<typename date_type, typename weekday_type> date_type previous_weekday(const date_type & d, const weekday_type & wd);
        -

        Description

        +

        Description

        Generates a date object representing the date of the previous weekday from the given date. If the date given is 2004-May-9 (a Sunday) and the given weekday is Tuesday then the resulting date will be 2004-May-4.

      diff --git a/doc/html/boost/date_time/second_clock.html b/doc/html/boost/date_time/second_clock.html index fb7856e755..9c7f35eb8b 100644 --- a/doc/html/boost/date_time/second_clock.html +++ b/doc/html/boost/date_time/second_clock.html @@ -39,33 +39,33 @@ typedef time_type::date_type date_type; typedef time_type::time_duration_type time_duration_type; - // public static functions - static time_type local_time(); - static time_type universal_time(); + // public static functions + static time_type local_time(); + static time_type universal_time(); template<typename time_zone_type> - static time_type local_time(boost::shared_ptr< time_zone_type >); + static time_type local_time(boost::shared_ptr< time_zone_type >); - // private static functions - static time_type create_time(::std::tm *); + // private static functions + static time_type create_time(::std::tm *); };
      -

      Description

      +

      Description

      This clock provides resolution to the 1 second level

      -

      -second_clock public static functions

      +

      +second_clock public static functions

        -
      1. static time_type local_time();
        2. +
      2. static time_type local_time();
      3. -
        static time_type universal_time();
        Get the current day in universal date as a ymd_type.
        4. +
        static time_type universal_time();
        Get the current day in universal date as a ymd_type. 
      4. template<typename time_zone_type> 
-  static time_type local_time(boost::shared_ptr< time_zone_type > tz_ptr);
        5. + static time_type local_time(boost::shared_ptr< time_zone_type > tz_ptr);
      -

      -second_clock private static functions

      -
      1. static time_type create_time(::std::tm * current);
      +

      +second_clock private static functions

      +
      1. static time_type create_time(::std::tm * current);
    diff --git a/doc/html/boost/date_time/simple_f_idm45507093224352.html b/doc/html/boost/date_time/simple_f_idm45507093224352.html new file mode 100644 index 0000000000..9e5e95d1ba --- /dev/null +++ b/doc/html/boost/date_time/simple_f_idm45507093224352.html @@ -0,0 +1,97 @@ + + + + +Class simple_format<wchar_t> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Class simple_format<wchar_t>

    +

    boost::date_time::simple_format<wchar_t> — Specialization of formmating rules for wchar_t.

    +
    +

    Synopsis

    +
    // In header: <boost/date_time/date_format_simple.hpp>
+
+
+class simple_format<wchar_t> {
+public:
+
+  // public static functions
+  static const wchar_t * not_a_date();
+  static const wchar_t * pos_infinity();
+  static const wchar_t * neg_infinity();
+  static month_format_spec month_format();
+  static ymd_order_spec date_order();
+  static bool has_date_sep_chars();
+  static wchar_t year_sep_char();
+  static wchar_t month_sep_char();
+  static wchar_t day_sep_char();
+  static wchar_t hour_sep_char();
+  static wchar_t minute_sep_char();
+  static wchar_t second_sep_char();
+};
    +
    +

    Description

    +
    +

    +simple_format public static functions

    +
      +
    1. +
      static const wchar_t * not_a_date();
      String used printed is date is invalid.
      2. +
    2. +
      static const wchar_t * pos_infinity();
      String used to for positive infinity value.
      3. +
    3. +
      static const wchar_t * neg_infinity();
      String used to for positive infinity value.
      4. +
    4. +
      static month_format_spec month_format();
      Describe month format.
      5. +
    5. static ymd_order_spec date_order();
      6. +
    6. +
      static bool has_date_sep_chars();
      This format uses '-' to separate date elements.
      7. +
    7. +
      static wchar_t year_sep_char();
      Char to sep?
      8. +
    8. +
      static wchar_t month_sep_char();
      char between year-month
      9. +
    9. +
      static wchar_t day_sep_char();
      Char to separate month-day.
      10. +
    10. +
      static wchar_t hour_sep_char();
      char between date-hours
      11. +
    11. +
      static wchar_t minute_sep_char();
      char between hour and minute
      12. +
    12. +
      static wchar_t second_sep_char();
      char for second
      13. +
    +
    +
    +
    + + + +
    Copyright © 2001-2005 CrystalClear Software, Inc

    Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/date_time/simple_format.html b/doc/html/boost/date_time/simple_format.html index 07cdba647f..da015882c9 100644 --- a/doc/html/boost/date_time/simple_format.html +++ b/doc/html/boost/date_time/simple_format.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -36,54 +36,54 @@ class simple_format { public: - // public static functions - static const charT * not_a_date(); - static const charT * pos_infinity(); - static const charT * neg_infinity(); - static month_format_spec month_format(); - static ymd_order_spec date_order(); - static bool has_date_sep_chars(); - static charT year_sep_char(); - static charT month_sep_char(); - static charT day_sep_char(); - static charT hour_sep_char(); - static charT minute_sep_char(); - static charT second_sep_char(); + // public static functions + static const charT * not_a_date(); + static const charT * pos_infinity(); + static const charT * neg_infinity(); + static month_format_spec month_format(); + static ymd_order_spec date_order(); + static bool has_date_sep_chars(); + static charT year_sep_char(); + static charT month_sep_char(); + static charT day_sep_char(); + static charT hour_sep_char(); + static charT minute_sep_char(); + static charT second_sep_char(); };
    -

    Description

    +

    Description

    -

    -simple_format public static functions

    +

    +simple_format public static functions

    1. -
      static const charT * not_a_date();
      String used printed is date is invalid.
      2. +
      static const charT * not_a_date();
      String used printed is date is invalid.
    2. -
      static const charT * pos_infinity();
      String used to for positive infinity value.
      3. +
      static const charT * pos_infinity();
      String used to for positive infinity value.
    3. -
      static const charT * neg_infinity();
      String used to for positive infinity value.
      4. +
      static const charT * neg_infinity();
      String used to for positive infinity value.
    4. -
      static month_format_spec month_format();
      Describe month format.
      5. -
    5. static ymd_order_spec date_order();
      6. +
      static month_format_spec month_format();
      Describe month format. +
    6. static ymd_order_spec date_order();
    7. -
      static bool has_date_sep_chars();
      This format uses '-' to separate date elements.
      8. +
      static bool has_date_sep_chars();
      This format uses '-' to separate date elements.
    8. -
      static charT year_sep_char();
      Char to sep?
      9. +
      static charT year_sep_char();
      Char to sep?
    9. -
      static charT month_sep_char();
      char between year-month
      10. +
      static charT month_sep_char();
      char between year-month
    10. -
      static charT day_sep_char();
      Char to separate month-day.
      11. +
      static charT day_sep_char();
      Char to separate month-day.
    11. -
      static charT hour_sep_char();
      char between date-hours
      12. +
      static charT hour_sep_char();
      char between date-hours
    12. -
      static charT minute_sep_char();
      char between hour and minute
      13. +
      static charT minute_sep_char();
      char between hour and minute
    13. -
      static charT second_sep_char();
      char for second
      14. +
      static charT second_sep_char();
      char for second
    -

    Specializations

    -
    +

    Specializations

    +
    @@ -95,7 +95,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/date_time/simple_format__idp39965872.html b/doc/html/boost/date_time/simple_format__idp39965872.html deleted file mode 100644 index 525e1597b7..0000000000 --- a/doc/html/boost/date_time/simple_format__idp39965872.html +++ /dev/null @@ -1,97 +0,0 @@ - - - - -Class simple_format<wchar_t> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Class simple_format<wchar_t>

    -

    boost::date_time::simple_format<wchar_t> — Specialization of formmating rules for wchar_t.

    -
    -

    Synopsis

    -
    // In header: <boost/date_time/date_format_simple.hpp>
-
-
-class simple_format<wchar_t> {
-public:
-
-  // public static functions
-  static const wchar_t * not_a_date();
-  static const wchar_t * pos_infinity();
-  static const wchar_t * neg_infinity();
-  static month_format_spec month_format();
-  static ymd_order_spec date_order();
-  static bool has_date_sep_chars();
-  static wchar_t year_sep_char();
-  static wchar_t month_sep_char();
-  static wchar_t day_sep_char();
-  static wchar_t hour_sep_char();
-  static wchar_t minute_sep_char();
-  static wchar_t second_sep_char();
-};
    -
    -

    Description

    -
    -

    -simple_format public static functions

    -
      -
    1. -
      static const wchar_t * not_a_date();
      String used printed is date is invalid.
      2. -
    2. -
      static const wchar_t * pos_infinity();
      String used to for positive infinity value.
      3. -
    3. -
      static const wchar_t * neg_infinity();
      String used to for positive infinity value.
      4. -
    4. -
      static month_format_spec month_format();
      Describe month format.
      5. -
    5. static ymd_order_spec date_order();
      6. -
    6. -
      static bool has_date_sep_chars();
      This format uses '-' to separate date elements.
      7. -
    7. -
      static wchar_t year_sep_char();
      Char to sep?
      8. -
    8. -
      static wchar_t month_sep_char();
      char between year-month
      9. -
    9. -
      static wchar_t day_sep_char();
      Char to separate month-day.
      10. -
    10. -
      static wchar_t hour_sep_char();
      char between date-hours
      11. -
    11. -
      static wchar_t minute_sep_char();
      char between hour and minute
      12. -
    12. -
      static wchar_t second_sep_char();
      char for second
      13. -
    -
    -
    -
    - - - -
    Copyright © 2001-2005 CrystalClear Software, Inc

    Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/date_time/special_values_formatter.html b/doc/html/boost/date_time/special_values_formatter.html index e8257fdbee..5feeea05ed 100644 --- a/doc/html/boost/date_time/special_values_formatter.html +++ b/doc/html/boost/date_time/special_values_formatter.html @@ -42,32 +42,32 @@ typedef std::vector< string_type > collection_type; // construct/copy/destruct - special_values_formatter(); - special_values_formatter(const char_type *const *, const char_type *const *); - special_values_formatter(typename collection_type::iterator, + special_values_formatter(); + special_values_formatter(const char_type *const *, const char_type *const *); + special_values_formatter(typename collection_type::iterator, typename collection_type::iterator); - // public member functions - OutItrT put_special(OutItrT, const boost::date_time::special_values &) const; + // public member functions + OutItrT put_special(OutItrT, const boost::date_time::special_values &) const; // public data members static const char_type default_special_value_names; // Storage for the strings used to indicate special values. };
    -

    Description

    +

    Description

    This class provides for the formmating of special values to an output stream. In particular, it produces strings for the values of negative and positive infinity as well as not_a_date_time.

    While not a facet, this class is used by the date and time facets for formatting special value types.

    -

    +

    special_values_formatter public construct/copy/destruct

    1. -
      special_values_formatter();
      Construct special values formatter using default strings.

      Default strings are not-a-date-time -infinity +infinity

      +
      special_values_formatter();
      Construct special values formatter using default strings.

      Default strings are not-a-date-time -infinity +infinity

    2. -
      special_values_formatter(const char_type *const * begin, 
+
      special_values_formatter(const char_type *const * begin, 
                          const char_type *const * end);
      Construct special values formatter from array of strings. 
      This constructor will take pair of iterators from an array of strings that represent the special values and copy them for use in formatting special values. 
      
 
      const char* const special_value_names[]={"nadt","-inf","+inf" };
 
@@ -75,14 +75,14 @@
      3. -
    3. special_values_formatter(typename collection_type::iterator beg, 
+
    4. special_values_formatter(typename collection_type::iterator beg, 
                          typename collection_type::iterator end);
      5.
    -

    -special_values_formatter public member functions

    -
    1. OutItrT put_special(OutItrT next, 
+
      
+special_values_formatter public member functions
      
+
      1. OutItrT put_special(OutItrT next, 
                     const boost::date_time::special_values & value) const;
    diff --git a/doc/html/boost/date_time/special_values_parser.html b/doc/html/boost/date_time/special_values_parser.html index d3a59d1195..8d8bd7a83f 100644 --- a/doc/html/boost/date_time/special_values_parser.html +++ b/doc/html/boost/date_time/special_values_parser.html @@ -45,19 +45,19 @@ typedef charT char_type; // construct/copy/destruct - special_values_parser(); - special_values_parser(const string_type &, const string_type &, + special_values_parser(); + special_values_parser(const string_type &, const string_type &, const string_type &, const string_type &, const string_type &); - special_values_parser(typename collection_type::iterator, + special_values_parser(typename collection_type::iterator, typename collection_type::iterator); - special_values_parser(const special_values_parser< date_type, charT > &); + special_values_parser(const special_values_parser< date_type, charT > &); - // public member functions - void sv_strings(const string_type &, const string_type &, + // public member functions + void sv_strings(const string_type &, const string_type &, const string_type &, const string_type &, const string_type &); - bool match(stream_itr_type &, stream_itr_type &, match_results &) const; + bool match(stream_itr_type &, stream_itr_type &, match_results &) const; // public data members static const char_type nadt_string; @@ -67,7 +67,7 @@ static const char_type max_date_time_string; };
    -

    Description

    +

    Description

    TODO: add doc-comments for which elements can be changed Parses input stream for strings representing special_values. Special values parsed are:

    • not_a_date_time

      • @@ -79,35 +79,35 @@

      -

      +

      special_values_parser public construct/copy/destruct

      1. -
        special_values_parser();
        Creates a special_values_parser with the default set of "sv_strings".
        2. +
        special_values_parser();
        Creates a special_values_parser with the default set of "sv_strings".
      2. -
        special_values_parser(const string_type & nadt_str, 
+
        special_values_parser(const string_type & nadt_str, 
                       const string_type & neg_inf_str, 
                       const string_type & pos_inf_str, 
                       const string_type & min_dt_str, 
                       const string_type & max_dt_str);
        Creates a special_values_parser using a user defined set of element strings.
        3. -
      3. special_values_parser(typename collection_type::iterator beg, 
+
      4. special_values_parser(typename collection_type::iterator beg, 
                       typename collection_type::iterator end);
        5. 
-
      5. special_values_parser(const special_values_parser< date_type, charT > & svp);
        6. 
+
      6. special_values_parser(const special_values_parser< date_type, charT > & svp);
        7.
      -

      -special_values_parser public member functions

      +

      +special_values_parser public member functions

      1. -
        void sv_strings(const string_type & nadt_str, const string_type & neg_inf_str, 
+
        void sv_strings(const string_type & nadt_str, const string_type & neg_inf_str, 
                 const string_type & pos_inf_str, 
                 const string_type & min_dt_str, 
                 const string_type & max_dt_str);
        Replace special value strings.
      2. -
        bool match(stream_itr_type & sitr, stream_itr_type & str_end, 
+
        bool match(stream_itr_type & sitr, stream_itr_type & str_end, 
            match_results & mr) const;
        Sets match_results.current_match to the corresponding special_value or -1.
      diff --git a/doc/html/boost/date_time/split_timedate_system.html b/doc/html/boost/date_time/split_timedate_system.html index fef24e5cdb..764844bda0 100644 --- a/doc/html/boost/date_time/split_timedate_system.html +++ b/doc/html/boost/date_time/split_timedate_system.html @@ -46,63 +46,63 @@ typedef date_time::wrapping_int< split_timedate_system::int_type, split_timedate_system::ticks_per_day > wrap_int_type; typedef date_time::wrapping_int< int_type, ticks_per_day > wrap_int_type; - // private member functions - BOOST_STATIC_CONSTANT(int_type, + // private member functions + BOOST_STATIC_CONSTANT(int_type, ticks_per_day = INT64_C(86400)*config::tick_per_second); - // public static functions - static time_rep_type get_time_rep(special_values); + // public static functions + static time_rep_type get_time_rep(special_values); static time_rep_type - get_time_rep(const date_type &, const time_duration_type &, + get_time_rep(const date_type &, const time_duration_type &, date_time::dst_flags = not_dst); - static date_type get_date(const time_rep_type &); - static time_duration_type get_time_of_day(const time_rep_type &); - static std::string zone_name(const time_rep_type &); - static bool is_equal(const time_rep_type &, const time_rep_type &); - static bool is_less(const time_rep_type &, const time_rep_type &); + static date_type get_date(const time_rep_type &); + static time_duration_type get_time_of_day(const time_rep_type &); + static std::string zone_name(const time_rep_type &); + static bool is_equal(const time_rep_type &, const time_rep_type &); + static bool is_less(const time_rep_type &, const time_rep_type &); static time_rep_type - add_days(const time_rep_type &, const date_duration_type &); + add_days(const time_rep_type &, const date_duration_type &); static time_rep_type - subtract_days(const time_rep_type &, const date_duration_type &); + subtract_days(const time_rep_type &, const date_duration_type &); static time_rep_type - subtract_time_duration(const time_rep_type &, const time_duration_type &); + subtract_time_duration(const time_rep_type &, const time_duration_type &); static time_rep_type - add_time_duration(const time_rep_type &, time_duration_type); + add_time_duration(const time_rep_type &, time_duration_type); static time_duration_type - subtract_times(const time_rep_type &, const time_rep_type &); + subtract_times(const time_rep_type &, const time_rep_type &); };
    -

    Description

    +

    Description

    -

    -split_timedate_system private member functions

    -
    1.  BOOST_STATIC_CONSTANT(int_type, 
+
      
+split_timedate_system private member functions
      
+
      1.  BOOST_STATIC_CONSTANT(int_type, 
                        ticks_per_day = INT64_C(86400)*config::tick_per_second);
    -

    -split_timedate_system public static functions

    +

    +split_timedate_system public static functions

      -
    1. static time_rep_type get_time_rep(special_values sv);
      2. +
    2. static time_rep_type get_time_rep(special_values sv);
    3. static time_rep_type 
-get_time_rep(const date_type & day, const time_duration_type & tod, 
+get_time_rep(const date_type & day, const time_duration_type & tod, 
              date_time::dst_flags = not_dst);
      4. -
    4. static date_type get_date(const time_rep_type & val);
      5. -
    5. static time_duration_type get_time_of_day(const time_rep_type & val);
      6. -
    6. static std::string zone_name(const time_rep_type &);
      7. -
    7. static bool is_equal(const time_rep_type & lhs, const time_rep_type & rhs);
      8. -
    8. static bool is_less(const time_rep_type & lhs, const time_rep_type & rhs);
      9. +
    9. static date_type get_date(const time_rep_type & val);
      10. +
    10. static time_duration_type get_time_of_day(const time_rep_type & val);
      11. +
    11. static std::string zone_name(const time_rep_type &);
      12. +
    12. static bool is_equal(const time_rep_type & lhs, const time_rep_type & rhs);
      13. +
    13. static bool is_less(const time_rep_type & lhs, const time_rep_type & rhs);
    14. static time_rep_type 
-add_days(const time_rep_type & base, const date_duration_type & dd);
      15. +add_days(const time_rep_type & base, const date_duration_type & dd); 
    15. static time_rep_type 
-subtract_days(const time_rep_type & base, const date_duration_type & dd);
      16. +subtract_days(const time_rep_type & base, const date_duration_type & dd); 
    16. static time_rep_type 
-subtract_time_duration(const time_rep_type & base, 
+subtract_time_duration(const time_rep_type & base, 
                        const time_duration_type & td);
    17. static time_rep_type 
-add_time_duration(const time_rep_type & base, time_duration_type td);
      18. +add_time_duration(const time_rep_type & base, time_duration_type td); 
    18. static time_duration_type 
-subtract_times(const time_rep_type & lhs, const time_rep_type & rhs);
      19. +subtract_times(const time_rep_type & lhs, const time_rep_type & rhs);
    diff --git a/doc/html/boost/date_time/static_local_time_adjustor.html b/doc/html/boost/date_time/static_local_time_adjustor.html index 973d2b2652..5eb7d8146e 100644 --- a/doc/html/boost/date_time/static_local_time_adjustor.html +++ b/doc/html/boost/date_time/static_local_time_adjustor.html @@ -39,20 +39,20 @@ typedef time_type::time_duration_type time_duration_type; typedef time_type::date_type date_type; - // public static functions - static time_duration_type utc_to_local_offset(const time_type &); + // public static functions + static time_duration_type utc_to_local_offset(const time_type &); static time_duration_type - local_to_utc_offset(const time_type &, + local_to_utc_offset(const time_type &, date_time::dst_flags = date_time::calculate); };
    -

    Description

    +

    Description

    -

    -static_local_time_adjustor public static functions

    +

    +static_local_time_adjustor public static functions

    1. -
      static time_duration_type utc_to_local_offset(const time_type & t);
      Calculates the offset from a utc time to local based on dst and utc offset.

      +

      static time_duration_type utc_to_local_offset(const time_type & t);
      Calculates the offset from a utc time to local based on dst and utc offset.

      The logic is as follows. Starting with UTC time use the offset to create a label for an non-dst adjusted local time. Then call dst_rules::local_is_dst with the non adjust local time. The results of this function will either unabiguously decide that the initial local time is in dst or return an illegal or ambiguous result. An illegal result only occurs at the end of dst (where labels are skipped) and indicates that dst has ended. An ambiguous result means that we need to recheck by making a dst adjustment and then rechecking. If the dst offset is added to the utc time and the recheck proves non-ambiguous then we are past the boundary. If it is still ambiguous then we are ahead of the boundary and dst is still in effect.

      TODO <ndash></ndash> check if all dst offsets are positive. If not then the algorithm needs to check for this and reverse the illegal/ambiguous logic.

      @@ -77,7 +77,7 @@ The logic is as follows. Starting with UTC time use the offset to create a label 
    2. static time_duration_type 
-local_to_utc_offset(const time_type & t, 
+local_to_utc_offset(const time_type & t, 
                     date_time::dst_flags dst = date_time::calculate);
      Get the offset to UTC given a local time.
      3. diff --git a/doc/html/boost/date_time/str_from_delim_idp99809040.html b/doc/html/boost/date_time/str_from_delim_idp99809040.html deleted file mode 100644 index c6f2513439..0000000000 --- a/doc/html/boost/date_time/str_from_delim_idp99809040.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Function template str_from_delimited_time_duration - - - - - - - - -
      - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Function template str_from_delimited_time_duration

      -

      boost::date_time::str_from_delimited_time_duration — Creates a time_duration object from a delimited string.

      -
      -

      Synopsis

      -
      // In header: <boost/date_time/time_parsing.hpp>
-
-
-template<typename time_duration, typename char_type> 
-  time_duration 
-  str_from_delimited_time_duration(const std::basic_string< char_type > & s);
      -
      -

      Description

      -

      Expected format for string is "[-]h[h][:mm][:ss][.fff]". If the number of fractional digits provided is greater than the precision of the time duration type then the extra digits are truncated.

      -

      A negative duration will be created if the first character in string is a '-', all other '-' will be treated as delimiters. Accepted delimiters are "-:,.".

      -
      -
      - - - -
      Copyright © 2001-2005 CrystalClear Software, Inc

      Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/date_time/str_from_idm45507164216160.html b/doc/html/boost/date_time/str_from_idm45507164216160.html new file mode 100644 index 0000000000..d0c0c3b6f5 --- /dev/null +++ b/doc/html/boost/date_time/str_from_idm45507164216160.html @@ -0,0 +1,56 @@ + + + + +Function template str_from_delimited_time_duration + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Function template str_from_delimited_time_duration

      +

      boost::date_time::str_from_delimited_time_duration — Creates a time_duration object from a delimited string.

      +
      +

      Synopsis

      +
      // In header: <boost/date_time/time_parsing.hpp>
+
+
+template<typename time_duration, typename char_type> 
+  time_duration 
+  str_from_delimited_time_duration(const std::basic_string< char_type > & s);
      +
      +

      Description

      +

      Expected format for string is "[-]h[h][:mm][:ss][.fff]". If the number of fractional digits provided is greater than the precision of the time duration type then the extra digits are truncated.

      +

      A negative duration will be created if the first character in string is a '-', all other '-' will be treated as delimiters. Accepted delimiters are "-:,.".

      +
      +
      + + + +
      Copyright © 2001-2005 CrystalClear Software, Inc

      Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/date_time/string_parse_tree.html b/doc/html/boost/date_time/string_parse_tree.html index be9254830d..02be04af29 100644 --- a/doc/html/boost/date_time/string_parse_tree.html +++ b/doc/html/boost/date_time/string_parse_tree.html @@ -45,61 +45,61 @@ typedef parse_match_result< charT > parse_match_result_type; // construct/copy/destruct - string_parse_tree(collection_type, unsigned int = 0); - string_parse_tree(short = -1); + string_parse_tree(collection_type, unsigned int = 0); + string_parse_tree(short = -1); - // public member functions - void insert(const string_type &, unsigned short); - short match(std::istreambuf_iterator< charT > &, + // public member functions + void insert(const string_type &, unsigned short); + short match(std::istreambuf_iterator< charT > &, std::istreambuf_iterator< charT > &, parse_match_result_type &, unsigned int &) const; parse_match_result_type - match(std::istreambuf_iterator< charT > &, + match(std::istreambuf_iterator< charT > &, std::istreambuf_iterator< charT > &) const; - void printme(std::ostream &, int &); - void print(std::ostream &); - void printmatch(std::ostream &, charT); + void printme(std::ostream &, int &); + void print(std::ostream &); + void printmatch(std::ostream &, charT); // public data members ptree_coll m_next_chars; short m_value; };
      -

      Description

      +

      Description

      This class provides a quick lookup by building what amounts to a tree data structure. It also features a match function which can can handle nasty input interators by caching values as it recurses the tree so that it can backtrack as needed.

      -

      +

      string_parse_tree public construct/copy/destruct

      1. -
        string_parse_tree(collection_type names, unsigned int starting_point = 0);
        +
        string_parse_tree(collection_type names, unsigned int starting_point = 0);

        Parameter "starting_point" designates where the numbering begins. A starting_point of zero will start the numbering at zero (Sun=0, Mon=1, ...) were a starting_point of one starts the numbering at one (Jan=1, Feb=2, ...). The default is zero, negative vaules are not allowed

        2. -
      2. string_parse_tree(short value = -1);
        3. +
      3. string_parse_tree(short value = -1);
      -

      -string_parse_tree public member functions

      +

      +string_parse_tree public member functions

        -
      1. void insert(const string_type & s, unsigned short value);
        2. +
      2. void insert(const string_type & s, unsigned short value);
      3. -
        short match(std::istreambuf_iterator< charT > & sitr, 
+
        short match(std::istreambuf_iterator< charT > & sitr, 
             std::istreambuf_iterator< charT > & stream_end, 
             parse_match_result_type & result, unsigned int & level) const;
        Recursive function that finds a matching string in the tree. 
        Must check match_results::has_remaining() after match() is called. This is required so the user can determine if stream iterator is already pointing to the expected character or not (match() might advance sitr to next char in stream).
        
 
        A parse_match_result that has been returned from a failed match attempt can be sent in to the match function of a different string_parse_tree to attempt a match there. Use the iterators for the partially consumed stream, the parse_match_result object, and '0' for the level parameter. 
        
 
      4. parse_match_result_type 
-match(std::istreambuf_iterator< charT > & sitr, 
+match(std::istreambuf_iterator< charT > & sitr, 
       std::istreambuf_iterator< charT > & stream_end) const;

        Must check match_results::has_remaining() after match() is called. This is required so the user can determine if stream iterator is already pointing to the expected character or not (match() might advance sitr to next char in stream).

        5. -
      5. void printme(std::ostream & os, int & level);
        6. -
      6. void print(std::ostream & os);
        7. -
      7. void printmatch(std::ostream & os, charT c);
        8. +
      8. void printme(std::ostream & os, int & level);
        9. +
      9. void print(std::ostream & os);
        10. +
      10. void printmatch(std::ostream & os, charT c);
      diff --git a/doc/html/boost/date_time/subsecond_duration.html b/doc/html/boost/date_time/subsecond_duration.html index 85701d9c7a..1ab31b5cb8 100644 --- a/doc/html/boost/date_time/subsecond_duration.html +++ b/doc/html/boost/date_time/subsecond_duration.html @@ -40,30 +40,30 @@ typedef base_duration::traits_type traits_type; // construct/copy/destruct - explicit subsecond_duration(boost::int64_t); + explicit subsecond_duration(boost::int64_t); - // private member functions - BOOST_STATIC_ASSERT_MSG((traits_type::ticks_per_second >=frac_of_second?traits_type::ticks_per_second%frac_of_second:frac_of_second%traits_type::ticks_per_second) = =0, + // private member functions + BOOST_STATIC_ASSERT_MSG((traits_type::ticks_per_second >=frac_of_second?traits_type::ticks_per_second%frac_of_second:frac_of_second%traits_type::ticks_per_second) = =0, \"The base duration resolution must be a multiple of the subsecond duration resolution"); - BOOST_STATIC_CONSTANT(boost::int64_t, + BOOST_STATIC_CONSTANT(boost::int64_t, adjustment_ratio = (traits_type::ticks_per_second >=frac_of_second?traits_type::ticks_per_second/frac_of_second:frac_of_second/traits_type::ticks_per_second)); };
    -

    Description

    +

    Description

    -

    +

    subsecond_duration public construct/copy/destruct

    -
    1. explicit subsecond_duration(boost::int64_t ss);
    +
    1. explicit subsecond_duration(boost::int64_t ss);
    -

    -subsecond_duration private member functions

    +

    +subsecond_duration private member functions

      -
    1.  BOOST_STATIC_ASSERT_MSG((traits_type::ticks_per_second >=frac_of_second?traits_type::ticks_per_second%frac_of_second:frac_of_second%traits_type::ticks_per_second) = =0, 
+
    2.  BOOST_STATIC_ASSERT_MSG((traits_type::ticks_per_second >=frac_of_second?traits_type::ticks_per_second%frac_of_second:frac_of_second%traits_type::ticks_per_second) = =0, 
                          \"The base duration resolution must be a multiple of the subsecond duration resolution");
      3. 
-
    3.  BOOST_STATIC_CONSTANT(boost::int64_t, 
+
    4.  BOOST_STATIC_CONSTANT(boost::int64_t, 
                        adjustment_ratio = (traits_type::ticks_per_second >=frac_of_second?traits_type::ticks_per_second/frac_of_second:frac_of_second/traits_type::ticks_per_second));
      5.
    diff --git a/doc/html/boost/date_time/time_duration.html b/doc/html/boost/date_time/time_duration.html index bb0dd5f3f4..de0e97e01c 100644 --- a/doc/html/boost/date_time/time_duration.html +++ b/doc/html/boost/date_time/time_duration.html @@ -38,7 +38,7 @@ { public: // types - typedef void _is_boost_date_time_duration; + typedef void _is_boost_date_time_duration; typedef T duration_type; typedef rep_type traits_type; typedef rep_type::day_type day_type; @@ -50,131 +50,131 @@ typedef rep_type::impl_type impl_type; // construct/copy/destruct - time_duration(); - time_duration(hour_type, min_type, sec_type = 0, + time_duration(); + time_duration(hour_type, min_type, sec_type = 0, fractional_seconds_type = 0); - time_duration(const time_duration< T, rep_type > &); - time_duration(special_values); - explicit time_duration(impl_type); + time_duration(const time_duration< T, rep_type > &); + time_duration(special_values); + explicit time_duration(impl_type); - // public member functions - hour_type hours() const; - min_type minutes() const; - sec_type seconds() const; - sec_type total_seconds() const; - tick_type total_milliseconds() const; - tick_type total_nanoseconds() const; - tick_type total_microseconds() const; - fractional_seconds_type fractional_seconds() const; - duration_type invert_sign() const; - bool is_negative() const; - bool operator<(const time_duration &) const; - bool operator==(const time_duration &) const; - duration_type operator-() const; - duration_type operator-(const duration_type &) const; - duration_type operator+(const duration_type &) const; - duration_type operator/(int) const; - duration_type operator-=(const duration_type &); - duration_type operator+=(const duration_type &); - duration_type operator/=(int); - duration_type operator*(int) const; - duration_type operator*=(int); - tick_type ticks() const; - bool is_special() const; - bool is_pos_infinity() const; - bool is_neg_infinity() const; - bool is_not_a_date_time() const; - impl_type get_rep() const; + // public member functions + hour_type hours() const; + min_type minutes() const; + sec_type seconds() const; + sec_type total_seconds() const; + tick_type total_milliseconds() const; + tick_type total_nanoseconds() const; + tick_type total_microseconds() const; + fractional_seconds_type fractional_seconds() const; + duration_type invert_sign() const; + bool is_negative() const; + bool operator<(const time_duration &) const; + bool operator==(const time_duration &) const; + duration_type operator-() const; + duration_type operator-(const duration_type &) const; + duration_type operator+(const duration_type &) const; + duration_type operator/(int) const; + duration_type operator-=(const duration_type &); + duration_type operator+=(const duration_type &); + duration_type operator/=(int); + duration_type operator*(int) const; + duration_type operator*=(int); + tick_type ticks() const; + bool is_special() const; + bool is_pos_infinity() const; + bool is_neg_infinity() const; + bool is_not_a_date_time() const; + impl_type get_rep() const; - // public static functions - static duration_type unit(); - static tick_type ticks_per_second(); - static time_resolutions resolution(); - static unsigned short num_fractional_digits(); + // public static functions + static duration_type unit(); + static tick_type ticks_per_second(); + static time_resolutions resolution(); + static unsigned short num_fractional_digits(); };
    -

    Description

    +

    Description

    This class represents a standard set of capabilities for all counted time durations. Time duration implementations should derive from this class passing their type as the first template parameter. This design allows the subclass duration types to provide custom construction policies or other custom features not provided here.

    -

    +

    time_duration public construct/copy/destruct

      -
    1. time_duration();
      2. -
    2. time_duration(hour_type hours_in, min_type minutes_in, 
+
    3. time_duration();
      4. 
+
    4. time_duration(hour_type hours_in, min_type minutes_in, 
               sec_type seconds_in = 0, 
               fractional_seconds_type frac_sec_in = 0);
      5. 
 
    5. 
-
      time_duration(const time_duration< T, rep_type > & other);
      Construct from another time_duration (Copy constructor) 
      6. 
+
      time_duration(const time_duration< T, rep_type > & other);
      Construct from another time_duration (Copy constructor)
    6. -
      time_duration(special_values sv);
      Construct from special_values.
      7. -
    7. explicit time_duration(impl_type in);
      8. +
      time_duration(special_values sv);
      Construct from special_values. +
    8. explicit time_duration(impl_type in);
    -

    -time_duration public member functions

    +

    +time_duration public member functions

    1. -
      hour_type hours() const;
      Returns number of hours in the duration.
      2. +
      hour_type hours() const;
      Returns number of hours in the duration.
    2. -
      min_type minutes() const;
      Returns normalized number of minutes.
      3. +
      min_type minutes() const;
      Returns normalized number of minutes.
    3. -
      sec_type seconds() const;
      Returns normalized number of seconds (0..60)
      4. +
      sec_type seconds() const;
      Returns normalized number of seconds (0..60)
    4. -
      sec_type total_seconds() const;
      Returns total number of seconds truncating any fractional seconds.
      5. +
      sec_type total_seconds() const;
      Returns total number of seconds truncating any fractional seconds.
    5. -
      tick_type total_milliseconds() const;
      Returns total number of milliseconds truncating any fractional seconds.
      6. +
      tick_type total_milliseconds() const;
      Returns total number of milliseconds truncating any fractional seconds.
    6. -
      tick_type total_nanoseconds() const;
      Returns total number of nanoseconds truncating any sub millisecond values.
      7. +
      tick_type total_nanoseconds() const;
      Returns total number of nanoseconds truncating any sub millisecond values.
    7. -
      tick_type total_microseconds() const;
      Returns total number of microseconds truncating any sub microsecond values.
      8. +
      tick_type total_microseconds() const;
      Returns total number of microseconds truncating any sub microsecond values.
    8. -
      fractional_seconds_type fractional_seconds() const;
      Returns count of fractional seconds at given resolution.
      9. -
    9. duration_type invert_sign() const;
      10. -
    10. bool is_negative() const;
      11. -
    11. bool operator<(const time_duration & rhs) const;
      12. -
    12. bool operator==(const time_duration & rhs) const;
      13. +
      fractional_seconds_type fractional_seconds() const;
      Returns count of fractional seconds at given resolution. +
    13. duration_type invert_sign() const;
      14. +
    14. bool is_negative() const;
      15. +
    15. bool operator<(const time_duration & rhs) const;
      16. +
    16. bool operator==(const time_duration & rhs) const;
    17. -
      duration_type operator-() const;
      unary- Allows for time_duration td = -td1
      18. -
    18. duration_type operator-(const duration_type & d) const;
      19. -
    19. duration_type operator+(const duration_type & d) const;
      20. -
    20. duration_type operator/(int divisor) const;
      21. -
    21. duration_type operator-=(const duration_type & d);
      22. -
    22. duration_type operator+=(const duration_type & d);
      23. +
      duration_type operator-() const;
      unary- Allows for time_duration td = -td1 +
    23. duration_type operator-(const duration_type & d) const;
      24. +
    24. duration_type operator+(const duration_type & d) const;
      25. +
    25. duration_type operator/(int divisor) const;
      26. +
    26. duration_type operator-=(const duration_type & d);
      27. +
    27. duration_type operator+=(const duration_type & d);
    28. -
      duration_type operator/=(int divisor);
      Division operations on a duration with an integer.
      29. +
      duration_type operator/=(int divisor);
      Division operations on a duration with an integer.
    29. -
      duration_type operator*(int rhs) const;
      Multiplication operations an a duration with an integer.
      30. -
    30. duration_type operator*=(int divisor);
      31. -
    31. tick_type ticks() const;
      32. +
      duration_type operator*(int rhs) const;
      Multiplication operations an a duration with an integer. +
    32. duration_type operator*=(int divisor);
      33. +
    33. tick_type ticks() const;
    34. -
      bool is_special() const;
      Is ticks_ a special value?
      35. +
      bool is_special() const;
      Is ticks_ a special value?
    35. -
      bool is_pos_infinity() const;
      Is duration pos-infinity.
      36. +
      bool is_pos_infinity() const;
      Is duration pos-infinity.
    36. -
      bool is_neg_infinity() const;
      Is duration neg-infinity.
      37. +
      bool is_neg_infinity() const;
      Is duration neg-infinity.
    37. -
      bool is_not_a_date_time() const;
      Is duration not-a-date-time.
      38. +
      bool is_not_a_date_time() const;
      Is duration not-a-date-time.
    38. -
      impl_type get_rep() const;
      Used for special_values output.
      39. +
      impl_type get_rep() const;
      Used for special_values output.
    -

    -time_duration public static functions

    +

    +time_duration public static functions

    1. -
      static duration_type unit();
      Returns smallest representable duration.
      2. +
      static duration_type unit();
      Returns smallest representable duration.
    2. -
      static tick_type ticks_per_second();
      Return the number of ticks in a second.
      3. +
      static tick_type ticks_per_second();
      Return the number of ticks in a second.
    3. -
      static time_resolutions resolution();
      Provide the resolution of this duration type.
      4. +
      static time_resolutions resolution();
      Provide the resolution of this duration type.
    4. -
      static unsigned short num_fractional_digits();
      Returns number of possible digits in fractional seconds.
      5. +
      static unsigned short num_fractional_digits();
      Returns number of possible digits in fractional seconds.
    diff --git a/doc/html/boost/date_time/time_facet.html b/doc/html/boost/date_time/time_facet.html index 20555eec0e..0f3ab4d384 100644 --- a/doc/html/boost/date_time/time_facet.html +++ b/doc/html/boost/date_time/time_facet.html @@ -46,31 +46,31 @@ typedef base_type::string_type string_type; typedef base_type::char_type char_type; typedef base_type::period_formatter_type period_formatter_type; - typedef base_type::special_values_formatter_type special_values_formatter_type; + typedef base_type::special_values_formatter_type special_values_formatter_type; typedef base_type::date_gen_formatter_type date_gen_formatter_type; // construct/copy/destruct - explicit time_facet(::size_t = 0); - explicit time_facet(const char_type *, + explicit time_facet(::size_t = 0); + explicit time_facet(const char_type *, period_formatter_type = period_formatter_type(), - const special_values_formatter_type & = special_values_formatter_type(), + const special_values_formatter_type & = special_values_formatter_type(), date_gen_formatter_type = date_gen_formatter_type(), ::size_t = 0); - // public member functions - std::locale::id & __get_id(void) const; - void time_duration_format(const char_type *const); - virtual void set_iso_format(); - virtual void set_iso_extended_format(); - OutItrT put(OutItrT, std::ios_base &, char_type, const time_type &) const; - OutItrT put(OutItrT, std::ios_base &, char_type, const time_duration_type &) const; - OutItrT put(OutItrT, std::ios_base &, char_type, const period_type &) const; + // public member functions + std::locale::id & __get_id(void) const; + void time_duration_format(const char_type *const); + virtual void set_iso_format(); + virtual void set_iso_extended_format(); + OutItrT put(OutItrT, std::ios_base &, char_type, const time_type &) const; + OutItrT put(OutItrT, std::ios_base &, char_type, const time_duration_type &) const; + OutItrT put(OutItrT, std::ios_base &, char_type, const period_type &) const; - // protected static functions + // protected static functions static string_type - fractional_seconds_as_string(const time_duration_type &, bool); - static string_type hours_as_string(const time_duration_type &, int = 2); - template<typename IntT> static string_type integral_as_string(IntT, int = 2); + fractional_seconds_as_string(const time_duration_type &, bool); + static string_type hours_as_string(const time_duration_type &, int = 2); + template<typename IntT> static string_type integral_as_string(IntT, int = 2); // public data members static const char_type * fractional_seconds_format; @@ -97,7 +97,7 @@ static std::locale::id id; };
    -

    Description

    +

    Description

    Facet used for format-based output of time types This class provides for the use of format strings to output times. In addition to the flags for formatting date elements, the following are the allowed format flags:

    • x X => default format - enables addition of more flags to default (ie. "%x %X %z")

      • @@ -111,52 +111,52 @@

      -

      +

      time_facet public construct/copy/destruct

      1. -
        explicit time_facet(::size_t ref_arg = 0);
        sets default formats for ptime, local_date_time, and time_duration +
        explicit time_facet(::size_t ref_arg = 0);
        sets default formats for ptime, local_date_time, and time_duration
      2. -
        explicit time_facet(const char_type * format_arg, 
+
        explicit time_facet(const char_type * format_arg, 
                     period_formatter_type period_formatter_arg = period_formatter_type(), 
-                    const special_values_formatter_type & special_value_formatter = special_values_formatter_type(), 
+                    const special_values_formatter_type & special_value_formatter = special_values_formatter_type(), 
                     date_gen_formatter_type dg_formatter = date_gen_formatter_type(), 
                     ::size_t ref_arg = 0);
        Construct the facet with an explicitly specified format.
      -

      -time_facet public member functions

      +

      +time_facet public member functions

        -
      1. std::locale::id & __get_id(void) const;
        2. +
      2. std::locale::id & __get_id(void) const;
      3. -
        void time_duration_format(const char_type *const format);
        Changes format for time_duration.
        4. -
      4. virtual void set_iso_format();
        5. -
      5. virtual void set_iso_extended_format();
        6. -
      6. OutItrT put(OutItrT next_arg, std::ios_base & ios_arg, char_type fill_arg, 
+
        void time_duration_format(const char_type *const format);
        Changes format for time_duration.
        7. +
      7. virtual void set_iso_format();
        8. +
      8. virtual void set_iso_extended_format();
        9. +
      9. OutItrT put(OutItrT next_arg, std::ios_base & ios_arg, char_type fill_arg, 
             const time_type & time_arg) const;
      10. -
        OutItrT put(OutItrT next_arg, std::ios_base & ios_arg, char_type fill_arg, 
+
        OutItrT put(OutItrT next_arg, std::ios_base & ios_arg, char_type fill_arg, 
             const time_duration_type & time_dur_arg) const;
        put function for time_duration
        11. -
      11. OutItrT put(OutItrT next, std::ios_base & ios_arg, char_type fill, 
+
      12. OutItrT put(OutItrT next, std::ios_base & ios_arg, char_type fill, 
             const period_type & p) const;
        13.
      -

      -time_facet protected static functions

      +

      +time_facet protected static functions

      1. static string_type 
-fractional_seconds_as_string(const time_duration_type & time_arg, 
+fractional_seconds_as_string(const time_duration_type & time_arg, 
                              bool null_when_zero);
      2. static string_type 
-hours_as_string(const time_duration_type & time_arg, int width = 2);
        3. +hours_as_string(const time_duration_type & time_arg, int width = 2); 
      3. template<typename IntT> 
-  static string_type integral_as_string(IntT val, int width = 2);
        4. + static string_type integral_as_string(IntT val, int width = 2);
    diff --git a/doc/html/boost/date_time/time_from_ftime.html b/doc/html/boost/date_time/time_from_ftime.html index 9aabbf851f..af21d0472e 100644 --- a/doc/html/boost/date_time/time_from_ftime.html +++ b/doc/html/boost/date_time/time_from_ftime.html @@ -36,7 +36,7 @@ template<typename TimeT, typename FileTimeT> TimeT time_from_ftime(const FileTimeT & ft);
    -

    Description

    +

    Description

    Create a time object from an initialized FILETIME struct. A FILETIME struct holds 100-nanosecond units (0.0000001). When built with microsecond resolution the file_time's sub second value will be truncated. Nanosecond resolution has no truncation.

    diff --git a/doc/html/boost/date_time/time_input_facet.html b/doc/html/boost/date_time/time_input_facet.html index f4b767bbf0..0a42c0fc40 100644 --- a/doc/html/boost/date_time/time_input_facet.html +++ b/doc/html/boost/date_time/time_input_facet.html @@ -8,7 +8,7 @@ - +
    @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -57,35 +57,35 @@ typedef base_type::special_values_parser_type::match_results match_results; // construct/copy/destruct - explicit time_input_facet(const string_type &, ::size_t = 0); - explicit time_input_facet(const string_type &, + explicit time_input_facet(const string_type &, ::size_t = 0); + explicit time_input_facet(const string_type &, const format_date_parser_type &, const special_values_parser_type &, const period_parser_type &, const date_gen_parser_type &, ::size_t = 0); - explicit time_input_facet(::size_t = 0); + explicit time_input_facet(::size_t = 0); - // public member functions - void time_duration_format(const char_type *const); - virtual void set_iso_format(); - virtual void set_iso_extended_format(); - InItrT get(InItrT &, InItrT &, std::ios_base &, period_type &) const; - InItrT get(InItrT &, InItrT &, std::ios_base &, time_duration_type &) const; - InItrT get(InItrT &, InItrT &, std::ios_base &, time_type &) const; - InItrT get_local_time(InItrT &, InItrT &, std::ios_base &, time_type &, + // public member functions + void time_duration_format(const char_type *const); + virtual void set_iso_format(); + virtual void set_iso_extended_format(); + InItrT get(InItrT &, InItrT &, std::ios_base &, period_type &) const; + InItrT get(InItrT &, InItrT &, std::ios_base &, time_duration_type &) const; + InItrT get(InItrT &, InItrT &, std::ios_base &, time_type &) const; + InItrT get_local_time(InItrT &, InItrT &, std::ios_base &, time_type &, string_type &) const; - // protected member functions - InItrT get(InItrT &, InItrT &, std::ios_base &, time_type &, string_type &, + // protected member functions + InItrT get(InItrT &, InItrT &, std::ios_base &, time_type &, string_type &, bool) const; template<typename temporal_type> - InItrT check_special_value(InItrT &, InItrT &, temporal_type &, + InItrT check_special_value(InItrT &, InItrT &, temporal_type &, char_type = '\0') const; - void parse_frac_type(InItrT &, InItrT &, fracional_seconds_type &) const; + void parse_frac_type(InItrT &, InItrT &, fracional_seconds_type &) const; - // private member functions + // private member functions template<typename int_type> - int_type decimal_adjust(int_type, const unsigned short) const; + int_type decimal_adjust(int_type, const unsigned short) const; // public data members static const char_type * fractional_seconds_format; @@ -105,69 +105,69 @@ static std::locale::id id; };
    -

    Description

    +

    Description

    -

    +

    time_input_facet public construct/copy/destruct

    1. -
      explicit time_input_facet(const string_type & format, ::size_t ref_arg = 0);
      Constructor that takes a format string for a ptime.
      2. -
    2. explicit time_input_facet(const string_type & format, 
+
      explicit time_input_facet(const string_type & format, ::size_t ref_arg = 0);
      Constructor that takes a format string for a ptime.
      3. +
    3. explicit time_input_facet(const string_type & format, 
                           const format_date_parser_type & date_parser, 
                           const special_values_parser_type & sv_parser, 
                           const period_parser_type & per_parser, 
                           const date_gen_parser_type & date_gen_parser, 
                           ::size_t ref_arg = 0);
    4. -
      explicit time_input_facet(::size_t ref_arg = 0);
      sets default formats for ptime, local_date_time, and time_duration +
      explicit time_input_facet(::size_t ref_arg = 0);
      sets default formats for ptime, local_date_time, and time_duration
    -

    -time_input_facet public member functions

    +

    +time_input_facet public member functions

    1. -
      void time_duration_format(const char_type *const format);
      Set the format for time_duration.
      2. -
    2. virtual void set_iso_format();
      3. -
    3. virtual void set_iso_extended_format();
      4. -
    4. InItrT get(InItrT & sitr, InItrT & stream_end, std::ios_base & ios_arg, 
+
      void time_duration_format(const char_type *const format);
      Set the format for time_duration.
      5. +
    5. virtual void set_iso_format();
      6. +
    6. virtual void set_iso_extended_format();
      7. +
    7. InItrT get(InItrT & sitr, InItrT & stream_end, std::ios_base & ios_arg, 
            period_type & p) const;
      8. -
    8. InItrT get(InItrT & sitr, InItrT & stream_end, std::ios_base & ios_arg, 
+
    9. InItrT get(InItrT & sitr, InItrT & stream_end, std::ios_base & ios_arg, 
            time_duration_type & td) const;
      10. 
 
    10. 
-
      InItrT get(InItrT & sitr, InItrT & stream_end, std::ios_base & ios_arg, 
+
      InItrT get(InItrT & sitr, InItrT & stream_end, std::ios_base & ios_arg, 
            time_type & t) const;
      Parses a time object from the input stream. 
      11. 
 
    11. 
-
      InItrT get_local_time(InItrT & sitr, InItrT & stream_end, 
+
      InItrT get_local_time(InItrT & sitr, InItrT & stream_end, 
                       std::ios_base & ios_arg, time_type & t, 
                       string_type & tz_str) const;
      Expects a time_zone in the input stream. 
      12.
    -

    -time_input_facet protected member functions

    +

    +time_input_facet protected member functions

      -
    1. InItrT get(InItrT & sitr, InItrT & stream_end, std::ios_base & ios_arg, 
+
    2. InItrT get(InItrT & sitr, InItrT & stream_end, std::ios_base & ios_arg, 
            time_type & t, string_type & tz_str, bool time_is_local) const;
      3. 
 
    3. 
 
      template<typename temporal_type> 
-  InItrT check_special_value(InItrT & sitr, InItrT & stream_end, 
+  InItrT check_special_value(InItrT & sitr, InItrT & stream_end, 
                              temporal_type & tt, char_type c = '\0') const;
      Helper function to check for special_value. 
      First character may have been consumed during original parse attempt. Parameter 'c' should be a copy of that character. Throws ios_base::failure if parse fails. 
      
 
      4. 
 
    4. 
-
      void parse_frac_type(InItrT & sitr, InItrT & stream_end, 
+
      void parse_frac_type(InItrT & sitr, InItrT & stream_end, 
                      fracional_seconds_type & frac) const;
      Helper function for parsing a fractional second type from the stream. 
      5.
    -

    -time_input_facet private member functions

    +

    +time_input_facet private member functions

    1. template<typename int_type> 
-  int_type decimal_adjust(int_type val, const unsigned short places) const;
      Helper function to adjust trailing zeros when parsing fractional digits.
    + int_type decimal_adjust(int_type val, const unsigned short places) const;Helper function to adjust trailing zeros when parsing fractional digits.
    @@ -179,7 +179,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/date_time/time_itr.html b/doc/html/boost/date_time/time_itr.html index f8791f0bb6..c382af7043 100644 --- a/doc/html/boost/date_time/time_itr.html +++ b/doc/html/boost/date_time/time_itr.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -39,43 +39,43 @@ typedef time_type::time_duration_type time_duration_type; // construct/copy/destruct - time_itr(time_type, time_duration_type); + time_itr(time_type, time_duration_type); - // public member functions - time_itr & operator++(); - time_itr & operator--(); - time_type operator*(); - time_type * operator->(); - bool operator<(const time_type &); - bool operator<=(const time_type &); - bool operator!=(const time_type &); - bool operator==(const time_type &); - bool operator>(const time_type &); - bool operator>=(const time_type &); + // public member functions + time_itr & operator++(); + time_itr & operator--(); + time_type operator*(); + time_type * operator->(); + bool operator<(const time_type &); + bool operator<=(const time_type &); + bool operator!=(const time_type &); + bool operator==(const time_type &); + bool operator>(const time_type &); + bool operator>=(const time_type &); };
    -

    Description

    +

    Description

    -

    +

    time_itr public construct/copy/destruct

    -
    1. time_itr(time_type t, time_duration_type d);
    +
    1. time_itr(time_type t, time_duration_type d);
    -

    -time_itr public member functions

    +

    +time_itr public member functions

      -
    1. time_itr & operator++();
      2. -
    2. time_itr & operator--();
      3. -
    3. time_type operator*();
      4. -
    4. time_type * operator->();
      5. -
    5. bool operator<(const time_type & t);
      6. -
    6. bool operator<=(const time_type & t);
      7. -
    7. bool operator!=(const time_type & t);
      8. -
    8. bool operator==(const time_type & t);
      9. -
    9. bool operator>(const time_type & t);
      10. -
    10. bool operator>=(const time_type & t);
      11. +
    11. time_itr & operator++();
      12. +
    12. time_itr & operator--();
      13. +
    13. time_type operator*();
      14. +
    14. time_type * operator->();
      15. +
    15. bool operator<(const time_type & t);
      16. +
    16. bool operator<=(const time_type & t);
      17. +
    17. bool operator!=(const time_type & t);
      18. +
    18. bool operator==(const time_type & t);
      19. +
    19. bool operator>(const time_type & t);
      20. +
    20. bool operator>=(const time_type & t);
    @@ -88,7 +88,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/date_time/time_res_idm45507110033680.html b/doc/html/boost/date_time/time_res_idm45507110033680.html new file mode 100644 index 0000000000..65f315c7cb --- /dev/null +++ b/doc/html/boost/date_time/time_res_idm45507110033680.html @@ -0,0 +1,69 @@ + + + + +Struct time_resolution_traits_bi64_impl + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct time_resolution_traits_bi64_impl

    +

    boost::date_time::time_resolution_traits_bi64_impl — traits struct for time_resolution_traits implementation type

    +
    +

    Synopsis

    +
    // In header: <boost/date_time/time_resolution_traits.hpp>
+
+
+struct time_resolution_traits_bi64_impl {
+  // types
+  typedef boost::int64_t int_type; 
+  typedef boost::int64_t impl_type;
+
+  // public static functions
+  static int_type as_number(impl_type);
+  static bool is_adapted();
+};
    +
    +

    Description

    +
    +

    +time_resolution_traits_bi64_impl public static functions

    +
      +
    1. static int_type as_number(impl_type i);
      2. +
    2. +
      static bool is_adapted();
      Used to determine if implemented type is int_adapter or int.
      3. +
    +
    +
    +
    + + + +
    Copyright © 2001-2005 CrystalClear Software, Inc

    Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/date_time/time_res_idm45507130513984.html b/doc/html/boost/date_time/time_res_idm45507130513984.html new file mode 100644 index 0000000000..d72670991c --- /dev/null +++ b/doc/html/boost/date_time/time_res_idm45507130513984.html @@ -0,0 +1,69 @@ + + + + +Struct time_resolution_traits_bi32_impl + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct time_resolution_traits_bi32_impl

    +

    boost::date_time::time_resolution_traits_bi32_impl — traits struct for time_resolution_traits implementation type

    +
    +

    Synopsis

    +
    // In header: <boost/date_time/time_resolution_traits.hpp>
+
+
+struct time_resolution_traits_bi32_impl {
+  // types
+  typedef boost::int32_t int_type; 
+  typedef boost::int32_t impl_type;
+
+  // public static functions
+  static int_type as_number(impl_type);
+  static bool is_adapted();
+};
    +
    +

    Description

    +
    +

    +time_resolution_traits_bi32_impl public static functions

    +
      +
    1. static int_type as_number(impl_type i);
      2. +
    2. +
      static bool is_adapted();
      Used to determine if implemented type is int_adapter or int.
      3. +
    +
    +
    +
    + + + +
    Copyright © 2001-2005 CrystalClear Software, Inc

    Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/date_time/time_res_idm45507155150400.html b/doc/html/boost/date_time/time_res_idm45507155150400.html new file mode 100644 index 0000000000..56a725f766 --- /dev/null +++ b/doc/html/boost/date_time/time_res_idm45507155150400.html @@ -0,0 +1,69 @@ + + + + +Struct time_resolution_traits_adapted32_impl + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct time_resolution_traits_adapted32_impl

    +

    boost::date_time::time_resolution_traits_adapted32_impl — traits struct for time_resolution_traits implementation type

    +
    +

    Synopsis

    +
    // In header: <boost/date_time/time_resolution_traits.hpp>
+
+
+struct time_resolution_traits_adapted32_impl {
+  // types
+  typedef boost::int32_t                                  int_type; 
+  typedef boost::date_time::int_adapter< boost::int32_t > impl_type;
+
+  // public static functions
+  static int_type as_number(impl_type);
+  static bool is_adapted();
+};
    +
    +

    Description

    +
    +

    +time_resolution_traits_adapted32_impl public static functions

    +
      +
    1. static int_type as_number(impl_type i);
      2. +
    2. +
      static bool is_adapted();
      Used to determine if implemented type is int_adapter or int.
      3. +
    +
    +
    +
    + + + +
    Copyright © 2001-2005 CrystalClear Software, Inc

    Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/date_time/time_res_idm45507162469520.html b/doc/html/boost/date_time/time_res_idm45507162469520.html new file mode 100644 index 0000000000..7ea9948b4f --- /dev/null +++ b/doc/html/boost/date_time/time_res_idm45507162469520.html @@ -0,0 +1,69 @@ + + + + +Struct time_resolution_traits_adapted64_impl + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct time_resolution_traits_adapted64_impl

    +

    boost::date_time::time_resolution_traits_adapted64_impl — traits struct for time_resolution_traits implementation type

    +
    +

    Synopsis

    +
    // In header: <boost/date_time/time_resolution_traits.hpp>
+
+
+struct time_resolution_traits_adapted64_impl {
+  // types
+  typedef boost::int64_t                                  int_type; 
+  typedef boost::date_time::int_adapter< boost::int64_t > impl_type;
+
+  // public static functions
+  static int_type as_number(impl_type);
+  static bool is_adapted();
+};
    +
    +

    Description

    +
    +

    +time_resolution_traits_adapted64_impl public static functions

    +
      +
    1. static int_type as_number(impl_type i);
      2. +
    2. +
      static bool is_adapted();
      Used to determine if implemented type is int_adapter or int.
      3. +
    +
    +
    +
    + + + +
    Copyright © 2001-2005 CrystalClear Software, Inc

    Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/date_time/time_resoluti_idp110216112.html b/doc/html/boost/date_time/time_resoluti_idp110216112.html deleted file mode 100644 index 1b2be3667b..0000000000 --- a/doc/html/boost/date_time/time_resoluti_idp110216112.html +++ /dev/null @@ -1,69 +0,0 @@ - - - - -Struct time_resolution_traits_bi64_impl - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct time_resolution_traits_bi64_impl

    -

    boost::date_time::time_resolution_traits_bi64_impl — traits struct for time_resolution_traits implementation type

    -
    -

    Synopsis

    -
    // In header: <boost/date_time/time_resolution_traits.hpp>
-
-
-struct time_resolution_traits_bi64_impl {
-  // types
-  typedef boost::int64_t int_type; 
-  typedef boost::int64_t impl_type;
-
-  // public static functions
-  static int_type as_number(impl_type);
-  static bool is_adapted();
-};
    -
    -

    Description

    -
    -

    -time_resolution_traits_bi64_impl public static functions

    -
      -
    1. static int_type as_number(impl_type i);
      2. -
    2. -
      static bool is_adapted();
      Used to determine if implemented type is int_adapter or int.
      3. -
    -
    -
    -
    - - - -
    Copyright © 2001-2005 CrystalClear Software, Inc

    Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/date_time/time_resoluti_idp112449952.html b/doc/html/boost/date_time/time_resoluti_idp112449952.html deleted file mode 100644 index 41ccde6e3b..0000000000 --- a/doc/html/boost/date_time/time_resoluti_idp112449952.html +++ /dev/null @@ -1,69 +0,0 @@ - - - - -Struct time_resolution_traits_bi32_impl - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct time_resolution_traits_bi32_impl

    -

    boost::date_time::time_resolution_traits_bi32_impl — traits struct for time_resolution_traits implementation type

    -
    -

    Synopsis

    -
    // In header: <boost/date_time/time_resolution_traits.hpp>
-
-
-struct time_resolution_traits_bi32_impl {
-  // types
-  typedef boost::int32_t int_type; 
-  typedef boost::int32_t impl_type;
-
-  // public static functions
-  static int_type as_number(impl_type);
-  static bool is_adapted();
-};
    -
    -

    Description

    -
    -

    -time_resolution_traits_bi32_impl public static functions

    -
      -
    1. static int_type as_number(impl_type i);
      2. -
    2. -
      static bool is_adapted();
      Used to determine if implemented type is int_adapter or int.
      3. -
    -
    -
    -
    - - - -
    Copyright © 2001-2005 CrystalClear Software, Inc

    Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/date_time/time_resolutio_idp37920384.html b/doc/html/boost/date_time/time_resolutio_idp37920384.html deleted file mode 100644 index ae69f578d9..0000000000 --- a/doc/html/boost/date_time/time_resolutio_idp37920384.html +++ /dev/null @@ -1,69 +0,0 @@ - - - - -Struct time_resolution_traits_adapted64_impl - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct time_resolution_traits_adapted64_impl

    -

    boost::date_time::time_resolution_traits_adapted64_impl — traits struct for time_resolution_traits implementation type

    -
    -

    Synopsis

    -
    // In header: <boost/date_time/time_resolution_traits.hpp>
-
-
-struct time_resolution_traits_adapted64_impl {
-  // types
-  typedef boost::int64_t                                  int_type; 
-  typedef boost::date_time::int_adapter< boost::int64_t > impl_type;
-
-  // public static functions
-  static int_type as_number(impl_type);
-  static bool is_adapted();
-};
    -
    -

    Description

    -
    -

    -time_resolution_traits_adapted64_impl public static functions

    -
      -
    1. static int_type as_number(impl_type i);
      2. -
    2. -
      static bool is_adapted();
      Used to determine if implemented type is int_adapter or int.
      3. -
    -
    -
    -
    - - - -
    Copyright © 2001-2005 CrystalClear Software, Inc

    Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/date_time/time_resolutio_idp95321136.html b/doc/html/boost/date_time/time_resolutio_idp95321136.html deleted file mode 100644 index ba43cea652..0000000000 --- a/doc/html/boost/date_time/time_resolutio_idp95321136.html +++ /dev/null @@ -1,69 +0,0 @@ - - - - -Struct time_resolution_traits_adapted32_impl - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct time_resolution_traits_adapted32_impl

    -

    boost::date_time::time_resolution_traits_adapted32_impl — traits struct for time_resolution_traits implementation type

    -
    -

    Synopsis

    -
    // In header: <boost/date_time/time_resolution_traits.hpp>
-
-
-struct time_resolution_traits_adapted32_impl {
-  // types
-  typedef boost::int32_t                                  int_type; 
-  typedef boost::date_time::int_adapter< boost::int32_t > impl_type;
-
-  // public static functions
-  static int_type as_number(impl_type);
-  static bool is_adapted();
-};
    -
    -

    Description

    -
    -

    -time_resolution_traits_adapted32_impl public static functions

    -
      -
    1. static int_type as_number(impl_type i);
      2. -
    2. -
      static bool is_adapted();
      Used to determine if implemented type is int_adapter or int.
      3. -
    -
    -
    -
    - - - -
    Copyright © 2001-2005 CrystalClear Software, Inc

    Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/date_time/time_resolution_traits.html b/doc/html/boost/date_time/time_resolution_traits.html index b6ab6f0513..4a54ba6991 100644 --- a/doc/html/boost/date_time/time_resolution_traits.html +++ b/doc/html/boost/date_time/time_resolution_traits.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -48,43 +48,43 @@ typedef var_type min_type; typedef var_type sec_type; - // public static functions - static fractional_seconds_type as_number(impl_type); - static bool is_adapted(); - static time_resolutions resolution(); - static unsigned short num_fractional_digits(); - static fractional_seconds_type res_adjust(); + // public static functions + static fractional_seconds_type as_number(impl_type); + static bool is_adapted(); + static time_resolutions resolution(); + static unsigned short num_fractional_digits(); + static fractional_seconds_type res_adjust(); static tick_type - to_tick_count(hour_type, min_type, sec_type, fractional_seconds_type); + to_tick_count(hour_type, min_type, sec_type, fractional_seconds_type); - // public member functions - BOOST_STATIC_CONSTANT(boost::int64_t, ticks_per_second = resolution_adjust); - BOOST_STATIC_CONSTANT(fractional_seconds_type, + // public member functions + BOOST_STATIC_CONSTANT(boost::int64_t, ticks_per_second = resolution_adjust); + BOOST_STATIC_CONSTANT(fractional_seconds_type, ticks_per_second = resolution_adjust); };
    -

    Description

    +

    Description

    -

    -time_resolution_traits public static functions

    +

    +time_resolution_traits public static functions

      -
    1. static fractional_seconds_type as_number(impl_type i);
      2. -
    2. static bool is_adapted();
      3. -
    3. static time_resolutions resolution();
      4. -
    4. static unsigned short num_fractional_digits();
      5. -
    5. static fractional_seconds_type res_adjust();
      6. +
    6. static fractional_seconds_type as_number(impl_type i);
      7. +
    7. static bool is_adapted();
      8. +
    8. static time_resolutions resolution();
      9. +
    9. static unsigned short num_fractional_digits();
      10. +
    10. static fractional_seconds_type res_adjust();
    11. static tick_type 
-to_tick_count(hour_type hours, min_type minutes, sec_type seconds, 
+to_tick_count(hour_type hours, min_type minutes, sec_type seconds, 
               fractional_seconds_type fs);
      Any negative argument results in a negative tick_count.
    -

    -time_resolution_traits public member functions

    +

    +time_resolution_traits public member functions

      -
    1.  BOOST_STATIC_CONSTANT(boost::int64_t, ticks_per_second = resolution_adjust);
      2. -
    2.  BOOST_STATIC_CONSTANT(fractional_seconds_type, 
+
    3.  BOOST_STATIC_CONSTANT(boost::int64_t, ticks_per_second = resolution_adjust);
      4. 
+
    4.  BOOST_STATIC_CONSTANT(fractional_seconds_type, 
                        ticks_per_second = resolution_adjust);
      5.
    @@ -98,7 +98,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/date_time/time_zone_base.html b/doc/html/boost/date_time/time_zone_base.html index 6eb4dc944b..60e21f554b 100644 --- a/doc/html/boost/date_time/time_zone_base.html +++ b/doc/html/boost/date_time/time_zone_base.html @@ -43,59 +43,59 @@ typedef time_type::time_duration_type time_duration_type; // construct/copy/destruct - time_zone_base(); - ~time_zone_base(); + time_zone_base(); + ~time_zone_base(); - // public member functions - virtual string_type dst_zone_abbrev() const = 0; - virtual string_type std_zone_abbrev() const = 0; - virtual string_type dst_zone_name() const = 0; - virtual string_type std_zone_name() const = 0; - virtual bool has_dst() const = 0; - virtual time_type dst_local_start_time(year_type) const = 0; - virtual time_type dst_local_end_time(year_type) const = 0; - virtual time_duration_type base_utc_offset() const = 0; - virtual time_duration_type dst_offset() const = 0; - virtual string_type to_posix_string() const = 0; + // public member functions + virtual string_type dst_zone_abbrev() const = 0; + virtual string_type std_zone_abbrev() const = 0; + virtual string_type dst_zone_name() const = 0; + virtual string_type std_zone_name() const = 0; + virtual bool has_dst() const = 0; + virtual time_type dst_local_start_time(year_type) const = 0; + virtual time_type dst_local_end_time(year_type) const = 0; + virtual time_duration_type base_utc_offset() const = 0; + virtual time_duration_type dst_offset() const = 0; + virtual string_type to_posix_string() const = 0; };
    -

    Description

    +

    Description

    This class represents the base interface for all timezone representations. Subclasses may provide different systems for identifying a particular zone. For example some may provide a geographical based zone construction while others may specify the offset from GMT. Another possible implementation would be to convert from POSIX timezone strings. Regardless of the construction technique, this is the interface that these time zone types must provide.

    Note that this class is intended to be used as a shared resource (hence the derivation from boost::counted_base.

    -

    +

    time_zone_base public construct/copy/destruct

      -
    1. time_zone_base();
      2. -
    2. ~time_zone_base();
      3. +
    3. time_zone_base();
      4. +
    4. ~time_zone_base();
    -

    -time_zone_base public member functions

    +

    +time_zone_base public member functions

    1. -
      virtual string_type dst_zone_abbrev() const = 0;
      String for the timezone when in daylight savings (eg: EDT)
      2. +
      virtual string_type dst_zone_abbrev() const = 0;
      String for the timezone when in daylight savings (eg: EDT)
    2. -
      virtual string_type std_zone_abbrev() const = 0;
      String for the zone when not in daylight savings (eg: EST)
      3. +
      virtual string_type std_zone_abbrev() const = 0;
      String for the zone when not in daylight savings (eg: EST)
    3. -
      virtual string_type dst_zone_name() const = 0;
      String for the timezone when in daylight savings (eg: Eastern Daylight Time)
      4. +
      virtual string_type dst_zone_name() const = 0;
      String for the timezone when in daylight savings (eg: Eastern Daylight Time)
    4. -
      virtual string_type std_zone_name() const = 0;
      String for the zone when not in daylight savings (eg: Eastern Standard Time)
      5. +
      virtual string_type std_zone_name() const = 0;
      String for the zone when not in daylight savings (eg: Eastern Standard Time)
    5. -
      virtual bool has_dst() const = 0;
      True if zone uses daylight savings adjustments otherwise false.
      6. +
      virtual bool has_dst() const = 0;
      True if zone uses daylight savings adjustments otherwise false.
    6. -
      virtual time_type dst_local_start_time(year_type y) const = 0;
      Local time that DST starts <ndash></ndash> undefined if has_dst is false.
      7. +
      virtual time_type dst_local_start_time(year_type y) const = 0;
      Local time that DST starts <ndash></ndash> undefined if has_dst is false.
    7. -
      virtual time_type dst_local_end_time(year_type y) const = 0;
      Local time that DST ends <ndash></ndash> undefined if has_dst is false.
      8. +
      virtual time_type dst_local_end_time(year_type y) const = 0;
      Local time that DST ends <ndash></ndash> undefined if has_dst is false.
    8. -
      virtual time_duration_type base_utc_offset() const = 0;
      Base offset from UTC for zone (eg: -07:30:00)
      9. +
      virtual time_duration_type base_utc_offset() const = 0;
      Base offset from UTC for zone (eg: -07:30:00)
    9. -
      virtual time_duration_type dst_offset() const = 0;
      Adjustment forward or back made while DST is in effect.
      10. +
      virtual time_duration_type dst_offset() const = 0;
      Adjustment forward or back made while DST is in effect.
    10. -
      virtual string_type to_posix_string() const = 0;
      Returns a POSIX time_zone string for this object.
      11. +
      virtual string_type to_posix_string() const = 0;
      Returns a POSIX time_zone string for this object.
    diff --git a/doc/html/boost/date_time/time_zone_names_base.html b/doc/html/boost/date_time/time_zone_names_base.html index cff037f319..bba76fcaf5 100644 --- a/doc/html/boost/date_time/time_zone_names_base.html +++ b/doc/html/boost/date_time/time_zone_names_base.html @@ -39,40 +39,40 @@ typedef std::basic_string< CharT > string_type; // construct/copy/destruct - time_zone_names_base(); - time_zone_names_base(const string_type &, const string_type &, + time_zone_names_base(); + time_zone_names_base(const string_type &, const string_type &, const string_type &, const string_type &); - // public member functions - string_type dst_zone_abbrev() const; - string_type std_zone_abbrev() const; - string_type dst_zone_name() const; - string_type std_zone_name() const; + // public member functions + string_type dst_zone_abbrev() const; + string_type std_zone_abbrev() const; + string_type dst_zone_name() const; + string_type std_zone_name() const; };
    -

    Description

    +

    Description

    Class that holds various types of strings used for timezones. For example, for the western United States there is the full name: Pacific Standard Time and the abbreviated name: PST. During daylight savings there are additional names: Pacific Daylight Time and PDT. CharT Allows class to support different character types

    -

    +

    time_zone_names_base public construct/copy/destruct

      -
    1. time_zone_names_base();
      2. -
    2. time_zone_names_base(const string_type & std_zone_name_str, 
+
    3. time_zone_names_base();
      4. 
+
    4. time_zone_names_base(const string_type & std_zone_name_str, 
                      const string_type & std_zone_abbrev_str, 
                      const string_type & dst_zone_name_str, 
                      const string_type & dst_zone_abbrev_str);
      5.
    -

    -time_zone_names_base public member functions

    +

    +time_zone_names_base public member functions

      -
    1. string_type dst_zone_abbrev() const;
      2. -
    2. string_type std_zone_abbrev() const;
      3. -
    3. string_type dst_zone_name() const;
      4. -
    4. string_type std_zone_name() const;
      5. +
    5. string_type dst_zone_abbrev() const;
      6. +
    6. string_type std_zone_abbrev() const;
      7. +
    7. string_type dst_zone_name() const;
      8. +
    8. string_type std_zone_name() const;
    diff --git a/doc/html/boost/date_time/tz_db_base.html b/doc/html/boost/date_time/tz_db_base.html index d7a10a4892..1235d59f08 100644 --- a/doc/html/boost/date_time/tz_db_base.html +++ b/doc/html/boost/date_time/tz_db_base.html @@ -44,25 +44,25 @@ typedef std::basic_string< char_type > string_type; // construct/copy/destruct - tz_db_base(); + tz_db_base(); - // public member functions - void load_from_stream(std::istream &); - void load_from_file(const std::string &); - bool add_record(const string_type &, + // public member functions + void load_from_stream(std::istream &); + void load_from_file(const std::string &); + bool add_record(const string_type &, boost::shared_ptr< time_zone_base_type >); boost::shared_ptr< time_zone_base_type > - time_zone_from_region(const string_type &) const; - std::vector< std::string > region_list() const; + time_zone_from_region(const string_type &) const; + std::vector< std::string > region_list() const; - // private member functions - rule_type * parse_rules(const string_type &, const string_type &) const; - week_num get_week_num(int) const; - void split_rule_spec(int &, int &, int &, string_type) const; - bool parse_string(string_type &); + // private member functions + rule_type * parse_rules(const string_type &, const string_type &) const; + week_num get_week_num(int) const; + void split_rule_spec(int &, int &, int &, string_type) const; + bool parse_string(string_type &); };
    -

    Description

    +

    Description

    The csv file containing the zone_specs used by the tz_db_base is intended to be customized by the library user. When customizing this file (or creating your own) the file must follow a specific format.

    This first line is expected to contain column headings and is therefore not processed by the tz_db_base.

    Each record (line) must have eleven fields. Some of those fields can be empty. Every field (even empty ones) must be enclosed in double-quotes. Ex:

    @@ -93,47 +93,47 @@

    DST End date rule: See DST Start date rule. The difference here is this is the day daylight savings ends (transition to STD).

    End time: Same as Start time.

    -

    +

    tz_db_base public construct/copy/destruct

    1. -
      tz_db_base();
      Constructs an empty database.
    +
    tz_db_base();
    Constructs an empty database.
    -

    -tz_db_base public member functions

    +

    +tz_db_base public member functions

    1. -
      void load_from_stream(std::istream & in);
      Process csv data file, may throw exceptions.

      May throw bad_field_count exceptions

      +
      void load_from_stream(std::istream & in);
      Process csv data file, may throw exceptions.

      May throw bad_field_count exceptions

    2. -
      void load_from_file(const std::string & pathspec);
      Process csv data file, may throw exceptions.

      May throw data_not_accessible, or bad_field_count exceptions

      +
      void load_from_file(const std::string & pathspec);
      Process csv data file, may throw exceptions.

      May throw data_not_accessible, or bad_field_count exceptions

    3. -
      bool add_record(const string_type & region, 
+
      bool add_record(const string_type & region, 
                 boost::shared_ptr< time_zone_base_type > tz);
      returns true if record successfully added to map 
      Takes a region name in the form of "America/Phoenix", and a time_zone object for that region. The id string must be a unique name that does not already exist in the database. 
      
 
    4. boost::shared_ptr< time_zone_base_type > 
-time_zone_from_region(const string_type & region) const;
      Returns a time_zone object built from the specs for the given region.

      Returns a time_zone object built from the specs for the given region. If region does not exist a local_time::record_not_found exception will be thrown

      +time_zone_from_region(const string_type & region) const;Returns a time_zone object built from the specs for the given region.

      Returns a time_zone object built from the specs for the given region. If region does not exist a local_time::record_not_found exception will be thrown

    5. -
      std::vector< std::string > region_list() const;
      Returns a vector of strings holding the time zone regions in the database.
      6. +
      std::vector< std::string > region_list() const;
      Returns a vector of strings holding the time zone regions in the database.
    -

    -tz_db_base private member functions

    +

    +tz_db_base private member functions

    1. -
      rule_type * parse_rules(const string_type & sr, const string_type & er) const;
      parses rule specs for transition day rules
      2. +
      rule_type * parse_rules(const string_type & sr, const string_type & er) const;
      parses rule specs for transition day rules
    2. -
      week_num get_week_num(int nth) const;
      helper function for parse_rules()
      3. +
      week_num get_week_num(int nth) const;
      helper function for parse_rules()
    3. -
      void split_rule_spec(int & nth, int & d, int & m, string_type rule) const;
      splits the [start|end]_date_rule string into 3 ints
      4. +
      void split_rule_spec(int & nth, int & d, int & m, string_type rule) const;
      splits the [start|end]_date_rule string into 3 ints
    4. -
      bool parse_string(string_type & s);
      Take a line from the csv, turn it into a time_zone_type.

      Take a line from the csv, turn it into a time_zone_type, and add it to the map. Zone_specs in csv file are expected to have eleven fields that describe the time zone. Returns true if zone_spec successfully added to database

      +
      bool parse_string(string_type & s);
      Take a line from the csv, turn it into a time_zone_type.

      Take a line from the csv, turn it into a time_zone_type, and add it to the map. Zone_specs in csv file are expected to have eleven fields that describe the time zone. Returns true if zone_spec successfully added to database

    diff --git a/doc/html/boost/date_time/uk_dst_trait.html b/doc/html/boost/date_time/uk_dst_trait.html index 8ac9816fed..002dacc1bd 100644 --- a/doc/html/boost/date_time/uk_dst_trait.html +++ b/doc/html/boost/date_time/uk_dst_trait.html @@ -35,20 +35,20 @@ template<typename date_type> struct uk_dst_trait : public boost::date_time::eu_dst_trait< date_type > { - // public static functions - static int dst_start_offset_minutes(); - static int dst_end_offset_minutes(); - static int dst_shift_length_minutes(); + // public static functions + static int dst_start_offset_minutes(); + static int dst_end_offset_minutes(); + static int dst_shift_length_minutes(); };
    -

    Description

    +

    Description

    -

    -uk_dst_trait public static functions

    +

    +uk_dst_trait public static functions

      -
    1. static int dst_start_offset_minutes();
      2. -
    2. static int dst_end_offset_minutes();
      3. -
    3. static int dst_shift_length_minutes();
      4. +
    4. static int dst_start_offset_minutes();
      5. +
    5. static int dst_end_offset_minutes();
      6. +
    6. static int dst_shift_length_minutes();
    diff --git a/doc/html/boost/date_time/us_dst_rules.html b/doc/html/boost/date_time/us_dst_rules.html index f0eb96396b..063af2596f 100644 --- a/doc/html/boost/date_time/us_dst_rules.html +++ b/doc/html/boost/date_time/us_dst_rules.html @@ -47,29 +47,29 @@ typedef date_time::nth_kday_of_month< date_type > nkday; typedef dst_calculator< date_type, time_duration_type > dstcalc; - // public static functions + // public static functions static time_is_dst_result - local_is_dst(const date_type &, const time_duration_type &); - static bool is_dst_boundary_day(date_type); - static date_type local_dst_start_day(year_type); - static date_type local_dst_end_day(year_type); - static time_duration_type dst_offset(); + local_is_dst(const date_type &, const time_duration_type &); + static bool is_dst_boundary_day(date_type); + static date_type local_dst_start_day(year_type); + static date_type local_dst_end_day(year_type); + static time_duration_type dst_offset(); };
    -

    Description

    +

    Description

    -

    -us_dst_rules public static functions

    +

    +us_dst_rules public static functions

    1. static time_is_dst_result 
-local_is_dst(const date_type & d, const time_duration_type & td);
      Calculates if the given local time is dst or not.

      Determines if the time is really in DST or not. Also checks for invalid and ambiguous. +local_is_dst(const date_type & d, const time_duration_type & td);Calculates if the given local time is dst or not.

      Determines if the time is really in DST or not. Also checks for invalid and ambiguous.

      2. -
    2. static bool is_dst_boundary_day(date_type d);
      3. -
    3. static date_type local_dst_start_day(year_type year);
      4. -
    4. static date_type local_dst_end_day(year_type year);
      5. -
    5. static time_duration_type dst_offset();
      6. +
    6. static bool is_dst_boundary_day(date_type d);
      7. +
    7. static date_type local_dst_start_day(year_type year);
      8. +
    8. static date_type local_dst_end_day(year_type year);
      9. +
    9. static time_duration_type dst_offset();
    diff --git a/doc/html/boost/date_time/us_dst_trait.html b/doc/html/boost/date_time/us_dst_trait.html index a6c4929590..e7635cbf63 100644 --- a/doc/html/boost/date_time/us_dst_trait.html +++ b/doc/html/boost/date_time/us_dst_trait.html @@ -43,19 +43,19 @@ typedef date_time::first_kday_of_month< date_type > start_rule_functor_pre2007; typedef date_time::last_kday_of_month< date_type > end_rule_functor_pre2007; - // public static functions - static day_of_week_type start_day(year_type); - static month_type start_month(year_type); - static day_of_week_type end_day(year_type); - static month_type end_month(year_type); - static date_type local_dst_start_day(year_type); - static date_type local_dst_end_day(year_type); - static int dst_start_offset_minutes(); - static int dst_end_offset_minutes(); - static int dst_shift_length_minutes(); + // public static functions + static day_of_week_type start_day(year_type); + static month_type start_month(year_type); + static day_of_week_type end_day(year_type); + static month_type end_month(year_type); + static date_type local_dst_start_day(year_type); + static date_type local_dst_end_day(year_type); + static int dst_start_offset_minutes(); + static int dst_end_offset_minutes(); + static int dst_shift_length_minutes(); };
    -

    Description

    +

    Description

    This class is used to configure dst_calc_engine template typically as follows: 

    using namespace boost::gregorian;
 using namespace boost::posix_time;
@@ -80,18 +80,18 @@

    This generates a type suitable for the calculation of dst transitions for the United States. Of course other templates can be used for other locales.

    -

    -us_dst_trait public static functions

    +

    +us_dst_trait public static functions

      -
    1. static day_of_week_type start_day(year_type);
      2. -
    2. static month_type start_month(year_type y);
      3. -
    3. static day_of_week_type end_day(year_type);
      4. -
    4. static month_type end_month(year_type y);
      5. -
    5. static date_type local_dst_start_day(year_type year);
      6. -
    6. static date_type local_dst_end_day(year_type year);
      7. -
    7. static int dst_start_offset_minutes();
      8. -
    8. static int dst_end_offset_minutes();
      9. -
    9. static int dst_shift_length_minutes();
      10. +
    10. static day_of_week_type start_day(year_type);
      11. +
    11. static month_type start_month(year_type y);
      12. +
    12. static day_of_week_type end_day(year_type);
      13. +
    13. static month_type end_month(year_type y);
      14. +
    14. static date_type local_dst_start_day(year_type year);
      15. +
    15. static date_type local_dst_end_day(year_type year);
      16. +
    16. static int dst_start_offset_minutes();
      17. +
    17. static int dst_end_offset_minutes();
      18. +
    18. static int dst_shift_length_minutes();
    diff --git a/doc/html/boost/date_time/utc_adjustment.html b/doc/html/boost/date_time/utc_adjustment.html index ea2acae7a2..f621db04ac 100644 --- a/doc/html/boost/date_time/utc_adjustment.html +++ b/doc/html/boost/date_time/utc_adjustment.html @@ -36,18 +36,18 @@ class utc_adjustment { public: - // public static functions - static time_duration_type local_to_utc_base_offset(); - static time_duration_type utc_to_local_base_offset(); + // public static functions + static time_duration_type local_to_utc_base_offset(); + static time_duration_type utc_to_local_base_offset(); };
    -

    Description

    +

    Description

    -

    -utc_adjustment public static functions

    +

    +utc_adjustment public static functions

      -
    1. static time_duration_type local_to_utc_base_offset();
      2. -
    2. static time_duration_type utc_to_local_base_offset();
      3. +
    3. static time_duration_type local_to_utc_base_offset();
      4. +
    4. static time_duration_type utc_to_local_base_offset();
    diff --git a/doc/html/boost/date_time/var_string_to_int.html b/doc/html/boost/date_time/var_string_to_int.html index 1eff607d53..440c5e6aef 100644 --- a/doc/html/boost/date_time/var_string_to_int.html +++ b/doc/html/boost/date_time/var_string_to_int.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -38,7 +38,7 @@ const std::istreambuf_iterator< charT > & stream_end, unsigned int max_length);
    -

    Description

    +

    Description

    Will consume 'max_length' characters from stream only if those characters are digits. Returns '-1' if no number can be parsed. Will not parse a number preceeded by a '+' or '-'.

    @@ -50,7 +50,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/date_time/week_functor.html b/doc/html/boost/date_time/week_functor.html index 3e1ea44977..6423deb1b5 100644 --- a/doc/html/boost/date_time/week_functor.html +++ b/doc/html/boost/date_time/week_functor.html @@ -40,27 +40,27 @@ typedef date_type::calendar_type calendar_type; // construct/copy/destruct - week_functor(int); + week_functor(int); - // public member functions - duration_type get_offset(const date_type &) const; - duration_type get_neg_offset(const date_type &) const; + // public member functions + duration_type get_offset(const date_type &) const; + duration_type get_neg_offset(const date_type &) const; };
    -

    Description

    +

    Description

    -

    +

    week_functor public construct/copy/destruct

    -
    1. week_functor(int f);
    +
    1. week_functor(int f);
    -

    -week_functor public member functions

    +

    +week_functor public member functions

      -
    1. duration_type get_offset(const date_type & d) const;
      2. -
    2. duration_type get_neg_offset(const date_type & d) const;
      3. +
    3. duration_type get_offset(const date_type & d) const;
      4. +
    4. duration_type get_neg_offset(const date_type & d) const;
    diff --git a/doc/html/boost/date_time/weeks_duration.html b/doc/html/boost/date_time/weeks_duration.html index c897f6c011..5a683e2bf3 100644 --- a/doc/html/boost/date_time/weeks_duration.html +++ b/doc/html/boost/date_time/weeks_duration.html @@ -38,19 +38,19 @@ { public: // construct/copy/destruct - weeks_duration(typename duration_config::impl_type); - weeks_duration(special_values); + weeks_duration(typename duration_config::impl_type); + weeks_duration(special_values); };
    -

    Description

    +

    Description

    -

    +

    weeks_duration public construct/copy/destruct

      -
    1. weeks_duration(typename duration_config::impl_type w);
      2. -
    2. weeks_duration(special_values sv);
      3. +
    3. weeks_duration(typename duration_config::impl_type w);
      4. +
    4. weeks_duration(special_values sv);
    diff --git a/doc/html/boost/date_time/winapi/file_time_to_microseconds.html b/doc/html/boost/date_time/winapi/file_time_to_microseconds.html index 5cf8147eed..402feddcd8 100644 --- a/doc/html/boost/date_time/winapi/file_time_to_microseconds.html +++ b/doc/html/boost/date_time/winapi/file_time_to_microseconds.html @@ -36,7 +36,7 @@ template<typename FileTimeT> boost::uint64_t file_time_to_microseconds(FileTimeT const & ft);
    -

    Description

    +

    Description

    The function converts file_time into number of microseconds elapsed since 1970-Jan-01

    diff --git a/doc/html/boost/date_time/wrapping_int.html b/doc/html/boost/date_time/wrapping_int.html index 207218c122..04b1433a7a 100644 --- a/doc/html/boost/date_time/wrapping_int.html +++ b/doc/html/boost/date_time/wrapping_int.html @@ -39,57 +39,57 @@ typedefint_type_int_type;// construct/copy/destruct - wrapping_int(int_type); + wrapping_int(int_type); - // public static functions - staticint_typewrap_value(); + // public static functions + staticint_typewrap_value(); - // public member functions - int_typeas_int()const; - operator int_type()const; - template<typename IntT>IntTadd(IntT); - template<typename IntT>IntTsubtract(IntT); + // public member functions + int_typeas_int()const; + operator int_type()const; + template<typename IntT>IntTadd(IntT); + template<typename IntT>IntTsubtract(IntT); - // private member functions - template<typename IntT>IntTcalculate_wrap(IntT); + // private member functions + template<typename IntT>IntTcalculate_wrap(IntT);};
    -

    Description

    +

    Description

    In composite date and time types this type is used to wrap at the day boundary. Ex: A wrapping_int<short, 10> will roll over after nine, and roll under below zero. This gives a range of [0,9]

    NOTE: it is strongly recommended that wrapping_int2 be used instead of wrapping_int as wrapping_int is to be depricated at some point soon.

    Also Note that warnings will occur if instantiated with an unsigned type. Only a signed type should be used!

    -

    +

    wrapping_int public construct/copy/destruct

    1. -
      wrapping_int(int_type v);
      Add, return true if wrapped.
    +
    wrapping_int(int_type v);
    Add, return true if wrapped.
    -

    -wrapping_int public static functions

    -
    1. static int_type wrap_value();
    +

    +wrapping_int public static functions

    +
    1. static int_type wrap_value();
    -

    -wrapping_int public member functions

    +

    +wrapping_int public member functions

    1. -
      int_type as_int() const;
      Explicit converion method.
      2. -
    2. operator int_type() const;
      3. +
      int_type as_int() const;
      Explicit converion method. +
    3. operator int_type() const;
    4. -
      template<typename IntT> IntT add(IntT v);
      Add, return number of wraps performed.

      The sign of the returned value will indicate which direction the wraps went. Ex: add a negative number and wrapping under could occur, this would be indicated by a negative return value. If wrapping over took place, a positive value would be returned

      +
      template<typename IntT> IntT add(IntT v);
      Add, return number of wraps performed.

      The sign of the returned value will indicate which direction the wraps went. Ex: add a negative number and wrapping under could occur, this would be indicated by a negative return value. If wrapping over took place, a positive value would be returned

    5. -
      template<typename IntT> IntT subtract(IntT v);
      Subtract will return '+d' if wrapping under took place ('d' is the number of wraps)

      The sign of the returned value will indicate which direction the wraps went (positive indicates wrap under, negative indicates wrap over). Ex: subtract a negative number and wrapping over could occur, this would be indicated by a negative return value. If wrapping under took place, a positive value would be returned.

      +
      template<typename IntT> IntT subtract(IntT v);
      Subtract will return '+d' if wrapping under took place ('d' is the number of wraps)

      The sign of the returned value will indicate which direction the wraps went (positive indicates wrap under, negative indicates wrap over). Ex: subtract a negative number and wrapping over could occur, this would be indicated by a negative return value. If wrapping under took place, a positive value would be returned.

    -

    -wrapping_int private member functions

    -
    1. template<typename IntT> IntT calculate_wrap(IntT wrap);
    +

    +wrapping_int private member functions

    +
    1. template<typename IntT> IntT calculate_wrap(IntT wrap);
    diff --git a/doc/html/boost/date_time/wrapping_int2.html b/doc/html/boost/date_time/wrapping_int2.html index d501fb1156..bbed7913d8 100644 --- a/doc/html/boost/date_time/wrapping_int2.html +++ b/doc/html/boost/date_time/wrapping_int2.html @@ -39,61 +39,61 @@ typedefint_type_int_type;// construct/copy/destruct - wrapping_int2(int_type); + wrapping_int2(int_type); - // public static functions - staticint_typewrap_value(); - staticint_typemin_value(); + // public static functions + staticint_typewrap_value(); + staticint_typemin_value(); - // public member functions - int_typeas_int()const; - operator int_type()const; - template<typename IntT>IntTadd(IntT); - template<typename IntT>IntTsubtract(IntT); + // public member functions + int_typeas_int()const; + operator int_type()const; + template<typename IntT>IntTadd(IntT); + template<typename IntT>IntTsubtract(IntT); - // private member functions - template<typename IntT>IntTcalculate_wrap(IntT); + // private member functions + template<typename IntT>IntTcalculate_wrap(IntT);};
    -

    Description

    +

    Description

    Bad name, quick impl to fix a bug <ndash></ndash> fix later!! This allows the wrap to restart at a value other than 0.

    -

    +

    wrapping_int2 public construct/copy/destruct

    1. -
      wrapping_int2(int_type v);
      +
      wrapping_int2(int_type v);

      If initializing value is out of range of [wrap_min, wrap_max], value will be initialized to closest of min or max

    -

    -wrapping_int2 public static functions

    +

    +wrapping_int2 public static functions

      -
    1. static int_type wrap_value();
      2. -
    2. static int_type min_value();
      3. +
    3. static int_type wrap_value();
      4. +
    4. static int_type min_value();
    -

    -wrapping_int2 public member functions

    +

    +wrapping_int2 public member functions

    1. -
      int_type as_int() const;
      Explicit converion method.
      2. -
    2. operator int_type() const;
      3. +
      int_type as_int() const;
      Explicit converion method. +
    3. operator int_type() const;
    4. -
      template<typename IntT> IntT add(IntT v);
      Add, return number of wraps performed.

      The sign of the returned value will indicate which direction the wraps went. Ex: add a negative number and wrapping under could occur, this would be indicated by a negative return value. If wrapping over took place, a positive value would be returned

      +
      template<typename IntT> IntT add(IntT v);
      Add, return number of wraps performed.

      The sign of the returned value will indicate which direction the wraps went. Ex: add a negative number and wrapping under could occur, this would be indicated by a negative return value. If wrapping over took place, a positive value would be returned

    5. -
      template<typename IntT> IntT subtract(IntT v);
      Subtract will return '-d' if wrapping under took place ('d' is the number of wraps)

      The sign of the returned value will indicate which direction the wraps went. Ex: subtract a negative number and wrapping over could occur, this would be indicated by a positive return value. If wrapping under took place, a negative value would be returned

      +
      template<typename IntT> IntT subtract(IntT v);
      Subtract will return '-d' if wrapping under took place ('d' is the number of wraps)

      The sign of the returned value will indicate which direction the wraps went. Ex: subtract a negative number and wrapping over could occur, this would be indicated by a positive return value. If wrapping under took place, a negative value would be returned

    -

    -wrapping_int2 private member functions

    -
    1. template<typename IntT> IntT calculate_wrap(IntT wrap);
    +

    +wrapping_int2 private member functions

    +
    1. template<typename IntT> IntT calculate_wrap(IntT wrap);
    diff --git a/doc/html/boost/date_time/year_based_generator.html b/doc/html/boost/date_time/year_based_generator.html index 37a5b35244..b1f5ebe8ea 100644 --- a/doc/html/boost/date_time/year_based_generator.html +++ b/doc/html/boost/date_time/year_based_generator.html @@ -40,34 +40,34 @@ typedefcalendar_type::year_typeyear_type;// construct/copy/destruct - year_based_generator(); - ~year_based_generator(); + year_based_generator(); + ~year_based_generator(); - // public member functions - virtualdate_typeget_date(year_type)const=0; - virtualstd::stringto_string()const=0; + // public member functions + virtualdate_typeget_date(year_type)const=0; + virtualstd::stringto_string()const=0;};
    -

    Description

    +

    Description

    This class is a base class for polymorphic function objects that take a year and produce a concrete date.

    -

    +

    year_based_generator public construct/copy/destruct

      -
    1. year_based_generator();
      2. -
    2. ~year_based_generator();
      3. +
    3. year_based_generator();
      4. +
    4. ~year_based_generator();
    -

    -year_based_generator public member functions

    +

    +year_based_generator public member functions

      -
    1. virtual date_type get_date(year_type y) const = 0;
      2. +
    2. virtual date_type get_date(year_type y) const = 0;
    3. -
      virtual std::string to_string() const = 0;
      Returns a string for use in a POSIX time_zone string.
      4. +
      virtual std::string to_string() const = 0;
      Returns a string for use in a POSIX time_zone string.
    diff --git a/doc/html/boost/date_time/year_functor.html b/doc/html/boost/date_time/year_functor.html index 3697105098..b2abad9dac 100644 --- a/doc/html/boost/date_time/year_functor.html +++ b/doc/html/boost/date_time/year_functor.html @@ -39,27 +39,27 @@ typedefdate_type::duration_typeduration_type;// construct/copy/destruct - year_functor(int); + year_functor(int); - // public member functions - duration_typeget_offset(constdate_type&)const; - duration_typeget_neg_offset(constdate_type&)const; + // public member functions + duration_typeget_offset(constdate_type&)const; + duration_typeget_neg_offset(constdate_type&)const;};
    -

    Description

    +

    Description

    -

    +

    year_functor public construct/copy/destruct

    -
    1. year_functor(int f);
    +
    1. year_functor(int f);
    -

    -year_functor public member functions

    +

    +year_functor public member functions

      -
    1. duration_type get_offset(const date_type & d) const;
      2. -
    2. duration_type get_neg_offset(const date_type & d) const;
      3. +
    3. duration_type get_offset(const date_type & d) const;
      4. +
    4. duration_type get_neg_offset(const date_type & d) const;
    diff --git a/doc/html/boost/date_time/year_month_day_base.html b/doc/html/boost/date_time/year_month_day_base.html index b50c679d5a..756047c49f 100644 --- a/doc/html/boost/date_time/year_month_day_base.html +++ b/doc/html/boost/date_time/year_month_day_base.html @@ -40,7 +40,7 @@ typedefDayTypeday_type;// construct/copy/destruct - year_month_day_base(YearType,MonthType,DayType); + year_month_day_base(YearType,MonthType,DayType);// public data membersYearTypeyear; @@ -48,14 +48,14 @@ DayTypeday;};
    -

    Description

    +

    Description

    -

    +

    year_month_day_base public construct/copy/destruct

    1. -
      year_month_day_base(YearType year, MonthType month, DayType day);
      A basic constructor.
    +
    year_month_day_base(YearType year, MonthType month, DayType day);
    A basic constructor.
    diff --git a/doc/html/boost/date_time/years_duration.html b/doc/html/boost/date_time/years_duration.html index b60d2311d2..5f8eb36c3d 100644 --- a/doc/html/boost/date_time/years_duration.html +++ b/doc/html/boost/date_time/years_duration.html @@ -36,60 +36,60 @@ classyears_duration{public:// construct/copy/destruct - years_duration(int_rep); - years_duration(special_values); + years_duration(int_rep); + years_duration(special_values); - // public member functions - int_repnumber_of_years()const; - duration_typeget_neg_offset(constdate_type&)const; - duration_typeget_offset(constdate_type&)const; - booloperator==(const years_type &)const; - booloperator!=(const years_type &)const; - years_type operator+(const years_type &)const; - years_type &operator+=(const years_type &); - years_type operator-(const years_type &)const; - years_type &operator-=(const years_type &); - years_type operator*(constint_type)const; - years_type &operator*=(constint_type); - years_type operator/(constint_type)const; - years_type &operator/=(constint_type); - months_type operator+(const months_type &)const; - months_type operator-(const months_type &)const; + // public member functions + int_repnumber_of_years()const; + duration_typeget_neg_offset(constdate_type&)const; + duration_typeget_offset(constdate_type&)const; + booloperator==(const years_type &)const; + booloperator!=(const years_type &)const; + years_type operator+(const years_type &)const; + years_type &operator+=(const years_type &); + years_type operator-(const years_type &)const; + years_type &operator-=(const years_type &); + years_type operator*(constint_type)const; + years_type &operator*=(constint_type); + years_type operator/(constint_type)const; + years_type &operator/=(constint_type); + months_type operator+(const months_type &)const; + months_type operator-(const months_type &)const;};
    -

    Description

    +

    Description

    A logical year enables things like: "date(2002,Mar,2) + years(2) -> 2004-Mar-2". If the date is a last day-of-the-month, the result will also be a last-day-of-the-month (ie date(2001-Feb-28) + years(3) -> 2004-Feb-29).

    -

    +

    years_duration public construct/copy/destruct

      -
    1. years_duration(int_rep num);
      2. -
    2. years_duration(special_values sv);
      3. +
    3. years_duration(int_rep num);
      4. +
    4. years_duration(special_values sv);
    -

    -years_duration public member functions

    +

    +years_duration public member functions

      -
    1. int_rep number_of_years() const;
      2. +
    2. int_rep number_of_years() const;
    3. -
      duration_type get_neg_offset(const date_type & d) const;
      returns a negative duration
      4. -
    4. duration_type get_offset(const date_type & d) const;
      5. -
    5. bool operator==(const years_type & rhs) const;
      6. -
    6. bool operator!=(const years_type & rhs) const;
      7. -
    7. years_type operator+(const years_type & rhs) const;
      8. -
    8. years_type & operator+=(const years_type & rhs);
      9. -
    9. years_type operator-(const years_type & rhs) const;
      10. -
    10. years_type & operator-=(const years_type & rhs);
      11. -
    11. years_type operator*(const int_type rhs) const;
      12. -
    12. years_type & operator*=(const int_type rhs);
      13. -
    13. years_type operator/(const int_type rhs) const;
      14. -
    14. years_type & operator/=(const int_type rhs);
      15. -
    15. months_type operator+(const months_type & m) const;
      16. -
    16. months_type operator-(const months_type & m) const;
      17. +
      duration_type get_neg_offset(const date_type & d) const;
      returns a negative duration +
    17. duration_type get_offset(const date_type & d) const;
      18. +
    18. bool operator==(const years_type & rhs) const;
      19. +
    19. bool operator!=(const years_type & rhs) const;
      20. +
    20. years_type operator+(const years_type & rhs) const;
      21. +
    21. years_type & operator+=(const years_type & rhs);
      22. +
    22. years_type operator-(const years_type & rhs) const;
      23. +
    23. years_type & operator-=(const years_type & rhs);
      24. +
    24. years_type operator*(const int_type rhs) const;
      25. +
    25. years_type & operator*=(const int_type rhs);
      26. +
    26. years_type operator/(const int_type rhs) const;
      27. +
    27. years_type & operator/=(const int_type rhs);
      28. +
    28. months_type operator+(const months_type & m) const;
      29. +
    29. months_type operator-(const months_type & m) const;
    diff --git a/doc/html/boost/date_time/ymd_formatter.html b/doc/html/boost/date_time/ymd_formatter.html index 626d26ae18..bab57b1cc1 100644 --- a/doc/html/boost/date_time/ymd_formatter.html +++ b/doc/html/boost/date_time/ymd_formatter.html @@ -36,21 +36,21 @@ classymd_formatter{public: - // public static functions - staticstd::basic_string<charT>ymd_to_string(ymd_type); - staticstd::stringymd_to_string(ymd_type); + // public static functions + staticstd::basic_string<charT>ymd_to_string(ymd_type); + staticstd::stringymd_to_string(ymd_type);};
    -

    Description

    +

    Description

    -

    -ymd_formatter public static functions

    +

    +ymd_formatter public static functions

    1. -
      static std::basic_string< charT > ymd_to_string(ymd_type ymd);
      Convert ymd to a standard string formatting policies.

      This is standard code for handling date formatting with year-month-day based date information. This function uses the format_type to control whether the string will contain separator characters, and if so what the character will be. In addtion, it can format the month as either an integer or a string as controled by the formatting policy

      +
      static std::basic_string< charT > ymd_to_string(ymd_type ymd);
      Convert ymd to a standard string formatting policies.

      This is standard code for handling date formatting with year-month-day based date information. This function uses the format_type to control whether the string will contain separator characters, and if so what the character will be. In addtion, it can format the month as either an integer or a string as controled by the formatting policy

    2. -
      static std::string ymd_to_string(ymd_type ymd);
      Convert ymd to a standard string formatting policies.

      This is standard code for handling date formatting with year-month-day based date information. This function uses the format_type to control whether the string will contain separator characters, and if so what the character will be. In addtion, it can format the month as either an integer or a string as controled by the formatting policy

      +
      static std::string ymd_to_string(ymd_type ymd);
      Convert ymd to a standard string formatting policies.

      This is standard code for handling date formatting with year-month-day based date information. This function uses the format_type to control whether the string will contain separator characters, and if so what the character will be. In addtion, it can format the month as either an integer or a string as controled by the formatting policy

    diff --git a/doc/html/boost/date_time/ymd_order_spec.html b/doc/html/boost/date_time/ymd_order_spec.html index 3acab9266f..21b9075ba2 100644 --- a/doc/html/boost/date_time/ymd_order_spec.html +++ b/doc/html/boost/date_time/ymd_order_spec.html @@ -36,7 +36,7 @@ enum ymd_order_spec { ymd_order_iso, ymd_order_dmy, ymd_order_us };
    -

    Description

    +

    Description

    Enum for distinguishing the order in which Month, Day, & Year will appear in a date string

    diff --git a/doc/html/boost/enable_m_idm45506990224064.html b/doc/html/boost/enable_m_idm45506990224064.html new file mode 100644 index 0000000000..00958dceee --- /dev/null +++ b/doc/html/boost/enable_m_idm45506990224064.html @@ -0,0 +1,60 @@ + + + + +Struct template enable_move_utility_emulation + + + + + + + + +
    + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct template enable_move_utility_emulation

    +

    boost::enable_move_utility_emulation

    +
    +

    Synopsis

    +
    // In header: <boost/move/utility_core.hpp>
+
+template<typename T> 
+struct enable_move_utility_emulation {
+
+  // public data members
+  static const bool value;
+};
    +
    +

    Description

    +

    This trait's internal boolean value is false in compilers with rvalue references and true in compilers without rvalue references.

    +

    A user can specialize this trait for a type T to false to SFINAE out move and forward so that the user can define a different move emulation for that type in namespace boost (e.g. another Boost library for its types) and avoid any overload ambiguity.

    +
    +
    + + + +
    Copyright © 2008-2014 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/enable_move_u_idp163645968.html b/doc/html/boost/enable_move_u_idp163645968.html deleted file mode 100644 index 589c4e9cd0..0000000000 --- a/doc/html/boost/enable_move_u_idp163645968.html +++ /dev/null @@ -1,60 +0,0 @@ - - - - -Struct template enable_move_utility_emulation - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template enable_move_utility_emulation

    -

    boost::enable_move_utility_emulation

    -
    -

    Synopsis

    -
    // In header: <boost/move/utility_core.hpp>
-
-template<typename T> 
-struct enable_move_utility_emulation {
-
-  // public data members
-  static const bool value;
-};
    -
    -

    Description

    -

    This trait's internal boolean value is false in compilers with rvalue references and true in compilers without rvalue references.

    -

    A user can specialize this trait for a type T to false to SFINAE out move and forward so that the user can define a different move emulation for that type in namespace boost (e.g. another Boost library for its types) and avoid any overload ambiguity.

    -
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/environment_iterator.html b/doc/html/boost/environment_iterator.html index 4174e672ee..84bc78baf6 100644 --- a/doc/html/boost/environment_iterator.html +++ b/doc/html/boost/environment_iterator.html @@ -37,28 +37,28 @@ { public: // construct/copy/destruct - environment_iterator(char **); - environment_iterator(); + environment_iterator(char **); + environment_iterator(); - // public member functions - void get(); + // public member functions + void get(); };
    -

    Description

    +

    Description

    -

    +

    environment_iterator public construct/copy/destruct

      -
    1. environment_iterator(char ** environment);
      2. -
    2. environment_iterator();
      3. +
    3. environment_iterator(char ** environment);
      4. +
    4. environment_iterator();
    -

    -environment_iterator public member functions

    -
    1. void get();
    +

    +environment_iterator public member functions

    +
    1. void get();
    diff --git a/doc/html/boost/eof_iterator.html b/doc/html/boost/eof_iterator.html index 4f78532b60..d74338a132 100644 --- a/doc/html/boost/eof_iterator.html +++ b/doc/html/boost/eof_iterator.html @@ -38,19 +38,19 @@ { public: // construct/copy/destruct - eof_iterator(); + eof_iterator(); - // protected member functions - ValueType & value(); - void found_eof(); + // protected member functions + ValueType & value(); + void found_eof(); - // private member functions - void increment(); - bool equal(const eof_iterator &) const; - const ValueType & dereference() const; + // private member functions + void increment(); + bool equal(const eof_iterator &) const; + const ValueType & dereference() const; };
    -

    Description

    +

    Description

    The 'eof_iterator' class is useful for constructing forward iterators in cases where iterator extract data from some source and it's easy to detect 'eof' -- i.e. the situation where there's no data. One apparent example is reading lines from a file.

    Implementing such iterators using 'iterator_facade' directly would require to create class with three core operation, a couple of constructors. When using 'eof_iterator', the derived class should define only one method to get new value, plus a couple of constructors.

    The basic idea is that iterator has 'eof' bit. Two iterators are equal only if both have their 'eof' bits set. The 'get' method either obtains the new value or sets the 'eof' bit.

    @@ -73,33 +73,33 @@

    Essentially, the 'get' method has the functionality of both 'increment' and 'dereference'. It's very good for the cases where data extraction implicitly moves data pointer, like for stream operation.

    -

    +

    eof_iterator public construct/copy/destruct

    -
    1. eof_iterator();
    +
    1. eof_iterator();
    -

    -eof_iterator protected member functions

    +

    +eof_iterator protected member functions

    1. -
      ValueType & value();
      +
      ValueType & value();

      Returns the reference which should be used by derived class to store the next value.

    2. -
      void found_eof();
      +
      void found_eof();

      Should be called by derived class to indicate that it can't produce next element.

    -

    -eof_iterator private member functions

    +

    +eof_iterator private member functions

      -
    1. void increment();
      2. -
    2. bool equal(const eof_iterator & other) const;
      3. -
    3. const ValueType & dereference() const;
      4. +
    4. void increment();
      5. +
    5. bool equal(const eof_iterator & other) const;
      6. +
    6. const ValueType & dereference() const;
    diff --git a/doc/html/boost/forward.html b/doc/html/boost/forward.html index a9324863c3..9d290a9445 100644 --- a/doc/html/boost/forward.html +++ b/doc/html/boost/forward.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -35,7 +35,7 @@ template<typename T> output_reference forward(input_reference);
    -

    Description

    +

    Description

    This function provides limited form of forwarding that is usually enough for in-place construction and avoids the exponential overloading for achieve the limited forwarding in C++03.

    For compilers with rvalue references this function provides perfect forwarding.

    Otherwise:

    @@ -57,7 +57,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/front_move_insert_iterator.html b/doc/html/boost/front_move_insert_iterator.html index 28e7d19d01..f790b2d370 100644 --- a/doc/html/boost/front_move_insert_iterator.html +++ b/doc/html/boost/front_move_insert_iterator.html @@ -44,36 +44,36 @@ typedef std::output_iterator_tag iterator_category; // construct/copy/destruct - explicit front_move_insert_iterator(C &); - front_move_insert_iterator & operator=(reference); - front_move_insert_iterator & operator=(value_type &&); + explicit front_move_insert_iterator(C &); + front_move_insert_iterator & operator=(reference); + front_move_insert_iterator & operator=(value_type &&); - // public member functions - front_move_insert_iterator & operator*(); - front_move_insert_iterator & operator++(); - front_move_insert_iterator & operator++(int); + // public member functions + front_move_insert_iterator & operator*(); + front_move_insert_iterator & operator++(); + front_move_insert_iterator & operator++(int); };
    -

    Description

    +

    Description

    A move insert iterator that move constructs elements int the front of a container

    -

    +

    front_move_insert_iterator public construct/copy/destruct

      -
    1. explicit front_move_insert_iterator(C & x);
      2. -
    2. front_move_insert_iterator & operator=(reference x);
      3. -
    3. front_move_insert_iterator & operator=(value_type && x);
      4. +
    4. explicit front_move_insert_iterator(C & x);
      5. +
    5. front_move_insert_iterator & operator=(reference x);
      6. +
    6. front_move_insert_iterator & operator=(value_type && x);
    -

    -front_move_insert_iterator public member functions

    +

    +front_move_insert_iterator public member functions

      -
    1. front_move_insert_iterator & operator*();
      2. -
    2. front_move_insert_iterator & operator++();
      3. -
    3. front_move_insert_iterator & operator++(int);
      4. +
    4. front_move_insert_iterator & operator*();
      5. +
    5. front_move_insert_iterator & operator++();
      6. +
    6. front_move_insert_iterator & operator++(int);
    diff --git a/doc/html/boost/front_move_inserter.html b/doc/html/boost/front_move_inserter.html index bfbc0c59a4..2e6bcf2001 100644 --- a/doc/html/boost/front_move_inserter.html +++ b/doc/html/boost/front_move_inserter.html @@ -36,7 +36,7 @@ template<typename C> front_move_insert_iterator< C > front_move_inserter(C & x);
    -

    Description

    +

    Description

    Returns: front_move_insert_iterator<C>(x).

    diff --git a/doc/html/boost/function.html b/doc/html/boost/function.html index d9b2e74a26..5eafb4dd98 100644 --- a/doc/html/boost/function.html +++ b/doc/html/boost/function.html @@ -61,65 +61,65 @@ }; // construct/copy/destruct - function(); - function(const functionN&); - function(functionN&&); - function(const function&); - function(function&&); - template<typename F> function(F); - template<typename F, typename Allocator> function(F, Allocator); - function& operator=(const functionN&); - function& operator=(functionN&&); - function& operator=(const function&); - function& operator=(function&&); - ~function(); + function(); + function(const functionN&); + function(functionN&&); + function(const function&); + function(function&&); + template<typename F> function(F); + template<typename F, typename Allocator> function(F, Allocator); + function& operator=(const functionN&); + function& operator=(functionN&&); + function& operator=(const function&); + function& operator=(function&&); + ~function(); - // modifiers - void swap(const function&); - void clear(); + // modifiers + void swap(const function&); + void clear(); - // capacity - bool empty() const; - operator safe_bool() const; - bool operator!() const; + // capacity + bool empty() const; + operator safe_bool() const; + bool operator!() const; - // target access - template<typename Functor> Functor* target(); - template<typename Functor> const Functor* target() const; - template<typename Functor> bool contains(const Functor&) const; - const std::type_info& target_type() const; + // target access + template<typename Functor> Functor* target(); + template<typename Functor> const Functor* target() const; + template<typename Functor> bool contains(const Functor&) const; + const std::type_info& target_type() const; - // invocation - result_type operator()(arg1_type, arg2_type, ..., argN_type) const; + // invocation + result_type operator()(arg1_type, arg2_type, ..., argN_type) const; }; -// specialized algorithms +// specialized algorithms template<typename Signature> - void swap(function<Signature>&, function<Signature>&); + void swap(function<Signature>&, function<Signature>&); -// comparison operators +// comparison operators template<typename Signature, typename Functor> - bool operator==(const function<Signature>&, Functor); + bool operator==(const function<Signature>&, Functor); template<typename Signature, typename Functor> - bool operator==(Functor, const function<Signature>&); + bool operator==(Functor, const function<Signature>&); template<typename Signature, typename Functor> - bool operator==(const function<Signature>&, reference_wrapper<Functor>); + bool operator==(const function<Signature>&, reference_wrapper<Functor>); template<typename Signature, typename Functor> - bool operator==(reference_wrapper<Functor>, const function<Signature>&); + bool operator==(reference_wrapper<Functor>, const function<Signature>&); template<typename Signature1, typename Signature2> - void operator==(const function<Signature1>&, const function<Signature2>&); + void operator==(const function<Signature1>&, const function<Signature2>&); template<typename Signature, typename Functor> - bool operator!=(const function<Signature>&, Functor); + bool operator!=(const function<Signature>&, Functor); template<typename Signature, typename Functor> - bool operator!=(Functor, const function<Signature>&); + bool operator!=(Functor, const function<Signature>&); template<typename Signature, typename Functor> - bool operator!=(const function<Signature>&, reference_wrapper<Functor>); + bool operator!=(const function<Signature>&, reference_wrapper<Functor>); template<typename Signature, typename Functor> - bool operator!=(reference_wrapper<Functor>, const function<Signature>&); + bool operator!=(reference_wrapper<Functor>, const function<Signature>&); template<typename Signature1, typename Signature2> - void operator!=(const function<Signature1>&, const function<Signature2>&); + void operator!=(const function<Signature1>&, const function<Signature2>&);
    -

    Description

    +

    Description

    Class template function is a thin wrapper around the numbered class templates function0, function1, etc. It accepts a function type with N arguments and will will derive from @@ -131,20 +131,20 @@ additional member functions are required to allow proper copy construction and copy assignment of function objects.

    -

    Template Parameters

    +

    Template Parameters

    1. typename Signature

    -

    +

    function public construct/copy/destruct

    1. -
      function();
      +
      function();
      @@ -153,7 +153,7 @@ - + @@ -163,7 +163,7 @@

      Postconditions:

      		this->empty()this->empty()

      Throws:

    2. -
      function(const functionN& f);
      +
      function(const functionN& f);
      @@ -172,7 +172,7 @@ - + @@ -182,7 +182,7 @@

      Postconditions:

      		Contains a copy of the f's target, if it has one, or is empty if f.empty().Contains a copy of the f's target, if it has one, or is empty if f.empty().

      Throws:

    3. -
      function(functionN&& f);
      +
      function(functionN&& f);
      @@ -205,7 +205,7 @@
    4. -
      function(const function& f);
      +
      function(const function& f);
      @@ -214,7 +214,7 @@ - + @@ -224,7 +224,7 @@

      Postconditions:

      		Contains a copy of the f's target, if it has one, or is empty if f.empty().Contains a copy of the f's target, if it has one, or is empty if f.empty().

      Throws:

    5. -
      function(function&& f);
      +
      function(function&& f);
      @@ -247,7 +247,7 @@
    6. -
      template<typename F> function(F f);
      +
      template<typename F> function(F f);
      @@ -261,13 +261,13 @@ +*this targets a copy of f if f is nonempty, or this->empty() if f is empty.

      Postconditions:

      		 -*this targets a copy of f if f is nonempty, or this->empty() if f is empty.
    7. -
      template<typename F, typename Allocator> function(F f, Allocator alloc);
      +
      template<typename F, typename Allocator> function(F f, Allocator alloc);
      @@ -281,7 +281,7 @@ +*this targets a copy of f if f is nonempty, or this->empty() if f is empty. @@ -291,7 +291,7 @@

      Postconditions:

      		 -*this targets a copy of f if f is nonempty, or this->empty() if f is empty.

      Effects:

    8. -
      function& operator=(const functionN& f);
      +
      function& operator=(const functionN& f);
      @@ -299,12 +299,12 @@ - +

      Postconditions:

      		If copy construction does not throw, *this targets a copy of f's target, if it has one, or is empty if f.empty(). If copy construction does throw, this->empty().If copy construction does not throw, *this targets a copy of f's target, if it has one, or is empty if f.empty(). If copy construction does throw, this->empty().
    9. -
      function& operator=(functionN&& f);
      +
      function& operator=(functionN&& f);
      @@ -327,7 +327,7 @@
    10. -
      function& operator=(const function& f);
      +
      function& operator=(const function& f);
      @@ -336,17 +336,17 @@ - + - +

      Postconditions:

      		If copy construction of the target of f does not throw, *this targets a copy of f's target, if it has one, or is empty if f.empty(). If copy construction of the target of f does not throw, *this targets a copy of f's target, if it has one, or is empty if f.empty().

      Throws:

      		Will not throw when the target of f is a stateless function object or a reference to the function object. If copy construction does throw, this->empty().Will not throw when the target of f is a stateless function object or a reference to the function object. If copy construction does throw, this->empty().
    11. -
      function& operator=(function&& f);
      +
      function& operator=(function&& f);
      @@ -369,7 +369,7 @@
    12. -
      ~function();
      +
      ~function();
      @@ -377,18 +377,18 @@ - +

      Effects:

      		If !this->empty(), destroys the target of this.If !this->empty(), destroys the target of this.
    -

    -function modifiers

    +

    +function modifiers

    1. -
      void swap(const function& f);
      +
      void swap(const function& f);
      @@ -401,7 +401,7 @@
    2. -
      void clear();
      +
      void clear();
      @@ -410,7 +410,7 @@ - + @@ -422,11 +422,11 @@
      -

      -function capacity

      +

      +function capacity

      1. -
        bool empty() const;
        +
        bool empty() const;

      Postconditions:

      		this->empty()this->empty()

      Throws:
      @@ -446,7 +446,7 @@
    3. -
      operator safe_bool() const;
      +
      operator safe_bool() const;
      @@ -455,7 +455,7 @@ - + @@ -465,7 +465,7 @@

      Returns:

      		A safe_bool that evaluates false in a boolean context when this->empty(), and true otherwise.A safe_bool that evaluates false in a boolean context when this->empty(), and true otherwise.

      Throws:

    4. -
      bool operator!() const;
      +
      bool operator!() const;
      @@ -474,7 +474,7 @@ - + @@ -486,12 +486,12 @@
      -

      -function target access

      +

      +function target access

      1. -
        template<typename Functor> Functor* target();
-template<typename Functor> const Functor* target() const;
        +
        template<typename Functor> Functor* target();
+template<typename Functor> const Functor* target() const;

      Returns:

      		this->empty()this->empty()

      Throws:
      @@ -513,7 +513,7 @@
    5. -
      template<typename Functor> bool contains(const Functor& f) const;
      +
      template<typename Functor> bool contains(const Functor& f) const;
      @@ -522,13 +522,13 @@

      Returns:

      		 -true if this->target<Functor>() is non-NULL and function_equal(*(this->target<Functor>()), f) +true if this->target<Functor>() is non-NULL and function_equal(*(this->target<Functor>()), f)
    6. -
      const std::type_info& target_type() const;
      +
      const std::type_info& target_type() const;
      @@ -538,7 +538,7 @@ +typeid of the target function object, or typeid(void) if this->empty(). @@ -550,10 +550,10 @@
      -

      -function invocation

      +

      +function invocation

      1. -
        result_type operator()(arg1_type a1, arg2_type a2, ..., argN_type aN) const;
        +
        result_type operator()(arg1_type a1, arg2_type a2, ..., argN_type aN) const;

      Returns:

      		 -typeid of the target function object, or typeid(void) if this->empty().

      Throws:
      @@ -572,18 +572,18 @@ +bad_function_call if this->empty(). Otherwise, may through any exception thrown by the target function f.

      Throws:

      		 -bad_function_call if this->empty(). Otherwise, may through any exception thrown by the target function f.
    -

    -function specialized algorithms

    +

    +function specialized algorithms

    1. template<typename Signature> 
-  void swap(function<Signature>& f1, function<Signature>& f2);
      + void swap(function<Signature>& f1, function<Signature>& f2);
      @@ -591,27 +591,27 @@ - +

      Effects:

      		f1.swap(f2)f1.swap(f2)
    -

    -function comparison operators

    +

    +function comparison operators

    1. -

      +

      template<typename Signature, typename Functor> 
-  bool operator==(const function<Signature>& f, Functor g);
+  bool operator==(const function<Signature>& f, Functor g);
 template<typename Signature, typename Functor> 
-  bool operator==(Functor g, const function<Signature>& f);
+  bool operator==(Functor g, const function<Signature>& f);
 template<typename Signature, typename Functor> 
-  bool operator==(const function<Signature>& f, reference_wrapper<Functor> g);
+  bool operator==(const function<Signature>& f, reference_wrapper<Functor> g);
 template<typename Signature, typename Functor> 
-  bool operator==(reference_wrapper<Functor> g, const function<Signature>& f);
+  bool operator==(reference_wrapper<Functor> g, const function<Signature>& f);
 template<typename Signature1, typename Signature2> 
-  void operator==(const function<Signature1>& f1, 
+  void operator==(const function<Signature1>& f1, 
                   const function<Signature2>& f2);
      @@ -655,17 +655,17 @@
    2. -

      +

      template<typename Signature, typename Functor> 
-  bool operator!=(const function<Signature>& f, Functor g);
+  bool operator!=(const function<Signature>& f, Functor g);
 template<typename Signature, typename Functor> 
-  bool operator!=(Functor g, const function<Signature>& f);
+  bool operator!=(Functor g, const function<Signature>& f);
 template<typename Signature, typename Functor> 
-  bool operator!=(const function<Signature>& f, reference_wrapper<Functor> g);
+  bool operator!=(const function<Signature>& f, reference_wrapper<Functor> g);
 template<typename Signature, typename Functor> 
-  bool operator!=(reference_wrapper<Functor> g, const function<Signature>& f);
+  bool operator!=(reference_wrapper<Functor> g, const function<Signature>& f);
 template<typename Signature1, typename Signature2> 
-  void operator!=(const function<Signature1>& f1, 
+  void operator!=(const function<Signature1>& f1, 
                   const function<Signature2>& f2);
      diff --git a/doc/html/boost/function/sig.html b/doc/html/boost/function/sig.html index f0e3aeaaab..66929e14c6 100644 --- a/doc/html/boost/function/sig.html +++ b/doc/html/boost/function/sig.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      @@ -50,7 +50,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/functionN.html b/doc/html/boost/functionN.html index 3e6cca160f..207c6bb5e8 100644 --- a/doc/html/boost/functionN.html +++ b/doc/html/boost/functionN.html @@ -60,81 +60,81 @@ }; // construct/copy/destruct - functionN(); - functionN(const functionN&); - functionN(functionN&&); - template<typename F> functionN(F); - template<typename F, typename Allocator> functionN(F, Allocator); - functionN& operator=(const functionN&); - functionN& operator=(functionN&&); - ~functionN(); + functionN(); + functionN(const functionN&); + functionN(functionN&&); + template<typename F> functionN(F); + template<typename F, typename Allocator> functionN(F, Allocator); + functionN& operator=(const functionN&); + functionN& operator=(functionN&&); + ~functionN(); - // modifiers - void swap(const functionN&); - void clear(); + // modifiers + void swap(const functionN&); + void clear(); - // capacity - bool empty() const; - operator safe_bool() const; - bool operator!() const; + // capacity + bool empty() const; + operator safe_bool() const; + bool operator!() const; - // target access - template<typename Functor> Functor* target(); - template<typename Functor> const Functor* target() const; - template<typename Functor> bool contains(const Functor&) const; - const std::type_info& target_type() const; + // target access + template<typename Functor> Functor* target(); + template<typename Functor> const Functor* target() const; + template<typename Functor> bool contains(const Functor&) const; + const std::type_info& target_type() const; - // invocation - result_type operator()(arg1_type, arg2_type, ..., argN_type) const; + // invocation + result_type operator()(arg1_type, arg2_type, ..., argN_type) const; }; -// specialized algorithms +// specialized algorithms template<typename T1, typename T2, ..., typename TN> - void swap(functionN<T1, T2, ..., TN>&, functionN<T1, T2, ..., TN>&); + void swap(functionN<T1, T2, ..., TN>&, functionN<T1, T2, ..., TN>&); -// comparison operators +// comparison operators template<typename T1, typename T2, ..., typename TN, typename Functor> - bool operator==(const functionN<T1, T2, ..., TN>&, Functor); + bool operator==(const functionN<T1, T2, ..., TN>&, Functor); template<typename T1, typename T2, ..., typename TN, typename Functor> - bool operator==(Functor, const functionN<T1, T2, ..., TN>&); + bool operator==(Functor, const functionN<T1, T2, ..., TN>&); template<typename T1, typename T2, ..., typename TN, typename Functor> - bool operator==(const functionN<T1, T2, ..., TN>&, + bool operator==(const functionN<T1, T2, ..., TN>&, reference_wrapper<Functor>); template<typename T1, typename T2, ..., typename TN, typename Functor> - bool operator==(reference_wrapper<Functor>, + bool operator==(reference_wrapper<Functor>, const functionN<T1, T2, ..., TN>&); template<typename T1, typename T2, ..., typename TN, typename U1, typename U2, ..., typename UN> - void operator==(const functionN<T1, T2, ..., TN>&, + void operator==(const functionN<T1, T2, ..., TN>&, const functionN<U1, U2, ..., UN>&); template<typename T1, typename T2, ..., typename TN, typename Functor> - bool operator!=(const functionN<T1, T2, ..., TN>&, Functor); + bool operator!=(const functionN<T1, T2, ..., TN>&, Functor); template<typename T1, typename T2, ..., typename TN, typename Functor> - bool operator!=(Functor, const functionN<T1, T2, ..., TN>&); + bool operator!=(Functor, const functionN<T1, T2, ..., TN>&); template<typename T1, typename T2, ..., typename TN, typename Functor> - bool operator!=(const functionN<T1, T2, ..., TN>&, + bool operator!=(const functionN<T1, T2, ..., TN>&, reference_wrapper<Functor>); template<typename T1, typename T2, ..., typename TN, typename Functor> - bool operator!=(reference_wrapper<Functor>, + bool operator!=(reference_wrapper<Functor>, const functionN<T1, T2, ..., TN>&); template<typename T1, typename T2, ..., typename TN, typename U1, typename U2, ..., typename UN> - void operator!=(const functionN<T1, T2, ..., TN>&, + void operator!=(const functionN<T1, T2, ..., TN>&, const functionN<U1, U2, ..., UN>&);
      -

      Description

      +

      Description

      Class template functionN is actually a family of related classes function0, function1, etc., up to some implementation-defined maximum. In this context, N refers to the number of parameters.

      -

      +

      functionN public construct/copy/destruct

      1. -
        functionN();
        +
        functionN();
        @@ -143,7 +143,7 @@ - + @@ -153,7 +153,7 @@

        Postconditions:

        		this->empty()this->empty()

        Throws:

      2. -
        functionN(const functionN& f);
        +
        functionN(const functionN& f);
        @@ -162,7 +162,7 @@ - + @@ -172,7 +172,7 @@

        Postconditions:

        		Contains a copy of the f's target, if it has one, or is empty if f.empty().Contains a copy of the f's target, if it has one, or is empty if f.empty().

        Throws:

      3. -
        functionN(functionN&& f);
        +
        functionN(functionN&& f);
        @@ -195,7 +195,7 @@
      4. -
        template<typename F> functionN(F f);
        +
        template<typename F> functionN(F f);
        @@ -209,13 +209,13 @@ +*this targets a copy of f if f is nonempty, or this->empty() if f is empty.

        Postconditions:

        		 -*this targets a copy of f if f is nonempty, or this->empty() if f is empty.
      5. -
        template<typename F, typename Allocator> functionN(F f, Allocator alloc);
        +
        template<typename F, typename Allocator> functionN(F f, Allocator alloc);
        @@ -229,7 +229,7 @@ +*this targets a copy of f if f is nonempty, or this->empty() if f is empty. @@ -239,7 +239,7 @@

        Postconditions:

        		 -*this targets a copy of f if f is nonempty, or this->empty() if f is empty.

        Effects:

      6. -
        functionN& operator=(const functionN& f);
        +
        functionN& operator=(const functionN& f);
        @@ -247,12 +247,12 @@ - +

        Postconditions:

        		If copy construction does not throw, *this targets a copy of f's target, if it has one, or is empty if f.empty(). If copy construction does throw, this->empty().If copy construction does not throw, *this targets a copy of f's target, if it has one, or is empty if f.empty(). If copy construction does throw, this->empty().
      7. -
        functionN& operator=(functionN&& f);
        +
        functionN& operator=(functionN&& f);
        @@ -275,7 +275,7 @@
      8. -
        ~functionN();
        +
        ~functionN();
        @@ -283,18 +283,18 @@ - +

        Effects:

        		If !this->empty(), destroys the target of this.If !this->empty(), destroys the target of this.
      -

      -functionN modifiers

      +

      +functionN modifiers

      1. -
        void swap(const functionN& f);
        +
        void swap(const functionN& f);
        @@ -307,7 +307,7 @@
      2. -
        void clear();
        +
        void clear();
        @@ -315,18 +315,18 @@ - +

        Postconditions:

        		this->empty()this->empty()
      -

      -functionN capacity

      +

      +functionN capacity

      1. -
        bool empty() const;
        +
        bool empty() const;
        @@ -346,7 +346,7 @@
      2. -
        operator safe_bool() const;
        +
        operator safe_bool() const;
        @@ -355,7 +355,7 @@ - + @@ -365,7 +365,7 @@

        Returns:

        		A safe_bool that evaluates false in a boolean context when this->empty(), and true otherwise.A safe_bool that evaluates false in a boolean context when this->empty(), and true otherwise.

        Throws:

      3. -
        bool operator!() const;
        +
        bool operator!() const;
        @@ -374,7 +374,7 @@ - + @@ -386,12 +386,12 @@
        -

        -functionN target access

        +

        +functionN target access

        1. -
          template<typename Functor> Functor* target();
-template<typename Functor> const Functor* target() const;
          +
          template<typename Functor> Functor* target();
+template<typename Functor> const Functor* target() const;

        Returns:

        		this->empty()this->empty()

        Throws:
        @@ -413,7 +413,7 @@
      4. -
        template<typename Functor> bool contains(const Functor& f) const;
        +
        template<typename Functor> bool contains(const Functor& f) const;
        @@ -422,13 +422,13 @@

        Returns:

        		 -true if this->target<Functor>() is non-NULL and function_equal(*(this->target<Functor>()), f) +true if this->target<Functor>() is non-NULL and function_equal(*(this->target<Functor>()), f)
      5. -
        const std::type_info& target_type() const;
        +
        const std::type_info& target_type() const;
        @@ -438,7 +438,7 @@ +typeid of the target function object, or typeid(void) if this->empty(). @@ -450,10 +450,10 @@
        -

        -functionN invocation

        +

        +functionN invocation

        1. -
          result_type operator()(arg1_type a1, arg2_type a2, ..., argN_type aN) const;
          +
          result_type operator()(arg1_type a1, arg2_type a2, ..., argN_type aN) const;

        Returns:

        		 -typeid of the target function object, or typeid(void) if this->empty().

        Throws:
        @@ -472,18 +472,18 @@ +bad_function_call if this->empty(). Otherwise, may through any exception thrown by the target function f.

        Throws:

        		 -bad_function_call if this->empty(). Otherwise, may through any exception thrown by the target function f.
      -

      -functionN specialized algorithms

      +

      +functionN specialized algorithms

      1. template<typename T1, typename T2, ..., typename TN> 
-  void swap(functionN<T1, T2, ..., TN>& f1, functionN<T1, T2, ..., TN>& f2);
        + void swap(functionN<T1, T2, ..., TN>& f1, functionN<T1, T2, ..., TN>& f2);
        @@ -491,30 +491,30 @@ - +

        Effects:

        		f1.swap(f2)f1.swap(f2)
      -

      -functionN comparison operators

      +

      +functionN comparison operators

      1. -

        +

        template<typename T1, typename T2, ..., typename TN, typename Functor> 
-  bool operator==(const functionN<T1, T2, ..., TN>& f, Functor g);
+  bool operator==(const functionN<T1, T2, ..., TN>& f, Functor g);
 template<typename T1, typename T2, ..., typename TN, typename Functor> 
-  bool operator==(Functor g, const functionN<T1, T2, ..., TN>& f);
+  bool operator==(Functor g, const functionN<T1, T2, ..., TN>& f);
 template<typename T1, typename T2, ..., typename TN, typename Functor> 
-  bool operator==(const functionN<T1, T2, ..., TN>& f, 
+  bool operator==(const functionN<T1, T2, ..., TN>& f, 
                   reference_wrapper<Functor> g);
 template<typename T1, typename T2, ..., typename TN, typename Functor> 
-  bool operator==(reference_wrapper<Functor> g, 
+  bool operator==(reference_wrapper<Functor> g, 
                   const functionN<T1, T2, ..., TN>& f);
 template<typename T1, typename T2, ..., typename TN, typename U1, typename U2, 
          ..., typename UN> 
-  void operator==(const functionN<T1, T2, ..., TN>& f1, 
+  void operator==(const functionN<T1, T2, ..., TN>& f1, 
                   const functionN<U1, U2, ..., UN>& f2);
        @@ -560,20 +560,20 @@
      2. -

        +

        template<typename T1, typename T2, ..., typename TN, typename Functor> 
-  bool operator!=(const functionN<T1, T2, ..., TN>& f, Functor g);
+  bool operator!=(const functionN<T1, T2, ..., TN>& f, Functor g);
 template<typename T1, typename T2, ..., typename TN, typename Functor> 
-  bool operator!=(Functor g, const functionN<T1, T2, ..., TN>& f);
+  bool operator!=(Functor g, const functionN<T1, T2, ..., TN>& f);
 template<typename T1, typename T2, ..., typename TN, typename Functor> 
-  bool operator!=(const functionN<T1, T2, ..., TN>& f, 
+  bool operator!=(const functionN<T1, T2, ..., TN>& f, 
                   reference_wrapper<Functor> g);
 template<typename T1, typename T2, ..., typename TN, typename Functor> 
-  bool operator!=(reference_wrapper<Functor> g, 
+  bool operator!=(reference_wrapper<Functor> g, 
                   const functionN<T1, T2, ..., TN>& f);
 template<typename T1, typename T2, ..., typename TN, typename U1, typename U2, 
          ..., typename UN> 
-  void operator!=(const functionN<T1, T2, ..., TN>& f1, 
+  void operator!=(const functionN<T1, T2, ..., TN>& f1, 
                   const functionN<U1, U2, ..., UN>& f2);
        diff --git a/doc/html/boost/functionN/sig.html b/doc/html/boost/functionN/sig.html index 6b92cfde6b..4a054747e2 100644 --- a/doc/html/boost/functionN/sig.html +++ b/doc/html/boost/functionN/sig.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        @@ -50,7 +50,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        diff --git a/doc/html/boost/function_base.html b/doc/html/boost/function_base.html index 6a1035688d..b77726cfb2 100644 --- a/doc/html/boost/function_base.html +++ b/doc/html/boost/function_base.html @@ -38,22 +38,22 @@ class function_base { public: - // capacity - bool empty() const; + // capacity + bool empty() const; - // target access - template<typename Functor> Functor* target(); - template<typename Functor> const Functor* target() const; - template<typename Functor> bool contains(const Functor&) const; - const std::type_info& target_type() const; + // target access + template<typename Functor> Functor* target(); + template<typename Functor> const Functor* target() const; + template<typename Functor> bool contains(const Functor&) const; + const std::type_info& target_type() const; };
        -

        Description

        +

        Description

        -

        -function_base capacity

        +

        +function_base capacity

        1. -
          bool empty() const;
          +
          bool empty() const;
          @@ -74,12 +74,12 @@
          -

          -function_base target access

          +

          +function_base target access

          1. -
            template<typename Functor> Functor* target();
-template<typename Functor> const Functor* target() const;
            +
            template<typename Functor> Functor* target();
+template<typename Functor> const Functor* target() const;
          @@ -101,7 +101,7 @@
        2. -
          template<typename Functor> bool contains(const Functor& f) const;
          +
          template<typename Functor> bool contains(const Functor& f) const;
          @@ -110,13 +110,13 @@

          Returns:

          		 -true if this->target<Functor>() is non-NULL and function_equal(*(this->target<Functor>()), f) +true if this->target<Functor>() is non-NULL and function_equal(*(this->target<Functor>()), f)
        3. -
          const std::type_info& target_type() const;
          +
          const std::type_info& target_type() const;
          @@ -126,7 +126,7 @@ +typeid of the target function object, or typeid(void) if this->empty(). diff --git a/doc/html/boost/function_equal.html b/doc/html/boost/function_equal.html index 89cc55b7e3..41efeccf36 100644 --- a/doc/html/boost/function_equal.html +++ b/doc/html/boost/function_equal.html @@ -35,7 +35,7 @@ template<typename F,typename G>boolfunction_equal(constF& f,constG& g);
          -

          Description

          +

          Description

          Returns:

          		 -typeid of the target function object, or typeid(void) if this->empty().

          Throws:
          diff --git a/doc/html/boost/get_idm45507165650576.html b/doc/html/boost/get_idm45507165650576.html new file mode 100644 index 0000000000..d53b596ccd --- /dev/null +++ b/doc/html/boost/get_idm45507165650576.html @@ -0,0 +1,70 @@ + + + + +Function get + + + + + + + + +
          + + + + + + +
          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
          +
          +
          +PrevUpHomeNext +
          +
          +
          +
          +

          Function get

          +

          boost::get — Retrieves a value of a specified type from a given + variant.

          +
          +

          Synopsis

          +
          // In header: <boost/variant/get.hpp>
+
+
+template<typename U, typename T1, typename T2, ..., typename TN> 
+  U * get(variant<T1, T2, ..., TN> * operand);
+template<typename U, typename T1, typename T2, ..., typename TN> 
+  const U * get(const variant<T1, T2, ..., TN> * operand);
+template<typename U, typename T1, typename T2, ..., typename TN> 
+  U & get(variant<T1, T2, ..., TN> & operand);
+template<typename U, typename T1, typename T2, ..., typename TN> 
+  const U & get(const variant<T1, T2, ..., TN> & operand);
          +
          +

          Description

          +

          Evaluates to strict_get if BOOST_VARIANT_USE_RELAXED_GET_BY_DEFAULT + is not defined. If BOOST_VARIANT_USE_RELAXED_GET_BY_DEFAULT + is defined then evaluates to relaxed_get.

          +

          Recomendation: Use + get in new code without defining + BOOST_VARIANT_USE_RELAXED_GET_BY_DEFAULT. In that way get + provides more compile time checks and it's behavior is closer to std::get + from C++ Standard Library.

          +
          +
          + + + +
          Copyright © 2002, 2003 Eric Friedman, Itay Maman

          Distributed under the Boost Software License, Version 1.0. + (See accompanying file LICENSE_1_0.txt or copy at + http://www.boost.org/LICENSE_1_0.txt) +

          +
          +
          +
          +PrevUpHomeNext +
          + + diff --git a/doc/html/boost/get_idp351465872.html b/doc/html/boost/get_idp351465872.html deleted file mode 100644 index 8fefe53988..0000000000 --- a/doc/html/boost/get_idp351465872.html +++ /dev/null @@ -1,70 +0,0 @@ - - - - -Function get - - - - - - - - - - - - - - - -
          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
          -
          -
          -PrevUpHomeNext -
          -
          -
          -
          -

          Function get

          -

          boost::get — Retrieves a value of a specified type from a given - variant.

          -
          -

          Synopsis

          -
          // In header: <boost/variant/get.hpp>
-
-
-template<typename U, typename T1, typename T2, ..., typename TN> 
-  U * get(variant<T1, T2, ..., TN> * operand);
-template<typename U, typename T1, typename T2, ..., typename TN> 
-  const U * get(const variant<T1, T2, ..., TN> * operand);
-template<typename U, typename T1, typename T2, ..., typename TN> 
-  U & get(variant<T1, T2, ..., TN> & operand);
-template<typename U, typename T1, typename T2, ..., typename TN> 
-  const U & get(const variant<T1, T2, ..., TN> & operand);
          -
          -

          Description

          -

          Evaluates to strict_get if BOOST_VARIANT_USE_RELAXED_GET_BY_DEFAULT - is not defined. If BOOST_VARIANT_USE_RELAXED_GET_BY_DEFAULT - is defined then evaluates to relaxed_get.

          -

          Recomendation: Use - get in new code without defining - BOOST_VARIANT_USE_RELAXED_GET_BY_DEFAULT. In that way get - provides more compile time checks and it's behavior is closer to std::get - from C++ Standard Library.

          -
          -
          - - - -
          Copyright © 2002, 2003 Eric Friedman, Itay Maman

          Distributed under the Boost Software License, Version 1.0. - (See accompanying file LICENSE_1_0.txt or copy at - http://www.boost.org/LICENSE_1_0.txt) -

          -
          -
          -
          -PrevUpHomeNext -
          - - diff --git a/doc/html/boost/graph_tr_idm45507045405248.html b/doc/html/boost/graph_tr_idm45507045405248.html new file mode 100644 index 0000000000..f633b4a443 --- /dev/null +++ b/doc/html/boost/graph_tr_idm45507045405248.html @@ -0,0 +1,79 @@ + + + + +Struct graph_traits<mpi::graph_communicator> + + + + + + + + + + + + + + + +
          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
          +
          +
          +PrevUpHomeNext +
          +
          +
          +
          +

          Struct graph_traits<mpi::graph_communicator>

          +

          boost::graph_traits<mpi::graph_communicator> — Traits structure that allows a communicator with graph topology to be view as a graph by the Boost Graph Library.

          +
          +

          Synopsis

          +
          // In header: <boost/mpi/graph_communicator.hpp>
+
+
+struct graph_traits<mpi::graph_communicator> {
+  // types
+  typedef int                        vertex_descriptor;     
+  typedef std::pair< int, int >      edge_descriptor;       
+  typedef directed_tag               directed_category;     
+  typedef disallow_parallel_edge_tag edge_parallel_category;
+  typedef unspecified                out_edge_iterator;     
+  typedef int                        degree_size_type;      
+  typedef unspecified                adjacency_iterator;    
+  typedef counting_iterator< int >   vertex_iterator;       
+  typedef int                        vertices_size_type;    
+  typedef unspecified                edge_iterator;         
+  typedef int                        edges_size_type;       
+
+  // public static functions
+  static vertex_descriptor null_vertex();
+};
          +
          +

          Description

          +

          The specialization of graph_traits for an MPI communicator allows a communicator with graph topology to be viewed as a graph. An MPI communicator with graph topology meets the requirements of the Graph, Incidence Graph, Adjacency Graph, Vertex List Graph, and Edge List Graph concepts from the Boost Graph Library.

          +
          +

          +graph_traits public static functions

          +
          1. +
            static vertex_descriptor null_vertex();
            Returns a vertex descriptor that can never refer to any valid vertex.
          +
          +
          +
          + + + +
          Copyright © 2005-2007 Douglas Gregor, + Matthias Troyer, Trustees of Indiana University

          + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at + http://www.boost.org/LICENSE_1_0.txt ) +

          +
          +
          +
          +PrevUpHomeNext +
          + + diff --git a/doc/html/boost/graph_traits__idp106738368.html b/doc/html/boost/graph_traits__idp106738368.html deleted file mode 100644 index f77519fd6e..0000000000 --- a/doc/html/boost/graph_traits__idp106738368.html +++ /dev/null @@ -1,79 +0,0 @@ - - - - -Struct graph_traits<mpi::graph_communicator> - - - - - - - - - - - - - - - -
          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
          -
          -
          -PrevUpHomeNext -
          -
          -
          -
          -

          Struct graph_traits<mpi::graph_communicator>

          -

          boost::graph_traits<mpi::graph_communicator> — Traits structure that allows a communicator with graph topology to be view as a graph by the Boost Graph Library.

          -
          -

          Synopsis

          -
          // In header: <boost/mpi/graph_communicator.hpp>
-
-
-struct graph_traits<mpi::graph_communicator> {
-  // types
-  typedef int                        vertex_descriptor;     
-  typedef std::pair< int, int >      edge_descriptor;       
-  typedef directed_tag               directed_category;     
-  typedef disallow_parallel_edge_tag edge_parallel_category;
-  typedef unspecified                out_edge_iterator;     
-  typedef int                        degree_size_type;      
-  typedef unspecified                adjacency_iterator;    
-  typedef counting_iterator< int >   vertex_iterator;       
-  typedef int                        vertices_size_type;    
-  typedef unspecified                edge_iterator;         
-  typedef int                        edges_size_type;       
-
-  // public static functions
-  static vertex_descriptor null_vertex();
-};
          -
          -

          Description

          -

          The specialization of graph_traits for an MPI communicator allows a communicator with graph topology to be viewed as a graph. An MPI communicator with graph topology meets the requirements of the Graph, Incidence Graph, Adjacency Graph, Vertex List Graph, and Edge List Graph concepts from the Boost Graph Library.

          -
          -

          -graph_traits public static functions

          -
          1. -
            static vertex_descriptor null_vertex();
            Returns a vertex descriptor that can never refer to any valid vertex.
          -
          -
          -
          - - - -
          Copyright © 2005-2007 Douglas Gregor, - Matthias Troyer, Trustees of Indiana University

          - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at - http://www.boost.org/LICENSE_1_0.txt ) -

          -
          -
          -
          -PrevUpHomeNext -
          - - diff --git a/doc/html/boost/gregorian/bad_day_of_month.html b/doc/html/boost/gregorian/bad_day_of_month.html index 0966daba0d..7bec067578 100644 --- a/doc/html/boost/gregorian/bad_day_of_month.html +++ b/doc/html/boost/gregorian/bad_day_of_month.html @@ -35,20 +35,20 @@ struct bad_day_of_month : public out_of_range { // construct/copy/destruct - bad_day_of_month(); - bad_day_of_month(const std::string &); + bad_day_of_month(); + bad_day_of_month(const std::string &); };
          -

          Description

          +

          Description

          -

          +

          bad_day_of_month public construct/copy/destruct

            -
          1. bad_day_of_month();
            2. +
          2. bad_day_of_month();
          3. -
            bad_day_of_month(const std::string & s);
            Allow other classes to throw with unique string for bad day like Feb 29.
            4. +
            bad_day_of_month(const std::string & s);
            Allow other classes to throw with unique string for bad day like Feb 29.
          diff --git a/doc/html/boost/gregorian/bad_day_of_year.html b/doc/html/boost/gregorian/bad_day_of_year.html index f8d62b2971..47e0067cac 100644 --- a/doc/html/boost/gregorian/bad_day_of_year.html +++ b/doc/html/boost/gregorian/bad_day_of_year.html @@ -35,16 +35,16 @@ struct bad_day_of_year : public out_of_range { // construct/copy/destruct - bad_day_of_year(); + bad_day_of_year(); };
        -

        Description

        +

        Description

        -

        +

        bad_day_of_year public construct/copy/destruct

        -
        1. bad_day_of_year();
        +
        1. bad_day_of_year();
        diff --git a/doc/html/boost/gregorian/bad_month.html b/doc/html/boost/gregorian/bad_month.html index 5964ae4b0d..ee99453653 100644 --- a/doc/html/boost/gregorian/bad_month.html +++ b/doc/html/boost/gregorian/bad_month.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        @@ -35,16 +35,16 @@ struct bad_month : public out_of_range { // construct/copy/destruct - bad_month(); + bad_month(); };
        -

        Description

        +

        Description

        -

        +

        bad_month public construct/copy/destruct

        -
        1. bad_month();
        +
        1. bad_month();
        @@ -56,7 +56,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        diff --git a/doc/html/boost/gregorian/bad_weekday.html b/doc/html/boost/gregorian/bad_weekday.html index 03c50673f3..308c8d4c0d 100644 --- a/doc/html/boost/gregorian/bad_weekday.html +++ b/doc/html/boost/gregorian/bad_weekday.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        @@ -35,16 +35,16 @@ struct bad_weekday : public out_of_range { // construct/copy/destruct - bad_weekday(); + bad_weekday(); };
        -

        Description

        +

        Description

        -

        +

        bad_weekday public construct/copy/destruct

        -
        1. bad_weekday();
        +
        1. bad_weekday();
        @@ -56,7 +56,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        diff --git a/doc/html/boost/gregorian/bad_year.html b/doc/html/boost/gregorian/bad_year.html index f5e2448c80..368bd95798 100644 --- a/doc/html/boost/gregorian/bad_year.html +++ b/doc/html/boost/gregorian/bad_year.html @@ -35,16 +35,16 @@ struct bad_year : public out_of_range { // construct/copy/destruct - bad_year(); + bad_year(); };
      -

      Description

      +

      Description

      -

      +

      bad_year public construct/copy/destruct

      -
      1. bad_year();
      +
      1. bad_year();
      diff --git a/doc/html/boost/gregorian/date.html b/doc/html/boost/gregorian/date.html index 63103349b4..f3a49e9bfa 100644 --- a/doc/html/boost/gregorian/date.html +++ b/doc/html/boost/gregorian/date.html @@ -48,60 +48,60 @@ typedef date_duration duration_type; // construct/copy/destruct - date(); - date(year_type, month_type, day_type); - explicit date(const ymd_type &); - explicit date(const date_int_type &); - explicit date(date_rep_type); - explicit date(special_values); + date(); + date(year_type, month_type, day_type); + explicit date(const ymd_type &); + explicit date(const date_int_type &); + explicit date(date_rep_type); + explicit date(special_values); - // public member functions - date_int_type julian_day() const; - day_of_year_type day_of_year() const; - date_int_type modjulian_day() const; - int week_number() const; - date_int_type day_number() const; - date end_of_month() const; + // public member functions + date_int_type julian_day() const; + day_of_year_type day_of_year() const; + date_int_type modjulian_day() const; + int week_number() const; + date_int_type day_number() const; + date end_of_month() const; };
      -

      Description

      +

      Description

      This class is the primary interface for programming with greogorian dates. The is a lightweight type that can be freely passed by value. All comparison operators are supported.

      -

      +

      date public construct/copy/destruct

      1. -
        date();
        Default constructor constructs with not_a_date_time.
        2. +
        date();
        Default constructor constructs with not_a_date_time.
      2. -
        date(year_type y, month_type m, day_type d);
        Main constructor with year, month, day.
        3. +
        date(year_type y, month_type m, day_type d);
        Main constructor with year, month, day.
      3. -
        explicit date(const ymd_type & ymd);
        Constructor from a ymd_type structure.
        4. +
        explicit date(const ymd_type & ymd);
        Constructor from a ymd_type structure.
      4. -
        explicit date(const date_int_type & rhs);
        Needed copy constructor.
        5. +
        explicit date(const date_int_type & rhs);
        Needed copy constructor.
      5. -
        explicit date(date_rep_type rhs);
        Needed copy constructor.
        6. +
        explicit date(date_rep_type rhs);
        Needed copy constructor.
      6. -
        explicit date(special_values sv);
        Constructor for infinities, not a date, max and min date.
        7. +
        explicit date(special_values sv);
        Constructor for infinities, not a date, max and min date.
      -

      -date public member functions

      +

      +date public member functions

      1. -
        date_int_type julian_day() const;
        Return the Julian Day number for the date.
        2. +
        date_int_type julian_day() const;
        Return the Julian Day number for the date.
      2. -
        day_of_year_type day_of_year() const;
        Return the day of year 1..365 or 1..366 (for leap year)
        3. +
        day_of_year_type day_of_year() const;
        Return the day of year 1..365 or 1..366 (for leap year)
      3. -
        date_int_type modjulian_day() const;
        Return the Modified Julian Day number for the date.
        4. +
        date_int_type modjulian_day() const;
        Return the Modified Julian Day number for the date.
      4. -
        int week_number() const;
        Return the iso 8601 week number 1..53.
        5. +
        int week_number() const;
        Return the iso 8601 week number 1..53.
      5. -
        date_int_type day_number() const;
        Return the day number from the calendar.
        6. +
        date_int_type day_number() const;
        Return the day number from the calendar.
      6. -
        date end_of_month() const;
        Return the last day of the current month.
        7. +
        date end_of_month() const;
        Return the last day of the current month.
      diff --git a/doc/html/boost/gregorian/date_duration.html b/doc/html/boost/gregorian/date_duration.html index cfadaa39f5..381187ca1b 100644 --- a/doc/html/boost/gregorian/date_duration.html +++ b/doc/html/boost/gregorian/date_duration.html @@ -41,69 +41,69 @@ typedef base_type::duration_rep duration_rep; // construct/copy/destruct - explicit date_duration(duration_rep = 0); - date_duration(date_time::special_values); - date_duration(const date_duration &); - date_duration(const base_type &); + explicit date_duration(duration_rep = 0); + date_duration(date_time::special_values); + date_duration(const date_duration &); + date_duration(const base_type &); - // public member functions - bool operator==(const date_duration &) const; - bool operator!=(const date_duration &) const; - bool operator<(const date_duration &) const; - bool operator>(const date_duration &) const; - bool operator<=(const date_duration &) const; - bool operator>=(const date_duration &) const; - date_duration & operator-=(const date_duration &); - date_duration & operator+=(const date_duration &); - date_duration operator-() const; - date_duration & operator/=(int); + // public member functions + bool operator==(const date_duration &) const; + bool operator!=(const date_duration &) const; + bool operator<(const date_duration &) const; + bool operator>(const date_duration &) const; + bool operator<=(const date_duration &) const; + bool operator>=(const date_duration &) const; + date_duration & operator-=(const date_duration &); + date_duration & operator+=(const date_duration &); + date_duration operator-() const; + date_duration & operator/=(int); - // public static functions - static date_duration unit(); + // public static functions + static date_duration unit(); };
      -

      Description

      +

      Description

      -

      +

      date_duration public construct/copy/destruct

      1. -
        explicit date_duration(duration_rep day_count = 0);
        Construct from a day count.
        2. +
        explicit date_duration(duration_rep day_count = 0);
        Construct from a day count.
      2. -
        date_duration(date_time::special_values sv);
        construct from special_values
        3. +
        date_duration(date_time::special_values sv);
        construct from special_values
      3. -
        date_duration(const date_duration & other);
        Copy constructor.
        4. +
        date_duration(const date_duration & other);
        Copy constructor.
      4. -
        date_duration(const base_type & other);
        Construct from another date_duration.
        5. +
        date_duration(const base_type & other);
        Construct from another date_duration.
      -

      -date_duration public member functions

      +

      +date_duration public member functions

        -
      1. bool operator==(const date_duration & rhs) const;
        2. -
      2. bool operator!=(const date_duration & rhs) const;
        3. -
      3. bool operator<(const date_duration & rhs) const;
        4. -
      4. bool operator>(const date_duration & rhs) const;
        5. -
      5. bool operator<=(const date_duration & rhs) const;
        6. -
      6. bool operator>=(const date_duration & rhs) const;
        7. +
      7. bool operator==(const date_duration & rhs) const;
        8. +
      8. bool operator!=(const date_duration & rhs) const;
        9. +
      9. bool operator<(const date_duration & rhs) const;
        10. +
      10. bool operator>(const date_duration & rhs) const;
        11. +
      11. bool operator<=(const date_duration & rhs) const;
        12. +
      12. bool operator>=(const date_duration & rhs) const;
      13. -
        date_duration & operator-=(const date_duration & rhs);
        Subtract another duration <ndash></ndash> result is signed.
        14. +
        date_duration & operator-=(const date_duration & rhs);
        Subtract another duration <ndash></ndash> result is signed.
      14. -
        date_duration & operator+=(const date_duration & rhs);
        Add a duration <ndash></ndash> result is signed.
        15. +
        date_duration & operator+=(const date_duration & rhs);
        Add a duration <ndash></ndash> result is signed.
      15. -
        date_duration operator-() const;
        unary- Allows for dd = -date_duration(2); -> dd == -2
        16. +
        date_duration operator-() const;
        unary- Allows for dd = -date_duration(2); -> dd == -2
      16. -
        date_duration & operator/=(int divisor);
        Division operations on a duration with an integer.
        17. +
        date_duration & operator/=(int divisor);
        Division operations on a duration with an integer.
      -

      -date_duration public static functions

      +

      +date_duration public static functions

      1. -
        static date_duration unit();
        Returns the smallest duration <ndash></ndash> used by to calculate 'end'.
      +
      static date_duration unit();
      Returns the smallest duration <ndash></ndash> used by to calculate 'end'.
    diff --git a/doc/html/boost/gregorian/greg_day.html b/doc/html/boost/gregorian/greg_day.html index 3f3a759421..4fbf0724fd 100644 --- a/doc/html/boost/gregorian/greg_day.html +++ b/doc/html/boost/gregorian/greg_day.html @@ -36,28 +36,28 @@ class greg_day : public greg_day_rep { public: // construct/copy/destruct - greg_day(unsigned short); + greg_day(unsigned short); - // public member functions - unsigned short as_number() const; - operator unsigned short() const; + // public member functions + unsigned short as_number() const; + operator unsigned short() const; };
    -

    Description

    +

    Description

    This small class allows for simple conversion an integer value into a day of the month for a standard gregorian calendar. The type is automatically range checked so values outside of the range 1-31 will cause a bad_day_of_month exception

    -

    +

    greg_day public construct/copy/destruct

    -
    1. greg_day(unsigned short day_of_month);
    +
    1. greg_day(unsigned short day_of_month);
    -

    -greg_day public member functions

    +

    +greg_day public member functions

      -
    1. unsigned short as_number() const;
      2. -
    2. operator unsigned short() const;
      3. +
    3. unsigned short as_number() const;
      4. +
    4. operator unsigned short() const;
    diff --git a/doc/html/boost/gregorian/greg_facet_config.html b/doc/html/boost/gregorian/greg_facet_config.html index 605b2547f0..d158462213 100644 --- a/doc/html/boost/gregorian/greg_facet_config.html +++ b/doc/html/boost/gregorian/greg_facet_config.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -49,7 +49,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/gregorian/greg_month.html b/doc/html/boost/gregorian/greg_month.html index d55449aeba..c47ba02fea 100644 --- a/doc/html/boost/gregorian/greg_month.html +++ b/doc/html/boost/gregorian/greg_month.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -41,63 +41,63 @@ typedef boost::shared_ptr< month_map_type > month_map_ptr_type; // construct/copy/destruct - greg_month(month_enum); - greg_month(unsigned short); + greg_month(month_enum); + greg_month(unsigned short); - // public member functions - operator unsigned short() const; - unsigned short as_number() const; - month_enum as_enum() const; - const char * as_short_string() const; - const char * as_long_string() const; - const wchar_t * as_short_wstring() const; - const wchar_t * as_long_wstring() const; - const char * as_short_string(char) const; - const char * as_long_string(char) const; - const wchar_t * as_short_string(wchar_t) const; - const wchar_t * as_long_string(wchar_t) const; + // public member functions + operator unsigned short() const; + unsigned short as_number() const; + month_enum as_enum() const; + const char * as_short_string() const; + const char * as_long_string() const; + const wchar_t * as_short_wstring() const; + const wchar_t * as_long_wstring() const; + const char * as_short_string(char) const; + const char * as_long_string(char) const; + const wchar_t * as_short_string(wchar_t) const; + const wchar_t * as_long_string(wchar_t) const; - // public static functions - static month_map_ptr_type get_month_map_ptr(); + // public static functions + static month_map_ptr_type get_month_map_ptr(); };
    -

    Description

    +

    Description

    -

    +

    greg_month public construct/copy/destruct

    1. -
      greg_month(month_enum theMonth);
      Construct a month from the months_of_year enumeration.
      2. +
      greg_month(month_enum theMonth);
      Construct a month from the months_of_year enumeration.
    2. -
      greg_month(unsigned short theMonth);
      Construct from a short value.
      3. +
      greg_month(unsigned short theMonth);
      Construct from a short value.
    -

    -greg_month public member functions

    +

    +greg_month public member functions

    1. -
      operator unsigned short() const;
      Convert the value back to a short.
      2. +
      operator unsigned short() const;
      Convert the value back to a short.
    2. -
      unsigned short as_number() const;
      Returns month as number from 1 to 12.
      3. -
    3. month_enum as_enum() const;
      4. -
    4. const char * as_short_string() const;
      5. -
    5. const char * as_long_string() const;
      6. -
    6. const wchar_t * as_short_wstring() const;
      7. -
    7. const wchar_t * as_long_wstring() const;
      8. -
    8. const char * as_short_string(char) const;
      9. -
    9. const char * as_long_string(char) const;
      10. -
    10. const wchar_t * as_short_string(wchar_t) const;
      11. -
    11. const wchar_t * as_long_string(wchar_t) const;
      12. +
      unsigned short as_number() const;
      Returns month as number from 1 to 12. +
    12. month_enum as_enum() const;
      13. +
    13. const char * as_short_string() const;
      14. +
    14. const char * as_long_string() const;
      15. +
    15. const wchar_t * as_short_wstring() const;
      16. +
    16. const wchar_t * as_long_wstring() const;
      17. +
    17. const char * as_short_string(char) const;
      18. +
    18. const char * as_long_string(char) const;
      19. +
    19. const wchar_t * as_short_string(wchar_t) const;
      20. +
    20. const wchar_t * as_long_string(wchar_t) const;
    -

    -greg_month public static functions

    +

    +greg_month public static functions

    1. -
      static month_map_ptr_type get_month_map_ptr();
      Shared pointer to a map of Month strings (Names & Abbrev) & numbers.
    +
    static month_map_ptr_type get_month_map_ptr();
    Shared pointer to a map of Month strings (Names & Abbrev) & numbers.
    @@ -109,7 +109,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/gregorian/greg_weekday.html b/doc/html/boost/gregorian/greg_weekday.html index a435811247..151c50bbec 100644 --- a/doc/html/boost/gregorian/greg_weekday.html +++ b/doc/html/boost/gregorian/greg_weekday.html @@ -39,35 +39,35 @@ typedef boost::date_time::weekdays weekday_enum; // construct/copy/destruct - greg_weekday(unsigned short); + greg_weekday(unsigned short); - // public member functions - unsigned short as_number() const; - const char * as_short_string() const; - const char * as_long_string() const; - const wchar_t * as_short_wstring() const; - const wchar_t * as_long_wstring() const; - weekday_enum as_enum() const; + // public member functions + unsigned short as_number() const; + const char * as_short_string() const; + const char * as_long_string() const; + const wchar_t * as_short_wstring() const; + const wchar_t * as_long_wstring() const; + weekday_enum as_enum() const; };
    -

    Description

    +

    Description

    -

    +

    greg_weekday public construct/copy/destruct

    -
    1. greg_weekday(unsigned short day_of_week_num);
    +
    1. greg_weekday(unsigned short day_of_week_num);
    -

    -greg_weekday public member functions

    +

    +greg_weekday public member functions

      -
    1. unsigned short as_number() const;
      2. -
    2. const char * as_short_string() const;
      3. -
    3. const char * as_long_string() const;
      4. -
    4. const wchar_t * as_short_wstring() const;
      5. -
    5. const wchar_t * as_long_wstring() const;
      6. -
    6. weekday_enum as_enum() const;
      7. +
    7. unsigned short as_number() const;
      8. +
    8. const char * as_short_string() const;
      9. +
    9. const char * as_long_string() const;
      10. +
    10. const wchar_t * as_short_wstring() const;
      11. +
    11. const wchar_t * as_long_wstring() const;
      12. +
    12. weekday_enum as_enum() const;
    diff --git a/doc/html/boost/gregorian/greg_year.html b/doc/html/boost/gregorian/greg_year.html index f4280ad269..02c4ff995a 100644 --- a/doc/html/boost/gregorian/greg_year.html +++ b/doc/html/boost/gregorian/greg_year.html @@ -36,25 +36,25 @@ class greg_year : public greg_year_rep { public: // construct/copy/destruct - greg_year(unsigned short); + greg_year(unsigned short); - // public member functions - operator unsigned short() const; + // public member functions + operator unsigned short() const; };
    -

    Description

    +

    Description

    This small class allows for simple conversion an integer value into a year for the gregorian calendar. This currently only allows a range of 1900 to 10000. Both ends of the range are a bit arbitrary at the moment, but they are the limits of current testing of the library. As such they may be increased in the future.

    -

    +

    greg_year public construct/copy/destruct

    -
    1. greg_year(unsigned short year);
    +
    1. greg_year(unsigned short year);
    -

    -greg_year public member functions

    -
    1. operator unsigned short() const;
    +

    +greg_year public member functions

    +
    1. operator unsigned short() const;
    diff --git a/doc/html/boost/gregorian/operator_idm45507086143184.html b/doc/html/boost/gregorian/operator_idm45507086143184.html new file mode 100644 index 0000000000..8ae3efe317 --- /dev/null +++ b/doc/html/boost/gregorian/operator_idm45507086143184.html @@ -0,0 +1,56 @@ + + + + +Function template operator<< + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator<<

    +

    boost::gregorian::operator<< — operator<< for gregorian::greg_weekday typically streaming: Sun, Mon, Tue, ...

    +
    +

    Synopsis

    +
    // In header: <boost/date_time/gregorian/greg_facet.hpp>
+
+
+template<typename charT, typename traits> 
+  std::basic_ostream< charT, traits > & 
+  operator<<(std::basic_ostream< charT, traits > & os, 
+             const greg_weekday & wd);
    +
    +

    Description

    +

    Uses the date facet to determine output string as well as selection of long or short string. Default if no facet is installed is to output a 3 char english string for the day of the week.

    +
    +
    + + + +
    Copyright © 2001-2005 CrystalClear Software, Inc

    Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/gregorian/operator_idm45507108910016.html b/doc/html/boost/gregorian/operator_idm45507108910016.html new file mode 100644 index 0000000000..eacccb1c51 --- /dev/null +++ b/doc/html/boost/gregorian/operator_idm45507108910016.html @@ -0,0 +1,55 @@ + + + + +Function template operator<< + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator<<

    +

    boost::gregorian::operator<< — operator<< for gregorian::greg_month typically streaming: Jan, Feb, Mar...

    +
    +

    Synopsis

    +
    // In header: <boost/date_time/gregorian/greg_facet.hpp>
+
+
+template<typename charT, typename traits> 
+  std::basic_ostream< charT, traits > & 
+  operator<<(std::basic_ostream< charT, traits > & os, const greg_month & m);
    +
    +

    Description

    +

    Uses the date facet to determine output string as well as selection of long or short strings. Default if no facet is installed is to output a 2 wide numeric value for the month eg: 01 == Jan, 02 == Feb, ... 12 == Dec.

    +
    +
    + + + +
    Copyright © 2001-2005 CrystalClear Software, Inc

    Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/gregorian/operator_idm45507108917616.html b/doc/html/boost/gregorian/operator_idm45507108917616.html new file mode 100644 index 0000000000..0440a96eed --- /dev/null +++ b/doc/html/boost/gregorian/operator_idm45507108917616.html @@ -0,0 +1,63 @@ + + + + +Function template operator<< + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator<<

    +

    boost::gregorian::operator<< — ostream operator for gregorian::date

    +
    +

    Synopsis

    +
    // In header: <boost/date_time/gregorian/greg_facet.hpp>
+
+
+template<typename charT, typename traits> 
+  std::basic_ostream< charT, traits > & 
+  operator<<(std::basic_ostream< charT, traits > & os, const date & d);
    +
    +

    Description

    +

    Uses the date facet to determine various output parameters including:

    +
      +

    • string values for the month (eg: Jan, Feb, Mar) (default: English)

      • +

    • string values for special values (eg: not-a-date-time) (default: English)

      • +

    • selection of long, short strings, or numerical month representation (default: short string)

      • +

    • month day year order (default yyyy-mmm-dd)

      • +
    +

    +

    +
    +
    + + + +
    Copyright © 2001-2005 CrystalClear Software, Inc

    Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/gregorian/operator_idm45507110309184.html b/doc/html/boost/gregorian/operator_idm45507110309184.html new file mode 100644 index 0000000000..94db550670 --- /dev/null +++ b/doc/html/boost/gregorian/operator_idm45507110309184.html @@ -0,0 +1,55 @@ + + + + +Function template operator<< + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator<<

    +

    boost::gregorian::operator<< — operator<< for gregorian::date_period typical output: [2002-Jan-01/2002-Jan-31]

    +
    +

    Synopsis

    +
    // In header: <boost/date_time/gregorian/greg_facet.hpp>
+
+
+template<typename charT, typename traits> 
+  std::basic_ostream< charT, traits > & 
+  operator<<(std::basic_ostream< charT, traits > & os, const date_period & dp);
    +
    +

    Description

    +

    Uses the date facet to determine output string as well as selection of long or short string fr dates. Default if no facet is installed is to output a 3 char english string for the day of the week.

    +
    +
    + + + +
    Copyright © 2001-2005 CrystalClear Software, Inc

    Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/gregorian/operator_idp102151328.html b/doc/html/boost/gregorian/operator_idp102151328.html deleted file mode 100644 index 285334d193..0000000000 --- a/doc/html/boost/gregorian/operator_idp102151328.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Function template operator<< - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator<<

    -

    boost::gregorian::operator<< — operator<< for gregorian::greg_month typically streaming: Jan, Feb, Mar...

    -
    -

    Synopsis

    -
    // In header: <boost/date_time/gregorian/greg_facet.hpp>
-
-
-template<typename charT, typename traits> 
-  std::basic_ostream< charT, traits > & 
-  operator<<(std::basic_ostream< charT, traits > & os, const greg_month & m);
    -
    -

    Description

    -

    Uses the date facet to determine output string as well as selection of long or short strings. Default if no facet is installed is to output a 2 wide numeric value for the month eg: 01 == Jan, 02 == Feb, ... 12 == Dec.

    -
    -
    - - - -
    Copyright © 2001-2005 CrystalClear Software, Inc

    Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/gregorian/operator_idp102157104.html b/doc/html/boost/gregorian/operator_idp102157104.html deleted file mode 100644 index cb82599279..0000000000 --- a/doc/html/boost/gregorian/operator_idp102157104.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Function template operator<< - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator<<

    -

    boost::gregorian::operator<< — operator<< for gregorian::greg_weekday typically streaming: Sun, Mon, Tue, ...

    -
    -

    Synopsis

    -
    // In header: <boost/date_time/gregorian/greg_facet.hpp>
-
-
-template<typename charT, typename traits> 
-  std::basic_ostream< charT, traits > & 
-  operator<<(std::basic_ostream< charT, traits > & os, 
-             const greg_weekday & wd);
    -
    -

    Description

    -

    Uses the date facet to determine output string as well as selection of long or short string. Default if no facet is installed is to output a 3 char english string for the day of the week.

    -
    -
    - - - -
    Copyright © 2001-2005 CrystalClear Software, Inc

    Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/gregorian/operator_idp114794880.html b/doc/html/boost/gregorian/operator_idp114794880.html deleted file mode 100644 index ad1d276a1d..0000000000 --- a/doc/html/boost/gregorian/operator_idp114794880.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Function template operator<< - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator<<

    -

    boost::gregorian::operator<< — operator<< for gregorian::date_period typical output: [2002-Jan-01/2002-Jan-31]

    -
    -

    Synopsis

    -
    // In header: <boost/date_time/gregorian/greg_facet.hpp>
-
-
-template<typename charT, typename traits> 
-  std::basic_ostream< charT, traits > & 
-  operator<<(std::basic_ostream< charT, traits > & os, const date_period & dp);
    -
    -

    Description

    -

    Uses the date facet to determine output string as well as selection of long or short string fr dates. Default if no facet is installed is to output a 3 char english string for the day of the week.

    -
    -
    - - - -
    Copyright © 2001-2005 CrystalClear Software, Inc

    Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/gregorian/operator_idp37883696.html b/doc/html/boost/gregorian/operator_idp37883696.html deleted file mode 100644 index 63921c8c8f..0000000000 --- a/doc/html/boost/gregorian/operator_idp37883696.html +++ /dev/null @@ -1,63 +0,0 @@ - - - - -Function template operator<< - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator<<

    -

    boost::gregorian::operator<< — ostream operator for gregorian::date

    -
    -

    Synopsis

    -
    // In header: <boost/date_time/gregorian/greg_facet.hpp>
-
-
-template<typename charT, typename traits> 
-  std::basic_ostream< charT, traits > & 
-  operator<<(std::basic_ostream< charT, traits > & os, const date & d);
    -
    -

    Description

    -

    Uses the date facet to determine various output parameters including:

    -
      -

    • string values for the month (eg: Jan, Feb, Mar) (default: English)

      • -

    • string values for special values (eg: not-a-date-time) (default: English)

      • -

    • selection of long, short strings, or numerical month representation (default: short string)

      • -

    • month day year order (default yyyy-mmm-dd)

      • -
    -

    -

    -
    -
    - - - -
    Copyright © 2001-2005 CrystalClear Software, Inc

    Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/gregorian/special_value_from_string.html b/doc/html/boost/gregorian/special_value_from_string.html index 67d87332a6..5a04f04c4e 100644 --- a/doc/html/boost/gregorian/special_value_from_string.html +++ b/doc/html/boost/gregorian/special_value_from_string.html @@ -36,7 +36,7 @@ BOOST_DATE_TIME_DECL special_values special_value_from_string(const std::string & s);
    -

    Description

    +

    Description

    Return special_value from string argument. If argument is not one of the special value names (defined in src/gregorian/names.hpp), return 'not_special'

    diff --git a/doc/html/boost/gregorian/weeks_duration.html b/doc/html/boost/gregorian/weeks_duration.html index dd3788ecd0..eac0cf6553 100644 --- a/doc/html/boost/gregorian/weeks_duration.html +++ b/doc/html/boost/gregorian/weeks_duration.html @@ -36,19 +36,19 @@ class weeks_duration : public boost::gregorian::date_duration { public: // construct/copy/destruct - weeks_duration(duration_rep); - weeks_duration(date_time::special_values); + weeks_duration(duration_rep); + weeks_duration(date_time::special_values); };
    -

    Description

    +

    Description

    -

    +

    weeks_duration public construct/copy/destruct

      -
    1. weeks_duration(duration_rep w);
      2. -
    2. weeks_duration(date_time::special_values sv);
      3. +
    3. weeks_duration(duration_rep w);
      4. +
    4. weeks_duration(date_time::special_values sv);
    diff --git a/doc/html/boost/gregorian/year_based_generator.html b/doc/html/boost/gregorian/year_based_generator.html index 2b436eb1f9..d75cb2604c 100644 --- a/doc/html/boost/gregorian/year_based_generator.html +++ b/doc/html/boost/gregorian/year_based_generator.html @@ -35,7 +35,7 @@ typedef date_time::year_based_generator< date > year_based_generator;
    -

    Description

    +

    Description

    A unifying date_generator base type for: partial_date, nth_day_of_the_week_in_month, first_day_of_the_week_in_month, and last_day_of_the_week_in_month

    diff --git a/doc/html/boost/has_move_emul_idp106862080.html b/doc/html/boost/has_move_emul_idp106862080.html deleted file mode 100644 index 487c38d090..0000000000 --- a/doc/html/boost/has_move_emul_idp106862080.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template has_move_emulation_disabled - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template has_move_emulation_disabled

    -

    boost::has_move_emulation_disabled

    -
    -

    Synopsis

    -
    // In header: <boost/move/core.hpp>
-
-template<typename T> 
-struct has_move_emulation_disabled {
-
-  // public data members
-  static const bool value;
-};
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/has_move_emulation_enabled.html b/doc/html/boost/has_move_emulation_enabled.html index 615df4777c..93d8b982ff 100644 --- a/doc/html/boost/has_move_emulation_enabled.html +++ b/doc/html/boost/has_move_emulation_enabled.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -39,7 +39,7 @@ static const bool value; };
    -

    Description

    +

    Description

    This trait yields to a compile-time true boolean if T was marked as BOOST_MOVABLE_BUT_NOT_COPYABLE or BOOST_COPYABLE_AND_MOVABLE and rvalue references are not available on the platform. False otherwise.

    @@ -53,7 +53,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/has_move_idm45506979323984.html b/doc/html/boost/has_move_idm45506979323984.html new file mode 100644 index 0000000000..7084705027 --- /dev/null +++ b/doc/html/boost/has_move_idm45506979323984.html @@ -0,0 +1,55 @@ + + + + +Struct template has_move_emulation_disabled + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct template has_move_emulation_disabled

    +

    boost::has_move_emulation_disabled

    +
    +

    Synopsis

    +
    // In header: <boost/move/core.hpp>
+
+template<typename T> 
+struct has_move_emulation_disabled {
+
+  // public data members
+  static const bool value;
+};
    +
    + + + +
    Copyright © 2008-2014 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/has_nothrow_move.html b/doc/html/boost/has_nothrow_move.html index 61d4677775..a8557209df 100644 --- a/doc/html/boost/has_nothrow_move.html +++ b/doc/html/boost/has_nothrow_move.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -39,7 +39,7 @@ static const bool value; };
    -

    Description

    +

    Description

    By default this traits returns <preformatted>boost::is_nothrow_move_constructible<T>::value && boost::is_nothrow_move_assignable<T>::value </preformatted>. Classes with non-throwing move constructor and assignment can specialize this trait to obtain some performance improvements.

    @@ -53,7 +53,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/has_triv_idm45507104705360.html b/doc/html/boost/has_triv_idm45507104705360.html new file mode 100644 index 0000000000..482a19afb9 --- /dev/null +++ b/doc/html/boost/has_triv_idm45507104705360.html @@ -0,0 +1,57 @@ + + + + +Struct template has_trivial_destructor_after_move + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct template has_trivial_destructor_after_move

    +

    boost::has_trivial_destructor_after_move

    +
    +

    Synopsis

    +
    // In header: <boost/move/traits.hpp>
+
+template<typename T> 
+struct has_trivial_destructor_after_move {
+};
    +
    +

    Description

    +

    If this trait yields to true (has_trivial_destructor_after_move <T>::value == true) means that if T is used as argument of a move construction/assignment, there is no need to call T's destructor. This optimization tipically is used to improve containers' performance.

    +

    By default this trait is true if the type has trivial destructor, every class should specialize this trait if it wants to improve performance when inserted in containers.

    +
    +
    + + + +
    Copyright © 2008-2014 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/has_trivial_d_idp221516000.html b/doc/html/boost/has_trivial_d_idp221516000.html deleted file mode 100644 index a479a3c419..0000000000 --- a/doc/html/boost/has_trivial_d_idp221516000.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Struct template has_trivial_destructor_after_move - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template has_trivial_destructor_after_move

    -

    boost::has_trivial_destructor_after_move

    -
    -

    Synopsis

    -
    // In header: <boost/move/traits.hpp>
-
-template<typename T> 
-struct has_trivial_destructor_after_move {
-};
    -
    -

    Description

    -

    If this trait yields to true (has_trivial_destructor_after_move <T>::value == true) means that if T is used as argument of a move construction/assignment, there is no need to call T's destructor. This optimization tipically is used to improve containers' performance.

    -

    By default this trait is true if the type has trivial destructor, every class should specialize this trait if it wants to improve performance when inserted in containers.

    -
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/hash.html b/doc/html/boost/hash.html index b0a6a5cffc..9cec0934e6 100644 --- a/doc/html/boost/hash.html +++ b/doc/html/boost/hash.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -34,11 +34,11 @@ template<typename T> struct hash : public std::unary_function<T, std::size_t> { - std::size_t operator()(T const&) const; + std::size_t operator()(T const&) const; };
    -

    Description

    -
    std::size_t operator()(T const& val) const;
    +

    Description

    +
    std::size_t operator()(T const& val) const;
    @@ -50,7 +50,7 @@ @@ -59,7 +59,7 @@ @@ -101,7 +101,7 @@

    -
    hash_value(val)
    +
    hash_value(val)

    Notes:

    - The call to hash_value + The call to hash_value is unqualified, so that custom overloads can be found via argument dependent lookup.

    @@ -83,7 +83,7 @@

    Throws:

    Only throws if - hash_value(T) throws. + hash_value(T) throws.

    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/hash_T_idm45507162576784.html b/doc/html/boost/hash_T_idm45507162576784.html new file mode 100644 index 0000000000..6bacdc117a --- /dev/null +++ b/doc/html/boost/hash_T_idm45507162576784.html @@ -0,0 +1,74 @@ + + + + +Struct template hash<T*> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct template hash<T*>

    +

    boost::hash<T*>

    +
    +

    Synopsis

    +
    // In header: <boost/functional/hash.hpp>
+
+template<typename T> 
+struct hash<T*> {
+  std::size_t operator()(T*) const;
+};
    +
    +

    Description

    +
    std::size_t operator()(T* val) const;
    +
    ++++ + + + + + + + + + + +

    Returns:

    Unspecified in TR1, except that equal arguments yield the same result.

    Throws:

    Doesn't throw

    +
    +
    + + + +
    Copyright © 2005-2008 Daniel + James

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/hash_T_idp31087024.html b/doc/html/boost/hash_T_idp31087024.html deleted file mode 100644 index e5705fce5a..0000000000 --- a/doc/html/boost/hash_T_idp31087024.html +++ /dev/null @@ -1,74 +0,0 @@ - - - - -Struct template hash<T*> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template hash<T*>

    -

    boost::hash<T*>

    -
    -

    Synopsis

    -
    // In header: <boost/functional/hash.hpp>
-
-template<typename T> 
-struct hash<T*> {
-  std::size_t operator()(T*) const;
-};
    -
    -

    Description

    -
    std::size_t operator()(T* val) const;
    -
    ---- - - - - - - - - - - -

    Returns:

    Unspecified in TR1, except that equal arguments yield the same result.

    Throws:

    Doesn't throw

    -
    -
    - - - -
    Copyright © 2005-2008 Daniel - James

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/hash_boo_idm45507130924768.html b/doc/html/boost/hash_boo_idm45507130924768.html new file mode 100644 index 0000000000..90cc81fb8b --- /dev/null +++ b/doc/html/boost/hash_boo_idm45507130924768.html @@ -0,0 +1,77 @@ + + + + +Struct hash<bool> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct hash<bool>

    +

    boost::hash<bool>

    +
    +

    Synopsis

    +
    // In header: <boost/functional/hash.hpp>
+
+
+struct hash<bool> {
+  std::size_t operator()(bool) const;
+};
    +
    +

    Description

    +
    std::size_t operator()(bool val) const;
    +
    ++++ + + + + + + + + + + +

    Returns:

    		 +

    Unspecified in TR1, except that equal arguments yield the same result.

    +

    hash_value(val) in Boost.

    +

    Throws:

    Doesn't throw

    +
    +
    + + + +
    Copyright © 2005-2008 Daniel + James

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/hash_bool_idp39904160.html b/doc/html/boost/hash_bool_idp39904160.html deleted file mode 100644 index 9db57b8a91..0000000000 --- a/doc/html/boost/hash_bool_idp39904160.html +++ /dev/null @@ -1,77 +0,0 @@ - - - - -Struct hash<bool> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct hash<bool>

    -

    boost::hash<bool>

    -
    -

    Synopsis

    -
    // In header: <boost/functional/hash.hpp>
-
-
-struct hash<bool> {
-  std::size_t operator()(bool) const;
-};
    -
    -

    Description

    -
    std::size_t operator()(bool val) const;
    -
    ---- - - - - - - - - - - -

    Returns:

    		 -

    Unspecified in TR1, except that equal arguments yield the same result.

    -

    hash_value(val) in Boost.

    -

    Throws:

    Doesn't throw

    -
    -
    - - - -
    Copyright © 2005-2008 Daniel - James

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/hash_cha_idm45507155605728.html b/doc/html/boost/hash_cha_idm45507155605728.html new file mode 100644 index 0000000000..2a67105130 --- /dev/null +++ b/doc/html/boost/hash_cha_idm45507155605728.html @@ -0,0 +1,77 @@ + + + + +Struct hash<char> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct hash<char>

    +

    boost::hash<char>

    +
    +

    Synopsis

    +
    // In header: <boost/functional/hash.hpp>
+
+
+struct hash<char> {
+  std::size_t operator()(char) const;
+};
    +
    +

    Description

    +
    std::size_t operator()(char val) const;
    +
    ++++ + + + + + + + + + + +

    Returns:

    		 +

    Unspecified in TR1, except that equal arguments yield the same result.

    +

    hash_value(val) in Boost.

    +

    Throws:

    Doesn't throw

    +
    +
    + + + +
    Copyright © 2005-2008 Daniel + James

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/hash_char_idp115269568.html b/doc/html/boost/hash_char_idp115269568.html deleted file mode 100644 index 8201862605..0000000000 --- a/doc/html/boost/hash_char_idp115269568.html +++ /dev/null @@ -1,77 +0,0 @@ - - - - -Struct hash<char> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct hash<char>

    -

    boost::hash<char>

    -
    -

    Synopsis

    -
    // In header: <boost/functional/hash.hpp>
-
-
-struct hash<char> {
-  std::size_t operator()(char) const;
-};
    -
    -

    Description

    -
    std::size_t operator()(char val) const;
    -
    ---- - - - - - - - - - - -

    Returns:

    		 -

    Unspecified in TR1, except that equal arguments yield the same result.

    -

    hash_value(val) in Boost.

    -

    Throws:

    Doesn't throw

    -
    -
    - - - -
    Copyright © 2005-2008 Daniel - James

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/hash_dou_idm45507091796448.html b/doc/html/boost/hash_dou_idm45507091796448.html new file mode 100644 index 0000000000..932d086869 --- /dev/null +++ b/doc/html/boost/hash_dou_idm45507091796448.html @@ -0,0 +1,77 @@ + + + + +Struct hash<double> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct hash<double>

    +

    boost::hash<double>

    +
    +

    Synopsis

    +
    // In header: <boost/functional/hash.hpp>
+
+
+struct hash<double> {
+  std::size_t operator()(double) const;
+};
    +
    +

    Description

    +
    std::size_t operator()(double val) const;
    +
    ++++ + + + + + + + + + + +

    Returns:

    		 +

    Unspecified in TR1, except that equal arguments yield the same result.

    +

    hash_value(val) in Boost.

    +

    Throws:

    Doesn't throw

    +
    +
    + + + +
    Copyright © 2005-2008 Daniel + James

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/hash_double_idp47931856.html b/doc/html/boost/hash_double_idp47931856.html deleted file mode 100644 index 45da08522b..0000000000 --- a/doc/html/boost/hash_double_idp47931856.html +++ /dev/null @@ -1,77 +0,0 @@ - - - - -Struct hash<double> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct hash<double>

    -

    boost::hash<double>

    -
    -

    Synopsis

    -
    // In header: <boost/functional/hash.hpp>
-
-
-struct hash<double> {
-  std::size_t operator()(double) const;
-};
    -
    -

    Description

    -
    std::size_t operator()(double val) const;
    -
    ---- - - - - - - - - - - -

    Returns:

    		 -

    Unspecified in TR1, except that equal arguments yield the same result.

    -

    hash_value(val) in Boost.

    -

    Throws:

    Doesn't throw

    -
    -
    - - - -
    Copyright © 2005-2008 Daniel - James

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/hash_flo_idm45507151806784.html b/doc/html/boost/hash_flo_idm45507151806784.html new file mode 100644 index 0000000000..8ae7f410bf --- /dev/null +++ b/doc/html/boost/hash_flo_idm45507151806784.html @@ -0,0 +1,77 @@ + + + + +Struct hash<float> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct hash<float>

    +

    boost::hash<float>

    +
    +

    Synopsis

    +
    // In header: <boost/functional/hash.hpp>
+
+
+struct hash<float> {
+  std::size_t operator()(float) const;
+};
    +
    +

    Description

    +
    std::size_t operator()(float val) const;
    +
    ++++ + + + + + + + + + + +

    Returns:

    		 +

    Unspecified in TR1, except that equal arguments yield the same result.

    +

    hash_value(val) in Boost.

    +

    Throws:

    Doesn't throw

    +
    +
    + + + +
    Copyright © 2005-2008 Daniel + James

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/hash_float_idp94718704.html b/doc/html/boost/hash_float_idp94718704.html deleted file mode 100644 index 1e83833544..0000000000 --- a/doc/html/boost/hash_float_idp94718704.html +++ /dev/null @@ -1,77 +0,0 @@ - - - - -Struct hash<float> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct hash<float>

    -

    boost::hash<float>

    -
    -

    Synopsis

    -
    // In header: <boost/functional/hash.hpp>
-
-
-struct hash<float> {
-  std::size_t operator()(float) const;
-};
    -
    -

    Description

    -
    std::size_t operator()(float val) const;
    -
    ---- - - - - - - - - - - -

    Returns:

    		 -

    Unspecified in TR1, except that equal arguments yield the same result.

    -

    hash_value(val) in Boost.

    -

    Throws:

    Doesn't throw

    -
    -
    - - - -
    Copyright © 2005-2008 Daniel - James

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/hash_int_idm45507129209328.html b/doc/html/boost/hash_int_idm45507129209328.html new file mode 100644 index 0000000000..345e8f5511 --- /dev/null +++ b/doc/html/boost/hash_int_idm45507129209328.html @@ -0,0 +1,77 @@ + + + + +Struct hash<int> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct hash<int>

    +

    boost::hash<int>

    +
    +

    Synopsis

    +
    // In header: <boost/functional/hash.hpp>
+
+
+struct hash<int> {
+  std::size_t operator()(int) const;
+};
    +
    +

    Description

    +
    std::size_t operator()(int val) const;
    +
    ++++ + + + + + + + + + + +

    Returns:

    		 +

    Unspecified in TR1, except that equal arguments yield the same result.

    +

    hash_value(val) in Boost.

    +

    Throws:

    Doesn't throw

    +
    +
    + + + +
    Copyright © 2005-2008 Daniel + James

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/hash_int_idp44717040.html b/doc/html/boost/hash_int_idp44717040.html deleted file mode 100644 index c1d5d646e4..0000000000 --- a/doc/html/boost/hash_int_idp44717040.html +++ /dev/null @@ -1,77 +0,0 @@ - - - - -Struct hash<int> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct hash<int>

    -

    boost::hash<int>

    -
    -

    Synopsis

    -
    // In header: <boost/functional/hash.hpp>
-
-
-struct hash<int> {
-  std::size_t operator()(int) const;
-};
    -
    -

    Description

    -
    std::size_t operator()(int val) const;
    -
    ---- - - - - - - - - - - -

    Returns:

    		 -

    Unspecified in TR1, except that equal arguments yield the same result.

    -

    hash_value(val) in Boost.

    -

    Throws:

    Doesn't throw

    -
    -
    - - - -
    Copyright © 2005-2008 Daniel - James

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/hash_lon_idm45507135588752.html b/doc/html/boost/hash_lon_idm45507135588752.html new file mode 100644 index 0000000000..2d5db12364 --- /dev/null +++ b/doc/html/boost/hash_lon_idm45507135588752.html @@ -0,0 +1,77 @@ + + + + +Struct hash<long long> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct hash<long long>

    +

    boost::hash<long long>

    +
    +

    Synopsis

    +
    // In header: <boost/functional/hash.hpp>
+
+
+struct hash<long long> {
+  std::size_t operator()(long long) const;
+};
    +
    +

    Description

    +
    std::size_t operator()(long long val) const;
    +
    ++++ + + + + + + + + + + +

    Returns:

    		 +

    Unspecified in TR1, except that equal arguments yield the same result.

    +

    hash_value(val) in Boost.

    +

    Throws:

    Doesn't throw

    +
    +
    + + + +
    Copyright © 2005-2008 Daniel + James

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/hash_lon_idm45507152187984.html b/doc/html/boost/hash_lon_idm45507152187984.html new file mode 100644 index 0000000000..c7bd1f8cd3 --- /dev/null +++ b/doc/html/boost/hash_lon_idm45507152187984.html @@ -0,0 +1,77 @@ + + + + +Struct hash<long> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct hash<long>

    +

    boost::hash<long>

    +
    +

    Synopsis

    +
    // In header: <boost/functional/hash.hpp>
+
+
+struct hash<long> {
+  std::size_t operator()(long) const;
+};
    +
    +

    Description

    +
    std::size_t operator()(long val) const;
    +
    ++++ + + + + + + + + + + +

    Returns:

    		 +

    Unspecified in TR1, except that equal arguments yield the same result.

    +

    hash_value(val) in Boost.

    +

    Throws:

    Doesn't throw

    +
    +
    + + + +
    Copyright © 2005-2008 Daniel + James

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/hash_lon_idm45507161501456.html b/doc/html/boost/hash_lon_idm45507161501456.html new file mode 100644 index 0000000000..a7308037ac --- /dev/null +++ b/doc/html/boost/hash_lon_idm45507161501456.html @@ -0,0 +1,77 @@ + + + + +Struct hash<long double> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct hash<long double>

    +

    boost::hash<long double>

    +
    +

    Synopsis

    +
    // In header: <boost/functional/hash.hpp>
+
+
+struct hash<long double> {
+  std::size_t operator()(long double) const;
+};
    +
    +

    Description

    +
    std::size_t operator()(long double val) const;
    +
    ++++ + + + + + + + + + + +

    Returns:

    		 +

    Unspecified in TR1, except that equal arguments yield the same result.

    +

    hash_value(val) in Boost.

    +

    Throws:

    Doesn't throw

    +
    +
    + + + +
    Copyright © 2005-2008 Daniel + James

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/hash_long_doub_idp75363296.html b/doc/html/boost/hash_long_doub_idp75363296.html deleted file mode 100644 index 39b17e12ca..0000000000 --- a/doc/html/boost/hash_long_doub_idp75363296.html +++ /dev/null @@ -1,77 +0,0 @@ - - - - -Struct hash<long double> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct hash<long double>

    -

    boost::hash<long double>

    -
    -

    Synopsis

    -
    // In header: <boost/functional/hash.hpp>
-
-
-struct hash<long double> {
-  std::size_t operator()(long double) const;
-};
    -
    -

    Description

    -
    std::size_t operator()(long double val) const;
    -
    ---- - - - - - - - - - - -

    Returns:

    		 -

    Unspecified in TR1, except that equal arguments yield the same result.

    -

    hash_value(val) in Boost.

    -

    Throws:

    Doesn't throw

    -
    -
    - - - -
    Copyright © 2005-2008 Daniel - James

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/hash_long_idp112322912.html b/doc/html/boost/hash_long_idp112322912.html deleted file mode 100644 index c019777212..0000000000 --- a/doc/html/boost/hash_long_idp112322912.html +++ /dev/null @@ -1,77 +0,0 @@ - - - - -Struct hash<long> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct hash<long>

    -

    boost::hash<long>

    -
    -

    Synopsis

    -
    // In header: <boost/functional/hash.hpp>
-
-
-struct hash<long> {
-  std::size_t operator()(long) const;
-};
    -
    -

    Description

    -
    std::size_t operator()(long val) const;
    -
    ---- - - - - - - - - - - -

    Returns:

    		 -

    Unspecified in TR1, except that equal arguments yield the same result.

    -

    hash_value(val) in Boost.

    -

    Throws:

    Doesn't throw

    -
    -
    - - - -
    Copyright © 2005-2008 Daniel - James

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/hash_long_long_idp37021984.html b/doc/html/boost/hash_long_long_idp37021984.html deleted file mode 100644 index 675ee19a4d..0000000000 --- a/doc/html/boost/hash_long_long_idp37021984.html +++ /dev/null @@ -1,77 +0,0 @@ - - - - -Struct hash<long long> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct hash<long long>

    -

    boost::hash<long long>

    -
    -

    Synopsis

    -
    // In header: <boost/functional/hash.hpp>
-
-
-struct hash<long long> {
-  std::size_t operator()(long long) const;
-};
    -
    -

    Description

    -
    std::size_t operator()(long long val) const;
    -
    ---- - - - - - - - - - - -

    Returns:

    		 -

    Unspecified in TR1, except that equal arguments yield the same result.

    -

    hash_value(val) in Boost.

    -

    Throws:

    Doesn't throw

    -
    -
    - - - -
    Copyright © 2005-2008 Daniel - James

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/hash_sho_idm45507086428944.html b/doc/html/boost/hash_sho_idm45507086428944.html new file mode 100644 index 0000000000..39f12db399 --- /dev/null +++ b/doc/html/boost/hash_sho_idm45507086428944.html @@ -0,0 +1,77 @@ + + + + +Struct hash<short> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct hash<short>

    +

    boost::hash<short>

    +
    +

    Synopsis

    +
    // In header: <boost/functional/hash.hpp>
+
+
+struct hash<short> {
+  std::size_t operator()(short) const;
+};
    +
    +

    Description

    +
    std::size_t operator()(short val) const;
    +
    ++++ + + + + + + + + + + +

    Returns:

    		 +

    Unspecified in TR1, except that equal arguments yield the same result.

    +

    hash_value(val) in Boost.

    +

    Throws:

    Doesn't throw

    +
    +
    + + + +
    Copyright © 2005-2008 Daniel + James

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/hash_short_idp108298208.html b/doc/html/boost/hash_short_idp108298208.html deleted file mode 100644 index e71d921936..0000000000 --- a/doc/html/boost/hash_short_idp108298208.html +++ /dev/null @@ -1,77 +0,0 @@ - - - - -Struct hash<short> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct hash<short>

    -

    boost::hash<short>

    -
    -

    Synopsis

    -
    // In header: <boost/functional/hash.hpp>
-
-
-struct hash<short> {
-  std::size_t operator()(short) const;
-};
    -
    -

    Description

    -
    std::size_t operator()(short val) const;
    -
    ---- - - - - - - - - - - -

    Returns:

    		 -

    Unspecified in TR1, except that equal arguments yield the same result.

    -

    hash_value(val) in Boost.

    -

    Throws:

    Doesn't throw

    -
    -
    - - - -
    Copyright © 2005-2008 Daniel - James

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/hash_sig_idm45507154819552.html b/doc/html/boost/hash_sig_idm45507154819552.html new file mode 100644 index 0000000000..3d437da7fa --- /dev/null +++ b/doc/html/boost/hash_sig_idm45507154819552.html @@ -0,0 +1,77 @@ + + + + +Struct hash<signed char> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct hash<signed char>

    +

    boost::hash<signed char>

    +
    +

    Synopsis

    +
    // In header: <boost/functional/hash.hpp>
+
+
+struct hash<signed char> {
+  std::size_t operator()(signed char) const;
+};
    +
    +

    Description

    +
    std::size_t operator()(signed char val) const;
    +
    ++++ + + + + + + + + + + +

    Returns:

    		 +

    Unspecified in TR1, except that equal arguments yield the same result.

    +

    hash_value(val) in Boost.

    +

    Throws:

    Doesn't throw

    +
    +
    + + + +
    Copyright © 2005-2008 Daniel + James

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/hash_signed_c_idp108738576.html b/doc/html/boost/hash_signed_c_idp108738576.html deleted file mode 100644 index d284d28964..0000000000 --- a/doc/html/boost/hash_signed_c_idp108738576.html +++ /dev/null @@ -1,77 +0,0 @@ - - - - -Struct hash<signed char> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct hash<signed char>

    -

    boost::hash<signed char>

    -
    -

    Synopsis

    -
    // In header: <boost/functional/hash.hpp>
-
-
-struct hash<signed char> {
-  std::size_t operator()(signed char) const;
-};
    -
    -

    Description

    -
    std::size_t operator()(signed char val) const;
    -
    ---- - - - - - - - - - - -

    Returns:

    		 -

    Unspecified in TR1, except that equal arguments yield the same result.

    -

    hash_value(val) in Boost.

    -

    Throws:

    Doesn't throw

    -
    -
    - - - -
    Copyright © 2005-2008 Daniel - James

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/hash_std_idm45507089085408.html b/doc/html/boost/hash_std_idm45507089085408.html new file mode 100644 index 0000000000..dce525822a --- /dev/null +++ b/doc/html/boost/hash_std_idm45507089085408.html @@ -0,0 +1,77 @@ + + + + +Struct hash<std::string> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct hash<std::string>

    +

    boost::hash<std::string>

    +
    +

    Synopsis

    +
    // In header: <boost/functional/hash.hpp>
+
+
+struct hash<std::string> {
+  std::size_t operator()(std::string const&) const;
+};
    +
    +

    Description

    +
    std::size_t operator()(std::string const& val) const;
    +
    ++++ + + + + + + + + + + +

    Returns:

    		 +

    Unspecified in TR1, except that equal arguments yield the same result.

    +

    hash_value(val) in Boost.

    +

    Throws:

    Doesn't throw

    +
    +
    + + + +
    Copyright © 2005-2008 Daniel + James

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/hash_std_idm45507150036736.html b/doc/html/boost/hash_std_idm45507150036736.html new file mode 100644 index 0000000000..7d534f3bc7 --- /dev/null +++ b/doc/html/boost/hash_std_idm45507150036736.html @@ -0,0 +1,77 @@ + + + + +Struct hash<std::wstring> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct hash<std::wstring>

    +

    boost::hash<std::wstring>

    +
    +

    Synopsis

    +
    // In header: <boost/functional/hash.hpp>
+
+
+struct hash<std::wstring> {
+  std::size_t operator()(std::wstring const&) const;
+};
    +
    +

    Description

    +
    std::size_t operator()(std::wstring const& val) const;
    +
    ++++ + + + + + + + + + + +

    Returns:

    		 +

    Unspecified in TR1, except that equal arguments yield the same result.

    +

    hash_value(val) in Boost.

    +

    Throws:

    Doesn't throw

    +
    +
    + + + +
    Copyright © 2005-2008 Daniel + James

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/hash_std_idm45507162771328.html b/doc/html/boost/hash_std_idm45507162771328.html new file mode 100644 index 0000000000..cf2efb204a --- /dev/null +++ b/doc/html/boost/hash_std_idm45507162771328.html @@ -0,0 +1,74 @@ + + + + +Struct hash<std::type_index> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct hash<std::type_index>

    +

    boost::hash<std::type_index>

    +
    +

    Synopsis

    +
    // In header: <boost/functional/hash.hpp>
+
+
+struct hash<std::type_index> {
+  std::size_t operator()(std::type_index) const;
+};
    +
    +

    Description

    +
    std::size_t operator()(std::type_index val) const;
    +
    ++++ + + + + + + + + + + +

    Returns:

    val.hash_code()

    Throws:

    Doesn't throw

    +
    +
    + + + +
    Copyright © 2005-2008 Daniel + James

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/hash_std_strin_idp49656032.html b/doc/html/boost/hash_std_strin_idp49656032.html deleted file mode 100644 index 1be10d10ca..0000000000 --- a/doc/html/boost/hash_std_strin_idp49656032.html +++ /dev/null @@ -1,77 +0,0 @@ - - - - -Struct hash<std::string> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct hash<std::string>

    -

    boost::hash<std::string>

    -
    -

    Synopsis

    -
    // In header: <boost/functional/hash.hpp>
-
-
-struct hash<std::string> {
-  std::size_t operator()(std::string const&) const;
-};
    -
    -

    Description

    -
    std::size_t operator()(std::string const& val) const;
    -
    ---- - - - - - - - - - - -

    Returns:

    		 -

    Unspecified in TR1, except that equal arguments yield the same result.

    -

    hash_value(val) in Boost.

    -

    Throws:

    Doesn't throw

    -
    -
    - - - -
    Copyright © 2005-2008 Daniel - James

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/hash_std_type__idp71799568.html b/doc/html/boost/hash_std_type__idp71799568.html deleted file mode 100644 index 62bb3aa42a..0000000000 --- a/doc/html/boost/hash_std_type__idp71799568.html +++ /dev/null @@ -1,74 +0,0 @@ - - - - -Struct hash<std::type_index> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct hash<std::type_index>

    -

    boost::hash<std::type_index>

    -
    -

    Synopsis

    -
    // In header: <boost/functional/hash.hpp>
-
-
-struct hash<std::type_index> {
-  std::size_t operator()(std::type_index) const;
-};
    -
    -

    Description

    -
    std::size_t operator()(std::type_index val) const;
    -
    ---- - - - - - - - - - - -

    Returns:

    val.hash_code()

    Throws:

    Doesn't throw

    -
    -
    - - - -
    Copyright © 2005-2008 Daniel - James

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/hash_std_wstri_idp47982592.html b/doc/html/boost/hash_std_wstri_idp47982592.html deleted file mode 100644 index 846ad2a159..0000000000 --- a/doc/html/boost/hash_std_wstri_idp47982592.html +++ /dev/null @@ -1,77 +0,0 @@ - - - - -Struct hash<std::wstring> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct hash<std::wstring>

    -

    boost::hash<std::wstring>

    -
    -

    Synopsis

    -
    // In header: <boost/functional/hash.hpp>
-
-
-struct hash<std::wstring> {
-  std::size_t operator()(std::wstring const&) const;
-};
    -
    -

    Description

    -
    std::size_t operator()(std::wstring const& val) const;
    -
    ---- - - - - - - - - - - -

    Returns:

    		 -

    Unspecified in TR1, except that equal arguments yield the same result.

    -

    hash_value(val) in Boost.

    -

    Throws:

    Doesn't throw

    -
    -
    - - - -
    Copyright © 2005-2008 Daniel - James

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/hash_uns_idm45507098692080.html b/doc/html/boost/hash_uns_idm45507098692080.html new file mode 100644 index 0000000000..a638f25caa --- /dev/null +++ b/doc/html/boost/hash_uns_idm45507098692080.html @@ -0,0 +1,77 @@ + + + + +Struct hash<unsigned long> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct hash<unsigned long>

    +

    boost::hash<unsigned long>

    +
    +

    Synopsis

    +
    // In header: <boost/functional/hash.hpp>
+
+
+struct hash<unsigned long> {
+  std::size_t operator()(unsigned long) const;
+};
    +
    +

    Description

    +
    std::size_t operator()(unsigned long val) const;
    +
    ++++ + + + + + + + + + + +

    Returns:

    		 +

    Unspecified in TR1, except that equal arguments yield the same result.

    +

    hash_value(val) in Boost.

    +

    Throws:

    Doesn't throw

    +
    +
    + + + +
    Copyright © 2005-2008 Daniel + James

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/hash_uns_idm45507103921888.html b/doc/html/boost/hash_uns_idm45507103921888.html new file mode 100644 index 0000000000..7316b104ee --- /dev/null +++ b/doc/html/boost/hash_uns_idm45507103921888.html @@ -0,0 +1,77 @@ + + + + +Struct hash<unsigned char> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct hash<unsigned char>

    +

    boost::hash<unsigned char>

    +
    +

    Synopsis

    +
    // In header: <boost/functional/hash.hpp>
+
+
+struct hash<unsigned char> {
+  std::size_t operator()(unsigned char) const;
+};
    +
    +

    Description

    +
    std::size_t operator()(unsigned char val) const;
    +
    ++++ + + + + + + + + + + +

    Returns:

    		 +

    Unspecified in TR1, except that equal arguments yield the same result.

    +

    hash_value(val) in Boost.

    +

    Throws:

    Doesn't throw

    +
    +
    + + + +
    Copyright © 2005-2008 Daniel + James

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/hash_uns_idm45507132092672.html b/doc/html/boost/hash_uns_idm45507132092672.html new file mode 100644 index 0000000000..d8c9029e89 --- /dev/null +++ b/doc/html/boost/hash_uns_idm45507132092672.html @@ -0,0 +1,77 @@ + + + + +Struct hash<unsigned long long> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct hash<unsigned long long>

    +

    boost::hash<unsigned long long>

    +
    +

    Synopsis

    +
    // In header: <boost/functional/hash.hpp>
+
+
+struct hash<unsigned long long> {
+  std::size_t operator()(unsigned long long) const;
+};
    +
    +

    Description

    +
    std::size_t operator()(unsigned long long val) const;
    +
    ++++ + + + + + + + + + + +

    Returns:

    		 +

    Unspecified in TR1, except that equal arguments yield the same result.

    +

    hash_value(val) in Boost.

    +

    Throws:

    Doesn't throw

    +
    +
    + + + +
    Copyright © 2005-2008 Daniel + James

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/hash_uns_idm45507132564400.html b/doc/html/boost/hash_uns_idm45507132564400.html new file mode 100644 index 0000000000..d17614d954 --- /dev/null +++ b/doc/html/boost/hash_uns_idm45507132564400.html @@ -0,0 +1,77 @@ + + + + +Struct hash<unsigned short> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct hash<unsigned short>

    +

    boost::hash<unsigned short>

    +
    +

    Synopsis

    +
    // In header: <boost/functional/hash.hpp>
+
+
+struct hash<unsigned short> {
+  std::size_t operator()(unsigned short) const;
+};
    +
    +

    Description

    +
    std::size_t operator()(unsigned short val) const;
    +
    ++++ + + + + + + + + + + +

    Returns:

    		 +

    Unspecified in TR1, except that equal arguments yield the same result.

    +

    hash_value(val) in Boost.

    +

    Throws:

    Doesn't throw

    +
    +
    + + + +
    Copyright © 2005-2008 Daniel + James

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/hash_uns_idm45507151120816.html b/doc/html/boost/hash_uns_idm45507151120816.html new file mode 100644 index 0000000000..34df8e1476 --- /dev/null +++ b/doc/html/boost/hash_uns_idm45507151120816.html @@ -0,0 +1,77 @@ + + + + +Struct hash<unsigned int> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct hash<unsigned int>

    +

    boost::hash<unsigned int>

    +
    +

    Synopsis

    +
    // In header: <boost/functional/hash.hpp>
+
+
+struct hash<unsigned int> {
+  std::size_t operator()(unsigned int) const;
+};
    +
    +

    Description

    +
    std::size_t operator()(unsigned int val) const;
    +
    ++++ + + + + + + + + + + +

    Returns:

    		 +

    Unspecified in TR1, except that equal arguments yield the same result.

    +

    hash_value(val) in Boost.

    +

    Throws:

    Doesn't throw

    +
    +
    + + + +
    Copyright © 2005-2008 Daniel + James

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/hash_unsigned__idp36145056.html b/doc/html/boost/hash_unsigned__idp36145056.html deleted file mode 100644 index 74f328b493..0000000000 --- a/doc/html/boost/hash_unsigned__idp36145056.html +++ /dev/null @@ -1,77 +0,0 @@ - - - - -Struct hash<unsigned long> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct hash<unsigned long>

    -

    boost::hash<unsigned long>

    -
    -

    Synopsis

    -
    // In header: <boost/functional/hash.hpp>
-
-
-struct hash<unsigned long> {
-  std::size_t operator()(unsigned long) const;
-};
    -
    -

    Description

    -
    std::size_t operator()(unsigned long val) const;
    -
    ---- - - - - - - - - - - -

    Returns:

    		 -

    Unspecified in TR1, except that equal arguments yield the same result.

    -

    hash_value(val) in Boost.

    -

    Throws:

    Doesn't throw

    -
    -
    - - - -
    Copyright © 2005-2008 Daniel - James

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/hash_unsigned__idp43866112.html b/doc/html/boost/hash_unsigned__idp43866112.html deleted file mode 100644 index b33c493892..0000000000 --- a/doc/html/boost/hash_unsigned__idp43866112.html +++ /dev/null @@ -1,77 +0,0 @@ - - - - -Struct hash<unsigned short> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct hash<unsigned short>

    -

    boost::hash<unsigned short>

    -
    -

    Synopsis

    -
    // In header: <boost/functional/hash.hpp>
-
-
-struct hash<unsigned short> {
-  std::size_t operator()(unsigned short) const;
-};
    -
    -

    Description

    -
    std::size_t operator()(unsigned short val) const;
    -
    ---- - - - - - - - - - - -

    Returns:

    		 -

    Unspecified in TR1, except that equal arguments yield the same result.

    -

    hash_value(val) in Boost.

    -

    Throws:

    Doesn't throw

    -
    -
    - - - -
    Copyright © 2005-2008 Daniel - James

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/hash_unsigned__idp73029472.html b/doc/html/boost/hash_unsigned__idp73029472.html deleted file mode 100644 index 7b9a87ca91..0000000000 --- a/doc/html/boost/hash_unsigned__idp73029472.html +++ /dev/null @@ -1,77 +0,0 @@ - - - - -Struct hash<unsigned int> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct hash<unsigned int>

    -

    boost::hash<unsigned int>

    -
    -

    Synopsis

    -
    // In header: <boost/functional/hash.hpp>
-
-
-struct hash<unsigned int> {
-  std::size_t operator()(unsigned int) const;
-};
    -
    -

    Description

    -
    std::size_t operator()(unsigned int val) const;
    -
    ---- - - - - - - - - - - -

    Returns:

    		 -

    Unspecified in TR1, except that equal arguments yield the same result.

    -

    hash_value(val) in Boost.

    -

    Throws:

    Doesn't throw

    -
    -
    - - - -
    Copyright © 2005-2008 Daniel - James

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/hash_unsigned__idp93655040.html b/doc/html/boost/hash_unsigned__idp93655040.html deleted file mode 100644 index 269c3e48df..0000000000 --- a/doc/html/boost/hash_unsigned__idp93655040.html +++ /dev/null @@ -1,77 +0,0 @@ - - - - -Struct hash<unsigned char> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct hash<unsigned char>

    -

    boost::hash<unsigned char>

    -
    -

    Synopsis

    -
    // In header: <boost/functional/hash.hpp>
-
-
-struct hash<unsigned char> {
-  std::size_t operator()(unsigned char) const;
-};
    -
    -

    Description

    -
    std::size_t operator()(unsigned char val) const;
    -
    ---- - - - - - - - - - - -

    Returns:

    		 -

    Unspecified in TR1, except that equal arguments yield the same result.

    -

    hash_value(val) in Boost.

    -

    Throws:

    Doesn't throw

    -
    -
    - - - -
    Copyright © 2005-2008 Daniel - James

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/hash_unsigned_idp102966432.html b/doc/html/boost/hash_unsigned_idp102966432.html deleted file mode 100644 index ed88826cbe..0000000000 --- a/doc/html/boost/hash_unsigned_idp102966432.html +++ /dev/null @@ -1,77 +0,0 @@ - - - - -Struct hash<unsigned long long> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct hash<unsigned long long>

    -

    boost::hash<unsigned long long>

    -
    -

    Synopsis

    -
    // In header: <boost/functional/hash.hpp>
-
-
-struct hash<unsigned long long> {
-  std::size_t operator()(unsigned long long) const;
-};
    -
    -

    Description

    -
    std::size_t operator()(unsigned long long val) const;
    -
    ---- - - - - - - - - - - -

    Returns:

    		 -

    Unspecified in TR1, except that equal arguments yield the same result.

    -

    hash_value(val) in Boost.

    -

    Throws:

    Doesn't throw

    -
    -
    - - - -
    Copyright © 2005-2008 Daniel - James

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/hash_val_idm45507037969264.html b/doc/html/boost/hash_val_idm45507037969264.html new file mode 100644 index 0000000000..45ef88c7e2 --- /dev/null +++ b/doc/html/boost/hash_val_idm45507037969264.html @@ -0,0 +1,82 @@ + + + + +Function template hash_value + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template hash_value

    +

    boost::hash_value — Provides hashing for variant types so + that boost::hash may compute hash.

    +
    +

    Synopsis

    +
    // In header: <boost/variant/variant.hpp>
+
+
+template<typename T1, typename T2, ..., typename TN> 
+  std::size_t hash_value(const variant<T1, T2, ..., TN> & rhs);
    +
    +

    Description

    +
    ++++ + + + + + + + + + + + + + + +

    Requires:

    		Every bounded type of the variant must + fulfill the requirements of the + Hashable + concept.

    Effects:

    		Calls boost::hash<T>()(x), where x is + the content of rhs and T is its type.

    Notes:

    		Actually, this function is defined in + <boost/variant/detail/hash_variant.hpp> + header.
    +
    +
    + + + +
    Copyright © 2002, 2003 Eric Friedman, Itay Maman

    Distributed under the Boost Software License, Version 1.0. + (See accompanying file LICENSE_1_0.txt or copy at + http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/hash_value_idp307613776.html b/doc/html/boost/hash_value_idp307613776.html deleted file mode 100644 index 4e89dca36a..0000000000 --- a/doc/html/boost/hash_value_idp307613776.html +++ /dev/null @@ -1,82 +0,0 @@ - - - - -Function template hash_value - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template hash_value

    -

    boost::hash_value — Provides hashing for variant types so - that boost::hash may compute hash.

    -
    -

    Synopsis

    -
    // In header: <boost/variant/variant.hpp>
-
-
-template<typename T1, typename T2, ..., typename TN> 
-  std::size_t hash_value(const variant<T1, T2, ..., TN> & rhs);
    -
    -

    Description

    -
    ---- - - - - - - - - - - - - - - -

    Requires:

    		Every bounded type of the variant must - fulfill the requirements of the - Hashable - concept.

    Effects:

    		Calls boost::hash<T>()(x), where x is - the content of rhs and T is its type.

    Notes:

    		Actually, this function is defined in - <boost/variant/detail/hash_variant.hpp> - header.
    -
    -
    - - - -
    Copyright © 2002, 2003 Eric Friedman, Itay Maman

    Distributed under the Boost Software License, Version 1.0. - (See accompanying file LICENSE_1_0.txt or copy at - http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/hash_wch_idm45507163052656.html b/doc/html/boost/hash_wch_idm45507163052656.html new file mode 100644 index 0000000000..9db65b2bc9 --- /dev/null +++ b/doc/html/boost/hash_wch_idm45507163052656.html @@ -0,0 +1,77 @@ + + + + +Struct hash<wchar_t> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct hash<wchar_t>

    +

    boost::hash<wchar_t>

    +
    +

    Synopsis

    +
    // In header: <boost/functional/hash.hpp>
+
+
+struct hash<wchar_t> {
+  std::size_t operator()(wchar_t) const;
+};
    +
    +

    Description

    +
    std::size_t operator()(wchar_t val) const;
    +
    ++++ + + + + + + + + + + +

    Returns:

    		 +

    Unspecified in TR1, except that equal arguments yield the same result.

    +

    hash_value(val) in Boost.

    +

    Throws:

    Doesn't throw

    +
    +
    + + + +
    Copyright © 2005-2008 Daniel + James

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/hash_wchar_t_idp51592560.html b/doc/html/boost/hash_wchar_t_idp51592560.html deleted file mode 100644 index 30dfbf5a7e..0000000000 --- a/doc/html/boost/hash_wchar_t_idp51592560.html +++ /dev/null @@ -1,77 +0,0 @@ - - - - -Struct hash<wchar_t> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct hash<wchar_t>

    -

    boost::hash<wchar_t>

    -
    -

    Synopsis

    -
    // In header: <boost/functional/hash.hpp>
-
-
-struct hash<wchar_t> {
-  std::size_t operator()(wchar_t) const;
-};
    -
    -

    Description

    -
    std::size_t operator()(wchar_t val) const;
    -
    ---- - - - - - - - - - - -

    Returns:

    		 -

    Unspecified in TR1, except that equal arguments yield the same result.

    -

    hash_value(val) in Boost.

    -

    Throws:

    Doesn't throw

    -
    -
    - - - -
    Copyright © 2005-2008 Daniel - James

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/heap/MergablePriorityQueue.html b/doc/html/boost/heap/MergablePriorityQueue.html index 19494da433..d182b987fa 100644 --- a/doc/html/boost/heap/MergablePriorityQueue.html +++ b/doc/html/boost/heap/MergablePriorityQueue.html @@ -42,18 +42,18 @@ typedef C::value_type value_type; typedef C::const_reference const_reference; - // public member functions - BOOST_CONCEPT_USAGE(MergablePriorityQueue); - BOOST_CONCEPT_USAGE(PriorityQueue); + // public member functions + BOOST_CONCEPT_USAGE(MergablePriorityQueue); + BOOST_CONCEPT_USAGE(PriorityQueue); };
    -

    Description

    +

    Description

    -

    -MergablePriorityQueue public member functions

    +

    +MergablePriorityQueue public member functions

      -
    1.  BOOST_CONCEPT_USAGE(MergablePriorityQueue);
      2. -
    2.  BOOST_CONCEPT_USAGE(PriorityQueue);
      3. +
    3.  BOOST_CONCEPT_USAGE(MergablePriorityQueue);
      4. +
    4.  BOOST_CONCEPT_USAGE(PriorityQueue);
    diff --git a/doc/html/boost/heap/MutablePriorityQueue.html b/doc/html/boost/heap/MutablePriorityQueue.html index 0c305e7735..a90b3b1537 100644 --- a/doc/html/boost/heap/MutablePriorityQueue.html +++ b/doc/html/boost/heap/MutablePriorityQueue.html @@ -43,9 +43,9 @@ typedef C::value_type value_type; typedef C::const_reference const_reference; - // public member functions - BOOST_CONCEPT_USAGE(MutablePriorityQueue); - BOOST_CONCEPT_USAGE(PriorityQueue); + // public member functions + BOOST_CONCEPT_USAGE(MutablePriorityQueue); + BOOST_CONCEPT_USAGE(PriorityQueue); // public data members C c; @@ -53,13 +53,13 @@ bool not_equal; };
    -

    Description

    +

    Description

    -

    -MutablePriorityQueue public member functions

    +

    +MutablePriorityQueue public member functions

      -
    1.  BOOST_CONCEPT_USAGE(MutablePriorityQueue);
      2. -
    2.  BOOST_CONCEPT_USAGE(PriorityQueue);
      3. +
    3.  BOOST_CONCEPT_USAGE(MutablePriorityQueue);
      4. +
    4.  BOOST_CONCEPT_USAGE(PriorityQueue);
    diff --git a/doc/html/boost/heap/PriorityQueue.html b/doc/html/boost/heap/PriorityQueue.html index a205e309a5..c84db373bb 100644 --- a/doc/html/boost/heap/PriorityQueue.html +++ b/doc/html/boost/heap/PriorityQueue.html @@ -42,15 +42,15 @@ typedef C::value_type value_type; typedef C::const_reference const_reference; - // public member functions - BOOST_CONCEPT_USAGE(PriorityQueue); + // public member functions + BOOST_CONCEPT_USAGE(PriorityQueue); };
    -

    Description

    +

    Description

    -

    -PriorityQueue public member functions

    -
    1.  BOOST_CONCEPT_USAGE(PriorityQueue);
    +

    +PriorityQueue public member functions

    +
    1.  BOOST_CONCEPT_USAGE(PriorityQueue);
    diff --git a/doc/html/boost/heap/arity.html b/doc/html/boost/heap/arity.html index 0f51ea51b6..188cec1992 100644 --- a/doc/html/boost/heap/arity.html +++ b/doc/html/boost/heap/arity.html @@ -36,7 +36,7 @@ struct arity { };
    -

    Description

    +

    Description

    Specifies the arity of a D-ary heap

    diff --git a/doc/html/boost/heap/binomial_heap.html b/doc/html/boost/heap/binomial_heap.html index e3ef587d4a..450326e99a 100644 --- a/doc/html/boost/heap/binomial_heap.html +++ b/doc/html/boost/heap/binomial_heap.html @@ -51,46 +51,46 @@ typedef implementation_defined::handle_type handle_type; // construct/copy/destruct - explicit binomial_heap(value_compare const & = value_compare()); - binomial_heap(binomial_heap const &); - binomial_heap(binomial_heap &&); - binomial_heap & operator=(binomial_heap const &); - binomial_heap & operator=(binomial_heap &&); - ~binomial_heap(void); + explicit binomial_heap(value_compare const & = value_compare()); + binomial_heap(binomial_heap const &); + binomial_heap(binomial_heap &&); + binomial_heap & operator=(binomial_heap const &); + binomial_heap & operator=(binomial_heap &&); + ~binomial_heap(void); - // public member functions - bool empty(void) const; - size_type size(void) const; - size_type max_size(void) const; - void clear(void); - allocator_type get_allocator(void) const; - void swap(binomial_heap &); - const_reference top(void) const; - handle_type push(value_type const &); - template<class... Args> handle_type emplace(Args &&...); - void pop(void); - void update(handle_type, const_reference); - void update(handle_type); - void increase(handle_type, const_reference); - void increase(handle_type); - void decrease(handle_type, const_reference); - void decrease(handle_type); - void merge(binomial_heap &); - iterator begin(void) const; - iterator end(void) const; - ordered_iterator ordered_begin(void) const; - ordered_iterator ordered_end(void) const; - void erase(handle_type); - value_compare const & value_comp(void) const; - template<typename HeapType> bool operator<(HeapType const &) const; - template<typename HeapType> bool operator>(HeapType const &) const; - template<typename HeapType> bool operator>=(HeapType const &) const; - template<typename HeapType> bool operator<=(HeapType const &) const; - template<typename HeapType> bool operator==(HeapType const &) const; - template<typename HeapType> bool operator!=(HeapType const &) const; + // public member functions + bool empty(void) const; + size_type size(void) const; + size_type max_size(void) const; + void clear(void); + allocator_type get_allocator(void) const; + void swap(binomial_heap &); + const_reference top(void) const; + handle_type push(value_type const &); + template<class... Args> handle_type emplace(Args &&...); + void pop(void); + void update(handle_type, const_reference); + void update(handle_type); + void increase(handle_type, const_reference); + void increase(handle_type); + void decrease(handle_type, const_reference); + void decrease(handle_type); + void merge(binomial_heap &); + iterator begin(void) const; + iterator end(void) const; + ordered_iterator ordered_begin(void) const; + ordered_iterator ordered_end(void) const; + void erase(handle_type); + value_compare const & value_comp(void) const; + template<typename HeapType> bool operator<(HeapType const &) const; + template<typename HeapType> bool operator>(HeapType const &) const; + template<typename HeapType> bool operator>=(HeapType const &) const; + template<typename HeapType> bool operator<=(HeapType const &) const; + template<typename HeapType> bool operator==(HeapType const &) const; + template<typename HeapType> bool operator!=(HeapType const &) const; - // public static functions - static handle_type s_handle_from_iterator(iterator const &); + // public static functions + static handle_type s_handle_from_iterator(iterator const &); // public data members static const bool constant_time_size; @@ -100,7 +100,7 @@ static const bool has_reserve; };
    -

    Description

    +

    Description

    The template parameter T is the type to be managed by the container. The user can specify additional options and if no options are provided default options are used.

    The container supports the following options:

      @@ -113,7 +113,7 @@

      -

      +

      binomial_heap public types

      @@ -124,196 +124,196 @@
    -

    +

    binomial_heap public construct/copy/destruct

    1. -
      explicit binomial_heap(value_compare const & cmp = value_compare());
      +
      explicit binomial_heap(value_compare const & cmp = value_compare());

      Effects: constructs an empty priority queue.

      Complexity: Constant.

    2. -
      binomial_heap(binomial_heap const & rhs);
      +
      binomial_heap(binomial_heap const & rhs);

      Effects: copy-constructs priority queue from rhs.

      Complexity: Linear.

    3. -
      binomial_heap(binomial_heap && rhs);
      +
      binomial_heap(binomial_heap && rhs);

      Effects: C++11-style move constructor.

      Complexity: Constant.

      Note: Only available, if BOOST_NO_CXX11_RVALUE_REFERENCES is not defined

    4. -
      binomial_heap & operator=(binomial_heap const & rhs);
      +
      binomial_heap & operator=(binomial_heap const & rhs);

      Effects: Assigns priority queue from rhs.

      Complexity: Linear.

    5. -
      binomial_heap & operator=(binomial_heap && rhs);
      +
      binomial_heap & operator=(binomial_heap && rhs);

      Effects: C++11-style move assignment.

      Complexity: Constant.

      Note: Only available, if BOOST_NO_CXX11_RVALUE_REFERENCES is not defined

      6. -
    6. ~binomial_heap(void);
      7. +
    7. ~binomial_heap(void);
    -

    -binomial_heap public member functions

    +

    +binomial_heap public member functions

    1. -
      bool empty(void) const;
      +
      bool empty(void) const;

      Effects: Returns true, if the priority queue contains no elements.

      Complexity: Constant.

    2. -
      size_type size(void) const;
      +
      size_type size(void) const;

      Effects: Returns the number of elements contained in the priority queue.

      Complexity: Constant, if configured with constant_time_size<true>, otherwise linear.

    3. -
      size_type max_size(void) const;
      +
      size_type max_size(void) const;

      Effects: Returns the maximum number of elements the priority queue can contain.

      Complexity: Constant.

    4. -
      void clear(void);
      +
      void clear(void);

      Effects: Removes all elements from the priority queue.

      Complexity: Linear.

    5. -
      allocator_type get_allocator(void) const;
      +
      allocator_type get_allocator(void) const;

      Effects: Returns allocator.

      Complexity: Constant.

    6. -
      void swap(binomial_heap & rhs);
      +
      void swap(binomial_heap & rhs);

      Effects: Swaps two priority queues.

      Complexity: Constant.

    7. -
      const_reference top(void) const;
      +
      const_reference top(void) const;

      Effects: Returns a const_reference to the maximum element.

      Complexity: Constant.

    8. -
      handle_type push(value_type const & v);
      +
      handle_type push(value_type const & v);

      Effects: Adds a new element to the priority queue. Returns handle to element

      Complexity: Logarithmic.

    9. -
      template<class... Args> handle_type emplace(Args &&... args);
      +
      template<class... Args> handle_type emplace(Args &&... args);

      Effects: Adds a new element to the priority queue. The element is directly constructed in-place. Returns handle to element.

      Complexity: Logarithmic.

    10. -
      void pop(void);
      +
      void pop(void);

      Effects: Removes the top element from the priority queue.

      Complexity: Logarithmic.

    11. -
      void update(handle_type handle, const_reference v);
      +
      void update(handle_type handle, const_reference v);

      Effects: Assigns v to the element handled by handle & updates the priority queue.

      Complexity: Logarithmic.

    12. -
      void update(handle_type handle);
      +
      void update(handle_type handle);

      Effects: Updates the heap after the element handled by handle has been changed.

      Complexity: Logarithmic.

      Note: If this is not called, after a handle has been updated, the behavior of the data structure is undefined!

    13. -
      void increase(handle_type handle, const_reference v);
      +
      void increase(handle_type handle, const_reference v);

      Effects: Assigns v to the element handled by handle & updates the priority queue.

      Complexity: Logarithmic.

      Note: The new value is expected to be greater than the current one

    14. -
      void increase(handle_type handle);
      +
      void increase(handle_type handle);

      Effects: Updates the heap after the element handled by handle has been changed.

      Complexity: Logarithmic.

      Note: If this is not called, after a handle has been updated, the behavior of the data structure is undefined!

    15. -
      void decrease(handle_type handle, const_reference v);
      +
      void decrease(handle_type handle, const_reference v);

      Effects: Assigns v to the element handled by handle & updates the priority queue.

      Complexity: Logarithmic.

      Note: The new value is expected to be less than the current one

    16. -
      void decrease(handle_type handle);
      +
      void decrease(handle_type handle);

      Effects: Updates the heap after the element handled by handle has been changed.

      Complexity: Logarithmic.

      Note: The new value is expected to be less than the current one. If this is not called, after a handle has been updated, the behavior of the data structure is undefined!

    17. -
      void merge(binomial_heap & rhs);
      +
      void merge(binomial_heap & rhs);

      Effects: Merge with priority queue rhs.

      Complexity: Logarithmic.

    18. -
      iterator begin(void) const;
      +
      iterator begin(void) const;

      Effects: Returns an iterator to the first element contained in the priority queue.

      Complexity: Constant.

    19. -
      iterator end(void) const;
      +
      iterator end(void) const;

      Effects: Returns an iterator to the end of the priority queue.

      Complexity: Constant.

    20. -
      ordered_iterator ordered_begin(void) const;
      +
      ordered_iterator ordered_begin(void) const;

      Effects: Returns an ordered iterator to the first element contained in the priority queue.

      Note: Ordered iterators traverse the priority queue in heap order.

    21. -
      ordered_iterator ordered_end(void) const;
      +
      ordered_iterator ordered_end(void) const;

      Effects: Returns an ordered iterator to the end of the priority queue.

      Note: Ordered iterators traverse the priority queue in heap order.

    22. -
      void erase(handle_type handle);
      +
      void erase(handle_type handle);

      Effects: Removes the element handled by handle from the priority_queue.

      Complexity: Logarithmic.

    23. -
      value_compare const & value_comp(void) const;
      +
      value_compare const & value_comp(void) const;

      Effect: Returns the value_compare object used by the priority queue

    24. -
      template<typename HeapType> bool operator<(HeapType const & rhs) const;
      +
      template<typename HeapType> bool operator<(HeapType const & rhs) const;

      Returns: Element-wise comparison of heap data structures

      Requirement: the value_compare object of both heaps must match.

    25. -
      template<typename HeapType> bool operator>(HeapType const & rhs) const;
      +
      template<typename HeapType> bool operator>(HeapType const & rhs) const;

      Returns: Element-wise comparison of heap data structures

      Requirement: the value_compare object of both heaps must match.

    26. -
      template<typename HeapType> bool operator>=(HeapType const & rhs) const;
      +
      template<typename HeapType> bool operator>=(HeapType const & rhs) const;

      Returns: Element-wise comparison of heap data structures

      Requirement: the value_compare object of both heaps must match.

    27. -
      template<typename HeapType> bool operator<=(HeapType const & rhs) const;
      +
      template<typename HeapType> bool operator<=(HeapType const & rhs) const;

      Returns: Element-wise comparison of heap data structures

      Requirement: the value_compare object of both heaps must match.

    28. -
      template<typename HeapType> bool operator==(HeapType const & rhs) const;
      Equivalent comparison Returns: True, if both heap data structures are equivalent.

      Requirement: the value_compare object of both heaps must match.

      +
      template<typename HeapType> bool operator==(HeapType const & rhs) const;
      Equivalent comparison Returns: True, if both heap data structures are equivalent.

      Requirement: the value_compare object of both heaps must match.

    29. -
      template<typename HeapType> bool operator!=(HeapType const & rhs) const;
      Equivalent comparison Returns: True, if both heap data structures are not equivalent.

      Requirement: the value_compare object of both heaps must match.

      +
      template<typename HeapType> bool operator!=(HeapType const & rhs) const;
      Equivalent comparison Returns: True, if both heap data structures are not equivalent.

      Requirement: the value_compare object of both heaps must match.

    -

    -binomial_heap public static functions

    -
    1. static handle_type s_handle_from_iterator(iterator const & it);
    +

    +binomial_heap public static functions

    +
    1. static handle_type s_handle_from_iterator(iterator const & it);
    diff --git a/doc/html/boost/heap/constant_time_size.html b/doc/html/boost/heap/constant_time_size.html index 852a4bcb02..5c1ba2f1a0 100644 --- a/doc/html/boost/heap/constant_time_size.html +++ b/doc/html/boost/heap/constant_time_size.html @@ -36,7 +36,7 @@ struct constant_time_size { };
    -

    Description

    +

    Description

    Specifies, whether size() should have linear or constant complexity.

    diff --git a/doc/html/boost/heap/d_ary_heap.html b/doc/html/boost/heap/d_ary_heap.html index cd7acd9006..3ecba38178 100644 --- a/doc/html/boost/heap/d_ary_heap.html +++ b/doc/html/boost/heap/d_ary_heap.html @@ -51,48 +51,48 @@ typedef implementation_defined::handle_type handle_type; // construct/copy/destruct - explicit d_ary_heap(value_compare const & = value_compare()); - d_ary_heap(d_ary_heap const &); - d_ary_heap(d_ary_heap &&); - d_ary_heap & operator=(d_ary_heap &&); - d_ary_heap & operator=(d_ary_heap const &); + explicit d_ary_heap(value_compare const & = value_compare()); + d_ary_heap(d_ary_heap const &); + d_ary_heap(d_ary_heap &&); + d_ary_heap & operator=(d_ary_heap &&); + d_ary_heap & operator=(d_ary_heap const &); - // public member functions - bool empty(void) const; - size_type size(void) const; - size_type max_size(void) const; - void clear(void); - allocator_type get_allocator(void) const; - value_type const & top(void) const; - mpl::if_c< is_mutable, handle_type, void >::type push(value_type const &); + // public member functions + bool empty(void) const; + size_type size(void) const; + size_type max_size(void) const; + void clear(void); + allocator_type get_allocator(void) const; + value_type const & top(void) const; + mpl::if_c< is_mutable, handle_type, void >::type push(value_type const &); template<class... Args> - mpl::if_c< is_mutable, handle_type, void >::type emplace(Args &&...); - template<typename HeapType> bool operator<(HeapType const &) const; - template<typename HeapType> bool operator>(HeapType const &) const; - template<typename HeapType> bool operator>=(HeapType const &) const; - template<typename HeapType> bool operator<=(HeapType const &) const; - template<typename HeapType> bool operator==(HeapType const &) const; - template<typename HeapType> bool operator!=(HeapType const &) const; - void update(handle_type, const_reference); - void update(handle_type); - void increase(handle_type, const_reference); - void increase(handle_type); - void decrease(handle_type, const_reference); - void decrease(handle_type); - void erase(handle_type); - void pop(void); - void swap(d_ary_heap &); - const_iterator begin(void) const; - iterator begin(void); - iterator end(void); - const_iterator end(void) const; - ordered_iterator ordered_begin(void) const; - ordered_iterator ordered_end(void) const; - void reserve(size_type); - value_compare const & value_comp(void) const; + mpl::if_c< is_mutable, handle_type, void >::type emplace(Args &&...); + template<typename HeapType> bool operator<(HeapType const &) const; + template<typename HeapType> bool operator>(HeapType const &) const; + template<typename HeapType> bool operator>=(HeapType const &) const; + template<typename HeapType> bool operator<=(HeapType const &) const; + template<typename HeapType> bool operator==(HeapType const &) const; + template<typename HeapType> bool operator!=(HeapType const &) const; + void update(handle_type, const_reference); + void update(handle_type); + void increase(handle_type, const_reference); + void increase(handle_type); + void decrease(handle_type, const_reference); + void decrease(handle_type); + void erase(handle_type); + void pop(void); + void swap(d_ary_heap &); + const_iterator begin(void) const; + iterator begin(void); + iterator end(void); + const_iterator end(void) const; + ordered_iterator ordered_begin(void) const; + ordered_iterator ordered_end(void) const; + void reserve(size_type); + value_compare const & value_comp(void) const; - // public static functions - static handle_type s_handle_from_iterator(iterator const &); + // public static functions + static handle_type s_handle_from_iterator(iterator const &); // public data members static const bool constant_time_size; @@ -102,7 +102,7 @@ static const bool is_stable; };
    -

    Description

    +

    Description

    This class implements an immutable priority queue. Internally, the d-ary heap is represented as dynamically sized array (std::vector), that directly stores the values.

    The template parameter T is the type to be managed by the container. The user can specify additional options and if no options are provided default options are used.

    The container supports the following options:

    @@ -117,7 +117,7 @@

    -

    +

    d_ary_heap public types

    @@ -128,215 +128,215 @@
    -

    +

    d_ary_heap public construct/copy/destruct

    1. -
      explicit d_ary_heap(value_compare const & cmp = value_compare());
      +
      explicit d_ary_heap(value_compare const & cmp = value_compare());

      Effects: constructs an empty priority queue.

      Complexity: Constant.

    2. -
      d_ary_heap(d_ary_heap const & rhs);
      +
      d_ary_heap(d_ary_heap const & rhs);

      Effects: copy-constructs priority queue from rhs.

      Complexity: Linear.

    3. -
      d_ary_heap(d_ary_heap && rhs);
      +
      d_ary_heap(d_ary_heap && rhs);

      Effects: C++11-style move constructor.

      Complexity: Constant.

      Note: Only available, if BOOST_NO_CXX11_RVALUE_REFERENCES is not defined

    4. -
      d_ary_heap & operator=(d_ary_heap && rhs);
      +
      d_ary_heap & operator=(d_ary_heap && rhs);

      Effects: C++11-style move assignment.

      Complexity: Constant.

      Note: Only available, if BOOST_NO_CXX11_RVALUE_REFERENCES is not defined

    5. -
      d_ary_heap & operator=(d_ary_heap const & rhs);
      +
      d_ary_heap & operator=(d_ary_heap const & rhs);

      Effects: Assigns priority queue from rhs.

      Complexity: Linear.

    -

    -d_ary_heap public member functions

    +

    +d_ary_heap public member functions

    1. -
      bool empty(void) const;
      +
      bool empty(void) const;

      Effects: Returns true, if the priority queue contains no elements.

      Complexity: Constant.

    2. -
      size_type size(void) const;
      +
      size_type size(void) const;

      Effects: Returns the number of elements contained in the priority queue.

      Complexity: Constant.

    3. -
      size_type max_size(void) const;
      +
      size_type max_size(void) const;

      Effects: Returns the maximum number of elements the priority queue can contain.

      Complexity: Constant.

    4. -
      void clear(void);
      +
      void clear(void);

      Effects: Removes all elements from the priority queue.

      Complexity: Linear.

    5. -
      allocator_type get_allocator(void) const;
      +
      allocator_type get_allocator(void) const;

      Effects: Returns allocator.

      Complexity: Constant.

    6. -
      value_type const & top(void) const;
      +
      value_type const & top(void) const;

      Effects: Returns a const_reference to the maximum element.

      Complexity: Constant.

    7. -
      mpl::if_c< is_mutable, handle_type, void >::type push(value_type const & v);
      +
      mpl::if_c< is_mutable, handle_type, void >::type push(value_type const & v);

      Effects: Adds a new element to the priority queue.

      Complexity: Logarithmic (amortized). Linear (worst case). 

    8. template<class... Args> 
-  mpl::if_c< is_mutable, handle_type, void >::type emplace(Args &&... args);
      + mpl::if_c< is_mutable, handle_type, void >::type emplace(Args &&... args);

      Effects: Adds a new element to the priority queue. The element is directly constructed in-place.

      Complexity: Logarithmic (amortized). Linear (worst case).

    9. -
      template<typename HeapType> bool operator<(HeapType const & rhs) const;
      +
      template<typename HeapType> bool operator<(HeapType const & rhs) const;

      Returns: Element-wise comparison of heap data structures

      Requirement: the value_compare object of both heaps must match.

    10. -
      template<typename HeapType> bool operator>(HeapType const & rhs) const;
      +
      template<typename HeapType> bool operator>(HeapType const & rhs) const;

      Returns: Element-wise comparison of heap data structures

      Requirement: the value_compare object of both heaps must match.

    11. -
      template<typename HeapType> bool operator>=(HeapType const & rhs) const;
      +
      template<typename HeapType> bool operator>=(HeapType const & rhs) const;

      Returns: Element-wise comparison of heap data structures

      Requirement: the value_compare object of both heaps must match.

    12. -
      template<typename HeapType> bool operator<=(HeapType const & rhs) const;
      +
      template<typename HeapType> bool operator<=(HeapType const & rhs) const;

      Returns: Element-wise comparison of heap data structures

      Requirement: the value_compare object of both heaps must match.

    13. -
      template<typename HeapType> bool operator==(HeapType const & rhs) const;
      Equivalent comparison Returns: True, if both heap data structures are equivalent.

      Requirement: the value_compare object of both heaps must match.

      +
      template<typename HeapType> bool operator==(HeapType const & rhs) const;
      Equivalent comparison Returns: True, if both heap data structures are equivalent.

      Requirement: the value_compare object of both heaps must match.

    14. -
      template<typename HeapType> bool operator!=(HeapType const & rhs) const;
      Equivalent comparison Returns: True, if both heap data structures are not equivalent.

      Requirement: the value_compare object of both heaps must match.

      +
      template<typename HeapType> bool operator!=(HeapType const & rhs) const;
      Equivalent comparison Returns: True, if both heap data structures are not equivalent.

      Requirement: the value_compare object of both heaps must match.

    15. -
      void update(handle_type handle, const_reference v);
      +
      void update(handle_type handle, const_reference v);

      Effects: Assigns v to the element handled by handle & updates the priority queue.

      Complexity: Logarithmic.

      Requirement: data structure must be configured as mutable

    16. -
      void update(handle_type handle);
      +
      void update(handle_type handle);

      Effects: Updates the heap after the element handled by handle has been changed.

      Complexity: Logarithmic.

      Note: If this is not called, after a handle has been updated, the behavior of the data structure is undefined!

      Requirement: data structure must be configured as mutable

    17. -
      void increase(handle_type handle, const_reference v);
      +
      void increase(handle_type handle, const_reference v);

      Effects: Assigns v to the element handled by handle & updates the priority queue.

      Complexity: Logarithmic.

      Note: The new value is expected to be greater than the current one

      Requirement: data structure must be configured as mutable

    18. -
      void increase(handle_type handle);
      +
      void increase(handle_type handle);

      Effects: Updates the heap after the element handled by handle has been changed.

      Complexity: Logarithmic.

      Note: The new value is expected to be greater than the current one. If this is not called, after a handle has been updated, the behavior of the data structure is undefined!

      Requirement: data structure must be configured as mutable

    19. -
      void decrease(handle_type handle, const_reference v);
      +
      void decrease(handle_type handle, const_reference v);

      Effects: Assigns v to the element handled by handle & updates the priority queue.

      Complexity: Logarithmic.

      Note: The new value is expected to be less than the current one

      Requirement: data structure must be configured as mutable

    20. -
      void decrease(handle_type handle);
      +
      void decrease(handle_type handle);

      Effects: Updates the heap after the element handled by handle has been changed.

      Complexity: Logarithmic.

      Note: The new value is expected to be less than the current one. If this is not called, after a handle has been updated, the behavior of the data structure is undefined!

      Requirement: data structure must be configured as mutable

    21. -
      void erase(handle_type handle);
      +
      void erase(handle_type handle);

      Effects: Removes the element handled by handle from the priority_queue.

      Complexity: Logarithmic.

      Requirement: data structure must be configured as mutable

    22. -
      void pop(void);
      +
      void pop(void);

      Effects: Removes the top element from the priority queue.

      Complexity: Logarithmic (amortized). Linear (worst case).

    23. -
      void swap(d_ary_heap & rhs);
      +
      void swap(d_ary_heap & rhs);

      Effects: Swaps two priority queues.

      Complexity: Constant.

    24. -
      const_iterator begin(void) const;
      +
      const_iterator begin(void) const;

      Effects: Returns an iterator to the first element contained in the priority queue.

      Complexity: Constant.

    25. -
      iterator begin(void);
      +
      iterator begin(void);

      Effects: Returns an iterator to the first element contained in the priority queue.

      Complexity: Constant.

    26. -
      iterator end(void);
      +
      iterator end(void);

      Effects: Returns an iterator to the end of the priority queue.

      Complexity: Constant.

    27. -
      const_iterator end(void) const;
      +
      const_iterator end(void) const;

      Effects: Returns an iterator to the end of the priority queue.

      Complexity: Constant.

    28. -
      ordered_iterator ordered_begin(void) const;
      +
      ordered_iterator ordered_begin(void) const;

      Effects: Returns an ordered iterator to the first element contained in the priority queue.

      Note: Ordered iterators traverse the priority queue in heap order.

    29. -
      ordered_iterator ordered_end(void) const;
      +
      ordered_iterator ordered_end(void) const;

      Effects: Returns an ordered iterator to the end of the priority queue.

      Note: Ordered iterators traverse the priority queue in heap order.

    30. -
      void reserve(size_type element_count);
      +
      void reserve(size_type element_count);

      Effects: Reserves memory for element_count elements

      Complexity: Linear.

      Node: Invalidates iterators

    31. -
      value_compare const & value_comp(void) const;
      +
      value_compare const & value_comp(void) const;

      Effect: Returns the value_compare object used by the priority queue

    -

    -d_ary_heap public static functions

    +

    +d_ary_heap public static functions

    1. -
      static handle_type s_handle_from_iterator(iterator const & it);
      +
      static handle_type s_handle_from_iterator(iterator const & it);

      Effects: Casts an iterator to a node handle.

      Complexity: Constant.

      Requirement: data structure must be configured as mutable

      diff --git a/doc/html/boost/heap/fibonacci_heap.html b/doc/html/boost/heap/fibonacci_heap.html index da363eb30a..0802a6fe6b 100644 --- a/doc/html/boost/heap/fibonacci_heap.html +++ b/doc/html/boost/heap/fibonacci_heap.html @@ -51,48 +51,48 @@ typedef implementation_defined::handle_type handle_type; // construct/copy/destruct - explicit fibonacci_heap(value_compare const & = value_compare()); - fibonacci_heap(fibonacci_heap const &); - fibonacci_heap(fibonacci_heap &&); - fibonacci_heap & operator=(fibonacci_heap &&); - fibonacci_heap & operator=(fibonacci_heap const &); - ~fibonacci_heap(void); + explicit fibonacci_heap(value_compare const & = value_compare()); + fibonacci_heap(fibonacci_heap const &); + fibonacci_heap(fibonacci_heap &&); + fibonacci_heap & operator=(fibonacci_heap &&); + fibonacci_heap & operator=(fibonacci_heap const &); + ~fibonacci_heap(void); - // public member functions - bool empty(void) const; - size_type size(void) const; - size_type max_size(void) const; - void clear(void); - allocator_type get_allocator(void) const; - void swap(fibonacci_heap &); - value_type const & top(void) const; - handle_type push(value_type const &); - template<class... Args> handle_type emplace(Args &&...); - void pop(void); - void update(handle_type, const_reference); - void update_lazy(handle_type, const_reference); - void update(handle_type); - void update_lazy(handle_type); - void increase(handle_type, const_reference); - void increase(handle_type); - void decrease(handle_type, const_reference); - void decrease(handle_type); - void erase(handle_type const &); - iterator begin(void) const; - iterator end(void) const; - ordered_iterator ordered_begin(void) const; - ordered_iterator ordered_end(void) const; - void merge(fibonacci_heap &); - value_compare const & value_comp(void) const; - template<typename HeapType> bool operator<(HeapType const &) const; - template<typename HeapType> bool operator>(HeapType const &) const; - template<typename HeapType> bool operator>=(HeapType const &) const; - template<typename HeapType> bool operator<=(HeapType const &) const; - template<typename HeapType> bool operator==(HeapType const &) const; - template<typename HeapType> bool operator!=(HeapType const &) const; + // public member functions + bool empty(void) const; + size_type size(void) const; + size_type max_size(void) const; + void clear(void); + allocator_type get_allocator(void) const; + void swap(fibonacci_heap &); + value_type const & top(void) const; + handle_type push(value_type const &); + template<class... Args> handle_type emplace(Args &&...); + void pop(void); + void update(handle_type, const_reference); + void update_lazy(handle_type, const_reference); + void update(handle_type); + void update_lazy(handle_type); + void increase(handle_type, const_reference); + void increase(handle_type); + void decrease(handle_type, const_reference); + void decrease(handle_type); + void erase(handle_type const &); + iterator begin(void) const; + iterator end(void) const; + ordered_iterator ordered_begin(void) const; + ordered_iterator ordered_end(void) const; + void merge(fibonacci_heap &); + value_compare const & value_comp(void) const; + template<typename HeapType> bool operator<(HeapType const &) const; + template<typename HeapType> bool operator>(HeapType const &) const; + template<typename HeapType> bool operator>=(HeapType const &) const; + template<typename HeapType> bool operator<=(HeapType const &) const; + template<typename HeapType> bool operator==(HeapType const &) const; + template<typename HeapType> bool operator!=(HeapType const &) const; - // public static functions - static handle_type s_handle_from_iterator(iterator const &); + // public static functions + static handle_type s_handle_from_iterator(iterator const &); // public data members static const bool constant_time_size; @@ -102,7 +102,7 @@ static const bool has_reserve; };
    -

    Description

    +

    Description

    The template parameter T is the type to be managed by the container. The user can specify additional options and if no options are provided default options are used.

    The container supports the following options:

      @@ -115,7 +115,7 @@

      -

      +

      fibonacci_heap public types

      @@ -126,209 +126,209 @@
    -

    +

    fibonacci_heap public construct/copy/destruct

    1. -
      explicit fibonacci_heap(value_compare const & cmp = value_compare());
      +
      explicit fibonacci_heap(value_compare const & cmp = value_compare());

      Effects: constructs an empty priority queue.

      Complexity: Constant.

    2. -
      fibonacci_heap(fibonacci_heap const & rhs);
      +
      fibonacci_heap(fibonacci_heap const & rhs);

      Effects: copy-constructs priority queue from rhs.

      Complexity: Linear.

    3. -
      fibonacci_heap(fibonacci_heap && rhs);
      +
      fibonacci_heap(fibonacci_heap && rhs);

      Effects: C++11-style move constructor.

      Complexity: Constant.

      Note: Only available, if BOOST_NO_CXX11_RVALUE_REFERENCES is not defined

    4. -
      fibonacci_heap & operator=(fibonacci_heap && rhs);
      +
      fibonacci_heap & operator=(fibonacci_heap && rhs);

      Effects: C++11-style move assignment.

      Complexity: Constant.

      Note: Only available, if BOOST_NO_CXX11_RVALUE_REFERENCES is not defined

    5. -
      fibonacci_heap & operator=(fibonacci_heap const & rhs);
      +
      fibonacci_heap & operator=(fibonacci_heap const & rhs);

      Effects: Assigns priority queue from rhs.

      Complexity: Linear.

      6. -
    6. ~fibonacci_heap(void);
      7. +
    7. ~fibonacci_heap(void);
    -

    -fibonacci_heap public member functions

    +

    +fibonacci_heap public member functions

    1. -
      bool empty(void) const;
      +
      bool empty(void) const;

      Effects: Returns true, if the priority queue contains no elements.

      Complexity: Constant.

    2. -
      size_type size(void) const;
      +
      size_type size(void) const;

      Effects: Returns the number of elements contained in the priority queue.

      Complexity: Constant.

    3. -
      size_type max_size(void) const;
      +
      size_type max_size(void) const;

      Effects: Returns the maximum number of elements the priority queue can contain.

      Complexity: Constant.

    4. -
      void clear(void);
      +
      void clear(void);

      Effects: Removes all elements from the priority queue.

      Complexity: Linear.

    5. -
      allocator_type get_allocator(void) const;
      +
      allocator_type get_allocator(void) const;

      Effects: Returns allocator.

      Complexity: Constant.

    6. -
      void swap(fibonacci_heap & rhs);
      +
      void swap(fibonacci_heap & rhs);

      Effects: Swaps two priority queues.

      Complexity: Constant.

    7. -
      value_type const & top(void) const;
      +
      value_type const & top(void) const;

      Effects: Returns a const_reference to the maximum element.

      Complexity: Constant.

    8. -
      handle_type push(value_type const & v);
      +
      handle_type push(value_type const & v);

      Effects: Adds a new element to the priority queue. Returns handle to element

      Complexity: Constant.

      Note: Does not invalidate iterators.

    9. -
      template<class... Args> handle_type emplace(Args &&... args);
      +
      template<class... Args> handle_type emplace(Args &&... args);

      Effects: Adds a new element to the priority queue. The element is directly constructed in-place. Returns handle to element.

      Complexity: Constant.

      Note: Does not invalidate iterators.

    10. -
      void pop(void);
      +
      void pop(void);

      Effects: Removes the top element from the priority queue.

      Complexity: Logarithmic (amortized). Linear (worst case).

    11. -
      void update(handle_type handle, const_reference v);
      +
      void update(handle_type handle, const_reference v);

      Effects: Assigns v to the element handled by handle & updates the priority queue.

      Complexity: Logarithmic if current value < v, Constant otherwise.

    12. -
      void update_lazy(handle_type handle, const_reference v);
      +
      void update_lazy(handle_type handle, const_reference v);

      Effects: Assigns v to the element handled by handle & updates the priority queue.

      Complexity: Logarithmic if current value < v, Constant otherwise.

      Rationale: The lazy update function is a modification of the traditional update, that just invalidates the iterator to the object referred to by the handle.

    13. -
      void update(handle_type handle);
      +
      void update(handle_type handle);

      Effects: Updates the heap after the element handled by handle has been changed.

      Complexity: Logarithmic.

      Note: If this is not called, after a handle has been updated, the behavior of the data structure is undefined!

    14. -
      void update_lazy(handle_type handle);
      (handle_type handle)

      Effects: Assigns v to the element handled by handle & updates the priority queue.

      +
      void update_lazy(handle_type handle);
      (handle_type handle)

      Effects: Assigns v to the element handled by handle & updates the priority queue.

      Complexity: Logarithmic if current value < v, Constant otherwise. (handle_type handle)

      Rationale: The lazy update function is a modification of the traditional update, that just invalidates the iterator to the object referred to by the handle.

    15. -
      void increase(handle_type handle, const_reference v);
      +
      void increase(handle_type handle, const_reference v);

      Effects: Assigns v to the element handled by handle & updates the priority queue.

      Complexity: Constant.

      Note: The new value is expected to be greater than the current one

    16. -
      void increase(handle_type handle);
      +
      void increase(handle_type handle);

      Effects: Updates the heap after the element handled by handle has been changed.

      Complexity: Constant.

      Note: If this is not called, after a handle has been updated, the behavior of the data structure is undefined!

    17. -
      void decrease(handle_type handle, const_reference v);
      +
      void decrease(handle_type handle, const_reference v);

      Effects: Assigns v to the element handled by handle & updates the priority queue.

      Complexity: Logarithmic.

      Note: The new value is expected to be less than the current one

    18. -
      void decrease(handle_type handle);
      +
      void decrease(handle_type handle);

      Effects: Updates the heap after the element handled by handle has been changed.

      Complexity: Logarithmic.

      Note: The new value is expected to be less than the current one. If this is not called, after a handle has been updated, the behavior of the data structure is undefined!

    19. -
      void erase(handle_type const & handle);
      +
      void erase(handle_type const & handle);

      Effects: Removes the element handled by handle from the priority_queue.

      Complexity: Logarithmic.

    20. -
      iterator begin(void) const;
      +
      iterator begin(void) const;

      Effects: Returns an iterator to the first element contained in the priority queue.

      Complexity: Constant.

    21. -
      iterator end(void) const;
      +
      iterator end(void) const;

      Effects: Returns an iterator to the end of the priority queue.

      Complexity: Constant.

    22. -
      ordered_iterator ordered_begin(void) const;
      +
      ordered_iterator ordered_begin(void) const;

      Effects: Returns an ordered iterator to the first element contained in the priority queue.

      Note: Ordered iterators traverse the priority queue in heap order.

    23. -
      ordered_iterator ordered_end(void) const;
      +
      ordered_iterator ordered_end(void) const;

      Effects: Returns an ordered iterator to the end of the priority queue.

      Note: Ordered iterators traverse the priority queue in heap order.

    24. -
      void merge(fibonacci_heap & rhs);
      +
      void merge(fibonacci_heap & rhs);

      Effects: Merge with priority queue rhs.

      Complexity: Constant.

    25. -
      value_compare const & value_comp(void) const;
      +
      value_compare const & value_comp(void) const;

      Effect: Returns the value_compare object used by the priority queue

    26. -
      template<typename HeapType> bool operator<(HeapType const & rhs) const;
      +
      template<typename HeapType> bool operator<(HeapType const & rhs) const;

      Returns: Element-wise comparison of heap data structures

      Requirement: the value_compare object of both heaps must match.

    27. -
      template<typename HeapType> bool operator>(HeapType const & rhs) const;
      +
      template<typename HeapType> bool operator>(HeapType const & rhs) const;

      Returns: Element-wise comparison of heap data structures

      Requirement: the value_compare object of both heaps must match.

    28. -
      template<typename HeapType> bool operator>=(HeapType const & rhs) const;
      +
      template<typename HeapType> bool operator>=(HeapType const & rhs) const;

      Returns: Element-wise comparison of heap data structures

      Requirement: the value_compare object of both heaps must match.

    29. -
      template<typename HeapType> bool operator<=(HeapType const & rhs) const;
      +
      template<typename HeapType> bool operator<=(HeapType const & rhs) const;

      Returns: Element-wise comparison of heap data structures

      Requirement: the value_compare object of both heaps must match.

    30. -
      template<typename HeapType> bool operator==(HeapType const & rhs) const;
      Equivalent comparison Returns: True, if both heap data structures are equivalent.

      Requirement: the value_compare object of both heaps must match.

      +
      template<typename HeapType> bool operator==(HeapType const & rhs) const;
      Equivalent comparison Returns: True, if both heap data structures are equivalent.

      Requirement: the value_compare object of both heaps must match.

    31. -
      template<typename HeapType> bool operator!=(HeapType const & rhs) const;
      Equivalent comparison Returns: True, if both heap data structures are not equivalent.

      Requirement: the value_compare object of both heaps must match.

      +
      template<typename HeapType> bool operator!=(HeapType const & rhs) const;
      Equivalent comparison Returns: True, if both heap data structures are not equivalent.

      Requirement: the value_compare object of both heaps must match.

    -

    -fibonacci_heap public static functions

    -
    1. static handle_type s_handle_from_iterator(iterator const & it);
    +

    +fibonacci_heap public static functions

    +
    1. static handle_type s_handle_from_iterator(iterator const & it);
    diff --git a/doc/html/boost/heap/heap_merge.html b/doc/html/boost/heap/heap_merge.html index 901a306414..1a1ae2309b 100644 --- a/doc/html/boost/heap/heap_merge.html +++ b/doc/html/boost/heap/heap_merge.html @@ -36,7 +36,7 @@ template<typename Heap1, typename Heap2> void heap_merge(Heap1 & lhs, Heap2 & rhs);
    -

    Description

    +

    Description

    merge rhs into lhs

    Effect: lhs contains all elements that have been part of rhs, rhs is empty.

    diff --git a/doc/html/boost/heap/mutable_.html b/doc/html/boost/heap/mutable_.html index c30bddce67..96c6542095 100644 --- a/doc/html/boost/heap/mutable_.html +++ b/doc/html/boost/heap/mutable_.html @@ -36,7 +36,7 @@ struct mutable_ { };
    -

    Description

    +

    Description

    Certain heaps need to be configured specifically do be mutable.

    diff --git a/doc/html/boost/heap/pairing_heap.html b/doc/html/boost/heap/pairing_heap.html index 76e63d712e..ff42f3dcc1 100644 --- a/doc/html/boost/heap/pairing_heap.html +++ b/doc/html/boost/heap/pairing_heap.html @@ -51,46 +51,46 @@ typedef implementation_defined::handle_type handle_type; // construct/copy/destruct - explicit pairing_heap(value_compare const & = value_compare()); - pairing_heap(pairing_heap const &); - pairing_heap(pairing_heap &&); - pairing_heap & operator=(pairing_heap &&); - pairing_heap & operator=(pairing_heap const &); - ~pairing_heap(void); + explicit pairing_heap(value_compare const & = value_compare()); + pairing_heap(pairing_heap const &); + pairing_heap(pairing_heap &&); + pairing_heap & operator=(pairing_heap &&); + pairing_heap & operator=(pairing_heap const &); + ~pairing_heap(void); - // public member functions - bool empty(void) const; - size_type size(void) const; - size_type max_size(void) const; - void clear(void); - allocator_type get_allocator(void) const; - void swap(pairing_heap &); - const_reference top(void) const; - handle_type push(value_type const &); - template<class... Args> handle_type emplace(Args &&...); - void pop(void); - void update(handle_type, const_reference); - void update(handle_type); - void increase(handle_type, const_reference); - void increase(handle_type); - void decrease(handle_type, const_reference); - void decrease(handle_type); - void erase(handle_type); - iterator begin(void) const; - iterator end(void) const; - ordered_iterator ordered_begin(void) const; - ordered_iterator ordered_end(void) const; - void merge(pairing_heap &); - value_compare const & value_comp(void) const; - template<typename HeapType> bool operator<(HeapType const &) const; - template<typename HeapType> bool operator>(HeapType const &) const; - template<typename HeapType> bool operator>=(HeapType const &) const; - template<typename HeapType> bool operator<=(HeapType const &) const; - template<typename HeapType> bool operator==(HeapType const &) const; - template<typename HeapType> bool operator!=(HeapType const &) const; + // public member functions + bool empty(void) const; + size_type size(void) const; + size_type max_size(void) const; + void clear(void); + allocator_type get_allocator(void) const; + void swap(pairing_heap &); + const_reference top(void) const; + handle_type push(value_type const &); + template<class... Args> handle_type emplace(Args &&...); + void pop(void); + void update(handle_type, const_reference); + void update(handle_type); + void increase(handle_type, const_reference); + void increase(handle_type); + void decrease(handle_type, const_reference); + void decrease(handle_type); + void erase(handle_type); + iterator begin(void) const; + iterator end(void) const; + ordered_iterator ordered_begin(void) const; + ordered_iterator ordered_end(void) const; + void merge(pairing_heap &); + value_compare const & value_comp(void) const; + template<typename HeapType> bool operator<(HeapType const &) const; + template<typename HeapType> bool operator>(HeapType const &) const; + template<typename HeapType> bool operator>=(HeapType const &) const; + template<typename HeapType> bool operator<=(HeapType const &) const; + template<typename HeapType> bool operator==(HeapType const &) const; + template<typename HeapType> bool operator!=(HeapType const &) const; - // public static functions - static handle_type s_handle_from_iterator(iterator const &); + // public static functions + static handle_type s_handle_from_iterator(iterator const &); // public data members static const bool constant_time_size; @@ -100,7 +100,7 @@ static const bool has_reserve; };
    -

    Description

    +

    Description

    Pairing heaps are self-adjusting binary heaps. Although design and implementation are rather simple, the complexity analysis is yet unsolved. For details, consult:

    Pettie, Seth (2005), "Towards a final analysis of pairing heaps", Proc. 46th Annual IEEE Symposium on Foundations of Computer Science, pp. 174-183

    The template parameter T is the type to be managed by the container. The user can specify additional options and if no options are provided default options are used.

    @@ -115,7 +115,7 @@

    -

    +

    pairing_heap public types

    @@ -126,196 +126,196 @@
    -

    +

    pairing_heap public construct/copy/destruct

    1. -
      explicit pairing_heap(value_compare const & cmp = value_compare());
      +
      explicit pairing_heap(value_compare const & cmp = value_compare());

      Effects: constructs an empty priority queue.

      Complexity: Constant.

    2. -
      pairing_heap(pairing_heap const & rhs);
      +
      pairing_heap(pairing_heap const & rhs);

      Effects: copy-constructs priority queue from rhs.

      Complexity: Linear.

    3. -
      pairing_heap(pairing_heap && rhs);
      +
      pairing_heap(pairing_heap && rhs);

      Effects: C++11-style move constructor.

      Complexity: Constant.

      Note: Only available, if BOOST_NO_CXX11_RVALUE_REFERENCES is not defined

    4. -
      pairing_heap & operator=(pairing_heap && rhs);
      +
      pairing_heap & operator=(pairing_heap && rhs);

      Effects: C++11-style move assignment.

      Complexity: Constant.

      Note: Only available, if BOOST_NO_CXX11_RVALUE_REFERENCES is not defined

    5. -
      pairing_heap & operator=(pairing_heap const & rhs);
      +
      pairing_heap & operator=(pairing_heap const & rhs);

      Effects: Assigns priority queue from rhs.

      Complexity: Linear.

      6. -
    6. ~pairing_heap(void);
      7. +
    7. ~pairing_heap(void);
    -

    -pairing_heap public member functions

    +

    +pairing_heap public member functions

    1. -
      bool empty(void) const;
      +
      bool empty(void) const;

      Effects: Returns true, if the priority queue contains no elements.

      Complexity: Constant.

    2. -
      size_type size(void) const;
      +
      size_type size(void) const;

      Effects: Returns the number of elements contained in the priority queue.

      Complexity: Constant, if configured with constant_time_size<true>, otherwise linear.

    3. -
      size_type max_size(void) const;
      +
      size_type max_size(void) const;

      Effects: Returns the maximum number of elements the priority queue can contain.

      Complexity: Constant.

    4. -
      void clear(void);
      +
      void clear(void);

      Effects: Removes all elements from the priority queue.

      Complexity: Linear.

    5. -
      allocator_type get_allocator(void) const;
      +
      allocator_type get_allocator(void) const;

      Effects: Returns allocator.

      Complexity: Constant.

    6. -
      void swap(pairing_heap & rhs);
      +
      void swap(pairing_heap & rhs);

      Effects: Swaps two priority queues.

      Complexity: Constant.

    7. -
      const_reference top(void) const;
      +
      const_reference top(void) const;

      Effects: Returns a const_reference to the maximum element.

      Complexity: Constant.

    8. -
      handle_type push(value_type const & v);
      +
      handle_type push(value_type const & v);

      Effects: Adds a new element to the priority queue. Returns handle to element

      Complexity: 2**2*log(log(N)) (amortized).

    9. -
      template<class... Args> handle_type emplace(Args &&... args);
      +
      template<class... Args> handle_type emplace(Args &&... args);

      Effects: Adds a new element to the priority queue. The element is directly constructed in-place. Returns handle to element.

      Complexity: 2**2*log(log(N)) (amortized).

    10. -
      void pop(void);
      +
      void pop(void);

      Effects: Removes the top element from the priority queue.

      Complexity: Logarithmic (amortized).

    11. -
      void update(handle_type handle, const_reference v);
      +
      void update(handle_type handle, const_reference v);

      Effects: Assigns v to the element handled by handle & updates the priority queue.

      Complexity: 2**2*log(log(N)) (amortized).

    12. -
      void update(handle_type handle);
      +
      void update(handle_type handle);

      Effects: Updates the heap after the element handled by handle has been changed.

      Complexity: 2**2*log(log(N)) (amortized).

      Note: If this is not called, after a handle has been updated, the behavior of the data structure is undefined!

    13. -
      void increase(handle_type handle, const_reference v);
      +
      void increase(handle_type handle, const_reference v);

      Effects: Assigns v to the element handled by handle & updates the priority queue.

      Complexity: 2**2*log(log(N)) (amortized).

      Note: The new value is expected to be greater than the current one

    14. -
      void increase(handle_type handle);
      +
      void increase(handle_type handle);

      Effects: Updates the heap after the element handled by handle has been changed.

      Complexity: 2**2*log(log(N)) (amortized).

      Note: If this is not called, after a handle has been updated, the behavior of the data structure is undefined!

    15. -
      void decrease(handle_type handle, const_reference v);
      +
      void decrease(handle_type handle, const_reference v);

      Effects: Assigns v to the element handled by handle & updates the priority queue.

      Complexity: 2**2*log(log(N)) (amortized).

      Note: The new value is expected to be less than the current one

    16. -
      void decrease(handle_type handle);
      +
      void decrease(handle_type handle);

      Effects: Updates the heap after the element handled by handle has been changed.

      Complexity: 2**2*log(log(N)) (amortized).

      Note: The new value is expected to be less than the current one. If this is not called, after a handle has been updated, the behavior of the data structure is undefined!

    17. -
      void erase(handle_type handle);
      +
      void erase(handle_type handle);

      Effects: Removes the element handled by handle from the priority_queue.

      Complexity: 2**2*log(log(N)) (amortized).

    18. -
      iterator begin(void) const;
      +
      iterator begin(void) const;

      Effects: Returns an iterator to the first element contained in the priority queue.

      Complexity: Constant.

    19. -
      iterator end(void) const;
      +
      iterator end(void) const;

      Effects: Returns an iterator to the end of the priority queue.

      Complexity: Constant.

    20. -
      ordered_iterator ordered_begin(void) const;
      +
      ordered_iterator ordered_begin(void) const;

      Effects: Returns an ordered iterator to the first element contained in the priority queue.

      Note: Ordered iterators traverse the priority queue in heap order.

    21. -
      ordered_iterator ordered_end(void) const;
      +
      ordered_iterator ordered_end(void) const;

      Effects: Returns an ordered iterator to the first element contained in the priority queue.

      Note: Ordered iterators traverse the priority queue in heap order.

    22. -
      void merge(pairing_heap & rhs);
      +
      void merge(pairing_heap & rhs);

      Effects: Merge all elements from rhs into this

      Complexity: 2**2*log(log(N)) (amortized).

    23. -
      value_compare const & value_comp(void) const;
      +
      value_compare const & value_comp(void) const;

      Effect: Returns the value_compare object used by the priority queue

    24. -
      template<typename HeapType> bool operator<(HeapType const & rhs) const;
      +
      template<typename HeapType> bool operator<(HeapType const & rhs) const;

      Returns: Element-wise comparison of heap data structures

      Requirement: the value_compare object of both heaps must match.

    25. -
      template<typename HeapType> bool operator>(HeapType const & rhs) const;
      +
      template<typename HeapType> bool operator>(HeapType const & rhs) const;

      Returns: Element-wise comparison of heap data structures

      Requirement: the value_compare object of both heaps must match.

    26. -
      template<typename HeapType> bool operator>=(HeapType const & rhs) const;
      +
      template<typename HeapType> bool operator>=(HeapType const & rhs) const;

      Returns: Element-wise comparison of heap data structures

      Requirement: the value_compare object of both heaps must match.

    27. -
      template<typename HeapType> bool operator<=(HeapType const & rhs) const;
      +
      template<typename HeapType> bool operator<=(HeapType const & rhs) const;

      Returns: Element-wise comparison of heap data structures

      Requirement: the value_compare object of both heaps must match.

    28. -
      template<typename HeapType> bool operator==(HeapType const & rhs) const;
      Equivalent comparison Returns: True, if both heap data structures are equivalent.

      Requirement: the value_compare object of both heaps must match.

      +
      template<typename HeapType> bool operator==(HeapType const & rhs) const;
      Equivalent comparison Returns: True, if both heap data structures are equivalent.

      Requirement: the value_compare object of both heaps must match.

    29. -
      template<typename HeapType> bool operator!=(HeapType const & rhs) const;
      Equivalent comparison Returns: True, if both heap data structures are not equivalent.

      Requirement: the value_compare object of both heaps must match.

      +
      template<typename HeapType> bool operator!=(HeapType const & rhs) const;
      Equivalent comparison Returns: True, if both heap data structures are not equivalent.

      Requirement: the value_compare object of both heaps must match.

    -

    -pairing_heap public static functions

    -
    1. static handle_type s_handle_from_iterator(iterator const & it);
    +

    +pairing_heap public static functions

    +
    1. static handle_type s_handle_from_iterator(iterator const & it);
    diff --git a/doc/html/boost/heap/priority_queue.html b/doc/html/boost/heap/priority_queue.html index 9ff5f430d1..ee1aeccb60 100644 --- a/doc/html/boost/heap/priority_queue.html +++ b/doc/html/boost/heap/priority_queue.html @@ -49,33 +49,33 @@ typedef implementation_defined::const_iterator const_iterator; // construct/copy/destruct - explicit priority_queue(value_compare const & = value_compare()); - priority_queue(priority_queue const &); - priority_queue(priority_queue &&); - priority_queue & operator=(priority_queue &&); - priority_queue & operator=(priority_queue const &); + explicit priority_queue(value_compare const & = value_compare()); + priority_queue(priority_queue const &); + priority_queue(priority_queue &&); + priority_queue & operator=(priority_queue &&); + priority_queue & operator=(priority_queue const &); - // public member functions - bool empty(void) const; - size_type size(void) const; - size_type max_size(void) const; - void clear(void); - allocator_type get_allocator(void) const; - const_reference top(void) const; - void push(value_type const &); - template<class... Args> void emplace(Args &&...); - void pop(void); - void swap(priority_queue &); - iterator begin(void) const; - iterator end(void) const; - void reserve(size_type); - value_compare const & value_comp(void) const; - template<typename HeapType> bool operator<(HeapType const &) const; - template<typename HeapType> bool operator>(HeapType const &) const; - template<typename HeapType> bool operator>=(HeapType const &) const; - template<typename HeapType> bool operator<=(HeapType const &) const; - template<typename HeapType> bool operator==(HeapType const &) const; - template<typename HeapType> bool operator!=(HeapType const &) const; + // public member functions + bool empty(void) const; + size_type size(void) const; + size_type max_size(void) const; + void clear(void); + allocator_type get_allocator(void) const; + const_reference top(void) const; + void push(value_type const &); + template<class... Args> void emplace(Args &&...); + void pop(void); + void swap(priority_queue &); + iterator begin(void) const; + iterator end(void) const; + void reserve(size_type); + value_compare const & value_comp(void) const; + template<typename HeapType> bool operator<(HeapType const &) const; + template<typename HeapType> bool operator>(HeapType const &) const; + template<typename HeapType> bool operator>=(HeapType const &) const; + template<typename HeapType> bool operator<=(HeapType const &) const; + template<typename HeapType> bool operator==(HeapType const &) const; + template<typename HeapType> bool operator!=(HeapType const &) const; // public data members static const bool constant_time_size; @@ -85,7 +85,7 @@ static const bool has_reserve; };
    -

    Description

    +

    Description

    The priority_queue class is a wrapper for the stl heap functions.
    The template parameter T is the type to be managed by the container. The user can specify additional options and if no options are provided default options are used.

    The container supports the following options:

    @@ -98,7 +98,7 @@

    -

    +

    priority_queue public types

    @@ -109,139 +109,139 @@
    -

    +

    priority_queue public construct/copy/destruct

    1. -
      explicit priority_queue(value_compare const & cmp = value_compare());
      +
      explicit priority_queue(value_compare const & cmp = value_compare());

      Effects: constructs an empty priority queue.

      Complexity: Constant.

    2. -
      priority_queue(priority_queue const & rhs);
      +
      priority_queue(priority_queue const & rhs);

      Effects: copy-constructs priority queue from rhs.

      Complexity: Linear.

    3. -
      priority_queue(priority_queue && rhs);
      +
      priority_queue(priority_queue && rhs);

      Effects: C++11-style move constructor.

      Complexity: Constant.

      Note: Only available, if BOOST_NO_CXX11_RVALUE_REFERENCES is not defined

    4. -
      priority_queue & operator=(priority_queue && rhs);
      +
      priority_queue & operator=(priority_queue && rhs);

      Effects: C++11-style move assignment.

      Complexity: Constant.

      Note: Only available, if BOOST_NO_CXX11_RVALUE_REFERENCES is not defined

    5. -
      priority_queue & operator=(priority_queue const & rhs);
      +
      priority_queue & operator=(priority_queue const & rhs);

      Effects: Assigns priority queue from rhs.

      Complexity: Linear.

    -

    -priority_queue public member functions

    +

    +priority_queue public member functions

    1. -
      bool empty(void) const;
      +
      bool empty(void) const;

      Effects: Returns true, if the priority queue contains no elements.

      Complexity: Constant.

    2. -
      size_type size(void) const;
      +
      size_type size(void) const;

      Effects: Returns the number of elements contained in the priority queue.

      Complexity: Constant.

    3. -
      size_type max_size(void) const;
      +
      size_type max_size(void) const;

      Effects: Returns the maximum number of elements the priority queue can contain.

      Complexity: Constant.

    4. -
      void clear(void);
      +
      void clear(void);

      Effects: Removes all elements from the priority queue.

      Complexity: Linear.

    5. -
      allocator_type get_allocator(void) const;
      +
      allocator_type get_allocator(void) const;

      Effects: Returns allocator.

      Complexity: Constant.

    6. -
      const_reference top(void) const;
      +
      const_reference top(void) const;

      Effects: Returns a const_reference to the maximum element.

      Complexity: Constant.

    7. -
      void push(value_type const & v);
      +
      void push(value_type const & v);

      Effects: Adds a new element to the priority queue.

      Complexity: Logarithmic (amortized). Linear (worst case).

    8. -
      template<class... Args> void emplace(Args &&... args);
      +
      template<class... Args> void emplace(Args &&... args);

      Effects: Adds a new element to the priority queue. The element is directly constructed in-place.

      Complexity: Logarithmic (amortized). Linear (worst case).

    9. -
      void pop(void);
      +
      void pop(void);

      Effects: Removes the top element from the priority queue.

      Complexity: Logarithmic (amortized). Linear (worst case).

    10. -
      void swap(priority_queue & rhs);
      +
      void swap(priority_queue & rhs);

      Effects: Swaps two priority queues.

      Complexity: Constant.

    11. -
      iterator begin(void) const;
      +
      iterator begin(void) const;

      Effects: Returns an iterator to the first element contained in the priority queue.

      Complexity: Constant.

    12. -
      iterator end(void) const;
      +
      iterator end(void) const;

      Effects: Returns an iterator to the end of the priority queue.

      Complexity: Constant.

    13. -
      void reserve(size_type element_count);
      +
      void reserve(size_type element_count);

      Effects: Reserves memory for element_count elements

      Complexity: Linear.

      Node: Invalidates iterators

    14. -
      value_compare const & value_comp(void) const;
      +
      value_compare const & value_comp(void) const;

      Effect: Returns the value_compare object used by the priority queue

    15. -
      template<typename HeapType> bool operator<(HeapType const & rhs) const;
      +
      template<typename HeapType> bool operator<(HeapType const & rhs) const;

      Returns: Element-wise comparison of heap data structures

      Requirement: the value_compare object of both heaps must match.

    16. -
      template<typename HeapType> bool operator>(HeapType const & rhs) const;
      +
      template<typename HeapType> bool operator>(HeapType const & rhs) const;

      Returns: Element-wise comparison of heap data structures

      Requirement: the value_compare object of both heaps must match.

    17. -
      template<typename HeapType> bool operator>=(HeapType const & rhs) const;
      +
      template<typename HeapType> bool operator>=(HeapType const & rhs) const;

      Returns: Element-wise comparison of heap data structures

      Requirement: the value_compare object of both heaps must match.

    18. -
      template<typename HeapType> bool operator<=(HeapType const & rhs) const;
      +
      template<typename HeapType> bool operator<=(HeapType const & rhs) const;

      Returns: Element-wise comparison of heap data structures

      Requirement: the value_compare object of both heaps must match.

    19. -
      template<typename HeapType> bool operator==(HeapType const & rhs) const;
      Equivalent comparison Returns: True, if both heap data structures are equivalent.

      Requirement: the value_compare object of both heaps must match.

      +
      template<typename HeapType> bool operator==(HeapType const & rhs) const;
      Equivalent comparison Returns: True, if both heap data structures are equivalent.

      Requirement: the value_compare object of both heaps must match.

    20. -
      template<typename HeapType> bool operator!=(HeapType const & rhs) const;
      Equivalent comparison Returns: True, if both heap data structures are not equivalent.

      Requirement: the value_compare object of both heaps must match.

      +
      template<typename HeapType> bool operator!=(HeapType const & rhs) const;
      Equivalent comparison Returns: True, if both heap data structures are not equivalent.

      Requirement: the value_compare object of both heaps must match.

    diff --git a/doc/html/boost/heap/skew_heap.html b/doc/html/boost/heap/skew_heap.html index 8d0d5554e3..e099ecbc2d 100644 --- a/doc/html/boost/heap/skew_heap.html +++ b/doc/html/boost/heap/skew_heap.html @@ -71,47 +71,47 @@ }; // construct/copy/destruct - explicit skew_heap(value_compare const & = value_compare()); - skew_heap(skew_heap const &); - skew_heap(skew_heap &&); - skew_heap & operator=(skew_heap const &); - skew_heap & operator=(skew_heap &&); - ~skew_heap(void); + explicit skew_heap(value_compare const & = value_compare()); + skew_heap(skew_heap const &); + skew_heap(skew_heap &&); + skew_heap & operator=(skew_heap const &); + skew_heap & operator=(skew_heap &&); + ~skew_heap(void); - // public member functions - mpl::if_c< is_mutable, handle_type, void >::type push(value_type const &); + // public member functions + mpl::if_c< is_mutable, handle_type, void >::type push(value_type const &); template<typename... Args> - mpl::if_c< is_mutable, handle_type, void >::type emplace(Args &&...); - bool empty(void) const; - size_type size(void) const; - size_type max_size(void) const; - void clear(void); - allocator_type get_allocator(void) const; - void swap(skew_heap &); - const_reference top(void) const; - void pop(void); - iterator begin(void) const; - iterator end(void) const; - ordered_iterator ordered_begin(void) const; - ordered_iterator ordered_end(void) const; - void merge(skew_heap &); - value_compare const & value_comp(void) const; - template<typename HeapType> bool operator<(HeapType const &) const; - template<typename HeapType> bool operator>(HeapType const &) const; - template<typename HeapType> bool operator>=(HeapType const &) const; - template<typename HeapType> bool operator<=(HeapType const &) const; - template<typename HeapType> bool operator==(HeapType const &) const; - template<typename HeapType> bool operator!=(HeapType const &) const; - void erase(handle_type); - void update(handle_type, const_reference); - void update(handle_type); - void increase(handle_type, const_reference); - void increase(handle_type); - void decrease(handle_type, const_reference); - void decrease(handle_type); + mpl::if_c< is_mutable, handle_type, void >::type emplace(Args &&...); + bool empty(void) const; + size_type size(void) const; + size_type max_size(void) const; + void clear(void); + allocator_type get_allocator(void) const; + void swap(skew_heap &); + const_reference top(void) const; + void pop(void); + iterator begin(void) const; + iterator end(void) const; + ordered_iterator ordered_begin(void) const; + ordered_iterator ordered_end(void) const; + void merge(skew_heap &); + value_compare const & value_comp(void) const; + template<typename HeapType> bool operator<(HeapType const &) const; + template<typename HeapType> bool operator>(HeapType const &) const; + template<typename HeapType> bool operator>=(HeapType const &) const; + template<typename HeapType> bool operator<=(HeapType const &) const; + template<typename HeapType> bool operator==(HeapType const &) const; + template<typename HeapType> bool operator!=(HeapType const &) const; + void erase(handle_type); + void update(handle_type, const_reference); + void update(handle_type); + void increase(handle_type, const_reference); + void increase(handle_type); + void decrease(handle_type, const_reference); + void decrease(handle_type); - // public static functions - static handle_type s_handle_from_iterator(iterator const &); + // public static functions + static handle_type s_handle_from_iterator(iterator const &); // public data members static const bool constant_time_size; @@ -122,7 +122,7 @@ static const bool is_mutable; };
    -

    Description

    +

    Description

    The template parameter T is the type to be managed by the container. The user can specify additional options and if no options are provided default options are used.

    The container supports the following options:

      @@ -137,7 +137,7 @@

      -

      +

      skew_heap public types

      @@ -148,187 +148,187 @@
    -

    +

    skew_heap public construct/copy/destruct

    1. -
      explicit skew_heap(value_compare const & cmp = value_compare());
      +
      explicit skew_heap(value_compare const & cmp = value_compare());

      Effects: constructs an empty priority queue.

      Complexity: Constant.

    2. -
      skew_heap(skew_heap const & rhs);
      +
      skew_heap(skew_heap const & rhs);

      Effects: copy-constructs priority queue from rhs.

      Complexity: Linear.

    3. -
      skew_heap(skew_heap && rhs);
      +
      skew_heap(skew_heap && rhs);

      Effects: C++11-style move constructor.

      Complexity: Constant.

      Note: Only available, if BOOST_NO_CXX11_RVALUE_REFERENCES is not defined

    4. -
      skew_heap & operator=(skew_heap const & rhs);
      +
      skew_heap & operator=(skew_heap const & rhs);

      Effects: Assigns priority queue from rhs.

      Complexity: Linear.

    5. -
      skew_heap & operator=(skew_heap && rhs);
      +
      skew_heap & operator=(skew_heap && rhs);

      Effects: C++11-style move assignment.

      Complexity: Constant.

      Note: Only available, if BOOST_NO_CXX11_RVALUE_REFERENCES is not defined

      6. -
    6. ~skew_heap(void);
      7. +
    7. ~skew_heap(void);
    -

    -skew_heap public member functions

    +

    +skew_heap public member functions

    1. -
      mpl::if_c< is_mutable, handle_type, void >::type push(value_type const & v);
      +
      mpl::if_c< is_mutable, handle_type, void >::type push(value_type const & v);

      Effects: Adds a new element to the priority queue.

      Complexity: Logarithmic (amortized). 

    2. template<typename... Args> 
-  mpl::if_c< is_mutable, handle_type, void >::type emplace(Args &&... args);
      + mpl::if_c< is_mutable, handle_type, void >::type emplace(Args &&... args);

      Effects: Adds a new element to the priority queue. The element is directly constructed in-place.

      Complexity: Logarithmic (amortized).

    3. -
      bool empty(void) const;
      +
      bool empty(void) const;

      Effects: Returns true, if the priority queue contains no elements.

      Complexity: Constant.

    4. -
      size_type size(void) const;
      +
      size_type size(void) const;

      Effects: Returns the number of elements contained in the priority queue.

      Complexity: Constant, if configured with constant_time_size<true>, otherwise linear.

    5. -
      size_type max_size(void) const;
      +
      size_type max_size(void) const;

      Effects: Returns the maximum number of elements the priority queue can contain.

      Complexity: Constant.

    6. -
      void clear(void);
      +
      void clear(void);

      Effects: Removes all elements from the priority queue.

      Complexity: Linear.

    7. -
      allocator_type get_allocator(void) const;
      +
      allocator_type get_allocator(void) const;

      Effects: Returns allocator.

      Complexity: Constant.

    8. -
      void swap(skew_heap & rhs);
      +
      void swap(skew_heap & rhs);

      Effects: Swaps two priority queues.

      Complexity: Constant.

    9. -
      const_reference top(void) const;
      +
      const_reference top(void) const;

      Effects: Returns a const_reference to the maximum element.

      Complexity: Constant.

    10. -
      void pop(void);
      +
      void pop(void);

      Effects: Removes the top element from the priority queue.

      Complexity: Logarithmic (amortized).

    11. -
      iterator begin(void) const;
      +
      iterator begin(void) const;

      Effects: Returns an iterator to the first element contained in the priority queue.

      Complexity: Constant.

    12. -
      iterator end(void) const;
      +
      iterator end(void) const;

      Effects: Returns an iterator to the end of the priority queue.

      Complexity: Constant.

    13. -
      ordered_iterator ordered_begin(void) const;
      +
      ordered_iterator ordered_begin(void) const;

      Effects: Returns an ordered iterator to the first element contained in the priority queue.

      Note: Ordered iterators traverse the priority queue in heap order.

    14. -
      ordered_iterator ordered_end(void) const;
      +
      ordered_iterator ordered_end(void) const;

      Effects: Returns an ordered iterator to the first element contained in the priority queue.

      Note: Ordered iterators traverse the priority queue in heap order.

    15. -
      void merge(skew_heap & rhs);
      +
      void merge(skew_heap & rhs);

      Effects: Merge all elements from rhs into this

      Complexity: Logarithmic (amortized).

    16. -
      value_compare const & value_comp(void) const;
      +
      value_compare const & value_comp(void) const;

      Effect: Returns the value_compare object used by the priority queue

    17. -
      template<typename HeapType> bool operator<(HeapType const & rhs) const;
      +
      template<typename HeapType> bool operator<(HeapType const & rhs) const;

      Returns: Element-wise comparison of heap data structures

      Requirement: the value_compare object of both heaps must match.

    18. -
      template<typename HeapType> bool operator>(HeapType const & rhs) const;
      +
      template<typename HeapType> bool operator>(HeapType const & rhs) const;

      Returns: Element-wise comparison of heap data structures

      Requirement: the value_compare object of both heaps must match.

    19. -
      template<typename HeapType> bool operator>=(HeapType const & rhs) const;
      +
      template<typename HeapType> bool operator>=(HeapType const & rhs) const;

      Returns: Element-wise comparison of heap data structures

      Requirement: the value_compare object of both heaps must match.

    20. -
      template<typename HeapType> bool operator<=(HeapType const & rhs) const;
      +
      template<typename HeapType> bool operator<=(HeapType const & rhs) const;

      Returns: Element-wise comparison of heap data structures

      Requirement: the value_compare object of both heaps must match.

    21. -
      template<typename HeapType> bool operator==(HeapType const & rhs) const;
      Equivalent comparison Returns: True, if both heap data structures are equivalent.

      Requirement: the value_compare object of both heaps must match.

      +
      template<typename HeapType> bool operator==(HeapType const & rhs) const;
      Equivalent comparison Returns: True, if both heap data structures are equivalent.

      Requirement: the value_compare object of both heaps must match.

    22. -
      template<typename HeapType> bool operator!=(HeapType const & rhs) const;
      Equivalent comparison Returns: True, if both heap data structures are not equivalent.

      Requirement: the value_compare object of both heaps must match.

      +
      template<typename HeapType> bool operator!=(HeapType const & rhs) const;
      Equivalent comparison Returns: True, if both heap data structures are not equivalent.

      Requirement: the value_compare object of both heaps must match.

    23. -
      void erase(handle_type object);
      +
      void erase(handle_type object);

      Effects: Removes the element handled by handle from the priority_queue.

      Complexity: Logarithmic (amortized).

    24. -
      void update(handle_type handle, const_reference v);
      +
      void update(handle_type handle, const_reference v);

      Effects: Assigns v to the element handled by handle & updates the priority queue.

      Complexity: Logarithmic (amortized).

    25. -
      void update(handle_type handle);
      +
      void update(handle_type handle);

      Effects: Updates the heap after the element handled by handle has been changed.

      Complexity: Logarithmic (amortized).

      Note: If this is not called, after a handle has been updated, the behavior of the data structure is undefined!

    26. -
      void increase(handle_type handle, const_reference v);
      +
      void increase(handle_type handle, const_reference v);

      Effects: Assigns v to the element handled by handle & updates the priority queue.

      Complexity: Logarithmic (amortized).

      Note: The new value is expected to be greater than the current one

    27. -
      void increase(handle_type handle);
      +
      void increase(handle_type handle);

      Effects: Updates the heap after the element handled by handle has been changed.

      Complexity: Logarithmic (amortized).

      Note: If this is not called, after a handle has been updated, the behavior of the data structure is undefined!

    28. -
      void decrease(handle_type handle, const_reference v);
      +
      void decrease(handle_type handle, const_reference v);

      Effects: Assigns v to the element handled by handle & updates the priority queue.

      Complexity: Logarithmic (amortized).

      Note: The new value is expected to be less than the current one

    29. -
      void decrease(handle_type handle);
      +
      void decrease(handle_type handle);

      Effects: Updates the heap after the element handled by handle has been changed.

      Complexity: Logarithmic (amortized).

      Note: The new value is expected to be less than the current one. If this is not called, after a handle has been updated, the behavior of the data structure is undefined!

      @@ -336,10 +336,10 @@
    -

    -skew_heap public static functions

    +

    +skew_heap public static functions

    1. -
      static handle_type s_handle_from_iterator(iterator const & it);
      +
      static handle_type s_handle_from_iterator(iterator const & it);

      Effects: Casts an iterator to a node handle.

      Complexity: Constant.

      Requirement: data structure must be configured as mutable

      diff --git a/doc/html/boost/heap/skew_heap/implementation_defined.html b/doc/html/boost/heap/skew_heap/implementation_defined.html index 938a7c700b..617a4df33e 100644 --- a/doc/html/boost/heap/skew_heap/implementation_defined.html +++ b/doc/html/boost/heap/skew_heap/implementation_defined.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      @@ -62,7 +62,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/heap/stable.html b/doc/html/boost/heap/stable.html index 74acc2be9b..812b221df2 100644 --- a/doc/html/boost/heap/stable.html +++ b/doc/html/boost/heap/stable.html @@ -36,7 +36,7 @@ struct stable { };
      -

      Description

      +

      Description

      A priority queue is stable, if elements with the same priority are popped from the heap, in the same order as they are inserted.

    diff --git a/doc/html/boost/heap/store_parent_pointer.html b/doc/html/boost/heap/store_parent_pointer.html index d29679eaf1..4bab2abf66 100644 --- a/doc/html/boost/heap/store_parent_pointer.html +++ b/doc/html/boost/heap/store_parent_pointer.html @@ -36,7 +36,7 @@ struct store_parent_pointer { };
    -

    Description

    +

    Description

    Maintaining a parent pointer adds some maintenance and size overhead, but iterating a heap is more efficient.

    diff --git a/doc/html/boost/interprocess/accept_ownership.html b/doc/html/boost/interprocess/accept_ownership.html index 706485a538..c1da86afb5 100644 --- a/doc/html/boost/interprocess/accept_ownership.html +++ b/doc/html/boost/interprocess/accept_ownership.html @@ -34,7 +34,7 @@ static const accept_ownership_type accept_ownership;
    -

    Description

    +

    Description

    An object indicating that the ownership of lockable object must be accepted by the new owner.

    diff --git a/doc/html/boost/interprocess/accept_ownership_type.html b/doc/html/boost/interprocess/accept_ownership_type.html index 1748d051a7..020d291ff9 100644 --- a/doc/html/boost/interprocess/accept_ownership_type.html +++ b/doc/html/boost/interprocess/accept_ownership_type.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -46,7 +46,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/adaptive_pool.html b/doc/html/boost/interprocess/adaptive_pool.html index 13d92e0e8d..4a6a176b98 100644 --- a/doc/html/boost/interprocess/adaptive_pool.html +++ b/doc/html/boost/interprocess/adaptive_pool.html @@ -55,158 +55,158 @@ }; // construct/copy/destruct - adaptive_pool(segment_manager *); - adaptive_pool(const adaptive_pool &); + adaptive_pool(segment_manager *); + adaptive_pool(const adaptive_pool &); template<typename T2> - adaptive_pool(const adaptive_pool< T2, SegmentManager, NodesPerBlock, MaxFreeBlocks, OverheadPercent > &); + adaptive_pool(const adaptive_pool< T2, SegmentManager, NodesPerBlock, MaxFreeBlocks, OverheadPercent > &); template<typename T2, typename SegmentManager2, std::size_t N2, std::size_t F2, unsigned char OP2> adaptive_pool & - operator=(const adaptive_pool< T2, SegmentManager2, N2, F2, OP2 > &); - ~adaptive_pool(); + operator=(const adaptive_pool< T2, SegmentManager2, N2, F2, OP2 > &); + ~adaptive_pool(); - // public member functions - void * get_node_pool() const; - segment_manager * get_segment_manager() const; - size_type max_size() const; - pointer allocate(size_type, cvoid_pointer = 0); - void deallocate(const pointer &, size_type); - void deallocate_free_blocks(); - pointer address(reference) const; - const_pointer address(const_reference) const; - size_type size(const pointer &) const; - pointer allocation_command(boost::interprocess::allocation_type, size_type, + // public member functions + void * get_node_pool() const; + segment_manager * get_segment_manager() const; + size_type max_size() const; + pointer allocate(size_type, cvoid_pointer = 0); + void deallocate(const pointer &, size_type); + void deallocate_free_blocks(); + pointer address(reference) const; + const_pointer address(const_reference) const; + size_type size(const pointer &) const; + pointer allocation_command(boost::interprocess::allocation_type, size_type, size_type &, pointer &); - void allocate_many(size_type, size_type, multiallocation_chain &); - void allocate_many(const size_type *, size_type, multiallocation_chain &); - void deallocate_many(multiallocation_chain &); - pointer allocate_one(); - void allocate_individual(size_type, multiallocation_chain &); - void deallocate_one(const pointer &); - void deallocate_individual(multiallocation_chain &); + void allocate_many(size_type, size_type, multiallocation_chain &); + void allocate_many(const size_type *, size_type, multiallocation_chain &); + void deallocate_many(multiallocation_chain &); + pointer allocate_one(); + void allocate_individual(size_type, multiallocation_chain &); + void deallocate_one(const pointer &); + void deallocate_individual(multiallocation_chain &); - // friend functions - friend void swap(self_t &, self_t &); + // friend functions + friend void swap(self_t &, self_t &); };
    -

    Description

    +

    Description

    An STL node allocator that uses a segment manager as memory source. The internal pointer type will of the same type (raw, smart) as "typename SegmentManager::void_pointer" type. This allows placing the allocator in shared memory, memory mapped-files, etc...

    This node allocator shares a segregated storage between all instances of adaptive_pool with equal sizeof(T) placed in the same segment group. NodesPerBlock is the number of nodes allocated at once when the allocator needs runs out of nodes. MaxFreeBlocks is the maximum number of totally free blocks that the adaptive node pool will hold. The rest of the totally free blocks will be deallocated with the segment manager.

    OverheadPercent is the (approximated) maximum size overhead (1-20%) of the allocator: (memory usable for nodes / total memory allocated from the segment manager)

    -

    +

    adaptive_pool public construct/copy/destruct

    1. -
      adaptive_pool(segment_manager * segment_mngr);
      +
      adaptive_pool(segment_manager * segment_mngr);

      Not assignable from other adaptive_pool Constructor from a segment manager. If not present, constructs a node pool. Increments the reference count of the associated node pool. Can throw boost::interprocess::bad_alloc

    2. -
      adaptive_pool(const adaptive_pool & other);
      +
      adaptive_pool(const adaptive_pool & other);

      Copy constructor from other adaptive_pool. Increments the reference count of the associated node pool. Never throws 

    3. template<typename T2> 
-  adaptive_pool(const adaptive_pool< T2, SegmentManager, NodesPerBlock, MaxFreeBlocks, OverheadPercent > & other);
      + adaptive_pool(const adaptive_pool< T2, SegmentManager, NodesPerBlock, MaxFreeBlocks, OverheadPercent > & other);

      Copy constructor from related adaptive_pool. If not present, constructs a node pool. Increments the reference count of the associated node pool. Can throw boost::interprocess::bad_alloc 

    4. template<typename T2, typename SegmentManager2, std::size_t N2, 
          std::size_t F2, unsigned char OP2> 
   adaptive_pool & 
-  operator=(const adaptive_pool< T2, SegmentManager2, N2, F2, OP2 > &);
      + operator=(const adaptive_pool< T2, SegmentManager2, N2, F2, OP2 > &);

      Not assignable from related adaptive_pool

    5. -
      ~adaptive_pool();
      +
      ~adaptive_pool();

      Destructor, removes node_pool_t from memory if its reference count reaches to zero. Never throws

    -

    -adaptive_pool public member functions

    +

    +adaptive_pool public member functions

    1. -
      void * get_node_pool() const;
      +
      void * get_node_pool() const;

      Returns a pointer to the node pool. Never throws

    2. -
      segment_manager * get_segment_manager() const;
      +
      segment_manager * get_segment_manager() const;

      Returns the segment manager. Never throws

    3. -
      size_type max_size() const;
      +
      size_type max_size() const;

      Returns the number of elements that could be allocated. Never throws

    4. -
      pointer allocate(size_type count, cvoid_pointer hint = 0);
      +
      pointer allocate(size_type count, cvoid_pointer hint = 0);

      Allocate memory for an array of count elements. Throws boost::interprocess::bad_alloc if there is no enough memory

    5. -
      void deallocate(const pointer & ptr, size_type count);
      +
      void deallocate(const pointer & ptr, size_type count);

      Deallocate allocated memory. Never throws

    6. -
      void deallocate_free_blocks();
      +
      void deallocate_free_blocks();

      Deallocates all free blocks of the pool

    7. -
      pointer address(reference value) const;
      +
      pointer address(reference value) const;

      Returns address of mutable object. Never throws

    8. -
      const_pointer address(const_reference value) const;
      +
      const_pointer address(const_reference value) const;

      Returns address of non mutable object. Never throws

    9. -
      size_type size(const pointer & p) const;
      +
      size_type size(const pointer & p) const;

      Returns maximum the number of objects the previously allocated memory pointed by p can hold. This size only works for memory allocated with allocate, allocation_command and allocate_many.

      10. -
    10. pointer allocation_command(boost::interprocess::allocation_type command, 
+
    11. pointer allocation_command(boost::interprocess::allocation_type command, 
                            size_type limit_size, 
                            size_type & prefer_in_recvd_out_size, 
                            pointer & reuse);
      12. 
 
    12. 
-
      void allocate_many(size_type elem_size, size_type num_elements, 
+
      void allocate_many(size_type elem_size, size_type num_elements, 
                    multiallocation_chain & chain);
      
 
      Allocates many elements of size elem_size in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. The elements must be deallocated with deallocate(...) 
      
 
      13. 
 
    13. 
-
      void allocate_many(const size_type * elem_sizes, size_type n_elements, 
+
      void allocate_many(const size_type * elem_sizes, size_type n_elements, 
                    multiallocation_chain & chain);
      
 
      Allocates n_elements elements, each one of size elem_sizes[i]in a contiguous block of memory. The elements must be deallocated 
      
 
      14. 
 
    14. 
-
      void deallocate_many(multiallocation_chain & chain);
      
+
      void deallocate_many(multiallocation_chain & chain);
      
 
      Allocates many elements of size elem_size in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. The elements must be deallocated with deallocate(...) 
      
 
      15. 
 
    15. 
-
      pointer allocate_one();
      
+
      pointer allocate_one();
      
 
      Allocates just one object. Memory allocated with this function must be deallocated only with deallocate_one(). Throws boost::interprocess::bad_alloc if there is no enough memory 
      
 
      16. 
 
    16. 
-
      void allocate_individual(size_type num_elements, 
+
      void allocate_individual(size_type num_elements, 
                          multiallocation_chain & chain);
      
 
      Allocates many elements of size == 1 in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. Memory allocated with this function must be deallocated only with deallocate_one(). 
      
 
      17. 
 
    17. 
-
      void deallocate_one(const pointer & p);
      
+
      void deallocate_one(const pointer & p);
      
 
      Deallocates memory previously allocated with allocate_one(). You should never use deallocate_one to deallocate memory allocated with other functions different from allocate_one(). Never throws 
      
 
      18. 
 
    18. 
-
      void deallocate_individual(multiallocation_chain & chain);
      
+
      void deallocate_individual(multiallocation_chain & chain);
      
 
      Allocates many elements of size == 1 in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. Memory allocated with this function must be deallocated only with deallocate_one(). 
      
 
      19.
    -

    -adaptive_pool friend functions

    +

    +adaptive_pool friend functions

    1. -
      friend void swap(self_t & alloc1, self_t & alloc2);
      +
      friend void swap(self_t & alloc1, self_t & alloc2);

      Swaps allocators. Does not throw. If each allocator is placed in a different memory segment, the result is undefined.

    diff --git a/doc/html/boost/interprocess/adaptive_pool/rebind.html b/doc/html/boost/interprocess/adaptive_pool/rebind.html index eb4616882d..7648725412 100644 --- a/doc/html/boost/interprocess/adaptive_pool/rebind.html +++ b/doc/html/boost/interprocess/adaptive_pool/rebind.html @@ -6,9 +6,9 @@ - + - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -39,7 +39,7 @@ typedef adaptive_pool< T2, SegmentManager, NodesPerBlock, MaxFreeBlocks, OverheadPercent > other; };
    -

    Description

    +

    Description

    Obtains adaptive_pool from adaptive_pool

    @@ -53,7 +53,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/allocator.html b/doc/html/boost/interprocess/allocator.html index 7f15f9ef85..f6de9bd2d7 100644 --- a/doc/html/boost/interprocess/allocator.html +++ b/doc/html/boost/interprocess/allocator.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -55,138 +55,138 @@ }; // construct/copy/destruct - allocator(segment_manager *); - allocator(const allocator &); - template<typename T2> allocator(const allocator< T2, SegmentManager > &); + allocator(segment_manager *); + allocator(const allocator &); + template<typename T2> allocator(const allocator< T2, SegmentManager > &); - // public member functions - segment_manager * get_segment_manager() const; - pointer allocate(size_type, cvoid_ptr = 0); - void deallocate(const pointer &, size_type); - size_type max_size() const; - size_type size(const pointer &) const; - pointer allocation_command(boost::interprocess::allocation_type, size_type, + // public member functions + segment_manager * get_segment_manager() const; + pointer allocate(size_type, cvoid_ptr = 0); + void deallocate(const pointer &, size_type); + size_type max_size() const; + size_type size(const pointer &) const; + pointer allocation_command(boost::interprocess::allocation_type, size_type, size_type &, pointer &); - void allocate_many(size_type, size_type, multiallocation_chain &); - void allocate_many(const size_type *, size_type, multiallocation_chain &); - void deallocate_many(multiallocation_chain &); - pointer allocate_one(); - void allocate_individual(size_type, multiallocation_chain &); - void deallocate_one(const pointer &); - void deallocate_individual(multiallocation_chain &); - pointer address(reference) const; - const_pointer address(const_reference) const; - template<typename P> void construct(const pointer &, P &&); - void destroy(const pointer &); + void allocate_many(size_type, size_type, multiallocation_chain &); + void allocate_many(const size_type *, size_type, multiallocation_chain &); + void deallocate_many(multiallocation_chain &); + pointer allocate_one(); + void allocate_individual(size_type, multiallocation_chain &); + void deallocate_one(const pointer &); + void deallocate_individual(multiallocation_chain &); + pointer address(reference) const; + const_pointer address(const_reference) const; + template<typename P> void construct(const pointer &, P &&); + void destroy(const pointer &); - // friend functions - friend void swap(self_t &, self_t &); + // friend functions + friend void swap(self_t &, self_t &); };
    -

    Description

    +

    Description

    An STL compatible allocator that uses a segment manager as memory source. The internal pointer type will of the same type (raw, smart) as "typename SegmentManager::void_pointer" type. This allows placing the allocator in shared memory, memory mapped-files, etc...

    -

    +

    allocator public construct/copy/destruct

    1. -
      allocator(segment_manager * segment_mngr);
      +
      allocator(segment_manager * segment_mngr);

      Constructor from the segment manager. Never throws

    2. -
      allocator(const allocator & other);
      +
      allocator(const allocator & other);

      Constructor from other allocator. Never throws

    3. -
      template<typename T2> allocator(const allocator< T2, SegmentManager > & other);
      +
      template<typename T2> allocator(const allocator< T2, SegmentManager > & other);

      Constructor from related allocator. Never throws

    -

    -allocator public member functions

    +

    +allocator public member functions

    1. -
      segment_manager * get_segment_manager() const;
      +
      segment_manager * get_segment_manager() const;

      Returns the segment manager. Never throws

    2. -
      pointer allocate(size_type count, cvoid_ptr hint = 0);
      +
      pointer allocate(size_type count, cvoid_ptr hint = 0);

      Allocates memory for an array of count elements. Throws boost::interprocess::bad_alloc if there is no enough memory

    3. -
      void deallocate(const pointer & ptr, size_type);
      +
      void deallocate(const pointer & ptr, size_type);

      Deallocates memory previously allocated. Never throws

    4. -
      size_type max_size() const;
      +
      size_type max_size() const;

      Returns the number of elements that could be allocated. Never throws

    5. -
      size_type size(const pointer & p) const;
      +
      size_type size(const pointer & p) const;

      Returns maximum the number of objects the previously allocated memory pointed by p can hold. This size only works for memory allocated with allocate, allocation_command and allocate_many.

      6. -
    6. pointer allocation_command(boost::interprocess::allocation_type command, 
+
    7. pointer allocation_command(boost::interprocess::allocation_type command, 
                            size_type limit_size, 
                            size_type & prefer_in_recvd_out_size, 
                            pointer & reuse);
      8. 
 
    8. 
-
      void allocate_many(size_type elem_size, size_type num_elements, 
+
      void allocate_many(size_type elem_size, size_type num_elements, 
                    multiallocation_chain & chain);
      
 
      Allocates many elements of size elem_size in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. The elements must be deallocated with deallocate(...) 
      
 
      9. 
 
    9. 
-
      void allocate_many(const size_type * elem_sizes, size_type n_elements, 
+
      void allocate_many(const size_type * elem_sizes, size_type n_elements, 
                    multiallocation_chain & chain);
      
 
      Allocates n_elements elements, each one of size elem_sizes[i]in a contiguous block of memory. The elements must be deallocated 
      
 
      10. 
 
    10. 
-
      void deallocate_many(multiallocation_chain & chain);
      
+
      void deallocate_many(multiallocation_chain & chain);
      
 
      Allocates many elements of size elem_size in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. The elements must be deallocated with deallocate(...) 
      
 
      11. 
 
    11. 
-
      pointer allocate_one();
      
+
      pointer allocate_one();
      
 
      Allocates just one object. Memory allocated with this function must be deallocated only with deallocate_one(). Throws boost::interprocess::bad_alloc if there is no enough memory 
      
 
      12. 
 
    12. 
-
      void allocate_individual(size_type num_elements, 
+
      void allocate_individual(size_type num_elements, 
                          multiallocation_chain & chain);
      
 
      Allocates many elements of size == 1 in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. Memory allocated with this function must be deallocated only with deallocate_one(). 
      
 
      13. 
 
    13. 
-
      void deallocate_one(const pointer & p);
      
+
      void deallocate_one(const pointer & p);
      
 
      Deallocates memory previously allocated with allocate_one(). You should never use deallocate_one to deallocate memory allocated with other functions different from allocate_one(). Never throws 
      
 
      14. 
 
    14. 
-
      void deallocate_individual(multiallocation_chain & chain);
      
+
      void deallocate_individual(multiallocation_chain & chain);
      
 
      Allocates many elements of size == 1 in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. Memory allocated with this function must be deallocated only with deallocate_one(). 
      
 
      15. 
 
    15. 
-
      pointer address(reference value) const;
      
+
      pointer address(reference value) const;
      
 
      Returns address of mutable object. Never throws 
      
 
      16. 
 
    16. 
-
      const_pointer address(const_reference value) const;
      
+
      const_pointer address(const_reference value) const;
      
 
      Returns address of non mutable object. Never throws 
      
 
      17. 
 
    17. 
-
      template<typename P> void construct(const pointer & ptr, P && p);
      
+
      template<typename P> void construct(const pointer & ptr, P && p);
      
 
      Constructs an object Throws if T's constructor throws For backwards compatibility with libraries using C++03 allocators 
      
 
      18. 
 
    18. 
-
      void destroy(const pointer & ptr);
      
+
      void destroy(const pointer & ptr);
      
 
      Destroys object. Throws if object's destructor throws 
      
 
      19.
    -

    -allocator friend functions

    +

    +allocator friend functions

    1. -
      friend void swap(self_t & alloc1, self_t & alloc2);
      +
      friend void swap(self_t & alloc1, self_t & alloc2);

      Swap segment manager. Does not throw. If each allocator is placed in different memory segments, the result is undefined.

    @@ -202,7 +202,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/allocator/rebind.html b/doc/html/boost/interprocess/allocator/rebind.html index ee6fb8c3d6..197c6d81ae 100644 --- a/doc/html/boost/interprocess/allocator/rebind.html +++ b/doc/html/boost/interprocess/allocator/rebind.html @@ -6,9 +6,9 @@ - + - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -39,7 +39,7 @@ typedef allocator< T2, SegmentManager > other; };
    -

    Description

    +

    Description

    Obtains an allocator that allocates objects of type T2

    @@ -53,7 +53,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/anonymous_shared_memory.html b/doc/html/boost/interprocess/anonymous_shared_memory.html index 4c52159c8b..790cbab92c 100644 --- a/doc/html/boost/interprocess/anonymous_shared_memory.html +++ b/doc/html/boost/interprocess/anonymous_shared_memory.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -35,7 +35,7 @@ mapped_region anonymous_shared_memory(std::size_t size, void * address = 0);
    -

    Description

    +

    Description

    A function that creates an anonymous shared memory segment of size "size". If "address" is passed the function will try to map the segment in that address. Otherwise the operating system will choose the mapping address. The function returns a mapped_region holding that segment or throws interprocess_exception if the function fails.

    @@ -49,7 +49,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/bad_alloc.html b/doc/html/boost/interprocess/bad_alloc.html index a5bbfce473..dc198b5dd5 100644 --- a/doc/html/boost/interprocess/bad_alloc.html +++ b/doc/html/boost/interprocess/bad_alloc.html @@ -36,25 +36,25 @@ class bad_alloc : public boost::interprocess::interprocess_exception { public: // construct/copy/destruct - bad_alloc(); + bad_alloc(); - // public member functions - virtual const char * what() const; + // public member functions + virtual const char * what() const; };
    -

    Description

    +

    Description

    This exception is thrown when a memory request can't be fulfilled.

    -

    +

    bad_alloc public construct/copy/destruct

    -
    1. bad_alloc();
    +
    1. bad_alloc();
    -

    -bad_alloc public member functions

    -
    1. virtual const char * what() const;
    +

    +bad_alloc public member functions

    +
    1. virtual const char * what() const;
    diff --git a/doc/html/boost/interprocess/basic_bufferbuf.html b/doc/html/boost/interprocess/basic_bufferbuf.html index 61b7f497af..b8753157e3 100644 --- a/doc/html/boost/interprocess/basic_bufferbuf.html +++ b/doc/html/boost/interprocess/basic_bufferbuf.html @@ -44,46 +44,46 @@ typedef std::basic_streambuf< char_type, traits_type > base_t; // construct/copy/destruct - explicit basic_bufferbuf(std::ios_base::openmode = std::ios_base::in|std::ios_base::out); - explicit basic_bufferbuf(CharT *, std::size_t, + explicit basic_bufferbuf(std::ios_base::openmode = std::ios_base::in|std::ios_base::out); + explicit basic_bufferbuf(CharT *, std::size_t, std::ios_base::openmode = std::ios_base::in|std::ios_base::out); - ~basic_bufferbuf(); + ~basic_bufferbuf(); - // public member functions - std::pair< CharT *, std::size_t > buffer() const; - void buffer(CharT *, std::size_t); + // public member functions + std::pair< CharT *, std::size_t > buffer() const; + void buffer(CharT *, std::size_t); };
    -

    Description

    +

    Description

    A streambuf class that controls the transmission of elements to and from a basic_xbufferstream. The elements are transmitted from a to a fixed size buffer

    -

    +

    basic_bufferbuf public construct/copy/destruct

    1. -
      explicit basic_bufferbuf(std::ios_base::openmode mode = std::ios_base::in|std::ios_base::out);
      +
      explicit basic_bufferbuf(std::ios_base::openmode mode = std::ios_base::in|std::ios_base::out);

      Constructor. Does not throw.

    2. -
      explicit basic_bufferbuf(CharT * buf, std::size_t length, 
+
      explicit basic_bufferbuf(CharT * buf, std::size_t length, 
                          std::ios_base::openmode mode = std::ios_base::in|std::ios_base::out);
      
 
      Constructor. Assigns formatting buffer. Does not throw.
      3. -
    3. ~basic_bufferbuf();
      4. +
    4. ~basic_bufferbuf();
    -

    -basic_bufferbuf public member functions

    +

    +basic_bufferbuf public member functions

    1. -
      std::pair< CharT *, std::size_t > buffer() const;
      +
      std::pair< CharT *, std::size_t > buffer() const;

      Returns the pointer and size of the internal buffer. Does not throw.

    2. -
      void buffer(CharT * buf, std::size_t length);
      +
      void buffer(CharT * buf, std::size_t length);

      Sets the underlying buffer to a new value Does not throw.

    diff --git a/doc/html/boost/interprocess/basic_bufferstream.html b/doc/html/boost/interprocess/basic_bufferstream.html index 652e64a3cd..9d2028114e 100644 --- a/doc/html/boost/interprocess/basic_bufferstream.html +++ b/doc/html/boost/interprocess/basic_bufferstream.html @@ -43,51 +43,51 @@ typedef std::basic_ios< char_type, CharTraits >::traits_type traits_type; // construct/copy/destruct - basic_bufferstream(std::ios_base::openmode = std::ios_base::in|std::ios_base::out); - basic_bufferstream(CharT *, std::size_t, + basic_bufferstream(std::ios_base::openmode = std::ios_base::in|std::ios_base::out); + basic_bufferstream(CharT *, std::size_t, std::ios_base::openmode = std::ios_base::in|std::ios_base::out); - ~basic_bufferstream(); + ~basic_bufferstream(); - // public member functions - basic_bufferbuf< CharT, CharTraits > * rdbuf() const; - std::pair< CharT *, std::size_t > buffer() const; - void buffer(CharT *, std::size_t); + // public member functions + basic_bufferbuf< CharT, CharTraits > * rdbuf() const; + std::pair< CharT *, std::size_t > buffer() const; + void buffer(CharT *, std::size_t); };
    -

    Description

    +

    Description

    A basic_iostream class that uses a fixed size character buffer as its formatting buffer.

    -

    +

    basic_bufferstream public construct/copy/destruct

    1. -
      basic_bufferstream(std::ios_base::openmode mode = std::ios_base::in|std::ios_base::out);
      +
      basic_bufferstream(std::ios_base::openmode mode = std::ios_base::in|std::ios_base::out);

      Constructor. Does not throw.

    2. -
      basic_bufferstream(CharT * buf, std::size_t length, 
+
      basic_bufferstream(CharT * buf, std::size_t length, 
                    std::ios_base::openmode mode = std::ios_base::in|std::ios_base::out);
      
 
      Constructor. Assigns formatting buffer. Does not throw.
      3. -
    3. ~basic_bufferstream();
      4. +
    4. ~basic_bufferstream();
    -

    -basic_bufferstream public member functions

    +

    +basic_bufferstream public member functions

    1. -
      basic_bufferbuf< CharT, CharTraits > * rdbuf() const;
      +
      basic_bufferbuf< CharT, CharTraits > * rdbuf() const;

      Returns the address of the stored stream buffer.

    2. -
      std::pair< CharT *, std::size_t > buffer() const;
      +
      std::pair< CharT *, std::size_t > buffer() const;

      Returns the pointer and size of the internal buffer. Does not throw.

    3. -
      void buffer(CharT * buf, std::size_t length);
      +
      void buffer(CharT * buf, std::size_t length);

      Sets the underlying buffer to a new value. Resets stream position. Does not throw.

    diff --git a/doc/html/boost/interprocess/basic_ibufferstream.html b/doc/html/boost/interprocess/basic_ibufferstream.html index df0b2b303b..aca8a45540 100644 --- a/doc/html/boost/interprocess/basic_ibufferstream.html +++ b/doc/html/boost/interprocess/basic_ibufferstream.html @@ -43,51 +43,51 @@ typedef std::basic_ios< char_type, CharTraits >::traits_type traits_type; // construct/copy/destruct - basic_ibufferstream(std::ios_base::openmode = std::ios_base::in); - basic_ibufferstream(const CharT *, std::size_t, + basic_ibufferstream(std::ios_base::openmode = std::ios_base::in); + basic_ibufferstream(const CharT *, std::size_t, std::ios_base::openmode = std::ios_base::in); - ~basic_ibufferstream(); + ~basic_ibufferstream(); - // public member functions - basic_bufferbuf< CharT, CharTraits > * rdbuf() const; - std::pair< const CharT *, std::size_t > buffer() const; - void buffer(const CharT *, std::size_t); + // public member functions + basic_bufferbuf< CharT, CharTraits > * rdbuf() const; + std::pair< const CharT *, std::size_t > buffer() const; + void buffer(const CharT *, std::size_t); };
    -

    Description

    +

    Description

    A basic_istream class that uses a fixed size character buffer as its formatting buffer.

    -

    +

    basic_ibufferstream public construct/copy/destruct

    1. -
      basic_ibufferstream(std::ios_base::openmode mode = std::ios_base::in);
      +
      basic_ibufferstream(std::ios_base::openmode mode = std::ios_base::in);

      Constructor. Does not throw.

    2. -
      basic_ibufferstream(const CharT * buf, std::size_t length, 
+
      basic_ibufferstream(const CharT * buf, std::size_t length, 
                     std::ios_base::openmode mode = std::ios_base::in);
      
 
      Constructor. Assigns formatting buffer. Does not throw.
      3. -
    3. ~basic_ibufferstream();
      4. +
    4. ~basic_ibufferstream();
    -

    -basic_ibufferstream public member functions

    +

    +basic_ibufferstream public member functions

    1. -
      basic_bufferbuf< CharT, CharTraits > * rdbuf() const;
      +
      basic_bufferbuf< CharT, CharTraits > * rdbuf() const;

      Returns the address of the stored stream buffer.

    2. -
      std::pair< const CharT *, std::size_t > buffer() const;
      +
      std::pair< const CharT *, std::size_t > buffer() const;

      Returns the pointer and size of the internal buffer. Does not throw.

    3. -
      void buffer(const CharT * buf, std::size_t length);
      +
      void buffer(const CharT * buf, std::size_t length);

      Sets the underlying buffer to a new value. Resets stream position. Does not throw.

    diff --git a/doc/html/boost/interprocess/basic_ivectorstream.html b/doc/html/boost/interprocess/basic_ivectorstream.html index 55b76f06f3..ee4bb30f98 100644 --- a/doc/html/boost/interprocess/basic_ivectorstream.html +++ b/doc/html/boost/interprocess/basic_ivectorstream.html @@ -46,61 +46,61 @@ typedef std::basic_ios< char_type, CharTraits >::traits_type traits_type; // construct/copy/destruct - basic_ivectorstream(std::ios_base::openmode = std::ios_base::in); + basic_ivectorstream(std::ios_base::openmode = std::ios_base::in); template<typename VectorParameter> - basic_ivectorstream(const VectorParameter &, + basic_ivectorstream(const VectorParameter &, std::ios_base::openmode = std::ios_base::in); - // public member functions - basic_vectorbuf< CharVector, CharTraits > * rdbuf() const; - void swap_vector(vector_type &); - const vector_type & vector() const; - void reserve(typename vector_type::size_type); - void clear(); + // public member functions + basic_vectorbuf< CharVector, CharTraits > * rdbuf() const; + void swap_vector(vector_type &); + const vector_type & vector() const; + void reserve(typename vector_type::size_type); + void clear(); };
    -

    Description

    +

    Description

    A basic_istream class that holds a character vector specified by CharVector template parameter as its formatting buffer. The vector must have contiguous storage, like std::vector, boost::interprocess::vector or boost::interprocess::basic_string

    -

    +

    basic_ivectorstream public construct/copy/destruct

    1. -
      basic_ivectorstream(std::ios_base::openmode mode = std::ios_base::in);
      +
      basic_ivectorstream(std::ios_base::openmode mode = std::ios_base::in);

      Constructor. Throws if vector_type default constructor throws. 

    2. template<typename VectorParameter> 
-  basic_ivectorstream(const VectorParameter & param, 
+  basic_ivectorstream(const VectorParameter & param, 
                       std::ios_base::openmode mode = std::ios_base::in);

      Constructor. Throws if vector_type(const VectorParameter &param) throws.

    -

    -basic_ivectorstream public member functions

    +

    +basic_ivectorstream public member functions

    1. -
      basic_vectorbuf< CharVector, CharTraits > * rdbuf() const;
      +
      basic_vectorbuf< CharVector, CharTraits > * rdbuf() const;

      Returns the address of the stored stream buffer.

    2. -
      void swap_vector(vector_type & vect);
      +
      void swap_vector(vector_type & vect);

      Swaps the underlying vector with the passed vector. This function resets the read position in the stream. Does not throw.

    3. -
      const vector_type & vector() const;
      +
      const vector_type & vector() const;

      Returns a const reference to the internal vector. Does not throw.

    4. -
      void reserve(typename vector_type::size_type size);
      +
      void reserve(typename vector_type::size_type size);

      Calls reserve() method of the internal vector. Resets the stream to the first position. Throws if the internals vector's reserve throws.

    5. -
      void clear();
      +
      void clear();

      Calls clear() method of the internal vector. Resets the stream to the first position.

    diff --git a/doc/html/boost/interprocess/basic_ma_idm45879391291904.html b/doc/html/boost/interprocess/basic_ma_idm45879391291904.html new file mode 100644 index 0000000000..dceede502f --- /dev/null +++ b/doc/html/boost/interprocess/basic_ma_idm45879391291904.html @@ -0,0 +1,150 @@ + + + + +Class template basic_managed_xsi_shared_memory + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Class template basic_managed_xsi_shared_memory

    +

    boost::interprocess::basic_managed_xsi_shared_memory

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/managed_xsi_shared_memory.hpp>
+
+template<typename CharType, typename AllocationAlgorithm, 
+         template< class IndexConfig > class IndexType> 
+class basic_managed_xsi_shared_memory {
+public:
+  // types
+  typedef base_t::size_type size_type;
+
+  // construct/copy/destruct
+  basic_managed_xsi_shared_memory();
+  basic_managed_xsi_shared_memory(create_only_t, const xsi_key &, std::size_t, 
+                                  const void * = 0, 
+                                  const permissions & = permissions());
+  basic_managed_xsi_shared_memory(open_or_create_t, const xsi_key &, 
+                                  std::size_t, const void * = 0, 
+                                  const permissions & = permissions());
+  basic_managed_xsi_shared_memory(open_read_only_t, const xsi_key &, 
+                                  const void * = 0);
+  basic_managed_xsi_shared_memory(open_only_t, const xsi_key &, 
+                                  const void * = 0);
+  basic_managed_xsi_shared_memory(basic_managed_xsi_shared_memory &&);
+  basic_managed_xsi_shared_memory & 
+  operator=(basic_managed_xsi_shared_memory &&);
+  ~basic_managed_xsi_shared_memory();
+
+  // public member functions
+  void swap(basic_managed_xsi_shared_memory &);
+  int get_shmid() const;
+
+  // public static functions
+  static bool remove(int);
+};
    +
    +

    Description

    +

    A basic X/Open System Interface (XSI) shared memory named object creation class. Initializes the shared memory segment. Inherits all basic functionality from basic_managed_memory_impl<CharType, AllocationAlgorithm, IndexType>

    +
    +

    +basic_managed_xsi_shared_memory + public + construct/copy/destruct

    +
      +
    1. +
      basic_managed_xsi_shared_memory();
      +

      Default constructor. Does nothing. Useful in combination with move semantics

      +
      2. +
    2. +
      basic_managed_xsi_shared_memory(create_only_t, const xsi_key & key, 
+                                std::size_t size, const void * addr = 0, 
+                                const permissions & perm = permissions());
      +

      Creates shared memory and creates and places the segment manager. This can throw.

      +
      3. +
    3. +
      basic_managed_xsi_shared_memory(open_or_create_t, const xsi_key & key, 
+                                std::size_t size, const void * addr = 0, 
+                                const permissions & perm = permissions());
      +

      Creates shared memory and creates and places the segment manager if segment was not created. If segment was created it connects to the segment. This can throw.

      +
      4. +
    4. +
      basic_managed_xsi_shared_memory(open_read_only_t, const xsi_key & key, 
+                                const void * addr = 0);
      +

      Connects to a created shared memory and its segment manager. in read-only mode. This can throw.

      +
      5. +
    5. +
      basic_managed_xsi_shared_memory(open_only_t, const xsi_key & key, 
+                                const void * addr = 0);
      +

      Connects to a created shared memory and its segment manager. This can throw.

      +
      6. +
    6. +
      basic_managed_xsi_shared_memory(basic_managed_xsi_shared_memory && moved);
      +

      Moves the ownership of "moved"'s managed memory to *this. Does not throw

      +
      7. +
    7. +
      basic_managed_xsi_shared_memory & 
+operator=(basic_managed_xsi_shared_memory && moved);
      +

      Moves the ownership of "moved"'s managed memory to *this. Does not throw

      +
      8. +
    8. +
      ~basic_managed_xsi_shared_memory();
      +

      Destroys *this and indicates that the calling process is finished using the resource. The destructor function will deallocate any system resources allocated by the system for use by this process for this resource. The resource can still be opened again calling the open constructor overload. To erase the resource from the system use remove().

      +
      9. +
    +
    +
    +

    +basic_managed_xsi_shared_memory public member functions

    +
      +
    1. +
      void swap(basic_managed_xsi_shared_memory & other);
      +

      Swaps the ownership of the managed shared memories managed by *this and other. Never throws.

      +
      2. +
    2. int get_shmid() const;
      3. +
    +
    +
    +

    +basic_managed_xsi_shared_memory public static functions

    +
    1. +
      static bool remove(int shmid);
      +

      Erases a XSI shared memory object identified by shmid from the system. Returns false on error. Never throws

      +
    +
    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/basic_ma_idm45879391340624.html b/doc/html/boost/interprocess/basic_ma_idm45879391340624.html new file mode 100644 index 0000000000..5a1c971dd0 --- /dev/null +++ b/doc/html/boost/interprocess/basic_ma_idm45879391340624.html @@ -0,0 +1,143 @@ + + + + +Class template basic_managed_windows_shared_memory + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Class template basic_managed_windows_shared_memory

    +

    boost::interprocess::basic_managed_windows_shared_memory

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/managed_windows_shared_memory.hpp>
+
+template<typename CharType, typename AllocationAlgorithm, 
+         template< class IndexConfig > class IndexType> 
+class basic_managed_windows_shared_memory {
+public:
+  // types
+  typedef base_t::size_type size_type;
+
+  // construct/copy/destruct
+  basic_managed_windows_shared_memory();
+  basic_managed_windows_shared_memory(create_only_t, const char *, size_type, 
+                                      const void * = 0, 
+                                      const permissions & = permissions());
+  basic_managed_windows_shared_memory(open_or_create_t, const char *, 
+                                      size_type, const void * = 0, 
+                                      const permissions & = permissions());
+  basic_managed_windows_shared_memory(open_only_t, const char *, 
+                                      const void * = 0);
+  basic_managed_windows_shared_memory(open_copy_on_write_t, const char *, 
+                                      const void * = 0);
+  basic_managed_windows_shared_memory(open_read_only_t, const char *, 
+                                      const void * = 0);
+  basic_managed_windows_shared_memory(basic_managed_windows_shared_memory &&);
+  basic_managed_windows_shared_memory & 
+  operator=(basic_managed_windows_shared_memory &&);
+  ~basic_managed_windows_shared_memory();
+
+  // public member functions
+  void swap(basic_managed_windows_shared_memory &);
+};
    +
    +

    Description

    +

    A basic managed windows shared memory creation class. Initializes the shared memory segment. Inherits all basic functionality from basic_managed_memory_impl<CharType, AllocationAlgorithm, IndexType> Unlike basic_managed_shared_memory, it has no kernel persistence and the shared memory is destroyed when all processes destroy all their windows_shared_memory objects and mapped regions for the same shared memory or the processes end/crash.

    +

    Warning: basic_managed_windows_shared_memory and basic_managed_shared_memory can't communicate between them.

    +
    +

    +basic_managed_windows_shared_memory + public + construct/copy/destruct

    +
      +
    1. +
      basic_managed_windows_shared_memory();
      +

      Default constructor. Does nothing. Useful in combination with move semantics

      +
      2. +
    2. +
      basic_managed_windows_shared_memory(create_only_t, const char * name, 
+                                    size_type size, const void * addr = 0, 
+                                    const permissions & perm = permissions());
      +

      Creates shared memory and creates and places the segment manager. This can throw.

      +
      3. +
    3. +
      basic_managed_windows_shared_memory(open_or_create_t, const char * name, 
+                                    size_type size, const void * addr = 0, 
+                                    const permissions & perm = permissions());
      +

      Creates shared memory and creates and places the segment manager if segment was not created. If segment was created it connects to the segment. This can throw.

      +
      4. +
    4. +
      basic_managed_windows_shared_memory(open_only_t, const char * name, 
+                                    const void * addr = 0);
      +

      Connects to a created shared memory and its segment manager. This can throw.

      +
      5. +
    5. +
      basic_managed_windows_shared_memory(open_copy_on_write_t, const char * name, 
+                                    const void * addr = 0);
      +

      Connects to a created shared memory and its segment manager in copy_on_write mode. This can throw.

      +
      6. +
    6. +
      basic_managed_windows_shared_memory(open_read_only_t, const char * name, 
+                                    const void * addr = 0);
      +

      Connects to a created shared memory and its segment manager in read-only mode. This can throw.

      +
      7. +
    7. +
      basic_managed_windows_shared_memory(basic_managed_windows_shared_memory && moved);
      +

      Moves the ownership of "moved"'s managed memory to *this. Does not throw

      +
      8. +
    8. +
      basic_managed_windows_shared_memory & 
+operator=(basic_managed_windows_shared_memory && moved);
      +

      Moves the ownership of "moved"'s managed memory to *this. Does not throw

      +
      9. +
    9. +
      ~basic_managed_windows_shared_memory();
      +

      Destroys *this and indicates that the calling process is finished using the resource. All mapped regions are still valid after destruction. When all mapped regions and basic_managed_windows_shared_memory objects referring the shared memory are destroyed, the operating system will destroy the shared memory.

      +
      10. +
    +
    +
    +

    +basic_managed_windows_shared_memory public member functions

    +
    1. +
      void swap(basic_managed_windows_shared_memory & other);
      +

      Swaps the ownership of the managed mapped memories managed by *this and other. Never throws.

      +
    +
    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/basic_ma_idm45879391398368.html b/doc/html/boost/interprocess/basic_ma_idm45879391398368.html new file mode 100644 index 0000000000..de4f188d13 --- /dev/null +++ b/doc/html/boost/interprocess/basic_ma_idm45879391398368.html @@ -0,0 +1,156 @@ + + + + +Class template basic_managed_shared_memory + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Class template basic_managed_shared_memory

    +

    boost::interprocess::basic_managed_shared_memory

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/managed_shared_memory.hpp>
+
+template<typename CharType, typename AllocationAlgorithm, 
+         template< class IndexConfig > class IndexType> 
+class basic_managed_shared_memory {
+public:
+  // construct/copy/destruct
+  basic_managed_shared_memory();
+  basic_managed_shared_memory(create_only_t, const char *, size_type, 
+                              const void * = 0, 
+                              const permissions & = permissions());
+  basic_managed_shared_memory(open_or_create_t, const char *, size_type, 
+                              const void * = 0, 
+                              const permissions & = permissions());
+  basic_managed_shared_memory(open_copy_on_write_t, const char *, 
+                              const void * = 0);
+  basic_managed_shared_memory(open_read_only_t, const char *, 
+                              const void * = 0);
+  basic_managed_shared_memory(open_only_t, const char *, const void * = 0);
+  basic_managed_shared_memory(basic_managed_shared_memory &&);
+  basic_managed_shared_memory & operator=(basic_managed_shared_memory &&);
+  ~basic_managed_shared_memory();
+
+  // public member functions
+  void swap(basic_managed_shared_memory &);
+
+  // public static functions
+  static bool grow(const char *, size_type);
+  static bool shrink_to_fit(const char *);
+};
    +
    +

    Description

    +

    A basic shared memory named object creation class. Initializes the shared memory segment. Inherits all basic functionality from basic_managed_memory_impl<CharType, AllocationAlgorithm, IndexType>

    +
    +

    +basic_managed_shared_memory + public + construct/copy/destruct

    +
      +
    1. +
      basic_managed_shared_memory();
      +

      Default constructor. Does nothing. Useful in combination with move semantics

      +
      2. +
    2. +
      basic_managed_shared_memory(create_only_t, const char * name, size_type size, 
+                            const void * addr = 0, 
+                            const permissions & perm = permissions());
      +

      Creates shared memory and creates and places the segment manager. This can throw.

      +
      3. +
    3. +
      basic_managed_shared_memory(open_or_create_t, const char * name, 
+                            size_type size, const void * addr = 0, 
+                            const permissions & perm = permissions());
      +

      Creates shared memory and creates and places the segment manager if segment was not created. If segment was created it connects to the segment. This can throw.

      +
      4. +
    4. +
      basic_managed_shared_memory(open_copy_on_write_t, const char * name, 
+                            const void * addr = 0);
      +

      Connects to a created shared memory and its segment manager. in copy_on_write mode. This can throw.

      +
      5. +
    5. +
      basic_managed_shared_memory(open_read_only_t, const char * name, 
+                            const void * addr = 0);
      +

      Connects to a created shared memory and its segment manager. in read-only mode. This can throw.

      +
      6. +
    6. +
      basic_managed_shared_memory(open_only_t, const char * name, 
+                            const void * addr = 0);
      +

      Connects to a created shared memory and its segment manager. This can throw.

      +
      7. +
    7. +
      basic_managed_shared_memory(basic_managed_shared_memory && moved);
      +

      Moves the ownership of "moved"'s managed memory to *this. Does not throw

      +
      8. +
    8. +
      basic_managed_shared_memory & operator=(basic_managed_shared_memory && moved);
      +

      Moves the ownership of "moved"'s managed memory to *this. Does not throw

      +
      9. +
    9. +
      ~basic_managed_shared_memory();
      +

      Destroys *this and indicates that the calling process is finished using the resource. The destructor function will deallocate any system resources allocated by the system for use by this process for this resource. The resource can still be opened again calling the open constructor overload. To erase the resource from the system use remove().

      +
      10. +
    +
    +
    +

    +basic_managed_shared_memory public member functions

    +
    1. +
      void swap(basic_managed_shared_memory & other);
      +

      Swaps the ownership of the managed shared memories managed by *this and other. Never throws.

      +
    +
    +
    +

    +basic_managed_shared_memory public static functions

    +
      +
    1. +
      static bool grow(const char * shmname, size_type extra_bytes);
      +

      Tries to resize the managed shared memory object so that we have room for more objects.

      +

      This function is not synchronized so no other thread or process should be reading or writing the file

      +
      2. +
    2. +
      static bool shrink_to_fit(const char * shmname);
      +

      Tries to resize the managed shared memory to minimized the size of the file.

      +

      This function is not synchronized so no other thread or process should be reading or writing the file

      +
      3. +
    +
    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/basic_ma_idm45879391506880.html b/doc/html/boost/interprocess/basic_ma_idm45879391506880.html new file mode 100644 index 0000000000..451ea16053 --- /dev/null +++ b/doc/html/boost/interprocess/basic_ma_idm45879391506880.html @@ -0,0 +1,103 @@ + + + + +Class template basic_managed_external_buffer + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Class template basic_managed_external_buffer

    +

    boost::interprocess::basic_managed_external_buffer

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/managed_external_buffer.hpp>
+
+template<typename CharType, typename AllocationAlgorithm, 
+         template< class IndexConfig > class IndexType> 
+class basic_managed_external_buffer {
+public:
+  // types
+  typedef base_t::size_type size_type;
+
+  // construct/copy/destruct
+  basic_managed_external_buffer();
+  basic_managed_external_buffer(create_only_t, void *, size_type);
+  basic_managed_external_buffer(open_only_t, void *, size_type);
+  basic_managed_external_buffer(basic_managed_external_buffer &&);
+  basic_managed_external_buffer & operator=(basic_managed_external_buffer &&);
+
+  // public member functions
+  void grow(size_type);
+  void swap(basic_managed_external_buffer &);
+};
    +
    +

    Description

    +

    A basic user memory named object creation class. Inherits all basic functionality from basic_managed_memory_impl<CharType, AllocationAlgorithm, IndexType>

    +
    +

    +basic_managed_external_buffer + public + construct/copy/destruct

    +
      +
    1. +
      basic_managed_external_buffer();
      +

      Default constructor. Does nothing. Useful in combination with move semantics

      +
      2. +
    2. +
      basic_managed_external_buffer(create_only_t, void * addr, size_type size);
      Creates and places the segment manager. This can throw.
      3. +
    3. +
      basic_managed_external_buffer(open_only_t, void * addr, size_type size);
      Creates and places the segment manager. This can throw.
      4. +
    4. +
      basic_managed_external_buffer(basic_managed_external_buffer && moved);
      Moves the ownership of "moved"'s managed memory to *this. Does not throw.
      5. +
    5. +
      basic_managed_external_buffer & 
+operator=(basic_managed_external_buffer && moved);
      Moves the ownership of "moved"'s managed memory to *this. Does not throw.
      6. +
    +
    +
    +

    +basic_managed_external_buffer public member functions

    +
      +
    1. void grow(size_type extra_bytes);
      2. +
    2. +
      void swap(basic_managed_external_buffer & other);
      +

      Swaps the ownership of the managed heap memories managed by *this and other. Never throws.

      +
      3. +
    +
    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/basic_managed__idp35237824.html b/doc/html/boost/interprocess/basic_managed__idp35237824.html deleted file mode 100644 index 05f2bfa9c4..0000000000 --- a/doc/html/boost/interprocess/basic_managed__idp35237824.html +++ /dev/null @@ -1,103 +0,0 @@ - - - - -Class template basic_managed_external_buffer - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Class template basic_managed_external_buffer

    -

    boost::interprocess::basic_managed_external_buffer

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/managed_external_buffer.hpp>
-
-template<typename CharType, typename AllocationAlgorithm, 
-         template< class IndexConfig > class IndexType> 
-class basic_managed_external_buffer {
-public:
-  // types
-  typedef base_t::size_type size_type;
-
-  // construct/copy/destruct
-  basic_managed_external_buffer();
-  basic_managed_external_buffer(create_only_t, void *, size_type);
-  basic_managed_external_buffer(open_only_t, void *, size_type);
-  basic_managed_external_buffer(basic_managed_external_buffer &&);
-  basic_managed_external_buffer & operator=(basic_managed_external_buffer &&);
-
-  // public member functions
-  void grow(size_type);
-  void swap(basic_managed_external_buffer &);
-};
    -
    -

    Description

    -

    A basic user memory named object creation class. Inherits all basic functionality from basic_managed_memory_impl<CharType, AllocationAlgorithm, IndexType>

    -
    -

    -basic_managed_external_buffer - public - construct/copy/destruct

    -
      -
    1. -
      basic_managed_external_buffer();
      -

      Default constructor. Does nothing. Useful in combination with move semantics

      -
      2. -
    2. -
      basic_managed_external_buffer(create_only_t, void * addr, size_type size);
      Creates and places the segment manager. This can throw.
      3. -
    3. -
      basic_managed_external_buffer(open_only_t, void * addr, size_type size);
      Creates and places the segment manager. This can throw.
      4. -
    4. -
      basic_managed_external_buffer(basic_managed_external_buffer && moved);
      Moves the ownership of "moved"'s managed memory to *this. Does not throw.
      5. -
    5. -
      basic_managed_external_buffer & 
-operator=(basic_managed_external_buffer && moved);
      Moves the ownership of "moved"'s managed memory to *this. Does not throw.
      6. -
    -
    -
    -

    -basic_managed_external_buffer public member functions

    -
      -
    1. void grow(size_type extra_bytes);
      2. -
    2. -
      void swap(basic_managed_external_buffer & other);
      -

      Swaps the ownership of the managed heap memories managed by *this and other. Never throws.

      -
      3. -
    -
    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/basic_managed__idp35346336.html b/doc/html/boost/interprocess/basic_managed__idp35346336.html deleted file mode 100644 index 40c136b1c2..0000000000 --- a/doc/html/boost/interprocess/basic_managed__idp35346336.html +++ /dev/null @@ -1,156 +0,0 @@ - - - - -Class template basic_managed_shared_memory - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Class template basic_managed_shared_memory

    -

    boost::interprocess::basic_managed_shared_memory

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/managed_shared_memory.hpp>
-
-template<typename CharType, typename AllocationAlgorithm, 
-         template< class IndexConfig > class IndexType> 
-class basic_managed_shared_memory {
-public:
-  // construct/copy/destruct
-  basic_managed_shared_memory();
-  basic_managed_shared_memory(create_only_t, const char *, size_type, 
-                              const void * = 0, 
-                              const permissions & = permissions());
-  basic_managed_shared_memory(open_or_create_t, const char *, size_type, 
-                              const void * = 0, 
-                              const permissions & = permissions());
-  basic_managed_shared_memory(open_copy_on_write_t, const char *, 
-                              const void * = 0);
-  basic_managed_shared_memory(open_read_only_t, const char *, 
-                              const void * = 0);
-  basic_managed_shared_memory(open_only_t, const char *, const void * = 0);
-  basic_managed_shared_memory(basic_managed_shared_memory &&);
-  basic_managed_shared_memory & operator=(basic_managed_shared_memory &&);
-  ~basic_managed_shared_memory();
-
-  // public member functions
-  void swap(basic_managed_shared_memory &);
-
-  // public static functions
-  static bool grow(const char *, size_type);
-  static bool shrink_to_fit(const char *);
-};
    -
    -

    Description

    -

    A basic shared memory named object creation class. Initializes the shared memory segment. Inherits all basic functionality from basic_managed_memory_impl<CharType, AllocationAlgorithm, IndexType>

    -
    -

    -basic_managed_shared_memory - public - construct/copy/destruct

    -
      -
    1. -
      basic_managed_shared_memory();
      -

      Default constructor. Does nothing. Useful in combination with move semantics

      -
      2. -
    2. -
      basic_managed_shared_memory(create_only_t, const char * name, size_type size, 
-                            const void * addr = 0, 
-                            const permissions & perm = permissions());
      -

      Creates shared memory and creates and places the segment manager. This can throw.

      -
      3. -
    3. -
      basic_managed_shared_memory(open_or_create_t, const char * name, 
-                            size_type size, const void * addr = 0, 
-                            const permissions & perm = permissions());
      -

      Creates shared memory and creates and places the segment manager if segment was not created. If segment was created it connects to the segment. This can throw.

      -
      4. -
    4. -
      basic_managed_shared_memory(open_copy_on_write_t, const char * name, 
-                            const void * addr = 0);
      -

      Connects to a created shared memory and its segment manager. in copy_on_write mode. This can throw.

      -
      5. -
    5. -
      basic_managed_shared_memory(open_read_only_t, const char * name, 
-                            const void * addr = 0);
      -

      Connects to a created shared memory and its segment manager. in read-only mode. This can throw.

      -
      6. -
    6. -
      basic_managed_shared_memory(open_only_t, const char * name, 
-                            const void * addr = 0);
      -

      Connects to a created shared memory and its segment manager. This can throw.

      -
      7. -
    7. -
      basic_managed_shared_memory(basic_managed_shared_memory && moved);
      -

      Moves the ownership of "moved"'s managed memory to *this. Does not throw

      -
      8. -
    8. -
      basic_managed_shared_memory & operator=(basic_managed_shared_memory && moved);
      -

      Moves the ownership of "moved"'s managed memory to *this. Does not throw

      -
      9. -
    9. -
      ~basic_managed_shared_memory();
      -

      Destroys *this and indicates that the calling process is finished using the resource. The destructor function will deallocate any system resources allocated by the system for use by this process for this resource. The resource can still be opened again calling the open constructor overload. To erase the resource from the system use remove().

      -
      10. -
    -
    -
    -

    -basic_managed_shared_memory public member functions

    -
    1. -
      void swap(basic_managed_shared_memory & other);
      -

      Swaps the ownership of the managed shared memories managed by *this and other. Never throws.

      -
    -
    -
    -

    -basic_managed_shared_memory public static functions

    -
      -
    1. -
      static bool grow(const char * shmname, size_type extra_bytes);
      -

      Tries to resize the managed shared memory object so that we have room for more objects.

      -

      This function is not synchronized so no other thread or process should be reading or writing the file

      -
      2. -
    2. -
      static bool shrink_to_fit(const char * shmname);
      -

      Tries to resize the managed shared memory to minimized the size of the file.

      -

      This function is not synchronized so no other thread or process should be reading or writing the file

      -
      3. -
    -
    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/basic_managed__idp35404080.html b/doc/html/boost/interprocess/basic_managed__idp35404080.html deleted file mode 100644 index 2271e0f78a..0000000000 --- a/doc/html/boost/interprocess/basic_managed__idp35404080.html +++ /dev/null @@ -1,143 +0,0 @@ - - - - -Class template basic_managed_windows_shared_memory - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Class template basic_managed_windows_shared_memory

    -

    boost::interprocess::basic_managed_windows_shared_memory

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/managed_windows_shared_memory.hpp>
-
-template<typename CharType, typename AllocationAlgorithm, 
-         template< class IndexConfig > class IndexType> 
-class basic_managed_windows_shared_memory {
-public:
-  // types
-  typedef base_t::size_type size_type;
-
-  // construct/copy/destruct
-  basic_managed_windows_shared_memory();
-  basic_managed_windows_shared_memory(create_only_t, const char *, size_type, 
-                                      const void * = 0, 
-                                      const permissions & = permissions());
-  basic_managed_windows_shared_memory(open_or_create_t, const char *, 
-                                      size_type, const void * = 0, 
-                                      const permissions & = permissions());
-  basic_managed_windows_shared_memory(open_only_t, const char *, 
-                                      const void * = 0);
-  basic_managed_windows_shared_memory(open_copy_on_write_t, const char *, 
-                                      const void * = 0);
-  basic_managed_windows_shared_memory(open_read_only_t, const char *, 
-                                      const void * = 0);
-  basic_managed_windows_shared_memory(basic_managed_windows_shared_memory &&);
-  basic_managed_windows_shared_memory & 
-  operator=(basic_managed_windows_shared_memory &&);
-  ~basic_managed_windows_shared_memory();
-
-  // public member functions
-  void swap(basic_managed_windows_shared_memory &);
-};
    -
    -

    Description

    -

    A basic managed windows shared memory creation class. Initializes the shared memory segment. Inherits all basic functionality from basic_managed_memory_impl<CharType, AllocationAlgorithm, IndexType> Unlike basic_managed_shared_memory, it has no kernel persistence and the shared memory is destroyed when all processes destroy all their windows_shared_memory objects and mapped regions for the same shared memory or the processes end/crash.

    -

    Warning: basic_managed_windows_shared_memory and basic_managed_shared_memory can't communicate between them.

    -
    -

    -basic_managed_windows_shared_memory - public - construct/copy/destruct

    -
      -
    1. -
      basic_managed_windows_shared_memory();
      -

      Default constructor. Does nothing. Useful in combination with move semantics

      -
      2. -
    2. -
      basic_managed_windows_shared_memory(create_only_t, const char * name, 
-                                    size_type size, const void * addr = 0, 
-                                    const permissions & perm = permissions());
      -

      Creates shared memory and creates and places the segment manager. This can throw.

      -
      3. -
    3. -
      basic_managed_windows_shared_memory(open_or_create_t, const char * name, 
-                                    size_type size, const void * addr = 0, 
-                                    const permissions & perm = permissions());
      -

      Creates shared memory and creates and places the segment manager if segment was not created. If segment was created it connects to the segment. This can throw.

      -
      4. -
    4. -
      basic_managed_windows_shared_memory(open_only_t, const char * name, 
-                                    const void * addr = 0);
      -

      Connects to a created shared memory and its segment manager. This can throw.

      -
      5. -
    5. -
      basic_managed_windows_shared_memory(open_copy_on_write_t, const char * name, 
-                                    const void * addr = 0);
      -

      Connects to a created shared memory and its segment manager in copy_on_write mode. This can throw.

      -
      6. -
    6. -
      basic_managed_windows_shared_memory(open_read_only_t, const char * name, 
-                                    const void * addr = 0);
      -

      Connects to a created shared memory and its segment manager in read-only mode. This can throw.

      -
      7. -
    7. -
      basic_managed_windows_shared_memory(basic_managed_windows_shared_memory && moved);
      -

      Moves the ownership of "moved"'s managed memory to *this. Does not throw

      -
      8. -
    8. -
      basic_managed_windows_shared_memory & 
-operator=(basic_managed_windows_shared_memory && moved);
      -

      Moves the ownership of "moved"'s managed memory to *this. Does not throw

      -
      9. -
    9. -
      ~basic_managed_windows_shared_memory();
      -

      Destroys *this and indicates that the calling process is finished using the resource. All mapped regions are still valid after destruction. When all mapped regions and basic_managed_windows_shared_memory objects referring the shared memory are destroyed, the operating system will destroy the shared memory.

      -
      10. -
    -
    -
    -

    -basic_managed_windows_shared_memory public member functions

    -
    1. -
      void swap(basic_managed_windows_shared_memory & other);
      -

      Swaps the ownership of the managed mapped memories managed by *this and other. Never throws.

      -
    -
    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/basic_managed__idp35452800.html b/doc/html/boost/interprocess/basic_managed__idp35452800.html deleted file mode 100644 index ed65936c9b..0000000000 --- a/doc/html/boost/interprocess/basic_managed__idp35452800.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - -Class template basic_managed_xsi_shared_memory - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Class template basic_managed_xsi_shared_memory

    -

    boost::interprocess::basic_managed_xsi_shared_memory

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/managed_xsi_shared_memory.hpp>
-
-template<typename CharType, typename AllocationAlgorithm, 
-         template< class IndexConfig > class IndexType> 
-class basic_managed_xsi_shared_memory {
-public:
-  // types
-  typedef base_t::size_type size_type;
-
-  // construct/copy/destruct
-  basic_managed_xsi_shared_memory();
-  basic_managed_xsi_shared_memory(create_only_t, const xsi_key &, std::size_t, 
-                                  const void * = 0, 
-                                  const permissions & = permissions());
-  basic_managed_xsi_shared_memory(open_or_create_t, const xsi_key &, 
-                                  std::size_t, const void * = 0, 
-                                  const permissions & = permissions());
-  basic_managed_xsi_shared_memory(open_read_only_t, const xsi_key &, 
-                                  const void * = 0);
-  basic_managed_xsi_shared_memory(open_only_t, const xsi_key &, 
-                                  const void * = 0);
-  basic_managed_xsi_shared_memory(basic_managed_xsi_shared_memory &&);
-  basic_managed_xsi_shared_memory & 
-  operator=(basic_managed_xsi_shared_memory &&);
-  ~basic_managed_xsi_shared_memory();
-
-  // public member functions
-  void swap(basic_managed_xsi_shared_memory &);
-  int get_shmid() const;
-
-  // public static functions
-  static bool remove(int);
-};
    -
    -

    Description

    -

    A basic X/Open System Interface (XSI) shared memory named object creation class. Initializes the shared memory segment. Inherits all basic functionality from basic_managed_memory_impl<CharType, AllocationAlgorithm, IndexType>

    -
    -

    -basic_managed_xsi_shared_memory - public - construct/copy/destruct

    -
      -
    1. -
      basic_managed_xsi_shared_memory();
      -

      Default constructor. Does nothing. Useful in combination with move semantics

      -
      2. -
    2. -
      basic_managed_xsi_shared_memory(create_only_t, const xsi_key & key, 
-                                std::size_t size, const void * addr = 0, 
-                                const permissions & perm = permissions());
      -

      Creates shared memory and creates and places the segment manager. This can throw.

      -
      3. -
    3. -
      basic_managed_xsi_shared_memory(open_or_create_t, const xsi_key & key, 
-                                std::size_t size, const void * addr = 0, 
-                                const permissions & perm = permissions());
      -

      Creates shared memory and creates and places the segment manager if segment was not created. If segment was created it connects to the segment. This can throw.

      -
      4. -
    4. -
      basic_managed_xsi_shared_memory(open_read_only_t, const xsi_key & key, 
-                                const void * addr = 0);
      -

      Connects to a created shared memory and its segment manager. in read-only mode. This can throw.

      -
      5. -
    5. -
      basic_managed_xsi_shared_memory(open_only_t, const xsi_key & key, 
-                                const void * addr = 0);
      -

      Connects to a created shared memory and its segment manager. This can throw.

      -
      6. -
    6. -
      basic_managed_xsi_shared_memory(basic_managed_xsi_shared_memory && moved);
      -

      Moves the ownership of "moved"'s managed memory to *this. Does not throw

      -
      7. -
    7. -
      basic_managed_xsi_shared_memory & 
-operator=(basic_managed_xsi_shared_memory && moved);
      -

      Moves the ownership of "moved"'s managed memory to *this. Does not throw

      -
      8. -
    8. -
      ~basic_managed_xsi_shared_memory();
      -

      Destroys *this and indicates that the calling process is finished using the resource. The destructor function will deallocate any system resources allocated by the system for use by this process for this resource. The resource can still be opened again calling the open constructor overload. To erase the resource from the system use remove().

      -
      9. -
    -
    -
    -

    -basic_managed_xsi_shared_memory public member functions

    -
      -
    1. -
      void swap(basic_managed_xsi_shared_memory & other);
      -

      Swaps the ownership of the managed shared memories managed by *this and other. Never throws.

      -
      2. -
    2. int get_shmid() const;
      3. -
    -
    -
    -

    -basic_managed_xsi_shared_memory public static functions

    -
    1. -
      static bool remove(int shmid);
      -

      Erases a XSI shared memory object identified by shmid from the system. Returns false on error. Never throws

      -
    -
    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/basic_managed_heap_memory.html b/doc/html/boost/interprocess/basic_managed_heap_memory.html index e7e82edb11..64fed072b0 100644 --- a/doc/html/boost/interprocess/basic_managed_heap_memory.html +++ b/doc/html/boost/interprocess/basic_managed_heap_memory.html @@ -40,53 +40,53 @@ typedef base_t::size_type size_type; // construct/copy/destruct - basic_managed_heap_memory(); - basic_managed_heap_memory(size_type); - basic_managed_heap_memory(basic_managed_heap_memory &&); - basic_managed_heap_memory & operator=(basic_managed_heap_memory &&); - ~basic_managed_heap_memory(); + basic_managed_heap_memory(); + basic_managed_heap_memory(size_type); + basic_managed_heap_memory(basic_managed_heap_memory &&); + basic_managed_heap_memory & operator=(basic_managed_heap_memory &&); + ~basic_managed_heap_memory(); - // public member functions - bool grow(size_type); - void swap(basic_managed_heap_memory &); + // public member functions + bool grow(size_type); + void swap(basic_managed_heap_memory &); };
    -

    Description

    +

    Description

    A basic heap memory named object creation class. Initializes the heap memory segment. Inherits all basic functionality from basic_managed_memory_impl<CharType, AllocationAlgorithm, IndexType>

    -

    +

    basic_managed_heap_memory public construct/copy/destruct

    1. -
      basic_managed_heap_memory();
      +
      basic_managed_heap_memory();

      Default constructor. Does nothing. Useful in combination with move semantics

    2. -
      basic_managed_heap_memory(size_type size);
      +
      basic_managed_heap_memory(size_type size);

      Creates heap memory and initializes the segment manager. This can throw.

    3. -
      basic_managed_heap_memory(basic_managed_heap_memory && moved);
      Moves the ownership of "moved"'s managed memory to *this. Does not throw.
      4. +
      basic_managed_heap_memory(basic_managed_heap_memory && moved);
      Moves the ownership of "moved"'s managed memory to *this. Does not throw.
    4. -
      basic_managed_heap_memory & operator=(basic_managed_heap_memory && moved);
      Moves the ownership of "moved"'s managed memory to *this. Does not throw.
      5. +
      basic_managed_heap_memory & operator=(basic_managed_heap_memory && moved);
      Moves the ownership of "moved"'s managed memory to *this. Does not throw.
    5. -
      ~basic_managed_heap_memory();
      +
      ~basic_managed_heap_memory();

      Destructor. Liberates the heap memory holding the managed data. Never throws.

    -

    -basic_managed_heap_memory public member functions

    +

    +basic_managed_heap_memory public member functions

    1. -
      bool grow(size_type extra_bytes);
      +
      bool grow(size_type extra_bytes);

      Tries to resize internal heap memory so that we have room for more objects. WARNING: If memory is reallocated, all the objects will be binary-copied to the new buffer. To be able to use this function, all pointers constructed in this buffer must be offset pointers. Otherwise, the result is undefined. Returns true if the growth has been successful, so you will have some extra bytes to allocate new objects. If returns false, the heap allocation has failed.

    2. -
      void swap(basic_managed_heap_memory & other);
      +
      void swap(basic_managed_heap_memory & other);

      Swaps the ownership of the managed heap memories managed by *this and other. Never throws.

    diff --git a/doc/html/boost/interprocess/basic_managed_mapped_file.html b/doc/html/boost/interprocess/basic_managed_mapped_file.html index 0d276e6e64..c29ba78876 100644 --- a/doc/html/boost/interprocess/basic_managed_mapped_file.html +++ b/doc/html/boost/interprocess/basic_managed_mapped_file.html @@ -40,34 +40,34 @@ typedef implementation_defined size_type; // construct/copy/destruct - basic_managed_mapped_file(); - basic_managed_mapped_file(create_only_t, const char *, size_type, + basic_managed_mapped_file(); + basic_managed_mapped_file(create_only_t, const char *, size_type, const void * = 0, const permissions & = permissions()); - basic_managed_mapped_file(open_or_create_t, const char *, size_type, + basic_managed_mapped_file(open_or_create_t, const char *, size_type, const void * = 0, const permissions & = permissions()); - basic_managed_mapped_file(open_only_t, const char *, const void * = 0); - basic_managed_mapped_file(open_copy_on_write_t, const char *, + basic_managed_mapped_file(open_only_t, const char *, const void * = 0); + basic_managed_mapped_file(open_copy_on_write_t, const char *, const void * = 0); - basic_managed_mapped_file(open_read_only_t, const char *, const void * = 0); - basic_managed_mapped_file(basic_managed_mapped_file &&); - basic_managed_mapped_file & operator=(basic_managed_mapped_file &&); - ~basic_managed_mapped_file(); + basic_managed_mapped_file(open_read_only_t, const char *, const void * = 0); + basic_managed_mapped_file(basic_managed_mapped_file &&); + basic_managed_mapped_file & operator=(basic_managed_mapped_file &&); + ~basic_managed_mapped_file(); - // public member functions - void swap(basic_managed_mapped_file &); - bool flush(); + // public member functions + void swap(basic_managed_mapped_file &); + bool flush(); - // public static functions - static bool grow(const char *, size_type); - static bool shrink_to_fit(const char *); + // public static functions + static bool grow(const char *, size_type); + static bool shrink_to_fit(const char *); };
    -

    Description

    +

    Description

    A basic mapped file named object creation class. Initializes the mapped file. Inherits all basic functionality from basic_managed_memory_impl<CharType, AllocationAlgorithm, IndexType>

    -

    +

    basic_managed_mapped_file public types

    @@ -78,81 +78,81 @@
    -

    +

    basic_managed_mapped_file public construct/copy/destruct

    1. -
      basic_managed_mapped_file();
      +
      basic_managed_mapped_file();

      Creates mapped file and creates and places the segment manager. This can throw.

    2. -
      basic_managed_mapped_file(create_only_t, const char * name, size_type size, 
+
      basic_managed_mapped_file(create_only_t, const char * name, size_type size, 
                           const void * addr = 0, 
                           const permissions & perm = permissions());
      
 
      Creates mapped file and creates and places the segment manager. This can throw.
    3. -
      basic_managed_mapped_file(open_or_create_t, const char * name, size_type size, 
+
      basic_managed_mapped_file(open_or_create_t, const char * name, size_type size, 
                           const void * addr = 0, 
                           const permissions & perm = permissions());
      
 
      Creates mapped file and creates and places the segment manager if segment was not created. If segment was created it connects to the segment. This can throw.
    4. -
      basic_managed_mapped_file(open_only_t, const char * name, 
+
      basic_managed_mapped_file(open_only_t, const char * name, 
                           const void * addr = 0);
      
 
      Connects to a created mapped file and its segment manager. This can throw.
    5. -
      basic_managed_mapped_file(open_copy_on_write_t, const char * name, 
+
      basic_managed_mapped_file(open_copy_on_write_t, const char * name, 
                           const void * addr = 0);
      
 
      Connects to a created mapped file and its segment manager in copy_on_write mode. This can throw.
    6. -
      basic_managed_mapped_file(open_read_only_t, const char * name, 
+
      basic_managed_mapped_file(open_read_only_t, const char * name, 
                           const void * addr = 0);
      
 
      Connects to a created mapped file and its segment manager in read-only mode. This can throw.
    7. -
      basic_managed_mapped_file(basic_managed_mapped_file && moved);
      +
      basic_managed_mapped_file(basic_managed_mapped_file && moved);

      Moves the ownership of "moved"'s managed memory to *this. Does not throw

    8. -
      basic_managed_mapped_file & operator=(basic_managed_mapped_file && moved);
      +
      basic_managed_mapped_file & operator=(basic_managed_mapped_file && moved);

      Moves the ownership of "moved"'s managed memory to *this. Does not throw

    9. -
      ~basic_managed_mapped_file();
      +
      ~basic_managed_mapped_file();

      Destroys *this and indicates that the calling process is finished using the resource. The destructor function will deallocate any system resources allocated by the system for use by this process for this resource. The resource can still be opened again calling the open constructor overload. To erase the resource from the system use remove().

    -

    -basic_managed_mapped_file public member functions

    +

    +basic_managed_mapped_file public member functions

    1. -
      void swap(basic_managed_mapped_file & other);
      +
      void swap(basic_managed_mapped_file & other);

      Swaps the ownership of the managed mapped memories managed by *this and other. Never throws.

    2. -
      bool flush();
      +
      bool flush();

      Flushes cached data to file. Never throws

    -

    -basic_managed_mapped_file public static functions

    +

    +basic_managed_mapped_file public static functions

    1. -
      static bool grow(const char * filename, size_type extra_bytes);
      +
      static bool grow(const char * filename, size_type extra_bytes);

      Tries to resize mapped file so that we have room for more objects.

      This function is not synchronized so no other thread or process should be reading or writing the file

    2. -
      static bool shrink_to_fit(const char * filename);
      +
      static bool shrink_to_fit(const char * filename);

      Tries to resize mapped file to minimized the size of the file.

      This function is not synchronized so no other thread or process should be reading or writing the file

      3. diff --git a/doc/html/boost/interprocess/basic_obufferstream.html b/doc/html/boost/interprocess/basic_obufferstream.html index 2cca0d9433..b786a05420 100644 --- a/doc/html/boost/interprocess/basic_obufferstream.html +++ b/doc/html/boost/interprocess/basic_obufferstream.html @@ -43,51 +43,51 @@ typedef std::basic_ios< char_type, CharTraits >::traits_type traits_type; // construct/copy/destruct - basic_obufferstream(std::ios_base::openmode = std::ios_base::out); - basic_obufferstream(CharT *, std::size_t, + basic_obufferstream(std::ios_base::openmode = std::ios_base::out); + basic_obufferstream(CharT *, std::size_t, std::ios_base::openmode = std::ios_base::out); - ~basic_obufferstream(); + ~basic_obufferstream(); - // public member functions - basic_bufferbuf< CharT, CharTraits > * rdbuf() const; - std::pair< CharT *, std::size_t > buffer() const; - void buffer(CharT *, std::size_t); + // public member functions + basic_bufferbuf< CharT, CharTraits > * rdbuf() const; + std::pair< CharT *, std::size_t > buffer() const; + void buffer(CharT *, std::size_t); };
    -

    Description

    +

    Description

    A basic_ostream class that uses a fixed size character buffer as its formatting buffer.

    -

    +

    basic_obufferstream public construct/copy/destruct

    1. -
      basic_obufferstream(std::ios_base::openmode mode = std::ios_base::out);
      +
      basic_obufferstream(std::ios_base::openmode mode = std::ios_base::out);

      Constructor. Does not throw.

    2. -
      basic_obufferstream(CharT * buf, std::size_t length, 
+
      basic_obufferstream(CharT * buf, std::size_t length, 
                     std::ios_base::openmode mode = std::ios_base::out);
      
 
      Constructor. Assigns formatting buffer. Does not throw.
      3. -
    3. ~basic_obufferstream();
      4. +
    4. ~basic_obufferstream();
    -

    -basic_obufferstream public member functions

    +

    +basic_obufferstream public member functions

    1. -
      basic_bufferbuf< CharT, CharTraits > * rdbuf() const;
      +
      basic_bufferbuf< CharT, CharTraits > * rdbuf() const;

      Returns the address of the stored stream buffer.

    2. -
      std::pair< CharT *, std::size_t > buffer() const;
      +
      std::pair< CharT *, std::size_t > buffer() const;

      Returns the pointer and size of the internal buffer. Does not throw.

    3. -
      void buffer(CharT * buf, std::size_t length);
      +
      void buffer(CharT * buf, std::size_t length);

      Sets the underlying buffer to a new value. Resets stream position. Does not throw.

    diff --git a/doc/html/boost/interprocess/basic_ovectorstream.html b/doc/html/boost/interprocess/basic_ovectorstream.html index e7a9cad802..083cc39908 100644 --- a/doc/html/boost/interprocess/basic_ovectorstream.html +++ b/doc/html/boost/interprocess/basic_ovectorstream.html @@ -46,56 +46,56 @@ typedef std::basic_ios< char_type, CharTraits >::traits_type traits_type; // construct/copy/destruct - basic_ovectorstream(std::ios_base::openmode = std::ios_base::out); + basic_ovectorstream(std::ios_base::openmode = std::ios_base::out); template<typename VectorParameter> - basic_ovectorstream(const VectorParameter &, + basic_ovectorstream(const VectorParameter &, std::ios_base::openmode = std::ios_base::out); - // public member functions - basic_vectorbuf< CharVector, CharTraits > * rdbuf() const; - void swap_vector(vector_type &); - const vector_type & vector() const; - void reserve(typename vector_type::size_type); + // public member functions + basic_vectorbuf< CharVector, CharTraits > * rdbuf() const; + void swap_vector(vector_type &); + const vector_type & vector() const; + void reserve(typename vector_type::size_type); };
    -

    Description

    +

    Description

    A basic_ostream class that holds a character vector specified by CharVector template parameter as its formatting buffer. The vector must have contiguous storage, like std::vector, boost::interprocess::vector or boost::interprocess::basic_string

    -

    +

    basic_ovectorstream public construct/copy/destruct

    1. -
      basic_ovectorstream(std::ios_base::openmode mode = std::ios_base::out);
      +
      basic_ovectorstream(std::ios_base::openmode mode = std::ios_base::out);

      Constructor. Throws if vector_type default constructor throws. 

    2. template<typename VectorParameter> 
-  basic_ovectorstream(const VectorParameter & param, 
+  basic_ovectorstream(const VectorParameter & param, 
                       std::ios_base::openmode mode = std::ios_base::out);

      Constructor. Throws if vector_type(const VectorParameter &param) throws.

    -

    -basic_ovectorstream public member functions

    +

    +basic_ovectorstream public member functions

    1. -
      basic_vectorbuf< CharVector, CharTraits > * rdbuf() const;
      +
      basic_vectorbuf< CharVector, CharTraits > * rdbuf() const;

      Returns the address of the stored stream buffer.

    2. -
      void swap_vector(vector_type & vect);
      +
      void swap_vector(vector_type & vect);

      Swaps the underlying vector with the passed vector. This function resets the write position in the stream. Does not throw.

    3. -
      const vector_type & vector() const;
      +
      const vector_type & vector() const;

      Returns a const reference to the internal vector. Does not throw.

    4. -
      void reserve(typename vector_type::size_type size);
      +
      void reserve(typename vector_type::size_type size);

      Calls reserve() method of the internal vector. Resets the stream to the first position. Throws if the internals vector's reserve throws.

    diff --git a/doc/html/boost/interprocess/basic_vectorbuf.html b/doc/html/boost/interprocess/basic_vectorbuf.html index 5418391225..5b36221e84 100644 --- a/doc/html/boost/interprocess/basic_vectorbuf.html +++ b/doc/html/boost/interprocess/basic_vectorbuf.html @@ -46,56 +46,56 @@ typedef CharTraits traits_type; // construct/copy/destruct - explicit basic_vectorbuf(std::ios_base::openmode = std::ios_base::in|std::ios_base::out); + explicit basic_vectorbuf(std::ios_base::openmode = std::ios_base::in|std::ios_base::out); template<typename VectorParameter> - explicit basic_vectorbuf(const VectorParameter &, + explicit basic_vectorbuf(const VectorParameter &, std::ios_base::openmode = std::ios_base::in|std::ios_base::out); - // public member functions - void swap_vector(vector_type &); - const vector_type & vector() const; - void reserve(typename vector_type::size_type); - void clear(); + // public member functions + void swap_vector(vector_type &); + const vector_type & vector() const; + void reserve(typename vector_type::size_type); + void clear(); };
    -

    Description

    +

    Description

    A streambuf class that controls the transmission of elements to and from a basic_ivectorstream, basic_ovectorstream or basic_vectorstream. It holds a character vector specified by CharVector template parameter as its formatting buffer. The vector must have contiguous storage, like std::vector, boost::interprocess::vector or boost::interprocess::basic_string

    -

    +

    basic_vectorbuf public construct/copy/destruct

    1. -
      explicit basic_vectorbuf(std::ios_base::openmode mode = std::ios_base::in|std::ios_base::out);
      +
      explicit basic_vectorbuf(std::ios_base::openmode mode = std::ios_base::in|std::ios_base::out);

      Constructor. Throws if vector_type default constructor throws. 

    2. template<typename VectorParameter> 
-  explicit basic_vectorbuf(const VectorParameter & param, 
+  explicit basic_vectorbuf(const VectorParameter & param, 
                            std::ios_base::openmode mode = std::ios_base::in|std::ios_base::out);

      Constructor. Throws if vector_type(const VectorParameter &param) throws.

    -

    -basic_vectorbuf public member functions

    +

    +basic_vectorbuf public member functions

    1. -
      void swap_vector(vector_type & vect);
      +
      void swap_vector(vector_type & vect);

      Swaps the underlying vector with the passed vector. This function resets the read/write position in the stream. Does not throw.

    2. -
      const vector_type & vector() const;
      +
      const vector_type & vector() const;

      Returns a const reference to the internal vector. Does not throw.

    3. -
      void reserve(typename vector_type::size_type size);
      +
      void reserve(typename vector_type::size_type size);

      Preallocates memory from the internal vector. Resets the stream to the first position. Throws if the internals vector's memory allocation throws.

    4. -
      void clear();
      +
      void clear();

      Calls clear() method of the internal vector. Resets the stream to the first position.

    diff --git a/doc/html/boost/interprocess/basic_vectorstream.html b/doc/html/boost/interprocess/basic_vectorstream.html index 44c84ccc48..5fd4f166f8 100644 --- a/doc/html/boost/interprocess/basic_vectorstream.html +++ b/doc/html/boost/interprocess/basic_vectorstream.html @@ -46,58 +46,58 @@ typedef std::basic_ios< char_type, CharTraits >::traits_type traits_type; // construct/copy/destruct - basic_vectorstream(std::ios_base::openmode = std::ios_base::in|std::ios_base::out); + basic_vectorstream(std::ios_base::openmode = std::ios_base::in|std::ios_base::out); template<typename VectorParameter> - basic_vectorstream(const VectorParameter &, + basic_vectorstream(const VectorParameter &, std::ios_base::openmode = std::ios_base::in|std::ios_base::out); - // public member functions - basic_vectorbuf< CharVector, CharTraits > * rdbuf() const; - void swap_vector(vector_type &); - const vector_type & vector() const; - void reserve(typename vector_type::size_type); - void clear(); + // public member functions + basic_vectorbuf< CharVector, CharTraits > * rdbuf() const; + void swap_vector(vector_type &); + const vector_type & vector() const; + void reserve(typename vector_type::size_type); + void clear(); };
    -

    Description

    +

    Description

    A basic_iostream class that holds a character vector specified by CharVector template parameter as its formatting buffer. The vector must have contiguous storage, like std::vector, boost::interprocess::vector or boost::interprocess::basic_string

    -

    +

    basic_vectorstream public construct/copy/destruct

    1. -
      basic_vectorstream(std::ios_base::openmode mode = std::ios_base::in|std::ios_base::out);
      +
      basic_vectorstream(std::ios_base::openmode mode = std::ios_base::in|std::ios_base::out);

      Constructor. Throws if vector_type default constructor throws. 

    2. template<typename VectorParameter> 
-  basic_vectorstream(const VectorParameter & param, 
+  basic_vectorstream(const VectorParameter & param, 
                      std::ios_base::openmode mode = std::ios_base::in|std::ios_base::out);

      Constructor. Throws if vector_type(const VectorParameter &param) throws.

    -

    -basic_vectorstream public member functions

    +

    +basic_vectorstream public member functions

      -
    1. basic_vectorbuf< CharVector, CharTraits > * rdbuf() const;
      2. +
    2. basic_vectorbuf< CharVector, CharTraits > * rdbuf() const;
    3. -
      void swap_vector(vector_type & vect);
      +
      void swap_vector(vector_type & vect);

      Swaps the underlying vector with the passed vector. This function resets the read/write position in the stream. Does not throw.

    4. -
      const vector_type & vector() const;
      +
      const vector_type & vector() const;

      Returns a const reference to the internal vector. Does not throw.

    5. -
      void reserve(typename vector_type::size_type size);
      +
      void reserve(typename vector_type::size_type size);

      Calls reserve() method of the internal vector. Resets the stream to the first position. Throws if the internals vector's reserve throws.

    6. -
      void clear();
      +
      void clear();

      Calls clear() method of the internal vector. Resets the stream to the first position.

    diff --git a/doc/html/boost/interprocess/cached_adaptive_pool.html b/doc/html/boost/interprocess/cached_adaptive_pool.html index 63072bebed..a9d2ec0c9e 100644 --- a/doc/html/boost/interprocess/cached_adaptive_pool.html +++ b/doc/html/boost/interprocess/cached_adaptive_pool.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -55,183 +55,183 @@ }; // construct/copy/destruct - cached_adaptive_pool(segment_manager *); - cached_adaptive_pool(const cached_adaptive_pool &); + cached_adaptive_pool(segment_manager *); + cached_adaptive_pool(const cached_adaptive_pool &); template<typename T2> - cached_adaptive_pool(const cached_adaptive_pool< T2, SegmentManager, NodesPerBlock, MaxFreeBlocks, OverheadPercent > &); + cached_adaptive_pool(const cached_adaptive_pool< T2, SegmentManager, NodesPerBlock, MaxFreeBlocks, OverheadPercent > &); template<typename T2, typename SegmentManager2, std::size_t N2, std::size_t F2, unsigned char OP2> cached_adaptive_pool & - operator=(const cached_adaptive_pool< T2, SegmentManager2, N2, F2, OP2 > &); - cached_adaptive_pool & operator=(const cached_adaptive_pool &); - ~cached_adaptive_pool(); + operator=(const cached_adaptive_pool< T2, SegmentManager2, N2, F2, OP2 > &); + cached_adaptive_pool & operator=(const cached_adaptive_pool &); + ~cached_adaptive_pool(); - // public member functions - node_pool_t * get_node_pool() const; - segment_manager * get_segment_manager() const; - size_type max_size() const; - pointer allocate(size_type, cvoid_pointer = 0); - void deallocate(const pointer &, size_type); - void deallocate_free_blocks(); - pointer address(reference) const; - const_pointer address(const_reference) const; - void construct(const pointer &, const_reference); - void destroy(const pointer &); - size_type size(const pointer &) const; - pointer allocation_command(boost::interprocess::allocation_type, size_type, + // public member functions + node_pool_t * get_node_pool() const; + segment_manager * get_segment_manager() const; + size_type max_size() const; + pointer allocate(size_type, cvoid_pointer = 0); + void deallocate(const pointer &, size_type); + void deallocate_free_blocks(); + pointer address(reference) const; + const_pointer address(const_reference) const; + void construct(const pointer &, const_reference); + void destroy(const pointer &); + size_type size(const pointer &) const; + pointer allocation_command(boost::interprocess::allocation_type, size_type, size_type &, pointer &); - void allocate_many(size_type, size_type, multiallocation_chain &); - void allocate_many(const size_type *, size_type, multiallocation_chain &); - void deallocate_many(multiallocation_chain &); - pointer allocate_one(); - multiallocation_chain allocate_individual(size_type); - void deallocate_one(const pointer &); - void deallocate_individual(multiallocation_chain &); - void set_max_cached_nodes(size_type); - size_type get_max_cached_nodes() const; + void allocate_many(size_type, size_type, multiallocation_chain &); + void allocate_many(const size_type *, size_type, multiallocation_chain &); + void deallocate_many(multiallocation_chain &); + pointer allocate_one(); + multiallocation_chain allocate_individual(size_type); + void deallocate_one(const pointer &); + void deallocate_individual(multiallocation_chain &); + void set_max_cached_nodes(size_type); + size_type get_max_cached_nodes() const; - // friend functions - friend void swap(self_t &, self_t &); + // friend functions + friend void swap(self_t &, self_t &); };
    -

    Description

    +

    Description

    An STL node allocator that uses a segment manager as memory source. The internal pointer type will of the same type (raw, smart) as "typename SegmentManager::void_pointer" type. This allows placing the allocator in shared memory, memory mapped-files, etc...

    This node allocator shares a segregated storage between all instances of cached_adaptive_pool with equal sizeof(T) placed in the same memory segment. But also caches some nodes privately to avoid some synchronization overhead.

    NodesPerBlock is the minimum number of nodes of nodes allocated at once when the allocator needs runs out of nodes. MaxFreeBlocks is the maximum number of totally free blocks that the adaptive node pool will hold. The rest of the totally free blocks will be deallocated with the segment manager.

    OverheadPercent is the (approximated) maximum size overhead (1-20%) of the allocator: (memory usable for nodes / total memory allocated from the segment manager)

    -

    +

    cached_adaptive_pool public construct/copy/destruct

    1. -
      cached_adaptive_pool(segment_manager * segment_mngr);
      +
      cached_adaptive_pool(segment_manager * segment_mngr);

      Constructor from a segment manager. If not present, constructs a node pool. Increments the reference count of the associated node pool. Can throw boost::interprocess::bad_alloc

    2. -
      cached_adaptive_pool(const cached_adaptive_pool & other);
      +
      cached_adaptive_pool(const cached_adaptive_pool & other);

      Copy constructor from other cached_adaptive_pool. Increments the reference count of the associated node pool. Never throws 

    3. template<typename T2> 
-  cached_adaptive_pool(const cached_adaptive_pool< T2, SegmentManager, NodesPerBlock, MaxFreeBlocks, OverheadPercent > & other);
      + cached_adaptive_pool(const cached_adaptive_pool< T2, SegmentManager, NodesPerBlock, MaxFreeBlocks, OverheadPercent > & other);

      Copy constructor from related cached_adaptive_pool. If not present, constructs a node pool. Increments the reference count of the associated node pool. Can throw boost::interprocess::bad_alloc 

    4. template<typename T2, typename SegmentManager2, std::size_t N2, 
          std::size_t F2, unsigned char OP2> 
   cached_adaptive_pool & 
-  operator=(const cached_adaptive_pool< T2, SegmentManager2, N2, F2, OP2 > &);
      + operator=(const cached_adaptive_pool< T2, SegmentManager2, N2, F2, OP2 > &);

      Not assignable from related cached_adaptive_pool

    5. -
      cached_adaptive_pool & operator=(const cached_adaptive_pool &);
      +
      cached_adaptive_pool & operator=(const cached_adaptive_pool &);

      Not assignable from other cached_adaptive_pool

    6. -
      ~cached_adaptive_pool();
      +
      ~cached_adaptive_pool();

      Destructor, removes node_pool_t from memory if its reference count reaches to zero. Never throws

    -

    -cached_adaptive_pool public member functions

    +

    +cached_adaptive_pool public member functions

    1. -
      node_pool_t * get_node_pool() const;
      +
      node_pool_t * get_node_pool() const;

      Returns a pointer to the node pool. Never throws

    2. -
      segment_manager * get_segment_manager() const;
      +
      segment_manager * get_segment_manager() const;

      Returns the segment manager. Never throws

    3. -
      size_type max_size() const;
      +
      size_type max_size() const;

      Returns the number of elements that could be allocated. Never throws

    4. -
      pointer allocate(size_type count, cvoid_pointer hint = 0);
      +
      pointer allocate(size_type count, cvoid_pointer hint = 0);

      Allocate memory for an array of count elements. Throws boost::interprocess::bad_alloc if there is no enough memory

    5. -
      void deallocate(const pointer & ptr, size_type count);
      +
      void deallocate(const pointer & ptr, size_type count);

      Deallocate allocated memory. Never throws

    6. -
      void deallocate_free_blocks();
      +
      void deallocate_free_blocks();

      Deallocates all free blocks of the pool

    7. -
      pointer address(reference value) const;
      +
      pointer address(reference value) const;

      Returns address of mutable object. Never throws

    8. -
      const_pointer address(const_reference value) const;
      +
      const_pointer address(const_reference value) const;

      Returns address of non mutable object. Never throws

    9. -
      void construct(const pointer & ptr, const_reference v);
      +
      void construct(const pointer & ptr, const_reference v);

      Copy construct an object. Throws if T's copy constructor throws

    10. -
      void destroy(const pointer & ptr);
      +
      void destroy(const pointer & ptr);

      Destroys object. Throws if object's destructor throws

    11. -
      size_type size(const pointer & p) const;
      +
      size_type size(const pointer & p) const;

      Returns maximum the number of objects the previously allocated memory pointed by p can hold. This size only works for memory allocated with allocate, allocation_command and allocate_many.

      12. -
    12. pointer allocation_command(boost::interprocess::allocation_type command, 
+
    13. pointer allocation_command(boost::interprocess::allocation_type command, 
                            size_type limit_size, 
                            size_type & prefer_in_recvd_out_size, 
                            pointer & reuse);
      14. 
 
    14. 
-
      void allocate_many(size_type elem_size, size_type num_elements, 
+
      void allocate_many(size_type elem_size, size_type num_elements, 
                    multiallocation_chain & chain);
      
 
      Allocates many elements of size elem_size in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. The elements must be deallocated with deallocate(...) 
      
 
      15. 
 
    15. 
-
      void allocate_many(const size_type * elem_sizes, size_type n_elements, 
+
      void allocate_many(const size_type * elem_sizes, size_type n_elements, 
                    multiallocation_chain & chain);
      
 
      Allocates n_elements elements, each one of size elem_sizes[i]in a contiguous block of memory. The elements must be deallocated 
      
 
      16. 
 
    16. 
-
      void deallocate_many(multiallocation_chain & chain);
      
+
      void deallocate_many(multiallocation_chain & chain);
      
 
      Allocates many elements of size elem_size in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. The elements must be deallocated with deallocate(...) 
      
 
      17. 
 
    17. 
-
      pointer allocate_one();
      
+
      pointer allocate_one();
      
 
      Allocates just one object. Memory allocated with this function must be deallocated only with deallocate_one(). Throws boost::interprocess::bad_alloc if there is no enough memory 
      
 
      18. 
 
    18. 
-
      multiallocation_chain allocate_individual(size_type num_elements);
      
+
      multiallocation_chain allocate_individual(size_type num_elements);
      
 
      Allocates many elements of size == 1 in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. Memory allocated with this function must be deallocated only with deallocate_one(). 
      
 
      19. 
 
    19. 
-
      void deallocate_one(const pointer & p);
      
+
      void deallocate_one(const pointer & p);
      
 
      Deallocates memory previously allocated with allocate_one(). You should never use deallocate_one to deallocate memory allocated with other functions different from allocate_one(). Never throws 
      
 
      20. 
 
    20. 
-
      void deallocate_individual(multiallocation_chain & chain);
      
+
      void deallocate_individual(multiallocation_chain & chain);
      
 
      Allocates many elements of size == 1 in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. Memory allocated with this function must be deallocated only with deallocate_one(). 
      
 
      21. 
 
    21. 
-
      void set_max_cached_nodes(size_type newmax);
      
+
      void set_max_cached_nodes(size_type newmax);
      
 
      Sets the new max cached nodes value. This can provoke deallocations if "newmax" is less than current cached nodes. Never throws 
      
 
      22. 
 
    22. 
-
      size_type get_max_cached_nodes() const;
      
+
      size_type get_max_cached_nodes() const;
      
 
      Returns the max cached nodes parameter. Never throws 
      
 
      23.
    -

    -cached_adaptive_pool friend functions

    +

    +cached_adaptive_pool friend functions

    1. -
      friend void swap(self_t & alloc1, self_t & alloc2);
      +
      friend void swap(self_t & alloc1, self_t & alloc2);

      Swaps allocators. Does not throw. If each allocator is placed in a different memory segment, the result is undefined.

    @@ -247,7 +247,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/cached_adaptive_pool/rebind.html b/doc/html/boost/interprocess/cached_adaptive_pool/rebind.html index ca000c32e4..b365729489 100644 --- a/doc/html/boost/interprocess/cached_adaptive_pool/rebind.html +++ b/doc/html/boost/interprocess/cached_adaptive_pool/rebind.html @@ -6,9 +6,9 @@ - + - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -39,7 +39,7 @@ typedef cached_adaptive_pool< T2, SegmentManager, NodesPerBlock, MaxFreeBlocks, OverheadPercent > other; };
    -

    Description

    +

    Description

    Obtains cached_adaptive_pool from cached_adaptive_pool

    @@ -53,7 +53,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/cached_node_allocator.html b/doc/html/boost/interprocess/cached_node_allocator.html index ce887f58c6..718994bad7 100644 --- a/doc/html/boost/interprocess/cached_node_allocator.html +++ b/doc/html/boost/interprocess/cached_node_allocator.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -54,177 +54,177 @@ }; // construct/copy/destruct - cached_node_allocator(segment_manager *); - cached_node_allocator(const cached_node_allocator &); + cached_node_allocator(segment_manager *); + cached_node_allocator(const cached_node_allocator &); template<typename T2> - cached_node_allocator(const cached_node_allocator< T2, SegmentManager, NodesPerBlock > &); + cached_node_allocator(const cached_node_allocator< T2, SegmentManager, NodesPerBlock > &); template<typename T2, typename SegmentManager2, std::size_t N2> cached_node_allocator & - operator=(const cached_node_allocator< T2, SegmentManager2, N2 > &); - cached_node_allocator & operator=(const cached_node_allocator &); - ~cached_node_allocator(); + operator=(const cached_node_allocator< T2, SegmentManager2, N2 > &); + cached_node_allocator & operator=(const cached_node_allocator &); + ~cached_node_allocator(); - // public member functions - node_pool_t * get_node_pool() const; - segment_manager * get_segment_manager() const; - size_type max_size() const; - pointer allocate(size_type, cvoid_pointer = 0); - void deallocate(const pointer &, size_type); - void deallocate_free_blocks(); - pointer address(reference) const; - const_pointer address(const_reference) const; - void construct(const pointer &, const_reference); - void destroy(const pointer &); - size_type size(const pointer &) const; - pointer allocation_command(boost::interprocess::allocation_type, size_type, + // public member functions + node_pool_t * get_node_pool() const; + segment_manager * get_segment_manager() const; + size_type max_size() const; + pointer allocate(size_type, cvoid_pointer = 0); + void deallocate(const pointer &, size_type); + void deallocate_free_blocks(); + pointer address(reference) const; + const_pointer address(const_reference) const; + void construct(const pointer &, const_reference); + void destroy(const pointer &); + size_type size(const pointer &) const; + pointer allocation_command(boost::interprocess::allocation_type, size_type, size_type &, pointer &); - void allocate_many(size_type, size_type, multiallocation_chain &); - void allocate_many(const size_type *, size_type, multiallocation_chain &); - void deallocate_many(multiallocation_chain &); - pointer allocate_one(); - multiallocation_chain allocate_individual(size_type); - void deallocate_one(const pointer &); - void deallocate_individual(multiallocation_chain); - void set_max_cached_nodes(size_type); - size_type get_max_cached_nodes() const; + void allocate_many(size_type, size_type, multiallocation_chain &); + void allocate_many(const size_type *, size_type, multiallocation_chain &); + void deallocate_many(multiallocation_chain &); + pointer allocate_one(); + multiallocation_chain allocate_individual(size_type); + void deallocate_one(const pointer &); + void deallocate_individual(multiallocation_chain); + void set_max_cached_nodes(size_type); + size_type get_max_cached_nodes() const; - // friend functions - friend void swap(self_t &, self_t &); + // friend functions + friend void swap(self_t &, self_t &); };
    -

    Description

    +

    Description

    -

    +

    cached_node_allocator public construct/copy/destruct

    1. -
      cached_node_allocator(segment_manager * segment_mngr);
      +
      cached_node_allocator(segment_manager * segment_mngr);

      Constructor from a segment manager. If not present, constructs a node pool. Increments the reference count of the associated node pool. Can throw boost::interprocess::bad_alloc

    2. -
      cached_node_allocator(const cached_node_allocator & other);
      +
      cached_node_allocator(const cached_node_allocator & other);

      Copy constructor from other cached_node_allocator. Increments the reference count of the associated node pool. Never throws 

    3. template<typename T2> 
-  cached_node_allocator(const cached_node_allocator< T2, SegmentManager, NodesPerBlock > & other);
      + cached_node_allocator(const cached_node_allocator< T2, SegmentManager, NodesPerBlock > & other);

      Copy constructor from related cached_node_allocator. If not present, constructs a node pool. Increments the reference count of the associated node pool. Can throw boost::interprocess::bad_alloc 

    4. template<typename T2, typename SegmentManager2, std::size_t N2> 
   cached_node_allocator & 
-  operator=(const cached_node_allocator< T2, SegmentManager2, N2 > &);
      + operator=(const cached_node_allocator< T2, SegmentManager2, N2 > &);

      Not assignable from related cached_node_allocator

    5. -
      cached_node_allocator & operator=(const cached_node_allocator &);
      +
      cached_node_allocator & operator=(const cached_node_allocator &);

      Not assignable from other cached_node_allocator

    6. -
      ~cached_node_allocator();
      +
      ~cached_node_allocator();

      Destructor, removes node_pool_t from memory if its reference count reaches to zero. Never throws

    -

    -cached_node_allocator public member functions

    +

    +cached_node_allocator public member functions

    1. -
      node_pool_t * get_node_pool() const;
      +
      node_pool_t * get_node_pool() const;

      Returns a pointer to the node pool. Never throws

    2. -
      segment_manager * get_segment_manager() const;
      +
      segment_manager * get_segment_manager() const;

      Returns the segment manager. Never throws

    3. -
      size_type max_size() const;
      +
      size_type max_size() const;

      Returns the number of elements that could be allocated. Never throws

    4. -
      pointer allocate(size_type count, cvoid_pointer hint = 0);
      +
      pointer allocate(size_type count, cvoid_pointer hint = 0);

      Allocate memory for an array of count elements. Throws boost::interprocess::bad_alloc if there is no enough memory

    5. -
      void deallocate(const pointer & ptr, size_type count);
      +
      void deallocate(const pointer & ptr, size_type count);

      Deallocate allocated memory. Never throws

    6. -
      void deallocate_free_blocks();
      +
      void deallocate_free_blocks();

      Deallocates all free blocks of the pool

    7. -
      pointer address(reference value) const;
      +
      pointer address(reference value) const;

      Returns address of mutable object. Never throws

    8. -
      const_pointer address(const_reference value) const;
      +
      const_pointer address(const_reference value) const;

      Returns address of non mutable object. Never throws

    9. -
      void construct(const pointer & ptr, const_reference v);
      +
      void construct(const pointer & ptr, const_reference v);

      Default construct an object. Throws if T's default constructor throws

    10. -
      void destroy(const pointer & ptr);
      +
      void destroy(const pointer & ptr);

      Destroys object. Throws if object's destructor throws

    11. -
      size_type size(const pointer & p) const;
      +
      size_type size(const pointer & p) const;

      Returns maximum the number of objects the previously allocated memory pointed by p can hold. This size only works for memory allocated with allocate, allocation_command and allocate_many.

      12. -
    12. pointer allocation_command(boost::interprocess::allocation_type command, 
+
    13. pointer allocation_command(boost::interprocess::allocation_type command, 
                            size_type limit_size, 
                            size_type & prefer_in_recvd_out_size, 
                            pointer & reuse);
      14. 
 
    14. 
-
      void allocate_many(size_type elem_size, size_type num_elements, 
+
      void allocate_many(size_type elem_size, size_type num_elements, 
                    multiallocation_chain & chain);
      
 
      Allocates many elements of size elem_size in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. The elements must be deallocated with deallocate(...) 
      
 
      15. 
 
    15. 
-
      void allocate_many(const size_type * elem_sizes, size_type n_elements, 
+
      void allocate_many(const size_type * elem_sizes, size_type n_elements, 
                    multiallocation_chain & chain);
      
 
      Allocates n_elements elements, each one of size elem_sizes[i]in a contiguous block of memory. The elements must be deallocated 
      
 
      16. 
 
    16. 
-
      void deallocate_many(multiallocation_chain & chain);
      
+
      void deallocate_many(multiallocation_chain & chain);
      
 
      Allocates many elements of size elem_size in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. The elements must be deallocated with deallocate(...) 
      
 
      17. 
 
    17. 
-
      pointer allocate_one();
      
+
      pointer allocate_one();
      
 
      Allocates just one object. Memory allocated with this function must be deallocated only with deallocate_one(). Throws boost::interprocess::bad_alloc if there is no enough memory 
      
 
      18. 
 
    18. 
-
      multiallocation_chain allocate_individual(size_type num_elements);
      
+
      multiallocation_chain allocate_individual(size_type num_elements);
      
 
      Allocates many elements of size == 1 in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. Memory allocated with this function must be deallocated only with deallocate_one(). 
      
 
      19. 
 
    19. 
-
      void deallocate_one(const pointer & p);
      
+
      void deallocate_one(const pointer & p);
      
 
      Deallocates memory previously allocated with allocate_one(). You should never use deallocate_one to deallocate memory allocated with other functions different from allocate_one(). Never throws 
      
 
      20. 
 
    20. 
-
      void deallocate_individual(multiallocation_chain it);
      
+
      void deallocate_individual(multiallocation_chain it);
      
 
      Allocates many elements of size == 1 in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. Memory allocated with this function must be deallocated only with deallocate_one(). 
      
 
      21. 
 
    21. 
-
      void set_max_cached_nodes(size_type newmax);
      
+
      void set_max_cached_nodes(size_type newmax);
      
 
      Sets the new max cached nodes value. This can provoke deallocations if "newmax" is less than current cached nodes. Never throws 
      
 
      22. 
 
    22. 
-
      size_type get_max_cached_nodes() const;
      
+
      size_type get_max_cached_nodes() const;
      
 
      Returns the max cached nodes parameter. Never throws 
      
 
      23.
    -

    -cached_node_allocator friend functions

    +

    +cached_node_allocator friend functions

    1. -
      friend void swap(self_t & alloc1, self_t & alloc2);
      +
      friend void swap(self_t & alloc1, self_t & alloc2);

      Swaps allocators. Does not throw. If each allocator is placed in a different memory segment, the result is undefined.

    @@ -240,7 +240,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/cached_node_allocator/rebind.html b/doc/html/boost/interprocess/cached_node_allocator/rebind.html index df1eed6703..cb294f93d5 100644 --- a/doc/html/boost/interprocess/cached_node_allocator/rebind.html +++ b/doc/html/boost/interprocess/cached_node_allocator/rebind.html @@ -6,9 +6,9 @@ - + - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -39,7 +39,7 @@ typedef cached_node_allocator< T2, SegmentManager > other; };
    -

    Description

    +

    Description

    Obtains cached_node_allocator from cached_node_allocator

    @@ -53,7 +53,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/create_only.html b/doc/html/boost/interprocess/create_only.html index 134d34ccd8..c6de40c2b6 100644 --- a/doc/html/boost/interprocess/create_only.html +++ b/doc/html/boost/interprocess/create_only.html @@ -34,7 +34,7 @@ static const create_only_t create_only;
    -

    Description

    +

    Description

    Value to indicate that the resource must be only created

    diff --git a/doc/html/boost/interprocess/create_only_t.html b/doc/html/boost/interprocess/create_only_t.html index d532bf8a1b..244f461e0d 100644 --- a/doc/html/boost/interprocess/create_only_t.html +++ b/doc/html/boost/interprocess/create_only_t.html @@ -36,7 +36,7 @@ struct create_only_t { };
    -

    Description

    +

    Description

    Tag to indicate that the resource must be only created

    diff --git a/doc/html/boost/interprocess/defer_lock.html b/doc/html/boost/interprocess/defer_lock.html index fb3ee51631..e7034445d9 100644 --- a/doc/html/boost/interprocess/defer_lock.html +++ b/doc/html/boost/interprocess/defer_lock.html @@ -34,7 +34,7 @@ static const defer_lock_type defer_lock;
    -

    Description

    +

    Description

    An object indicating that the locking must be deferred.

    diff --git a/doc/html/boost/interprocess/deleter.html b/doc/html/boost/interprocess/deleter.html index 4f1a851ac0..abdea55745 100644 --- a/doc/html/boost/interprocess/deleter.html +++ b/doc/html/boost/interprocess/deleter.html @@ -39,26 +39,26 @@ typedef boost::intrusive::pointer_traits< typename SegmentManager::void_pointer >::template rebind_pointer< T >::type pointer; // construct/copy/destruct - deleter(segment_manager_pointer); + deleter(segment_manager_pointer); - // public member functions - void operator()(const pointer &); + // public member functions + void operator()(const pointer &); };
    -

    Description

    +

    Description

    A deleter that uses the segment manager's destroy_ptr function to destroy the passed pointer resource.

    This deleter is used

    -

    +

    deleter public construct/copy/destruct

    -
    1. deleter(segment_manager_pointer pmngr);
    +
    1. deleter(segment_manager_pointer pmngr);
    -

    -deleter public member functions

    -
    1. void operator()(const pointer & p);
    +

    +deleter public member functions

    +
    1. void operator()(const pointer & p);
    diff --git a/doc/html/boost/interprocess/enable_shared_from_this.html b/doc/html/boost/interprocess/enable_shared_from_this.html index b6f52d3e22..ca6750a4bd 100644 --- a/doc/html/boost/interprocess/enable_shared_from_this.html +++ b/doc/html/boost/interprocess/enable_shared_from_this.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -36,19 +36,19 @@ class enable_shared_from_this { public: - // public member functions - shared_ptr< T, A, D > shared_from_this(); - shared_ptr< T const, A, D > shared_from_this() const; + // public member functions + shared_ptr< T, A, D > shared_from_this(); + shared_ptr< T const, A, D > shared_from_this() const; };
    -

    Description

    +

    Description

    This class is used as a base class that allows a shared_ptr to the current object to be obtained from within a member function. enable_shared_from_this defines two member functions called shared_from_this that return a shared_ptr<T> and shared_ptr<T const>, depending on constness, to this.

    -

    -enable_shared_from_this public member functions

    +

    +enable_shared_from_this public member functions

      -
    1. shared_ptr< T, A, D > shared_from_this();
      2. -
    2. shared_ptr< T const, A, D > shared_from_this() const;
      3. +
    3. shared_ptr< T, A, D > shared_from_this();
      4. +
    4. shared_ptr< T const, A, D > shared_from_this() const;
    @@ -63,7 +63,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/file_lock.html b/doc/html/boost/interprocess/file_lock.html index 9e3f43ac1f..616a7a9913 100644 --- a/doc/html/boost/interprocess/file_lock.html +++ b/doc/html/boost/interprocess/file_lock.html @@ -36,90 +36,90 @@ class file_lock { public: // construct/copy/destruct - file_lock(); - file_lock(const char *); - file_lock(file_lock &&); - file_lock & operator=(file_lock &&); - ~file_lock(); + file_lock(); + file_lock(const char *); + file_lock(file_lock &&); + file_lock & operator=(file_lock &&); + ~file_lock(); - // public member functions - void swap(file_lock &); - void lock(); - bool try_lock(); - bool timed_lock(const boost::posix_time::ptime &); - void unlock(); - void lock_sharable(); - bool try_lock_sharable(); - bool timed_lock_sharable(const boost::posix_time::ptime &); - void unlock_sharable(); + // public member functions + void swap(file_lock &); + void lock(); + bool try_lock(); + bool timed_lock(const boost::posix_time::ptime &); + void unlock(); + void lock_sharable(); + bool try_lock_sharable(); + bool timed_lock_sharable(const boost::posix_time::ptime &); + void unlock_sharable(); };
    -

    Description

    +

    Description

    A file lock, is a mutual exclusion utility similar to a mutex using a file. A file lock has sharable and exclusive locking capabilities and can be used with scoped_lock and sharable_lock classes. A file lock can't guarantee synchronization between threads of the same process so just use file locks to synchronize threads from different processes.

    -

    +

    file_lock public construct/copy/destruct

    1. -
      file_lock();
      +
      file_lock();

      Constructs an empty file mapping. Does not throw

    2. -
      file_lock(const char * name);
      +
      file_lock(const char * name);

      Opens a file lock. Throws interprocess_exception if the file does not exist or there are no operating system resources.

    3. -
      file_lock(file_lock && moved);
      +
      file_lock(file_lock && moved);

      Moves the ownership of "moved"'s file mapping object to *this. After the call, "moved" does not represent any file mapping object. Does not throw

    4. -
      file_lock & operator=(file_lock && moved);
      +
      file_lock & operator=(file_lock && moved);

      Moves the ownership of "moved"'s file mapping to *this. After the call, "moved" does not represent any file mapping. Does not throw

    5. -
      ~file_lock();
      Closes a file lock. Does not throw.
      6. +
      ~file_lock();
      Closes a file lock. Does not throw.
    -

    -file_lock public member functions

    +

    +file_lock public member functions

    1. -
      void swap(file_lock & other);
      +
      void swap(file_lock & other);

      Swaps two file_locks. Does not throw.

    2. -
      void lock();
      +
      void lock();

      Effects: The calling thread tries to obtain exclusive ownership of the mutex, and if another thread has exclusive, or sharable ownership of the mutex, it waits until it can obtain the ownership. Throws: interprocess_exception on error.

    3. -
      bool try_lock();
      +
      bool try_lock();

      Effects: The calling thread tries to acquire exclusive ownership of the mutex without waiting. If no other thread has exclusive, or sharable ownership of the mutex this succeeds. Returns: If it can acquire exclusive ownership immediately returns true. If it has to wait, returns false. Throws: interprocess_exception on error.

    4. -
      bool timed_lock(const boost::posix_time::ptime & abs_time);
      +
      bool timed_lock(const boost::posix_time::ptime & abs_time);

      Effects: The calling thread tries to acquire exclusive ownership of the mutex waiting if necessary until no other thread has exclusive, or sharable ownership of the mutex or abs_time is reached. Returns: If acquires exclusive ownership, returns true. Otherwise returns false. Throws: interprocess_exception on error.

    5. -
      void unlock();
      +
      void unlock();

      Precondition: The thread must have exclusive ownership of the mutex. Effects: The calling thread releases the exclusive ownership of the mutex. Throws: An exception derived from interprocess_exception on error.

    6. -
      void lock_sharable();
      +
      void lock_sharable();

      Effects: The calling thread tries to obtain sharable ownership of the mutex, and if another thread has exclusive ownership of the mutex, waits until it can obtain the ownership. Throws: interprocess_exception on error.

    7. -
      bool try_lock_sharable();
      +
      bool try_lock_sharable();

      Effects: The calling thread tries to acquire sharable ownership of the mutex without waiting. If no other thread has exclusive ownership of the mutex this succeeds. Returns: If it can acquire sharable ownership immediately returns true. If it has to wait, returns false. Throws: interprocess_exception on error.

    8. -
      bool timed_lock_sharable(const boost::posix_time::ptime & abs_time);
      +
      bool timed_lock_sharable(const boost::posix_time::ptime & abs_time);

      Effects: The calling thread tries to acquire sharable ownership of the mutex waiting if necessary until no other thread has exclusive ownership of the mutex or abs_time is reached. Returns: If acquires sharable ownership, returns true. Otherwise returns false. Throws: interprocess_exception on error.

    9. -
      void unlock_sharable();
      +
      void unlock_sharable();

      Precondition: The thread must have sharable ownership of the mutex. Effects: The calling thread releases the sharable ownership of the mutex. Throws: An exception derived from interprocess_exception on error.

    diff --git a/doc/html/boost/interprocess/file_mapping.html b/doc/html/boost/interprocess/file_mapping.html index 70e75ebcb8..f1dfa58c23 100644 --- a/doc/html/boost/interprocess/file_mapping.html +++ b/doc/html/boost/interprocess/file_mapping.html @@ -36,79 +36,79 @@ class file_mapping { public: // construct/copy/destruct - file_mapping(); - file_mapping(const char *, mode_t); - file_mapping(file_mapping &&); - file_mapping & operator=(file_mapping &&); - ~file_mapping(); + file_mapping(); + file_mapping(const char *, mode_t); + file_mapping(file_mapping &&); + file_mapping & operator=(file_mapping &&); + ~file_mapping(); - // public member functions - void swap(file_mapping &); - mode_t get_mode() const; - mapping_handle_t get_mapping_handle() const; - const char * get_name() const; + // public member functions + void swap(file_mapping &); + mode_t get_mode() const; + mapping_handle_t get_mapping_handle() const; + const char * get_name() const; - // public static functions - static bool remove(const char *); + // public static functions + static bool remove(const char *); };
    -

    Description

    +

    Description

    A class that wraps a file-mapping that can be used to create mapped regions from the mapped files

    -

    +

    file_mapping public construct/copy/destruct

    1. -
      file_mapping();
      +
      file_mapping();

      Constructs an empty file mapping. Does not throw

    2. -
      file_mapping(const char * filename, mode_t mode);
      +
      file_mapping(const char * filename, mode_t mode);

      Opens a file mapping of file "filename", starting in offset "file_offset", and the mapping's size will be "size". The mapping can be opened for read-only "read_only" or read-write "read_write" modes. Throws interprocess_exception on error.

    3. -
      file_mapping(file_mapping && moved);
      +
      file_mapping(file_mapping && moved);

      Moves the ownership of "moved"'s file mapping object to *this. After the call, "moved" does not represent any file mapping object. Does not throw

    4. -
      file_mapping & operator=(file_mapping && moved);
      +
      file_mapping & operator=(file_mapping && moved);

      Moves the ownership of "moved"'s file mapping to *this. After the call, "moved" does not represent any file mapping. Does not throw

    5. -
      ~file_mapping();
      +
      ~file_mapping();

      Destroys the file mapping. All mapped regions created from this are still valid. Does not throw

    -

    -file_mapping public member functions

    +

    +file_mapping public member functions

    1. -
      void swap(file_mapping & other);
      +
      void swap(file_mapping & other);

      Swaps to file_mappings. Does not throw.

    2. -
      mode_t get_mode() const;
      +
      mode_t get_mode() const;

      Returns access mode used in the constructor

    3. -
      mapping_handle_t get_mapping_handle() const;
      +
      mapping_handle_t get_mapping_handle() const;

      Obtains the mapping handle to be used with mapped_region

    4. -
      const char * get_name() const;
      +
      const char * get_name() const;

      Returns the name of the file used in the constructor.

    -

    -file_mapping public static functions

    +

    +file_mapping public static functions

    1. -
      static bool remove(const char * filename);
      +
      static bool remove(const char * filename);

      Removes the file named "filename" even if it's been memory mapped. Returns true on success. The function might fail in some operating systems if the file is being used other processes and no deletion permission was shared.

    diff --git a/doc/html/boost/interprocess/fixed_ma_idm45879391350304.html b/doc/html/boost/interprocess/fixed_ma_idm45879391350304.html new file mode 100644 index 0000000000..391c2b7d22 --- /dev/null +++ b/doc/html/boost/interprocess/fixed_ma_idm45879391350304.html @@ -0,0 +1,55 @@ + + + + +Type definition fixed_managed_shared_memory + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Type definition fixed_managed_shared_memory

    +

    fixed_managed_shared_memory

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/managed_shared_memory.hpp>
+
+
+typedef basic_managed_shared_memory< char,rbtree_best_fit< mutex_family, void * >,iset_index > fixed_managed_shared_memory;
    +
    +

    Description

    +

    Typedef for a default basic_managed_shared_memory of narrow characters to be placed in a fixed address

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/fixed_managed__idp35394400.html b/doc/html/boost/interprocess/fixed_managed__idp35394400.html deleted file mode 100644 index 4ca0fb32d2..0000000000 --- a/doc/html/boost/interprocess/fixed_managed__idp35394400.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Type definition fixed_managed_shared_memory - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Type definition fixed_managed_shared_memory

    -

    fixed_managed_shared_memory

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/managed_shared_memory.hpp>
-
-
-typedef basic_managed_shared_memory< char,rbtree_best_fit< mutex_family, void * >,iset_index > fixed_managed_shared_memory;
    -
    -

    Description

    -

    Typedef for a default basic_managed_shared_memory of narrow characters to be placed in a fixed address

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/flat_map_index.html b/doc/html/boost/interprocess/flat_map_index.html index 649ad3b33f..958a6ba29e 100644 --- a/doc/html/boost/interprocess/flat_map_index.html +++ b/doc/html/boost/interprocess/flat_map_index.html @@ -36,31 +36,31 @@ class flat_map_index : public flat_map_index_aux::index_t< MapConfig > { public: // construct/copy/destruct - flat_map_index(segment_manager_base *); + flat_map_index(segment_manager_base *); - // public member functions - void reserve(typename segment_manager_base::size_type); - void shrink_to_fit(); + // public member functions + void reserve(typename segment_manager_base::size_type); + void shrink_to_fit(); };
    -

    Description

    +

    Description

    Index type based in flat_map. Just derives from flat_map and defines the interface needed by managed memory segments.

    -

    +

    flat_map_index public construct/copy/destruct

    1. -
      flat_map_index(segment_manager_base * segment_mngr);
      Constructor. Takes a pointer to the segment manager. Can throw.
    +
    flat_map_index(segment_manager_base * segment_mngr);
    Constructor. Takes a pointer to the segment manager. Can throw.
    -

    -flat_map_index public member functions

    +

    +flat_map_index public member functions

    1. -
      void reserve(typename segment_manager_base::size_type n);
      This reserves memory to optimize the insertion of n elements in the index.
      2. +
      void reserve(typename segment_manager_base::size_type n);
      This reserves memory to optimize the insertion of n elements in the index.
    2. -
      void shrink_to_fit();
      This frees all unnecessary memory.
      3. +
      void shrink_to_fit();
      This frees all unnecessary memory.
    diff --git a/doc/html/boost/interprocess/interpro_idm45879390017344.html b/doc/html/boost/interprocess/interpro_idm45879390017344.html new file mode 100644 index 0000000000..06cf3f3e57 --- /dev/null +++ b/doc/html/boost/interprocess/interpro_idm45879390017344.html @@ -0,0 +1,190 @@ + + + + +Class interprocess_upgradable_mutex + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Class interprocess_upgradable_mutex

    +

    boost::interprocess::interprocess_upgradable_mutex

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/sync/interprocess_upgradable_mutex.hpp>
+
+
+class interprocess_upgradable_mutex {
+public:
+  // construct/copy/destruct
+  interprocess_upgradable_mutex(const interprocess_upgradable_mutex &);
+  interprocess_upgradable_mutex();
+  interprocess_upgradable_mutex & 
+  operator=(const interprocess_upgradable_mutex &);
+  ~interprocess_upgradable_mutex();
+
+  // public member functions
+  void lock();
+  bool try_lock();
+  bool timed_lock(const boost::posix_time::ptime &);
+  void unlock();
+  void lock_sharable();
+  bool try_lock_sharable();
+  bool timed_lock_sharable(const boost::posix_time::ptime &);
+  void unlock_sharable();
+  void lock_upgradable();
+  bool try_lock_upgradable();
+  bool timed_lock_upgradable(const boost::posix_time::ptime &);
+  void unlock_upgradable();
+  void unlock_and_lock_upgradable();
+  void unlock_and_lock_sharable();
+  void unlock_upgradable_and_lock_sharable();
+  void unlock_upgradable_and_lock();
+  bool try_unlock_upgradable_and_lock();
+  *bool timed_unlock_upgradable_and_lock(const boost::posix_time::ptime &);
+  bool try_unlock_sharable_and_lock();
+  bool try_unlock_sharable_and_lock_upgradable();
+};
    +
    +

    Description

    +

    Wraps a interprocess_upgradable_mutex that can be placed in shared memory and can be shared between processes. Allows timed lock tries

    +
    +

    +interprocess_upgradable_mutex + public + construct/copy/destruct

    +
      +
    1. interprocess_upgradable_mutex(const interprocess_upgradable_mutex &);
      2. +
    2. +
      interprocess_upgradable_mutex();
      +

      Constructs the upgradable lock. Throws interprocess_exception on error.

      +
      3. +
    3. interprocess_upgradable_mutex & 
+operator=(const interprocess_upgradable_mutex &);
      4. +
    4. +
      ~interprocess_upgradable_mutex();
      +

      Destroys the upgradable lock. Does not throw.

      +
      5. +
    +
    +
    +

    +interprocess_upgradable_mutex public member functions

    +
      +
    1. +
      void lock();
      +

      Effects: The calling thread tries to obtain exclusive ownership of the mutex, and if another thread has exclusive, sharable or upgradable ownership of the mutex, it waits until it can obtain the ownership. Throws: interprocess_exception on error.

      +
      2. +
    2. +
      bool try_lock();
      +

      Effects: The calling thread tries to acquire exclusive ownership of the mutex without waiting. If no other thread has exclusive, sharable or upgradable ownership of the mutex this succeeds. Returns: If it can acquire exclusive ownership immediately returns true. If it has to wait, returns false. Throws: interprocess_exception on error.

      +
      3. +
    3. +
      bool timed_lock(const boost::posix_time::ptime & abs_time);
      +

      Effects: The calling thread tries to acquire exclusive ownership of the mutex waiting if necessary until no other thread has exclusive, sharable or upgradable ownership of the mutex or abs_time is reached. Returns: If acquires exclusive ownership, returns true. Otherwise returns false. Throws: interprocess_exception on error.

      +
      4. +
    4. +
      void unlock();
      +

      Precondition: The thread must have exclusive ownership of the mutex. Effects: The calling thread releases the exclusive ownership of the mutex. Throws: An exception derived from interprocess_exception on error.

      +
      5. +
    5. +
      void lock_sharable();
      +

      Effects: The calling thread tries to obtain sharable ownership of the mutex, and if another thread has exclusive ownership of the mutex, waits until it can obtain the ownership. Throws: interprocess_exception on error.

      +
      6. +
    6. +
      bool try_lock_sharable();
      +

      Effects: The calling thread tries to acquire sharable ownership of the mutex without waiting. If no other thread has exclusive ownership of the mutex this succeeds. Returns: If it can acquire sharable ownership immediately returns true. If it has to wait, returns false. Throws: interprocess_exception on error.

      +
      7. +
    7. +
      bool timed_lock_sharable(const boost::posix_time::ptime & abs_time);
      +

      Effects: The calling thread tries to acquire sharable ownership of the mutex waiting if necessary until no other thread has exclusive ownership of the mutex or abs_time is reached. Returns: If acquires sharable ownership, returns true. Otherwise returns false. Throws: interprocess_exception on error.

      +
      8. +
    8. +
      void unlock_sharable();
      +

      Precondition: The thread must have sharable ownership of the mutex. Effects: The calling thread releases the sharable ownership of the mutex. Throws: An exception derived from interprocess_exception on error.

      +
      9. +
    9. +
      void lock_upgradable();
      +

      Effects: The calling thread tries to obtain upgradable ownership of the mutex, and if another thread has exclusive or upgradable ownership of the mutex, waits until it can obtain the ownership. Throws: interprocess_exception on error.

      +
      10. +
    10. +
      bool try_lock_upgradable();
      +

      Effects: The calling thread tries to acquire upgradable ownership of the mutex without waiting. If no other thread has exclusive or upgradable ownership of the mutex this succeeds. Returns: If it can acquire upgradable ownership immediately returns true. If it has to wait, returns false. Throws: interprocess_exception on error.

      +
      11. +
    11. +
      bool timed_lock_upgradable(const boost::posix_time::ptime & abs_time);
      +

      Effects: The calling thread tries to acquire upgradable ownership of the mutex waiting if necessary until no other thread has exclusive or upgradable ownership of the mutex or abs_time is reached. Returns: If acquires upgradable ownership, returns true. Otherwise returns false. Throws: interprocess_exception on error.

      +
      12. +
    12. +
      void unlock_upgradable();
      +

      Precondition: The thread must have upgradable ownership of the mutex. Effects: The calling thread releases the upgradable ownership of the mutex. Throws: An exception derived from interprocess_exception on error.

      +
      13. +
    13. +
      void unlock_and_lock_upgradable();
      +

      Precondition: The thread must have exclusive ownership of the mutex. Effects: The thread atomically releases exclusive ownership and acquires upgradable ownership. This operation is non-blocking. Throws: An exception derived from interprocess_exception on error.

      +
      14. +
    14. +
      void unlock_and_lock_sharable();
      +

      Precondition: The thread must have exclusive ownership of the mutex. Effects: The thread atomically releases exclusive ownership and acquires sharable ownership. This operation is non-blocking. Throws: An exception derived from interprocess_exception on error.

      +
      15. +
    15. +
      void unlock_upgradable_and_lock_sharable();
      +

      Precondition: The thread must have upgradable ownership of the mutex. Effects: The thread atomically releases upgradable ownership and acquires sharable ownership. This operation is non-blocking. Throws: An exception derived from interprocess_exception on error.

      +
      16. +
    16. +
      void unlock_upgradable_and_lock();
      +

      Precondition: The thread must have upgradable ownership of the mutex. Effects: The thread atomically releases upgradable ownership and acquires exclusive ownership. This operation will block until all threads with sharable ownership release their sharable lock. Throws: An exception derived from interprocess_exception on error.

      +
      17. +
    17. +
      bool try_unlock_upgradable_and_lock();
      +

      Precondition: The thread must have upgradable ownership of the mutex. Effects: The thread atomically releases upgradable ownership and tries to acquire exclusive ownership. This operation will fail if there are threads with sharable ownership, but it will maintain upgradable ownership. Returns: If acquires exclusive ownership, returns true. Otherwise returns false. Throws: An exception derived from interprocess_exception on error.

      +
      18. +
    18. +
      *bool timed_unlock_upgradable_and_lock(const boost::posix_time::ptime & abs_time);
      +

      Precondition: The thread must have upgradable ownership of the mutex. Effects: The thread atomically releases upgradable ownership and tries to acquire exclusive ownership, waiting if necessary until abs_time. This operation will fail if there are threads with sharable ownership or timeout reaches, but it will maintain upgradable ownership. Returns: If acquires exclusive ownership, returns true. Otherwise returns false. Throws: An exception derived from interprocess_exception on error.

      +
      19. +
    19. +
      bool try_unlock_sharable_and_lock();
      +

      Precondition: The thread must have sharable ownership of the mutex. Effects: The thread atomically releases sharable ownership and tries to acquire exclusive ownership. This operation will fail if there are threads with sharable or upgradable ownership, but it will maintain sharable ownership. Returns: If acquires exclusive ownership, returns true. Otherwise returns false. Throws: An exception derived from interprocess_exception on error.

      +
      20. +
    20. +
      bool try_unlock_sharable_and_lock_upgradable();
      +

      Precondition: The thread must have sharable ownership of the mutex. Effects: The thread atomically releases sharable ownership and tries to acquire upgradable ownership. This operation will fail if there are threads with sharable or upgradable ownership, but it will maintain sharable ownership. Returns: If acquires upgradable ownership, returns true. Otherwise returns false. Throws: An exception derived from interprocess_exception on error.

      +
      21. +
    +
    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/interpro_idm45879390048160.html b/doc/html/boost/interprocess/interpro_idm45879390048160.html new file mode 100644 index 0000000000..03fa1e489b --- /dev/null +++ b/doc/html/boost/interprocess/interpro_idm45879390048160.html @@ -0,0 +1,128 @@ + + + + +Class interprocess_sharable_mutex + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Class interprocess_sharable_mutex

    +

    boost::interprocess::interprocess_sharable_mutex

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/sync/interprocess_sharable_mutex.hpp>
+
+
+class interprocess_sharable_mutex {
+public:
+  // construct/copy/destruct
+  interprocess_sharable_mutex(const interprocess_sharable_mutex &);
+  interprocess_sharable_mutex();
+  interprocess_sharable_mutex & operator=(const interprocess_sharable_mutex &);
+  ~interprocess_sharable_mutex();
+
+  // public member functions
+  void lock();
+  bool try_lock();
+  bool timed_lock(const boost::posix_time::ptime &);
+  void unlock();
+  void lock_sharable();
+  bool try_lock_sharable();
+  bool timed_lock_sharable(const boost::posix_time::ptime &);
+  void unlock_sharable();
+};
    +
    +

    Description

    +

    Wraps a interprocess_sharable_mutex that can be placed in shared memory and can be shared between processes. Allows timed lock tries

    +
    +

    +interprocess_sharable_mutex + public + construct/copy/destruct

    +
      +
    1. interprocess_sharable_mutex(const interprocess_sharable_mutex &);
      2. +
    2. +
      interprocess_sharable_mutex();
      +

      Constructs the sharable lock. Throws interprocess_exception on error.

      +
      3. +
    3. interprocess_sharable_mutex & operator=(const interprocess_sharable_mutex &);
      4. +
    4. +
      ~interprocess_sharable_mutex();
      +

      Destroys the sharable lock. Does not throw.

      +
      5. +
    +
    +
    +

    +interprocess_sharable_mutex public member functions

    +
      +
    1. +
      void lock();
      +

      Effects: The calling thread tries to obtain exclusive ownership of the mutex, and if another thread has exclusive or sharable ownership of the mutex, it waits until it can obtain the ownership. Throws: interprocess_exception on error.

      +
      2. +
    2. +
      bool try_lock();
      +

      Effects: The calling thread tries to acquire exclusive ownership of the mutex without waiting. If no other thread has exclusive or sharable ownership of the mutex this succeeds. Returns: If it can acquire exclusive ownership immediately returns true. If it has to wait, returns false. Throws: interprocess_exception on error.

      +
      3. +
    3. +
      bool timed_lock(const boost::posix_time::ptime & abs_time);
      +

      Effects: The calling thread tries to acquire exclusive ownership of the mutex waiting if necessary until no other thread has exclusive or sharable ownership of the mutex or abs_time is reached. Returns: If acquires exclusive ownership, returns true. Otherwise returns false. Throws: interprocess_exception on error.

      +
      4. +
    4. +
      void unlock();
      +

      Precondition: The thread must have exclusive ownership of the mutex. Effects: The calling thread releases the exclusive ownership of the mutex. Throws: An exception derived from interprocess_exception on error.

      +
      5. +
    5. +
      void lock_sharable();
      +

      Effects: The calling thread tries to obtain sharable ownership of the mutex, and if another thread has exclusive ownership of the mutex, waits until it can obtain the ownership. Throws: interprocess_exception on error.

      +
      6. +
    6. +
      bool try_lock_sharable();
      +

      Effects: The calling thread tries to acquire sharable ownership of the mutex without waiting. If no other thread has exclusive ownership of the mutex this succeeds. Returns: If it can acquire sharable ownership immediately returns true. If it has to wait, returns false. Throws: interprocess_exception on error.

      +
      7. +
    7. +
      bool timed_lock_sharable(const boost::posix_time::ptime & abs_time);
      +

      Effects: The calling thread tries to acquire sharable ownership of the mutex waiting if necessary until no other thread has exclusive ownership of the mutex or abs_time is reached. Returns: If acquires sharable ownership, returns true. Otherwise returns false. Throws: interprocess_exception on error.

      +
      8. +
    8. +
      void unlock_sharable();
      +

      Precondition: The thread must have sharable ownership of the mutex. Effects: The calling thread releases the sharable ownership of the mutex. Throws: An exception derived from interprocess_exception on error.

      +
      9. +
    +
    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/interpro_idm45879390093552.html b/doc/html/boost/interprocess/interpro_idm45879390093552.html new file mode 100644 index 0000000000..f0b62f9996 --- /dev/null +++ b/doc/html/boost/interprocess/interpro_idm45879390093552.html @@ -0,0 +1,104 @@ + + + + +Class interprocess_recursive_mutex + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Class interprocess_recursive_mutex

    +

    boost::interprocess::interprocess_recursive_mutex

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/sync/interprocess_recursive_mutex.hpp>
+
+
+class interprocess_recursive_mutex {
+public:
+  // construct/copy/destruct
+  interprocess_recursive_mutex();
+  ~interprocess_recursive_mutex();
+
+  // public member functions
+  void lock();
+  bool try_lock();
+  bool timed_lock(const boost::posix_time::ptime &);
+  void unlock();
+};
    +
    +

    Description

    +

    Wraps a interprocess_mutex that can be placed in shared memory and can be shared between processes. Allows several locking calls by the same process. Allows timed lock tries

    +
    +

    +interprocess_recursive_mutex + public + construct/copy/destruct

    +
      +
    1. +
      interprocess_recursive_mutex();
      +

      Constructor. Throws interprocess_exception on error.

      +
      2. +
    2. +
      ~interprocess_recursive_mutex();
      +

      Destructor. If any process uses the mutex after the destructor is called the result is undefined. Does not throw.

      +
      3. +
    +
    +
    +

    +interprocess_recursive_mutex public member functions

    +
      +
    1. +
      void lock();
      +

      Effects: The calling thread tries to obtain ownership of the mutex, and if another thread has ownership of the mutex, it waits until it can obtain the ownership. If a thread takes ownership of the mutex the mutex must be unlocked by the same mutex. The mutex must be unlocked the same number of times it is locked. Throws: interprocess_exception on error.

      +
      2. +
    2. +
      bool try_lock();
      +

      Tries to lock the interprocess_mutex, returns false when interprocess_mutex is already locked, returns true when success. The mutex must be unlocked the same number of times it is locked. Throws: interprocess_exception if a severe error is found

      +
      3. +
    3. +
      bool timed_lock(const boost::posix_time::ptime & abs_time);
      +

      Tries to lock the interprocess_mutex, if interprocess_mutex can't be locked before abs_time time, returns false. The mutex must be unlocked the same number of times it is locked. Throws: interprocess_exception if a severe error is found

      +
      4. +
    4. +
      void unlock();
      +

      Effects: The calling thread releases the exclusive ownership of the mutex. If the mutex supports recursive locking, the mutex must be unlocked the same number of times it is locked. Throws: interprocess_exception on error.

      +
      5. +
    +
    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/interprocess_condition.html b/doc/html/boost/interprocess/interprocess_condition.html index d45930ce58..0b6b26c020 100644 --- a/doc/html/boost/interprocess/interprocess_condition.html +++ b/doc/html/boost/interprocess/interprocess_condition.html @@ -36,64 +36,64 @@ class interprocess_condition { public: // construct/copy/destruct - interprocess_condition(); - ~interprocess_condition(); + interprocess_condition(); + ~interprocess_condition(); - // public member functions - void notify_one(); - void notify_all(); - template<typename L> void wait(L &); - template<typename L, typename Pr> void wait(L &, Pr); - template<typename L> bool timed_wait(L &, const boost::posix_time::ptime &); + // public member functions + void notify_one(); + void notify_all(); + template<typename L> void wait(L &); + template<typename L, typename Pr> void wait(L &, Pr); + template<typename L> bool timed_wait(L &, const boost::posix_time::ptime &); template<typename L, typename Pr> - bool timed_wait(L &, const boost::posix_time::ptime &, Pr); + bool timed_wait(L &, const boost::posix_time::ptime &, Pr); };
    -

    Description

    +

    Description

    This class is a condition variable that can be placed in shared memory or memory mapped files. Destroys the object of type std::condition_variable_any

    Unlike std::condition_variable in C++11, it is NOT safe to invoke the destructor if all threads have been only notified. It is required that they have exited their respective wait functions.

    -

    +

    interprocess_condition public construct/copy/destruct

    1. -
      interprocess_condition();
      Constructs a interprocess_condition. On error throws interprocess_exception.
      2. +
      interprocess_condition();
      Constructs a interprocess_condition. On error throws interprocess_exception.
    2. -
      ~interprocess_condition();
      +
      ~interprocess_condition();

      Destroys *this liberating system resources.

    -

    -interprocess_condition public member functions

    +

    +interprocess_condition public member functions

    1. -
      void notify_one();
      +
      void notify_one();

      If there is a thread waiting on *this, change that thread's state to ready. Otherwise there is no effect.

    2. -
      void notify_all();
      +
      void notify_all();

      Change the state of all threads waiting on *this to ready. If there are no waiting threads, notify_all() has no effect.

    3. -
      template<typename L> void wait(L & lock);
      +
      template<typename L> void wait(L & lock);

      Releases the lock on the interprocess_mutex object associated with lock, blocks the current thread of execution until readied by a call to this->notify_one() or this->notify_all(), and then reacquires the lock.

    4. -
      template<typename L, typename Pr> void wait(L & lock, Pr pred);
      +
      template<typename L, typename Pr> void wait(L & lock, Pr pred);

      The same as: while (!pred()) wait(lock) 

    5. template<typename L> 
-  bool timed_wait(L & lock, const boost::posix_time::ptime & abs_time);
      + bool timed_wait(L & lock, const boost::posix_time::ptime & abs_time);

      Releases the lock on the interprocess_mutex object associated with lock, blocks the current thread of execution until readied by a call to this->notify_one() or this->notify_all(), or until time abs_time is reached, and then reacquires the lock. Returns: false if time abs_time is reached, otherwise true. 

    6. template<typename L, typename Pr> 
-  bool timed_wait(L & lock, const boost::posix_time::ptime & abs_time, 
+  bool timed_wait(L & lock, const boost::posix_time::ptime & abs_time, 
                   Pr pred);

      The same as: while (!pred()) { if (!timed_wait(lock, abs_time)) return pred(); } return true;

      7. diff --git a/doc/html/boost/interprocess/interprocess_condition_any.html b/doc/html/boost/interprocess/interprocess_condition_any.html index 938b9bb007..4d0eb64c7d 100644 --- a/doc/html/boost/interprocess/interprocess_condition_any.html +++ b/doc/html/boost/interprocess/interprocess_condition_any.html @@ -36,65 +36,65 @@ class interprocess_condition_any { public: // construct/copy/destruct - interprocess_condition_any(); - ~interprocess_condition_any(); + interprocess_condition_any(); + ~interprocess_condition_any(); - // public member functions - void notify_one(); - void notify_all(); - template<typename L> void wait(L &); - template<typename L, typename Pr> void wait(L &, Pr); - template<typename L> bool timed_wait(L &, const boost::posix_time::ptime &); + // public member functions + void notify_one(); + void notify_all(); + template<typename L> void wait(L &); + template<typename L, typename Pr> void wait(L &, Pr); + template<typename L> bool timed_wait(L &, const boost::posix_time::ptime &); template<typename L, typename Pr> - bool timed_wait(L &, const boost::posix_time::ptime &, Pr); + bool timed_wait(L &, const boost::posix_time::ptime &, Pr); };
    -

    Description

    +

    Description

    This class is a condition variable that can be placed in shared memory or memory mapped files.

    The interprocess_condition_any class is a generalization of interprocess_condition. Whereas interprocess_condition works only on Locks with mutex_type == interprocess_mutex interprocess_condition_any can operate on any user-defined lock that meets the BasicLockable requirements (lock()/unlock() member functions).

    Unlike std::condition_variable_any in C++11, it is NOT safe to invoke the destructor if all threads have been only notified. It is required that they have exited their respective wait functions.

    -

    +

    interprocess_condition_any public construct/copy/destruct

    1. -
      interprocess_condition_any();
      Constructs a interprocess_condition_any. On error throws interprocess_exception.
      2. +
      interprocess_condition_any();
      Constructs a interprocess_condition_any. On error throws interprocess_exception.
    2. -
      ~interprocess_condition_any();
      +
      ~interprocess_condition_any();

      Destroys *this liberating system resources.

    -

    -interprocess_condition_any public member functions

    +

    +interprocess_condition_any public member functions

    1. -
      void notify_one();
      +
      void notify_one();

      If there is a thread waiting on *this, change that thread's state to ready. Otherwise there is no effect.

    2. -
      void notify_all();
      +
      void notify_all();

      Change the state of all threads waiting on *this to ready. If there are no waiting threads, notify_all() has no effect.

    3. -
      template<typename L> void wait(L & lock);
      +
      template<typename L> void wait(L & lock);

      Releases the lock on the interprocess_mutex object associated with lock, blocks the current thread of execution until readied by a call to this->notify_one() or this->notify_all(), and then reacquires the lock.

    4. -
      template<typename L, typename Pr> void wait(L & lock, Pr pred);
      +
      template<typename L, typename Pr> void wait(L & lock, Pr pred);

      The same as: while (!pred()) wait(lock) 

    5. template<typename L> 
-  bool timed_wait(L & lock, const boost::posix_time::ptime & abs_time);
      + bool timed_wait(L & lock, const boost::posix_time::ptime & abs_time);

      Releases the lock on the interprocess_mutex object associated with lock, blocks the current thread of execution until readied by a call to this->notify_one() or this->notify_all(), or until time abs_time is reached, and then reacquires the lock. Returns: false if time abs_time is reached, otherwise true. 

    6. template<typename L, typename Pr> 
-  bool timed_wait(L & lock, const boost::posix_time::ptime & abs_time, 
+  bool timed_wait(L & lock, const boost::posix_time::ptime & abs_time, 
                   Pr pred);

      The same as: while (!pred()) { if (!timed_wait(lock, abs_time)) return pred(); } return true;

      7. diff --git a/doc/html/boost/interprocess/interprocess_exception.html b/doc/html/boost/interprocess/interprocess_exception.html index fa0cdc12cd..57031c9ce7 100644 --- a/doc/html/boost/interprocess/interprocess_exception.html +++ b/doc/html/boost/interprocess/interprocess_exception.html @@ -36,36 +36,36 @@ class interprocess_exception : public exception { public: // construct/copy/destruct - interprocess_exception(const char *); - interprocess_exception(const error_info &, const char * = 0); - ~interprocess_exception(); + interprocess_exception(const char *); + interprocess_exception(const error_info &, const char * = 0); + ~interprocess_exception(); - // public member functions - virtual const char * what() const; - native_error_t get_native_error() const; - error_code_t get_error_code() const; + // public member functions + virtual const char * what() const; + native_error_t get_native_error() const; + error_code_t get_error_code() const; };
    -

    Description

    +

    Description

    This class is the base class of all exceptions thrown by boost::interprocess

    -

    +

    interprocess_exception public construct/copy/destruct

      -
    1. interprocess_exception(const char * err);
      2. -
    2. interprocess_exception(const error_info & err_info, const char * str = 0);
      3. -
    3. ~interprocess_exception();
      4. +
    4. interprocess_exception(const char * err);
      5. +
    5. interprocess_exception(const error_info & err_info, const char * str = 0);
      6. +
    6. ~interprocess_exception();
    -

    -interprocess_exception public member functions

    +

    +interprocess_exception public member functions

      -
    1. virtual const char * what() const;
      2. -
    2. native_error_t get_native_error() const;
      3. -
    3. error_code_t get_error_code() const;
      4. +
    4. virtual const char * what() const;
      5. +
    5. native_error_t get_native_error() const;
      6. +
    6. error_code_t get_error_code() const;
    diff --git a/doc/html/boost/interprocess/interprocess_mutex.html b/doc/html/boost/interprocess/interprocess_mutex.html index c0df5ffbf2..28af4558cd 100644 --- a/doc/html/boost/interprocess/interprocess_mutex.html +++ b/doc/html/boost/interprocess/interprocess_mutex.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -36,52 +36,52 @@ class interprocess_mutex { public: // construct/copy/destruct - interprocess_mutex(); - ~interprocess_mutex(); + interprocess_mutex(); + ~interprocess_mutex(); - // public member functions - void lock(); - bool try_lock(); - bool timed_lock(const boost::posix_time::ptime &); - void unlock(); + // public member functions + void lock(); + bool try_lock(); + bool timed_lock(const boost::posix_time::ptime &); + void unlock(); };
    -

    Description

    +

    Description

    Wraps a interprocess_mutex that can be placed in shared memory and can be shared between processes. Allows timed lock tries

    -

    +

    interprocess_mutex public construct/copy/destruct

    1. -
      interprocess_mutex();
      +
      interprocess_mutex();

      Constructor. Throws interprocess_exception on error.

    2. -
      ~interprocess_mutex();
      +
      ~interprocess_mutex();

      Destructor. If any process uses the mutex after the destructor is called the result is undefined. Does not throw.

    -

    -interprocess_mutex public member functions

    +

    +interprocess_mutex public member functions

    1. -
      void lock();
      +
      void lock();

      Effects: The calling thread tries to obtain ownership of the mutex, and if another thread has ownership of the mutex, it waits until it can obtain the ownership. If a thread takes ownership of the mutex the mutex must be unlocked by the same mutex. Throws: interprocess_exception on error.

    2. -
      bool try_lock();
      +
      bool try_lock();

      Effects: The calling thread tries to obtain ownership of the mutex, and if another thread has ownership of the mutex returns immediately. Returns: If the thread acquires ownership of the mutex, returns true, if the another thread has ownership of the mutex, returns false. Throws: interprocess_exception on error.

    3. -
      bool timed_lock(const boost::posix_time::ptime & abs_time);
      +
      bool timed_lock(const boost::posix_time::ptime & abs_time);

      Effects: The calling thread will try to obtain exclusive ownership of the mutex if it can do so in until the specified time is reached. If the mutex supports recursive locking, the mutex must be unlocked the same number of times it is locked. Returns: If the thread acquires ownership of the mutex, returns true, if the timeout expires returns false. Throws: interprocess_exception on error.

    4. -
      void unlock();
      +
      void unlock();

      Effects: The calling thread releases the exclusive ownership of the mutex. Throws: interprocess_exception on error.

    @@ -98,7 +98,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/interprocess_r_idp36585488.html b/doc/html/boost/interprocess/interprocess_r_idp36585488.html deleted file mode 100644 index 147e15f8fa..0000000000 --- a/doc/html/boost/interprocess/interprocess_r_idp36585488.html +++ /dev/null @@ -1,104 +0,0 @@ - - - - -Class interprocess_recursive_mutex - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Class interprocess_recursive_mutex

    -

    boost::interprocess::interprocess_recursive_mutex

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/sync/interprocess_recursive_mutex.hpp>
-
-
-class interprocess_recursive_mutex {
-public:
-  // construct/copy/destruct
-  interprocess_recursive_mutex();
-  ~interprocess_recursive_mutex();
-
-  // public member functions
-  void lock();
-  bool try_lock();
-  bool timed_lock(const boost::posix_time::ptime &);
-  void unlock();
-};
    -
    -

    Description

    -

    Wraps a interprocess_mutex that can be placed in shared memory and can be shared between processes. Allows several locking calls by the same process. Allows timed lock tries

    -
    -

    -interprocess_recursive_mutex - public - construct/copy/destruct

    -
      -
    1. -
      interprocess_recursive_mutex();
      -

      Constructor. Throws interprocess_exception on error.

      -
      2. -
    2. -
      ~interprocess_recursive_mutex();
      -

      Destructor. If any process uses the mutex after the destructor is called the result is undefined. Does not throw.

      -
      3. -
    -
    -
    -

    -interprocess_recursive_mutex public member functions

    -
      -
    1. -
      void lock();
      -

      Effects: The calling thread tries to obtain ownership of the mutex, and if another thread has ownership of the mutex, it waits until it can obtain the ownership. If a thread takes ownership of the mutex the mutex must be unlocked by the same mutex. The mutex must be unlocked the same number of times it is locked. Throws: interprocess_exception on error.

      -
      2. -
    2. -
      bool try_lock();
      -

      Tries to lock the interprocess_mutex, returns false when interprocess_mutex is already locked, returns true when success. The mutex must be unlocked the same number of times it is locked. Throws: interprocess_exception if a severe error is found

      -
      3. -
    3. -
      bool timed_lock(const boost::posix_time::ptime & abs_time);
      -

      Tries to lock the interprocess_mutex, if interprocess_mutex can't be locked before abs_time time, returns false. The mutex must be unlocked the same number of times it is locked. Throws: interprocess_exception if a severe error is found

      -
      4. -
    4. -
      void unlock();
      -

      Effects: The calling thread releases the exclusive ownership of the mutex. If the mutex supports recursive locking, the mutex must be unlocked the same number of times it is locked. Throws: interprocess_exception on error.

      -
      5. -
    -
    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/interprocess_s_idp36630880.html b/doc/html/boost/interprocess/interprocess_s_idp36630880.html deleted file mode 100644 index dd5cc9dded..0000000000 --- a/doc/html/boost/interprocess/interprocess_s_idp36630880.html +++ /dev/null @@ -1,128 +0,0 @@ - - - - -Class interprocess_sharable_mutex - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Class interprocess_sharable_mutex

    -

    boost::interprocess::interprocess_sharable_mutex

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/sync/interprocess_sharable_mutex.hpp>
-
-
-class interprocess_sharable_mutex {
-public:
-  // construct/copy/destruct
-  interprocess_sharable_mutex(const interprocess_sharable_mutex &);
-  interprocess_sharable_mutex();
-  interprocess_sharable_mutex & operator=(const interprocess_sharable_mutex &);
-  ~interprocess_sharable_mutex();
-
-  // public member functions
-  void lock();
-  bool try_lock();
-  bool timed_lock(const boost::posix_time::ptime &);
-  void unlock();
-  void lock_sharable();
-  bool try_lock_sharable();
-  bool timed_lock_sharable(const boost::posix_time::ptime &);
-  void unlock_sharable();
-};
    -
    -

    Description

    -

    Wraps a interprocess_sharable_mutex that can be placed in shared memory and can be shared between processes. Allows timed lock tries

    -
    -

    -interprocess_sharable_mutex - public - construct/copy/destruct

    -
      -
    1. interprocess_sharable_mutex(const interprocess_sharable_mutex &);
      2. -
    2. -
      interprocess_sharable_mutex();
      -

      Constructs the sharable lock. Throws interprocess_exception on error.

      -
      3. -
    3. interprocess_sharable_mutex & operator=(const interprocess_sharable_mutex &);
      4. -
    4. -
      ~interprocess_sharable_mutex();
      -

      Destroys the sharable lock. Does not throw.

      -
      5. -
    -
    -
    -

    -interprocess_sharable_mutex public member functions

    -
      -
    1. -
      void lock();
      -

      Effects: The calling thread tries to obtain exclusive ownership of the mutex, and if another thread has exclusive or sharable ownership of the mutex, it waits until it can obtain the ownership. Throws: interprocess_exception on error.

      -
      2. -
    2. -
      bool try_lock();
      -

      Effects: The calling thread tries to acquire exclusive ownership of the mutex without waiting. If no other thread has exclusive or sharable ownership of the mutex this succeeds. Returns: If it can acquire exclusive ownership immediately returns true. If it has to wait, returns false. Throws: interprocess_exception on error.

      -
      3. -
    3. -
      bool timed_lock(const boost::posix_time::ptime & abs_time);
      -

      Effects: The calling thread tries to acquire exclusive ownership of the mutex waiting if necessary until no other thread has exclusive or sharable ownership of the mutex or abs_time is reached. Returns: If acquires exclusive ownership, returns true. Otherwise returns false. Throws: interprocess_exception on error.

      -
      4. -
    4. -
      void unlock();
      -

      Precondition: The thread must have exclusive ownership of the mutex. Effects: The calling thread releases the exclusive ownership of the mutex. Throws: An exception derived from interprocess_exception on error.

      -
      5. -
    5. -
      void lock_sharable();
      -

      Effects: The calling thread tries to obtain sharable ownership of the mutex, and if another thread has exclusive ownership of the mutex, waits until it can obtain the ownership. Throws: interprocess_exception on error.

      -
      6. -
    6. -
      bool try_lock_sharable();
      -

      Effects: The calling thread tries to acquire sharable ownership of the mutex without waiting. If no other thread has exclusive ownership of the mutex this succeeds. Returns: If it can acquire sharable ownership immediately returns true. If it has to wait, returns false. Throws: interprocess_exception on error.

      -
      7. -
    7. -
      bool timed_lock_sharable(const boost::posix_time::ptime & abs_time);
      -

      Effects: The calling thread tries to acquire sharable ownership of the mutex waiting if necessary until no other thread has exclusive ownership of the mutex or abs_time is reached. Returns: If acquires sharable ownership, returns true. Otherwise returns false. Throws: interprocess_exception on error.

      -
      8. -
    8. -
      void unlock_sharable();
      -

      Precondition: The thread must have sharable ownership of the mutex. Effects: The calling thread releases the sharable ownership of the mutex. Throws: An exception derived from interprocess_exception on error.

      -
      9. -
    -
    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/interprocess_semaphore.html b/doc/html/boost/interprocess/interprocess_semaphore.html index 6fec62e3b3..391e6374eb 100644 --- a/doc/html/boost/interprocess/interprocess_semaphore.html +++ b/doc/html/boost/interprocess/interprocess_semaphore.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -36,52 +36,52 @@ class interprocess_semaphore { public: // construct/copy/destruct - interprocess_semaphore(unsigned int); - ~interprocess_semaphore(); + interprocess_semaphore(unsigned int); + ~interprocess_semaphore(); - // public member functions - void post(); - void wait(); - bool try_wait(); - bool timed_wait(const boost::posix_time::ptime &); + // public member functions + void post(); + void wait(); + bool try_wait(); + bool timed_wait(const boost::posix_time::ptime &); };
    -

    Description

    +

    Description

    Wraps a interprocess_semaphore that can be placed in shared memory and can be shared between processes. Allows timed lock tries

    -

    +

    interprocess_semaphore public construct/copy/destruct

    1. -
      interprocess_semaphore(unsigned int initialCount);
      +
      interprocess_semaphore(unsigned int initialCount);

      Creates a interprocess_semaphore with the given initial count. interprocess_exception if there is an error.

    2. -
      ~interprocess_semaphore();
      +
      ~interprocess_semaphore();

      Destroys the interprocess_semaphore. Does not throw

    -

    -interprocess_semaphore public member functions

    +

    +interprocess_semaphore public member functions

    1. -
      void post();
      +
      void post();

      Increments the interprocess_semaphore count. If there are processes/threads blocked waiting for the interprocess_semaphore, then one of these processes will return successfully from its wait function. If there is an error an interprocess_exception exception is thrown.

    2. -
      void wait();
      +
      void wait();

      Decrements the interprocess_semaphore. If the interprocess_semaphore value is not greater than zero, then the calling process/thread blocks until it can decrement the counter. If there is an error an interprocess_exception exception is thrown.

    3. -
      bool try_wait();
      +
      bool try_wait();

      Decrements the interprocess_semaphore if the interprocess_semaphore's value is greater than zero and returns true. If the value is not greater than zero returns false. If there is an error an interprocess_exception exception is thrown.

    4. -
      bool timed_wait(const boost::posix_time::ptime & abs_time);
      +
      bool timed_wait(const boost::posix_time::ptime & abs_time);

      Decrements the interprocess_semaphore if the interprocess_semaphore's value is greater than zero and returns true. Otherwise, waits for the interprocess_semaphore to the posted or the timeout expires. If the timeout expires, the function returns false. If the interprocess_semaphore is posted the function returns true. If there is an error throws sem_exception

    @@ -98,7 +98,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/interprocess_u_idp36661696.html b/doc/html/boost/interprocess/interprocess_u_idp36661696.html deleted file mode 100644 index f8bf60a6db..0000000000 --- a/doc/html/boost/interprocess/interprocess_u_idp36661696.html +++ /dev/null @@ -1,190 +0,0 @@ - - - - -Class interprocess_upgradable_mutex - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Class interprocess_upgradable_mutex

    -

    boost::interprocess::interprocess_upgradable_mutex

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/sync/interprocess_upgradable_mutex.hpp>
-
-
-class interprocess_upgradable_mutex {
-public:
-  // construct/copy/destruct
-  interprocess_upgradable_mutex(const interprocess_upgradable_mutex &);
-  interprocess_upgradable_mutex();
-  interprocess_upgradable_mutex & 
-  operator=(const interprocess_upgradable_mutex &);
-  ~interprocess_upgradable_mutex();
-
-  // public member functions
-  void lock();
-  bool try_lock();
-  bool timed_lock(const boost::posix_time::ptime &);
-  void unlock();
-  void lock_sharable();
-  bool try_lock_sharable();
-  bool timed_lock_sharable(const boost::posix_time::ptime &);
-  void unlock_sharable();
-  void lock_upgradable();
-  bool try_lock_upgradable();
-  bool timed_lock_upgradable(const boost::posix_time::ptime &);
-  void unlock_upgradable();
-  void unlock_and_lock_upgradable();
-  void unlock_and_lock_sharable();
-  void unlock_upgradable_and_lock_sharable();
-  void unlock_upgradable_and_lock();
-  bool try_unlock_upgradable_and_lock();
-  *bool timed_unlock_upgradable_and_lock(const boost::posix_time::ptime &);
-  bool try_unlock_sharable_and_lock();
-  bool try_unlock_sharable_and_lock_upgradable();
-};
    -
    -

    Description

    -

    Wraps a interprocess_upgradable_mutex that can be placed in shared memory and can be shared between processes. Allows timed lock tries

    -
    -

    -interprocess_upgradable_mutex - public - construct/copy/destruct

    -
      -
    1. interprocess_upgradable_mutex(const interprocess_upgradable_mutex &);
      2. -
    2. -
      interprocess_upgradable_mutex();
      -

      Constructs the upgradable lock. Throws interprocess_exception on error.

      -
      3. -
    3. interprocess_upgradable_mutex & 
-operator=(const interprocess_upgradable_mutex &);
      4. -
    4. -
      ~interprocess_upgradable_mutex();
      -

      Destroys the upgradable lock. Does not throw.

      -
      5. -
    -
    -
    -

    -interprocess_upgradable_mutex public member functions

    -
      -
    1. -
      void lock();
      -

      Effects: The calling thread tries to obtain exclusive ownership of the mutex, and if another thread has exclusive, sharable or upgradable ownership of the mutex, it waits until it can obtain the ownership. Throws: interprocess_exception on error.

      -
      2. -
    2. -
      bool try_lock();
      -

      Effects: The calling thread tries to acquire exclusive ownership of the mutex without waiting. If no other thread has exclusive, sharable or upgradable ownership of the mutex this succeeds. Returns: If it can acquire exclusive ownership immediately returns true. If it has to wait, returns false. Throws: interprocess_exception on error.

      -
      3. -
    3. -
      bool timed_lock(const boost::posix_time::ptime & abs_time);
      -

      Effects: The calling thread tries to acquire exclusive ownership of the mutex waiting if necessary until no other thread has exclusive, sharable or upgradable ownership of the mutex or abs_time is reached. Returns: If acquires exclusive ownership, returns true. Otherwise returns false. Throws: interprocess_exception on error.

      -
      4. -
    4. -
      void unlock();
      -

      Precondition: The thread must have exclusive ownership of the mutex. Effects: The calling thread releases the exclusive ownership of the mutex. Throws: An exception derived from interprocess_exception on error.

      -
      5. -
    5. -
      void lock_sharable();
      -

      Effects: The calling thread tries to obtain sharable ownership of the mutex, and if another thread has exclusive ownership of the mutex, waits until it can obtain the ownership. Throws: interprocess_exception on error.

      -
      6. -
    6. -
      bool try_lock_sharable();
      -

      Effects: The calling thread tries to acquire sharable ownership of the mutex without waiting. If no other thread has exclusive ownership of the mutex this succeeds. Returns: If it can acquire sharable ownership immediately returns true. If it has to wait, returns false. Throws: interprocess_exception on error.

      -
      7. -
    7. -
      bool timed_lock_sharable(const boost::posix_time::ptime & abs_time);
      -

      Effects: The calling thread tries to acquire sharable ownership of the mutex waiting if necessary until no other thread has exclusive ownership of the mutex or abs_time is reached. Returns: If acquires sharable ownership, returns true. Otherwise returns false. Throws: interprocess_exception on error.

      -
      8. -
    8. -
      void unlock_sharable();
      -

      Precondition: The thread must have sharable ownership of the mutex. Effects: The calling thread releases the sharable ownership of the mutex. Throws: An exception derived from interprocess_exception on error.

      -
      9. -
    9. -
      void lock_upgradable();
      -

      Effects: The calling thread tries to obtain upgradable ownership of the mutex, and if another thread has exclusive or upgradable ownership of the mutex, waits until it can obtain the ownership. Throws: interprocess_exception on error.

      -
      10. -
    10. -
      bool try_lock_upgradable();
      -

      Effects: The calling thread tries to acquire upgradable ownership of the mutex without waiting. If no other thread has exclusive or upgradable ownership of the mutex this succeeds. Returns: If it can acquire upgradable ownership immediately returns true. If it has to wait, returns false. Throws: interprocess_exception on error.

      -
      11. -
    11. -
      bool timed_lock_upgradable(const boost::posix_time::ptime & abs_time);
      -

      Effects: The calling thread tries to acquire upgradable ownership of the mutex waiting if necessary until no other thread has exclusive or upgradable ownership of the mutex or abs_time is reached. Returns: If acquires upgradable ownership, returns true. Otherwise returns false. Throws: interprocess_exception on error.

      -
      12. -
    12. -
      void unlock_upgradable();
      -

      Precondition: The thread must have upgradable ownership of the mutex. Effects: The calling thread releases the upgradable ownership of the mutex. Throws: An exception derived from interprocess_exception on error.

      -
      13. -
    13. -
      void unlock_and_lock_upgradable();
      -

      Precondition: The thread must have exclusive ownership of the mutex. Effects: The thread atomically releases exclusive ownership and acquires upgradable ownership. This operation is non-blocking. Throws: An exception derived from interprocess_exception on error.

      -
      14. -
    14. -
      void unlock_and_lock_sharable();
      -

      Precondition: The thread must have exclusive ownership of the mutex. Effects: The thread atomically releases exclusive ownership and acquires sharable ownership. This operation is non-blocking. Throws: An exception derived from interprocess_exception on error.

      -
      15. -
    15. -
      void unlock_upgradable_and_lock_sharable();
      -

      Precondition: The thread must have upgradable ownership of the mutex. Effects: The thread atomically releases upgradable ownership and acquires sharable ownership. This operation is non-blocking. Throws: An exception derived from interprocess_exception on error.

      -
      16. -
    16. -
      void unlock_upgradable_and_lock();
      -

      Precondition: The thread must have upgradable ownership of the mutex. Effects: The thread atomically releases upgradable ownership and acquires exclusive ownership. This operation will block until all threads with sharable ownership release their sharable lock. Throws: An exception derived from interprocess_exception on error.

      -
      17. -
    17. -
      bool try_unlock_upgradable_and_lock();
      -

      Precondition: The thread must have upgradable ownership of the mutex. Effects: The thread atomically releases upgradable ownership and tries to acquire exclusive ownership. This operation will fail if there are threads with sharable ownership, but it will maintain upgradable ownership. Returns: If acquires exclusive ownership, returns true. Otherwise returns false. Throws: An exception derived from interprocess_exception on error.

      -
      18. -
    18. -
      *bool timed_unlock_upgradable_and_lock(const boost::posix_time::ptime & abs_time);
      -

      Precondition: The thread must have upgradable ownership of the mutex. Effects: The thread atomically releases upgradable ownership and tries to acquire exclusive ownership, waiting if necessary until abs_time. This operation will fail if there are threads with sharable ownership or timeout reaches, but it will maintain upgradable ownership. Returns: If acquires exclusive ownership, returns true. Otherwise returns false. Throws: An exception derived from interprocess_exception on error.

      -
      19. -
    19. -
      bool try_unlock_sharable_and_lock();
      -

      Precondition: The thread must have sharable ownership of the mutex. Effects: The thread atomically releases sharable ownership and tries to acquire exclusive ownership. This operation will fail if there are threads with sharable or upgradable ownership, but it will maintain sharable ownership. Returns: If acquires exclusive ownership, returns true. Otherwise returns false. Throws: An exception derived from interprocess_exception on error.

      -
      20. -
    20. -
      bool try_unlock_sharable_and_lock_upgradable();
      -

      Precondition: The thread must have sharable ownership of the mutex. Effects: The thread atomically releases sharable ownership and tries to acquire upgradable ownership. This operation will fail if there are threads with sharable or upgradable ownership, but it will maintain sharable ownership. Returns: If acquires upgradable ownership, returns true. Otherwise returns false. Throws: An exception derived from interprocess_exception on error.

      -
      21. -
    -
    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/intrusive_ptr.html b/doc/html/boost/interprocess/intrusive_ptr.html index 92c53fd1e6..c48690b5d6 100644 --- a/doc/html/boost/interprocess/intrusive_ptr.html +++ b/doc/html/boost/interprocess/intrusive_ptr.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -40,107 +40,107 @@ typedef T element_type; // Provides the type of the stored pointer. // construct/copy/destruct - intrusive_ptr(); - intrusive_ptr(const pointer &, bool = true); - intrusive_ptr(intrusive_ptr const &); - template<typename U> intrusive_ptr(intrusive_ptr< U, VP > const &); - intrusive_ptr & operator=(intrusive_ptr const &); + intrusive_ptr(); + intrusive_ptr(const pointer &, bool = true); + intrusive_ptr(intrusive_ptr const &); + template<typename U> intrusive_ptr(intrusive_ptr< U, VP > const &); + intrusive_ptr & operator=(intrusive_ptr const &); template<typename U> - intrusive_ptr & operator=(intrusive_ptr< U, VP > const &); - intrusive_ptr & operator=(pointer); - ~intrusive_ptr(); + intrusive_ptr & operator=(intrusive_ptr< U, VP > const &); + intrusive_ptr & operator=(pointer); + ~intrusive_ptr(); - // public member functions - pointer & get(); - const pointer & get() const; - T & operator*() const; - const pointer & operator->() const; - pointer & operator->(); - operator unspecified_bool_type() const; - bool operator!() const; - void swap(intrusive_ptr &); + // public member functions + pointer & get(); + const pointer & get() const; + T & operator*() const; + const pointer & operator->() const; + pointer & operator->(); + operator unspecified_bool_type() const; + bool operator!() const; + void swap(intrusive_ptr &); };
    -

    Description

    +

    Description

    The intrusive_ptr class template stores a pointer to an object with an embedded reference count. intrusive_ptr is parameterized on T (the type of the object pointed to) and VoidPointer(a void pointer type that defines the type of pointer that intrusive_ptr will store). intrusive_ptr<T, void *> defines a class with a T* member whereas intrusive_ptr<T, offset_ptr<void> > defines a class with a offset_ptr<T> member. Relies on unqualified calls to:

    void intrusive_ptr_add_ref(T * p); void intrusive_ptr_release(T * p);

    with (p != 0)

    The object is responsible for destroying itself.

    -

    +

    intrusive_ptr public construct/copy/destruct

    1. -
      intrusive_ptr();
      +
      intrusive_ptr();

      Constructor. Initializes internal pointer to 0. Does not throw

    2. -
      intrusive_ptr(const pointer & p, bool add_ref = true);
      +
      intrusive_ptr(const pointer & p, bool add_ref = true);

      Constructor. Copies pointer and if "p" is not zero and "add_ref" is true calls intrusive_ptr_add_ref(to_raw_pointer(p)). Does not throw

    3. -
      intrusive_ptr(intrusive_ptr const & rhs);
      +
      intrusive_ptr(intrusive_ptr const & rhs);

      Copy constructor. Copies the internal pointer and if "p" is not zero calls intrusive_ptr_add_ref(to_raw_pointer(p)). Does not throw

    4. -
      template<typename U> intrusive_ptr(intrusive_ptr< U, VP > const & rhs);
      +
      template<typename U> intrusive_ptr(intrusive_ptr< U, VP > const & rhs);

      Constructor from related. Copies the internal pointer and if "p" is not zero calls intrusive_ptr_add_ref(to_raw_pointer(p)). Does not throw

    5. -
      intrusive_ptr & operator=(intrusive_ptr const & rhs);
      +
      intrusive_ptr & operator=(intrusive_ptr const & rhs);

      Assignment operator. Equivalent to intrusive_ptr(r).swap(*this). Does not throw 

    6. template<typename U> 
-  intrusive_ptr & operator=(intrusive_ptr< U, VP > const & rhs);
      + intrusive_ptr & operator=(intrusive_ptr< U, VP > const & rhs);

      Assignment from related. Equivalent to intrusive_ptr(r).swap(*this). Does not throw

    7. -
      intrusive_ptr & operator=(pointer rhs);
      +
      intrusive_ptr & operator=(pointer rhs);

      Assignment from pointer. Equivalent to intrusive_ptr(r).swap(*this). Does not throw

    8. -
      ~intrusive_ptr();
      +
      ~intrusive_ptr();

      Destructor. If internal pointer is not 0, calls intrusive_ptr_release(to_raw_pointer(m_ptr)). Does not throw

    -

    -intrusive_ptr public member functions

    +

    +intrusive_ptr public member functions

    1. -
      pointer & get();
      +
      pointer & get();

      Returns a reference to the internal pointer. Does not throw

    2. -
      const pointer & get() const;
      +
      const pointer & get() const;

      Returns a reference to the internal pointer. Does not throw

    3. -
      T & operator*() const;
      +
      T & operator*() const;

      Returns *get(). Does not throw

    4. -
      const pointer & operator->() const;
      +
      const pointer & operator->() const;

      Returns *get(). Does not throw

    5. -
      pointer & operator->();
      +
      pointer & operator->();

      Returns get(). Does not throw

    6. -
      operator unspecified_bool_type() const;
      +
      operator unspecified_bool_type() const;

      Conversion to boolean. Does not throw

    7. -
      bool operator!() const;
      +
      bool operator!() const;

      Not operator. Does not throw

    8. -
      void swap(intrusive_ptr & rhs);
      +
      void swap(intrusive_ptr & rhs);

      Exchanges the contents of the two smart pointers. Does not throw

    @@ -157,7 +157,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/iset_index.html b/doc/html/boost/interprocess/iset_index.html index 8469b139b7..93baa48e0b 100644 --- a/doc/html/boost/interprocess/iset_index.html +++ b/doc/html/boost/interprocess/iset_index.html @@ -42,43 +42,43 @@ typedef index_type::value_type value_type; // construct/copy/destruct - iset_index(typename MapConfig::segment_manager_base *); + iset_index(typename MapConfig::segment_manager_base *); - // public member functions - void reserve(typename MapConfig::segment_manager_base::size_type); - void shrink_to_fit(); - iterator find(const intrusive_compare_key_type &); - const_iterator find(const intrusive_compare_key_type &) const; + // public member functions + void reserve(typename MapConfig::segment_manager_base::size_type); + void shrink_to_fit(); + iterator find(const intrusive_compare_key_type &); + const_iterator find(const intrusive_compare_key_type &) const; std::pair< iterator, bool > - insert_check(const intrusive_compare_key_type &, insert_commit_data &); + insert_check(const intrusive_compare_key_type &, insert_commit_data &); };
    -

    Description

    +

    Description

    Index type based in boost::intrusive::set. Just derives from boost::intrusive::set and defines the interface needed by managed memory segments

    -

    +

    iset_index public construct/copy/destruct

    1. -
      iset_index(typename MapConfig::segment_manager_base *);
      +
      iset_index(typename MapConfig::segment_manager_base *);

      Constructor. Takes a pointer to the segment manager. Can throw

    -

    -iset_index public member functions

    +

    +iset_index public member functions

    1. -
      void reserve(typename MapConfig::segment_manager_base::size_type);
      +
      void reserve(typename MapConfig::segment_manager_base::size_type);

      This reserves memory to optimize the insertion of n elements in the index

    2. -
      void shrink_to_fit();
      This frees all unnecessary memory.
      3. -
    3. iterator find(const intrusive_compare_key_type & key);
      4. -
    4. const_iterator find(const intrusive_compare_key_type & key) const;
      5. +
      void shrink_to_fit();
      This frees all unnecessary memory. +
    5. iterator find(const intrusive_compare_key_type & key);
      6. +
    6. const_iterator find(const intrusive_compare_key_type & key) const;
    7. std::pair< iterator, bool > 
-insert_check(const intrusive_compare_key_type & key, 
+insert_check(const intrusive_compare_key_type & key, 
              insert_commit_data & commit_data);
    diff --git a/doc/html/boost/interprocess/iunordered_set_index.html b/doc/html/boost/interprocess/iunordered_set_index.html index b17705fdb8..1dbd961aef 100644 --- a/doc/html/boost/interprocess/iunordered_set_index.html +++ b/doc/html/boost/interprocess/iunordered_set_index.html @@ -48,52 +48,52 @@ typedef index_type::size_type size_type; // construct/copy/destruct - iunordered_set_index(segment_manager_base *); - ~iunordered_set_index(); + iunordered_set_index(segment_manager_base *); + ~iunordered_set_index(); - // public member functions - void reserve(size_type); - void shrink_to_fit(); - iterator find(const intrusive_compare_key_type &); - const_iterator find(const intrusive_compare_key_type &) const; + // public member functions + void reserve(size_type); + void shrink_to_fit(); + iterator find(const intrusive_compare_key_type &); + const_iterator find(const intrusive_compare_key_type &) const; std::pair< iterator, bool > - insert_check(const intrusive_compare_key_type &, insert_commit_data &); - iterator insert_commit(value_type &, insert_commit_data &); + insert_check(const intrusive_compare_key_type &, insert_commit_data &); + iterator insert_commit(value_type &, insert_commit_data &); };
    -

    Description

    +

    Description

    Index type based in boost::intrusive::set. Just derives from boost::intrusive::set and defines the interface needed by managed memory segments

    -

    +

    iunordered_set_index public construct/copy/destruct

    1. -
      iunordered_set_index(segment_manager_base * mngr);
      +
      iunordered_set_index(segment_manager_base * mngr);

      Constructor. Takes a pointer to the segment manager. Can throw

      2. -
    2. ~iunordered_set_index();
      3. +
    3. ~iunordered_set_index();
    -

    -iunordered_set_index public member functions

    +

    +iunordered_set_index public member functions

    1. -
      void reserve(size_type new_n);
      +
      void reserve(size_type new_n);

      This reserves memory to optimize the insertion of n elements in the index

    2. -
      void shrink_to_fit();
      +
      void shrink_to_fit();

      This tries to free unused memory previously allocated.

      3. -
    3. iterator find(const intrusive_compare_key_type & key);
      4. -
    4. const_iterator find(const intrusive_compare_key_type & key) const;
      5. +
    5. iterator find(const intrusive_compare_key_type & key);
      6. +
    6. const_iterator find(const intrusive_compare_key_type & key) const;
    7. std::pair< iterator, bool > 
-insert_check(const intrusive_compare_key_type & key, 
+insert_check(const intrusive_compare_key_type & key, 
              insert_commit_data & commit_data);
      8. -
    8. iterator insert_commit(value_type & val, insert_commit_data & commit_data);
      9. +
    9. iterator insert_commit(value_type & val, insert_commit_data & commit_data);
    diff --git a/doc/html/boost/interprocess/lock_exception.html b/doc/html/boost/interprocess/lock_exception.html index c15379fe71..4f77971ddc 100644 --- a/doc/html/boost/interprocess/lock_exception.html +++ b/doc/html/boost/interprocess/lock_exception.html @@ -36,25 +36,25 @@ class lock_exception : public boost::interprocess::interprocess_exception { public: // construct/copy/destruct - lock_exception(); + lock_exception(); - // public member functions - virtual const char * what() const; + // public member functions + virtual const char * what() const; };
    -

    Description

    +

    Description

    This is the exception thrown by shared interprocess_mutex family when a deadlock situation is detected or when using a interprocess_condition the interprocess_mutex is not locked

    -

    +

    lock_exception public construct/copy/destruct

    -
    1. lock_exception();
    +
    1. lock_exception();
    -

    -lock_exception public member functions

    -
    1. virtual const char * what() const;
    +

    +lock_exception public member functions

    +
    1. virtual const char * what() const;
    diff --git a/doc/html/boost/interprocess/make_man_idm45879390476912.html b/doc/html/boost/interprocess/make_man_idm45879390476912.html new file mode 100644 index 0000000000..757d3dae47 --- /dev/null +++ b/doc/html/boost/interprocess/make_man_idm45879390476912.html @@ -0,0 +1,59 @@ + + + + +Function template make_managed_shared_ptr + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template make_managed_shared_ptr

    +

    boost::interprocess::make_managed_shared_ptr

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/smart_ptr/shared_ptr.hpp>
+
+
+template<typename T, typename ManagedMemory> 
+  managed_shared_ptr< T, ManagedMemory >::type 
+  make_managed_shared_ptr(T * constructed_object, 
+                          ManagedMemory & managed_memory, 
+                          const std::nothrow_t &);
    +
    +

    Description

    +

    Returns an instance of a shared pointer constructed with the default allocator and deleter from a pointer of type T that has been allocated in the passed managed segment. Does not throw, return null shared pointer in error.

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/make_man_idm45879390481424.html b/doc/html/boost/interprocess/make_man_idm45879390481424.html new file mode 100644 index 0000000000..4fdf049313 --- /dev/null +++ b/doc/html/boost/interprocess/make_man_idm45879390481424.html @@ -0,0 +1,58 @@ + + + + +Function template make_managed_shared_ptr + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template make_managed_shared_ptr

    +

    boost::interprocess::make_managed_shared_ptr

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/smart_ptr/shared_ptr.hpp>
+
+
+template<typename T, typename ManagedMemory> 
+  managed_shared_ptr< T, ManagedMemory >::type 
+  make_managed_shared_ptr(T * constructed_object, 
+                          ManagedMemory & managed_memory);
    +
    +

    Description

    +

    Returns an instance of a shared pointer constructed with the default allocator and deleter from a pointer of type T that has been allocated in the passed managed segment

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/make_managed_s_idp36242448.html b/doc/html/boost/interprocess/make_managed_s_idp36242448.html deleted file mode 100644 index 63e243aafe..0000000000 --- a/doc/html/boost/interprocess/make_managed_s_idp36242448.html +++ /dev/null @@ -1,58 +0,0 @@ - - - - -Function template make_managed_shared_ptr - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template make_managed_shared_ptr

    -

    boost::interprocess::make_managed_shared_ptr

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/smart_ptr/shared_ptr.hpp>
-
-
-template<typename T, typename ManagedMemory> 
-  managed_shared_ptr< T, ManagedMemory >::type 
-  make_managed_shared_ptr(T * constructed_object, 
-                          ManagedMemory & managed_memory);
    -
    -

    Description

    -

    Returns an instance of a shared pointer constructed with the default allocator and deleter from a pointer of type T that has been allocated in the passed managed segment

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/make_managed_s_idp36246960.html b/doc/html/boost/interprocess/make_managed_s_idp36246960.html deleted file mode 100644 index eb75dca0e5..0000000000 --- a/doc/html/boost/interprocess/make_managed_s_idp36246960.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Function template make_managed_shared_ptr - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template make_managed_shared_ptr

    -

    boost::interprocess::make_managed_shared_ptr

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/smart_ptr/shared_ptr.hpp>
-
-
-template<typename T, typename ManagedMemory> 
-  managed_shared_ptr< T, ManagedMemory >::type 
-  make_managed_shared_ptr(T * constructed_object, 
-                          ManagedMemory & managed_memory, 
-                          const std::nothrow_t &);
    -
    -

    Description

    -

    Returns an instance of a shared pointer constructed with the default allocator and deleter from a pointer of type T that has been allocated in the passed managed segment. Does not throw, return null shared pointer in error.

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/make_managed_unique_ptr.html b/doc/html/boost/interprocess/make_managed_unique_ptr.html index 4964e653fe..d5c433e880 100644 --- a/doc/html/boost/interprocess/make_managed_unique_ptr.html +++ b/doc/html/boost/interprocess/make_managed_unique_ptr.html @@ -38,7 +38,7 @@ make_managed_unique_ptr(T * constructed_object, ManagedMemory & managed_memory);
    -

    Description

    +

    Description

    Returns an instance of a unique pointer constructed with boost::interproces::deleter from a pointer of type T that has been allocated in the passed managed segment

    diff --git a/doc/html/boost/interprocess/make_managed_weak_ptr.html b/doc/html/boost/interprocess/make_managed_weak_ptr.html index 152b6a3405..e8e64a9e6c 100644 --- a/doc/html/boost/interprocess/make_managed_weak_ptr.html +++ b/doc/html/boost/interprocess/make_managed_weak_ptr.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -38,7 +38,7 @@ make_managed_weak_ptr(T * constructed_object, ManagedMemory & managed_memory);
    -

    Description

    +

    Description

    Returns an instance of a weak pointer constructed with the default allocator and deleter from a pointer of type T that has been allocated in the passed managed segment

    @@ -52,7 +52,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/managed__idm45879391301552.html b/doc/html/boost/interprocess/managed__idm45879391301552.html new file mode 100644 index 0000000000..45caae9b46 --- /dev/null +++ b/doc/html/boost/interprocess/managed__idm45879391301552.html @@ -0,0 +1,55 @@ + + + + +Type definition managed_windows_shared_memory + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Type definition managed_windows_shared_memory

    +

    managed_windows_shared_memory

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/managed_windows_shared_memory.hpp>
+
+
+typedef basic_managed_windows_shared_memory< char,rbtree_best_fit< mutex_family >,iset_index > managed_windows_shared_memory;
    +
    +

    Description

    +

    Typedef for a default basic_managed_windows_shared_memory of narrow characters

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/managed_external_buffer.html b/doc/html/boost/interprocess/managed_external_buffer.html index 78a020d7a4..aa1bb7dec4 100644 --- a/doc/html/boost/interprocess/managed_external_buffer.html +++ b/doc/html/boost/interprocess/managed_external_buffer.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -33,10 +33,10 @@ 
    // In header: <boost/interprocess/managed_external_buffer.hpp>
 
 
-typedef basic_managed_external_buffer< char,rbtree_best_fit< null_mutex_family >,iset_index > managed_external_buffer;
    +typedef basic_managed_external_buffer< char,rbtree_best_fit< null_mutex_family >,iset_index > managed_external_buffer;
    -

    Description

    -

    Typedef for a default basic_managed_external_buffer of narrow characters

    +

    Description

    +

    Typedef for a default basic_managed_external_buffer of narrow characters

    @@ -49,7 +49,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/managed_heap_memory.html b/doc/html/boost/interprocess/managed_heap_memory.html index acfd2e85bb..b914b91e7d 100644 --- a/doc/html/boost/interprocess/managed_heap_memory.html +++ b/doc/html/boost/interprocess/managed_heap_memory.html @@ -35,7 +35,7 @@ typedef basic_managed_heap_memory< char,rbtree_best_fit< null_mutex_family >,iset_index > managed_heap_memory;
    -

    Description

    +

    Description

    Typedef for a default basic_managed_heap_memory of narrow characters

    diff --git a/doc/html/boost/interprocess/managed_mapped_file.html b/doc/html/boost/interprocess/managed_mapped_file.html index 4b70e1e662..8242fc0a01 100644 --- a/doc/html/boost/interprocess/managed_mapped_file.html +++ b/doc/html/boost/interprocess/managed_mapped_file.html @@ -35,7 +35,7 @@ typedef basic_managed_mapped_file< char,rbtree_best_fit< mutex_family >,iset_index > managed_mapped_file;
    -

    Description

    +

    Description

    Typedef for a default basic_managed_mapped_file of narrow characters

    diff --git a/doc/html/boost/interprocess/managed_shared_memory.html b/doc/html/boost/interprocess/managed_shared_memory.html index f1557d04f0..120bbe71ca 100644 --- a/doc/html/boost/interprocess/managed_shared_memory.html +++ b/doc/html/boost/interprocess/managed_shared_memory.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -33,10 +33,10 @@ 
    // In header: <boost/interprocess/managed_shared_memory.hpp>
 
 
-typedef basic_managed_shared_memory< char,rbtree_best_fit< mutex_family >,iset_index > managed_shared_memory;
    +typedef basic_managed_shared_memory< char,rbtree_best_fit< mutex_family >,iset_index > managed_shared_memory;
    -

    Description

    -

    Typedef for a default basic_managed_shared_memory of narrow characters

    +

    Description

    +

    Typedef for a default basic_managed_shared_memory of narrow characters

    @@ -49,7 +49,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/managed_shared_ptr.html b/doc/html/boost/interprocess/managed_shared_ptr.html index 06352d1a15..dc36643688 100644 --- a/doc/html/boost/interprocess/managed_shared_ptr.html +++ b/doc/html/boost/interprocess/managed_shared_ptr.html @@ -40,7 +40,7 @@ typedef shared_ptr< T, void_allocator, deleter > type; };
    -

    Description

    +

    Description

    Returns the type of a shared pointer of type T with the allocator boost::interprocess::allocator allocator and boost::interprocess::deleter deleter that can be constructed in the given managed segment type.

    diff --git a/doc/html/boost/interprocess/managed_unique_ptr.html b/doc/html/boost/interprocess/managed_unique_ptr.html index 5b81bee9ef..400cd62ce3 100644 --- a/doc/html/boost/interprocess/managed_unique_ptr.html +++ b/doc/html/boost/interprocess/managed_unique_ptr.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -38,7 +38,7 @@ typedef boost::movelib::unique_ptr< T, typename ManagedMemory::template deleter< T >::type > type; };
    -

    Description

    +

    Description

    Returns the type of a unique pointer of type T with boost::interprocess::deleter deleter that can be constructed in the given managed segment type.

    @@ -52,7 +52,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/managed_weak_ptr.html b/doc/html/boost/interprocess/managed_weak_ptr.html index ec588f66ad..b387231b71 100644 --- a/doc/html/boost/interprocess/managed_weak_ptr.html +++ b/doc/html/boost/interprocess/managed_weak_ptr.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -35,10 +35,10 @@ template<typename T, typename ManagedMemory> struct managed_weak_ptr { // types - typedef weak_ptr< T, typename ManagedMemory::template allocator< void >::type, typename ManagedMemory::template deleter< T >::type > type; + typedef weak_ptr< T, typename ManagedMemory::template allocator< void >::type, typename ManagedMemory::template deleter< T >::type > type; };
    -

    Description

    +

    Description

    Returns the type of a weak pointer of type T with the allocator boost::interprocess::allocator allocator and boost::interprocess::deleter deleter that can be constructed in the given managed segment type.

    @@ -52,7 +52,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/managed_window_idp35443152.html b/doc/html/boost/interprocess/managed_window_idp35443152.html deleted file mode 100644 index 6fb253cc18..0000000000 --- a/doc/html/boost/interprocess/managed_window_idp35443152.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Type definition managed_windows_shared_memory - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Type definition managed_windows_shared_memory

    -

    managed_windows_shared_memory

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/managed_windows_shared_memory.hpp>
-
-
-typedef basic_managed_windows_shared_memory< char,rbtree_best_fit< mutex_family >,iset_index > managed_windows_shared_memory;
    -
    -

    Description

    -

    Typedef for a default basic_managed_windows_shared_memory of narrow characters

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/managed_xsi_shared_memory.html b/doc/html/boost/interprocess/managed_xsi_shared_memory.html index 288237b98f..10fe52d5c8 100644 --- a/doc/html/boost/interprocess/managed_xsi_shared_memory.html +++ b/doc/html/boost/interprocess/managed_xsi_shared_memory.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -33,10 +33,10 @@ 
    // In header: <boost/interprocess/managed_xsi_shared_memory.hpp>
 
 
-typedef basic_managed_xsi_shared_memory< char,rbtree_best_fit< mutex_family >,iset_index > managed_xsi_shared_memory;
    +typedef basic_managed_xsi_shared_memory< char,rbtree_best_fit< mutex_family >,iset_index > managed_xsi_shared_memory;
    -

    Description

    -

    Typedef for a default basic_managed_xsi_shared_memory of narrow characters

    +

    Description

    +

    Typedef for a default basic_managed_xsi_shared_memory of narrow characters

    @@ -49,7 +49,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/map_index.html b/doc/html/boost/interprocess/map_index.html index 04f3890c3d..20fc78a247 100644 --- a/doc/html/boost/interprocess/map_index.html +++ b/doc/html/boost/interprocess/map_index.html @@ -36,35 +36,35 @@ class map_index : public boost::container::map< MapConfig > { public: // construct/copy/destruct - map_index(segment_manager_base *); + map_index(segment_manager_base *); - // public member functions - void reserve(typename segment_manager_base::size_type); - void shrink_to_fit(); + // public member functions + void reserve(typename segment_manager_base::size_type); + void shrink_to_fit(); };
    -

    Description

    +

    Description

    Index type based in boost::interprocess::map. Just derives from boost::interprocess::map and defines the interface needed by managed memory segments

    -

    +

    map_index public construct/copy/destruct

    1. -
      map_index(segment_manager_base * segment_mngr);
      +
      map_index(segment_manager_base * segment_mngr);

      Constructor. Takes a pointer to the segment manager. Can throw

    -

    -map_index public member functions

    +

    +map_index public member functions

    1. -
      void reserve(typename segment_manager_base::size_type);
      +
      void reserve(typename segment_manager_base::size_type);

      This reserves memory to optimize the insertion of n elements in the index

    2. -
      void shrink_to_fit();
      +
      void shrink_to_fit();

      This tries to free previously allocate unused memory.

    diff --git a/doc/html/boost/interprocess/mapped_region.html b/doc/html/boost/interprocess/mapped_region.html index 261c7a1323..f93cb5c36f 100644 --- a/doc/html/boost/interprocess/mapped_region.html +++ b/doc/html/boost/interprocess/mapped_region.html @@ -38,39 +38,39 @@ enum advice_types; // construct/copy/destruct template<typename MemoryMappable> - mapped_region(const MemoryMappable &, mode_t, offset_t = 0, + mapped_region(const MemoryMappable &, mode_t, offset_t = 0, std::size_t = 0, const void * = 0, map_options_t = default_map_options); - mapped_region(); - mapped_region(mapped_region &&); - mapped_region & operator=(mapped_region &&); - ~mapped_region(); + mapped_region(); + mapped_region(mapped_region &&); + mapped_region & operator=(mapped_region &&); + ~mapped_region(); - // public member functions - void swap(mapped_region &); - std::size_t get_size() const; - void * get_address() const; - mode_t get_mode() const; - bool flush(std::size_t = 0, std::size_t = 0, bool = true); - bool shrink_by(std::size_t, bool = true); - bool advise(advice_types); + // public member functions + void swap(mapped_region &); + std::size_t get_size() const; + void * get_address() const; + mode_t get_mode() const; + bool flush(std::size_t = 0, std::size_t = 0, bool = true); + bool shrink_by(std::size_t, bool = true); + bool advise(advice_types); - // public static functions - static std::size_t get_page_size(); + // public static functions + static std::size_t get_page_size(); };
    -

    Description

    +

    Description

    The mapped_region class represents a portion or region created from a memory_mappable object.

    The OS can map a region bigger than the requested one, as region must be multiple of the page size, but mapped_region will always refer to the region specified by the user.

    -

    +

    mapped_region public construct/copy/destruct

    1. template<typename MemoryMappable> 
-  mapped_region(const MemoryMappable & mapping, mode_t mode, 
+  mapped_region(const MemoryMappable & mapping, mode_t mode, 
                 offset_t offset = 0, std::size_t size = 0, 
                 const void * address = 0, 
                 map_options_t map_options = default_map_options);
      @@ -83,61 +83,61 @@

      The OS could allocate more pages than size/page_size(), but get_address() will always return the address passed in this function (if not null) and get_size() will return the specified size.

    2. -
      mapped_region();
      +
      mapped_region();

      Default constructor. Address will be 0 (nullptr). Size will be 0. Does not throw

    3. -
      mapped_region(mapped_region && other);
      +
      mapped_region(mapped_region && other);

      Move constructor. *this will be constructed taking ownership of "other"'s region and "other" will be left in default constructor state.

    4. -
      mapped_region & operator=(mapped_region && other);
      +
      mapped_region & operator=(mapped_region && other);

      Move assignment. If *this owns a memory mapped region, it will be destroyed and it will take ownership of "other"'s memory mapped region.

    5. -
      ~mapped_region();
      +
      ~mapped_region();

      Destroys the mapped region. Does not throw

    -

    -mapped_region public member functions

    +

    +mapped_region public member functions

    1. -
      void swap(mapped_region & other);
      +
      void swap(mapped_region & other);

      Swaps the mapped_region with another mapped region

    2. -
      std::size_t get_size() const;
      Returns the size of the mapping. Never throws.
      3. +
      std::size_t get_size() const;
      Returns the size of the mapping. Never throws.
    3. -
      void * get_address() const;
      +
      void * get_address() const;

      Returns the base address of the mapping. Never throws.

    4. -
      mode_t get_mode() const;
      +
      mode_t get_mode() const;

      Returns the mode of the mapping used to construct the mapped region. Never throws.

    5. -
      bool flush(std::size_t mapping_offset = 0, std::size_t numbytes = 0, 
+
      bool flush(std::size_t mapping_offset = 0, std::size_t numbytes = 0, 
            bool async = true);
      
 
      Flushes to the disk a byte range within the mapped memory. If 'async' is true, the function will return before flushing operation is completed If 'async' is false, function will return once data has been written into the underlying device (i.e., in mapped files OS cached information is written to disk). Never throws. Returns false if operation could not be performed.
    6. -
      bool shrink_by(std::size_t bytes, bool from_back = true);
      +
      bool shrink_by(std::size_t bytes, bool from_back = true);

      Shrinks current mapped region. If after shrinking there is no longer need for a previously mapped memory page, accessing that page can trigger a segmentation fault. Depending on the OS, this operation might fail (XSI shared memory), it can decommit storage and free a portion of the virtual address space (e.g.POSIX) or this function can release some physical memory wihout freeing any virtual address space(Windows). Returns true on success. Never throws.

    7. -
      bool advise(advice_types advise);
      +
      bool advise(advice_types advise);

      Advises the implementation on the expected behavior of the application with respect to the data in the region. The implementation may use this information to optimize handling of the region data. This function has no effect on the semantics of access to memory in the region, although it may affect the performance of access. If the advise type is not known to the implementation, the function returns false. True otherwise.

    -

    -mapped_region public static functions

    +

    +mapped_region public static functions

    1. -
      static std::size_t get_page_size();
      +
      static std::size_t get_page_size();

      Returns the size of the page. This size is the minimum memory that will be used by the system when mapping a memory mappable source and will restrict the address and the offset to map.

    diff --git a/doc/html/boost/interprocess/mapped_region/advice_types.html b/doc/html/boost/interprocess/mapped_region/advice_types.html index c51139a127..5565350f7e 100644 --- a/doc/html/boost/interprocess/mapped_region/advice_types.html +++ b/doc/html/boost/interprocess/mapped_region/advice_types.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -36,7 +36,7 @@ enum advice_types { advice_normal, advice_sequential, advice_random, advice_willneed, advice_dontneed };
    -

    Description

    +

    Description

    This enum specifies region usage behaviors that an application can specify to the mapped region implementation.

    advice_normal
    @@ -62,7 +62,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/message_queue.html b/doc/html/boost/interprocess/message_queue.html index 34b1819852..9122cf3513 100644 --- a/doc/html/boost/interprocess/message_queue.html +++ b/doc/html/boost/interprocess/message_queue.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -35,7 +35,7 @@ typedef message_queue_t< offset_ptr< void > > message_queue;
    -

    Description

    +

    Description

    Typedef for a default message queue to be used between processes

    @@ -49,7 +49,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/message_queue_t.html b/doc/html/boost/interprocess/message_queue_t.html index d7022379c7..3e1e2f15e0 100644 --- a/doc/html/boost/interprocess/message_queue_t.html +++ b/doc/html/boost/interprocess/message_queue_t.html @@ -42,114 +42,114 @@ typedef unspecified size_type; // construct/copy/destruct - message_queue_t(create_only_t, const char *, size_type, size_type, + message_queue_t(create_only_t, const char *, size_type, size_type, const permissions & = permissions()); - message_queue_t(open_or_create_t, const char *, size_type, size_type, + message_queue_t(open_or_create_t, const char *, size_type, size_type, const permissions & = permissions()); - message_queue_t(open_only_t, const char *); - ~message_queue_t(); + message_queue_t(open_only_t, const char *); + ~message_queue_t(); - // public member functions - void send(const void *, size_type, unsigned int); - bool try_send(const void *, size_type, unsigned int); - bool timed_send(const void *, size_type, unsigned int, + // public member functions + void send(const void *, size_type, unsigned int); + bool try_send(const void *, size_type, unsigned int); + bool timed_send(const void *, size_type, unsigned int, const boost::posix_time::ptime &); - void receive(void *, size_type, size_type &, unsigned int &); - bool try_receive(void *, size_type, size_type &, unsigned int &); - bool timed_receive(void *, size_type, size_type &, unsigned int &, + void receive(void *, size_type, size_type &, unsigned int &); + bool try_receive(void *, size_type, size_type &, unsigned int &); + bool timed_receive(void *, size_type, size_type &, unsigned int &, const boost::posix_time::ptime &); - size_type get_max_msg() const; - size_type get_max_msg_size() const; - size_type get_num_msg() const; + size_type get_max_msg() const; + size_type get_max_msg_size() const; + size_type get_num_msg() const; - // public static functions - static bool remove(const char *); + // public static functions + static bool remove(const char *); };
    -

    Description

    +

    Description

    A class that allows sending messages between processes.

    -

    +

    message_queue_t public construct/copy/destruct

    1. -
      message_queue_t(create_only_t create_only, const char * name, 
+
      message_queue_t(create_only_t create_only, const char * name, 
                 size_type max_num_msg, size_type max_msg_size, 
                 const permissions & perm = permissions());
      
 
      Creates a process shared message queue with name "name". For this message queue, the maximum number of messages will be "max_num_msg" and the maximum message size will be "max_msg_size". Throws on error and if the queue was previously created.
    2. -
      message_queue_t(open_or_create_t open_or_create, const char * name, 
+
      message_queue_t(open_or_create_t open_or_create, const char * name, 
                 size_type max_num_msg, size_type max_msg_size, 
                 const permissions & perm = permissions());
      
 
      Opens or creates a process shared message queue with name "name". If the queue is created, the maximum number of messages will be "max_num_msg" and the maximum message size will be "max_msg_size". If queue was previously created the queue will be opened and "max_num_msg" and "max_msg_size" parameters are ignored. Throws on error.
    3. -
      message_queue_t(open_only_t open_only, const char * name);
      +
      message_queue_t(open_only_t open_only, const char * name);

      Opens a previously created process shared message queue with name "name". If the queue was not previously created or there are no free resources, throws an error.

    4. -
      ~message_queue_t();
      +
      ~message_queue_t();

      Destroys *this and indicates that the calling process is finished using the resource. All opened message queues are still valid after destruction. The destructor function will deallocate any system resources allocated by the system for use by this process for this resource. The resource can still be opened again calling the open constructor overload. To erase the message queue from the system use remove().

    -

    -message_queue_t public member functions

    +

    +message_queue_t public member functions

    1. -
      void send(const void * buffer, size_type buffer_size, unsigned int priority);
      +
      void send(const void * buffer, size_type buffer_size, unsigned int priority);

      Sends a message stored in buffer "buffer" with size "buffer_size" in the message queue with priority "priority". If the message queue is full the sender is blocked. Throws interprocess_error on error.

    2. -
      bool try_send(const void * buffer, size_type buffer_size, 
+
      bool try_send(const void * buffer, size_type buffer_size, 
               unsigned int priority);
      
 
      Sends a message stored in buffer "buffer" with size "buffer_size" through the message queue with priority "priority". If the message queue is full the sender is not blocked and returns false, otherwise returns true. Throws interprocess_error on error.
    3. -
      bool timed_send(const void * buffer, size_type buffer_size, 
+
      bool timed_send(const void * buffer, size_type buffer_size, 
                 unsigned int priority, 
                 const boost::posix_time::ptime & abs_time);
      
 
      Sends a message stored in buffer "buffer" with size "buffer_size" in the message queue with priority "priority". If the message queue is full the sender retries until time "abs_time" is reached. Returns true if the message has been successfully sent. Returns false if timeout is reached. Throws interprocess_error on error.
    4. -
      void receive(void * buffer, size_type buffer_size, size_type & recvd_size, 
+
      void receive(void * buffer, size_type buffer_size, size_type & recvd_size, 
              unsigned int & priority);
      
 
      Receives a message from the message queue. The message is stored in buffer "buffer", which has size "buffer_size". The received message has size "recvd_size" and priority "priority". If the message queue is empty the receiver is blocked. Throws interprocess_error on error.
    5. -
      bool try_receive(void * buffer, size_type buffer_size, size_type & recvd_size, 
+
      bool try_receive(void * buffer, size_type buffer_size, size_type & recvd_size, 
                  unsigned int & priority);
      
 
      Receives a message from the message queue. The message is stored in buffer "buffer", which has size "buffer_size". The received message has size "recvd_size" and priority "priority". If the message queue is empty the receiver is not blocked and returns false, otherwise returns true. Throws interprocess_error on error.
    6. -
      bool timed_receive(void * buffer, size_type buffer_size, 
+
      bool timed_receive(void * buffer, size_type buffer_size, 
                    size_type & recvd_size, unsigned int & priority, 
                    const boost::posix_time::ptime & abs_time);
      
 
      Receives a message from the message queue. The message is stored in buffer "buffer", which has size "buffer_size". The received message has size "recvd_size" and priority "priority". If the message queue is empty the receiver retries until time "abs_time" is reached. Returns true if the message has been successfully sent. Returns false if timeout is reached. Throws interprocess_error on error.
    7. -
      size_type get_max_msg() const;
      +
      size_type get_max_msg() const;

      Returns the maximum number of messages allowed by the queue. The message queue must be opened or created previously. Otherwise, returns 0. Never throws

    8. -
      size_type get_max_msg_size() const;
      +
      size_type get_max_msg_size() const;

      Returns the maximum size of message allowed by the queue. The message queue must be opened or created previously. Otherwise, returns 0. Never throws

    9. -
      size_type get_num_msg() const;
      +
      size_type get_num_msg() const;

      Returns the number of messages currently stored. Never throws

    -

    -message_queue_t public static functions

    +

    +message_queue_t public static functions

    1. -
      static bool remove(const char * name);
      +
      static bool remove(const char * name);

      Removes the message queue from the system. Returns false on error. Never throws

    diff --git a/doc/html/boost/interprocess/mutex_family.html b/doc/html/boost/interprocess/mutex_family.html index 7883644d7c..969f97c09f 100644 --- a/doc/html/boost/interprocess/mutex_family.html +++ b/doc/html/boost/interprocess/mutex_family.html @@ -36,10 +36,10 @@ struct mutex_family { // types typedef boost::interprocess::interprocess_mutex mutex_type; - typedef boost::interprocess::interprocess_recursive_mutex recursive_mutex_type; + typedef boost::interprocess::interprocess_recursive_mutex recursive_mutex_type; };
    -

    Description

    +

    Description

    Describes interprocess_mutex family to use with Interprocess framework based on boost::interprocess synchronization objects.

    diff --git a/doc/html/boost/interprocess/named_condition.html b/doc/html/boost/interprocess/named_condition.html index 804c097c9d..0d57c6bf84 100644 --- a/doc/html/boost/interprocess/named_condition.html +++ b/doc/html/boost/interprocess/named_condition.html @@ -36,92 +36,92 @@ class named_condition { public: // construct/copy/destruct - named_condition(create_only_t, const char *, + named_condition(create_only_t, const char *, const permissions & = permissions()); - named_condition(open_or_create_t, const char *, + named_condition(open_or_create_t, const char *, const permissions & = permissions()); - named_condition(open_only_t, const char *); - ~named_condition(); + named_condition(open_only_t, const char *); + ~named_condition(); - // public member functions - *void notify_one(); - void notify_all(); - template<typename L> void wait(L &); - template<typename L, typename Pr> void wait(L &, Pr); - template<typename L> bool timed_wait(L &, const boost::posix_time::ptime &); + // public member functions + *void notify_one(); + void notify_all(); + template<typename L> void wait(L &); + template<typename L, typename Pr> void wait(L &, Pr); + template<typename L> bool timed_wait(L &, const boost::posix_time::ptime &); template<typename L, typename Pr> - bool timed_wait(L &, const boost::posix_time::ptime &, Pr); + bool timed_wait(L &, const boost::posix_time::ptime &, Pr); - // public static functions - static bool remove(const char *); + // public static functions + static bool remove(const char *); };
    -

    Description

    +

    Description

    A global condition variable that can be created by name. This condition variable is designed to work with named_mutex and can't be placed in shared memory or memory mapped files.

    -

    +

    named_condition public construct/copy/destruct

    1. -
      named_condition(create_only_t create_only, const char * name, 
+
      named_condition(create_only_t create_only, const char * name, 
                 const permissions & perm = permissions());
      
 
      Creates a global condition with a name. If the condition can't be created throws interprocess_exception
    2. -
      named_condition(open_or_create_t open_or_create, const char * name, 
+
      named_condition(open_or_create_t open_or_create, const char * name, 
                 const permissions & perm = permissions());
      
 
      Opens or creates a global condition with a name. If the condition is created, this call is equivalent to named_condition(create_only_t, ... ) If the condition is already created, this call is equivalent named_condition(open_only_t, ... ) Does not throw
    3. -
      named_condition(open_only_t open_only, const char * name);
      +
      named_condition(open_only_t open_only, const char * name);

      Opens a global condition with a name if that condition is previously created. If it is not previously created this function throws interprocess_exception.

    4. -
      ~named_condition();
      +
      ~named_condition();

      Destroys *this and indicates that the calling process is finished using the resource. The destructor function will deallocate any system resources allocated by the system for use by this process for this resource. The resource can still be opened again calling the open constructor overload. To erase the resource from the system use remove().

    -

    -named_condition public member functions

    +

    +named_condition public member functions

    1. -
      *void notify_one();
      +
      *void notify_one();

      If there is a thread waiting on *this, change that thread's state to ready. Otherwise there is no effect.

    2. -
      void notify_all();
      +
      void notify_all();

      Change the state of all threads waiting on *this to ready. If there are no waiting threads, notify_all() has no effect.

    3. -
      template<typename L> void wait(L & lock);
      +
      template<typename L> void wait(L & lock);

      Releases the lock on the named_mutex object associated with lock, blocks the current thread of execution until readied by a call to this->notify_one() or this->notify_all(), and then reacquires the lock.

    4. -
      template<typename L, typename Pr> void wait(L & lock, Pr pred);
      +
      template<typename L, typename Pr> void wait(L & lock, Pr pred);

      The same as: while (!pred()) wait(lock) 

    5. template<typename L> 
-  bool timed_wait(L & lock, const boost::posix_time::ptime & abs_time);
      + bool timed_wait(L & lock, const boost::posix_time::ptime & abs_time);

      Releases the lock on the named_mutex object associated with lock, blocks the current thread of execution until readied by a call to this->notify_one() or this->notify_all(), or until time abs_time is reached, and then reacquires the lock. Returns: false if time abs_time is reached, otherwise true. 

    6. template<typename L, typename Pr> 
-  bool timed_wait(L & lock, const boost::posix_time::ptime & abs_time, 
+  bool timed_wait(L & lock, const boost::posix_time::ptime & abs_time, 
                   Pr pred);

      The same as: while (!pred()) { if (!timed_wait(lock, abs_time)) return pred(); } return true;

    -

    -named_condition public static functions

    +

    +named_condition public static functions

    1. -
      static bool remove(const char * name);
      +
      static bool remove(const char * name);

      Erases a named condition from the system. Returns false on error. Never throws.

    diff --git a/doc/html/boost/interprocess/named_condition_any.html b/doc/html/boost/interprocess/named_condition_any.html index d9b4b152e8..d17d4f0a13 100644 --- a/doc/html/boost/interprocess/named_condition_any.html +++ b/doc/html/boost/interprocess/named_condition_any.html @@ -36,92 +36,92 @@ class named_condition_any { public: // construct/copy/destruct - named_condition_any(create_only_t, const char *, + named_condition_any(create_only_t, const char *, const permissions & = permissions()); - named_condition_any(open_or_create_t, const char *, + named_condition_any(open_or_create_t, const char *, const permissions & = permissions()); - named_condition_any(open_only_t, const char *); - ~named_condition_any(); + named_condition_any(open_only_t, const char *); + ~named_condition_any(); - // public member functions - *void notify_one(); - void notify_all(); - template<typename L> void wait(L &); - template<typename L, typename Pr> void wait(L &, Pr); - template<typename L> bool timed_wait(L &, const boost::posix_time::ptime &); + // public member functions + *void notify_one(); + void notify_all(); + template<typename L> void wait(L &); + template<typename L, typename Pr> void wait(L &, Pr); + template<typename L> bool timed_wait(L &, const boost::posix_time::ptime &); template<typename L, typename Pr> - bool timed_wait(L &, const boost::posix_time::ptime &, Pr); + bool timed_wait(L &, const boost::posix_time::ptime &, Pr); - // public static functions - static bool remove(const char *); + // public static functions + static bool remove(const char *); };
    -

    Description

    +

    Description

    A global condition variable that can be created by name. This condition variable is designed to work with named_mutex and can't be placed in shared memory or memory mapped files.

    -

    +

    named_condition_any public construct/copy/destruct

    1. -
      named_condition_any(create_only_t, const char * name, 
+
      named_condition_any(create_only_t, const char * name, 
                     const permissions & perm = permissions());
      
 
      Creates a global condition with a name. If the condition can't be created throws interprocess_exception
    2. -
      named_condition_any(open_or_create_t, const char * name, 
+
      named_condition_any(open_or_create_t, const char * name, 
                     const permissions & perm = permissions());
      
 
      Opens or creates a global condition with a name. If the condition is created, this call is equivalent to named_condition_any(create_only_t, ... ) If the condition is already created, this call is equivalent named_condition_any(open_only_t, ... ) Does not throw
    3. -
      named_condition_any(open_only_t, const char * name);
      +
      named_condition_any(open_only_t, const char * name);

      Opens a global condition with a name if that condition is previously created. If it is not previously created this function throws interprocess_exception.

    4. -
      ~named_condition_any();
      +
      ~named_condition_any();

      Destroys *this and indicates that the calling process is finished using the resource. The destructor function will deallocate any system resources allocated by the system for use by this process for this resource. The resource can still be opened again calling the open constructor overload. To erase the resource from the system use remove().

    -

    -named_condition_any public member functions

    +

    +named_condition_any public member functions

    1. -
      *void notify_one();
      +
      *void notify_one();

      If there is a thread waiting on *this, change that thread's state to ready. Otherwise there is no effect.

    2. -
      void notify_all();
      +
      void notify_all();

      Change the state of all threads waiting on *this to ready. If there are no waiting threads, notify_all() has no effect.

    3. -
      template<typename L> void wait(L & lock);
      +
      template<typename L> void wait(L & lock);

      Releases the lock on the named_mutex object associated with lock, blocks the current thread of execution until readied by a call to this->notify_one() or this->notify_all(), and then reacquires the lock.

    4. -
      template<typename L, typename Pr> void wait(L & lock, Pr pred);
      +
      template<typename L, typename Pr> void wait(L & lock, Pr pred);

      The same as: while (!pred()) wait(lock) 

    5. template<typename L> 
-  bool timed_wait(L & lock, const boost::posix_time::ptime & abs_time);
      + bool timed_wait(L & lock, const boost::posix_time::ptime & abs_time);

      Releases the lock on the named_mutex object associated with lock, blocks the current thread of execution until readied by a call to this->notify_one() or this->notify_all(), or until time abs_time is reached, and then reacquires the lock. Returns: false if time abs_time is reached, otherwise true. 

    6. template<typename L, typename Pr> 
-  bool timed_wait(L & lock, const boost::posix_time::ptime & abs_time, 
+  bool timed_wait(L & lock, const boost::posix_time::ptime & abs_time, 
                   Pr pred);

      The same as: while (!pred()) { if (!timed_wait(lock, abs_time)) return pred(); } return true;

    -

    -named_condition_any public static functions

    +

    +named_condition_any public static functions

    1. -
      static bool remove(const char * name);
      +
      static bool remove(const char * name);

      Erases a named condition from the system. Returns false on error. Never throws.

    diff --git a/doc/html/boost/interprocess/named_mutex.html b/doc/html/boost/interprocess/named_mutex.html index 5473620c13..8cf8615e6e 100644 --- a/doc/html/boost/interprocess/named_mutex.html +++ b/doc/html/boost/interprocess/named_mutex.html @@ -36,78 +36,78 @@ class named_mutex { public: // construct/copy/destruct - named_mutex(create_only_t, const char *, + named_mutex(create_only_t, const char *, const permissions & = permissions()); - named_mutex(open_or_create_t, const char *, + named_mutex(open_or_create_t, const char *, const permissions & = permissions()); - named_mutex(open_only_t, const char *); - ~named_mutex(); + named_mutex(open_only_t, const char *); + ~named_mutex(); - // public member functions - void unlock(); - void lock(); - bool try_lock(); - bool timed_lock(const boost::posix_time::ptime &); + // public member functions + void unlock(); + void lock(); + bool try_lock(); + bool timed_lock(const boost::posix_time::ptime &); - // public static functions - static bool remove(const char *); + // public static functions + static bool remove(const char *); };
    -

    Description

    +

    Description

    A mutex with a global name, so it can be found from different processes. This mutex can't be placed in shared memory, and each process should have it's own named_mutex.

    -

    +

    named_mutex public construct/copy/destruct

    1. -
      named_mutex(create_only_t create_only, const char * name, 
+
      named_mutex(create_only_t create_only, const char * name, 
             const permissions & perm = permissions());
      
 
      Creates a global mutex with a name. Throws interprocess_exception on error.
    2. -
      named_mutex(open_or_create_t open_or_create, const char * name, 
+
      named_mutex(open_or_create_t open_or_create, const char * name, 
             const permissions & perm = permissions());
      
 
      Opens or creates a global mutex with a name. If the mutex is created, this call is equivalent to named_mutex(create_only_t, ... ) If the mutex is already created, this call is equivalent named_mutex(open_only_t, ... ) Does not throw
    3. -
      named_mutex(open_only_t open_only, const char * name);
      +
      named_mutex(open_only_t open_only, const char * name);

      Opens a global mutex with a name if that mutex is previously created. If it is not previously created this function throws interprocess_exception.

    4. -
      ~named_mutex();
      +
      ~named_mutex();

      Destroys *this and indicates that the calling process is finished using the resource. The destructor function will deallocate any system resources allocated by the system for use by this process for this resource. The resource can still be opened again calling the open constructor overload. To erase the resource from the system use remove().

    -

    -named_mutex public member functions

    +

    +named_mutex public member functions

    1. -
      void unlock();
      +
      void unlock();

      Unlocks a previously locked mutex.

    2. -
      void lock();
      +
      void lock();

      Locks the mutex, sleeps when the mutex is already locked. Throws interprocess_exception if a severe error is found

    3. -
      bool try_lock();
      +
      bool try_lock();

      Tries to lock the mutex, returns false when the mutex is already locked, returns true when success. Throws interprocess_exception if a severe error is found

    4. -
      bool timed_lock(const boost::posix_time::ptime & abs_time);
      +
      bool timed_lock(const boost::posix_time::ptime & abs_time);

      Tries to lock the the mutex until time abs_time, Returns false when timeout expires, returns true when locks. Throws interprocess_exception if a severe error is found

    -

    -named_mutex public static functions

    +

    +named_mutex public static functions

    1. -
      static bool remove(const char * name);
      +
      static bool remove(const char * name);

      Erases a named mutex from the system. Returns false on error. Never throws.

    diff --git a/doc/html/boost/interprocess/named_recursive_mutex.html b/doc/html/boost/interprocess/named_recursive_mutex.html index 5510cc6461..3082d5c114 100644 --- a/doc/html/boost/interprocess/named_recursive_mutex.html +++ b/doc/html/boost/interprocess/named_recursive_mutex.html @@ -36,78 +36,78 @@ class named_recursive_mutex { public: // construct/copy/destruct - named_recursive_mutex(create_only_t, const char *, + named_recursive_mutex(create_only_t, const char *, const permissions & = permissions()); - named_recursive_mutex(open_or_create_t, const char *, + named_recursive_mutex(open_or_create_t, const char *, const permissions & = permissions()); - named_recursive_mutex(open_only_t, const char *); - ~named_recursive_mutex(); + named_recursive_mutex(open_only_t, const char *); + ~named_recursive_mutex(); - // public member functions - void unlock(); - void lock(); - bool try_lock(); - bool timed_lock(const boost::posix_time::ptime &); + // public member functions + void unlock(); + void lock(); + bool try_lock(); + bool timed_lock(const boost::posix_time::ptime &); - // public static functions - static bool remove(const char *); + // public static functions + static bool remove(const char *); };
    -

    Description

    +

    Description

    A recursive mutex with a global name, so it can be found from different processes. This mutex can't be placed in shared memory, and each process should have it's own named_recursive_mutex.

    -

    +

    named_recursive_mutex public construct/copy/destruct

    1. -
      named_recursive_mutex(create_only_t create_only, const char * name, 
+
      named_recursive_mutex(create_only_t create_only, const char * name, 
                       const permissions & perm = permissions());
      
 
      Creates a global recursive_mutex with a name. If the recursive_mutex can't be created throws interprocess_exception
    2. -
      named_recursive_mutex(open_or_create_t open_or_create, const char * name, 
+
      named_recursive_mutex(open_or_create_t open_or_create, const char * name, 
                       const permissions & perm = permissions());
      
 
      Opens or creates a global recursive_mutex with a name. If the recursive_mutex is created, this call is equivalent to named_recursive_mutex(create_only_t, ... ) If the recursive_mutex is already created, this call is equivalent named_recursive_mutex(open_only_t, ... ) Does not throw
    3. -
      named_recursive_mutex(open_only_t open_only, const char * name);
      +
      named_recursive_mutex(open_only_t open_only, const char * name);

      Opens a global recursive_mutex with a name if that recursive_mutex is previously created. If it is not previously created this function throws interprocess_exception.

    4. -
      ~named_recursive_mutex();
      +
      ~named_recursive_mutex();

      Destroys *this and indicates that the calling process is finished using the resource. The destructor function will deallocate any system resources allocated by the system for use by this process for this resource. The resource can still be opened again calling the open constructor overload. To erase the resource from the system use remove().

    -

    -named_recursive_mutex public member functions

    +

    +named_recursive_mutex public member functions

    1. -
      void unlock();
      +
      void unlock();

      Unlocks a previously locked named_recursive_mutex.

    2. -
      void lock();
      +
      void lock();

      Locks named_recursive_mutex, sleeps when named_recursive_mutex is already locked. Throws interprocess_exception if a severe error is found.

    3. -
      bool try_lock();
      +
      bool try_lock();

      Tries to lock the named_recursive_mutex, returns false when named_recursive_mutex is already locked, returns true when success. Throws interprocess_exception if a severe error is found.

    4. -
      bool timed_lock(const boost::posix_time::ptime & abs_time);
      +
      bool timed_lock(const boost::posix_time::ptime & abs_time);

      Tries to lock the named_recursive_mutex until time abs_time, Returns false when timeout expires, returns true when locks. Throws interprocess_exception if a severe error is found

    -

    -named_recursive_mutex public static functions

    +

    +named_recursive_mutex public static functions

    1. -
      static bool remove(const char * name);
      +
      static bool remove(const char * name);

      Erases a named recursive mutex from the system

    diff --git a/doc/html/boost/interprocess/named_semaphore.html b/doc/html/boost/interprocess/named_semaphore.html index 80fb6e9151..865dbc152d 100644 --- a/doc/html/boost/interprocess/named_semaphore.html +++ b/doc/html/boost/interprocess/named_semaphore.html @@ -36,79 +36,79 @@ class named_semaphore { public: // construct/copy/destruct - named_semaphore(create_only_t, const char *, unsigned int, + named_semaphore(create_only_t, const char *, unsigned int, const permissions & = permissions()); - named_semaphore(open_or_create_t, const char *, unsigned int, + named_semaphore(open_or_create_t, const char *, unsigned int, const permissions & = permissions()); - named_semaphore(open_only_t, const char *); - ~named_semaphore(); + named_semaphore(open_only_t, const char *); + ~named_semaphore(); - // public member functions - void post(); - void wait(); - bool try_wait(); - bool timed_wait(const boost::posix_time::ptime &); + // public member functions + void post(); + void wait(); + bool try_wait(); + bool timed_wait(const boost::posix_time::ptime &); - // public static functions - static bool remove(const char *); + // public static functions + static bool remove(const char *); };
    -

    Description

    +

    Description

    A semaphore with a global name, so it can be found from different processes. Allows several resource sharing patterns and efficient acknowledgment mechanisms.

    -

    +

    named_semaphore public construct/copy/destruct

    1. -
      named_semaphore(create_only_t, const char * name, unsigned int initialCount, 
+
      named_semaphore(create_only_t, const char * name, unsigned int initialCount, 
                 const permissions & perm = permissions());
      
 
      Creates a global semaphore with a name, and an initial count. If the semaphore can't be created throws interprocess_exception
    2. -
      named_semaphore(open_or_create_t, const char * name, 
+
      named_semaphore(open_or_create_t, const char * name, 
                 unsigned int initialCount, 
                 const permissions & perm = permissions());
      
 
      Opens or creates a global semaphore with a name, and an initial count. If the semaphore is created, this call is equivalent to named_semaphore(create_only_t, ...) If the semaphore is already created, this call is equivalent to named_semaphore(open_only_t, ... ) and initialCount is ignored.
    3. -
      named_semaphore(open_only_t, const char * name);
      +
      named_semaphore(open_only_t, const char * name);

      Opens a global semaphore with a name if that semaphore is previously. created. If it is not previously created this function throws interprocess_exception.

    4. -
      ~named_semaphore();
      +
      ~named_semaphore();

      Destroys *this and indicates that the calling process is finished using the resource. The destructor function will deallocate any system resources allocated by the system for use by this process for this resource. The resource can still be opened again calling the open constructor overload. To erase the resource from the system use remove().

    -

    -named_semaphore public member functions

    +

    +named_semaphore public member functions

    1. -
      void post();
      +
      void post();

      Increments the semaphore count. If there are processes/threads blocked waiting for the semaphore, then one of these processes will return successfully from its wait function. If there is an error an interprocess_exception exception is thrown.

    2. -
      void wait();
      +
      void wait();

      Decrements the semaphore. If the semaphore value is not greater than zero, then the calling process/thread blocks until it can decrement the counter. If there is an error an interprocess_exception exception is thrown.

    3. -
      bool try_wait();
      +
      bool try_wait();

      Decrements the semaphore if the semaphore's value is greater than zero and returns true. If the value is not greater than zero returns false. If there is an error an interprocess_exception exception is thrown.

    4. -
      bool timed_wait(const boost::posix_time::ptime & abs_time);
      +
      bool timed_wait(const boost::posix_time::ptime & abs_time);

      Decrements the semaphore if the semaphore's value is greater than zero and returns true. Otherwise, waits for the semaphore to the posted or the timeout expires. If the timeout expires, the function returns false. If the semaphore is posted the function returns true. If there is an error throws sem_exception

    -

    -named_semaphore public static functions

    +

    +named_semaphore public static functions

    1. -
      static bool remove(const char * name);
      +
      static bool remove(const char * name);

      Erases a named semaphore from the system. Returns false on error. Never throws.

    diff --git a/doc/html/boost/interprocess/named_sharable_mutex.html b/doc/html/boost/interprocess/named_sharable_mutex.html index 1be6987c0f..084c205a7a 100644 --- a/doc/html/boost/interprocess/named_sharable_mutex.html +++ b/doc/html/boost/interprocess/named_sharable_mutex.html @@ -36,98 +36,98 @@ class named_sharable_mutex { public: // construct/copy/destruct - named_sharable_mutex(create_only_t, const char *, + named_sharable_mutex(create_only_t, const char *, const permissions & = permissions()); - named_sharable_mutex(open_or_create_t, const char *, + named_sharable_mutex(open_or_create_t, const char *, const permissions & = permissions()); - named_sharable_mutex(open_only_t, const char *); - ~named_sharable_mutex(); + named_sharable_mutex(open_only_t, const char *); + ~named_sharable_mutex(); - // public member functions - void lock(); - bool try_lock(); - bool timed_lock(const boost::posix_time::ptime &); - void unlock(); - void lock_sharable(); - bool try_lock_sharable(); - bool timed_lock_sharable(const boost::posix_time::ptime &); - void unlock_sharable(); + // public member functions + void lock(); + bool try_lock(); + bool timed_lock(const boost::posix_time::ptime &); + void unlock(); + void lock_sharable(); + bool try_lock_sharable(); + bool timed_lock_sharable(const boost::posix_time::ptime &); + void unlock_sharable(); - // public static functions - static bool remove(const char *); + // public static functions + static bool remove(const char *); };
    -

    Description

    +

    Description

    A sharable mutex with a global name, so it can be found from different processes. This mutex can't be placed in shared memory, and each process should have it's own named sharable mutex.

    -

    +

    named_sharable_mutex public construct/copy/destruct

    1. -
      named_sharable_mutex(create_only_t create_only, const char * name, 
+
      named_sharable_mutex(create_only_t create_only, const char * name, 
                      const permissions & perm = permissions());
      
 
      Creates a global sharable mutex with a name. If the sharable mutex can't be created throws interprocess_exception
    2. -
      named_sharable_mutex(open_or_create_t open_or_create, const char * name, 
+
      named_sharable_mutex(open_or_create_t open_or_create, const char * name, 
                      const permissions & perm = permissions());
      
 
      Opens or creates a global sharable mutex with a name. If the sharable mutex is created, this call is equivalent to named_sharable_mutex(create_only_t, ...) If the sharable mutex is already created, this call is equivalent to named_sharable_mutex(open_only_t, ... ).
    3. -
      named_sharable_mutex(open_only_t open_only, const char * name);
      +
      named_sharable_mutex(open_only_t open_only, const char * name);

      Opens a global sharable mutex with a name if that sharable mutex is previously. created. If it is not previously created this function throws interprocess_exception.

    4. -
      ~named_sharable_mutex();
      +
      ~named_sharable_mutex();

      Destroys *this and indicates that the calling process is finished using the resource. The destructor function will deallocate any system resources allocated by the system for use by this process for this resource. The resource can still be opened again calling the open constructor overload. To erase the resource from the system use remove().

    -

    -named_sharable_mutex public member functions

    +

    +named_sharable_mutex public member functions

    1. -
      void lock();
      +
      void lock();

      Effects: The calling thread tries to obtain exclusive ownership of the mutex, and if another thread has exclusive or sharable ownership of the mutex, it waits until it can obtain the ownership. Throws: interprocess_exception on error.

    2. -
      bool try_lock();
      +
      bool try_lock();

      Effects: The calling thread tries to acquire exclusive ownership of the mutex without waiting. If no other thread has exclusive or sharable ownership of the mutex this succeeds. Returns: If it can acquire exclusive ownership immediately returns true. If it has to wait, returns false. Throws: interprocess_exception on error.

    3. -
      bool timed_lock(const boost::posix_time::ptime & abs_time);
      +
      bool timed_lock(const boost::posix_time::ptime & abs_time);

      Effects: The calling thread tries to acquire exclusive ownership of the mutex waiting if necessary until no other thread has exclusive, or sharable ownership of the mutex or abs_time is reached. Returns: If acquires exclusive ownership, returns true. Otherwise returns false. Throws: interprocess_exception on error.

    4. -
      void unlock();
      +
      void unlock();

      Precondition: The thread must have exclusive ownership of the mutex. Effects: The calling thread releases the exclusive ownership of the mutex. Throws: An exception derived from interprocess_exception on error.

    5. -
      void lock_sharable();
      +
      void lock_sharable();

      Effects: The calling thread tries to obtain sharable ownership of the mutex, and if another thread has exclusive ownership of the mutex, waits until it can obtain the ownership. Throws: interprocess_exception on error.

    6. -
      bool try_lock_sharable();
      +
      bool try_lock_sharable();

      Effects: The calling thread tries to acquire sharable ownership of the mutex without waiting. If no other thread has exclusive ownership of the mutex this succeeds. Returns: If it can acquire sharable ownership immediately returns true. If it has to wait, returns false. Throws: interprocess_exception on error.

    7. -
      bool timed_lock_sharable(const boost::posix_time::ptime & abs_time);
      +
      bool timed_lock_sharable(const boost::posix_time::ptime & abs_time);

      Effects: The calling thread tries to acquire sharable ownership of the mutex waiting if necessary until no other thread has exclusive ownership of the mutex or abs_time is reached. Returns: If acquires sharable ownership, returns true. Otherwise returns false. Throws: interprocess_exception on error.

    8. -
      void unlock_sharable();
      +
      void unlock_sharable();

      Precondition: The thread must have sharable ownership of the mutex. Effects: The calling thread releases the sharable ownership of the mutex. Throws: An exception derived from interprocess_exception on error.

    -

    -named_sharable_mutex public static functions

    +

    +named_sharable_mutex public static functions

    1. -
      static bool remove(const char * name);
      +
      static bool remove(const char * name);

      Erases a named sharable mutex from the system. Returns false on error. Never throws.

    diff --git a/doc/html/boost/interprocess/named_upgradable_mutex.html b/doc/html/boost/interprocess/named_upgradable_mutex.html index b570aa8509..699e276ffa 100644 --- a/doc/html/boost/interprocess/named_upgradable_mutex.html +++ b/doc/html/boost/interprocess/named_upgradable_mutex.html @@ -36,158 +36,158 @@ class named_upgradable_mutex { public: // construct/copy/destruct - named_upgradable_mutex(create_only_t, const char *, + named_upgradable_mutex(create_only_t, const char *, const permissions & = permissions()); - named_upgradable_mutex(open_or_create_t, const char *, + named_upgradable_mutex(open_or_create_t, const char *, const permissions & = permissions()); - named_upgradable_mutex(open_only_t, const char *); - ~named_upgradable_mutex(); + named_upgradable_mutex(open_only_t, const char *); + ~named_upgradable_mutex(); - // public member functions - void lock(); - bool try_lock(); - bool timed_lock(const boost::posix_time::ptime &); - void unlock(); - void lock_sharable(); - bool try_lock_sharable(); - bool timed_lock_sharable(const boost::posix_time::ptime &); - void unlock_sharable(); - void lock_upgradable(); - bool try_lock_upgradable(); - bool timed_lock_upgradable(const boost::posix_time::ptime &); - void unlock_upgradable(); - void unlock_and_lock_upgradable(); - void unlock_and_lock_sharable(); - void unlock_upgradable_and_lock_sharable(); - void unlock_upgradable_and_lock(); - bool try_unlock_upgradable_and_lock(); - bool timed_unlock_upgradable_and_lock(const boost::posix_time::ptime &); - bool try_unlock_sharable_and_lock(); - bool try_unlock_sharable_and_lock_upgradable(); + // public member functions + void lock(); + bool try_lock(); + bool timed_lock(const boost::posix_time::ptime &); + void unlock(); + void lock_sharable(); + bool try_lock_sharable(); + bool timed_lock_sharable(const boost::posix_time::ptime &); + void unlock_sharable(); + void lock_upgradable(); + bool try_lock_upgradable(); + bool timed_lock_upgradable(const boost::posix_time::ptime &); + void unlock_upgradable(); + void unlock_and_lock_upgradable(); + void unlock_and_lock_sharable(); + void unlock_upgradable_and_lock_sharable(); + void unlock_upgradable_and_lock(); + bool try_unlock_upgradable_and_lock(); + bool timed_unlock_upgradable_and_lock(const boost::posix_time::ptime &); + bool try_unlock_sharable_and_lock(); + bool try_unlock_sharable_and_lock_upgradable(); - // public static functions - static bool remove(const char *); + // public static functions + static bool remove(const char *); };
    -

    Description

    +

    Description

    A upgradable mutex with a global name, so it can be found from different processes. This mutex can't be placed in shared memory, and each process should have it's own named upgradable mutex.

    -

    +

    named_upgradable_mutex public construct/copy/destruct

    1. -
      named_upgradable_mutex(create_only_t create_only, const char * name, 
+
      named_upgradable_mutex(create_only_t create_only, const char * name, 
                        const permissions & perm = permissions());
      
 
      Creates a global upgradable mutex with a name. If the upgradable mutex can't be created throws interprocess_exception
    2. -
      named_upgradable_mutex(open_or_create_t open_or_create, const char * name, 
+
      named_upgradable_mutex(open_or_create_t open_or_create, const char * name, 
                        const permissions & perm = permissions());
      
 
      Opens or creates a global upgradable mutex with a name. If the upgradable mutex is created, this call is equivalent to named_upgradable_mutex(create_only_t, ...) If the upgradable mutex is already created, this call is equivalent to named_upgradable_mutex(open_only_t, ... ).
    3. -
      named_upgradable_mutex(open_only_t open_only, const char * name);
      +
      named_upgradable_mutex(open_only_t open_only, const char * name);

      Opens a global upgradable mutex with a name if that upgradable mutex is previously. created. If it is not previously created this function throws interprocess_exception.

    4. -
      ~named_upgradable_mutex();
      +
      ~named_upgradable_mutex();

      Destroys *this and indicates that the calling process is finished using the resource. The destructor function will deallocate any system resources allocated by the system for use by this process for this resource. The resource can still be opened again calling the open constructor overload. To erase the resource from the system use remove().

    -

    -named_upgradable_mutex public member functions

    +

    +named_upgradable_mutex public member functions

    1. -
      void lock();
      +
      void lock();

      Effects: The calling thread tries to obtain exclusive ownership of the mutex, and if another thread has exclusive, sharable or upgradable ownership of the mutex, it waits until it can obtain the ownership. Throws: interprocess_exception on error.

    2. -
      bool try_lock();
      +
      bool try_lock();

      Effects: The calling thread tries to acquire exclusive ownership of the mutex without waiting. If no other thread has exclusive, sharable or upgradable ownership of the mutex this succeeds. Returns: If it can acquire exclusive ownership immediately returns true. If it has to wait, returns false. Throws: interprocess_exception on error.

    3. -
      bool timed_lock(const boost::posix_time::ptime & abs_time);
      +
      bool timed_lock(const boost::posix_time::ptime & abs_time);

      Effects: The calling thread tries to acquire exclusive ownership of the mutex waiting if necessary until no other thread has exclusive, sharable or upgradable ownership of the mutex or abs_time is reached. Returns: If acquires exclusive ownership, returns true. Otherwise returns false. Throws: interprocess_exception on error.

    4. -
      void unlock();
      +
      void unlock();

      Precondition: The thread must have exclusive ownership of the mutex. Effects: The calling thread releases the exclusive ownership of the mutex. Throws: An exception derived from interprocess_exception on error.

    5. -
      void lock_sharable();
      +
      void lock_sharable();

      Effects: The calling thread tries to obtain sharable ownership of the mutex, and if another thread has exclusive ownership of the mutex, waits until it can obtain the ownership. Throws: interprocess_exception on error.

    6. -
      bool try_lock_sharable();
      +
      bool try_lock_sharable();

      Effects: The calling thread tries to acquire sharable ownership of the mutex without waiting. If no other thread has exclusive ownership of the mutex this succeeds. Returns: If it can acquire sharable ownership immediately returns true. If it has to wait, returns false. Throws: interprocess_exception on error.

    7. -
      bool timed_lock_sharable(const boost::posix_time::ptime & abs_time);
      +
      bool timed_lock_sharable(const boost::posix_time::ptime & abs_time);

      Effects: The calling thread tries to acquire sharable ownership of the mutex waiting if necessary until no other thread has exclusive ownership of the mutex or abs_time is reached. Returns: If acquires sharable ownership, returns true. Otherwise returns false. Throws: interprocess_exception on error.

    8. -
      void unlock_sharable();
      +
      void unlock_sharable();

      Precondition: The thread must have sharable ownership of the mutex. Effects: The calling thread releases the sharable ownership of the mutex. Throws: An exception derived from interprocess_exception on error.

    9. -
      void lock_upgradable();
      +
      void lock_upgradable();

      Effects: The calling thread tries to obtain upgradable ownership of the mutex, and if another thread has exclusive or upgradable ownership of the mutex, waits until it can obtain the ownership. Throws: interprocess_exception on error.

    10. -
      bool try_lock_upgradable();
      +
      bool try_lock_upgradable();

      Effects: The calling thread tries to acquire upgradable ownership of the mutex without waiting. If no other thread has exclusive or upgradable ownership of the mutex this succeeds. Returns: If it can acquire upgradable ownership immediately returns true. If it has to wait, returns false. Throws: interprocess_exception on error.

    11. -
      bool timed_lock_upgradable(const boost::posix_time::ptime & abs_time);
      +
      bool timed_lock_upgradable(const boost::posix_time::ptime & abs_time);

      Effects: The calling thread tries to acquire upgradable ownership of the mutex waiting if necessary until no other thread has exclusive or upgradable ownership of the mutex or abs_time is reached. Returns: If acquires upgradable ownership, returns true. Otherwise returns false. Throws: interprocess_exception on error.

    12. -
      void unlock_upgradable();
      +
      void unlock_upgradable();

      Precondition: The thread must have upgradable ownership of the mutex. Effects: The calling thread releases the upgradable ownership of the mutex. Throws: An exception derived from interprocess_exception on error.

    13. -
      void unlock_and_lock_upgradable();
      +
      void unlock_and_lock_upgradable();

      Precondition: The thread must have exclusive ownership of the mutex. Effects: The thread atomically releases exclusive ownership and acquires upgradable ownership. This operation is non-blocking. Throws: An exception derived from interprocess_exception on error.

    14. -
      void unlock_and_lock_sharable();
      +
      void unlock_and_lock_sharable();

      Precondition: The thread must have exclusive ownership of the mutex. Effects: The thread atomically releases exclusive ownership and acquires sharable ownership. This operation is non-blocking. Throws: An exception derived from interprocess_exception on error.

    15. -
      void unlock_upgradable_and_lock_sharable();
      +
      void unlock_upgradable_and_lock_sharable();

      Precondition: The thread must have upgradable ownership of the mutex. Effects: The thread atomically releases upgradable ownership and acquires sharable ownership. This operation is non-blocking. Throws: An exception derived from interprocess_exception on error.

    16. -
      void unlock_upgradable_and_lock();
      +
      void unlock_upgradable_and_lock();

      Precondition: The thread must have upgradable ownership of the mutex. Effects: The thread atomically releases upgradable ownership and acquires exclusive ownership. This operation will block until all threads with sharable ownership release it. Throws: An exception derived from interprocess_exception on error.

    17. -
      bool try_unlock_upgradable_and_lock();
      +
      bool try_unlock_upgradable_and_lock();

      Precondition: The thread must have upgradable ownership of the mutex. Effects: The thread atomically releases upgradable ownership and tries to acquire exclusive ownership. This operation will fail if there are threads with sharable ownership, but it will maintain upgradable ownership. Returns: If acquires exclusive ownership, returns true. Otherwise returns false. Throws: An exception derived from interprocess_exception on error.

    18. -
      bool timed_unlock_upgradable_and_lock(const boost::posix_time::ptime & abs_time);
      +
      bool timed_unlock_upgradable_and_lock(const boost::posix_time::ptime & abs_time);

      Precondition: The thread must have upgradable ownership of the mutex. Effects: The thread atomically releases upgradable ownership and tries to acquire exclusive ownership, waiting if necessary until abs_time. This operation will fail if there are threads with sharable ownership or timeout reaches, but it will maintain upgradable ownership. Returns: If acquires exclusive ownership, returns true. Otherwise returns false. Throws: An exception derived from interprocess_exception on error.

    19. -
      bool try_unlock_sharable_and_lock();
      +
      bool try_unlock_sharable_and_lock();

      Precondition: The thread must have sharable ownership of the mutex. Effects: The thread atomically releases sharable ownership and tries to acquire exclusive ownership. This operation will fail if there are threads with sharable or upgradable ownership, but it will maintain sharable ownership. Returns: If acquires exclusive ownership, returns true. Otherwise returns false. Throws: An exception derived from interprocess_exception on error.

    20. -
      bool try_unlock_sharable_and_lock_upgradable();
      +
      bool try_unlock_sharable_and_lock_upgradable();

      Precondition: The thread must have sharable ownership of the mutex. Effects: The thread atomically releases sharable ownership and tries to acquire upgradable ownership. This operation will fail if there are threads with sharable or upgradable ownership, but it will maintain sharable ownership. Returns: If acquires upgradable ownership, returns true. Otherwise returns false. Throws: An exception derived from interprocess_exception on error.

    -

    -named_upgradable_mutex public static functions

    +

    +named_upgradable_mutex public static functions

    1. -
      static bool remove(const char * name);
      +
      static bool remove(const char * name);

      Erases a named upgradable mutex from the system. Returns false on error. Never throws.

    diff --git a/doc/html/boost/interprocess/node_allocator.html b/doc/html/boost/interprocess/node_allocator.html index 9b1f091db9..3f13af266f 100644 --- a/doc/html/boost/interprocess/node_allocator.html +++ b/doc/html/boost/interprocess/node_allocator.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -54,164 +54,164 @@ }; // construct/copy/destruct - node_allocator(segment_manager *); - node_allocator(const node_allocator &); + node_allocator(segment_manager *); + node_allocator(const node_allocator &); template<typename T2> - node_allocator(const node_allocator< T2, SegmentManager, NodesPerBlock > &); + node_allocator(const node_allocator< T2, SegmentManager, NodesPerBlock > &); template<typename T2, typename SegmentManager2, std::size_t N2> node_allocator & - operator=(const node_allocator< T2, SegmentManager2, N2 > &); - ~node_allocator(); + operator=(const node_allocator< T2, SegmentManager2, N2 > &); + ~node_allocator(); - // public member functions - void * get_node_pool() const; - segment_manager * get_segment_manager() const; - size_type max_size() const; - pointer allocate(size_type, cvoid_pointer = 0); - void deallocate(const pointer &, size_type); - void deallocate_free_blocks(); - pointer address(reference) const; - const_pointer address(const_reference) const; - void construct(const pointer &, const_reference); - void destroy(const pointer &); - size_type size(const pointer &) const; - pointer allocation_command(boost::interprocess::allocation_type, size_type, + // public member functions + void * get_node_pool() const; + segment_manager * get_segment_manager() const; + size_type max_size() const; + pointer allocate(size_type, cvoid_pointer = 0); + void deallocate(const pointer &, size_type); + void deallocate_free_blocks(); + pointer address(reference) const; + const_pointer address(const_reference) const; + void construct(const pointer &, const_reference); + void destroy(const pointer &); + size_type size(const pointer &) const; + pointer allocation_command(boost::interprocess::allocation_type, size_type, size_type &, pointer &); - void allocate_many(size_type, size_type, multiallocation_chain &); - void allocate_many(const size_type *, size_type, multiallocation_chain &); - void deallocate_many(multiallocation_chain &); - pointer allocate_one(); - void allocate_individual(size_type, multiallocation_chain &); - void deallocate_one(const pointer &); - void deallocate_individual(multiallocation_chain &); + void allocate_many(size_type, size_type, multiallocation_chain &); + void allocate_many(const size_type *, size_type, multiallocation_chain &); + void deallocate_many(multiallocation_chain &); + pointer allocate_one(); + void allocate_individual(size_type, multiallocation_chain &); + void deallocate_one(const pointer &); + void deallocate_individual(multiallocation_chain &); - // friend functions - friend void swap(self_t &, self_t &); + // friend functions + friend void swap(self_t &, self_t &); };
    -

    Description

    +

    Description

    An STL node allocator that uses a segment manager as memory source. The internal pointer type will of the same type (raw, smart) as "typename SegmentManager::void_pointer" type. This allows placing the allocator in shared memory, memory mapped-files, etc... This node allocator shares a segregated storage between all instances of node_allocator with equal sizeof(T) placed in the same segment group. NodesPerBlock is the number of nodes allocated at once when the allocator runs out of nodes

    -

    +

    node_allocator public construct/copy/destruct

    1. -
      node_allocator(segment_manager * segment_mngr);
      +
      node_allocator(segment_manager * segment_mngr);

      Not assignable from other node_allocator Constructor from a segment manager. If not present, constructs a node pool. Increments the reference count of the associated node pool. Can throw boost::interprocess::bad_alloc

    2. -
      node_allocator(const node_allocator & other);
      +
      node_allocator(const node_allocator & other);

      Copy constructor from other node_allocator. Increments the reference count of the associated node pool. Never throws 

    3. template<typename T2> 
-  node_allocator(const node_allocator< T2, SegmentManager, NodesPerBlock > & other);
      + node_allocator(const node_allocator< T2, SegmentManager, NodesPerBlock > & other);

      Copy constructor from related node_allocator. If not present, constructs a node pool. Increments the reference count of the associated node pool. Can throw boost::interprocess::bad_alloc 

    4. template<typename T2, typename SegmentManager2, std::size_t N2> 
   node_allocator & 
-  operator=(const node_allocator< T2, SegmentManager2, N2 > &);
      + operator=(const node_allocator< T2, SegmentManager2, N2 > &);

      Not assignable from related node_allocator

    5. -
      ~node_allocator();
      +
      ~node_allocator();

      Destructor, removes node_pool_t from memory if its reference count reaches to zero. Never throws

    -

    -node_allocator public member functions

    +

    +node_allocator public member functions

    1. -
      void * get_node_pool() const;
      +
      void * get_node_pool() const;

      Returns a pointer to the node pool. Never throws

    2. -
      segment_manager * get_segment_manager() const;
      +
      segment_manager * get_segment_manager() const;

      Returns the segment manager. Never throws

    3. -
      size_type max_size() const;
      +
      size_type max_size() const;

      Returns the number of elements that could be allocated. Never throws

    4. -
      pointer allocate(size_type count, cvoid_pointer hint = 0);
      +
      pointer allocate(size_type count, cvoid_pointer hint = 0);

      Allocate memory for an array of count elements. Throws boost::interprocess::bad_alloc if there is no enough memory

    5. -
      void deallocate(const pointer & ptr, size_type count);
      +
      void deallocate(const pointer & ptr, size_type count);

      Deallocate allocated memory. Never throws

    6. -
      void deallocate_free_blocks();
      +
      void deallocate_free_blocks();

      Deallocates all free blocks of the pool

    7. -
      pointer address(reference value) const;
      +
      pointer address(reference value) const;

      Returns address of mutable object. Never throws

    8. -
      const_pointer address(const_reference value) const;
      +
      const_pointer address(const_reference value) const;

      Returns address of non mutable object. Never throws

    9. -
      void construct(const pointer & ptr, const_reference v);
      +
      void construct(const pointer & ptr, const_reference v);

      Copy construct an object. Throws if T's copy constructor throws

    10. -
      void destroy(const pointer & ptr);
      +
      void destroy(const pointer & ptr);

      Destroys object. Throws if object's destructor throws

    11. -
      size_type size(const pointer & p) const;
      +
      size_type size(const pointer & p) const;

      Returns maximum the number of objects the previously allocated memory pointed by p can hold. This size only works for memory allocated with allocate, allocation_command and allocate_many.

      12. -
    12. pointer allocation_command(boost::interprocess::allocation_type command, 
+
    13. pointer allocation_command(boost::interprocess::allocation_type command, 
                            size_type limit_size, 
                            size_type & prefer_in_recvd_out_size, 
                            pointer & reuse);
      14. 
 
    14. 
-
      void allocate_many(size_type elem_size, size_type num_elements, 
+
      void allocate_many(size_type elem_size, size_type num_elements, 
                    multiallocation_chain & chain);
      
 
      Allocates many elements of size elem_size in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. The elements must be deallocated with deallocate(...) 
      
 
      15. 
 
    15. 
-
      void allocate_many(const size_type * elem_sizes, size_type n_elements, 
+
      void allocate_many(const size_type * elem_sizes, size_type n_elements, 
                    multiallocation_chain & chain);
      
 
      Allocates n_elements elements, each one of size elem_sizes[i]in a contiguous block of memory. The elements must be deallocated 
      
 
      16. 
 
    16. 
-
      void deallocate_many(multiallocation_chain & chain);
      
+
      void deallocate_many(multiallocation_chain & chain);
      
 
      Allocates many elements of size elem_size in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. The elements must be deallocated with deallocate(...) 
      
 
      17. 
 
    17. 
-
      pointer allocate_one();
      
+
      pointer allocate_one();
      
 
      Allocates just one object. Memory allocated with this function must be deallocated only with deallocate_one(). Throws boost::interprocess::bad_alloc if there is no enough memory 
      
 
      18. 
 
    18. 
-
      void allocate_individual(size_type num_elements, 
+
      void allocate_individual(size_type num_elements, 
                          multiallocation_chain & chain);
      
 
      Allocates many elements of size == 1 in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. Memory allocated with this function must be deallocated only with deallocate_one(). 
      
 
      19. 
 
    19. 
-
      void deallocate_one(const pointer & p);
      
+
      void deallocate_one(const pointer & p);
      
 
      Deallocates memory previously allocated with allocate_one(). You should never use deallocate_one to deallocate memory allocated with other functions different from allocate_one(). Never throws 
      
 
      20. 
 
    20. 
-
      void deallocate_individual(multiallocation_chain & chain);
      
+
      void deallocate_individual(multiallocation_chain & chain);
      
 
      Allocates many elements of size == 1 in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. Memory allocated with this function must be deallocated only with deallocate_one(). 
      
 
      21.
    -

    -node_allocator friend functions

    +

    +node_allocator friend functions

    1. -
      friend void swap(self_t & alloc1, self_t & alloc2);
      +
      friend void swap(self_t & alloc1, self_t & alloc2);

      Swaps allocators. Does not throw. If each allocator is placed in a different memory segment, the result is undefined.

    @@ -227,7 +227,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/node_allocator/rebind.html b/doc/html/boost/interprocess/node_allocator/rebind.html index d64034af9f..1dc1327f86 100644 --- a/doc/html/boost/interprocess/node_allocator/rebind.html +++ b/doc/html/boost/interprocess/node_allocator/rebind.html @@ -6,9 +6,9 @@ - + - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -39,7 +39,7 @@ typedef node_allocator< T2, SegmentManager, NodesPerBlock > other; };
    -

    Description

    +

    Description

    Obtains node_allocator from node_allocator

    @@ -53,7 +53,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/null_index.html b/doc/html/boost/interprocess/null_index.html index dccff1f588..c509acf5e4 100644 --- a/doc/html/boost/interprocess/null_index.html +++ b/doc/html/boost/interprocess/null_index.html @@ -40,43 +40,43 @@ typedef const int * const_iterator; // construct/copy/destruct - null_index(segment_manager_base *); + null_index(segment_manager_base *); - // public member functions - const_iterator begin() const; - iterator begin(); - const_iterator end() const; - iterator end(); + // public member functions + const_iterator begin() const; + iterator begin(); + const_iterator end() const; + iterator end(); };
    -

    Description

    +

    Description

    Null index type used to save compilation time when named indexes are not needed.

    -

    +

    null_index public construct/copy/destruct

    1. -
      null_index(segment_manager_base *);
      Empty constructor.
    +
    null_index(segment_manager_base *);
    Empty constructor.
    -

    -null_index public member functions

    +

    +null_index public member functions

    1. -
      const_iterator begin() const;
      +
      const_iterator begin() const;

      begin() is equal to end()

    2. -
      iterator begin();
      +
      iterator begin();

      begin() is equal to end()

    3. -
      const_iterator end() const;
      +
      const_iterator end() const;

      begin() is equal to end()

    4. -
      iterator end();
      +
      iterator end();

      begin() is equal to end()

    diff --git a/doc/html/boost/interprocess/null_mutex.html b/doc/html/boost/interprocess/null_mutex.html index c0b4b0d5b7..b217c469eb 100644 --- a/doc/html/boost/interprocess/null_mutex.html +++ b/doc/html/boost/interprocess/null_mutex.html @@ -36,130 +36,130 @@ class null_mutex { public: // construct/copy/destruct - null_mutex(); - ~null_mutex(); + null_mutex(); + ~null_mutex(); - // public member functions - void lock(); - bool try_lock(); - bool timed_lock(const boost::posix_time::ptime &); - void unlock(); - void lock_sharable(); - bool try_lock_sharable(); - bool timed_lock_sharable(const boost::posix_time::ptime &); - void unlock_sharable(); - void lock_upgradable(); - bool try_lock_upgradable(); - bool timed_lock_upgradable(const boost::posix_time::ptime &); - void unlock_upgradable(); - void unlock_and_lock_upgradable(); - void unlock_and_lock_sharable(); - void unlock_upgradable_and_lock_sharable(); - void unlock_upgradable_and_lock(); - bool try_unlock_upgradable_and_lock(); - bool timed_unlock_upgradable_and_lock(const boost::posix_time::ptime &); - bool try_unlock_sharable_and_lock(); - bool try_unlock_sharable_and_lock_upgradable(); + // public member functions + void lock(); + bool try_lock(); + bool timed_lock(const boost::posix_time::ptime &); + void unlock(); + void lock_sharable(); + bool try_lock_sharable(); + bool timed_lock_sharable(const boost::posix_time::ptime &); + void unlock_sharable(); + void lock_upgradable(); + bool try_lock_upgradable(); + bool timed_lock_upgradable(const boost::posix_time::ptime &); + void unlock_upgradable(); + void unlock_and_lock_upgradable(); + void unlock_and_lock_sharable(); + void unlock_upgradable_and_lock_sharable(); + void unlock_upgradable_and_lock(); + bool try_unlock_upgradable_and_lock(); + bool timed_unlock_upgradable_and_lock(const boost::posix_time::ptime &); + bool try_unlock_sharable_and_lock(); + bool try_unlock_sharable_and_lock_upgradable(); };
    -

    Description

    +

    Description

    Implements a mutex that simulates a mutex without doing any operation and simulates a successful operation.

    -

    +

    null_mutex public construct/copy/destruct

    1. -
      null_mutex();
      +
      null_mutex();

      Constructor. Empty.

    2. -
      ~null_mutex();
      +
      ~null_mutex();

      Destructor. Empty.

    -

    -null_mutex public member functions

    +

    +null_mutex public member functions

    1. -
      void lock();
      Simulates a mutex lock() operation. Empty function.
      2. +
      void lock();
      Simulates a mutex lock() operation. Empty function.
    2. -
      bool try_lock();
      +
      bool try_lock();

      Simulates a mutex try_lock() operation. Equivalent to "return true;"

    3. -
      bool timed_lock(const boost::posix_time::ptime &);
      +
      bool timed_lock(const boost::posix_time::ptime &);

      Simulates a mutex timed_lock() operation. Equivalent to "return true;"

    4. -
      void unlock();
      +
      void unlock();

      Simulates a mutex unlock() operation. Empty function.

    5. -
      void lock_sharable();
      +
      void lock_sharable();

      Simulates a mutex lock_sharable() operation. Empty function.

    6. -
      bool try_lock_sharable();
      +
      bool try_lock_sharable();

      Simulates a mutex try_lock_sharable() operation. Equivalent to "return true;"

    7. -
      bool timed_lock_sharable(const boost::posix_time::ptime &);
      +
      bool timed_lock_sharable(const boost::posix_time::ptime &);

      Simulates a mutex timed_lock_sharable() operation. Equivalent to "return true;"

    8. -
      void unlock_sharable();
      +
      void unlock_sharable();

      Simulates a mutex unlock_sharable() operation. Empty function.

    9. -
      void lock_upgradable();
      +
      void lock_upgradable();

      Simulates a mutex lock_upgradable() operation. Empty function.

    10. -
      bool try_lock_upgradable();
      +
      bool try_lock_upgradable();

      Simulates a mutex try_lock_upgradable() operation. Equivalent to "return true;"

    11. -
      bool timed_lock_upgradable(const boost::posix_time::ptime &);
      +
      bool timed_lock_upgradable(const boost::posix_time::ptime &);

      Simulates a mutex timed_lock_upgradable() operation. Equivalent to "return true;"

    12. -
      void unlock_upgradable();
      +
      void unlock_upgradable();

      Simulates a mutex unlock_upgradable() operation. Empty function.

    13. -
      void unlock_and_lock_upgradable();
      +
      void unlock_and_lock_upgradable();

      Simulates unlock_and_lock_upgradable(). Empty function.

    14. -
      void unlock_and_lock_sharable();
      +
      void unlock_and_lock_sharable();

      Simulates unlock_and_lock_sharable(). Empty function.

    15. -
      void unlock_upgradable_and_lock_sharable();
      +
      void unlock_upgradable_and_lock_sharable();

      Simulates unlock_upgradable_and_lock_sharable(). Empty function.

    16. -
      void unlock_upgradable_and_lock();
      +
      void unlock_upgradable_and_lock();

      Simulates unlock_upgradable_and_lock(). Empty function.

    17. -
      bool try_unlock_upgradable_and_lock();
      +
      bool try_unlock_upgradable_and_lock();

      Simulates try_unlock_upgradable_and_lock(). Equivalent to "return true;"

    18. -
      bool timed_unlock_upgradable_and_lock(const boost::posix_time::ptime &);
      +
      bool timed_unlock_upgradable_and_lock(const boost::posix_time::ptime &);

      Simulates timed_unlock_upgradable_and_lock(). Equivalent to "return true;"

    19. -
      bool try_unlock_sharable_and_lock();
      +
      bool try_unlock_sharable_and_lock();

      Simulates try_unlock_sharable_and_lock(). Equivalent to "return true;"

    20. -
      bool try_unlock_sharable_and_lock_upgradable();
      +
      bool try_unlock_sharable_and_lock_upgradable();

      Simulates try_unlock_sharable_and_lock_upgradable(). Equivalent to "return true;"

    diff --git a/doc/html/boost/interprocess/null_mutex_family.html b/doc/html/boost/interprocess/null_mutex_family.html index 53267fdda0..81ef6e379b 100644 --- a/doc/html/boost/interprocess/null_mutex_family.html +++ b/doc/html/boost/interprocess/null_mutex_family.html @@ -39,7 +39,7 @@ typedef boost::interprocess::null_mutex recursive_mutex_type; };
    -

    Description

    +

    Description

    Describes interprocess_mutex family to use with Interprocess frameworks based on null operation synchronization objects.

    diff --git a/doc/html/boost/interprocess/offset_ptr.html b/doc/html/boost/interprocess/offset_ptr.html index c47037370d..86ad9ab75a 100644 --- a/doc/html/boost/interprocess/offset_ptr.html +++ b/doc/html/boost/interprocess/offset_ptr.html @@ -53,58 +53,79 @@ }; // construct/copy/destruct - offset_ptr(); - offset_ptr(pointer); - template<typename T> offset_ptr(T *, unspecified = 0); - offset_ptr(const offset_ptr &); + offset_ptr() noexcept; + offset_ptr(pointer) noexcept; + template<typename T> offset_ptr(T *, unspecified = 0) noexcept; + offset_ptr(const offset_ptr &) noexcept; template<typename T2> - offset_ptr(const offset_ptr< T2, DifferenceType, OffsetType, OffsetAlignment > &); + offset_ptr(const offset_ptr< T2, DifferenceType, OffsetType, OffsetAlignment > &) noexcept; template<typename T2, typename P2, typename O2, std::size_t A2> - offset_ptr(const offset_ptr< T2, P2, O2, A2 > &, unspecified); + offset_ptr(const offset_ptr< T2, P2, O2, A2 > &, unspecified) noexcept; template<typename T2, typename P2, typename O2, std::size_t A2> - offset_ptr(const offset_ptr< T2, P2, O2, A2 > &, unspecified); + offset_ptr(const offset_ptr< T2, P2, O2, A2 > &, unspecified) noexcept; template<typename T2, typename P2, typename O2, std::size_t A2> - offset_ptr(const offset_ptr< T2, P2, O2, A2 > &, unspecified); + offset_ptr(const offset_ptr< T2, P2, O2, A2 > &, unspecified) noexcept; template<typename T2, typename P2, typename O2, std::size_t A2> - offset_ptr(const offset_ptr< T2, P2, O2, A2 > &, unspecified); - offset_ptr & operator=(pointer); - offset_ptr & operator=(const offset_ptr &); + offset_ptr(const offset_ptr< T2, P2, O2, A2 > &, unspecified) noexcept; + BOOST_FORCEINLINE offset_ptr & operator=(pointer) noexcept; + BOOST_FORCEINLINE offset_ptr & operator=(const offset_ptr &) noexcept; template<typename T2> - offset_ptr & - operator=(const offset_ptr< T2, DifferenceType, OffsetType, OffsetAlignment > &); + BOOST_FORCEINLINE offset_ptr & + operator=(const offset_ptr< T2, DifferenceType, OffsetType, OffsetAlignment > &) noexcept; - // public member functions - pointer get() const; - offset_type get_offset() const; - pointer operator->() const; - reference operator*() const; - reference operator[](difference_type) const; - offset_ptr & operator+=(difference_type); - offset_ptr & operator-=(difference_type); - offset_ptr & operator++(void); - offset_ptr operator++(int); - offset_ptr & operator--(void); - offset_ptr operator--(int); - operator unspecified_bool_type() const; - bool operator!() const; + // public member functions + BOOST_FORCEINLINE pointer get() const noexcept; + BOOST_FORCEINLINE offset_type get_offset() const noexcept; + BOOST_FORCEINLINE pointer operator->() const noexcept; + BOOST_FORCEINLINE reference operator*() const noexcept; + BOOST_FORCEINLINE reference operator[](difference_type) const noexcept; + BOOST_FORCEINLINE offset_ptr & operator+=(difference_type) noexcept; + BOOST_FORCEINLINE offset_ptr & operator-=(difference_type) noexcept; + BOOST_FORCEINLINE offset_ptr & operator++(void) noexcept; + BOOST_FORCEINLINE offset_ptr operator++(int) noexcept; + BOOST_FORCEINLINE offset_ptr & operator--(void) noexcept; + BOOST_FORCEINLINE offset_ptr operator--(int) noexcept; + explicit operator bool() const noexcept; + BOOST_FORCEINLINE bool operator!() const noexcept; - // public static functions - static offset_ptr pointer_to(reference); + // public static functions + static BOOST_FORCEINLINE offset_ptr pointer_to(reference) noexcept; - // friend functions - friend offset_ptr operator+(difference_type, offset_ptr); - friend offset_ptr operator+(offset_ptr, difference_type); - friend offset_ptr operator-(offset_ptr, difference_type); - friend offset_ptr operator-(difference_type, offset_ptr); - friend difference_type operator-(const offset_ptr &, const offset_ptr &); + // friend functions + BOOST_FORCEINLINE friend offset_ptr + operator+(difference_type, offset_ptr) noexcept; + BOOST_FORCEINLINE friend offset_ptr + operator+(offset_ptr, difference_type) noexcept; + BOOST_FORCEINLINE friend offset_ptr + operator-(offset_ptr, difference_type) noexcept; + BOOST_FORCEINLINE friend offset_ptr + operator-(difference_type, offset_ptr) noexcept; + BOOST_FORCEINLINE friend difference_type + operator-(const offset_ptr &, const offset_ptr &) noexcept; + + // private member functions + template<typename T2> + BOOST_FORCEINLINE void + assign(const offset_ptr< T2, DifferenceType, OffsetType, OffsetAlignment > &, + unspecified) noexcept; + template<typename T2> + BOOST_FORCEINLINE void + assign(const offset_ptr< T2, DifferenceType, OffsetType, OffsetAlignment > &, + unspecified) noexcept; };
    -

    Description

    -

    A smart pointer that stores the offset between between the pointer and the the object it points. This allows offset allows special properties, since the pointer is independent from the address address of the pointee, if the pointer and the pointee are still separated by the same offset. This feature converts offset_ptr in a smart pointer that can be placed in shared memory and memory mapped files mapped in different addresses in every process.

    +

    Description

    +

    A smart pointer that stores the offset between between the pointer and the the object it points. This allows offset allows special properties, since the pointer is independent from the address of the pointee, if the pointer and the pointee are still separated by the same offset. This feature converts offset_ptr in a smart pointer that can be placed in shared memory and memory mapped files mapped in different addresses in every process.

    +

    +b>Note: offset_ptr uses implementation defined properties, present in most platforms, for performance reasons:

    +
      +

    • Assumes that uintptr_t representation of nullptr is (uintptr_t)zero.

      • +

    • Assumes that incrementing a uintptr_t obtained from a pointer is equivalent to incrementing the pointer and then converting it back to uintptr_t.

      • +

    -

    Template Parameters

    +

    Template Parameters

    1. typename PointedType
      @@ -116,167 +137,185 @@ 
    2. typename OffsetType
      -

      An unsigned integer type that can represent the distance between two pointers reinterpret_cast-ed as unsigned integers. In general this type should be at least of the same size of std::uintptr_t. In some systems it's possible to communicate between 32 and 64 bit processes using 64 bit offsets.

      +

      An unsigned integer type that can represent the distance between two pointers reinterpret_cast-ed as unsigned integers. This type should be at least of the same size of std::uintptr_t. In some systems it's possible to communicate between 32 and 64 bit processes using 64 bit offsets. 

    3. std::size_t OffsetAlignment
      -

      Alignment of the OffsetType stored inside. In some systems might be necessary to align it to 64 bits in order to communicate 32 and 64 bit processes using 64 bit offsets.

      +

      Alignment of the OffsetType stored inside. In some systems might be necessary to align it to 64 bits in order to communicate 32 and 64 bit processes using 64 bit offsets.

    -

    +

    offset_ptr public construct/copy/destruct

    1. -
      offset_ptr();
      +
      offset_ptr() noexcept;

      Default constructor (null pointer). Never throws.

    2. -
      offset_ptr(pointer ptr);
      +
      offset_ptr(pointer ptr) noexcept;

      Constructor from raw pointer (allows "0" pointer conversion). Never throws.

    3. -
      template<typename T> offset_ptr(T * ptr, unspecified = 0);
      +
      template<typename T> offset_ptr(T * ptr, unspecified = 0) noexcept;

      Constructor from other pointer. Never throws.

    4. -
      offset_ptr(const offset_ptr & ptr);
      +
      offset_ptr(const offset_ptr & ptr) noexcept;

      Constructor from other offset_ptr Never throws. 

    5. template<typename T2> 
-  offset_ptr(const offset_ptr< T2, DifferenceType, OffsetType, OffsetAlignment > & ptr);
      + offset_ptr(const offset_ptr< T2, DifferenceType, OffsetType, OffsetAlignment > & ptr) noexcept;

      Constructor from other offset_ptr. If pointers of pointee types are convertible, offset_ptrs will be convertibles. Never throws. 

    6. template<typename T2, typename P2, typename O2, std::size_t A2> 
-  offset_ptr(const offset_ptr< T2, P2, O2, A2 > & r, unspecified);
      + offset_ptr(const offset_ptr< T2, P2, O2, A2 > & r, unspecified) noexcept;

      Emulates static_cast operator. Never throws. 

    7. template<typename T2, typename P2, typename O2, std::size_t A2> 
-  offset_ptr(const offset_ptr< T2, P2, O2, A2 > & r, unspecified);
      + offset_ptr(const offset_ptr< T2, P2, O2, A2 > & r, unspecified) noexcept;

      Emulates const_cast operator. Never throws. 

    8. template<typename T2, typename P2, typename O2, std::size_t A2> 
-  offset_ptr(const offset_ptr< T2, P2, O2, A2 > & r, unspecified);
      + offset_ptr(const offset_ptr< T2, P2, O2, A2 > & r, unspecified) noexcept;

      Emulates dynamic_cast operator. Never throws. 

    9. template<typename T2, typename P2, typename O2, std::size_t A2> 
-  offset_ptr(const offset_ptr< T2, P2, O2, A2 > & r, unspecified);
      + offset_ptr(const offset_ptr< T2, P2, O2, A2 > & r, unspecified) noexcept;

      Emulates reinterpret_cast operator. Never throws.

    10. -
      offset_ptr & operator=(pointer from);
      +
      BOOST_FORCEINLINE offset_ptr & operator=(pointer from) noexcept;

      Assignment from pointer (saves extra conversion). Never throws.

    11. -
      offset_ptr & operator=(const offset_ptr & ptr);
      +
      BOOST_FORCEINLINE offset_ptr & operator=(const offset_ptr & ptr) noexcept;

      Assignment from other offset_ptr. Never throws. 

    12. template<typename T2> 
-  offset_ptr & 
-  operator=(const offset_ptr< T2, DifferenceType, OffsetType, OffsetAlignment > & ptr);
      + BOOST_FORCEINLINE offset_ptr & + operator=(const offset_ptr< T2, DifferenceType, OffsetType, OffsetAlignment > & ptr) noexcept;

      Assignment from related offset_ptr. If pointers of pointee types are assignable, offset_ptrs will be assignable. Never throws.

    -

    -offset_ptr public member functions

    +

    +offset_ptr public member functions

    1. -
      pointer get() const;
      +
      BOOST_FORCEINLINE pointer get() const noexcept;

      Obtains raw pointer from offset. Never throws.

      2. -
    2. offset_type get_offset() const;
      3. +
    3. BOOST_FORCEINLINE offset_type get_offset() const noexcept;
    4. -
      pointer operator->() const;
      +
      BOOST_FORCEINLINE pointer operator->() const noexcept;

      Pointer-like -> operator. It can return 0 pointer. Never throws.

    5. -
      reference operator*() const;
      +
      BOOST_FORCEINLINE reference operator*() const noexcept;

      Dereferencing operator, if it is a null offset_ptr behavior is undefined. Never throws.

    6. -
      reference operator[](difference_type idx) const;
      +
      BOOST_FORCEINLINE reference operator[](difference_type idx) const noexcept;

      Indexing operator. Never throws.

    7. -
      offset_ptr & operator+=(difference_type offset);
      +
      BOOST_FORCEINLINE offset_ptr & operator+=(difference_type offset) noexcept;

      offset_ptr += difference_type. Never throws.

    8. -
      offset_ptr & operator-=(difference_type offset);
      +
      BOOST_FORCEINLINE offset_ptr & operator-=(difference_type offset) noexcept;

      offset_ptr -= difference_type. Never throws.

    9. -
      offset_ptr & operator++(void);
      +
      BOOST_FORCEINLINE offset_ptr & operator++(void) noexcept;

      ++offset_ptr. Never throws.

    10. -
      offset_ptr operator++(int);
      +
      BOOST_FORCEINLINE offset_ptr operator++(int) noexcept;

      offset_ptr++. Never throws.

    11. -
      offset_ptr & operator--(void);
      +
      BOOST_FORCEINLINE offset_ptr & operator--(void) noexcept;

      <ndash></ndash>offset_ptr. Never throws.

    12. -
      offset_ptr operator--(int);
      +
      BOOST_FORCEINLINE offset_ptr operator--(int) noexcept;

      offset_ptr<ndash></ndash>. Never throws.

    13. -
      operator unspecified_bool_type() const;
      +
      explicit operator bool() const noexcept;

      safe bool conversion operator. Never throws.

    14. -
      bool operator!() const;
      +
      BOOST_FORCEINLINE bool operator!() const noexcept;

      Not operator. Not needed in theory, but improves portability. Never throws

    -

    -offset_ptr public static functions

    +

    +offset_ptr public static functions

    1. -
      static offset_ptr pointer_to(reference r);
      +
      static BOOST_FORCEINLINE offset_ptr pointer_to(reference r) noexcept;

      Compatibility with pointer_traits

    -

    -offset_ptr friend functions

    +

    +offset_ptr friend functions

    1. -
      friend offset_ptr operator+(difference_type diff, offset_ptr right);
      +
      BOOST_FORCEINLINE friend offset_ptr 
+operator+(difference_type diff, offset_ptr right) noexcept;

      difference_type + offset_ptr operation

    2. -
      friend offset_ptr operator+(offset_ptr left, difference_type diff);
      +
      BOOST_FORCEINLINE friend offset_ptr 
+operator+(offset_ptr left, difference_type diff) noexcept;

      offset_ptr + difference_type operation

    3. -
      friend offset_ptr operator-(offset_ptr left, difference_type diff);
      +
      BOOST_FORCEINLINE friend offset_ptr 
+operator-(offset_ptr left, difference_type diff) noexcept;

      offset_ptr - diff operation

    4. -
      friend offset_ptr operator-(difference_type diff, offset_ptr right);
      +
      BOOST_FORCEINLINE friend offset_ptr 
+operator-(difference_type diff, offset_ptr right) noexcept;

      offset_ptr - diff operation

    5. -
      friend difference_type 
-operator-(const offset_ptr & pt, const offset_ptr & pt2);
      +
      BOOST_FORCEINLINE friend difference_type 
+operator-(const offset_ptr & pt, const offset_ptr & pt2) noexcept;

      offset_ptr - offset_ptr operation

    +
    +

    +offset_ptr private member functions

    +
      +
    1. template<typename T2> 
+  BOOST_FORCEINLINE void 
+  assign(const offset_ptr< T2, DifferenceType, OffsetType, OffsetAlignment > & ptr, 
+         unspecified) noexcept;
      2. +
    2. template<typename T2> 
+  BOOST_FORCEINLINE void 
+  assign(const offset_ptr< T2, DifferenceType, OffsetType, OffsetAlignment > & ptr, 
+         unspecified) noexcept;
      3. +
    +
    diff --git a/doc/html/boost/interprocess/offset_ptr/rebind.html b/doc/html/boost/interprocess/offset_ptr/rebind.html index bc3855a483..568a5fa8d0 100644 --- a/doc/html/boost/interprocess/offset_ptr/rebind.html +++ b/doc/html/boost/interprocess/offset_ptr/rebind.html @@ -6,9 +6,9 @@ - + - +
    @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -39,7 +39,7 @@ typedef offset_ptr< U, DifferenceType, OffsetType, OffsetAlignment > other; };
    -

    Description

    +

    Description

    Compatibility with pointer_traits

    @@ -53,7 +53,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/open_copy_on_write.html b/doc/html/boost/interprocess/open_copy_on_write.html index 412298178d..8c59163f14 100644 --- a/doc/html/boost/interprocess/open_copy_on_write.html +++ b/doc/html/boost/interprocess/open_copy_on_write.html @@ -34,7 +34,7 @@ static const open_copy_on_write_t open_copy_on_write;
    -

    Description

    +

    Description

    Value to indicate that the resource must be only opened for reading

    diff --git a/doc/html/boost/interprocess/open_copy_on_write_t.html b/doc/html/boost/interprocess/open_copy_on_write_t.html index dbc5bc9f98..b67f72646c 100644 --- a/doc/html/boost/interprocess/open_copy_on_write_t.html +++ b/doc/html/boost/interprocess/open_copy_on_write_t.html @@ -36,7 +36,7 @@ struct open_copy_on_write_t { };
    -

    Description

    +

    Description

    Tag to indicate that the resource must be only opened for reading

    diff --git a/doc/html/boost/interprocess/open_only.html b/doc/html/boost/interprocess/open_only.html index af4e29b49a..3dd4a3e7ed 100644 --- a/doc/html/boost/interprocess/open_only.html +++ b/doc/html/boost/interprocess/open_only.html @@ -34,7 +34,7 @@ static const open_only_t open_only;
    -

    Description

    +

    Description

    Value to indicate that the resource must be only opened

    diff --git a/doc/html/boost/interprocess/open_only_t.html b/doc/html/boost/interprocess/open_only_t.html index 1c518398bb..203f17b653 100644 --- a/doc/html/boost/interprocess/open_only_t.html +++ b/doc/html/boost/interprocess/open_only_t.html @@ -36,7 +36,7 @@ struct open_only_t { };
    -

    Description

    +

    Description

    Tag to indicate that the resource must be only opened

    diff --git a/doc/html/boost/interprocess/open_or_create.html b/doc/html/boost/interprocess/open_or_create.html index 3171f5bf44..2b167c4c67 100644 --- a/doc/html/boost/interprocess/open_or_create.html +++ b/doc/html/boost/interprocess/open_or_create.html @@ -34,7 +34,7 @@ static const open_or_create_t open_or_create;
    -

    Description

    +

    Description

    Value to indicate that the resource must be created. If already created, it must be opened.

    diff --git a/doc/html/boost/interprocess/open_or_create_t.html b/doc/html/boost/interprocess/open_or_create_t.html index bd0d8ad0c0..82cf1d54a3 100644 --- a/doc/html/boost/interprocess/open_or_create_t.html +++ b/doc/html/boost/interprocess/open_or_create_t.html @@ -36,7 +36,7 @@ struct open_or_create_t { };
    -

    Description

    +

    Description

    Tag to indicate that the resource must be created. If already created, it must be opened.

    diff --git a/doc/html/boost/interprocess/open_read_only.html b/doc/html/boost/interprocess/open_read_only.html index 084b72dbe6..bc8996670a 100644 --- a/doc/html/boost/interprocess/open_read_only.html +++ b/doc/html/boost/interprocess/open_read_only.html @@ -34,7 +34,7 @@ static const open_read_only_t open_read_only;
    -

    Description

    +

    Description

    Value to indicate that the resource must be only opened for reading

    diff --git a/doc/html/boost/interprocess/open_read_only_t.html b/doc/html/boost/interprocess/open_read_only_t.html index bf3a6e1fb6..1e66494809 100644 --- a/doc/html/boost/interprocess/open_read_only_t.html +++ b/doc/html/boost/interprocess/open_read_only_t.html @@ -36,7 +36,7 @@ struct open_read_only_t { };
    -

    Description

    +

    Description

    Tag to indicate that the resource must be only opened for reading

    diff --git a/doc/html/boost/interprocess/open_read_private_t.html b/doc/html/boost/interprocess/open_read_private_t.html index 8bcadd419e..b8e5944cb8 100644 --- a/doc/html/boost/interprocess/open_read_private_t.html +++ b/doc/html/boost/interprocess/open_read_private_t.html @@ -36,7 +36,7 @@ struct open_read_private_t { };
    -

    Description

    +

    Description

    Tag to indicate that the resource must be only opened privately for reading

    diff --git a/doc/html/boost/interprocess/operator___idp34259840.html b/doc/html/boost/interprocess/operator___idp34259840.html deleted file mode 100644 index bda52a8144..0000000000 --- a/doc/html/boost/interprocess/operator___idp34259840.html +++ /dev/null @@ -1,58 +0,0 @@ - - - - -Function template operator== - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator==

    -

    boost::interprocess::operator==

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/allocators/adaptive_pool.hpp>
-
-
-template<typename T, typename S, std::size_t NodesPerBlock, std::size_t F, 
-         unsigned char OP> 
-  bool operator==(const adaptive_pool< T, S, NodesPerBlock, F, OP > & alloc1, 
-                  const adaptive_pool< T, S, NodesPerBlock, F, OP > & alloc2);
    -
    -

    Description

    -

    Equality test for same type of adaptive_pool

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/operator___idp34268112.html b/doc/html/boost/interprocess/operator___idp34268112.html deleted file mode 100644 index 38cb90c579..0000000000 --- a/doc/html/boost/interprocess/operator___idp34268112.html +++ /dev/null @@ -1,58 +0,0 @@ - - - - -Function template operator!= - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator!=

    -

    boost::interprocess::operator!=

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/allocators/adaptive_pool.hpp>
-
-
-template<typename T, typename S, std::size_t NodesPerBlock, std::size_t F, 
-         unsigned char OP> 
-  bool operator!=(const adaptive_pool< T, S, NodesPerBlock, F, OP > & alloc1, 
-                  const adaptive_pool< T, S, NodesPerBlock, F, OP > & alloc2);
    -
    -

    Description

    -

    Inequality test for same type of adaptive_pool

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/operator___idp34348368.html b/doc/html/boost/interprocess/operator___idp34348368.html deleted file mode 100644 index 8b6302f639..0000000000 --- a/doc/html/boost/interprocess/operator___idp34348368.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function template operator== - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator==

    -

    boost::interprocess::operator==

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/allocators/allocator.hpp>
-
-
-template<typename T, typename SegmentManager> 
-  bool operator==(const allocator< T, SegmentManager > & alloc1, 
-                  const allocator< T, SegmentManager > & alloc2);
    -
    -

    Description

    -

    Equality test for same type of allocator

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/operator___idp34353344.html b/doc/html/boost/interprocess/operator___idp34353344.html deleted file mode 100644 index a4033e677f..0000000000 --- a/doc/html/boost/interprocess/operator___idp34353344.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function template operator!= - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator!=

    -

    boost::interprocess::operator!=

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/allocators/allocator.hpp>
-
-
-template<typename T, typename SegmentManager> 
-  bool operator!=(const allocator< T, SegmentManager > & alloc1, 
-                  const allocator< T, SegmentManager > & alloc2);
    -
    -

    Description

    -

    Inequality test for same type of allocator

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/operator___idp34455312.html b/doc/html/boost/interprocess/operator___idp34455312.html deleted file mode 100644 index cefc8e4dff..0000000000 --- a/doc/html/boost/interprocess/operator___idp34455312.html +++ /dev/null @@ -1,58 +0,0 @@ - - - - -Function template operator== - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator==

    -

    boost::interprocess::operator==

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/allocators/cached_adaptive_pool.hpp>
-
-
-template<typename T, typename S, std::size_t NodesPerBlock, std::size_t F, 
-         std::size_t OP> 
-  bool operator==(const cached_adaptive_pool< T, S, NodesPerBlock, F, OP > & alloc1, 
-                  const cached_adaptive_pool< T, S, NodesPerBlock, F, OP > & alloc2);
    -
    -

    Description

    -

    Equality test for same type of cached_adaptive_pool

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/operator___idp34463600.html b/doc/html/boost/interprocess/operator___idp34463600.html deleted file mode 100644 index 253a83baed..0000000000 --- a/doc/html/boost/interprocess/operator___idp34463600.html +++ /dev/null @@ -1,58 +0,0 @@ - - - - -Function template operator!= - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator!=

    -

    boost::interprocess::operator!=

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/allocators/cached_adaptive_pool.hpp>
-
-
-template<typename T, typename S, std::size_t NodesPerBlock, std::size_t F, 
-         std::size_t OP> 
-  bool operator!=(const cached_adaptive_pool< T, S, NodesPerBlock, F, OP > & alloc1, 
-                  const cached_adaptive_pool< T, S, NodesPerBlock, F, OP > & alloc2);
    -
    -

    Description

    -

    Inequality test for same type of cached_adaptive_pool

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/operator___idp34562560.html b/doc/html/boost/interprocess/operator___idp34562560.html deleted file mode 100644 index 0ecc7f310f..0000000000 --- a/doc/html/boost/interprocess/operator___idp34562560.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function template operator== - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator==

    -

    boost::interprocess::operator==

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/allocators/cached_node_allocator.hpp>
-
-
-template<typename T, typename S, std::size_t NPC> 
-  bool operator==(const cached_node_allocator< T, S, NPC > & alloc1, 
-                  const cached_node_allocator< T, S, NPC > & alloc2);
    -
    -

    Description

    -

    Equality test for same type of cached_node_allocator

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/operator___idp34569120.html b/doc/html/boost/interprocess/operator___idp34569120.html deleted file mode 100644 index 0b3fc7a8f8..0000000000 --- a/doc/html/boost/interprocess/operator___idp34569120.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function template operator!= - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator!=

    -

    boost::interprocess::operator!=

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/allocators/cached_node_allocator.hpp>
-
-
-template<typename T, typename S, std::size_t NPC> 
-  bool operator!=(const cached_node_allocator< T, S, NPC > & alloc1, 
-                  const cached_node_allocator< T, S, NPC > & alloc2);
    -
    -

    Description

    -

    Inequality test for same type of cached_node_allocator

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/operator___idp34662480.html b/doc/html/boost/interprocess/operator___idp34662480.html deleted file mode 100644 index 3cd85326cd..0000000000 --- a/doc/html/boost/interprocess/operator___idp34662480.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function template operator== - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator==

    -

    boost::interprocess::operator==

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/allocators/node_allocator.hpp>
-
-
-template<typename T, typename S, std::size_t NPC> 
-  bool operator==(const node_allocator< T, S, NPC > & alloc1, 
-                  const node_allocator< T, S, NPC > & alloc2);
    -
    -

    Description

    -

    Equality test for same type of node_allocator

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/operator___idp34669024.html b/doc/html/boost/interprocess/operator___idp34669024.html deleted file mode 100644 index 7707123a81..0000000000 --- a/doc/html/boost/interprocess/operator___idp34669024.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function template operator!= - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator!=

    -

    boost::interprocess::operator!=

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/allocators/node_allocator.hpp>
-
-
-template<typename T, typename S, std::size_t NPC> 
-  bool operator!=(const node_allocator< T, S, NPC > & alloc1, 
-                  const node_allocator< T, S, NPC > & alloc2);
    -
    -

    Description

    -

    Inequality test for same type of node_allocator

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/operator___idp34768432.html b/doc/html/boost/interprocess/operator___idp34768432.html deleted file mode 100644 index c83278389f..0000000000 --- a/doc/html/boost/interprocess/operator___idp34768432.html +++ /dev/null @@ -1,58 +0,0 @@ - - - - -Function template operator== - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator==

    -

    boost::interprocess::operator==

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/allocators/private_adaptive_pool.hpp>
-
-
-template<typename T, typename S, std::size_t NodesPerBlock, std::size_t F, 
-         unsigned char OP> 
-  bool operator==(const private_adaptive_pool< T, S, NodesPerBlock, F, OP > & alloc1, 
-                  const private_adaptive_pool< T, S, NodesPerBlock, F, OP > & alloc2);
    -
    -

    Description

    -

    Equality test for same type of private_adaptive_pool

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/operator___idp34776720.html b/doc/html/boost/interprocess/operator___idp34776720.html deleted file mode 100644 index d34b19e067..0000000000 --- a/doc/html/boost/interprocess/operator___idp34776720.html +++ /dev/null @@ -1,58 +0,0 @@ - - - - -Function template operator!= - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator!=

    -

    boost::interprocess::operator!=

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/allocators/private_adaptive_pool.hpp>
-
-
-template<typename T, typename S, std::size_t NodesPerBlock, std::size_t F, 
-         unsigned char OP> 
-  bool operator!=(const private_adaptive_pool< T, S, NodesPerBlock, F, OP > & alloc1, 
-                  const private_adaptive_pool< T, S, NodesPerBlock, F, OP > & alloc2);
    -
    -

    Description

    -

    Inequality test for same type of private_adaptive_pool

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/operator___idp34873552.html b/doc/html/boost/interprocess/operator___idp34873552.html deleted file mode 100644 index 19d943e983..0000000000 --- a/doc/html/boost/interprocess/operator___idp34873552.html +++ /dev/null @@ -1,58 +0,0 @@ - - - - -Function template operator== - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator==

    -

    boost::interprocess::operator==

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/allocators/private_node_allocator.hpp>
-
-
-template<typename T, typename S, std::size_t NodesPerBlock, std::size_t F, 
-         unsigned char OP> 
-  bool operator==(const private_node_allocator< T, S, NodesPerBlock, F, OP > & alloc1, 
-                  const private_node_allocator< T, S, NodesPerBlock, F, OP > & alloc2);
    -
    -

    Description

    -

    Equality test for same type of private_node_allocator

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/operator___idp34881840.html b/doc/html/boost/interprocess/operator___idp34881840.html deleted file mode 100644 index 633d677b2f..0000000000 --- a/doc/html/boost/interprocess/operator___idp34881840.html +++ /dev/null @@ -1,58 +0,0 @@ - - - - -Function template operator!= - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator!=

    -

    boost::interprocess::operator!=

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/allocators/private_node_allocator.hpp>
-
-
-template<typename T, typename S, std::size_t NodesPerBlock, std::size_t F, 
-         unsigned char OP> 
-  bool operator!=(const private_node_allocator< T, S, NodesPerBlock, F, OP > & alloc1, 
-                  const private_node_allocator< T, S, NodesPerBlock, F, OP > & alloc2);
    -
    -

    Description

    -

    Inequality test for same type of private_node_allocator

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/operator___idp36012240.html b/doc/html/boost/interprocess/operator___idp36012240.html deleted file mode 100644 index db5f69f29d..0000000000 --- a/doc/html/boost/interprocess/operator___idp36012240.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function template operator== - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator==

    -

    boost::interprocess::operator==

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/smart_ptr/intrusive_ptr.hpp>
-
-
-template<typename T, typename U, typename VP> 
-  bool operator==(intrusive_ptr< T, VP > const & a, 
-                  intrusive_ptr< U, VP > const & b);
    -
    -

    Description

    -

    Returns a.get() == b.get(). Does not throw

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/operator___idp36017456.html b/doc/html/boost/interprocess/operator___idp36017456.html deleted file mode 100644 index 6ba5c2409b..0000000000 --- a/doc/html/boost/interprocess/operator___idp36017456.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function template operator!= - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator!=

    -

    boost::interprocess::operator!=

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/smart_ptr/intrusive_ptr.hpp>
-
-
-template<typename T, typename U, typename VP> 
-  bool operator!=(intrusive_ptr< T, VP > const & a, 
-                  intrusive_ptr< U, VP > const & b);
    -
    -

    Description

    -

    Returns a.get() != b.get(). Does not throw

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/operator___idp36022672.html b/doc/html/boost/interprocess/operator___idp36022672.html deleted file mode 100644 index c452df8681..0000000000 --- a/doc/html/boost/interprocess/operator___idp36022672.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function template operator== - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator==

    -

    boost::interprocess::operator==

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/smart_ptr/intrusive_ptr.hpp>
-
-
-template<typename T, typename VP> 
-  bool operator==(intrusive_ptr< T, VP > const & a, 
-                  const typename intrusive_ptr< T, VP >::pointer & b);
    -
    -

    Description

    -

    Returns a.get() == b. Does not throw

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/operator___idp36027472.html b/doc/html/boost/interprocess/operator___idp36027472.html deleted file mode 100644 index 899fea51c9..0000000000 --- a/doc/html/boost/interprocess/operator___idp36027472.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function template operator!= - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator!=

    -

    boost::interprocess::operator!=

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/smart_ptr/intrusive_ptr.hpp>
-
-
-template<typename T, typename VP> 
-  bool operator!=(intrusive_ptr< T, VP > const & a, 
-                  const typename intrusive_ptr< T, VP >::pointer & b);
    -
    -

    Description

    -

    Returns a.get() != b. Does not throw

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/operator___idp36032272.html b/doc/html/boost/interprocess/operator___idp36032272.html deleted file mode 100644 index 62be6bfe1d..0000000000 --- a/doc/html/boost/interprocess/operator___idp36032272.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function template operator== - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator==

    -

    boost::interprocess::operator==

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/smart_ptr/intrusive_ptr.hpp>
-
-
-template<typename T, typename VP> 
-  bool operator==(const typename intrusive_ptr< T, VP >::pointer & a, 
-                  intrusive_ptr< T, VP > const & b);
    -
    -

    Description

    -

    Returns a == b.get(). Does not throw

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/operator___idp36037072.html b/doc/html/boost/interprocess/operator___idp36037072.html deleted file mode 100644 index 38322ae63b..0000000000 --- a/doc/html/boost/interprocess/operator___idp36037072.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function template operator!= - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator!=

    -

    boost::interprocess::operator!=

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/smart_ptr/intrusive_ptr.hpp>
-
-
-template<typename T, typename VP> 
-  bool operator!=(const typename intrusive_ptr< T, VP >::pointer & a, 
-                  intrusive_ptr< T, VP > const & b);
    -
    -

    Description

    -

    Returns a != b.get(). Does not throw

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/operator_idm45879390682704.html b/doc/html/boost/interprocess/operator_idm45879390682704.html new file mode 100644 index 0000000000..0f3c2f7a2b --- /dev/null +++ b/doc/html/boost/interprocess/operator_idm45879390682704.html @@ -0,0 +1,57 @@ + + + + +Function template operator< + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator<

    +

    boost::interprocess::operator<

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/smart_ptr/intrusive_ptr.hpp>
+
+
+template<typename T, typename VP> 
+  bool operator<(intrusive_ptr< T, VP > const & a, 
+                 intrusive_ptr< T, VP > const & b);
    +
    +

    Description

    +

    Returns a.get() < b.get(). Does not throw

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/operator_idm45879390687504.html b/doc/html/boost/interprocess/operator_idm45879390687504.html new file mode 100644 index 0000000000..1ae0ea2bcc --- /dev/null +++ b/doc/html/boost/interprocess/operator_idm45879390687504.html @@ -0,0 +1,57 @@ + + + + +Function template operator!= + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator!=

    +

    boost::interprocess::operator!=

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/smart_ptr/intrusive_ptr.hpp>
+
+
+template<typename T, typename VP> 
+  bool operator!=(const typename intrusive_ptr< T, VP >::pointer & a, 
+                  intrusive_ptr< T, VP > const & b);
    +
    +

    Description

    +

    Returns a != b.get(). Does not throw

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/operator_idm45879390692304.html b/doc/html/boost/interprocess/operator_idm45879390692304.html new file mode 100644 index 0000000000..4aa0366a95 --- /dev/null +++ b/doc/html/boost/interprocess/operator_idm45879390692304.html @@ -0,0 +1,57 @@ + + + + +Function template operator== + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator==

    +

    boost::interprocess::operator==

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/smart_ptr/intrusive_ptr.hpp>
+
+
+template<typename T, typename VP> 
+  bool operator==(const typename intrusive_ptr< T, VP >::pointer & a, 
+                  intrusive_ptr< T, VP > const & b);
    +
    +

    Description

    +

    Returns a == b.get(). Does not throw

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/operator_idm45879390697104.html b/doc/html/boost/interprocess/operator_idm45879390697104.html new file mode 100644 index 0000000000..f036e853fd --- /dev/null +++ b/doc/html/boost/interprocess/operator_idm45879390697104.html @@ -0,0 +1,57 @@ + + + + +Function template operator!= + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator!=

    +

    boost::interprocess::operator!=

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/smart_ptr/intrusive_ptr.hpp>
+
+
+template<typename T, typename VP> 
+  bool operator!=(intrusive_ptr< T, VP > const & a, 
+                  const typename intrusive_ptr< T, VP >::pointer & b);
    +
    +

    Description

    +

    Returns a.get() != b. Does not throw

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/operator_idm45879390701904.html b/doc/html/boost/interprocess/operator_idm45879390701904.html new file mode 100644 index 0000000000..759f10907c --- /dev/null +++ b/doc/html/boost/interprocess/operator_idm45879390701904.html @@ -0,0 +1,57 @@ + + + + +Function template operator== + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator==

    +

    boost::interprocess::operator==

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/smart_ptr/intrusive_ptr.hpp>
+
+
+template<typename T, typename VP> 
+  bool operator==(intrusive_ptr< T, VP > const & a, 
+                  const typename intrusive_ptr< T, VP >::pointer & b);
    +
    +

    Description

    +

    Returns a.get() == b. Does not throw

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/operator_idm45879390707120.html b/doc/html/boost/interprocess/operator_idm45879390707120.html new file mode 100644 index 0000000000..7d199c644e --- /dev/null +++ b/doc/html/boost/interprocess/operator_idm45879390707120.html @@ -0,0 +1,57 @@ + + + + +Function template operator!= + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator!=

    +

    boost::interprocess::operator!=

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/smart_ptr/intrusive_ptr.hpp>
+
+
+template<typename T, typename U, typename VP> 
+  bool operator!=(intrusive_ptr< T, VP > const & a, 
+                  intrusive_ptr< U, VP > const & b);
    +
    +

    Description

    +

    Returns a.get() != b.get(). Does not throw

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/operator_idm45879390712336.html b/doc/html/boost/interprocess/operator_idm45879390712336.html new file mode 100644 index 0000000000..8647eb8c8b --- /dev/null +++ b/doc/html/boost/interprocess/operator_idm45879390712336.html @@ -0,0 +1,57 @@ + + + + +Function template operator== + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator==

    +

    boost::interprocess::operator==

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/smart_ptr/intrusive_ptr.hpp>
+
+
+template<typename T, typename U, typename VP> 
+  bool operator==(intrusive_ptr< T, VP > const & a, 
+                  intrusive_ptr< U, VP > const & b);
    +
    +

    Description

    +

    Returns a.get() == b.get(). Does not throw

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/operator_idm45879391003744.html b/doc/html/boost/interprocess/operator_idm45879391003744.html new file mode 100644 index 0000000000..10dfdf192f --- /dev/null +++ b/doc/html/boost/interprocess/operator_idm45879391003744.html @@ -0,0 +1,58 @@ + + + + +Function template operator>> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator>>

    +

    boost::interprocess::operator>>

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/offset_ptr.hpp>
+
+
+template<typename E, typename T, typename W, typename X, typename Y, 
+         std::size_t Z> 
+  std::basic_istream< E, T > & 
+  operator>>(std::basic_istream< E, T > & is, offset_ptr< W, X, Y, Z > & p);
    +
    +

    Description

    +

    operator>> for offset ptr

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/operator_idm45879391010656.html b/doc/html/boost/interprocess/operator_idm45879391010656.html new file mode 100644 index 0000000000..708903ecba --- /dev/null +++ b/doc/html/boost/interprocess/operator_idm45879391010656.html @@ -0,0 +1,59 @@ + + + + +Function template operator<< + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator<<

    +

    boost::interprocess::operator<<

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/offset_ptr.hpp>
+
+
+template<typename E, typename T, typename W, typename X, typename Y, 
+         std::size_t Z> 
+  std::basic_ostream< E, T > & 
+  operator<<(std::basic_ostream< E, T > & os, 
+             offset_ptr< W, X, Y, Z > const & p);
    +
    +

    Description

    +

    operator<< for offset ptr

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/operator_idm45879391863280.html b/doc/html/boost/interprocess/operator_idm45879391863280.html new file mode 100644 index 0000000000..b47c512649 --- /dev/null +++ b/doc/html/boost/interprocess/operator_idm45879391863280.html @@ -0,0 +1,58 @@ + + + + +Function template operator!= + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator!=

    +

    boost::interprocess::operator!=

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/allocators/private_node_allocator.hpp>
+
+
+template<typename T, typename S, std::size_t NodesPerBlock, std::size_t F, 
+         unsigned char OP> 
+  bool operator!=(const private_node_allocator< T, S, NodesPerBlock, F, OP > & alloc1, 
+                  const private_node_allocator< T, S, NodesPerBlock, F, OP > & alloc2);
    +
    +

    Description

    +

    Inequality test for same type of private_node_allocator

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/operator_idm45879391871568.html b/doc/html/boost/interprocess/operator_idm45879391871568.html new file mode 100644 index 0000000000..2254c0a805 --- /dev/null +++ b/doc/html/boost/interprocess/operator_idm45879391871568.html @@ -0,0 +1,58 @@ + + + + +Function template operator== + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator==

    +

    boost::interprocess::operator==

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/allocators/private_node_allocator.hpp>
+
+
+template<typename T, typename S, std::size_t NodesPerBlock, std::size_t F, 
+         unsigned char OP> 
+  bool operator==(const private_node_allocator< T, S, NodesPerBlock, F, OP > & alloc1, 
+                  const private_node_allocator< T, S, NodesPerBlock, F, OP > & alloc2);
    +
    +

    Description

    +

    Equality test for same type of private_node_allocator

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/operator_idm45879391968400.html b/doc/html/boost/interprocess/operator_idm45879391968400.html new file mode 100644 index 0000000000..ddc95e7389 --- /dev/null +++ b/doc/html/boost/interprocess/operator_idm45879391968400.html @@ -0,0 +1,58 @@ + + + + +Function template operator!= + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator!=

    +

    boost::interprocess::operator!=

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/allocators/private_adaptive_pool.hpp>
+
+
+template<typename T, typename S, std::size_t NodesPerBlock, std::size_t F, 
+         unsigned char OP> 
+  bool operator!=(const private_adaptive_pool< T, S, NodesPerBlock, F, OP > & alloc1, 
+                  const private_adaptive_pool< T, S, NodesPerBlock, F, OP > & alloc2);
    +
    +

    Description

    +

    Inequality test for same type of private_adaptive_pool

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/operator_idm45879391976688.html b/doc/html/boost/interprocess/operator_idm45879391976688.html new file mode 100644 index 0000000000..c31f5dfc08 --- /dev/null +++ b/doc/html/boost/interprocess/operator_idm45879391976688.html @@ -0,0 +1,58 @@ + + + + +Function template operator== + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator==

    +

    boost::interprocess::operator==

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/allocators/private_adaptive_pool.hpp>
+
+
+template<typename T, typename S, std::size_t NodesPerBlock, std::size_t F, 
+         unsigned char OP> 
+  bool operator==(const private_adaptive_pool< T, S, NodesPerBlock, F, OP > & alloc1, 
+                  const private_adaptive_pool< T, S, NodesPerBlock, F, OP > & alloc2);
    +
    +

    Description

    +

    Equality test for same type of private_adaptive_pool

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/operator_idm45879392076096.html b/doc/html/boost/interprocess/operator_idm45879392076096.html new file mode 100644 index 0000000000..b6aa7624b2 --- /dev/null +++ b/doc/html/boost/interprocess/operator_idm45879392076096.html @@ -0,0 +1,57 @@ + + + + +Function template operator!= + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator!=

    +

    boost::interprocess::operator!=

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/allocators/node_allocator.hpp>
+
+
+template<typename T, typename S, std::size_t NPC> 
+  bool operator!=(const node_allocator< T, S, NPC > & alloc1, 
+                  const node_allocator< T, S, NPC > & alloc2);
    +
    +

    Description

    +

    Inequality test for same type of node_allocator

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/operator_idm45879392082640.html b/doc/html/boost/interprocess/operator_idm45879392082640.html new file mode 100644 index 0000000000..afb2da6b9c --- /dev/null +++ b/doc/html/boost/interprocess/operator_idm45879392082640.html @@ -0,0 +1,57 @@ + + + + +Function template operator== + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator==

    +

    boost::interprocess::operator==

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/allocators/node_allocator.hpp>
+
+
+template<typename T, typename S, std::size_t NPC> 
+  bool operator==(const node_allocator< T, S, NPC > & alloc1, 
+                  const node_allocator< T, S, NPC > & alloc2);
    +
    +

    Description

    +

    Equality test for same type of node_allocator

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/operator_idm45879392176000.html b/doc/html/boost/interprocess/operator_idm45879392176000.html new file mode 100644 index 0000000000..fb37add1ea --- /dev/null +++ b/doc/html/boost/interprocess/operator_idm45879392176000.html @@ -0,0 +1,57 @@ + + + + +Function template operator!= + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator!=

    +

    boost::interprocess::operator!=

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/allocators/cached_node_allocator.hpp>
+
+
+template<typename T, typename S, std::size_t NPC> 
+  bool operator!=(const cached_node_allocator< T, S, NPC > & alloc1, 
+                  const cached_node_allocator< T, S, NPC > & alloc2);
    +
    +

    Description

    +

    Inequality test for same type of cached_node_allocator

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/operator_idm45879392182560.html b/doc/html/boost/interprocess/operator_idm45879392182560.html new file mode 100644 index 0000000000..d9b4232ae0 --- /dev/null +++ b/doc/html/boost/interprocess/operator_idm45879392182560.html @@ -0,0 +1,57 @@ + + + + +Function template operator== + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator==

    +

    boost::interprocess::operator==

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/allocators/cached_node_allocator.hpp>
+
+
+template<typename T, typename S, std::size_t NPC> 
+  bool operator==(const cached_node_allocator< T, S, NPC > & alloc1, 
+                  const cached_node_allocator< T, S, NPC > & alloc2);
    +
    +

    Description

    +

    Equality test for same type of cached_node_allocator

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/operator_idm45879392281520.html b/doc/html/boost/interprocess/operator_idm45879392281520.html new file mode 100644 index 0000000000..faa4695675 --- /dev/null +++ b/doc/html/boost/interprocess/operator_idm45879392281520.html @@ -0,0 +1,58 @@ + + + + +Function template operator!= + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator!=

    +

    boost::interprocess::operator!=

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/allocators/cached_adaptive_pool.hpp>
+
+
+template<typename T, typename S, std::size_t NodesPerBlock, std::size_t F, 
+         std::size_t OP> 
+  bool operator!=(const cached_adaptive_pool< T, S, NodesPerBlock, F, OP > & alloc1, 
+                  const cached_adaptive_pool< T, S, NodesPerBlock, F, OP > & alloc2);
    +
    +

    Description

    +

    Inequality test for same type of cached_adaptive_pool

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/operator_idm45879392289808.html b/doc/html/boost/interprocess/operator_idm45879392289808.html new file mode 100644 index 0000000000..74fe40c1b8 --- /dev/null +++ b/doc/html/boost/interprocess/operator_idm45879392289808.html @@ -0,0 +1,58 @@ + + + + +Function template operator== + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator==

    +

    boost::interprocess::operator==

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/allocators/cached_adaptive_pool.hpp>
+
+
+template<typename T, typename S, std::size_t NodesPerBlock, std::size_t F, 
+         std::size_t OP> 
+  bool operator==(const cached_adaptive_pool< T, S, NodesPerBlock, F, OP > & alloc1, 
+                  const cached_adaptive_pool< T, S, NodesPerBlock, F, OP > & alloc2);
    +
    +

    Description

    +

    Equality test for same type of cached_adaptive_pool

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/operator_idm45879392391776.html b/doc/html/boost/interprocess/operator_idm45879392391776.html new file mode 100644 index 0000000000..5cb8af9fe1 --- /dev/null +++ b/doc/html/boost/interprocess/operator_idm45879392391776.html @@ -0,0 +1,57 @@ + + + + +Function template operator!= + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator!=

    +

    boost::interprocess::operator!=

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/allocators/allocator.hpp>
+
+
+template<typename T, typename SegmentManager> 
+  bool operator!=(const allocator< T, SegmentManager > & alloc1, 
+                  const allocator< T, SegmentManager > & alloc2);
    +
    +

    Description

    +

    Inequality test for same type of allocator

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/operator_idm45879392396752.html b/doc/html/boost/interprocess/operator_idm45879392396752.html new file mode 100644 index 0000000000..045ed499a2 --- /dev/null +++ b/doc/html/boost/interprocess/operator_idm45879392396752.html @@ -0,0 +1,57 @@ + + + + +Function template operator== + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator==

    +

    boost::interprocess::operator==

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/allocators/allocator.hpp>
+
+
+template<typename T, typename SegmentManager> 
+  bool operator==(const allocator< T, SegmentManager > & alloc1, 
+                  const allocator< T, SegmentManager > & alloc2);
    +
    +

    Description

    +

    Equality test for same type of allocator

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/operator_idm45879392477104.html b/doc/html/boost/interprocess/operator_idm45879392477104.html new file mode 100644 index 0000000000..409d48afaf --- /dev/null +++ b/doc/html/boost/interprocess/operator_idm45879392477104.html @@ -0,0 +1,58 @@ + + + + +Function template operator!= + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator!=

    +

    boost::interprocess::operator!=

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/allocators/adaptive_pool.hpp>
+
+
+template<typename T, typename S, std::size_t NodesPerBlock, std::size_t F, 
+         unsigned char OP> 
+  bool operator!=(const adaptive_pool< T, S, NodesPerBlock, F, OP > & alloc1, 
+                  const adaptive_pool< T, S, NodesPerBlock, F, OP > & alloc2);
    +
    +

    Description

    +

    Inequality test for same type of adaptive_pool

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/operator_idm45879392485376.html b/doc/html/boost/interprocess/operator_idm45879392485376.html new file mode 100644 index 0000000000..01eb3d8590 --- /dev/null +++ b/doc/html/boost/interprocess/operator_idm45879392485376.html @@ -0,0 +1,58 @@ + + + + +Function template operator== + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator==

    +

    boost::interprocess::operator==

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/allocators/adaptive_pool.hpp>
+
+
+template<typename T, typename S, std::size_t NodesPerBlock, std::size_t F, 
+         unsigned char OP> 
+  bool operator==(const adaptive_pool< T, S, NodesPerBlock, F, OP > & alloc1, 
+                  const adaptive_pool< T, S, NodesPerBlock, F, OP > & alloc2);
    +
    +

    Description

    +

    Equality test for same type of adaptive_pool

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/operator_idp35714560.html b/doc/html/boost/interprocess/operator_idp35714560.html deleted file mode 100644 index a23a1a03d7..0000000000 --- a/doc/html/boost/interprocess/operator_idp35714560.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Function template operator<< - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator<<

    -

    boost::interprocess::operator<<

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/offset_ptr.hpp>
-
-
-template<typename E, typename T, typename W, typename X, typename Y, 
-         std::size_t Z> 
-  std::basic_ostream< E, T > & 
-  operator<<(std::basic_ostream< E, T > & os, 
-             offset_ptr< W, X, Y, Z > const & p);
    -
    -

    Description

    -

    operator<< for offset ptr

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/operator_idp35721472.html b/doc/html/boost/interprocess/operator_idp35721472.html deleted file mode 100644 index 10efc3edbe..0000000000 --- a/doc/html/boost/interprocess/operator_idp35721472.html +++ /dev/null @@ -1,58 +0,0 @@ - - - - -Function template operator>> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator>>

    -

    boost::interprocess::operator>>

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/offset_ptr.hpp>
-
-
-template<typename E, typename T, typename W, typename X, typename Y, 
-         std::size_t Z> 
-  std::basic_istream< E, T > & 
-  operator>>(std::basic_istream< E, T > & is, offset_ptr< W, X, Y, Z > & p);
    -
    -

    Description

    -

    operator>> for offset ptr

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/operator_idp36041872.html b/doc/html/boost/interprocess/operator_idp36041872.html deleted file mode 100644 index a802734d59..0000000000 --- a/doc/html/boost/interprocess/operator_idp36041872.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function template operator< - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator<

    -

    boost::interprocess::operator<

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/smart_ptr/intrusive_ptr.hpp>
-
-
-template<typename T, typename VP> 
-  bool operator<(intrusive_ptr< T, VP > const & a, 
-                 intrusive_ptr< T, VP > const & b);
    -
    -

    Description

    -

    Returns a.get() < b.get(). Does not throw

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/permissions.html b/doc/html/boost/interprocess/permissions.html index 0c21513382..589937d3bd 100644 --- a/doc/html/boost/interprocess/permissions.html +++ b/doc/html/boost/interprocess/permissions.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -36,52 +36,52 @@ class permissions { public: // construct/copy/destruct - permissions(os_permissions_type); - permissions(); + permissions(os_permissions_type); + permissions(); - // public member functions - void set_default(); - void set_unrestricted(); - void set_permissions(os_permissions_type); - os_permissions_type get_permissions() const; + // public member functions + void set_default(); + void set_unrestricted(); + void set_permissions(os_permissions_type); + os_permissions_type get_permissions() const; };
    -

    Description

    +

    Description

    The permissions class represents permissions to be set to shared memory or files, that can be constructed form usual permission representations: a SECURITY_ATTRIBUTES pointer in windows or ORed rwx chmod integer in UNIX.

    -

    +

    permissions public construct/copy/destruct

    1. -
      permissions(os_permissions_type type);
      +
      permissions(os_permissions_type type);

      Constructs a permissions object from a user provided os-dependent permissions.

    2. -
      permissions();
      +
      permissions();

      Constructs a default permissions object: A null security attributes pointer for windows or 0644 for UNIX.

    -

    -permissions public member functions

    +

    +permissions public member functions

    1. -
      void set_default();
      +
      void set_default();

      Sets permissions to default values: A null security attributes pointer for windows or 0644 for UNIX.

    2. -
      void set_unrestricted();
      +
      void set_unrestricted();

      Sets permissions to unrestricted access: A null DACL for windows or 0666 for UNIX.

    3. -
      void set_permissions(os_permissions_type perm);
      +
      void set_permissions(os_permissions_type perm);

      Sets permissions from a user provided os-dependent permissions.

    4. -
      os_permissions_type get_permissions() const;
      +
      os_permissions_type get_permissions() const;

      Returns stored os-dependent permissions

    @@ -98,7 +98,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/private_adaptive_pool.html b/doc/html/boost/interprocess/private_adaptive_pool.html index 95105fdcd2..b0cffa676b 100644 --- a/doc/html/boost/interprocess/private_adaptive_pool.html +++ b/doc/html/boost/interprocess/private_adaptive_pool.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -55,173 +55,173 @@ }; // construct/copy/destruct - private_adaptive_pool(segment_manager *); - private_adaptive_pool(const private_adaptive_pool &); + private_adaptive_pool(segment_manager *); + private_adaptive_pool(const private_adaptive_pool &); template<typename T2> - private_adaptive_pool(const private_adaptive_pool< T2, SegmentManager, NodesPerBlock, MaxFreeBlocks, OverheadPercent > &); + private_adaptive_pool(const private_adaptive_pool< T2, SegmentManager, NodesPerBlock, MaxFreeBlocks, OverheadPercent > &); template<typename T2, typename SegmentManager2, std::size_t N2, std::size_t F2, unsigned char OP2> private_adaptive_pool & - operator=(const private_adaptive_pool< T2, SegmentManager2, N2, F2 > &); - private_adaptive_pool & operator=(const private_adaptive_pool &); - ~private_adaptive_pool(); + operator=(const private_adaptive_pool< T2, SegmentManager2, N2, F2 > &); + private_adaptive_pool & operator=(const private_adaptive_pool &); + ~private_adaptive_pool(); - // public member functions - node_pool_t * get_node_pool() const; - segment_manager * get_segment_manager() const; - size_type max_size() const; - pointer allocate(size_type, cvoid_pointer = 0); - void deallocate(const pointer &, size_type); - void deallocate_free_blocks(); - pointer address(reference) const; - const_pointer address(const_reference) const; - void construct(const pointer &, const_reference); - void destroy(const pointer &); - size_type size(const pointer &) const; - pointer allocation_command(boost::interprocess::allocation_type, size_type, + // public member functions + node_pool_t * get_node_pool() const; + segment_manager * get_segment_manager() const; + size_type max_size() const; + pointer allocate(size_type, cvoid_pointer = 0); + void deallocate(const pointer &, size_type); + void deallocate_free_blocks(); + pointer address(reference) const; + const_pointer address(const_reference) const; + void construct(const pointer &, const_reference); + void destroy(const pointer &); + size_type size(const pointer &) const; + pointer allocation_command(boost::interprocess::allocation_type, size_type, size_type &, pointer &); - void allocate_many(size_type, size_type, multiallocation_chain &); - void allocate_many(const size_type *, size_type, multiallocation_chain &); - void deallocate_many(multiallocation_chain &); - pointer allocate_one(); - void allocate_individual(size_type, multiallocation_chain &); - void deallocate_one(const pointer &); - void deallocate_individual(multiallocation_chain &); + void allocate_many(size_type, size_type, multiallocation_chain &); + void allocate_many(const size_type *, size_type, multiallocation_chain &); + void deallocate_many(multiallocation_chain &); + pointer allocate_one(); + void allocate_individual(size_type, multiallocation_chain &); + void deallocate_one(const pointer &); + void deallocate_individual(multiallocation_chain &); - // friend functions - friend void swap(self_t &, self_t &); + // friend functions + friend void swap(self_t &, self_t &); };
    -

    Description

    +

    Description

    An STL node allocator that uses a segment manager as memory source. The internal pointer type will of the same type (raw, smart) as "typename SegmentManager::void_pointer" type. This allows placing the allocator in shared memory, memory mapped-files, etc... This allocator has its own node pool.

    NodesPerBlock is the minimum number of nodes of nodes allocated at once when the allocator needs runs out of nodes. MaxFreeBlocks is the maximum number of totally free blocks that the adaptive node pool will hold. The rest of the totally free blocks will be deallocated with the segment manager.

    OverheadPercent is the (approximated) maximum size overhead (1-20%) of the allocator: (memory usable for nodes / total memory allocated from the segment manager)

    -

    +

    private_adaptive_pool public construct/copy/destruct

    1. -
      private_adaptive_pool(segment_manager * segment_mngr);
      +
      private_adaptive_pool(segment_manager * segment_mngr);

      Constructor from a segment manager. If not present, constructs a node pool. Increments the reference count of the associated node pool. Can throw boost::interprocess::bad_alloc

    2. -
      private_adaptive_pool(const private_adaptive_pool & other);
      +
      private_adaptive_pool(const private_adaptive_pool & other);

      Copy constructor from other private_adaptive_pool. Increments the reference count of the associated node pool. Never throws 

    3. template<typename T2> 
-  private_adaptive_pool(const private_adaptive_pool< T2, SegmentManager, NodesPerBlock, MaxFreeBlocks, OverheadPercent > & other);
      + private_adaptive_pool(const private_adaptive_pool< T2, SegmentManager, NodesPerBlock, MaxFreeBlocks, OverheadPercent > & other);

      Copy constructor from related private_adaptive_pool. If not present, constructs a node pool. Increments the reference count of the associated node pool. Can throw boost::interprocess::bad_alloc 

    4. template<typename T2, typename SegmentManager2, std::size_t N2, 
          std::size_t F2, unsigned char OP2> 
   private_adaptive_pool & 
-  operator=(const private_adaptive_pool< T2, SegmentManager2, N2, F2 > &);
      + operator=(const private_adaptive_pool< T2, SegmentManager2, N2, F2 > &);

      Not assignable from related private_adaptive_pool

    5. -
      private_adaptive_pool & operator=(const private_adaptive_pool &);
      +
      private_adaptive_pool & operator=(const private_adaptive_pool &);

      Not assignable from other private_adaptive_pool

    6. -
      ~private_adaptive_pool();
      +
      ~private_adaptive_pool();

      Destructor, removes node_pool_t from memory if its reference count reaches to zero. Never throws

    -

    -private_adaptive_pool public member functions

    +

    +private_adaptive_pool public member functions

    1. -
      node_pool_t * get_node_pool() const;
      +
      node_pool_t * get_node_pool() const;

      Returns a pointer to the node pool. Never throws

    2. -
      segment_manager * get_segment_manager() const;
      +
      segment_manager * get_segment_manager() const;

      Returns the segment manager. Never throws

    3. -
      size_type max_size() const;
      +
      size_type max_size() const;

      Returns the number of elements that could be allocated. Never throws

    4. -
      pointer allocate(size_type count, cvoid_pointer hint = 0);
      +
      pointer allocate(size_type count, cvoid_pointer hint = 0);

      Allocate memory for an array of count elements. Throws boost::interprocess::bad_alloc if there is no enough memory

    5. -
      void deallocate(const pointer & ptr, size_type count);
      +
      void deallocate(const pointer & ptr, size_type count);

      Deallocate allocated memory. Never throws

    6. -
      void deallocate_free_blocks();
      +
      void deallocate_free_blocks();

      Deallocates all free blocks of the pool

    7. -
      pointer address(reference value) const;
      +
      pointer address(reference value) const;

      Returns address of mutable object. Never throws

    8. -
      const_pointer address(const_reference value) const;
      +
      const_pointer address(const_reference value) const;

      Returns address of non mutable object. Never throws

    9. -
      void construct(const pointer & ptr, const_reference v);
      +
      void construct(const pointer & ptr, const_reference v);

      Copy construct an object. Throws if T's copy constructor throws

    10. -
      void destroy(const pointer & ptr);
      +
      void destroy(const pointer & ptr);

      Destroys object. Throws if object's destructor throws

    11. -
      size_type size(const pointer & p) const;
      +
      size_type size(const pointer & p) const;

      Returns maximum the number of objects the previously allocated memory pointed by p can hold. This size only works for memory allocated with allocate, allocation_command and allocate_many.

      12. -
    12. pointer allocation_command(boost::interprocess::allocation_type command, 
+
    13. pointer allocation_command(boost::interprocess::allocation_type command, 
                            size_type limit_size, 
                            size_type & prefer_in_recvd_out_size, 
                            pointer & reuse);
      14. 
 
    14. 
-
      void allocate_many(size_type elem_size, size_type num_elements, 
+
      void allocate_many(size_type elem_size, size_type num_elements, 
                    multiallocation_chain & chain);
      
 
      Allocates many elements of size elem_size in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. The elements must be deallocated with deallocate(...) 
      
 
      15. 
 
    15. 
-
      void allocate_many(const size_type * elem_sizes, size_type n_elements, 
+
      void allocate_many(const size_type * elem_sizes, size_type n_elements, 
                    multiallocation_chain & chain);
      
 
      Allocates n_elements elements, each one of size elem_sizes[i]in a contiguous block of memory. The elements must be deallocated 
      
 
      16. 
 
    16. 
-
      void deallocate_many(multiallocation_chain & chain);
      
+
      void deallocate_many(multiallocation_chain & chain);
      
 
      Allocates many elements of size elem_size in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. The elements must be deallocated with deallocate(...) 
      
 
      17. 
 
    17. 
-
      pointer allocate_one();
      
+
      pointer allocate_one();
      
 
      Allocates just one object. Memory allocated with this function must be deallocated only with deallocate_one(). Throws boost::interprocess::bad_alloc if there is no enough memory 
      
 
      18. 
 
    18. 
-
      void allocate_individual(size_type num_elements, 
+
      void allocate_individual(size_type num_elements, 
                          multiallocation_chain & chain);
      
 
      Allocates many elements of size == 1 in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. Memory allocated with this function must be deallocated only with deallocate_one(). 
      
 
      19. 
 
    19. 
-
      void deallocate_one(const pointer & p);
      
+
      void deallocate_one(const pointer & p);
      
 
      Deallocates memory previously allocated with allocate_one(). You should never use deallocate_one to deallocate memory allocated with other functions different from allocate_one(). Never throws 
      
 
      20. 
 
    20. 
-
      void deallocate_individual(multiallocation_chain & chain);
      
+
      void deallocate_individual(multiallocation_chain & chain);
      
 
      Allocates many elements of size == 1 in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. Memory allocated with this function must be deallocated only with deallocate_one(). 
      
 
      21.
    -

    -private_adaptive_pool friend functions

    +

    +private_adaptive_pool friend functions

    1. -
      friend void swap(self_t & alloc1, self_t & alloc2);
      +
      friend void swap(self_t & alloc1, self_t & alloc2);

      Swaps allocators. Does not throw. If each allocator is placed in a different memory segment, the result is undefined.

    @@ -237,7 +237,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/private_adaptive_pool/rebind.html b/doc/html/boost/interprocess/private_adaptive_pool/rebind.html index 97da85dca0..a66b165487 100644 --- a/doc/html/boost/interprocess/private_adaptive_pool/rebind.html +++ b/doc/html/boost/interprocess/private_adaptive_pool/rebind.html @@ -6,9 +6,9 @@ - + - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -39,7 +39,7 @@ typedef private_adaptive_pool< T2, SegmentManager, NodesPerBlock, MaxFreeBlocks, OverheadPercent > other; };
    -

    Description

    +

    Description

    Obtains private_adaptive_pool from private_adaptive_pool

    @@ -53,7 +53,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/private_node_allocator.html b/doc/html/boost/interprocess/private_node_allocator.html index 32b8757726..3914e414c2 100644 --- a/doc/html/boost/interprocess/private_node_allocator.html +++ b/doc/html/boost/interprocess/private_node_allocator.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -54,169 +54,169 @@ }; // construct/copy/destruct - private_node_allocator(segment_manager *); - private_node_allocator(const private_node_allocator &); + private_node_allocator(segment_manager *); + private_node_allocator(const private_node_allocator &); template<typename T2> - private_node_allocator(const private_node_allocator< T2, SegmentManager, NodesPerBlock > &); + private_node_allocator(const private_node_allocator< T2, SegmentManager, NodesPerBlock > &); template<typename T2, typename SegmentManager2, std::size_t N2> private_node_allocator & - operator=(const private_node_allocator< T2, SegmentManager2, N2 > &); - private_node_allocator & operator=(const private_node_allocator &); - ~private_node_allocator(); + operator=(const private_node_allocator< T2, SegmentManager2, N2 > &); + private_node_allocator & operator=(const private_node_allocator &); + ~private_node_allocator(); - // public member functions - node_pool_t * get_node_pool() const; - segment_manager * get_segment_manager() const; - size_type max_size() const; - pointer allocate(size_type, cvoid_pointer = 0); - void deallocate(const pointer &, size_type); - void deallocate_free_blocks(); - pointer address(reference) const; - const_pointer address(const_reference) const; - void construct(const pointer &, const_reference); - void destroy(const pointer &); - size_type size(const pointer &) const; - pointer allocation_command(boost::interprocess::allocation_type, size_type, + // public member functions + node_pool_t * get_node_pool() const; + segment_manager * get_segment_manager() const; + size_type max_size() const; + pointer allocate(size_type, cvoid_pointer = 0); + void deallocate(const pointer &, size_type); + void deallocate_free_blocks(); + pointer address(reference) const; + const_pointer address(const_reference) const; + void construct(const pointer &, const_reference); + void destroy(const pointer &); + size_type size(const pointer &) const; + pointer allocation_command(boost::interprocess::allocation_type, size_type, size_type &, pointer &); - void allocate_many(size_type, size_type, multiallocation_chain &); - void allocate_many(const size_type *, size_type, multiallocation_chain &); - void deallocate_many(multiallocation_chain &); - pointer allocate_one(); - void allocate_individual(size_type, multiallocation_chain &); - void deallocate_one(const pointer &); - void deallocate_individual(multiallocation_chain &); + void allocate_many(size_type, size_type, multiallocation_chain &); + void allocate_many(const size_type *, size_type, multiallocation_chain &); + void deallocate_many(multiallocation_chain &); + pointer allocate_one(); + void allocate_individual(size_type, multiallocation_chain &); + void deallocate_one(const pointer &); + void deallocate_individual(multiallocation_chain &); - // friend functions - friend void swap(self_t &, self_t &); + // friend functions + friend void swap(self_t &, self_t &); };
    -

    Description

    +

    Description

    An STL node allocator that uses a segment manager as memory source. The internal pointer type will of the same type (raw, smart) as "typename SegmentManager::void_pointer" type. This allows placing the allocator in shared memory, memory mapped-files, etc... This allocator has its own node pool. NodesPerBlock is the number of nodes allocated at once when the allocator needs runs out of nodes

    -

    +

    private_node_allocator public construct/copy/destruct

    1. -
      private_node_allocator(segment_manager * segment_mngr);
      +
      private_node_allocator(segment_manager * segment_mngr);

      Constructor from a segment manager. If not present, constructs a node pool. Increments the reference count of the associated node pool. Can throw boost::interprocess::bad_alloc

    2. -
      private_node_allocator(const private_node_allocator & other);
      +
      private_node_allocator(const private_node_allocator & other);

      Copy constructor from other private_node_allocator. Increments the reference count of the associated node pool. Never throws 

    3. template<typename T2> 
-  private_node_allocator(const private_node_allocator< T2, SegmentManager, NodesPerBlock > & other);
      + private_node_allocator(const private_node_allocator< T2, SegmentManager, NodesPerBlock > & other);

      Copy constructor from related private_node_allocator. If not present, constructs a node pool. Increments the reference count of the associated node pool. Can throw boost::interprocess::bad_alloc 

    4. template<typename T2, typename SegmentManager2, std::size_t N2> 
   private_node_allocator & 
-  operator=(const private_node_allocator< T2, SegmentManager2, N2 > &);
      + operator=(const private_node_allocator< T2, SegmentManager2, N2 > &);

      Not assignable from related private_node_allocator

    5. -
      private_node_allocator & operator=(const private_node_allocator &);
      +
      private_node_allocator & operator=(const private_node_allocator &);

      Not assignable from other private_node_allocator

    6. -
      ~private_node_allocator();
      +
      ~private_node_allocator();

      Destructor, removes node_pool_t from memory if its reference count reaches to zero. Never throws

    -

    -private_node_allocator public member functions

    +

    +private_node_allocator public member functions

    1. -
      node_pool_t * get_node_pool() const;
      +
      node_pool_t * get_node_pool() const;

      Returns a pointer to the node pool. Never throws

    2. -
      segment_manager * get_segment_manager() const;
      +
      segment_manager * get_segment_manager() const;

      Returns the segment manager. Never throws

    3. -
      size_type max_size() const;
      +
      size_type max_size() const;

      Returns the number of elements that could be allocated. Never throws

    4. -
      pointer allocate(size_type count, cvoid_pointer hint = 0);
      +
      pointer allocate(size_type count, cvoid_pointer hint = 0);

      Allocate memory for an array of count elements. Throws boost::interprocess::bad_alloc if there is no enough memory

    5. -
      void deallocate(const pointer & ptr, size_type count);
      +
      void deallocate(const pointer & ptr, size_type count);

      Deallocate allocated memory. Never throws

    6. -
      void deallocate_free_blocks();
      +
      void deallocate_free_blocks();

      Deallocates all free blocks of the pool

    7. -
      pointer address(reference value) const;
      +
      pointer address(reference value) const;

      Returns address of mutable object. Never throws

    8. -
      const_pointer address(const_reference value) const;
      +
      const_pointer address(const_reference value) const;

      Returns address of non mutable object. Never throws

    9. -
      void construct(const pointer & ptr, const_reference v);
      +
      void construct(const pointer & ptr, const_reference v);

      Copy construct an object. Throws if T's copy constructor throws

    10. -
      void destroy(const pointer & ptr);
      +
      void destroy(const pointer & ptr);

      Destroys object. Throws if object's destructor throws

    11. -
      size_type size(const pointer & p) const;
      +
      size_type size(const pointer & p) const;

      Returns maximum the number of objects the previously allocated memory pointed by p can hold. This size only works for memory allocated with allocate, allocation_command and allocate_many.

      12. -
    12. pointer allocation_command(boost::interprocess::allocation_type command, 
+
    13. pointer allocation_command(boost::interprocess::allocation_type command, 
                            size_type limit_size, 
                            size_type & prefer_in_recvd_out_size, 
                            pointer & reuse);
      14. 
 
    14. 
-
      void allocate_many(size_type elem_size, size_type num_elements, 
+
      void allocate_many(size_type elem_size, size_type num_elements, 
                    multiallocation_chain & chain);
      
 
      Allocates many elements of size elem_size in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. The elements must be deallocated with deallocate(...) 
      
 
      15. 
 
    15. 
-
      void allocate_many(const size_type * elem_sizes, size_type n_elements, 
+
      void allocate_many(const size_type * elem_sizes, size_type n_elements, 
                    multiallocation_chain & chain);
      
 
      Allocates n_elements elements, each one of size elem_sizes[i]in a contiguous block of memory. The elements must be deallocated 
      
 
      16. 
 
    16. 
-
      void deallocate_many(multiallocation_chain & chain);
      
+
      void deallocate_many(multiallocation_chain & chain);
      
 
      Allocates many elements of size elem_size in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. The elements must be deallocated with deallocate(...) 
      
 
      17. 
 
    17. 
-
      pointer allocate_one();
      
+
      pointer allocate_one();
      
 
      Allocates just one object. Memory allocated with this function must be deallocated only with deallocate_one(). Throws boost::interprocess::bad_alloc if there is no enough memory 
      
 
      18. 
 
    18. 
-
      void allocate_individual(size_type num_elements, 
+
      void allocate_individual(size_type num_elements, 
                          multiallocation_chain & chain);
      
 
      Allocates many elements of size == 1 in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. Memory allocated with this function must be deallocated only with deallocate_one(). 
      
 
      19. 
 
    19. 
-
      void deallocate_one(const pointer & p);
      
+
      void deallocate_one(const pointer & p);
      
 
      Deallocates memory previously allocated with allocate_one(). You should never use deallocate_one to deallocate memory allocated with other functions different from allocate_one(). Never throws 
      
 
      20. 
 
    20. 
-
      void deallocate_individual(multiallocation_chain & chain);
      
+
      void deallocate_individual(multiallocation_chain & chain);
      
 
      Allocates many elements of size == 1 in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. Memory allocated with this function must be deallocated only with deallocate_one(). 
      
 
      21.
    -

    -private_node_allocator friend functions

    +

    +private_node_allocator friend functions

    1. -
      friend void swap(self_t & alloc1, self_t & alloc2);
      +
      friend void swap(self_t & alloc1, self_t & alloc2);

      Swaps allocators. Does not throw. If each allocator is placed in a different memory segment, the result is undefined.

    @@ -232,7 +232,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/private_node_allocator/rebind.html b/doc/html/boost/interprocess/private_node_allocator/rebind.html index ca6b1c1f62..b5b682610e 100644 --- a/doc/html/boost/interprocess/private_node_allocator/rebind.html +++ b/doc/html/boost/interprocess/private_node_allocator/rebind.html @@ -6,9 +6,9 @@ - + - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -39,7 +39,7 @@ typedef private_node_allocator< T2, SegmentManager, NodesPerBlock > other; };
    -

    Description

    +

    Description

    Obtains private_node_allocator from private_node_allocator

    @@ -53,7 +53,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/rbtree_best_fit.html b/doc/html/boost/interprocess/rbtree_best_fit.html index 01b6547d0b..5c0044badd 100644 --- a/doc/html/boost/interprocess/rbtree_best_fit.html +++ b/doc/html/boost/interprocess/rbtree_best_fit.html @@ -43,100 +43,100 @@ typedef unspecified size_type; // construct/copy/destruct - rbtree_best_fit(size_type, size_type); - ~rbtree_best_fit(); + rbtree_best_fit(size_type, size_type); + ~rbtree_best_fit(); - // public member functions - void * allocate(size_type); - void deallocate(void *); - size_type get_size() const; - size_type get_free_memory() const; - void zero_free_memory(); - void grow(size_type); - void shrink_to_fit(); - bool all_memory_deallocated(); - bool check_sanity(); + // public member functions + void * allocate(size_type); + void deallocate(void *); + size_type get_size() const; + size_type get_free_memory() const; + void zero_free_memory(); + void grow(size_type); + void shrink_to_fit(); + bool all_memory_deallocated(); + bool check_sanity(); template<typename T> - T * allocation_command(boost::interprocess::allocation_type, size_type, + T * allocation_command(boost::interprocess::allocation_type, size_type, size_type &, T *&); - void * raw_allocation_command(boost::interprocess::allocation_type, + void * raw_allocation_command(boost::interprocess::allocation_type, size_type, size_type &, void *&, size_type = 1); - size_type size(const void *) const; - void * allocate_aligned(size_type, size_type); + size_type size(const void *) const; + void * allocate_aligned(size_type, size_type); - // public static functions - static size_type get_min_size(size_type); + // public static functions + static size_type get_min_size(size_type); // public data members static const size_type PayloadPerAllocation; };
    -

    Description

    +

    Description

    This class implements an algorithm that stores the free nodes in a red-black tree to have logarithmic search/insert times.

    -

    +

    rbtree_best_fit public construct/copy/destruct

    1. -
      rbtree_best_fit(size_type size, size_type extra_hdr_bytes);
      +
      rbtree_best_fit(size_type size, size_type extra_hdr_bytes);

      Constructor. "size" is the total size of the managed memory segment, "extra_hdr_bytes" indicates the extra bytes beginning in the sizeof(rbtree_best_fit) offset that the allocator should not use at all.

    2. -
      ~rbtree_best_fit();
      Destructor.
      3. +
      ~rbtree_best_fit();
      Destructor.
    -

    -rbtree_best_fit public member functions

    +

    +rbtree_best_fit public member functions

    1. -
      void * allocate(size_type nbytes);
      Allocates bytes, returns 0 if there is not more memory.
      2. +
      void * allocate(size_type nbytes);
      Allocates bytes, returns 0 if there is not more memory.
    2. -
      void deallocate(void * addr);
      Deallocates previously allocated bytes.
      3. +
      void deallocate(void * addr);
      Deallocates previously allocated bytes.
    3. -
      size_type get_size() const;
      Returns the size of the memory segment.
      4. +
      size_type get_size() const;
      Returns the size of the memory segment.
    4. -
      size_type get_free_memory() const;
      Returns the number of free bytes of the segment.
      5. +
      size_type get_free_memory() const;
      Returns the number of free bytes of the segment.
    5. -
      void zero_free_memory();
      +
      void zero_free_memory();

      Initializes to zero all the memory that's not in use. This function is normally used for security reasons.

    6. -
      void grow(size_type extra_size);
      +
      void grow(size_type extra_size);

      Increases managed memory in extra_size bytes more

    7. -
      void shrink_to_fit();
      Decreases managed memory as much as possible.
      8. +
      void shrink_to_fit();
      Decreases managed memory as much as possible.
    8. -
      bool all_memory_deallocated();
      Returns true if all allocated memory has been deallocated.
      9. +
      bool all_memory_deallocated();
      Returns true if all allocated memory has been deallocated.
    9. -
      bool check_sanity();
      +
      bool check_sanity();

      Makes an internal sanity check and returns true if success 

    10. template<typename T> 
-  T * allocation_command(boost::interprocess::allocation_type command, 
+  T * allocation_command(boost::interprocess::allocation_type command, 
                          size_type limit_size, 
                          size_type & prefer_in_recvd_out_size, T *& reuse);
      11. -
    11. void * raw_allocation_command(boost::interprocess::allocation_type command, 
+
    12. void * raw_allocation_command(boost::interprocess::allocation_type command, 
                               size_type limit_object, 
                               size_type & prefer_in_recvd_out_size, 
                               void *& reuse_ptr, size_type sizeof_object = 1);
      13. 
 
    13. 
-
      size_type size(const void * ptr) const;
      Returns the size of the buffer previously allocated pointed by ptr. 
      14. 
+
      size_type size(const void * ptr) const;
      Returns the size of the buffer previously allocated pointed by ptr.
    14. -
      void * allocate_aligned(size_type nbytes, size_type alignment);
      +
      void * allocate_aligned(size_type nbytes, size_type alignment);

      Allocates aligned bytes, returns 0 if there is not more memory. Alignment must be power of 2

    -

    -rbtree_best_fit public static functions

    +

    +rbtree_best_fit public static functions

    1. -
      static size_type get_min_size(size_type extra_hdr_bytes);
      Obtains the minimum size needed by the algorithm.
    +
    static size_type get_min_size(size_type extra_hdr_bytes);
    Obtains the minimum size needed by the algorithm.
    diff --git a/doc/html/boost/interprocess/scoped_lock.html b/doc/html/boost/interprocess/scoped_lock.html index 47bc9cd7c3..89158fb178 100644 --- a/doc/html/boost/interprocess/scoped_lock.html +++ b/doc/html/boost/interprocess/scoped_lock.html @@ -39,142 +39,142 @@ typedef Mutex mutex_type; // construct/copy/destruct - scoped_lock(); - explicit scoped_lock(mutex_type &); - scoped_lock(mutex_type &, defer_lock_type); - scoped_lock(mutex_type &, accept_ownership_type); - scoped_lock(mutex_type &, try_to_lock_type); - scoped_lock(mutex_type &, const boost::posix_time::ptime &); - scoped_lock(scoped_lock &&); + scoped_lock(); + explicit scoped_lock(mutex_type &); + scoped_lock(mutex_type &, defer_lock_type); + scoped_lock(mutex_type &, accept_ownership_type); + scoped_lock(mutex_type &, try_to_lock_type); + scoped_lock(mutex_type &, const boost::posix_time::ptime &); + scoped_lock(scoped_lock &&); template<typename T> - explicit scoped_lock(upgradable_lock< T > &&, unspecified = 0); + explicit scoped_lock(upgradable_lock< T > &&, unspecified = 0); template<typename T> - scoped_lock(upgradable_lock< T > &&, try_to_lock_type, unspecified = 0); + scoped_lock(upgradable_lock< T > &&, try_to_lock_type, unspecified = 0); template<typename T> - scoped_lock(upgradable_lock< T > &&, boost::posix_time::ptime &, + scoped_lock(upgradable_lock< T > &&, boost::posix_time::ptime &, unspecified = 0); template<typename T> - scoped_lock(sharable_lock< T > &&, try_to_lock_type, unspecified = 0); - scoped_lock & operator=(scoped_lock &&); - ~scoped_lock(); + scoped_lock(sharable_lock< T > &&, try_to_lock_type, unspecified = 0); + scoped_lock & operator=(scoped_lock &&); + ~scoped_lock(); - // public member functions - void lock(); - *bool try_lock(); - *bool timed_lock(const boost::posix_time::ptime &); - *void unlock(); - bool owns() const; - operator unspecified_bool_type() const; - mutex_type * mutex() const; - mutex_type * release(); - void swap(scoped_lock< mutex_type > &); + // public member functions + void lock(); + *bool try_lock(); + *bool timed_lock(const boost::posix_time::ptime &); + *void unlock(); + bool owns() const; + operator unspecified_bool_type() const; + mutex_type * mutex() const; + mutex_type * release(); + void swap(scoped_lock< mutex_type > &); };
    -

    Description

    +

    Description

    scoped_lock is meant to carry out the tasks for locking, unlocking, try-locking and timed-locking (recursive or not) for the Mutex. The Mutex need not supply all of this functionality. If the client of scoped_lock<Mutex> does not use functionality which the Mutex does not supply, no harm is done. Mutex ownership transfer is supported through the syntax of move semantics. Ownership transfer is allowed both by construction and assignment. The scoped_lock does not support copy semantics. A compile time error results if copy construction or copy assignment is attempted. Mutex ownership can also be moved from an upgradable_lock and sharable_lock via constructor. In this role, scoped_lock shares the same functionality as a write_lock.

    -

    +

    scoped_lock public construct/copy/destruct

    1. -
      scoped_lock();
      +
      scoped_lock();

      Effects: Default constructs a scoped_lock. Postconditions: owns() == false and mutex() == 0.

    2. -
      explicit scoped_lock(mutex_type & m);
      +
      explicit scoped_lock(mutex_type & m);

      Effects: m.lock(). Postconditions: owns() == true and mutex() == &m. Notes: The constructor will take ownership of the mutex. If another thread already owns the mutex, this thread will block until the mutex is released. Whether or not this constructor handles recursive locking depends upon the mutex.

    3. -
      scoped_lock(mutex_type & m, defer_lock_type);
      +
      scoped_lock(mutex_type & m, defer_lock_type);

      Postconditions: owns() == false, and mutex() == &m. Notes: The constructor will not take ownership of the mutex. There is no effect required on the referenced mutex.

    4. -
      scoped_lock(mutex_type & m, accept_ownership_type);
      +
      scoped_lock(mutex_type & m, accept_ownership_type);

      Postconditions: owns() == true, and mutex() == &m. Notes: The constructor will suppose that the mutex is already locked. There is no effect required on the referenced mutex.

    5. -
      scoped_lock(mutex_type & m, try_to_lock_type);
      +
      scoped_lock(mutex_type & m, try_to_lock_type);

      Effects: m.try_lock(). Postconditions: mutex() == &m. owns() == the return value of the m.try_lock() executed within the constructor. Notes: The constructor will take ownership of the mutex if it can do so without waiting. Whether or not this constructor handles recursive locking depends upon the mutex. If the mutex_type does not support try_lock, this constructor will fail at compile time if instantiated, but otherwise have no effect.

    6. -
      scoped_lock(mutex_type & m, const boost::posix_time::ptime & abs_time);
      +
      scoped_lock(mutex_type & m, const boost::posix_time::ptime & abs_time);

      Effects: m.timed_lock(abs_time). Postconditions: mutex() == &m. owns() == the return value of the m.timed_lock(abs_time) executed within the constructor. Notes: The constructor will take ownership of the mutex if it can do it until abs_time is reached. Whether or not this constructor handles recursive locking depends upon the mutex. If the mutex_type does not support try_lock, this constructor will fail at compile time if instantiated, but otherwise have no effect.

    7. -
      scoped_lock(scoped_lock && scop);
      +
      scoped_lock(scoped_lock && scop);

      Postconditions: mutex() == the value scop.mutex() had before the constructor executes. s1.mutex() == 0. owns() == the value of scop.owns() before the constructor executes. scop.owns(). Notes: If the scop scoped_lock owns the mutex, ownership is moved to thisscoped_lock with no blocking. If the scop scoped_lock does not own the mutex, then neither will this scoped_lock. Only a moved scoped_lock's will match this signature. An non-moved scoped_lock can be moved with the expression: "boost::move(lock);". This constructor does not alter the state of the mutex, only potentially who owns it. 

    8. template<typename T> 
-  explicit scoped_lock(upgradable_lock< T > && upgr, unspecified = 0);
      + explicit scoped_lock(upgradable_lock< T > && upgr, unspecified = 0);

      Effects: If upgr.owns() then calls unlock_upgradable_and_lock() on the referenced mutex. upgr.release() is called. Postconditions: mutex() == the value upgr.mutex() had before the construction. upgr.mutex() == 0. owns() == upgr.owns() before the construction. upgr.owns() == false after the construction. Notes: If upgr is locked, this constructor will lock this scoped_lock while unlocking upgr. If upgr is unlocked, then this scoped_lock will be unlocked as well. Only a moved upgradable_lock's will match this signature. An non-moved upgradable_lock can be moved with the expression: "boost::move(lock);" This constructor may block if other threads hold a sharable_lock on this mutex (sharable_lock's can share ownership with an upgradable_lock). 

    9. template<typename T> 
-  scoped_lock(upgradable_lock< T > && upgr, try_to_lock_type, unspecified = 0);
      + scoped_lock(upgradable_lock< T > && upgr, try_to_lock_type, unspecified = 0);

      Effects: If upgr.owns() then calls try_unlock_upgradable_and_lock() on the referenced mutex: a)if try_unlock_upgradable_and_lock() returns true then mutex() obtains the value from upgr.release() and owns() is set to true. b)if try_unlock_upgradable_and_lock() returns false then upgr is unaffected and this scoped_lock construction as the same effects as a default construction. c)Else upgr.owns() is false. mutex() obtains the value from upgr.release() and owns() is set to false Notes: This construction will not block. It will try to obtain mutex ownership from upgr immediately, while changing the lock type from a "read lock" to a "write lock". If the "read lock" isn't held in the first place, the mutex merely changes type to an unlocked "write lock". If the "read lock" is held, then mutex transfer occurs only if it can do so in a non-blocking manner. 

    10. template<typename T> 
-  scoped_lock(upgradable_lock< T > && upgr, 
+  scoped_lock(upgradable_lock< T > && upgr, 
               boost::posix_time::ptime & abs_time, unspecified = 0);

      Effects: If upgr.owns() then calls timed_unlock_upgradable_and_lock(abs_time) on the referenced mutex: a)if timed_unlock_upgradable_and_lock(abs_time) returns true then mutex() obtains the value from upgr.release() and owns() is set to true. b)if timed_unlock_upgradable_and_lock(abs_time) returns false then upgr is unaffected and this scoped_lock construction as the same effects as a default construction. c)Else upgr.owns() is false. mutex() obtains the value from upgr.release() and owns() is set to false Notes: This construction will not block. It will try to obtain mutex ownership from upgr immediately, while changing the lock type from a "read lock" to a "write lock". If the "read lock" isn't held in the first place, the mutex merely changes type to an unlocked "write lock". If the "read lock" is held, then mutex transfer occurs only if it can do so in a non-blocking manner. 

    11. template<typename T> 
-  scoped_lock(sharable_lock< T > && shar, try_to_lock_type, unspecified = 0);
      + scoped_lock(sharable_lock< T > && shar, try_to_lock_type, unspecified = 0);

      Effects: If shar.owns() then calls try_unlock_sharable_and_lock() on the referenced mutex. a)if try_unlock_sharable_and_lock() returns true then mutex() obtains the value from shar.release() and owns() is set to true. b)if try_unlock_sharable_and_lock() returns false then shar is unaffected and this scoped_lock construction has the same effects as a default construction. c)Else shar.owns() is false. mutex() obtains the value from shar.release() and owns() is set to false Notes: This construction will not block. It will try to obtain mutex ownership from shar immediately, while changing the lock type from a "read lock" to a "write lock". If the "read lock" isn't held in the first place, the mutex merely changes type to an unlocked "write lock". If the "read lock" is held, then mutex transfer occurs only if it can do so in a non-blocking manner.

    12. -
      scoped_lock & operator=(scoped_lock && scop);
      +
      scoped_lock & operator=(scoped_lock && scop);

      Effects: If owns() before the call, then unlock() is called on mutex(). *this gets the state of scop and scop gets set to a default constructed state. Notes: With a recursive mutex it is possible that both this and scop own the same mutex before the assignment. In this case, this will own the mutex after the assignment (and scop will not), but the mutex's lock count will be decremented by one.

    13. -
      ~scoped_lock();
      +
      ~scoped_lock();

      Effects: if (owns()) mp_mutex->unlock(). Notes: The destructor behavior ensures that the mutex lock is not leaked.

    -

    -scoped_lock public member functions

    +

    +scoped_lock public member functions

    1. -
      void lock();
      +
      void lock();

      Effects: If mutex() == 0 or if already locked, throws a lock_exception() exception. Calls lock() on the referenced mutex. Postconditions: owns() == true. Notes: The scoped_lock changes from a state of not owning the mutex, to owning the mutex, blocking if necessary.

    2. -
      *bool try_lock();
      +
      *bool try_lock();

      Effects: If mutex() == 0 or if already locked, throws a lock_exception() exception. Calls try_lock() on the referenced mutex. Postconditions: owns() == the value returned from mutex()->try_lock(). Notes: The scoped_lock changes from a state of not owning the mutex, to owning the mutex, but only if blocking was not required. If the mutex_type does not support try_lock(), this function will fail at compile time if instantiated, but otherwise have no effect.

    3. -
      *bool timed_lock(const boost::posix_time::ptime & abs_time);
      +
      *bool timed_lock(const boost::posix_time::ptime & abs_time);

      Effects: If mutex() == 0 or if already locked, throws a lock_exception() exception. Calls timed_lock(abs_time) on the referenced mutex. Postconditions: owns() == the value returned from mutex()-> timed_lock(abs_time). Notes: The scoped_lock changes from a state of not owning the mutex, to owning the mutex, but only if it can obtain ownership by the specified time. If the mutex_type does not support timed_lock (), this function will fail at compile time if instantiated, but otherwise have no effect.

    4. -
      *void unlock();
      +
      *void unlock();

      Effects: If mutex() == 0 or if not locked, throws a lock_exception() exception. Calls unlock() on the referenced mutex. Postconditions: owns() == false. Notes: The scoped_lock changes from a state of owning the mutex, to not owning the mutex.

    5. -
      bool owns() const;
      +
      bool owns() const;

      Effects: Returns true if this scoped_lock has acquired the referenced mutex.

    6. -
      operator unspecified_bool_type() const;
      +
      operator unspecified_bool_type() const;

      Conversion to bool. Returns owns().

    7. -
      mutex_type * mutex() const;
      +
      mutex_type * mutex() const;

      Effects: Returns a pointer to the referenced mutex, or 0 if there is no mutex to reference.

    8. -
      mutex_type * release();
      +
      mutex_type * release();

      Effects: Returns a pointer to the referenced mutex, or 0 if there is no mutex to reference. Postconditions: mutex() == 0 and owns() == false.

    9. -
      void swap(scoped_lock< mutex_type > & other);
      +
      void swap(scoped_lock< mutex_type > & other);

      Effects: Swaps state with moved lock. Throws: Nothing.

    diff --git a/doc/html/boost/interprocess/scoped_ptr.html b/doc/html/boost/interprocess/scoped_ptr.html index 22ad343781..3b13ec601b 100644 --- a/doc/html/boost/interprocess/scoped_ptr.html +++ b/doc/html/boost/interprocess/scoped_ptr.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -42,87 +42,87 @@ typedef pointer this_type::* unspecified_bool_type; // construct/copy/destruct - explicit scoped_ptr(const pointer & = 0, const Deleter & = Deleter()); - ~scoped_ptr(); + explicit scoped_ptr(const pointer & = 0, const Deleter & = Deleter()); + ~scoped_ptr(); - // public member functions - void reset(const pointer & = 0); - void reset(const pointer &, const Deleter &); - pointer release(); - reference operator*() const; - pointer & operator->(); - const pointer & operator->() const; - pointer & get(); - const pointer & get() const; - operator unspecified_bool_type() const; - bool operator!() const; - void swap(scoped_ptr &); + // public member functions + void reset(const pointer & = 0); + void reset(const pointer &, const Deleter &); + pointer release(); + reference operator*() const; + pointer & operator->(); + const pointer & operator->() const; + pointer & get(); + const pointer & get() const; + operator unspecified_bool_type() const; + bool operator!() const; + void swap(scoped_ptr &); };
    -

    Description

    +

    Description

    scoped_ptr stores a pointer to a dynamically allocated object. The object pointed to is guaranteed to be deleted, either on destruction of the scoped_ptr, or via an explicit reset. The user can avoid this deletion using release(). scoped_ptr is parameterized on T (the type of the object pointed to) and Deleter (the functor to be executed to delete the internal pointer). The internal pointer will be of the same pointer type as typename Deleter::pointer type (that is, if typename Deleter::pointer is offset_ptr<void>, the internal pointer will be offset_ptr<T>).

    -

    +

    scoped_ptr public construct/copy/destruct

    1. -
      explicit scoped_ptr(const pointer & p = 0, const Deleter & d = Deleter());
      +
      explicit scoped_ptr(const pointer & p = 0, const Deleter & d = Deleter());

      Constructs a scoped_ptr, storing a copy of p(which can be 0) and d. Does not throw.

    2. -
      ~scoped_ptr();
      +
      ~scoped_ptr();

      If the stored pointer is not 0, destroys the object pointed to by the stored pointer. calling the operator() of the stored deleter. Never throws

    -

    -scoped_ptr public member functions

    +

    +scoped_ptr public member functions

    1. -
      void reset(const pointer & p = 0);
      +
      void reset(const pointer & p = 0);

      Deletes the object pointed to by the stored pointer and then stores a copy of p. Never throws

    2. -
      void reset(const pointer & p, const Deleter & d);
      +
      void reset(const pointer & p, const Deleter & d);

      Deletes the object pointed to by the stored pointer and then stores a copy of p and a copy of d.

    3. -
      pointer release();
      +
      pointer release();

      Assigns internal pointer as 0 and returns previous pointer. This will avoid deletion on destructor

    4. -
      reference operator*() const;
      +
      reference operator*() const;

      Returns a reference to the object pointed to by the stored pointer. Never throws.

    5. -
      pointer & operator->();
      +
      pointer & operator->();

      Returns the internal stored pointer. Never throws.

    6. -
      const pointer & operator->() const;
      +
      const pointer & operator->() const;

      Returns the internal stored pointer. Never throws.

    7. -
      pointer & get();
      +
      pointer & get();

      Returns the stored pointer. Never throws.

    8. -
      const pointer & get() const;
      +
      const pointer & get() const;

      Returns the stored pointer. Never throws.

    9. -
      operator unspecified_bool_type() const;
      +
      operator unspecified_bool_type() const;

      Conversion to bool Never throws

    10. -
      bool operator!() const;
      +
      bool operator!() const;

      Returns true if the stored pointer is 0. Never throws.

    11. -
      void swap(scoped_ptr & b);
      +
      void swap(scoped_ptr & b);

      Exchanges the internal pointer and deleter with other scoped_ptr Never throws.

    @@ -139,7 +139,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/segment_manager.html b/doc/html/boost/interprocess/segment_manager.html index 2e06e4e5ce..a236578279 100644 --- a/doc/html/boost/interprocess/segment_manager.html +++ b/doc/html/boost/interprocess/segment_manager.html @@ -62,207 +62,207 @@ }; // construct/copy/destruct - explicit segment_manager(size_type); + explicit segment_manager(size_type); - // public member functions - template<typename T> std::pair< T *, size_type > find(char_ptr_holder_t); + // public member functions + template<typename T> std::pair< T *, size_type > find(char_ptr_holder_t); template<typename T> - std::pair< T *, size_type > find_no_lock(char_ptr_holder_t); - template<typename T> construct_proxy< T >::type construct(char_ptr_holder_t); + std::pair< T *, size_type > find_no_lock(char_ptr_holder_t); + template<typename T> construct_proxy< T >::type construct(char_ptr_holder_t); template<typename T> - construct_proxy< T >::type find_or_construct(char_ptr_holder_t); + construct_proxy< T >::type find_or_construct(char_ptr_holder_t); template<typename T> construct_proxy< T >::type - construct(char_ptr_holder_t, const std::nothrow_t &); + construct(char_ptr_holder_t, const std::nothrow_t &); template<typename T> construct_proxy< T >::type - find_or_construct(char_ptr_holder_t, const std::nothrow_t &); + find_or_construct(char_ptr_holder_t, const std::nothrow_t &); template<typename T> - construct_iter_proxy< T >::type construct_it(char_ptr_holder_t); + construct_iter_proxy< T >::type construct_it(char_ptr_holder_t); template<typename T> - construct_iter_proxy< T >::type find_or_construct_it(char_ptr_holder_t); + construct_iter_proxy< T >::type find_or_construct_it(char_ptr_holder_t); template<typename T> construct_iter_proxy< T >::type - construct_it(char_ptr_holder_t, const std::nothrow_t &); + construct_it(char_ptr_holder_t, const std::nothrow_t &); template<typename T> construct_iter_proxy< T >::type - find_or_construct_it(char_ptr_holder_t, const std::nothrow_t &); - template<typename Func> void atomic_func(Func &); - template<typename Func> bool try_atomic_func(Func &); - template<typename T> bool destroy(char_ptr_holder_t); - template<typename T> void destroy_ptr(const T *); - void reserve_named_objects(size_type); - void reserve_unique_objects(size_type); - void shrink_to_fit_indexes(); - size_type get_num_named_objects(); - size_type get_num_unique_objects(); - const_named_iterator named_begin() const; - const_named_iterator named_end() const; - const_unique_iterator unique_begin() const; - const_unique_iterator unique_end() const; - template<typename T> allocator< T >::type get_allocator(); - template<typename T> deleter< T >::type get_deleter(); + find_or_construct_it(char_ptr_holder_t, const std::nothrow_t &); + template<typename Func> void atomic_func(Func &); + template<typename Func> bool try_atomic_func(Func &); + template<typename T> bool destroy(char_ptr_holder_t); + template<typename T> void destroy_ptr(const T *); + void reserve_named_objects(size_type); + void reserve_unique_objects(size_type); + void shrink_to_fit_indexes(); + size_type get_num_named_objects(); + size_type get_num_unique_objects(); + const_named_iterator named_begin() const; + const_named_iterator named_end() const; + const_unique_iterator unique_begin() const; + const_unique_iterator unique_end() const; + template<typename T> allocator< T >::type get_allocator(); + template<typename T> deleter< T >::type get_deleter(); - // public static functions - template<typename T> static const CharType * get_instance_name(const T *); - template<typename T> static size_type get_instance_length(const T *); - template<typename T> static instance_type get_instance_type(const T *); - static size_type get_min_size(); + // public static functions + template<typename T> static const CharType * get_instance_name(const T *); + template<typename T> static size_type get_instance_length(const T *); + template<typename T> static instance_type get_instance_type(const T *); + static size_type get_min_size(); // public data members static const size_type PayloadPerAllocation; };
    -

    Description

    +

    Description

    This object is placed in the beginning of memory segment and implements the allocation (named or anonymous) of portions of the segment. This object contains two indexes that maintain an association between a name and a portion of the segment.

    The first index contains the mappings for normal named objects using the char type specified in the template parameter.

    The second index contains the association for unique instances. The key will be the const char * returned from type_info.name() function for the unique type to be constructed.

    segment_manager<CharType, MemoryAlgorithm, IndexType> inherits publicly from segment_manager_base<MemoryAlgorithm> and inherits from it many public functions related to anonymous object and raw memory allocation. See segment_manager_base reference to know about those functions.

    -

    +

    segment_manager public construct/copy/destruct

    1. -
      explicit segment_manager(size_type segment_size);
      +
      explicit segment_manager(size_type segment_size);

      Constructor of the segment manager "size" is the size of the memory segment where the segment manager is being constructed. Can throw

    -

    -segment_manager public member functions

    +

    +segment_manager public member functions

    1. -
      template<typename T> std::pair< T *, size_type > find(char_ptr_holder_t name);
      +
      template<typename T> std::pair< T *, size_type > find(char_ptr_holder_t name);

      Tries to find a previous named/unique allocation. Returns the address and the object count. On failure the first member of the returned pair is 0. 

    2. template<typename T> 
-  std::pair< T *, size_type > find_no_lock(char_ptr_holder_t name);
      + std::pair< T *, size_type > find_no_lock(char_ptr_holder_t name);

      Tries to find a previous named/unique allocation. Returns the address and the object count. On failure the first member of the returned pair is 0. This search is not mutex-protected! Use it only inside atomic_func() calls, where the internal mutex is guaranteed to be locked. 

    3. template<typename T> 
-  construct_proxy< T >::type construct(char_ptr_holder_t name);
      + construct_proxy< T >::type construct(char_ptr_holder_t name);

      Returns throwing "construct" proxy object 

    4. template<typename T> 
-  construct_proxy< T >::type find_or_construct(char_ptr_holder_t name);
      + construct_proxy< T >::type find_or_construct(char_ptr_holder_t name);

      Returns throwing "search or construct" proxy object 

    5. template<typename T> 
   construct_proxy< T >::type 
-  construct(char_ptr_holder_t name, const std::nothrow_t &);
      + construct(char_ptr_holder_t name, const std::nothrow_t &);

      Returns no throwing "construct" proxy object 

    6. template<typename T> 
   construct_proxy< T >::type 
-  find_or_construct(char_ptr_holder_t name, const std::nothrow_t &);
      + find_or_construct(char_ptr_holder_t name, const std::nothrow_t &);

      Returns no throwing "search or construct" proxy object 

    7. template<typename T> 
-  construct_iter_proxy< T >::type construct_it(char_ptr_holder_t name);
      Returns throwing "construct from iterators" proxy object.
      8. + construct_iter_proxy< T >::type construct_it(char_ptr_holder_t name);Returns throwing "construct from iterators" proxy object. 
    8. template<typename T> 
-  construct_iter_proxy< T >::type find_or_construct_it(char_ptr_holder_t name);
      + construct_iter_proxy< T >::type find_or_construct_it(char_ptr_holder_t name);

      Returns throwing "search or construct from iterators" proxy object 

    9. template<typename T> 
   construct_iter_proxy< T >::type 
-  construct_it(char_ptr_holder_t name, const std::nothrow_t &);
      + construct_it(char_ptr_holder_t name, const std::nothrow_t &);

      Returns no throwing "construct from iterators" proxy object 

    10. template<typename T> 
   construct_iter_proxy< T >::type 
-  find_or_construct_it(char_ptr_holder_t name, const std::nothrow_t &);
      + find_or_construct_it(char_ptr_holder_t name, const std::nothrow_t &);

      Returns no throwing "search or construct from iterators" proxy object

    11. -
      template<typename Func> void atomic_func(Func & f);
      +
      template<typename Func> void atomic_func(Func & f);

      Calls object function blocking recursive interprocess_mutex and guarantees that no new named_alloc or destroy will be executed by any process while executing the object function call

    12. -
      template<typename Func> bool try_atomic_func(Func & f);
      +
      template<typename Func> bool try_atomic_func(Func & f);

      Tries to calls a functor guaranteeing that no new construction, search or destruction will be executed by any process while executing the object function call. If the atomic function can't be immediatelly executed because the internal mutex is already locked, returns false. If the functor throws, this function throws.

    13. -
      template<typename T> bool destroy(char_ptr_holder_t name);
      +
      template<typename T> bool destroy(char_ptr_holder_t name);

      Destroys a previously created named/unique instance. Returns false if the object was not present.

    14. -
      template<typename T> void destroy_ptr(const T * p);
      +
      template<typename T> void destroy_ptr(const T * p);

      Destroys an anonymous, unique or named object using its address

    15. -
      void reserve_named_objects(size_type num);
      +
      void reserve_named_objects(size_type num);

      Preallocates needed index resources to optimize the creation of "num" named objects in the managed memory segment. Can throw boost::interprocess::bad_alloc if there is no enough memory.

    16. -
      void reserve_unique_objects(size_type num);
      +
      void reserve_unique_objects(size_type num);

      Preallocates needed index resources to optimize the creation of "num" unique objects in the managed memory segment. Can throw boost::interprocess::bad_alloc if there is no enough memory.

    17. -
      void shrink_to_fit_indexes();
      +
      void shrink_to_fit_indexes();

      Calls shrink_to_fit in both named and unique object indexes to try to free unused memory from those indexes.

    18. -
      size_type get_num_named_objects();
      +
      size_type get_num_named_objects();

      Returns the number of named objects stored in the segment.

    19. -
      size_type get_num_unique_objects();
      +
      size_type get_num_unique_objects();

      Returns the number of unique objects stored in the segment.

    20. -
      const_named_iterator named_begin() const;
      +
      const_named_iterator named_begin() const;

      Returns a constant iterator to the beginning of the information about the named allocations performed in this segment manager

    21. -
      const_named_iterator named_end() const;
      +
      const_named_iterator named_end() const;

      Returns a constant iterator to the end of the information about the named allocations performed in this segment manager

    22. -
      const_unique_iterator unique_begin() const;
      +
      const_unique_iterator unique_begin() const;

      Returns a constant iterator to the beginning of the information about the unique allocations performed in this segment manager

    23. -
      const_unique_iterator unique_end() const;
      +
      const_unique_iterator unique_end() const;

      Returns a constant iterator to the end of the information about the unique allocations performed in this segment manager

    24. -
      template<typename T> allocator< T >::type get_allocator();
      +
      template<typename T> allocator< T >::type get_allocator();

      Returns an instance of the default allocator for type T initialized that allocates memory from this segment manager.

    25. -
      template<typename T> deleter< T >::type get_deleter();
      +
      template<typename T> deleter< T >::type get_deleter();

      Returns an instance of the default deleter for type T that will delete an object constructed in this segment manager.

    -

    -segment_manager public static functions

    +

    +segment_manager public static functions

    1. -
      template<typename T> static const CharType * get_instance_name(const T * ptr);
      +
      template<typename T> static const CharType * get_instance_name(const T * ptr);

      Returns the name of an object created with construct/find_or_construct functions. Does not throw

    2. -
      template<typename T> static size_type get_instance_length(const T * ptr);
      +
      template<typename T> static size_type get_instance_length(const T * ptr);

      Returns the length of an object created with construct/find_or_construct functions. Does not throw.

    3. -
      template<typename T> static instance_type get_instance_type(const T * ptr);
      +
      template<typename T> static instance_type get_instance_type(const T * ptr);

      Returns is the the name of an object created with construct/find_or_construct functions. Does not throw

    4. -
      static size_type get_min_size();
      +
      static size_type get_min_size();

      Obtains the minimum size needed by the segment manager

    diff --git a/doc/html/boost/interprocess/segment_manager/allocator.html b/doc/html/boost/interprocess/segment_manager/allocator.html index 1678a79983..4c966de56b 100644 --- a/doc/html/boost/interprocess/segment_manager/allocator.html +++ b/doc/html/boost/interprocess/segment_manager/allocator.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -39,7 +39,7 @@ typedef boost::interprocess::allocator< T, segment_manager > type; };
    -

    Description

    +

    Description

    This is the default allocator to allocate types T from this managed segment

    @@ -53,7 +53,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/segment_manager/deleter.html b/doc/html/boost/interprocess/segment_manager/deleter.html index f864787ab7..c739857588 100644 --- a/doc/html/boost/interprocess/segment_manager/deleter.html +++ b/doc/html/boost/interprocess/segment_manager/deleter.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -39,7 +39,7 @@ typedef boost::interprocess::deleter< T, segment_manager > type; };
    -

    Description

    +

    Description

    This is the default deleter to delete types T from this managed segment.

    @@ -53,7 +53,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/segment_manager_base.html b/doc/html/boost/interprocess/segment_manager_base.html index 4c11f5bf8d..dfb8647964 100644 --- a/doc/html/boost/interprocess/segment_manager_base.html +++ b/doc/html/boost/interprocess/segment_manager_base.html @@ -42,40 +42,40 @@ typedef MemoryAlgorithm memory_algorithm; // construct/copy/destruct - segment_manager_base(size_type, size_type); + segment_manager_base(size_type, size_type); - // public member functions - size_type get_size() const; - size_type get_free_memory() const; - void * allocate(size_type, const std::nothrow_t &); - void * allocate(size_type); - void * allocate_aligned(size_type, size_type, const std::nothrow_t &); - void * allocate_aligned(size_type, size_type); - void deallocate(void *); - void grow(size_type); - void shrink_to_fit(); - bool all_memory_deallocated(); - bool check_sanity(); - void zero_free_memory(); - size_type size(const void *) const; + // public member functions + size_type get_size() const; + size_type get_free_memory() const; + void * allocate(size_type, const std::nothrow_t &); + void * allocate(size_type); + void * allocate_aligned(size_type, size_type, const std::nothrow_t &); + void * allocate_aligned(size_type, size_type); + void deallocate(void *); + void grow(size_type); + void shrink_to_fit(); + bool all_memory_deallocated(); + bool check_sanity(); + void zero_free_memory(); + size_type size(const void *) const; - // public static functions - static size_type get_min_size(size_type); + // public static functions + static size_type get_min_size(size_type); // public data members static const size_type PayloadPerAllocation; };
    -

    Description

    +

    Description

    This object is the public base class of segment manager. This class only depends on the memory allocation algorithm and implements all the allocation features not related to named or unique objects.

    Storing a reference to segment_manager forces the holder class to be dependent on index types and character types. When such dependence is not desirable and only anonymous and raw allocations are needed, segment_manager_base is the correct answer.

    -

    +

    segment_manager_base public construct/copy/destruct

    1. -
      segment_manager_base(size_type sz, size_type reserved_bytes);
      +
      segment_manager_base(size_type sz, size_type reserved_bytes);

      Constructor of the segment_manager_base

      "size" is the size of the memory segment where the basic segment manager is being constructed.

      "reserved_bytes" is the number of bytes after the end of the memory algorithm object itself that the memory algorithm will exclude from dynamic allocation

      @@ -83,72 +83,72 @@
    -

    -segment_manager_base public member functions

    +

    +segment_manager_base public member functions

    1. -
      size_type get_size() const;
      +
      size_type get_size() const;

      Returns the size of the memory segment

    2. -
      size_type get_free_memory() const;
      +
      size_type get_free_memory() const;

      Returns the number of free bytes of the memory segment

    3. -
      void * allocate(size_type nbytes, const std::nothrow_t &);
      +
      void * allocate(size_type nbytes, const std::nothrow_t &);

      Allocates nbytes bytes. This function is only used in single-segment management. Never throws

    4. -
      void * allocate(size_type nbytes);
      +
      void * allocate(size_type nbytes);

      Allocates nbytes bytes. Throws boost::interprocess::bad_alloc on failure

    5. -
      void * allocate_aligned(size_type nbytes, size_type alignment, 
+
      void * allocate_aligned(size_type nbytes, size_type alignment, 
                         const std::nothrow_t &);
      
 
      Allocates nbytes bytes. This function is only used in single-segment management. Never throws
    6. -
      void * allocate_aligned(size_type nbytes, size_type alignment);
      +
      void * allocate_aligned(size_type nbytes, size_type alignment);

      Allocates nbytes bytes. This function is only used in single-segment management. Throws bad_alloc when fails

    7. -
      void deallocate(void * addr);
      +
      void deallocate(void * addr);

      Deallocates the bytes allocated with allocate/allocate_many() pointed by addr

    8. -
      void grow(size_type extra_size);
      +
      void grow(size_type extra_size);

      Increases managed memory in extra_size bytes more. This only works with single-segment management.

    9. -
      void shrink_to_fit();
      +
      void shrink_to_fit();

      Decreases managed memory to the minimum. This only works with single-segment management.

    10. -
      bool all_memory_deallocated();
      +
      bool all_memory_deallocated();

      Returns the result of "all_memory_deallocated()" function of the used memory algorithm

    11. -
      bool check_sanity();
      +
      bool check_sanity();

      Returns the result of "check_sanity()" function of the used memory algorithm

    12. -
      void zero_free_memory();
      +
      void zero_free_memory();

      Writes to zero free memory (memory not yet allocated) of the memory algorithm

    13. -
      size_type size(const void * ptr) const;
      Returns the size of the buffer previously allocated pointed by ptr.
      14. +
      size_type size(const void * ptr) const;
      Returns the size of the buffer previously allocated pointed by ptr.
    -

    -segment_manager_base public static functions

    +

    +segment_manager_base public static functions

    1. -
      static size_type get_min_size(size_type size);
      +
      static size_type get_min_size(size_type size);

      Obtains the minimum size needed by the segment manager

    -

    +

    segment_manager_base public public data members

    diff --git a/doc/html/boost/interprocess/sharable_lock.html b/doc/html/boost/interprocess/sharable_lock.html index c47c1212ac..1eabd24f49 100644 --- a/doc/html/boost/interprocess/sharable_lock.html +++ b/doc/html/boost/interprocess/sharable_lock.html @@ -39,123 +39,123 @@ typedef SharableMutex mutex_type; // construct/copy/destruct - sharable_lock(); - explicit sharable_lock(mutex_type &); - sharable_lock(mutex_type &, defer_lock_type); - sharable_lock(mutex_type &, accept_ownership_type); - sharable_lock(mutex_type &, try_to_lock_type); - sharable_lock(mutex_type &, const boost::posix_time::ptime &); - sharable_lock(sharable_lock< mutex_type > &&); - template<typename T> sharable_lock(upgradable_lock< T > &&, unspecified = 0); - template<typename T> sharable_lock(scoped_lock< T > &&, unspecified = 0); - sharable_lock & operator=(sharable_lock< mutex_type > &&); - ~sharable_lock(); + sharable_lock(); + explicit sharable_lock(mutex_type &); + sharable_lock(mutex_type &, defer_lock_type); + sharable_lock(mutex_type &, accept_ownership_type); + sharable_lock(mutex_type &, try_to_lock_type); + sharable_lock(mutex_type &, const boost::posix_time::ptime &); + sharable_lock(sharable_lock< mutex_type > &&); + template<typename T> sharable_lock(upgradable_lock< T > &&, unspecified = 0); + template<typename T> sharable_lock(scoped_lock< T > &&, unspecified = 0); + sharable_lock & operator=(sharable_lock< mutex_type > &&); + ~sharable_lock(); - // public member functions - void lock(); - bool try_lock(); - bool timed_lock(const boost::posix_time::ptime &); - void unlock(); - bool owns() const; - operator unspecified_bool_type() const; - mutex_type * mutex() const; - mutex_type * release(); - void swap(sharable_lock< mutex_type > &); + // public member functions + void lock(); + bool try_lock(); + bool timed_lock(const boost::posix_time::ptime &); + void unlock(); + bool owns() const; + operator unspecified_bool_type() const; + mutex_type * mutex() const; + mutex_type * release(); + void swap(sharable_lock< mutex_type > &); };
    -

    Description

    +

    Description

    sharable_lock is meant to carry out the tasks for sharable-locking (such as read-locking), unlocking, try-sharable-locking and timed-sharable-locking (recursive or not) for the Mutex. The Mutex need not supply all of this functionality. If the client of sharable_lock<Mutex> does not use functionality which the Mutex does not supply, no harm is done. Mutex ownership can be shared among sharable_locks, and a single upgradable_lock. sharable_lock does not support copy semantics. But sharable_lock supports ownership transfer from an sharable_lock, upgradable_lock and scoped_lock via transfer_lock syntax.

    -

    +

    sharable_lock public construct/copy/destruct

    1. -
      sharable_lock();
      +
      sharable_lock();

      Effects: Default constructs a sharable_lock. Postconditions: owns() == false and mutex() == 0.

    2. -
      explicit sharable_lock(mutex_type & m);
      +
      explicit sharable_lock(mutex_type & m);

      Effects: m.lock_sharable(). Postconditions: owns() == true and mutex() == &m. Notes: The constructor will take sharable-ownership of the mutex. If another thread already owns the mutex with exclusive ownership (scoped_lock), this thread will block until the mutex is released. If another thread owns the mutex with sharable or upgradable ownership, then no blocking will occur. Whether or not this constructor handles recursive locking depends upon the mutex.

    3. -
      sharable_lock(mutex_type & m, defer_lock_type);
      +
      sharable_lock(mutex_type & m, defer_lock_type);

      Postconditions: owns() == false, and mutex() == &m. Notes: The constructor will not take ownership of the mutex. There is no effect required on the referenced mutex.

    4. -
      sharable_lock(mutex_type & m, accept_ownership_type);
      +
      sharable_lock(mutex_type & m, accept_ownership_type);

      Postconditions: owns() == true, and mutex() == &m. Notes: The constructor will suppose that the mutex is already sharable locked. There is no effect required on the referenced mutex.

    5. -
      sharable_lock(mutex_type & m, try_to_lock_type);
      +
      sharable_lock(mutex_type & m, try_to_lock_type);

      Effects: m.try_lock_sharable() Postconditions: mutex() == &m. owns() == the return value of the m.try_lock_sharable() executed within the constructor. Notes: The constructor will take sharable-ownership of the mutex if it can do so without waiting. Whether or not this constructor handles recursive locking depends upon the mutex. If the mutex_type does not support try_lock_sharable, this constructor will fail at compile time if instantiated, but otherwise have no effect.

    6. -
      sharable_lock(mutex_type & m, const boost::posix_time::ptime & abs_time);
      +
      sharable_lock(mutex_type & m, const boost::posix_time::ptime & abs_time);

      Effects: m.timed_lock_sharable(abs_time) Postconditions: mutex() == &m. owns() == the return value of the m.timed_lock_sharable() executed within the constructor. Notes: The constructor will take sharable-ownership of the mutex if it can do so within the time specified. Whether or not this constructor handles recursive locking depends upon the mutex. If the mutex_type does not support timed_lock_sharable, this constructor will fail at compile time if instantiated, but otherwise have no effect.

    7. -
      sharable_lock(sharable_lock< mutex_type > && upgr);
      +
      sharable_lock(sharable_lock< mutex_type > && upgr);

      Postconditions: mutex() == upgr.mutex(). owns() == the value of upgr.owns() before the construction. upgr.owns() == false after the construction. Notes: If the upgr sharable_lock owns the mutex, ownership is moved to this sharable_lock with no blocking. If the upgr sharable_lock does not own the mutex, then neither will this sharable_lock. Only a moved sharable_lock's will match this signature. An non-moved sharable_lock can be moved with the expression: "boost::move(lock);". This constructor does not alter the state of the mutex, only potentially who owns it. 

    8. template<typename T> 
-  sharable_lock(upgradable_lock< T > && upgr, unspecified = 0);
      + sharable_lock(upgradable_lock< T > && upgr, unspecified = 0);

      Effects: If upgr.owns() then calls unlock_upgradable_and_lock_sharable() on the referenced mutex. Postconditions: mutex() == the value upgr.mutex() had before the construction. upgr.mutex() == 0 owns() == the value of upgr.owns() before construction. upgr.owns() == false after the construction. Notes: If upgr is locked, this constructor will lock this sharable_lock while unlocking upgr. Only a moved sharable_lock's will match this signature. An non-moved upgradable_lock can be moved with the expression: "boost::move(lock);".

    9. -
      template<typename T> sharable_lock(scoped_lock< T > && scop, unspecified = 0);
      +
      template<typename T> sharable_lock(scoped_lock< T > && scop, unspecified = 0);

      Effects: If scop.owns() then calls unlock_and_lock_sharable() on the referenced mutex. Postconditions: mutex() == the value scop.mutex() had before the construction. scop.mutex() == 0 owns() == scop.owns() before the constructor. After the construction, scop.owns() == false. Notes: If scop is locked, this constructor will transfer the exclusive ownership to a sharable-ownership of this sharable_lock. Only a moved scoped_lock's will match this signature. An non-moved scoped_lock can be moved with the expression: "boost::move(lock);".

    10. -
      sharable_lock & operator=(sharable_lock< mutex_type > && upgr);
      +
      sharable_lock & operator=(sharable_lock< mutex_type > && upgr);

      Effects: If owns() before the call, then unlock_sharable() is called on mutex(). *this gets the state of upgr and upgr gets set to a default constructed state. Notes: With a recursive mutex it is possible that both this and upgr own the mutex before the assignment. In this case, this will own the mutex after the assignment (and upgr will not), but the mutex's lock count will be decremented by one.

    11. -
      ~sharable_lock();
      +
      ~sharable_lock();

      Effects: if (owns()) mp_mutex->unlock_sharable(). Notes: The destructor behavior ensures that the mutex lock is not leaked.

    -

    -sharable_lock public member functions

    +

    +sharable_lock public member functions

    1. -
      void lock();
      +
      void lock();

      Effects: If mutex() == 0 or already locked, throws a lock_exception() exception. Calls lock_sharable() on the referenced mutex. Postconditions: owns() == true. Notes: The sharable_lock changes from a state of not owning the mutex, to owning the mutex, blocking if necessary.

    2. -
      bool try_lock();
      +
      bool try_lock();

      Effects: If mutex() == 0 or already locked, throws a lock_exception() exception. Calls try_lock_sharable() on the referenced mutex. Postconditions: owns() == the value returned from mutex()->try_lock_sharable(). Notes: The sharable_lock changes from a state of not owning the mutex, to owning the mutex, but only if blocking was not required. If the mutex_type does not support try_lock_sharable(), this function will fail at compile time if instantiated, but otherwise have no effect.

    3. -
      bool timed_lock(const boost::posix_time::ptime & abs_time);
      +
      bool timed_lock(const boost::posix_time::ptime & abs_time);

      Effects: If mutex() == 0 or already locked, throws a lock_exception() exception. Calls timed_lock_sharable(abs_time) on the referenced mutex. Postconditions: owns() == the value returned from mutex()->timed_lock_sharable(elps_time). Notes: The sharable_lock changes from a state of not owning the mutex, to owning the mutex, but only if it can obtain ownership within the specified time interval. If the mutex_type does not support timed_lock_sharable(), this function will fail at compile time if instantiated, but otherwise have no effect.

    4. -
      void unlock();
      +
      void unlock();

      Effects: If mutex() == 0 or not locked, throws a lock_exception() exception. Calls unlock_sharable() on the referenced mutex. Postconditions: owns() == false. Notes: The sharable_lock changes from a state of owning the mutex, to not owning the mutex.

    5. -
      bool owns() const;
      +
      bool owns() const;

      Effects: Returns true if this scoped_lock has acquired the referenced mutex.

    6. -
      operator unspecified_bool_type() const;
      +
      operator unspecified_bool_type() const;

      Conversion to bool. Returns owns().

    7. -
      mutex_type * mutex() const;
      +
      mutex_type * mutex() const;

      Effects: Returns a pointer to the referenced mutex, or 0 if there is no mutex to reference.

    8. -
      mutex_type * release();
      +
      mutex_type * release();

      Effects: Returns a pointer to the referenced mutex, or 0 if there is no mutex to reference. Postconditions: mutex() == 0 and owns() == false.

    9. -
      void swap(sharable_lock< mutex_type > & other);
      +
      void swap(sharable_lock< mutex_type > & other);

      Effects: Swaps state with moved lock. Throws: Nothing.

    diff --git a/doc/html/boost/interprocess/shared_memory_object.html b/doc/html/boost/interprocess/shared_memory_object.html index 9ad77f6ee2..8319b243b4 100644 --- a/doc/html/boost/interprocess/shared_memory_object.html +++ b/doc/html/boost/interprocess/shared_memory_object.html @@ -36,91 +36,91 @@ class shared_memory_object { public: // construct/copy/destruct - shared_memory_object(); - shared_memory_object(create_only_t, const char *, mode_t, + shared_memory_object(); + shared_memory_object(create_only_t, const char *, mode_t, const permissions & = permissions()); - shared_memory_object(open_or_create_t, const char *, mode_t, + shared_memory_object(open_or_create_t, const char *, mode_t, const permissions & = permissions()); - shared_memory_object(open_only_t, const char *, mode_t); - shared_memory_object(shared_memory_object &&); - shared_memory_object & operator=(shared_memory_object &&); - ~shared_memory_object(); + shared_memory_object(open_only_t, const char *, mode_t); + shared_memory_object(shared_memory_object &&); + shared_memory_object & operator=(shared_memory_object &&); + ~shared_memory_object(); - // public member functions - void swap(shared_memory_object &); - void truncate(offset_t); - const char * get_name() const; - bool get_size(offset_t &) const; - mode_t get_mode() const; - mapping_handle_t get_mapping_handle() const; + // public member functions + void swap(shared_memory_object &); + void truncate(offset_t); + const char * get_name() const; + bool get_size(offset_t &) const; + mode_t get_mode() const; + mapping_handle_t get_mapping_handle() const; - // public static functions - static bool remove(const char *); + // public static functions + static bool remove(const char *); };
    -

    Description

    +

    Description

    A class that wraps a shared memory mapping that can be used to create mapped regions from the mapped files

    -

    +

    shared_memory_object public construct/copy/destruct

    1. -
      shared_memory_object();
      Default constructor. Represents an empty shared_memory_object.
      2. +
      shared_memory_object();
      Default constructor. Represents an empty shared_memory_object.
    2. -
      shared_memory_object(create_only_t, const char * name, mode_t mode, 
+
      shared_memory_object(create_only_t, const char * name, mode_t mode, 
                      const permissions & perm = permissions());
      
 
      Creates a shared memory object with name "name" and mode "mode", with the access mode "mode" If the file previously exists, throws an error.
    3. -
      shared_memory_object(open_or_create_t, const char * name, mode_t mode, 
+
      shared_memory_object(open_or_create_t, const char * name, mode_t mode, 
                      const permissions & perm = permissions());
      
 
      Tries to create a shared memory object with name "name" and mode "mode", with the access mode "mode". If the file previously exists, it tries to open it with mode "mode". Otherwise throws an error.
    4. -
      shared_memory_object(open_only_t, const char * name, mode_t mode);
      +
      shared_memory_object(open_only_t, const char * name, mode_t mode);

      Tries to open a shared memory object with name "name", with the access mode "mode". If the file does not previously exist, it throws an error.

    5. -
      shared_memory_object(shared_memory_object && moved);
      +
      shared_memory_object(shared_memory_object && moved);

      Moves the ownership of "moved"'s shared memory object to *this. After the call, "moved" does not represent any shared memory object. Does not throw

    6. -
      shared_memory_object & operator=(shared_memory_object && moved);
      +
      shared_memory_object & operator=(shared_memory_object && moved);

      Moves the ownership of "moved"'s shared memory to *this. After the call, "moved" does not represent any shared memory. Does not throw

    7. -
      ~shared_memory_object();
      +
      ~shared_memory_object();

      Destroys *this and indicates that the calling process is finished using the resource. All mapped regions are still valid after destruction. The destructor function will deallocate any system resources allocated by the system for use by this process for this resource. The resource can still be opened again calling the open constructor overload. To erase the resource from the system use remove().

    -

    -shared_memory_object public member functions

    +

    +shared_memory_object public member functions

    1. -
      void swap(shared_memory_object & moved);
      Swaps the shared_memory_objects. Does not throw.
      2. +
      void swap(shared_memory_object & moved);
      Swaps the shared_memory_objects. Does not throw.
    2. -
      void truncate(offset_t length);
      Sets the size of the shared memory mapping.
      3. +
      void truncate(offset_t length);
      Sets the size of the shared memory mapping.
    3. -
      const char * get_name() const;
      Returns the name of the shared memory object.
      4. +
      const char * get_name() const;
      Returns the name of the shared memory object.
    4. -
      bool get_size(offset_t & size) const;
      +
      bool get_size(offset_t & size) const;

      Returns true if the size of the shared memory object can be obtained and writes the size in the passed reference

    5. -
      mode_t get_mode() const;
      Returns access mode.
      6. +
      mode_t get_mode() const;
      Returns access mode.
    6. -
      mapping_handle_t get_mapping_handle() const;
      Returns mapping handle. Never throws.
      7. +
      mapping_handle_t get_mapping_handle() const;
      Returns mapping handle. Never throws.
    -

    -shared_memory_object public static functions

    +

    +shared_memory_object public static functions

    1. -
      static bool remove(const char * name);
      +
      static bool remove(const char * name);

      Erases a shared memory object from the system. Returns false on error. Never throws

    diff --git a/doc/html/boost/interprocess/shared_ptr.html b/doc/html/boost/interprocess/shared_ptr.html index 4dcd82b15f..2d4581e1b8 100644 --- a/doc/html/boost/interprocess/shared_ptr.html +++ b/doc/html/boost/interprocess/shared_ptr.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -45,140 +45,140 @@ typedef boost::intrusive::pointer_traits< typename VoidAllocator::pointer >::template rebind_pointer< const VoidAllocator >::type const_allocator_pointer; // construct/copy/destruct - shared_ptr(); - explicit shared_ptr(const pointer &, + shared_ptr(); + explicit shared_ptr(const pointer &, const VoidAllocator & = VoidAllocator(), const Deleter & = Deleter()); - shared_ptr(const shared_ptr &); - shared_ptr(const shared_ptr &, const pointer &); + shared_ptr(const shared_ptr &); + shared_ptr(const shared_ptr &, const pointer &); template<typename Y> - shared_ptr(shared_ptr< Y, VoidAllocator, Deleter > const &); + shared_ptr(shared_ptr< Y, VoidAllocator, Deleter > const &); template<typename Y> - explicit shared_ptr(weak_ptr< Y, VoidAllocator, Deleter > const &); - explicit shared_ptr(shared_ptr &&); + explicit shared_ptr(weak_ptr< Y, VoidAllocator, Deleter > const &); + explicit shared_ptr(shared_ptr &&); template<typename Y> - shared_ptr & operator=(shared_ptr< Y, VoidAllocator, Deleter > const &); - shared_ptr & operator=(BOOST_COPY_ASSIGN_REF(shared_ptr)); - shared_ptr & operator=(shared_ptr &&); + shared_ptr & operator=(shared_ptr< Y, VoidAllocator, Deleter > const &); + shared_ptr & operator=(BOOST_COPY_ASSIGN_REF(shared_ptr)); + shared_ptr & operator=(shared_ptr &&); - // public member functions - void reset(); + // public member functions + void reset(); template<typename Pointer> - void reset(const Pointer &, const VoidAllocator & = VoidAllocator(), + void reset(const Pointer &, const VoidAllocator & = VoidAllocator(), const Deleter & = Deleter()); template<typename Y> - void reset(shared_ptr< Y, VoidAllocator, Deleter > const &, + void reset(shared_ptr< Y, VoidAllocator, Deleter > const &, const pointer &); - reference operator*() const; - pointer operator->() const; - pointer get() const; - bool operator!() const; - bool unique() const; - long use_count() const; - void swap(shared_ptr< T, VoidAllocator, Deleter > &); + reference operator*() const; + pointer operator->() const; + pointer get() const; + bool operator!() const; + bool unique() const; + long use_count() const; + void swap(shared_ptr< T, VoidAllocator, Deleter > &); };
    -

    Description

    +

    Description

    shared_ptr stores a pointer to a dynamically allocated object. The object pointed to is guaranteed to be deleted when the last shared_ptr pointing to it is destroyed or reset.

    shared_ptr is parameterized on T (the type of the object pointed to), VoidAllocator (the void allocator to be used to allocate the auxiliary data) and Deleter (the deleter whose operator() will be used to delete the object.

    The internal pointer will be of the same pointer type as typename VoidAllocator::pointer type (that is, if typename VoidAllocator::pointer is offset_ptr<void>, the internal pointer will be offset_ptr<T>).

    -

    Because the implementation uses reference counting, cycles of shared_ptr instances will not be reclaimed. For example, if main() holds a shared_ptr to A, which directly or indirectly holds a shared_ptr back to A, A's use count will be 2. Destruction of the original shared_ptr will leave A dangling with a use count of 1. Use weak_ptr to "break cycles."

    +

    Because the implementation uses reference counting, cycles of shared_ptr instances will not be reclaimed. For example, if main() holds a shared_ptr to A, which directly or indirectly holds a shared_ptr back to A, A's use count will be 2. Destruction of the original shared_ptr will leave A dangling with a use count of 1. Use weak_ptr to "break cycles."

    -

    +

    shared_ptr public construct/copy/destruct

    1. -
      shared_ptr();
      +
      shared_ptr();

      Constructs an empty shared_ptr. Use_count() == 0 && get()== 0.

    2. -
      explicit shared_ptr(const pointer & p, 
+
      explicit shared_ptr(const pointer & p, 
                     const VoidAllocator & a = VoidAllocator(), 
                     const Deleter & d = Deleter());
      
 
      Constructs a shared_ptr that owns the pointer p. Auxiliary data will be allocated with a copy of a and the object will be deleted with a copy of d. Requirements: Deleter and A's copy constructor must not throw.
    3. -
      shared_ptr(const shared_ptr & r);
      +
      shared_ptr(const shared_ptr & r);

      Copy constructs a shared_ptr. If r is empty, constructs an empty shared_ptr. Otherwise, constructs a shared_ptr that shares ownership with r. Never throws.

    4. -
      shared_ptr(const shared_ptr & other, const pointer & p);
      +
      shared_ptr(const shared_ptr & other, const pointer & p);

      Constructs a shared_ptr that shares ownership with other and stores p. Postconditions: get() == p && use_count() == r.use_count(). Throws: nothing. 

    5. template<typename Y> 
-  shared_ptr(shared_ptr< Y, VoidAllocator, Deleter > const & r);
      + shared_ptr(shared_ptr< Y, VoidAllocator, Deleter > const & r);

      If r is empty, constructs an empty shared_ptr. Otherwise, constructs a shared_ptr that shares ownership with r. Never throws. 

    6. template<typename Y> 
-  explicit shared_ptr(weak_ptr< Y, VoidAllocator, Deleter > const & r);
      + explicit shared_ptr(weak_ptr< Y, VoidAllocator, Deleter > const & r);

      Constructs a shared_ptr that shares ownership with r and stores a copy of the pointer stored in r.

    7. -
      explicit shared_ptr(shared_ptr && other);
      +
      explicit shared_ptr(shared_ptr && other);

      Move-Constructs a shared_ptr that takes ownership of other resource and other is put in default-constructed state. Throws: nothing. 

    8. template<typename Y> 
-  shared_ptr & operator=(shared_ptr< Y, VoidAllocator, Deleter > const & r);
      + shared_ptr & operator=(shared_ptr< Y, VoidAllocator, Deleter > const & r);

      Equivalent to shared_ptr(r).swap(*this). Never throws

    9. -
      shared_ptr & operator=(BOOST_COPY_ASSIGN_REF(shared_ptr) r);
      +
      shared_ptr & operator=(BOOST_COPY_ASSIGN_REF(shared_ptr) r);

      Equivalent to shared_ptr(r).swap(*this). Never throws

    10. -
      shared_ptr & operator=(shared_ptr && other);
      +
      shared_ptr & operator=(shared_ptr && other);

      Move-assignment. Equivalent to shared_ptr(other).swap(*this). Never throws

    -

    -shared_ptr public member functions

    +

    +shared_ptr public member functions

    1. -
      void reset();
      +
      void reset();

      This is equivalent to: this_type().swap(*this); 

    2. template<typename Pointer> 
-  void reset(const Pointer & p, const VoidAllocator & a = VoidAllocator(), 
+  void reset(const Pointer & p, const VoidAllocator & a = VoidAllocator(), 
              const Deleter & d = Deleter());

      This is equivalent to: this_type(p, a, d).swap(*this); 

    3. template<typename Y> 
-  void reset(shared_ptr< Y, VoidAllocator, Deleter > const & r, 
+  void reset(shared_ptr< Y, VoidAllocator, Deleter > const & r, 
              const pointer & p);
    4. -
      reference operator*() const;
      +
      reference operator*() const;

      Returns a reference to the pointed type

    5. -
      pointer operator->() const;
      +
      pointer operator->() const;

      Returns the pointer pointing to the owned object

    6. -
      pointer get() const;
      +
      pointer get() const;

      Returns the pointer pointing to the owned object

    7. -
      bool operator!() const;
      +
      bool operator!() const;

      Not operator. Returns true if this->get() != 0, false otherwise

    8. -
      bool unique() const;
      +
      bool unique() const;

      Returns use_count() == 1. unique() might be faster than use_count()

    9. -
      long use_count() const;
      +
      long use_count() const;

      Returns the number of shared_ptr objects, *this included, that share ownership with *this, or an unspecified nonnegative value when *this is empty. use_count() is not necessarily efficient. Use only for debugging and testing purposes, not for production code.

    10. -
      void swap(shared_ptr< T, VoidAllocator, Deleter > & other);
      +
      void swap(shared_ptr< T, VoidAllocator, Deleter > & other);

      Exchanges the contents of the two smart pointers.

    @@ -195,7 +195,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/simple_seq_fit.html b/doc/html/boost/interprocess/simple_seq_fit.html index 5f0081f321..347250ab9e 100644 --- a/doc/html/boost/interprocess/simple_seq_fit.html +++ b/doc/html/boost/interprocess/simple_seq_fit.html @@ -39,18 +39,18 @@ typedef base_t::size_type size_type; // construct/copy/destruct - simple_seq_fit(size_type, size_type); + simple_seq_fit(size_type, size_type); };
    -

    Description

    +

    Description

    This class implements the simple sequential fit algorithm with a simply linked list of free buffers.

    -

    +

    simple_seq_fit public construct/copy/destruct

    1. -
      simple_seq_fit(size_type segment_size, size_type extra_hdr_bytes);
      +
      simple_seq_fit(size_type segment_size, size_type extra_hdr_bytes);

      Constructor. "size" is the total size of the managed memory segment, "extra_hdr_bytes" indicates the extra bytes beginning in the sizeof(simple_seq_fit) offset that the allocator should not use at all.

    diff --git a/doc/html/boost/interprocess/swap_idm45879390627728.html b/doc/html/boost/interprocess/swap_idm45879390627728.html new file mode 100644 index 0000000000..dd285a39dd --- /dev/null +++ b/doc/html/boost/interprocess/swap_idm45879390627728.html @@ -0,0 +1,56 @@ + + + + +Function template swap + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template swap

    +

    boost::interprocess::swap

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/smart_ptr/scoped_ptr.hpp>
+
+
+template<typename T, typename D> 
+  void swap(scoped_ptr< T, D > & a, scoped_ptr< T, D > & b);
    +
    +

    Description

    +

    Exchanges the internal pointer and deleter with other scoped_ptr Never throws.

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/swap_idm45879390678048.html b/doc/html/boost/interprocess/swap_idm45879390678048.html new file mode 100644 index 0000000000..9c1b35ee17 --- /dev/null +++ b/doc/html/boost/interprocess/swap_idm45879390678048.html @@ -0,0 +1,56 @@ + + + + +Function template swap + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template swap

    +

    boost::interprocess::swap

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/smart_ptr/intrusive_ptr.hpp>
+
+
+template<typename T, typename VP> 
+  void swap(intrusive_ptr< T, VP > & lhs, intrusive_ptr< T, VP > & rhs);
    +
    +

    Description

    +

    Exchanges the contents of the two intrusive_ptrs. Does not throw

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/swap_idp36046528.html b/doc/html/boost/interprocess/swap_idp36046528.html deleted file mode 100644 index e0ce86e23e..0000000000 --- a/doc/html/boost/interprocess/swap_idp36046528.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Function template swap - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template swap

    -

    boost::interprocess::swap

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/smart_ptr/intrusive_ptr.hpp>
-
-
-template<typename T, typename VP> 
-  void swap(intrusive_ptr< T, VP > & lhs, intrusive_ptr< T, VP > & rhs);
    -
    -

    Description

    -

    Exchanges the contents of the two intrusive_ptrs. Does not throw

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/swap_idp36096848.html b/doc/html/boost/interprocess/swap_idp36096848.html deleted file mode 100644 index d439a39a03..0000000000 --- a/doc/html/boost/interprocess/swap_idp36096848.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Function template swap - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template swap

    -

    boost::interprocess::swap

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/smart_ptr/scoped_ptr.hpp>
-
-
-template<typename T, typename D> 
-  void swap(scoped_ptr< T, D > & a, scoped_ptr< T, D > & b);
    -
    -

    Description

    -

    Exchanges the internal pointer and deleter with other scoped_ptr Never throws.

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/to_raw_p_idm45879390622336.html b/doc/html/boost/interprocess/to_raw_p_idm45879390622336.html new file mode 100644 index 0000000000..dd7d520051 --- /dev/null +++ b/doc/html/boost/interprocess/to_raw_p_idm45879390622336.html @@ -0,0 +1,56 @@ + + + + +Function template to_raw_pointer + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template to_raw_pointer

    +

    boost::interprocess::to_raw_pointer

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/smart_ptr/scoped_ptr.hpp>
+
+
+template<typename T, typename D> 
+  scoped_ptr< T, D >::pointer to_raw_pointer(scoped_ptr< T, D > const & p);
    +
    +

    Description

    +

    Returns a copy of the stored pointer Never throws

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/to_raw_p_idm45879390668304.html b/doc/html/boost/interprocess/to_raw_p_idm45879390668304.html new file mode 100644 index 0000000000..27fea7ea45 --- /dev/null +++ b/doc/html/boost/interprocess/to_raw_p_idm45879390668304.html @@ -0,0 +1,57 @@ + + + + +Function template to_raw_pointer + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template to_raw_pointer

    +

    boost::interprocess::to_raw_pointer

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/smart_ptr/intrusive_ptr.hpp>
+
+
+template<typename T, typename VP> 
+  boost::interprocess::intrusive_ptr< T, VP >::pointer 
+  to_raw_pointer(intrusive_ptr< T, VP > p);
    +
    +

    Description

    +

    Returns p.get(). Does not throw

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/to_raw_pointer_idp36056272.html b/doc/html/boost/interprocess/to_raw_pointer_idp36056272.html deleted file mode 100644 index 44fb47be9b..0000000000 --- a/doc/html/boost/interprocess/to_raw_pointer_idp36056272.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function template to_raw_pointer - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template to_raw_pointer

    -

    boost::interprocess::to_raw_pointer

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/smart_ptr/intrusive_ptr.hpp>
-
-
-template<typename T, typename VP> 
-  boost::interprocess::intrusive_ptr< T, VP >::pointer 
-  to_raw_pointer(intrusive_ptr< T, VP > p);
    -
    -

    Description

    -

    Returns p.get(). Does not throw

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/to_raw_pointer_idp36102240.html b/doc/html/boost/interprocess/to_raw_pointer_idp36102240.html deleted file mode 100644 index 96b8adff68..0000000000 --- a/doc/html/boost/interprocess/to_raw_pointer_idp36102240.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Function template to_raw_pointer - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template to_raw_pointer

    -

    boost::interprocess::to_raw_pointer

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/smart_ptr/scoped_ptr.hpp>
-
-
-template<typename T, typename D> 
-  scoped_ptr< T, D >::pointer to_raw_pointer(scoped_ptr< T, D > const & p);
    -
    -

    Description

    -

    Returns a copy of the stored pointer Never throws

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/try_to_lock.html b/doc/html/boost/interprocess/try_to_lock.html index ad2f79194d..28358c7a2f 100644 --- a/doc/html/boost/interprocess/try_to_lock.html +++ b/doc/html/boost/interprocess/try_to_lock.html @@ -34,7 +34,7 @@ static const try_to_lock_type try_to_lock;
    -

    Description

    +

    Description

    An object indicating that a try_lock() operation must be executed.

    diff --git a/doc/html/boost/interprocess/unordered_map_index.html b/doc/html/boost/interprocess/unordered_map_index.html index 09e21c7447..80672b906e 100644 --- a/doc/html/boost/interprocess/unordered_map_index.html +++ b/doc/html/boost/interprocess/unordered_map_index.html @@ -38,35 +38,35 @@ { public: // construct/copy/destruct - unordered_map_index(segment_manager_base *); + unordered_map_index(segment_manager_base *); - // public member functions - void reserve(typename segment_manager_base::size_type); - void shrink_to_fit(); + // public member functions + void reserve(typename segment_manager_base::size_type); + void shrink_to_fit(); };
    -

    Description

    +

    Description

    Index type based in unordered_map. Just derives from unordered_map and defines the interface needed by managed memory segments

    -

    +

    unordered_map_index public construct/copy/destruct

    1. -
      unordered_map_index(segment_manager_base * segment_mngr);
      +
      unordered_map_index(segment_manager_base * segment_mngr);

      Constructor. Takes a pointer to the segment manager. Can throw

    -

    -unordered_map_index public member functions

    +

    +unordered_map_index public member functions

    1. -
      void reserve(typename segment_manager_base::size_type n);
      +
      void reserve(typename segment_manager_base::size_type n);

      This reserves memory to optimize the insertion of n elements in the index

    2. -
      void shrink_to_fit();
      +
      void shrink_to_fit();

      This tries to free previously allocate unused memory.

    diff --git a/doc/html/boost/interprocess/upgradable_lock.html b/doc/html/boost/interprocess/upgradable_lock.html index a5e44cfbde..71b488fcb9 100644 --- a/doc/html/boost/interprocess/upgradable_lock.html +++ b/doc/html/boost/interprocess/upgradable_lock.html @@ -39,123 +39,123 @@ typedef UpgradableMutex mutex_type; // construct/copy/destruct - upgradable_lock(); - explicit upgradable_lock(mutex_type &); - upgradable_lock(mutex_type &, defer_lock_type); - upgradable_lock(mutex_type &, accept_ownership_type); - upgradable_lock(mutex_type &, try_to_lock_type); - upgradable_lock(mutex_type &, const boost::posix_time::ptime &); - upgradable_lock(upgradable_lock< mutex_type > &&); - template<typename T> upgradable_lock(scoped_lock< T > &&, unspecified = 0); + upgradable_lock(); + explicit upgradable_lock(mutex_type &); + upgradable_lock(mutex_type &, defer_lock_type); + upgradable_lock(mutex_type &, accept_ownership_type); + upgradable_lock(mutex_type &, try_to_lock_type); + upgradable_lock(mutex_type &, const boost::posix_time::ptime &); + upgradable_lock(upgradable_lock< mutex_type > &&); + template<typename T> upgradable_lock(scoped_lock< T > &&, unspecified = 0); template<typename T> - upgradable_lock(sharable_lock< T > &&, try_to_lock_type, unspecified = 0); - upgradable_lock & operator=(upgradable_lock &&); - ~upgradable_lock(); + upgradable_lock(sharable_lock< T > &&, try_to_lock_type, unspecified = 0); + upgradable_lock & operator=(upgradable_lock &&); + ~upgradable_lock(); - // public member functions - void lock(); - bool try_lock(); - bool timed_lock(const boost::posix_time::ptime &); - void unlock(); - bool owns() const; - operator unspecified_bool_type() const; - mutex_type * mutex() const; - mutex_type * release(); - void swap(upgradable_lock< mutex_type > &); + // public member functions + void lock(); + bool try_lock(); + bool timed_lock(const boost::posix_time::ptime &); + void unlock(); + bool owns() const; + operator unspecified_bool_type() const; + mutex_type * mutex() const; + mutex_type * release(); + void swap(upgradable_lock< mutex_type > &); };
    -

    Description

    +

    Description

    upgradable_lock is meant to carry out the tasks for read-locking, unlocking, try-read-locking and timed-read-locking (recursive or not) for the Mutex. Additionally the upgradable_lock can transfer ownership to a scoped_lock using transfer_lock syntax. The Mutex need not supply all of the functionality. If the client of upgradable_lock<Mutex> does not use functionality which the Mutex does not supply, no harm is done. Mutex ownership can be shared among read_locks, and a single upgradable_lock. upgradable_lock does not support copy semantics. However upgradable_lock supports ownership transfer from a upgradable_locks or scoped_locks via transfer_lock syntax.

    -

    +

    upgradable_lock public construct/copy/destruct

    1. -
      upgradable_lock();
      +
      upgradable_lock();

      Effects: Default constructs a upgradable_lock. Postconditions: owns() == false and mutex() == 0.

      2. -
    2. explicit upgradable_lock(mutex_type & m);
      3. +
    3. explicit upgradable_lock(mutex_type & m);
    4. -
      upgradable_lock(mutex_type & m, defer_lock_type);
      +
      upgradable_lock(mutex_type & m, defer_lock_type);

      Postconditions: owns() == false, and mutex() == &m. Notes: The constructor will not take ownership of the mutex. There is no effect required on the referenced mutex.

    5. -
      upgradable_lock(mutex_type & m, accept_ownership_type);
      +
      upgradable_lock(mutex_type & m, accept_ownership_type);

      Postconditions: owns() == true, and mutex() == &m. Notes: The constructor will suppose that the mutex is already upgradable locked. There is no effect required on the referenced mutex.

    6. -
      upgradable_lock(mutex_type & m, try_to_lock_type);
      +
      upgradable_lock(mutex_type & m, try_to_lock_type);

      Effects: m.try_lock_upgradable(). Postconditions: mutex() == &m. owns() == the return value of the m.try_lock_upgradable() executed within the constructor. Notes: The constructor will take upgradable-ownership of the mutex if it can do so without waiting. Whether or not this constructor handles recursive locking depends upon the mutex. If the mutex_type does not support try_lock_upgradable, this constructor will fail at compile time if instantiated, but otherwise have no effect.

    7. -
      upgradable_lock(mutex_type & m, const boost::posix_time::ptime & abs_time);
      +
      upgradable_lock(mutex_type & m, const boost::posix_time::ptime & abs_time);

      Effects: m.timed_lock_upgradable(abs_time) Postconditions: mutex() == &m. owns() == the return value of the m.timed_lock_upgradable() executed within the constructor. Notes: The constructor will take upgradable-ownership of the mutex if it can do so within the time specified. Whether or not this constructor handles recursive locking depends upon the mutex. If the mutex_type does not support timed_lock_upgradable, this constructor will fail at compile time if instantiated, but otherwise have no effect.

    8. -
      upgradable_lock(upgradable_lock< mutex_type > && upgr);
      +
      upgradable_lock(upgradable_lock< mutex_type > && upgr);

      Effects: No effects on the underlying mutex. Postconditions: mutex() == the value upgr.mutex() had before the construction. upgr.mutex() == 0. owns() == upgr.owns() before the construction. upgr.owns() == false. Notes: If upgr is locked, this constructor will lock this upgradable_lock while unlocking upgr. If upgr is unlocked, then this upgradable_lock will be unlocked as well. Only a moved upgradable_lock's will match this signature. An non-moved upgradable_lock can be moved with the expression: "boost::move(lock);". This constructor does not alter the state of the mutex, only potentially who owns it. 

    9. template<typename T> 
-  upgradable_lock(scoped_lock< T > && scop, unspecified = 0);
      + upgradable_lock(scoped_lock< T > && scop, unspecified = 0);

      Effects: If scop.owns(), m_.unlock_and_lock_upgradable(). Postconditions: mutex() == the value scop.mutex() had before the construction. scop.mutex() == 0. owns() == scop.owns() before the constructor. After the construction, scop.owns() == false. Notes: If scop is locked, this constructor will transfer the exclusive-ownership to an upgradable-ownership of this upgradable_lock. Only a moved sharable_lock's will match this signature. An non-moved sharable_lock can be moved with the expression: "boost::move(lock);". 

    10. template<typename T> 
-  upgradable_lock(sharable_lock< T > && shar, try_to_lock_type, 
+  upgradable_lock(sharable_lock< T > && shar, try_to_lock_type, 
                   unspecified = 0);

      Effects: If shar.owns() then calls try_unlock_sharable_and_lock_upgradable() on the referenced mutex. a)if try_unlock_sharable_and_lock_upgradable() returns true then mutex() obtains the value from shar.release() and owns() is set to true. b)if try_unlock_sharable_and_lock_upgradable() returns false then shar is unaffected and this upgradable_lock construction has the same effects as a default construction. c)Else shar.owns() is false. mutex() obtains the value from shar.release() and owns() is set to false. Notes: This construction will not block. It will try to obtain mutex ownership from shar immediately, while changing the lock type from a "read lock" to an "upgradable lock". If the "read lock" isn't held in the first place, the mutex merely changes type to an unlocked "upgradable lock". If the "read lock" is held, then mutex transfer occurs only if it can do so in a non-blocking manner.

    11. -
      upgradable_lock & operator=(upgradable_lock && upgr);
      +
      upgradable_lock & operator=(upgradable_lock && upgr);

      Effects: If owns(), then unlock_upgradable() is called on mutex(). *this gets the state of upgr and upgr gets set to a default constructed state. Notes: With a recursive mutex it is possible that both this and upgr own the mutex before the assignment. In this case, this will own the mutex after the assignment (and upgr will not), but the mutex's upgradable lock count will be decremented by one.

    12. -
      ~upgradable_lock();
      +
      ~upgradable_lock();

      Effects: if (owns()) m_->unlock_upgradable(). Notes: The destructor behavior ensures that the mutex lock is not leaked.

    -

    -upgradable_lock public member functions

    +

    +upgradable_lock public member functions

    1. -
      void lock();
      +
      void lock();

      Effects: If mutex() == 0 or if already locked, throws a lock_exception() exception. Calls lock_upgradable() on the referenced mutex. Postconditions: owns() == true. Notes: The sharable_lock changes from a state of not owning the mutex, to owning the mutex, blocking if necessary.

    2. -
      bool try_lock();
      +
      bool try_lock();

      Effects: If mutex() == 0 or if already locked, throws a lock_exception() exception. Calls try_lock_upgradable() on the referenced mutex. Postconditions: owns() == the value returned from mutex()->try_lock_upgradable(). Notes: The upgradable_lock changes from a state of not owning the mutex, to owning the mutex, but only if blocking was not required. If the mutex_type does not support try_lock_upgradable(), this function will fail at compile time if instantiated, but otherwise have no effect.

    3. -
      bool timed_lock(const boost::posix_time::ptime & abs_time);
      +
      bool timed_lock(const boost::posix_time::ptime & abs_time);

      Effects: If mutex() == 0 or if already locked, throws a lock_exception() exception. Calls timed_lock_upgradable(abs_time) on the referenced mutex. Postconditions: owns() == the value returned from mutex()->timed_lock_upgradable(abs_time). Notes: The upgradable_lock changes from a state of not owning the mutex, to owning the mutex, but only if it can obtain ownership within the specified time. If the mutex_type does not support timed_lock_upgradable(abs_time), this function will fail at compile time if instantiated, but otherwise have no effect.

    4. -
      void unlock();
      +
      void unlock();

      Effects: If mutex() == 0 or if not locked, throws a lock_exception() exception. Calls unlock_upgradable() on the referenced mutex. Postconditions: owns() == false. Notes: The upgradable_lock changes from a state of owning the mutex, to not owning the mutex.

    5. -
      bool owns() const;
      +
      bool owns() const;

      Effects: Returns true if this scoped_lock has acquired the referenced mutex.

    6. -
      operator unspecified_bool_type() const;
      +
      operator unspecified_bool_type() const;

      Conversion to bool. Returns owns().

    7. -
      mutex_type * mutex() const;
      +
      mutex_type * mutex() const;

      Effects: Returns a pointer to the referenced mutex, or 0 if there is no mutex to reference.

    8. -
      mutex_type * release();
      +
      mutex_type * release();

      Effects: Returns a pointer to the referenced mutex, or 0 if there is no mutex to reference. Postconditions: mutex() == 0 and owns() == false.

    9. -
      void swap(upgradable_lock< mutex_type > & other);
      +
      void swap(upgradable_lock< mutex_type > & other);

      Effects: Swaps state with moved lock. Throws: Nothing.

    diff --git a/doc/html/boost/interprocess/weak_ptr.html b/doc/html/boost/interprocess/weak_ptr.html new file mode 100644 index 0000000000..2b770a35b3 --- /dev/null +++ b/doc/html/boost/interprocess/weak_ptr.html @@ -0,0 +1,145 @@ + + + + +Class template weak_ptr + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Class template weak_ptr

    +

    boost::interprocess::weak_ptr

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/smart_ptr/weak_ptr.hpp>
+
+template<typename T, typename A, typename D> 
+class weak_ptr {
+public:
+  // types
+  typedef T element_type;
+  typedef T value_type;  
+
+  // construct/copy/destruct
+  weak_ptr();
+  template<typename Y> weak_ptr(weak_ptr< Y, A, D > const &);
+  template<typename Y> weak_ptr(shared_ptr< Y, A, D > const &);
+  template<typename Y> weak_ptr & operator=(weak_ptr< Y, A, D > const &);
+  template<typename Y> weak_ptr & operator=(shared_ptr< Y, A, D > const &);
+
+  // public member functions
+  shared_ptr< T, A, D > lock() const;
+  long use_count() const;
+  bool expired() const;
+  void reset();
+  void swap(this_type &);
+};
    +
    +

    Description

    +

    The weak_ptr class template stores a "weak reference" to an object that's already managed by a shared_ptr. To access the object, a weak_ptr can be converted to a shared_ptr using the shared_ptr constructor or the member function lock. When the last shared_ptr to the object goes away and the object is deleted, the attempt to obtain a shared_ptr from the weak_ptr instances that refer to the deleted object will fail: the constructor will throw an exception of type bad_weak_ptr, and weak_ptr::lock will return an empty shared_ptr.

    +

    Every weak_ptr meets the CopyConstructible and Assignable requirements of the C++ Standard Library, and so can be used in standard library containers. Comparison operators are supplied so that weak_ptr works with the standard library's associative containers.

    +

    weak_ptr operations never throw exceptions.

    +

    The class template is parameterized on T, the type of the object pointed to.

    +
    +

    +weak_ptr + public + construct/copy/destruct

    +
      +
    1. +
      weak_ptr();
      +

      Effects: Constructs an empty weak_ptr. Postconditions: use_count() == 0.

      +
      2. +
    2. +
      template<typename Y> weak_ptr(weak_ptr< Y, A, D > const & r);
      +

      Effects: If r is empty, constructs an empty weak_ptr; otherwise, constructs a weak_ptr that shares ownership with r as if by storing a copy of the pointer stored in r.

      +

      Postconditions: use_count() == r.use_count().

      +

      Throws: nothing.

      +
      3. +
    3. +
      template<typename Y> weak_ptr(shared_ptr< Y, A, D > const & r);
      +

      Effects: If r is empty, constructs an empty weak_ptr; otherwise, constructs a weak_ptr that shares ownership with r as if by storing a copy of the pointer stored in r.

      +

      Postconditions: use_count() == r.use_count().

      +

      Throws: nothing.

      +
      4. +
    4. +
      template<typename Y> weak_ptr & operator=(weak_ptr< Y, A, D > const & r);
      +

      Effects: Equivalent to weak_ptr(r).swap(*this).

      +

      Throws: nothing.

      +

      Notes: The implementation is free to meet the effects (and the implied guarantees) via different means, without creating a temporary.

      +
      5. +
    5. +
      template<typename Y> weak_ptr & operator=(shared_ptr< Y, A, D > const & r);
      +

      Effects: Equivalent to weak_ptr(r).swap(*this).

      +

      Throws: nothing.

      +

      Notes: The implementation is free to meet the effects (and the implied guarantees) via different means, without creating a temporary.

      +
      6. +
    +
    +
    +

    +weak_ptr public member functions

    +
      +
    1. +
      shared_ptr< T, A, D > lock() const;
      +

      Returns: expired()? shared_ptr<T>(): shared_ptr<T>(*this).

      +

      Throws: nothing.

      +
      2. +
    2. +
      long use_count() const;
      +

      Returns: 0 if *this is empty; otherwise, the number of shared_ptr objects that share ownership with *this.

      +

      Throws: nothing.

      +

      Notes: use_count() is not necessarily efficient. Use only for debugging and testing purposes, not for production code.

      +
      3. +
    3. +
      bool expired() const;
      +

      Returns: Returns: use_count() == 0.

      +

      Throws: nothing.

      +

      Notes: expired() may be faster than use_count().

      +
      4. +
    4. +
      void reset();
      +

      Effects: Equivalent to: weak_ptr().swap(*this).

      +
      5. +
    5. +
      void swap(this_type & other);
      +

      Effects: Exchanges the contents of the two smart pointers.

      +

      Throws: nothing.

      +
      6. +
    +
    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/wfixed_m_idm45879391346576.html b/doc/html/boost/interprocess/wfixed_m_idm45879391346576.html new file mode 100644 index 0000000000..1b8363fa22 --- /dev/null +++ b/doc/html/boost/interprocess/wfixed_m_idm45879391346576.html @@ -0,0 +1,55 @@ + + + + +Type definition wfixed_managed_shared_memory + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Type definition wfixed_managed_shared_memory

    +

    wfixed_managed_shared_memory

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/managed_shared_memory.hpp>
+
+
+typedef basic_managed_shared_memory< wchar_t,rbtree_best_fit< mutex_family, void * >,iset_index > wfixed_managed_shared_memory;
    +
    +

    Description

    +

    Typedef for a default basic_managed_shared_memory of narrow characters to be placed in a fixed address

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/wfixed_managed_idp35398128.html b/doc/html/boost/interprocess/wfixed_managed_idp35398128.html deleted file mode 100644 index 0f5c34590b..0000000000 --- a/doc/html/boost/interprocess/wfixed_managed_idp35398128.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Type definition wfixed_managed_shared_memory - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Type definition wfixed_managed_shared_memory

    -

    wfixed_managed_shared_memory

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/managed_shared_memory.hpp>
-
-
-typedef basic_managed_shared_memory< wchar_t,rbtree_best_fit< mutex_family, void * >,iset_index > wfixed_managed_shared_memory;
    -
    -

    Description

    -

    Typedef for a default basic_managed_shared_memory of narrow characters to be placed in a fixed address

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/windows_shared_memory.html b/doc/html/boost/interprocess/windows_shared_memory.html index 280b96e681..db50196257 100644 --- a/doc/html/boost/interprocess/windows_shared_memory.html +++ b/doc/html/boost/interprocess/windows_shared_memory.html @@ -36,81 +36,81 @@ class windows_shared_memory { public: // construct/copy/destruct - windows_shared_memory(); - windows_shared_memory(create_only_t, const char *, mode_t, std::size_t, + windows_shared_memory(); + windows_shared_memory(create_only_t, const char *, mode_t, std::size_t, const permissions & = permissions()); - windows_shared_memory(open_or_create_t, const char *, mode_t, std::size_t, + windows_shared_memory(open_or_create_t, const char *, mode_t, std::size_t, const permissions & = permissions()); - windows_shared_memory(open_only_t, const char *, mode_t); - windows_shared_memory(windows_shared_memory &&); - windows_shared_memory & operator=(windows_shared_memory &&); - ~windows_shared_memory(); + windows_shared_memory(open_only_t, const char *, mode_t); + windows_shared_memory(windows_shared_memory &&); + windows_shared_memory & operator=(windows_shared_memory &&); + ~windows_shared_memory(); - // public member functions - void swap(windows_shared_memory &); - const char * get_name() const; - mode_t get_mode() const; - mapping_handle_t get_mapping_handle() const; - offset_t get_size() const; + // public member functions + void swap(windows_shared_memory &); + const char * get_name() const; + mode_t get_mode() const; + mapping_handle_t get_mapping_handle() const; + offset_t get_size() const; };
    -

    Description

    +

    Description

    A class that wraps the native Windows shared memory that is implemented as a file mapping of the paging file. Unlike shared_memory_object, windows_shared_memory has no kernel persistence and the shared memory is destroyed when all processes destroy all their windows_shared_memory objects and mapped regions for the same shared memory or the processes end/crash.

    Warning: Windows native shared memory and interprocess portable shared memory (boost::interprocess::shared_memory_object) can't communicate between them.

    -

    +

    windows_shared_memory public construct/copy/destruct

    1. -
      windows_shared_memory();
      +
      windows_shared_memory();

      Default constructor. Represents an empty windows_shared_memory.

    2. -
      windows_shared_memory(create_only_t, const char * name, mode_t mode, 
+
      windows_shared_memory(create_only_t, const char * name, mode_t mode, 
                       std::size_t size, 
                       const permissions & perm = permissions());
      
 
      Creates a new native shared memory with name "name" and at least size "size", with the access mode "mode". If the file previously exists, throws an error.
    3. -
      windows_shared_memory(open_or_create_t, const char * name, mode_t mode, 
+
      windows_shared_memory(open_or_create_t, const char * name, mode_t mode, 
                       std::size_t size, 
                       const permissions & perm = permissions());
      
 
      Tries to create a shared memory object with name "name" and at least size "size", with the access mode "mode". If the file previously exists, it tries to open it with mode "mode". Otherwise throws an error.
    4. -
      windows_shared_memory(open_only_t, const char * name, mode_t mode);
      +
      windows_shared_memory(open_only_t, const char * name, mode_t mode);

      Tries to open a shared memory object with name "name", with the access mode "mode". If the file does not previously exist, it throws an error.

    5. -
      windows_shared_memory(windows_shared_memory && moved);
      +
      windows_shared_memory(windows_shared_memory && moved);

      Moves the ownership of "moved"'s shared memory object to *this. After the call, "moved" does not represent any shared memory object. Does not throw

    6. -
      windows_shared_memory & operator=(windows_shared_memory && moved);
      +
      windows_shared_memory & operator=(windows_shared_memory && moved);

      Moves the ownership of "moved"'s shared memory to *this. After the call, "moved" does not represent any shared memory. Does not throw

    7. -
      ~windows_shared_memory();
      +
      ~windows_shared_memory();

      Destroys *this. All mapped regions are still valid after destruction. When all mapped regions and windows_shared_memory objects referring the shared memory are destroyed, the operating system will destroy the shared memory.

    -

    -windows_shared_memory public member functions

    +

    +windows_shared_memory public member functions

    1. -
      void swap(windows_shared_memory & other);
      Swaps to shared_memory_objects. Does not throw.
      2. +
      void swap(windows_shared_memory & other);
      Swaps to shared_memory_objects. Does not throw.
    2. -
      const char * get_name() const;
      Returns the name of the shared memory.
      3. +
      const char * get_name() const;
      Returns the name of the shared memory.
    3. -
      mode_t get_mode() const;
      Returns access mode.
      4. +
      mode_t get_mode() const;
      Returns access mode.
    4. -
      mapping_handle_t get_mapping_handle() const;
      Returns the mapping handle. Never throws.
      5. +
      mapping_handle_t get_mapping_handle() const;
      Returns the mapping handle. Never throws.
    5. -
      offset_t get_size() const;
      +
      offset_t get_size() const;

      Returns the size of the windows shared memory. It will be a 4K rounded size of the "size" passed in the constructor.

    diff --git a/doc/html/boost/interprocess/wmanaged_external_buffer.html b/doc/html/boost/interprocess/wmanaged_external_buffer.html index 405d31299d..c792187d58 100644 --- a/doc/html/boost/interprocess/wmanaged_external_buffer.html +++ b/doc/html/boost/interprocess/wmanaged_external_buffer.html @@ -33,10 +33,10 @@ 
    // In header: <boost/interprocess/managed_external_buffer.hpp>
 
 
-typedef basic_managed_external_buffer< wchar_t,rbtree_best_fit< null_mutex_family >,iset_index > wmanaged_external_buffer;
    +typedef basic_managed_external_buffer< wchar_t,rbtree_best_fit< null_mutex_family >,iset_index > wmanaged_external_buffer;
    -

    Description

    -

    Typedef for a default basic_managed_external_buffer of wide characters

    +

    Description

    +

    Typedef for a default basic_managed_external_buffer of wide characters

    diff --git a/doc/html/boost/interprocess/wmanaged_heap_memory.html b/doc/html/boost/interprocess/wmanaged_heap_memory.html index 7f9b3889e0..97cfc31e63 100644 --- a/doc/html/boost/interprocess/wmanaged_heap_memory.html +++ b/doc/html/boost/interprocess/wmanaged_heap_memory.html @@ -35,7 +35,7 @@ typedefbasic_managed_heap_memory<wchar_t,rbtree_best_fit<null_mutex_family>,iset_index>wmanaged_heap_memory;
    -

    Description

    +

    Description

    Typedef for a default basic_managed_heap_memory of wide characters

    diff --git a/doc/html/boost/interprocess/wmanaged_idm45879391297840.html b/doc/html/boost/interprocess/wmanaged_idm45879391297840.html new file mode 100644 index 0000000000..aafc082257 --- /dev/null +++ b/doc/html/boost/interprocess/wmanaged_idm45879391297840.html @@ -0,0 +1,55 @@ + + + + +Type definition wmanaged_windows_shared_memory + + + + + + + + +
    + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Type definition wmanaged_windows_shared_memory

    +

    wmanaged_windows_shared_memory

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/managed_windows_shared_memory.hpp>
+
+
+typedef basic_managed_windows_shared_memory< wchar_t,rbtree_best_fit< mutex_family >,iset_index > wmanaged_windows_shared_memory;
    +
    +

    Description

    +

    Typedef for a default basic_managed_windows_shared_memory of wide characters

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/wmanaged_mapped_file.html b/doc/html/boost/interprocess/wmanaged_mapped_file.html index d049db68d1..fb1b15e023 100644 --- a/doc/html/boost/interprocess/wmanaged_mapped_file.html +++ b/doc/html/boost/interprocess/wmanaged_mapped_file.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -35,7 +35,7 @@ typedef basic_managed_mapped_file< wchar_t,rbtree_best_fit< mutex_family >,iset_index > wmanaged_mapped_file;
    -

    Description

    +

    Description

    Typedef for a default basic_managed_mapped_file of wide characters

    @@ -49,7 +49,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/wmanaged_shared_memory.html b/doc/html/boost/interprocess/wmanaged_shared_memory.html index e117021419..a5d7cba4d8 100644 --- a/doc/html/boost/interprocess/wmanaged_shared_memory.html +++ b/doc/html/boost/interprocess/wmanaged_shared_memory.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -33,10 +33,10 @@ 
    // In header: <boost/interprocess/managed_shared_memory.hpp>
 
 
-typedef basic_managed_shared_memory< wchar_t,rbtree_best_fit< mutex_family >,iset_index > wmanaged_shared_memory;
    +typedef basic_managed_shared_memory< wchar_t,rbtree_best_fit< mutex_family >,iset_index > wmanaged_shared_memory;
    -

    Description

    -

    Typedef for a default basic_managed_shared_memory of wide characters

    +

    Description

    +

    Typedef for a default basic_managed_shared_memory of wide characters

    @@ -49,7 +49,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/wmanaged_windo_idp35446864.html b/doc/html/boost/interprocess/wmanaged_windo_idp35446864.html deleted file mode 100644 index 1cee723471..0000000000 --- a/doc/html/boost/interprocess/wmanaged_windo_idp35446864.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Type definition wmanaged_windows_shared_memory - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Type definition wmanaged_windows_shared_memory

    -

    wmanaged_windows_shared_memory

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/managed_windows_shared_memory.hpp>
-
-
-typedef basic_managed_windows_shared_memory< wchar_t,rbtree_best_fit< mutex_family >,iset_index > wmanaged_windows_shared_memory;
    -
    -

    Description

    -

    Typedef for a default basic_managed_windows_shared_memory of wide characters

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/wmanaged_xsi_shared_memory.html b/doc/html/boost/interprocess/wmanaged_xsi_shared_memory.html index 47ab55dc5b..4e319ded7a 100644 --- a/doc/html/boost/interprocess/wmanaged_xsi_shared_memory.html +++ b/doc/html/boost/interprocess/wmanaged_xsi_shared_memory.html @@ -33,10 +33,10 @@ 
    // In header: <boost/interprocess/managed_xsi_shared_memory.hpp>
 
 
-typedef basic_managed_xsi_shared_memory< wchar_t,rbtree_best_fit< mutex_family >,iset_index > wmanaged_xsi_shared_memory;
    +typedef basic_managed_xsi_shared_memory< wchar_t,rbtree_best_fit< mutex_family >,iset_index > wmanaged_xsi_shared_memory;
    -

    Description

    -

    Typedef for a default basic_managed_xsi_shared_memory of wide characters

    +

    Description

    +

    Typedef for a default basic_managed_xsi_shared_memory of wide characters

    diff --git a/doc/html/boost/interprocess/xsi_key.html b/doc/html/boost/interprocess/xsi_key.html index 38c35afc2c..b59b011cb9 100644 --- a/doc/html/boost/interprocess/xsi_key.html +++ b/doc/html/boost/interprocess/xsi_key.html @@ -36,36 +36,36 @@ classxsi_key{public:// construct/copy/destruct - xsi_key(); - xsi_key(constchar*,boost::uint8_t); + xsi_key(); + xsi_key(constchar*,boost::uint8_t); - // public member functions - key_tget_key()const; + // public member functions + key_tget_key()const;};
    -

    Description

    +

    Description

    A class that wraps XSI (System V) key_t type. This type calculates key_t from path and id using ftok or sets key to IPC_PRIVATE using the default constructor.

    -

    +

    xsi_key public construct/copy/destruct

    1. -
      xsi_key();
      +
      xsi_key();

      Default constructor. Represents a private xsi_key.

    2. -
      xsi_key(const char * path, boost::uint8_t id);
      +
      xsi_key(const char * path, boost::uint8_t id);

      Creates a new XSI shared memory with a key obtained from a call to ftok (with path "path" and id "id"), of size "size" and permissions "perm". If the shared memory previously exists, throws an error.

    -

    -xsi_key public member functions

    +

    +xsi_key public member functions

    1. -
      key_t get_key() const;
      Returns the internal key_t value.
    +
    key_t get_key() const;
    Returns the internal key_t value.
    diff --git a/doc/html/boost/interprocess/xsi_shared_memory.html b/doc/html/boost/interprocess/xsi_shared_memory.html index 8776fc5edd..8253aac5a2 100644 --- a/doc/html/boost/interprocess/xsi_shared_memory.html +++ b/doc/html/boost/interprocess/xsi_shared_memory.html @@ -36,92 +36,92 @@ classxsi_shared_memory{public:// construct/copy/destruct - xsi_shared_memory(); - xsi_shared_memory(open_only_t,int); - xsi_shared_memory(create_only_t,constxsi_key&,std::size_t, + xsi_shared_memory(); + xsi_shared_memory(open_only_t,int); + xsi_shared_memory(create_only_t,constxsi_key&,std::size_t,constpermissions&=permissions()); - xsi_shared_memory(open_or_create_t,constxsi_key&,std::size_t, + xsi_shared_memory(open_or_create_t,constxsi_key&,std::size_t,constpermissions&=permissions()); - xsi_shared_memory(open_only_t,constxsi_key&); - xsi_shared_memory(xsi_shared_memory&&); - xsi_shared_memory&operator=(xsi_shared_memory&&); - ~xsi_shared_memory(); + xsi_shared_memory(open_only_t,constxsi_key&); + xsi_shared_memory(xsi_shared_memory&&); + xsi_shared_memory&operator=(xsi_shared_memory&&); + ~xsi_shared_memory(); - // public member functions - voidswap(xsi_shared_memory&); - intget_shmid()const; - mapping_handle_tget_mapping_handle()const; + // public member functions + voidswap(xsi_shared_memory&); + intget_shmid()const; + mapping_handle_tget_mapping_handle()const; - // public static functions - staticboolremove(int); + // public static functions + staticboolremove(int);};
    -

    Description

    +

    Description

    A class that wraps XSI (System V) shared memory. Unlike shared_memory_object, xsi_shared_memory needs a valid xsi_key to identify a shared memory object.

    Warning: XSI shared memory and interprocess portable shared memory (boost::interprocess::shared_memory_object) can't communicate between them.

    -

    +

    xsi_shared_memory public construct/copy/destruct

    1. -
      xsi_shared_memory();
      +
      xsi_shared_memory();

      Default constructor. Represents an empty xsi_shared_memory.

    2. -
      xsi_shared_memory(open_only_t, int shmid);
      +
      xsi_shared_memory(open_only_t, int shmid);

      Initializes *this with a shmid previously obtained (possibly from another process) This lower-level initializer allows shared memory mapping without having a key.

    3. -
      xsi_shared_memory(create_only_t, const xsi_key & key, std::size_t size, 
+
      xsi_shared_memory(create_only_t, const xsi_key & key, std::size_t size, 
                   const permissions & perm = permissions());
      
 
      Creates a new XSI shared memory from 'key', with size "size" and permissions "perm". If the shared memory previously exists, throws an error.
    4. -
      xsi_shared_memory(open_or_create_t, const xsi_key & key, std::size_t size, 
+
      xsi_shared_memory(open_or_create_t, const xsi_key & key, std::size_t size, 
                   const permissions & perm = permissions());
      
 
      Opens an existing shared memory with identifier 'key' or creates a new XSI shared memory from identifier 'key', with size "size" and permissions "perm".
    5. -
      xsi_shared_memory(open_only_t, const xsi_key & key);
      +
      xsi_shared_memory(open_only_t, const xsi_key & key);

      Tries to open a XSI shared memory with identifier 'key' If the shared memory does not previously exist, it throws an error.

    6. -
      xsi_shared_memory(xsi_shared_memory && moved);
      +
      xsi_shared_memory(xsi_shared_memory && moved);

      Moves the ownership of "moved"'s shared memory object to *this. After the call, "moved" does not represent any shared memory object. Does not throw

    7. -
      xsi_shared_memory & operator=(xsi_shared_memory && moved);
      +
      xsi_shared_memory & operator=(xsi_shared_memory && moved);

      Moves the ownership of "moved"'s shared memory to *this. After the call, "moved" does not represent any shared memory. Does not throw

    8. -
      ~xsi_shared_memory();
      +
      ~xsi_shared_memory();

      Destroys *this. The shared memory won't be destroyed, just this connection to it. Use remove() to destroy the shared memory.

    -

    -xsi_shared_memory public member functions

    +

    +xsi_shared_memory public member functions

    1. -
      void swap(xsi_shared_memory & other);
      Swaps two xsi_shared_memorys. Does not throw.
      2. +
      void swap(xsi_shared_memory & other);
      Swaps two xsi_shared_memorys. Does not throw.
    2. -
      int get_shmid() const;
      +
      int get_shmid() const;

      Returns the shared memory ID that identifies the shared memory

    3. -
      mapping_handle_t get_mapping_handle() const;
      +
      mapping_handle_t get_mapping_handle() const;

      Returns the mapping handle. Never throws

    -

    -xsi_shared_memory public static functions

    +

    +xsi_shared_memory public static functions

    1. -
      static bool remove(int shmid);
      +
      static bool remove(int shmid);

      Erases the XSI shared memory object identified by shmid from the system. Returns false on error. Never throws

    diff --git a/doc/html/boost/intrusive/any_base_hook.html b/doc/html/boost/intrusive/any_base_hook.html index f914a6f2bc..ca23b597a0 100644 --- a/doc/html/boost/intrusive/any_base_hook.html +++ b/doc/html/boost/intrusive/any_base_hook.html @@ -36,56 +36,56 @@ class any_base_hook : public make_any_base_hook::type< O1, O2, O3 > { public: // construct/copy/destruct - any_base_hook(); - any_base_hook(const any_base_hook &); - any_base_hook & operator=(const any_base_hook &); - ~any_base_hook(); + any_base_hook(); + any_base_hook(const any_base_hook &); + any_base_hook & operator=(const any_base_hook &); + ~any_base_hook(); - // public member functions - bool is_linked() const; + // public member functions + bool is_linked() const; };
    -

    Description

    +

    Description

    Derive a class from this hook in order to store objects of that class in an intrusive container.

    The hook admits the following options: tag<>, void_pointer<> and link_mode<>.

    tag<> defines a tag to identify the node. The same tag value can be used in different classes, but if a class is derived from more than one any_base_hook, then each any_base_hook needs its unique tag.

    link_mode<> will specify the linking mode of the hook (normal_link, safe_link).

    void_pointer<> is the pointer type that will be used internally in the hook and the container configured to use this hook.

    -

    +

    any_base_hook public construct/copy/destruct

    1. -
      any_base_hook();
      +
      any_base_hook();

      Effects: If link_mode is or safe_link initializes the node to an unlinked state.

      Throws: Nothing.

    2. -
      any_base_hook(const any_base_hook &);
      +
      any_base_hook(const any_base_hook &);

      Effects: If link_mode is or safe_link initializes the node to an unlinked state. The argument is ignored.

      Throws: Nothing.

      Rationale: Providing a copy-constructor makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

    3. -
      any_base_hook & operator=(const any_base_hook &);
      +
      any_base_hook & operator=(const any_base_hook &);

      Effects: Empty function. The argument is ignored.

      Throws: Nothing.

      Rationale: Providing an assignment operator makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

    4. -
      ~any_base_hook();
      +
      ~any_base_hook();

      Effects: If link_mode is normal_link, the destructor does nothing (ie. no code is generated). If link_mode is safe_link and the object is stored in a container an assertion is raised.

      Throws: Nothing.

    -

    -any_base_hook public member functions

    +

    +any_base_hook public member functions

    1. -
      bool is_linked() const;
      +
      bool is_linked() const;

      Precondition: link_mode must be safe_link.

      Returns: true, if the node belongs to a container, false otherwise. This function can be used to test whether container::iterator_to will return a valid iterator.

      Complexity: Constant

      diff --git a/doc/html/boost/intrusive/any_member_hook.html b/doc/html/boost/intrusive/any_member_hook.html index 0904fcba91..2c92d5a07d 100644 --- a/doc/html/boost/intrusive/any_member_hook.html +++ b/doc/html/boost/intrusive/any_member_hook.html @@ -36,55 +36,55 @@ class any_member_hook : public make_any_member_hook::type< O1, O2, O3 > { public: // construct/copy/destruct - any_member_hook(); - any_member_hook(const any_member_hook &); - any_member_hook & operator=(const any_member_hook &); - ~any_member_hook(); + any_member_hook(); + any_member_hook(const any_member_hook &); + any_member_hook & operator=(const any_member_hook &); + ~any_member_hook(); - // public member functions - bool is_linked() const; + // public member functions + bool is_linked() const; };
    -

    Description

    +

    Description

    Store this hook in a class to be inserted in an intrusive container.

    The hook admits the following options: void_pointer<> and link_mode<>.

    link_mode<> will specify the linking mode of the hook (normal_link or safe_link).

    void_pointer<> is the pointer type that will be used internally in the hook and the container configured to use this hook.

    -

    +

    any_member_hook public construct/copy/destruct

    1. -
      any_member_hook();
      +
      any_member_hook();

      Effects: If link_mode is or safe_link initializes the node to an unlinked state.

      Throws: Nothing.

    2. -
      any_member_hook(const any_member_hook &);
      +
      any_member_hook(const any_member_hook &);

      Effects: If link_mode is or safe_link initializes the node to an unlinked state. The argument is ignored.

      Throws: Nothing.

      Rationale: Providing a copy-constructor makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

    3. -
      any_member_hook & operator=(const any_member_hook &);
      +
      any_member_hook & operator=(const any_member_hook &);

      Effects: Empty function. The argument is ignored.

      Throws: Nothing.

      Rationale: Providing an assignment operator makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

    4. -
      ~any_member_hook();
      +
      ~any_member_hook();

      Effects: If link_mode is normal_link, the destructor does nothing (ie. no code is generated). If link_mode is safe_link and the object is stored in a container an assertion is raised.

      Throws: Nothing.

    -

    -any_member_hook public member functions

    +

    +any_member_hook public member functions

    1. -
      bool is_linked() const;
      +
      bool is_linked() const;

      Precondition: link_mode must be safe_link.

      Returns: true, if the node belongs to a container, false otherwise. This function can be used to test whether container::iterator_to will return a valid iterator.

      Complexity: Constant

      diff --git a/doc/html/boost/intrusive/any_to_avl_set_hook.html b/doc/html/boost/intrusive/any_to_avl_set_hook.html index 7fe79194e3..f436e212d3 100644 --- a/doc/html/boost/intrusive/any_to_avl_set_hook.html +++ b/doc/html/boost/intrusive/any_to_avl_set_hook.html @@ -36,7 +36,7 @@ struct any_to_avl_set_hook { };
    -

    Description

    +

    Description

    This option setter specifies that any hook should behave as an avl_set hook

    diff --git a/doc/html/boost/intrusive/any_to_bs_set_hook.html b/doc/html/boost/intrusive/any_to_bs_set_hook.html index bca79e8967..24e5622409 100644 --- a/doc/html/boost/intrusive/any_to_bs_set_hook.html +++ b/doc/html/boost/intrusive/any_to_bs_set_hook.html @@ -36,7 +36,7 @@ struct any_to_bs_set_hook { };
    -

    Description

    +

    Description

    This option setter specifies that any hook should behave as a bs_set hook

    diff --git a/doc/html/boost/intrusive/any_to_list_hook.html b/doc/html/boost/intrusive/any_to_list_hook.html index 8df97e5748..9a4905e7c9 100644 --- a/doc/html/boost/intrusive/any_to_list_hook.html +++ b/doc/html/boost/intrusive/any_to_list_hook.html @@ -36,7 +36,7 @@ struct any_to_list_hook { };
    -

    Description

    +

    Description

    This option setter specifies that any hook should behave as an list hook

    diff --git a/doc/html/boost/intrusive/any_to_set_hook.html b/doc/html/boost/intrusive/any_to_set_hook.html index bb82d92f61..7d02dbcc58 100644 --- a/doc/html/boost/intrusive/any_to_set_hook.html +++ b/doc/html/boost/intrusive/any_to_set_hook.html @@ -36,7 +36,7 @@ structany_to_set_hook{};
    -

    Description

    +

    Description

    This option setter specifies that any hook should behave as a set hook

    diff --git a/doc/html/boost/intrusive/any_to_slist_hook.html b/doc/html/boost/intrusive/any_to_slist_hook.html index bc1b5dc02a..992b35bc70 100644 --- a/doc/html/boost/intrusive/any_to_slist_hook.html +++ b/doc/html/boost/intrusive/any_to_slist_hook.html @@ -36,7 +36,7 @@ structany_to_slist_hook{};
    -

    Description

    +

    Description

    This option setter specifies that any hook should behave as an slist hook

    diff --git a/doc/html/boost/intrusive/any_to_unordered_set_hook.html b/doc/html/boost/intrusive/any_to_unordered_set_hook.html index 9dbc53861e..1ac46ca08b 100644 --- a/doc/html/boost/intrusive/any_to_unordered_set_hook.html +++ b/doc/html/boost/intrusive/any_to_unordered_set_hook.html @@ -36,7 +36,7 @@ structany_to_unordered_set_hook{};
    -

    Description

    +

    Description

    This option setter specifies that any hook should behave as an unordered set hook

    diff --git a/doc/html/boost/intrusive/avl_multiset.html b/doc/html/boost/intrusive/avl_multiset.html index 7696949749..43d5c58e0d 100644 --- a/doc/html/boost/intrusive/avl_multiset.html +++ b/doc/html/boost/intrusive/avl_multiset.html @@ -60,131 +60,131 @@ typedefimplementation_defined::node_algorithmsnode_algorithms;// construct/copy/destruct - explicitavl_multiset(constkey_compare&=key_compare(), + explicitavl_multiset(constkey_compare&=key_compare(),constvalue_traits&=value_traits());template<typename Iterator> - avl_multiset(Iterator,Iterator,constkey_compare&=key_compare(), + avl_multiset(Iterator,Iterator,constkey_compare&=key_compare(),constvalue_traits&=value_traits()); - avl_multiset(avl_multiset&&); - avl_multiset&operator=(avl_multiset&&); - ~avl_multiset(); + avl_multiset(avl_multiset&&); + avl_multiset&operator=(avl_multiset&&); + ~avl_multiset(); - // public member functions - iteratorbegin(); - const_iteratorbegin()const; - const_iteratorcbegin()const; - iteratorend(); - const_iteratorend()const; - const_iteratorcend()const; - reverse_iteratorrbegin(); - const_reverse_iteratorrbegin()const; - const_reverse_iteratorcrbegin()const; - reverse_iteratorrend(); - const_reverse_iteratorrend()const; - const_reverse_iteratorcrend()const; - key_comparekey_comp()const; - value_comparevalue_comp()const; - boolempty()const; - size_typesize()const; - voidswap(avl_multiset&); + // public member functions + iteratorbegin(); + const_iteratorbegin()const; + const_iteratorcbegin()const; + iteratorend(); + const_iteratorend()const; + const_iteratorcend()const; + reverse_iteratorrbegin(); + const_reverse_iteratorrbegin()const; + const_reverse_iteratorcrbegin()const; + reverse_iteratorrend(); + const_reverse_iteratorrend()const; + const_reverse_iteratorcrend()const; + key_comparekey_comp()const; + value_comparevalue_comp()const; + boolempty()const; + size_typesize()const; + voidswap(avl_multiset&);template<typename Cloner,typename Disposer> - voidclone_from(constavl_multiset&,Cloner,Disposer); + voidclone_from(constavl_multiset&,Cloner,Disposer);template<typename Cloner,typename Disposer> - voidclone_from(avl_multiset&&,Cloner,Disposer); - iteratorinsert(reference); - iteratorinsert(const_iterator,reference); - template<typename Iterator>voidinsert(Iterator,Iterator); - iteratorinsert_before(const_iterator,reference); - voidpush_back(reference); - voidpush_front(reference); - iteratorerase(const_iterator); - iteratorerase(const_iterator,const_iterator); - size_typeerase(constkey_type&); + voidclone_from(avl_multiset&&,Cloner,Disposer); + iteratorinsert(reference); + iteratorinsert(const_iterator,reference); + template<typename Iterator>voidinsert(Iterator,Iterator); + iteratorinsert_before(const_iterator,reference); + voidpush_back(reference); + voidpush_front(reference); + iteratorerase(const_iterator); + iteratorerase(const_iterator,const_iterator); + size_typeerase(constkey_type&);template<typename KeyType,typename KeyTypeKeyCompare> - size_typeerase(constKeyType&,KeyTypeKeyCompare); + size_typeerase(constKeyType&,KeyTypeKeyCompare);template<typename Disposer> - iteratorerase_and_dispose(const_iterator,Disposer); + iteratorerase_and_dispose(const_iterator,Disposer);template<typename Disposer> - iteratorerase_and_dispose(const_iterator,const_iterator,Disposer); + iteratorerase_and_dispose(const_iterator,const_iterator,Disposer);template<typename Disposer> - size_typeerase_and_dispose(constkey_type&,Disposer); + size_typeerase_and_dispose(constkey_type&,Disposer);template<typename KeyType,typename KeyTypeKeyCompare,typename Disposer> - size_typeerase_and_dispose(constKeyType&,KeyTypeKeyCompare,Disposer); - voidclear(); - template<typename Disposer>voidclear_and_dispose(Disposer); - size_typecount(constkey_type&)const; + size_typeerase_and_dispose(constKeyType&,KeyTypeKeyCompare,Disposer); + voidclear(); + template<typename Disposer>voidclear_and_dispose(Disposer); + size_typecount(constkey_type&)const;template<typename KeyType,typename KeyTypeKeyCompare> - size_typecount(constKeyType&,KeyTypeKeyCompare)const; - iteratorlower_bound(constkey_type&); + size_typecount(constKeyType&,KeyTypeKeyCompare)const; + iteratorlower_bound(constkey_type&);template<typename KeyType,typename KeyTypeKeyCompare> - iteratorlower_bound(constKeyType&,KeyTypeKeyCompare); - const_iteratorlower_bound(constkey_type&)const; + iteratorlower_bound(constKeyType&,KeyTypeKeyCompare); + const_iteratorlower_bound(constkey_type&)const;template<typename KeyType,typename KeyTypeKeyCompare> - const_iteratorlower_bound(constKeyType&,KeyTypeKeyCompare)const; - iteratorupper_bound(constkey_type&); + const_iteratorlower_bound(constKeyType&,KeyTypeKeyCompare)const; + iteratorupper_bound(constkey_type&);template<typename KeyType,typename KeyTypeKeyCompare> - iteratorupper_bound(constKeyType&,KeyTypeKeyCompare); - const_iteratorupper_bound(constkey_type&)const; + iteratorupper_bound(constKeyType&,KeyTypeKeyCompare); + const_iteratorupper_bound(constkey_type&)const;template<typename KeyType,typename KeyTypeKeyCompare> - const_iteratorupper_bound(constKeyType&,KeyTypeKeyCompare)const; - iteratorfind(constkey_type&); + const_iteratorupper_bound(constKeyType&,KeyTypeKeyCompare)const; + iteratorfind(constkey_type&);template<typename KeyType,typename KeyTypeKeyCompare> - iteratorfind(constKeyType&,KeyTypeKeyCompare); - const_iteratorfind(constkey_type&)const; + iteratorfind(constKeyType&,KeyTypeKeyCompare); + const_iteratorfind(constkey_type&)const;template<typename KeyType,typename KeyTypeKeyCompare> - const_iteratorfind(constKeyType&,KeyTypeKeyCompare)const; - std::pair<iterator,iterator>equal_range(constkey_type&); + const_iteratorfind(constKeyType&,KeyTypeKeyCompare)const; + std::pair<iterator,iterator>equal_range(constkey_type&);template<typename KeyType,typename KeyTypeKeyCompare>std::pair<iterator,iterator> - equal_range(constKeyType&,KeyTypeKeyCompare); + equal_range(constKeyType&,KeyTypeKeyCompare);std::pair<const_iterator,const_iterator> - equal_range(constkey_type&)const; + equal_range(constkey_type&)const;template<typename KeyType,typename KeyTypeKeyCompare>std::pair<const_iterator,const_iterator> - equal_range(constKeyType&,KeyTypeKeyCompare)const; + equal_range(constKeyType&,KeyTypeKeyCompare)const;std::pair<iterator,iterator> - bounded_range(constkey_type&,constkey_type&,bool,bool); + bounded_range(constkey_type&,constkey_type&,bool,bool);template<typename KeyType,typename KeyTypeKeyCompare>std::pair<iterator,iterator> - bounded_range(constKeyType&,constKeyType&,KeyTypeKeyCompare,bool, + bounded_range(constKeyType&,constKeyType&,KeyTypeKeyCompare,bool,bool);std::pair<const_iterator,const_iterator> - bounded_range(constkey_type&,constkey_type&key,bool,bool)const; + bounded_range(constkey_type&,constkey_type&key,bool,bool)const;template<typename KeyType,typename KeyTypeKeyCompare>std::pair<const_iterator,const_iterator> - bounded_range(constKeyType&,constKeyType&,KeyTypeKeyCompare,bool, + bounded_range(constKeyType&,constKeyType&,KeyTypeKeyCompare,bool,bool)const; - iteratoriterator_to(reference); - const_iteratoriterator_to(const_reference)const; - pointerunlink_leftmost_without_rebalance(); - voidreplace_node(iterator,reference); - voidremove_node(reference); + iteratoriterator_to(reference); + const_iteratoriterator_to(const_reference)const; + pointerunlink_leftmost_without_rebalance(); + voidreplace_node(iterator,reference); + voidremove_node(reference); - // public static functions - staticavl_multiset&container_from_end_iterator(iterator); - staticconstavl_multiset&container_from_end_iterator(const_iterator); - staticavl_multiset&container_from_iterator(iterator); - staticconstavl_multiset&container_from_iterator(const_iterator); - staticiterators_iterator_to(reference); - staticconst_iterators_iterator_to(const_reference); - staticvoidinit_node(reference); + // public static functions + staticavl_multiset&container_from_end_iterator(iterator); + staticconstavl_multiset&container_from_end_iterator(const_iterator); + staticavl_multiset&container_from_iterator(iterator); + staticconstavl_multiset&container_from_iterator(const_iterator); + staticiterators_iterator_to(reference); + staticconst_iterators_iterator_to(const_reference); + staticvoidinit_node(reference);// public data membersstaticconstboolconstant_time_size;};
    -

    Description

    +

    Description

    The class template avl_multiset is an intrusive container, that mimics most of the interface of std::_multiset as described in the C++ standard.

    The template parameter T is the type to be managed by the container. The user can specify additional options and if no options are provided default options are used.

    The container supports the following options: base_hook<>/member_hook<>/value_traits<>, constant_time_size<>, size_type<> and compare<>.

    -

    +

    avl_multiset public construct/copy/destruct

    1. -
      explicit avl_multiset(const key_compare & cmp = key_compare(), 
+
      explicit avl_multiset(const key_compare & cmp = key_compare(), 
                       const value_traits & v_traits = value_traits());
      
 
      Effects: Constructs an empty container.
      
 
      Complexity: Constant.
      
@@ -192,7 +192,7 @@
 
    2. template<typename Iterator> 
-  avl_multiset(Iterator b, Iterator e, 
+  avl_multiset(Iterator b, Iterator e, 
                const key_compare & cmp = key_compare(), 
                const value_traits & v_traits = value_traits());

      Requires: Dereferencing iterator must yield an lvalue of type value_type. cmp must be a comparison function that induces a strict weak ordering.

      @@ -201,15 +201,15 @@

      Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor/operator() of the key_compare object throws. Basic guarantee.

    3. -
      avl_multiset(avl_multiset && x);
      +
      avl_multiset(avl_multiset && x);

      Effects: to-do

    4. -
      avl_multiset & operator=(avl_multiset && x);
      +
      avl_multiset & operator=(avl_multiset && x);

      Effects: to-do

    5. -
      ~avl_multiset();
      +
      ~avl_multiset();

      Effects: Detaches all elements from this. The objects in the set are not deleted (i.e. no destructors are called), but the nodes according to the value_traits template parameter are reinitialized and thus can be reused.

      Complexity: Linear to elements contained in *this.

      Throws: Nothing.

      @@ -217,114 +217,114 @@
    -

    -avl_multiset public member functions

    +

    +avl_multiset public member functions

    1. -
      iterator begin();
      +
      iterator begin();

      Effects: Returns an iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    2. -
      const_iterator begin() const;
      +
      const_iterator begin() const;

      Effects: Returns a const_iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    3. -
      const_iterator cbegin() const;
      +
      const_iterator cbegin() const;

      Effects: Returns a const_iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    4. -
      iterator end();
      +
      iterator end();

      Effects: Returns an iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    5. -
      const_iterator end() const;
      +
      const_iterator end() const;

      Effects: Returns a const_iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    6. -
      const_iterator cend() const;
      +
      const_iterator cend() const;

      Effects: Returns a const_iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    7. -
      reverse_iterator rbegin();
      +
      reverse_iterator rbegin();

      Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    8. -
      const_reverse_iterator rbegin() const;
      +
      const_reverse_iterator rbegin() const;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    9. -
      const_reverse_iterator crbegin() const;
      +
      const_reverse_iterator crbegin() const;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    10. -
      reverse_iterator rend();
      +
      reverse_iterator rend();

      Effects: Returns a reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    11. -
      const_reverse_iterator rend() const;
      +
      const_reverse_iterator rend() const;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    12. -
      const_reverse_iterator crend() const;
      +
      const_reverse_iterator crend() const;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    13. -
      key_compare key_comp() const;
      +
      key_compare key_comp() const;

      Effects: Returns the key_compare object used by the container.

      Complexity: Constant.

      Throws: If key_compare copy-constructor throws.

    14. -
      value_compare value_comp() const;
      +
      value_compare value_comp() const;

      Effects: Returns the value_compare object used by the container.

      Complexity: Constant.

      Throws: If value_compare copy-constructor throws.

    15. -
      bool empty() const;
      +
      bool empty() const;

      Effects: Returns true if the container is empty.

      Complexity: Constant.

      Throws: Nothing.

    16. -
      size_type size() const;
      +
      size_type size() const;

      Effects: Returns the number of elements stored in the container.

      Complexity: Linear to elements contained in *this if constant-time size option is disabled. Constant time otherwise.

      Throws: Nothing.

    17. -
      void swap(avl_multiset & other);
      +
      void swap(avl_multiset & other);

      Effects: Swaps the contents of two containers.

      Complexity: Constant.

      Throws: If the comparison functor's swap call throws. 

    18. template<typename Cloner, typename Disposer> 
-  void clone_from(const avl_multiset & src, Cloner cloner, Disposer disposer);
      + void clone_from(const avl_multiset & src, Cloner cloner, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

      Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(const_reference ) and inserts them on *this. Copies the predicate from the source container.

      If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

      @@ -333,7 +333,7 @@ 
    19. template<typename Cloner, typename Disposer> 
-  void clone_from(avl_multiset && src, Cloner cloner, Disposer disposer);
      + void clone_from(avl_multiset && src, Cloner cloner, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

      Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(reference) and inserts them on *this. Copies the predicate from the source container.

      If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

      @@ -342,7 +342,7 @@

      Note: This version can modify the source container, useful to implement move semantics.

    20. -
      iterator insert(reference value);
      +
      iterator insert(reference value);

      Requires: value must be an lvalue

      Effects: Inserts value into the container before the upper bound.

      Complexity: Average complexity for insert element is at most logarithmic.

      @@ -350,7 +350,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    21. -
      iterator insert(const_iterator hint, reference value);
      +
      iterator insert(const_iterator hint, reference value);

      Requires: value must be an lvalue, and "hint" must be a valid iterator.

      Effects: Inserts x into the container, using "hint" as a hint to where it will be inserted. If "hint" is the upper_bound the insertion takes constant time (two comparisons in the worst case)

      Complexity: Logarithmic in general, but it is amortized constant time if t is inserted immediately before hint.

      @@ -358,7 +358,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    22. -
      template<typename Iterator> void insert(Iterator b, Iterator e);
      +
      template<typename Iterator> void insert(Iterator b, Iterator e);

      Requires: Dereferencing iterator must yield an lvalue of type value_type.

      Effects: Inserts a each element of a range into the container before the upper bound of the key of each element.

      Complexity: Insert range is in general O(N * log(N)), where N is the size of the range. However, it is linear in N if the range is already sorted by value_comp().

      @@ -366,7 +366,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    23. -
      iterator insert_before(const_iterator pos, reference value);
      +
      iterator insert_before(const_iterator pos, reference value);

      Requires: value must be an lvalue, "pos" must be a valid iterator (or end) and must be the succesor of value once inserted according to the predicate

      Effects: Inserts x into the container before "pos".

      Complexity: Constant time.

      @@ -374,7 +374,7 @@

      Note: This function does not check preconditions so if "pos" is not the successor of "value" container ordering invariant will be broken. This is a low-level function to be used only for performance reasons by advanced users.

    24. -
      void push_back(reference value);
      +
      void push_back(reference value);

      Requires: value must be an lvalue, and it must be no less than the greatest inserted key

      Effects: Inserts x into the container in the last position.

      Complexity: Constant time.

      @@ -382,7 +382,7 @@

      Note: This function does not check preconditions so if value is less than the greatest inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

    25. -
      void push_front(reference value);
      +
      void push_front(reference value);

      Requires: value must be an lvalue, and it must be no greater than the minimum inserted key

      Effects: Inserts x into the container in the first position.

      Complexity: Constant time.

      @@ -390,21 +390,21 @@

      Note: This function does not check preconditions so if value is greater than the minimum inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

    26. -
      iterator erase(const_iterator i);
      +
      iterator erase(const_iterator i);

      Effects: Erases the element pointed to by i.

      Complexity: Average complexity for erase element is constant time.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    27. -
      iterator erase(const_iterator b, const_iterator e);
      +
      iterator erase(const_iterator b, const_iterator e);

      Effects: Erases the range pointed to by b end e.

      Complexity: Average complexity for erase range is at most O(log(size() + N)), where N is the number of elements in the range.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    28. -
      size_type erase(const key_type & key);
      +
      size_type erase(const key_type & key);

      Effects: Erases all the elements with the given value.

      Returns: The number of erased elements.

      Complexity: O(log(size() + N).

      @@ -413,7 +413,8 @@ 
    29. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type erase(const KeyType & key, KeyTypeKeyCompare comp);
      + size_type erase(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Erases all the elements with the given key. according to the comparison functor "comp".

      Returns: The number of erased elements.

      Complexity: O(log(size() + N).

      @@ -422,7 +423,7 @@ 
    30. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator i, Disposer disposer);
      + iterator erase_and_dispose(const_iterator i, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases the element pointed to by i. Disposer::operator()(pointer) is called for the removed element.

      Complexity: Average complexity for erase element is constant time.

      @@ -431,7 +432,7 @@ 
    31. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator b, const_iterator e, 
+  iterator erase_and_dispose(const_iterator b, const_iterator e, 
                              Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases the range pointed to by b end e. Disposer::operator()(pointer) is called for the removed elements.

      @@ -441,7 +442,7 @@ 
    32. template<typename Disposer> 
-  size_type erase_and_dispose(const key_type & key, Disposer disposer);
      + size_type erase_and_dispose(const key_type & key, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases all the elements with the given value. Disposer::operator()(pointer) is called for the removed elements.

      Returns: The number of erased elements.

      @@ -451,8 +452,9 @@ 
    33. template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> 
-  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
+  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
                               Disposer disposer);
      +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk) and nk the key_type of a value_type inserted into *this.

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases all the elements with the given key. according to the comparison functor "comp". Disposer::operator()(pointer) is called for the removed elements.

      Returns: The number of erased elements.

      @@ -461,46 +463,47 @@

      Note: Invalidates the iterators to the erased elements.

    34. -
      void clear();
      +
      void clear();

      Effects: Erases all of the elements.

      Complexity: Linear to the number of elements on the container. if it's a safe-mode or auto-unlink value_type. Constant time otherwise.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    35. -
      template<typename Disposer> void clear_and_dispose(Disposer disposer);
      +
      template<typename Disposer> void clear_and_dispose(Disposer disposer);

      Effects: Erases all of the elements calling disposer(p) for each node to be erased. Complexity: Average complexity for is at most O(log(size() + N)), where N is the number of elements in the container.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. Calls N times to disposer functor.

    36. -
      size_type count(const key_type & key) const;
      +
      size_type count(const key_type & key) const;

      Effects: Returns the number of contained elements with the given value

      Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given value.

      Throws: If key_compare throws. 

    37. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;
      + size_type count(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      Effects: Returns the number of contained elements with the given key

      Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given key.

      Throws: If comp throws.

    38. -
      iterator lower_bound(const key_type & key);
      +
      iterator lower_bound(const key_type & key);

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    39. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      -

      Throws: If comp throws.

      +

      Throws: If key_compare throws.

    40. -
      const_iterator lower_bound(const key_type & key) const;
      +
      const_iterator lower_bound(const key_type & key) const;

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -508,26 +511,27 @@ 
    41. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
      -

      Effects: Returns a const iterator to the first element whose key is not less than k or end() if that element does not exist.

      + lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      -

      Throws: If comp throws.

      +

      Throws: If key_compare throws.

    42. -
      iterator upper_bound(const key_type & key);
      +
      iterator upper_bound(const key_type & key);

      Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    43. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    44. -
      const_iterator upper_bound(const key_type & key) const;
      +
      const_iterator upper_bound(const key_type & key) const;

      Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -535,39 +539,42 @@ 
    45. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
      + upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    46. -
      iterator find(const key_type & key);
      +
      iterator find(const key_type & key);

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    47. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator find(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator find(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    48. -
      const_iterator find(const key_type & key) const;
      -

      Effects: Finds a const_iterator to the first element whose key is k or end() if that element does not exist.

      +
      const_iterator find(const key_type & key) const;
      +

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    49. template<typename KeyType, typename KeyTypeKeyCompare> 
-  const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;
      -

      Effects: Finds a const_iterator to the first element whose key is k or end() if that element does not exist.

      + const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      +

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    50. -
      std::pair< iterator, iterator > equal_range(const key_type & key);
      +
      std::pair< iterator, iterator > equal_range(const key_type & key);

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -575,14 +582,15 @@ 
    51. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp);
      + equal_range(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If comp throws. 

    52. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & key) const;
      +equal_range(const key_type & key) const;

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -590,16 +598,18 @@ 
    53. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;
      + equal_range(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If comp throws. 

    54. std::pair< iterator, iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed);
      -

      Requires: 'lower_key' must not be greater than 'upper_key'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key) if left_closed, upper_bound(lower_key) otherwise

      second = upper_bound(upper_key) if right_closed, lower_bound(upper_key) otherwise

      @@ -611,9 +621,12 @@ 
    55. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed);
      -

      Requires: KeyTypeKeyCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the container. 'lower_key' must not be greater than 'upper_key' according to 'comp'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

      +

      upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

      +

      upper_key shall not precede lower_key according to comp [comp(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!comp(upper_key, lower_key) && !comp(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key, comp) if left_closed, upper_bound(lower_key, comp) otherwise

      second = upper_bound(upper_key, comp) if right_closed, lower_bound(upper_key, comp) otherwise

      @@ -624,9 +637,10 @@ 
    56. std::pair< const_iterator, const_iterator > 
-bounded_range(const key_type & lower_key, const key_type &key upper_key, 
+bounded_range(const key_type & lower_key, const key_type &key upper_key, 
               bool left_closed, bool right_closed) const;
      -

      Requires: 'lower_key' must not be greater than 'upper_key'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key) if left_closed, upper_bound(lower_key) otherwise

      second = upper_bound(upper_key) if right_closed, lower_bound(upper_key) otherwise

      @@ -638,9 +652,12 @@ 
    57. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed) const;
      -

      Requires: KeyTypeKeyCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the container. 'lower_key' must not be greater than 'upper_key' according to 'comp'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

      +

      upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

      +

      upper_key shall not precede lower_key according to comp [comp(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!comp(upper_key, lower_key) && !comp(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key, comp) if left_closed, upper_bound(lower_key, comp) otherwise

      second = upper_bound(upper_key, comp) if right_closed, lower_bound(upper_key, comp) otherwise

      @@ -650,28 +667,28 @@

      Note: Experimental function, the interface might change in future releases.

    58. -
      iterator iterator_to(reference value);
      +
      iterator iterator_to(reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      Throws: Nothing.

    59. -
      const_iterator iterator_to(const_reference value) const;
      +
      const_iterator iterator_to(const_reference value) const;

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid const_iterator i belonging to the set that points to the value

      Complexity: Constant.

      Throws: Nothing.

    60. -
      pointer unlink_leftmost_without_rebalance();
      +
      pointer unlink_leftmost_without_rebalance();

      Effects: Unlinks the leftmost node from the container.

      Complexity: Average complexity is constant time.

      Throws: Nothing.

      Notes: This function breaks the container and the container can only be used for more unlink_leftmost_without_rebalance calls. This function is normally used to achieve a step by step controlled destruction of the container.

    61. -
      void replace_node(iterator replace_this, reference with_this);
      +
      void replace_node(iterator replace_this, reference with_this);

      Requires: replace_this must be a valid iterator of *this and with_this must not be inserted in any container.

      Effects: Replaces replace_this in its position in the container with with_this. The container does not need to be rebalanced.

      Complexity: Constant.

      @@ -679,7 +696,7 @@

      Note: This function will break container ordering invariants if with_this is not equivalent to *replace_this according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing or comparison is needed.

    62. -
      void remove_node(reference value);
      +
      void remove_node(reference value);

      Effects: removes "value" from the container.

      Throws: Nothing.

      Complexity: Logarithmic time.

      @@ -689,11 +706,11 @@
    -

    -avl_multiset public static functions

    +

    +avl_multiset public static functions

    1. -
      static avl_multiset & container_from_end_iterator(iterator end_iterator);
      +
      static avl_multiset & container_from_end_iterator(iterator end_iterator);

      Precondition: end_iterator must be a valid end iterator of the container.

      Effects: Returns a const reference to the container associated to the end iterator

      Throws: Nothing.

      @@ -701,28 +718,28 @@ 
    2. static const avl_multiset & 
-container_from_end_iterator(const_iterator end_iterator);
      +container_from_end_iterator(const_iterator end_iterator);

      Precondition: end_iterator must be a valid end iterator of the container.

      Effects: Returns a const reference to the container associated to the end iterator

      Throws: Nothing.

      Complexity: Constant.

    3. -
      static avl_multiset & container_from_iterator(iterator it);
      +
      static avl_multiset & container_from_iterator(iterator it);

      Precondition: it must be a valid iterator of the container.

      Effects: Returns a const reference to the container associated to the iterator

      Throws: Nothing.

      Complexity: Logarithmic.

    4. -
      static const avl_multiset & container_from_iterator(const_iterator it);
      +
      static const avl_multiset & container_from_iterator(const_iterator it);

      Precondition: it must be a valid iterator of the container.

      Effects: Returns a const reference to the container associated to the iterator

      Throws: Nothing.

      Complexity: Logarithmic.

    5. -
      static iterator s_iterator_to(reference value);
      +
      static iterator s_iterator_to(reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      @@ -730,7 +747,7 @@

      Note: This static function is available only if the value traits is stateless.

    6. -
      static const_iterator s_iterator_to(const_reference value);
      +
      static const_iterator s_iterator_to(const_reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      @@ -738,7 +755,7 @@

      Note: This static function is available only if the value traits is stateless.

    7. -
      static void init_node(reference value);
      +
      static void init_node(reference value);

      Requires: value shall not be in a container.

      Effects: init_node puts the hook of a value in a well-known default state.

      Throws: Nothing.

      diff --git a/doc/html/boost/intrusive/avl_set.html b/doc/html/boost/intrusive/avl_set.html index 1bd3f894bb..6dcbab2bf4 100644 --- a/doc/html/boost/intrusive/avl_set.html +++ b/doc/html/boost/intrusive/avl_set.html @@ -60,139 +60,139 @@ typedef implementation_defined::node_algorithms node_algorithms; // construct/copy/destruct - explicit avl_set(const key_compare & = key_compare(), + explicit avl_set(const key_compare & = key_compare(), const value_traits & = value_traits()); template<typename Iterator> - avl_set(Iterator, Iterator, const key_compare & = key_compare(), + avl_set(Iterator, Iterator, const key_compare & = key_compare(), const value_traits & = value_traits()); - avl_set(avl_set &&); - avl_set & operator=(avl_set &&); - ~avl_set(); + avl_set(avl_set &&); + avl_set & operator=(avl_set &&); + ~avl_set(); - // public member functions - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end(); - const_iterator end() const; - const_iterator cend() const; - reverse_iterator avlegin(); - const_reverse_iterator avlegin() const; - const_reverse_iterator crbegin() const; - reverse_iterator rend(); - const_reverse_iterator rend() const; - const_reverse_iterator crend() const; - key_compare key_comp() const; - value_compare value_comp() const; - bool empty() const; - size_type size() const; - void swap(avl_set &); + // public member functions + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end(); + const_iterator end() const; + const_iterator cend() const; + reverse_iterator avlegin(); + const_reverse_iterator avlegin() const; + const_reverse_iterator crbegin() const; + reverse_iterator rend(); + const_reverse_iterator rend() const; + const_reverse_iterator crend() const; + key_compare key_comp() const; + value_compare value_comp() const; + bool empty() const; + size_type size() const; + void swap(avl_set &); template<typename Cloner, typename Disposer> - void clone_from(const avl_set &, Cloner, Disposer); + void clone_from(const avl_set &, Cloner, Disposer); template<typename Cloner, typename Disposer> - void clone_from(avl_set &&, Cloner, Disposer); - std::pair< iterator, bool > insert(reference); - iterator insert(const_iterator, reference); + void clone_from(avl_set &&, Cloner, Disposer); + std::pair< iterator, bool > insert(reference); + iterator insert(const_iterator, reference); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, bool > - insert_check(const KeyType &, KeyTypeKeyCompare, insert_commit_data &); + insert_check(const KeyType &, KeyTypeKeyCompare, insert_commit_data &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, bool > - insert_check(const_iterator, const KeyType &, KeyTypeKeyCompare, + insert_check(const_iterator, const KeyType &, KeyTypeKeyCompare, insert_commit_data &); - template<typename Iterator> void insert(Iterator, Iterator); - iterator insert_commit(reference, const insert_commit_data &); - iterator insert_before(const_iterator, reference); - void push_back(reference); - void push_front(reference); - iterator erase(const_iterator); - iterator erase(const_iterator, const_iterator); - size_type erase(const key_type &); + template<typename Iterator> void insert(Iterator, Iterator); + iterator insert_commit(reference, const insert_commit_data &); + iterator insert_before(const_iterator, reference); + void push_back(reference); + void push_front(reference); + iterator erase(const_iterator); + iterator erase(const_iterator, const_iterator); + size_type erase(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - size_type erase(const KeyType &, KeyTypeKeyCompare); + size_type erase(const KeyType &, KeyTypeKeyCompare); template<typename Disposer> - iterator erase_and_dispose(const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, Disposer); template<typename Disposer> - iterator erase_and_dispose(const_iterator, const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, const_iterator, Disposer); template<typename Disposer> - size_type erase_and_dispose(const key_type &, Disposer); + size_type erase_and_dispose(const key_type &, Disposer); template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> - size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); - void clear(); - template<typename Disposer> void clear_and_dispose(Disposer); - size_type count(const key_type &) const; + size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); + void clear(); + template<typename Disposer> void clear_and_dispose(Disposer); + size_type count(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - size_type count(const KeyType &, KeyTypeKeyCompare) const; - iterator lower_bound(const key_type &); + size_type count(const KeyType &, KeyTypeKeyCompare) const; + iterator lower_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator lower_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator lower_bound(const key_type &) const; + iterator lower_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator lower_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator upper_bound(const key_type &); + const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator upper_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator upper_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator upper_bound(const key_type &) const; + iterator upper_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator upper_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator find(const key_type &); + const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator find(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator find(const KeyType &, KeyTypeKeyCompare); - const_iterator find(const key_type &) const; + iterator find(const KeyType &, KeyTypeKeyCompare); + const_iterator find(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator find(const KeyType &, KeyTypeKeyCompare) const; - std::pair< iterator, iterator > equal_range(const key_type &); + const_iterator find(const KeyType &, KeyTypeKeyCompare) const; + std::pair< iterator, iterator > equal_range(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - equal_range(const KeyType &, KeyTypeKeyCompare); + equal_range(const KeyType &, KeyTypeKeyCompare); std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; + equal_range(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - equal_range(const KeyType &, KeyTypeKeyCompare) const; + equal_range(const KeyType &, KeyTypeKeyCompare) const; std::pair< iterator, iterator > - bounded_range(const key_type &, const key_type &, bool, bool); + bounded_range(const key_type &, const key_type &, bool, bool); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool); std::pair< const_iterator, const_iterator > - bounded_range(const key_type &, const key_type &, bool, bool) const; + bounded_range(const key_type &, const key_type &, bool, bool) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool) const; - iterator iterator_to(reference); - const_iterator iterator_to(const_reference) const; - pointer unlink_leftmost_without_rebalance(); - void replace_node(iterator, reference); - void remove_node(reference); + iterator iterator_to(reference); + const_iterator iterator_to(const_reference) const; + pointer unlink_leftmost_without_rebalance(); + void replace_node(iterator, reference); + void remove_node(reference); - // public static functions - static avl_set & container_from_end_iterator(iterator); - static const avl_set & container_from_end_iterator(const_iterator); - static avl_set & container_from_iterator(iterator); - static const avl_set & container_from_iterator(const_iterator); - static iterator s_iterator_to(reference); - static const_iterator s_iterator_to(const_reference); - static void init_node(reference); + // public static functions + static avl_set & container_from_end_iterator(iterator); + static const avl_set & container_from_end_iterator(const_iterator); + static avl_set & container_from_iterator(iterator); + static const avl_set & container_from_iterator(const_iterator); + static iterator s_iterator_to(reference); + static const_iterator s_iterator_to(const_reference); + static void init_node(reference); // public data members static const bool constant_time_size; };
    -

    Description

    +

    Description

    The class template avl_set is an intrusive container, that mimics most of the interface of std::set as described in the C++ standard.

    The template parameter T is the type to be managed by the container. The user can specify additional options and if no options are provided default options are used.

    The container supports the following options: base_hook<>/member_hook<>/value_traits<>, constant_time_size<>, size_type<> and compare<>.

    -

    +

    avl_set public construct/copy/destruct

    1. -
      explicit avl_set(const key_compare & cmp = key_compare(), 
+
      explicit avl_set(const key_compare & cmp = key_compare(), 
                  const value_traits & v_traits = value_traits());
      
 
      Effects: Constructs an empty container.
      
 
      Complexity: Constant.
      
@@ -200,7 +200,7 @@
 
    2. template<typename Iterator> 
-  avl_set(Iterator b, Iterator e, const key_compare & cmp = key_compare(), 
+  avl_set(Iterator b, Iterator e, const key_compare & cmp = key_compare(), 
           const value_traits & v_traits = value_traits());

      Requires: Dereferencing iterator must yield an lvalue of type value_type. cmp must be a comparison function that induces a strict weak ordering.

      Effects: Constructs an empty container and inserts elements from [b, e).

      @@ -208,15 +208,15 @@

      Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor/operator() of the key_compare object throws. Basic guarantee.

    3. -
      avl_set(avl_set && x);
      +
      avl_set(avl_set && x);

      Effects: to-do

    4. -
      avl_set & operator=(avl_set && x);
      +
      avl_set & operator=(avl_set && x);

      Effects: to-do

    5. -
      ~avl_set();
      +
      ~avl_set();

      Effects: Detaches all elements from this. The objects in the set are not deleted (i.e. no destructors are called), but the nodes according to the value_traits template parameter are reinitialized and thus can be reused.

      Complexity: Linear to elements contained in *this.

      Throws: Nothing.

      @@ -224,114 +224,114 @@
    -

    -avl_set public member functions

    +

    +avl_set public member functions

    1. -
      iterator begin();
      +
      iterator begin();

      Effects: Returns an iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    2. -
      const_iterator begin() const;
      +
      const_iterator begin() const;

      Effects: Returns a const_iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    3. -
      const_iterator cbegin() const;
      +
      const_iterator cbegin() const;

      Effects: Returns a const_iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    4. -
      iterator end();
      +
      iterator end();

      Effects: Returns an iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    5. -
      const_iterator end() const;
      +
      const_iterator end() const;

      Effects: Returns a const_iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    6. -
      const_iterator cend() const;
      +
      const_iterator cend() const;

      Effects: Returns a const_iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    7. -
      reverse_iterator avlegin();
      +
      reverse_iterator avlegin();

      Effects: Returns an iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    8. -
      const_reverse_iterator avlegin() const;
      +
      const_reverse_iterator avlegin() const;

      Effects: Returns a const_iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    9. -
      const_reverse_iterator crbegin() const;
      +
      const_reverse_iterator crbegin() const;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    10. -
      reverse_iterator rend();
      +
      reverse_iterator rend();

      Effects: Returns a reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    11. -
      const_reverse_iterator rend() const;
      +
      const_reverse_iterator rend() const;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    12. -
      const_reverse_iterator crend() const;
      +
      const_reverse_iterator crend() const;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    13. -
      key_compare key_comp() const;
      +
      key_compare key_comp() const;

      Effects: Returns the key_compare object used by the container.

      Complexity: Constant.

      Throws: If key_compare copy-constructor throws.

    14. -
      value_compare value_comp() const;
      +
      value_compare value_comp() const;

      Effects: Returns the value_compare object used by the container.

      Complexity: Constant.

      Throws: If value_compare copy-constructor throws.

    15. -
      bool empty() const;
      +
      bool empty() const;

      Effects: Returns true if the container is empty.

      Complexity: Constant.

      Throws: Nothing.

    16. -
      size_type size() const;
      +
      size_type size() const;

      Effects: Returns the number of elements stored in the container.

      Complexity: Linear to elements contained in *this if constant-time size option is disabled. Constant time otherwise.

      Throws: Nothing.

    17. -
      void swap(avl_set & other);
      +
      void swap(avl_set & other);

      Effects: Swaps the contents of two containers.

      Complexity: Constant.

      Throws: If the comparison functor's swap call throws. 

    18. template<typename Cloner, typename Disposer> 
-  void clone_from(const avl_set & src, Cloner cloner, Disposer disposer);
      + void clone_from(const avl_set & src, Cloner cloner, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

      Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(const_reference ) and inserts them on *this. Copies the predicate from the source container.

      If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

      @@ -340,7 +340,7 @@ 
    19. template<typename Cloner, typename Disposer> 
-  void clone_from(avl_set && src, Cloner cloner, Disposer disposer);
      + void clone_from(avl_set && src, Cloner cloner, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

      Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(reference) and inserts them on *this. Copies the predicate from the source container.

      If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

      @@ -349,7 +349,7 @@

      Note: This version can modify the source container, useful to implement move semantics.

    20. -
      std::pair< iterator, bool > insert(reference value);
      +
      std::pair< iterator, bool > insert(reference value);

      Requires: value must be an lvalue

      Effects: Inserts value into the container if the value is not already present.

      Complexity: Average complexity for insert element is at most logarithmic.

      @@ -357,7 +357,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    21. -
      iterator insert(const_iterator hint, reference value);
      +
      iterator insert(const_iterator hint, reference value);

      Requires: value must be an lvalue, and "hint" must be a valid iterator

      Effects: Tries to insert x into the container, using "hint" as a hint to where it will be inserted.

      Complexity: Logarithmic in general, but it is amortized constant time (two comparisons in the worst case) if t is inserted immediately before hint.

      @@ -367,7 +367,7 @@ 
    22. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, bool > 
-  insert_check(const KeyType & key, KeyTypeKeyCompare comp, 
+  insert_check(const KeyType & key, KeyTypeKeyCompare comp, 
                insert_commit_data & commit_data);

      Requires: comp must be a comparison function that induces the same strict weak ordering as key_compare. The difference is that comp compares an arbitrary key with the contained values.

      Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself.

      @@ -381,7 +381,7 @@ 
    23. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, bool > 
-  insert_check(const_iterator hint, const KeyType & key, 
+  insert_check(const_iterator hint, const KeyType & key, 
                KeyTypeKeyCompare comp, insert_commit_data & commit_data);

      Requires: comp must be a comparison function that induces the same strict weak ordering as key_compare. The difference is that comp compares an arbitrary key with the contained values.

      Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself, using "hint" as a hint to where it will be inserted.

      @@ -393,7 +393,7 @@

      "commit_data" remains valid for a subsequent "insert_commit" only if no more objects are inserted or erased from the container.

    24. -
      template<typename Iterator> void insert(Iterator b, Iterator e);
      +
      template<typename Iterator> void insert(Iterator b, Iterator e);

      Requires: Dereferencing iterator must yield an lvalue of type value_type.

      Effects: Tries to insert each element of a range into the container.

      Complexity: Insert range is in general O(N * log(N)), where N is the size of the range. However, it is linear in N if the range is already sorted by value_comp().

      @@ -401,7 +401,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    25. -
      iterator insert_commit(reference value, 
+
      iterator insert_commit(reference value, 
                        const insert_commit_data & commit_data);
      
 
      Requires: value must be an lvalue of type value_type. commit_data must have been obtained from a previous call to "insert_check". No objects should have been inserted or erased from the container between the "insert_check" that filled "commit_data" and the call to "insert_commit".
      
 
      Effects: Inserts the value in the container using the information obtained from the "commit_data" that a previous "insert_check" filled.
      
@@ -411,7 +411,7 @@
 
      Notes: This function has only sense if a "insert_check" has been previously executed to fill "commit_data". No value should be inserted or erased between the "insert_check" and "insert_commit" calls.
    26. -
      iterator insert_before(const_iterator pos, reference value);
      +
      iterator insert_before(const_iterator pos, reference value);

      Requires: value must be an lvalue, "pos" must be a valid iterator (or end) and must be the succesor of value once inserted according to the predicate

      Effects: Inserts x into the container before "pos".

      Complexity: Constant time.

      @@ -419,7 +419,7 @@

      Note: This function does not check preconditions so if "pos" is not the successor of "value" container ordering invariant will be broken. This is a low-level function to be used only for performance reasons by advanced users.

    27. -
      void push_back(reference value);
      +
      void push_back(reference value);

      Requires: value must be an lvalue, and it must be no less than the greatest inserted key

      Effects: Inserts x into the container in the last position.

      Complexity: Constant time.

      @@ -427,7 +427,7 @@

      Note: This function does not check preconditions so if value is less than the greatest inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

    28. -
      void push_front(reference value);
      +
      void push_front(reference value);

      Requires: value must be an lvalue, and it must be no greater than the minimum inserted key

      Effects: Inserts x into the container in the first position.

      Complexity: Constant time.

      @@ -435,21 +435,21 @@

      Note: This function does not check preconditions so if value is greater than the minimum inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

    29. -
      iterator erase(const_iterator i);
      +
      iterator erase(const_iterator i);

      Effects: Erases the element pointed to by i.

      Complexity: Average complexity for erase element is constant time.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    30. -
      iterator erase(const_iterator b, const_iterator e);
      +
      iterator erase(const_iterator b, const_iterator e);

      Effects: Erases the range pointed to by b end e.

      Complexity: Average complexity for erase range is at most O(log(size() + N)), where N is the number of elements in the range.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    31. -
      size_type erase(const key_type & key);
      +
      size_type erase(const key_type & key);

      Effects: Erases all the elements with the given value.

      Returns: The number of erased elements.

      Complexity: O(log(size() + N).

      @@ -458,7 +458,8 @@ 
    32. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type erase(const KeyType & key, KeyTypeKeyCompare comp);
      + size_type erase(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Erases all the elements with the given key. according to the comparison functor "comp".

      Returns: The number of erased elements.

      Complexity: O(log(size() + N).

      @@ -467,7 +468,7 @@ 
    33. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator i, Disposer disposer);
      + iterator erase_and_dispose(const_iterator i, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases the element pointed to by i. Disposer::operator()(pointer) is called for the removed element.

      Complexity: Average complexity for erase element is constant time.

      @@ -476,7 +477,7 @@ 
    34. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator b, const_iterator e, 
+  iterator erase_and_dispose(const_iterator b, const_iterator e, 
                              Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases the range pointed to by b end e. Disposer::operator()(pointer) is called for the removed elements.

      @@ -486,7 +487,7 @@ 
    35. template<typename Disposer> 
-  size_type erase_and_dispose(const key_type & key, Disposer disposer);
      + size_type erase_and_dispose(const key_type & key, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases all the elements with the given value. Disposer::operator()(pointer) is called for the removed elements.

      Returns: The number of erased elements.

      @@ -496,8 +497,9 @@ 
    36. template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> 
-  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
+  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
                               Disposer disposer);
      +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk) and nk the key_type of a value_type inserted into *this.

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases all the elements with the given key. according to the comparison functor "comp". Disposer::operator()(pointer) is called for the removed elements.

      Returns: The number of erased elements.

      @@ -506,46 +508,47 @@

      Note: Invalidates the iterators to the erased elements.

    37. -
      void clear();
      +
      void clear();

      Effects: Erases all of the elements.

      Complexity: Linear to the number of elements on the container. if it's a safe-mode or auto-unlink value_type. Constant time otherwise.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    38. -
      template<typename Disposer> void clear_and_dispose(Disposer disposer);
      +
      template<typename Disposer> void clear_and_dispose(Disposer disposer);

      Effects: Erases all of the elements calling disposer(p) for each node to be erased. Complexity: Average complexity for is at most O(log(size() + N)), where N is the number of elements in the container.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. Calls N times to disposer functor.

    39. -
      size_type count(const key_type & key) const;
      +
      size_type count(const key_type & key) const;

      Effects: Returns the number of contained elements with the given value

      Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given value.

      Throws: If key_compare throws. 

    40. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;
      + size_type count(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      Effects: Returns the number of contained elements with the given key

      Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given key.

      Throws: If comp throws.

    41. -
      iterator lower_bound(const key_type & key);
      +
      iterator lower_bound(const key_type & key);

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    42. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      -

      Throws: If comp throws.

      +

      Throws: If key_compare throws.

    43. -
      const_iterator lower_bound(const key_type & key) const;
      +
      const_iterator lower_bound(const key_type & key) const;

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -553,26 +556,27 @@ 
    44. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
      -

      Effects: Returns a const iterator to the first element whose key is not less than k or end() if that element does not exist.

      + lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      -

      Throws: If comp throws.

      +

      Throws: If key_compare throws.

    45. -
      iterator upper_bound(const key_type & key);
      +
      iterator upper_bound(const key_type & key);

      Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    46. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    47. -
      const_iterator upper_bound(const key_type & key) const;
      +
      const_iterator upper_bound(const key_type & key) const;

      Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -580,39 +584,42 @@ 
    48. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
      + upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    49. -
      iterator find(const key_type & key);
      +
      iterator find(const key_type & key);

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    50. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator find(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator find(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    51. -
      const_iterator find(const key_type & key) const;
      -

      Effects: Finds a const_iterator to the first element whose key is k or end() if that element does not exist.

      +
      const_iterator find(const key_type & key) const;
      +

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    52. template<typename KeyType, typename KeyTypeKeyCompare> 
-  const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;
      -

      Effects: Finds a const_iterator to the first element whose key is k or end() if that element does not exist.

      + const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      +

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    53. -
      std::pair< iterator, iterator > equal_range(const key_type & key);
      +
      std::pair< iterator, iterator > equal_range(const key_type & key);

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -620,14 +627,15 @@ 
    54. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp);
      + equal_range(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If comp throws. 

    55. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & key) const;
      +equal_range(const key_type & key) const;

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -635,16 +643,18 @@ 
    56. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;
      + equal_range(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If comp throws. 

    57. std::pair< iterator, iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed);
      -

      Requires: 'lower_key' must not be greater than 'upper_key'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key) if left_closed, upper_bound(lower_key) otherwise

      second = upper_bound(upper_key) if right_closed, lower_bound(upper_key) otherwise

      @@ -656,9 +666,12 @@ 
    58. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed);
      -

      Requires: KeyTypeKeyCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the container. 'lower_key' must not be greater than 'upper_key' according to 'comp'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

      +

      upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

      +

      upper_key shall not precede lower_key according to comp [comp(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!comp(upper_key, lower_key) && !comp(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key, comp) if left_closed, upper_bound(lower_key, comp) otherwise

      second = upper_bound(upper_key, comp) if right_closed, lower_bound(upper_key, comp) otherwise

      @@ -669,9 +682,10 @@ 
    59. std::pair< const_iterator, const_iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed) const;
      -

      Requires: 'lower_key' must not be greater than 'upper_key'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key) if left_closed, upper_bound(lower_key) otherwise

      second = upper_bound(upper_key) if right_closed, lower_bound(upper_key) otherwise

      @@ -683,9 +697,12 @@ 
    60. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed) const;
      -

      Requires: KeyTypeKeyCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the container. 'lower_key' must not be greater than 'upper_key' according to 'comp'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

      +

      upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

      +

      upper_key shall not precede lower_key according to comp [comp(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!comp(upper_key, lower_key) && !comp(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key, comp) if left_closed, upper_bound(lower_key, comp) otherwise

      second = upper_bound(upper_key, comp) if right_closed, lower_bound(upper_key, comp) otherwise

      @@ -695,28 +712,28 @@

      Note: Experimental function, the interface might change in future releases.

    61. -
      iterator iterator_to(reference value);
      +
      iterator iterator_to(reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      Throws: Nothing.

    62. -
      const_iterator iterator_to(const_reference value) const;
      +
      const_iterator iterator_to(const_reference value) const;

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid const_iterator i belonging to the set that points to the value

      Complexity: Constant.

      Throws: Nothing.

    63. -
      pointer unlink_leftmost_without_rebalance();
      +
      pointer unlink_leftmost_without_rebalance();

      Effects: Unlinks the leftmost node from the container.

      Complexity: Average complexity is constant time.

      Throws: Nothing.

      Notes: This function breaks the container and the container can only be used for more unlink_leftmost_without_rebalance calls. This function is normally used to achieve a step by step controlled destruction of the container.

    64. -
      void replace_node(iterator replace_this, reference with_this);
      +
      void replace_node(iterator replace_this, reference with_this);

      Requires: replace_this must be a valid iterator of *this and with_this must not be inserted in any container.

      Effects: Replaces replace_this in its position in the container with with_this. The container does not need to be rebalanced.

      Complexity: Constant.

      @@ -724,7 +741,7 @@

      Note: This function will break container ordering invariants if with_this is not equivalent to *replace_this according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing or comparison is needed.

    65. -
      void remove_node(reference value);
      +
      void remove_node(reference value);

      Effects: removes "value" from the container.

      Throws: Nothing.

      Complexity: Logarithmic time.

      @@ -734,11 +751,11 @@
    -

    -avl_set public static functions

    +

    +avl_set public static functions

    1. -
      static avl_set & container_from_end_iterator(iterator end_iterator);
      +
      static avl_set & container_from_end_iterator(iterator end_iterator);

      Precondition: end_iterator must be a valid end iterator of the container.

      Effects: Returns a const reference to the container associated to the end iterator

      Throws: Nothing.

      @@ -746,28 +763,28 @@ 
    2. static const avl_set & 
-container_from_end_iterator(const_iterator end_iterator);
      +container_from_end_iterator(const_iterator end_iterator);

      Precondition: end_iterator must be a valid end iterator of the container.

      Effects: Returns a const reference to the container associated to the end iterator

      Throws: Nothing.

      Complexity: Constant.

    3. -
      static avl_set & container_from_iterator(iterator it);
      +
      static avl_set & container_from_iterator(iterator it);

      Precondition: it must be a valid iterator of the container.

      Effects: Returns a const reference to the container associated to the iterator

      Throws: Nothing.

      Complexity: Logarithmic.

    4. -
      static const avl_set & container_from_iterator(const_iterator it);
      +
      static const avl_set & container_from_iterator(const_iterator it);

      Precondition: it must be a valid iterator of the container.

      Effects: Returns a const reference to the container associated to the iterator

      Throws: Nothing.

      Complexity: Logarithmic.

    5. -
      static iterator s_iterator_to(reference value);
      +
      static iterator s_iterator_to(reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      @@ -775,7 +792,7 @@

      Note: This static function is available only if the value traits is stateless.

    6. -
      static const_iterator s_iterator_to(const_reference value);
      +
      static const_iterator s_iterator_to(const_reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      @@ -783,7 +800,7 @@

      Note: This static function is available only if the value traits is stateless.

    7. -
      static void init_node(reference value);
      +
      static void init_node(reference value);

      Requires: value shall not be in a container.

      Effects: init_node puts the hook of a value in a well-known default state.

      Throws: Nothing.

      diff --git a/doc/html/boost/intrusive/avl_set_base_hook.html b/doc/html/boost/intrusive/avl_set_base_hook.html index 84685e6c2b..3bdf1be66c 100644 --- a/doc/html/boost/intrusive/avl_set_base_hook.html +++ b/doc/html/boost/intrusive/avl_set_base_hook.html @@ -38,18 +38,18 @@ { public: // construct/copy/destruct - avl_set_base_hook(); - avl_set_base_hook(const avl_set_base_hook &); - avl_set_base_hook & operator=(const avl_set_base_hook &); - ~avl_set_base_hook(); + avl_set_base_hook(); + avl_set_base_hook(const avl_set_base_hook &); + avl_set_base_hook & operator=(const avl_set_base_hook &); + ~avl_set_base_hook(); - // public member functions - void swap_nodes(avl_set_base_hook &); - bool is_linked() const; - void unlink(); + // public member functions + void swap_nodes(avl_set_base_hook &); + bool is_linked() const; + void unlink(); };
    -

    Description

    +

    Description

    Derive a class from avl_set_base_hook in order to store objects in in an avl_set/avl_multiset. avl_set_base_hook holds the data necessary to maintain the avl_set/avl_multiset and provides an appropriate value_traits class for avl_set/avl_multiset.

    The hook admits the following options: tag<>, void_pointer<>, link_mode<> and optimize_size<>.

    tag<> defines a tag to identify the node. The same tag value can be used in different classes, but if a class is derived from more than one list_base_hook, then each list_base_hook needs its unique tag.

    @@ -57,53 +57,53 @@

    link_mode<> will specify the linking mode of the hook (normal_link, auto_unlink or safe_link).

    optimize_size<> will tell the hook to optimize the hook for size instead of speed.

    -

    +

    avl_set_base_hook public construct/copy/destruct

    1. -
      avl_set_base_hook();
      +
      avl_set_base_hook();

      Effects: If link_mode is auto_unlink or safe_link initializes the node to an unlinked state.

      Throws: Nothing.

    2. -
      avl_set_base_hook(const avl_set_base_hook &);
      +
      avl_set_base_hook(const avl_set_base_hook &);

      Effects: If link_mode is auto_unlink or safe_link initializes the node to an unlinked state. The argument is ignored.

      Throws: Nothing.

      Rationale: Providing a copy-constructor makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

    3. -
      avl_set_base_hook & operator=(const avl_set_base_hook &);
      +
      avl_set_base_hook & operator=(const avl_set_base_hook &);

      Effects: Empty function. The argument is ignored.

      Throws: Nothing.

      Rationale: Providing an assignment operator makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

    4. -
      ~avl_set_base_hook();
      +
      ~avl_set_base_hook();

      Effects: If link_mode is normal_link, the destructor does nothing (ie. no code is generated). If link_mode is safe_link and the object is stored in a set an assertion is raised. If link_mode is auto_unlink and is_linked() is true, the node is unlinked.

      Throws: Nothing.

    -

    -avl_set_base_hook public member functions

    +

    +avl_set_base_hook public member functions

    1. -
      void swap_nodes(avl_set_base_hook & other);
      +
      void swap_nodes(avl_set_base_hook & other);

      Effects: Swapping two nodes swaps the position of the elements related to those nodes in one or two containers. That is, if the node this is part of the element e1, the node x is part of the element e2 and both elements are included in the containers s1 and s2, then after the swap-operation e1 is in s2 at the position of e2 and e2 is in s1 at the position of e1. If one element is not in a container, then after the swap-operation the other element is not in a container. Iterators to e1 and e2 related to those nodes are invalidated.

      Complexity: Constant

      Throws: Nothing.

    2. -
      bool is_linked() const;
      +
      bool is_linked() const;

      Precondition: link_mode must be safe_link or auto_unlink.

      Returns: true, if the node belongs to a container, false otherwise. This function can be used to test whether set::iterator_to will return a valid iterator.

      Complexity: Constant

    3. -
      void unlink();
      +
      void unlink();

      Effects: Removes the node if it's inserted in a container. This function is only allowed if link_mode is auto_unlink.

      Throws: Nothing.

      4. diff --git a/doc/html/boost/intrusive/avl_set_member_hook.html b/doc/html/boost/intrusive/avl_set_member_hook.html index 7054a69fd9..0215082b88 100644 --- a/doc/html/boost/intrusive/avl_set_member_hook.html +++ b/doc/html/boost/intrusive/avl_set_member_hook.html @@ -38,71 +38,71 @@ { public: // construct/copy/destruct - avl_set_member_hook(); - avl_set_member_hook(const avl_set_member_hook &); - avl_set_member_hook & operator=(const avl_set_member_hook &); - ~avl_set_member_hook(); + avl_set_member_hook(); + avl_set_member_hook(const avl_set_member_hook &); + avl_set_member_hook & operator=(const avl_set_member_hook &); + ~avl_set_member_hook(); - // public member functions - void swap_nodes(avl_set_member_hook &); - bool is_linked() const; - void unlink(); + // public member functions + void swap_nodes(avl_set_member_hook &); + bool is_linked() const; + void unlink(); };
    -

    Description

    +

    Description

    Put a public data member avl_set_member_hook in order to store objects of this class in an avl_set/avl_multiset. avl_set_member_hook holds the data necessary for maintaining the avl_set/avl_multiset and provides an appropriate value_traits class for avl_set/avl_multiset.

    The hook admits the following options: void_pointer<>, link_mode<> and optimize_size<>.

    void_pointer<> is the pointer type that will be used internally in the hook and the container configured to use this hook.

    link_mode<> will specify the linking mode of the hook (normal_link, auto_unlink or safe_link).

    optimize_size<> will tell the hook to optimize the hook for size instead of speed.

    -

    +

    avl_set_member_hook public construct/copy/destruct

    1. -
      avl_set_member_hook();
      +
      avl_set_member_hook();

      Effects: If link_mode is auto_unlink or safe_link initializes the node to an unlinked state.

      Throws: Nothing.

    2. -
      avl_set_member_hook(const avl_set_member_hook &);
      +
      avl_set_member_hook(const avl_set_member_hook &);

      Effects: If link_mode is auto_unlink or safe_link initializes the node to an unlinked state. The argument is ignored.

      Throws: Nothing.

      Rationale: Providing a copy-constructor makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

    3. -
      avl_set_member_hook & operator=(const avl_set_member_hook &);
      +
      avl_set_member_hook & operator=(const avl_set_member_hook &);

      Effects: Empty function. The argument is ignored.

      Throws: Nothing.

      Rationale: Providing an assignment operator makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

    4. -
      ~avl_set_member_hook();
      +
      ~avl_set_member_hook();

      Effects: If link_mode is normal_link, the destructor does nothing (ie. no code is generated). If link_mode is safe_link and the object is stored in a set an assertion is raised. If link_mode is auto_unlink and is_linked() is true, the node is unlinked.

      Throws: Nothing.

    -

    -avl_set_member_hook public member functions

    +

    +avl_set_member_hook public member functions

    1. -
      void swap_nodes(avl_set_member_hook & other);
      +
      void swap_nodes(avl_set_member_hook & other);

      Effects: Swapping two nodes swaps the position of the elements related to those nodes in one or two containers. That is, if the node this is part of the element e1, the node x is part of the element e2 and both elements are included in the containers s1 and s2, then after the swap-operation e1 is in s2 at the position of e2 and e2 is in s1 at the position of e1. If one element is not in a container, then after the swap-operation the other element is not in a container. Iterators to e1 and e2 related to those nodes are invalidated.

      Complexity: Constant

      Throws: Nothing.

    2. -
      bool is_linked() const;
      +
      bool is_linked() const;

      Precondition: link_mode must be safe_link or auto_unlink.

      Returns: true, if the node belongs to a container, false otherwise. This function can be used to test whether set::iterator_to will return a valid iterator.

      Complexity: Constant

    3. -
      void unlink();
      +
      void unlink();

      Effects: Removes the node if it's inserted in a container. This function is only allowed if link_mode is auto_unlink.

      Throws: Nothing.

      4. diff --git a/doc/html/boost/intrusive/avltree.html b/doc/html/boost/intrusive/avltree.html index db42e82e2a..c53762b7b1 100644 --- a/doc/html/boost/intrusive/avltree.html +++ b/doc/html/boost/intrusive/avltree.html @@ -60,143 +60,143 @@ typedef implementation_defined::insert_commit_data insert_commit_data; // construct/copy/destruct - explicit avltree(const key_compare & = key_compare(), + explicit avltree(const key_compare & = key_compare(), const value_traits & = value_traits()); template<typename Iterator> - avltree(bool, Iterator, Iterator, const key_compare & = key_compare(), + avltree(bool, Iterator, Iterator, const key_compare & = key_compare(), const value_traits & = value_traits()); - avltree(avltree &&); - avltree & operator=(avltree &&); - ~avltree(); + avltree(avltree &&); + avltree & operator=(avltree &&); + ~avltree(); - // public member functions - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end(); - const_iterator end() const; - const_iterator cend() const; - reverse_iterator rbegin(); - const_reverse_iterator rbegin() const; - const_reverse_iterator crbegin() const; - reverse_iterator rend(); - const_reverse_iterator rend() const; - const_reverse_iterator crend() const; - key_compare key_comp() const; - value_compare value_comp() const; - bool empty() const; - size_type size() const; - void swap(avltree &); + // public member functions + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end(); + const_iterator end() const; + const_iterator cend() const; + reverse_iterator rbegin(); + const_reverse_iterator rbegin() const; + const_reverse_iterator crbegin() const; + reverse_iterator rend(); + const_reverse_iterator rend() const; + const_reverse_iterator crend() const; + key_compare key_comp() const; + value_compare value_comp() const; + bool empty() const; + size_type size() const; + void swap(avltree &); template<typename Cloner, typename Disposer> - void clone_from(const avltree &, Cloner, Disposer); + void clone_from(const avltree &, Cloner, Disposer); template<typename Cloner, typename Disposer> - void clone_from(avltree &&, Cloner, Disposer); - iterator insert_equal(reference); - iterator insert_equal(const_iterator, reference); - template<typename Iterator> void insert_equal(Iterator, Iterator); - std::pair< iterator, bool > insert_unique(reference); - iterator insert_unique(const_iterator, reference); + void clone_from(avltree &&, Cloner, Disposer); + iterator insert_equal(reference); + iterator insert_equal(const_iterator, reference); + template<typename Iterator> void insert_equal(Iterator, Iterator); + std::pair< iterator, bool > insert_unique(reference); + iterator insert_unique(const_iterator, reference); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, bool > - insert_unique_check(const KeyType &, KeyTypeKeyCompare, + insert_unique_check(const KeyType &, KeyTypeKeyCompare, insert_commit_data &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, bool > - insert_unique_check(const_iterator, const KeyType &, KeyTypeKeyCompare, + insert_unique_check(const_iterator, const KeyType &, KeyTypeKeyCompare, insert_commit_data &); - iterator insert_unique_commit(reference, const insert_commit_data &); - template<typename Iterator> void insert_unique(Iterator, Iterator); - iterator insert_before(const_iterator, reference); - void push_back(reference); - void push_front(reference); - iterator erase(const_iterator); - iterator erase(const_iterator, const_iterator); - size_type erase(const key_type &); + iterator insert_unique_commit(reference, const insert_commit_data &); + template<typename Iterator> void insert_unique(Iterator, Iterator); + iterator insert_before(const_iterator, reference); + void push_back(reference); + void push_front(reference); + iterator erase(const_iterator); + iterator erase(const_iterator, const_iterator); + size_type erase(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - size_type erase(const KeyType &, KeyTypeKeyCompare); + size_type erase(const KeyType &, KeyTypeKeyCompare); template<typename Disposer> - iterator erase_and_dispose(const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, Disposer); template<typename Disposer> - iterator erase_and_dispose(const_iterator, const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, const_iterator, Disposer); template<typename Disposer> - size_type erase_and_dispose(const key_type &, Disposer); + size_type erase_and_dispose(const key_type &, Disposer); template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> - size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); - void clear(); - template<typename Disposer> void clear_and_dispose(Disposer); - size_type count(const key_type &) const; + size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); + void clear(); + template<typename Disposer> void clear_and_dispose(Disposer); + size_type count(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - size_type count(const KeyType &, KeyTypeKeyCompare) const; - iterator lower_bound(const key_type &); + size_type count(const KeyType &, KeyTypeKeyCompare) const; + iterator lower_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator lower_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator lower_bound(const key_type &) const; + iterator lower_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator lower_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator upper_bound(const key_type &); + const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator upper_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator upper_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator upper_bound(const key_type &) const; + iterator upper_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator upper_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator find(const key_type &); + const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator find(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator find(const KeyType &, KeyTypeKeyCompare); - const_iterator find(const key_type &) const; + iterator find(const KeyType &, KeyTypeKeyCompare); + const_iterator find(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator find(const KeyType &, KeyTypeKeyCompare) const; - std::pair< iterator, iterator > equal_range(const key_type &); + const_iterator find(const KeyType &, KeyTypeKeyCompare) const; + std::pair< iterator, iterator > equal_range(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - equal_range(const KeyType &, KeyTypeKeyCompare); + equal_range(const KeyType &, KeyTypeKeyCompare); std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; + equal_range(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - equal_range(const KeyType &, KeyTypeKeyCompare) const; + equal_range(const KeyType &, KeyTypeKeyCompare) const; std::pair< iterator, iterator > - bounded_range(const key_type &, const key_type &, bool, bool); + bounded_range(const key_type &, const key_type &, bool, bool); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool); std::pair< const_iterator, const_iterator > - bounded_range(const key_type &, const key_type &, bool, bool) const; + bounded_range(const key_type &, const key_type &, bool, bool) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool) const; - iterator iterator_to(reference); - const_iterator iterator_to(const_reference) const; - pointer unlink_leftmost_without_rebalance(); - void replace_node(iterator, reference); - void remove_node(reference); + iterator iterator_to(reference); + const_iterator iterator_to(const_reference) const; + pointer unlink_leftmost_without_rebalance(); + void replace_node(iterator, reference); + void remove_node(reference); - // public static functions - static avltree & container_from_end_iterator(iterator); - static const avltree & container_from_end_iterator(const_iterator); - static avltree & container_from_iterator(iterator); - static const avltree & container_from_iterator(const_iterator); - static iterator s_iterator_to(reference); - static const_iterator s_iterator_to(const_reference); - static void init_node(reference); + // public static functions + static avltree & container_from_end_iterator(iterator); + static const avltree & container_from_end_iterator(const_iterator); + static avltree & container_from_iterator(iterator); + static const avltree & container_from_iterator(const_iterator); + static iterator s_iterator_to(reference); + static const_iterator s_iterator_to(const_reference); + static void init_node(reference); // public data members static const bool constant_time_size; };
    -

    Description

    +

    Description

    The class template avltree is an intrusive AVL tree container, that is used to construct intrusive avl_set and avl_multiset containers. The no-throw guarantee holds only, if the key_compare object doesn't throw.

    The template parameter T is the type to be managed by the container. The user can specify additional options and if no options are provided default options are used.

    The container supports the following options: base_hook<>/member_hook<>/value_traits<>, constant_time_size<>, size_type<> and compare<>.

    -

    +

    avltree public construct/copy/destruct

    1. -
      explicit avltree(const key_compare & cmp = key_compare(), 
+
      explicit avltree(const key_compare & cmp = key_compare(), 
                  const value_traits & v_traits = value_traits());
      
 
      Effects: Constructs an empty container.
      
 
      Complexity: Constant.
      
@@ -204,7 +204,7 @@
 
    2. template<typename Iterator> 
-  avltree(bool unique, Iterator b, Iterator e, 
+  avltree(bool unique, Iterator b, Iterator e, 
           const key_compare & cmp = key_compare(), 
           const value_traits & v_traits = value_traits());

      Requires: Dereferencing iterator must yield an lvalue of type value_type. cmp must be a comparison function that induces a strict weak ordering.

      @@ -213,15 +213,15 @@

      Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor/operator() of the key_compare object throws. Basic guarantee.

    3. -
      avltree(avltree && x);
      +
      avltree(avltree && x);

      Effects: to-do

    4. -
      avltree & operator=(avltree && x);
      +
      avltree & operator=(avltree && x);

      Effects: to-do

    5. -
      ~avltree();
      +
      ~avltree();

      Effects: Detaches all elements from this. The objects in the set are not deleted (i.e. no destructors are called), but the nodes according to the value_traits template parameter are reinitialized and thus can be reused.

      Complexity: Linear to elements contained in *this.

      Throws: Nothing.

      @@ -229,114 +229,114 @@
    -

    -avltree public member functions

    +

    +avltree public member functions

    1. -
      iterator begin();
      +
      iterator begin();

      Effects: Returns an iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    2. -
      const_iterator begin() const;
      +
      const_iterator begin() const;

      Effects: Returns a const_iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    3. -
      const_iterator cbegin() const;
      +
      const_iterator cbegin() const;

      Effects: Returns a const_iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    4. -
      iterator end();
      +
      iterator end();

      Effects: Returns an iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    5. -
      const_iterator end() const;
      +
      const_iterator end() const;

      Effects: Returns a const_iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    6. -
      const_iterator cend() const;
      +
      const_iterator cend() const;

      Effects: Returns a const_iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    7. -
      reverse_iterator rbegin();
      +
      reverse_iterator rbegin();

      Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    8. -
      const_reverse_iterator rbegin() const;
      +
      const_reverse_iterator rbegin() const;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    9. -
      const_reverse_iterator crbegin() const;
      +
      const_reverse_iterator crbegin() const;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    10. -
      reverse_iterator rend();
      +
      reverse_iterator rend();

      Effects: Returns a reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    11. -
      const_reverse_iterator rend() const;
      +
      const_reverse_iterator rend() const;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    12. -
      const_reverse_iterator crend() const;
      +
      const_reverse_iterator crend() const;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    13. -
      key_compare key_comp() const;
      +
      key_compare key_comp() const;

      Effects: Returns the key_compare object used by the container.

      Complexity: Constant.

      Throws: If key_compare copy-constructor throws.

    14. -
      value_compare value_comp() const;
      +
      value_compare value_comp() const;

      Effects: Returns the value_compare object used by the container.

      Complexity: Constant.

      Throws: If value_compare copy-constructor throws.

    15. -
      bool empty() const;
      +
      bool empty() const;

      Effects: Returns true if the container is empty.

      Complexity: Constant.

      Throws: Nothing.

    16. -
      size_type size() const;
      +
      size_type size() const;

      Effects: Returns the number of elements stored in the container.

      Complexity: Linear to elements contained in *this if constant-time size option is disabled. Constant time otherwise.

      Throws: Nothing.

    17. -
      void swap(avltree & other);
      +
      void swap(avltree & other);

      Effects: Swaps the contents of two containers.

      Complexity: Constant.

      Throws: If the comparison functor's swap call throws. 

    18. template<typename Cloner, typename Disposer> 
-  void clone_from(const avltree & src, Cloner cloner, Disposer disposer);
      + void clone_from(const avltree & src, Cloner cloner, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

      Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(const_reference ) and inserts them on *this. Copies the predicate from the source container.

      If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

      @@ -345,7 +345,7 @@ 
    19. template<typename Cloner, typename Disposer> 
-  void clone_from(avltree && src, Cloner cloner, Disposer disposer);
      + void clone_from(avltree && src, Cloner cloner, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

      Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(reference) and inserts them on *this. Copies the predicate from the source container.

      If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

      @@ -354,7 +354,7 @@

      Note: This version can modify the source container, useful to implement move semantics.

    20. -
      iterator insert_equal(reference value);
      +
      iterator insert_equal(reference value);

      Requires: value must be an lvalue

      Effects: Inserts value into the container before the upper bound.

      Complexity: Average complexity for insert element is at most logarithmic.

      @@ -362,7 +362,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    21. -
      iterator insert_equal(const_iterator hint, reference value);
      +
      iterator insert_equal(const_iterator hint, reference value);

      Requires: value must be an lvalue, and "hint" must be a valid iterator.

      Effects: Inserts x into the container, using "hint" as a hint to where it will be inserted. If "hint" is the upper_bound the insertion takes constant time (two comparisons in the worst case)

      Complexity: Logarithmic in general, but it is amortized constant time if t is inserted immediately before hint.

      @@ -370,7 +370,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    22. -
      template<typename Iterator> void insert_equal(Iterator b, Iterator e);
      +
      template<typename Iterator> void insert_equal(Iterator b, Iterator e);

      Requires: Dereferencing iterator must yield an lvalue of type value_type.

      Effects: Inserts a each element of a range into the container before the upper bound of the key of each element.

      Complexity: Insert range is in general O(N * log(N)), where N is the size of the range. However, it is linear in N if the range is already sorted by value_comp().

      @@ -378,7 +378,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    23. -
      std::pair< iterator, bool > insert_unique(reference value);
      +
      std::pair< iterator, bool > insert_unique(reference value);

      Requires: value must be an lvalue

      Effects: Inserts value into the container if the value is not already present.

      Complexity: Average complexity for insert element is at most logarithmic.

      @@ -386,7 +386,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    24. -
      iterator insert_unique(const_iterator hint, reference value);
      +
      iterator insert_unique(const_iterator hint, reference value);

      Requires: value must be an lvalue, and "hint" must be a valid iterator

      Effects: Tries to insert x into the container, using "hint" as a hint to where it will be inserted.

      Complexity: Logarithmic in general, but it is amortized constant time (two comparisons in the worst case) if t is inserted immediately before hint.

      @@ -396,7 +396,7 @@ 
    25. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, bool > 
-  insert_unique_check(const KeyType & key, KeyTypeKeyCompare comp, 
+  insert_unique_check(const KeyType & key, KeyTypeKeyCompare comp, 
                       insert_commit_data & commit_data);

      Requires: comp must be a comparison function that induces the same strict weak ordering as key_compare. The difference is that comp compares an arbitrary key with the contained values.

      Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself.

      @@ -410,7 +410,7 @@ 
    26. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, bool > 
-  insert_unique_check(const_iterator hint, const KeyType & key, 
+  insert_unique_check(const_iterator hint, const KeyType & key, 
                       KeyTypeKeyCompare comp, 
                       insert_commit_data & commit_data);

      Requires: comp must be a comparison function that induces the same strict weak ordering as key_compare. The difference is that comp compares an arbitrary key with the contained values.

      @@ -423,7 +423,7 @@

      "commit_data" remains valid for a subsequent "insert_commit" only if no more objects are inserted or erased from the container.

    27. -
      iterator insert_unique_commit(reference value, 
+
      iterator insert_unique_commit(reference value, 
                               const insert_commit_data & commit_data);
      
 
      Requires: value must be an lvalue of type value_type. commit_data must have been obtained from a previous call to "insert_check". No objects should have been inserted or erased from the container between the "insert_check" that filled "commit_data" and the call to "insert_commit".
      
 
      Effects: Inserts the value in the container using the information obtained from the "commit_data" that a previous "insert_check" filled.
      
@@ -433,7 +433,7 @@
 
      Notes: This function has only sense if a "insert_check" has been previously executed to fill "commit_data". No value should be inserted or erased between the "insert_check" and "insert_commit" calls.
    28. -
      template<typename Iterator> void insert_unique(Iterator b, Iterator e);
      +
      template<typename Iterator> void insert_unique(Iterator b, Iterator e);

      Requires: Dereferencing iterator must yield an lvalue of type value_type.

      Effects: Tries to insert each element of a range into the container.

      Complexity: Insert range is in general O(N * log(N)), where N is the size of the range. However, it is linear in N if the range is already sorted by value_comp().

      @@ -441,7 +441,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    29. -
      iterator insert_before(const_iterator pos, reference value);
      +
      iterator insert_before(const_iterator pos, reference value);

      Requires: value must be an lvalue, "pos" must be a valid iterator (or end) and must be the succesor of value once inserted according to the predicate

      Effects: Inserts x into the container before "pos".

      Complexity: Constant time.

      @@ -449,7 +449,7 @@

      Note: This function does not check preconditions so if "pos" is not the successor of "value" container ordering invariant will be broken. This is a low-level function to be used only for performance reasons by advanced users.

    30. -
      void push_back(reference value);
      +
      void push_back(reference value);

      Requires: value must be an lvalue, and it must be no less than the greatest inserted key

      Effects: Inserts x into the container in the last position.

      Complexity: Constant time.

      @@ -457,7 +457,7 @@

      Note: This function does not check preconditions so if value is less than the greatest inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

    31. -
      void push_front(reference value);
      +
      void push_front(reference value);

      Requires: value must be an lvalue, and it must be no greater than the minimum inserted key

      Effects: Inserts x into the container in the first position.

      Complexity: Constant time.

      @@ -465,21 +465,21 @@

      Note: This function does not check preconditions so if value is greater than the minimum inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

    32. -
      iterator erase(const_iterator i);
      +
      iterator erase(const_iterator i);

      Effects: Erases the element pointed to by i.

      Complexity: Average complexity for erase element is constant time.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    33. -
      iterator erase(const_iterator b, const_iterator e);
      +
      iterator erase(const_iterator b, const_iterator e);

      Effects: Erases the range pointed to by b end e.

      Complexity: Average complexity for erase range is at most O(log(size() + N)), where N is the number of elements in the range.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    34. -
      size_type erase(const key_type & key);
      +
      size_type erase(const key_type & key);

      Effects: Erases all the elements with the given value.

      Returns: The number of erased elements.

      Complexity: O(log(size() + N).

      @@ -488,7 +488,8 @@ 
    35. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type erase(const KeyType & key, KeyTypeKeyCompare comp);
      + size_type erase(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Erases all the elements with the given key. according to the comparison functor "comp".

      Returns: The number of erased elements.

      Complexity: O(log(size() + N).

      @@ -497,7 +498,7 @@ 
    36. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator i, Disposer disposer);
      + iterator erase_and_dispose(const_iterator i, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases the element pointed to by i. Disposer::operator()(pointer) is called for the removed element.

      Complexity: Average complexity for erase element is constant time.

      @@ -506,7 +507,7 @@ 
    37. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator b, const_iterator e, 
+  iterator erase_and_dispose(const_iterator b, const_iterator e, 
                              Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases the range pointed to by b end e. Disposer::operator()(pointer) is called for the removed elements.

      @@ -516,7 +517,7 @@ 
    38. template<typename Disposer> 
-  size_type erase_and_dispose(const key_type & key, Disposer disposer);
      + size_type erase_and_dispose(const key_type & key, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases all the elements with the given value. Disposer::operator()(pointer) is called for the removed elements.

      Returns: The number of erased elements.

      @@ -526,8 +527,9 @@ 
    39. template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> 
-  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
+  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
                               Disposer disposer);
      +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk) and nk the key_type of a value_type inserted into *this.

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases all the elements with the given key. according to the comparison functor "comp". Disposer::operator()(pointer) is called for the removed elements.

      Returns: The number of erased elements.

      @@ -536,46 +538,47 @@

      Note: Invalidates the iterators to the erased elements.

    40. -
      void clear();
      +
      void clear();

      Effects: Erases all of the elements.

      Complexity: Linear to the number of elements on the container. if it's a safe-mode or auto-unlink value_type. Constant time otherwise.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    41. -
      template<typename Disposer> void clear_and_dispose(Disposer disposer);
      +
      template<typename Disposer> void clear_and_dispose(Disposer disposer);

      Effects: Erases all of the elements calling disposer(p) for each node to be erased. Complexity: Average complexity for is at most O(log(size() + N)), where N is the number of elements in the container.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. Calls N times to disposer functor.

    42. -
      size_type count(const key_type & key) const;
      +
      size_type count(const key_type & key) const;

      Effects: Returns the number of contained elements with the given value

      Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given value.

      Throws: If key_compare throws. 

    43. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;
      + size_type count(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      Effects: Returns the number of contained elements with the given key

      Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given key.

      Throws: If comp throws.

    44. -
      iterator lower_bound(const key_type & key);
      +
      iterator lower_bound(const key_type & key);

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    45. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      -

      Throws: If comp throws.

      +

      Throws: If key_compare throws.

    46. -
      const_iterator lower_bound(const key_type & key) const;
      +
      const_iterator lower_bound(const key_type & key) const;

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -583,26 +586,27 @@ 
    47. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
      -

      Effects: Returns a const iterator to the first element whose key is not less than k or end() if that element does not exist.

      + lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      -

      Throws: If comp throws.

      +

      Throws: If key_compare throws.

    48. -
      iterator upper_bound(const key_type & key);
      +
      iterator upper_bound(const key_type & key);

      Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    49. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    50. -
      const_iterator upper_bound(const key_type & key) const;
      +
      const_iterator upper_bound(const key_type & key) const;

      Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -610,39 +614,42 @@ 
    51. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
      + upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    52. -
      iterator find(const key_type & key);
      +
      iterator find(const key_type & key);

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    53. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator find(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator find(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    54. -
      const_iterator find(const key_type & key) const;
      -

      Effects: Finds a const_iterator to the first element whose key is k or end() if that element does not exist.

      +
      const_iterator find(const key_type & key) const;
      +

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    55. template<typename KeyType, typename KeyTypeKeyCompare> 
-  const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;
      -

      Effects: Finds a const_iterator to the first element whose key is k or end() if that element does not exist.

      + const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      +

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    56. -
      std::pair< iterator, iterator > equal_range(const key_type & key);
      +
      std::pair< iterator, iterator > equal_range(const key_type & key);

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -650,14 +657,15 @@ 
    57. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp);
      + equal_range(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If comp throws. 

    58. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & key) const;
      +equal_range(const key_type & key) const;

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -665,16 +673,18 @@ 
    59. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;
      + equal_range(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If comp throws. 

    60. std::pair< iterator, iterator > 
-bounded_range(const key_type & lower, const key_type & upper_key, 
+bounded_range(const key_type & lower, const key_type & upper_key, 
               bool left_closed, bool right_closed);
      -

      Requires: 'lower_key' must not be greater than 'upper_key'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key) if left_closed, upper_bound(lower_key) otherwise

      second = upper_bound(upper_key) if right_closed, lower_bound(upper_key) otherwise

      @@ -686,9 +696,12 @@ 
    61. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed);
      -

      Requires: KeyTypeKeyCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the container. 'lower_key' must not be greater than 'upper_key' according to 'comp'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

      +

      upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

      +

      upper_key shall not precede lower_key according to comp [comp(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!comp(upper_key, lower_key) && !comp(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key, comp) if left_closed, upper_bound(lower_key, comp) otherwise

      second = upper_bound(upper_key, comp) if right_closed, lower_bound(upper_key, comp) otherwise

      @@ -699,9 +712,10 @@ 
    62. std::pair< const_iterator, const_iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed) const;
      -

      Requires: 'lower_key' must not be greater than 'upper_key'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key) if left_closed, upper_bound(lower_key) otherwise

      second = upper_bound(upper_key) if right_closed, lower_bound(upper_key) otherwise

      @@ -713,9 +727,12 @@ 
    63. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed) const;
      -

      Requires: KeyTypeKeyCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the container. 'lower_key' must not be greater than 'upper_key' according to 'comp'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

      +

      upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

      +

      upper_key shall not precede lower_key according to comp [comp(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!comp(upper_key, lower_key) && !comp(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key, comp) if left_closed, upper_bound(lower_key, comp) otherwise

      second = upper_bound(upper_key, comp) if right_closed, lower_bound(upper_key, comp) otherwise

      @@ -725,28 +742,28 @@

      Note: Experimental function, the interface might change in future releases.

    64. -
      iterator iterator_to(reference value);
      +
      iterator iterator_to(reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      Throws: Nothing.

    65. -
      const_iterator iterator_to(const_reference value) const;
      +
      const_iterator iterator_to(const_reference value) const;

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid const_iterator i belonging to the set that points to the value

      Complexity: Constant.

      Throws: Nothing.

    66. -
      pointer unlink_leftmost_without_rebalance();
      +
      pointer unlink_leftmost_without_rebalance();

      Effects: Unlinks the leftmost node from the container.

      Complexity: Average complexity is constant time.

      Throws: Nothing.

      Notes: This function breaks the container and the container can only be used for more unlink_leftmost_without_rebalance calls. This function is normally used to achieve a step by step controlled destruction of the container.

    67. -
      void replace_node(iterator replace_this, reference with_this);
      +
      void replace_node(iterator replace_this, reference with_this);

      Requires: replace_this must be a valid iterator of *this and with_this must not be inserted in any container.

      Effects: Replaces replace_this in its position in the container with with_this. The container does not need to be rebalanced.

      Complexity: Constant.

      @@ -754,7 +771,7 @@

      Note: This function will break container ordering invariants if with_this is not equivalent to *replace_this according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing or comparison is needed.

    68. -
      void remove_node(reference value);
      +
      void remove_node(reference value);

      Effects: removes "value" from the container.

      Throws: Nothing.

      Complexity: Logarithmic time.

      @@ -764,11 +781,11 @@
    -

    -avltree public static functions

    +

    +avltree public static functions

    1. -
      static avltree & container_from_end_iterator(iterator end_iterator);
      +
      static avltree & container_from_end_iterator(iterator end_iterator);

      Precondition: end_iterator must be a valid end iterator of the container.

      Effects: Returns a const reference to the container associated to the end iterator

      Throws: Nothing.

      @@ -776,28 +793,28 @@ 
    2. static const avltree & 
-container_from_end_iterator(const_iterator end_iterator);
      +container_from_end_iterator(const_iterator end_iterator);

      Precondition: end_iterator must be a valid end iterator of the container.

      Effects: Returns a const reference to the container associated to the end iterator

      Throws: Nothing.

      Complexity: Constant.

    3. -
      static avltree & container_from_iterator(iterator it);
      +
      static avltree & container_from_iterator(iterator it);

      Precondition: it must be a valid iterator of the container.

      Effects: Returns a const reference to the container associated to the iterator

      Throws: Nothing.

      Complexity: Logarithmic.

    4. -
      static const avltree & container_from_iterator(const_iterator it);
      +
      static const avltree & container_from_iterator(const_iterator it);

      Precondition: it must be a valid iterator of the container.

      Effects: Returns a const reference to the container associated to the iterator

      Throws: Nothing.

      Complexity: Logarithmic.

    5. -
      static iterator s_iterator_to(reference value);
      +
      static iterator s_iterator_to(reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      @@ -805,7 +822,7 @@

      Note: This static function is available only if the value traits is stateless.

    6. -
      static const_iterator s_iterator_to(const_reference value);
      +
      static const_iterator s_iterator_to(const_reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      @@ -813,7 +830,7 @@

      Note: This static function is available only if the value traits is stateless.

    7. -
      static void init_node(reference value);
      +
      static void init_node(reference value);

      Requires: value shall not be in a container.

      Effects: init_node puts the hook of a value in a well-known default state.

      Throws: Nothing.

      diff --git a/doc/html/boost/intrusive/avltree_algorithms.html b/doc/html/boost/intrusive/avltree_algorithms.html index 7df73d55a9..080a7c0e59 100644 --- a/doc/html/boost/intrusive/avltree_algorithms.html +++ b/doc/html/boost/intrusive/avltree_algorithms.html @@ -43,81 +43,81 @@ typedef NodeTraits::balance balance; typedef bstree_algo::insert_commit_data insert_commit_data; - // public static functions - static node_ptr get_header(const const_node_ptr &); - static node_ptr begin_node(const const_node_ptr &); - static node_ptr end_node(const const_node_ptr &); - static void swap_tree(const node_ptr &, const node_ptr &); - static void swap_nodes(const node_ptr &, const node_ptr &); - static void swap_nodes(const node_ptr &, const node_ptr &, const node_ptr &, + // public static functions + static node_ptr get_header(const const_node_ptr &); + static node_ptr begin_node(const const_node_ptr &); + static node_ptr end_node(const const_node_ptr &); + static void swap_tree(const node_ptr &, const node_ptr &); + static void swap_nodes(const node_ptr &, const node_ptr &); + static void swap_nodes(const node_ptr &, const node_ptr &, const node_ptr &, const node_ptr &); - static void replace_node(const node_ptr &, const node_ptr &); - static void replace_node(const node_ptr &, const node_ptr &, + static void replace_node(const node_ptr &, const node_ptr &); + static void replace_node(const node_ptr &, const node_ptr &, const node_ptr &); - static void unlink(const node_ptr &); - static node_ptr unlink_leftmost_without_rebalance(const node_ptr &); - static bool unique(const const_node_ptr &); - static std::size_t size(const const_node_ptr &); - static node_ptr next_node(const node_ptr &); - static node_ptr prev_node(const node_ptr &); - static void init(const node_ptr &); - static void init_header(const node_ptr &); - static node_ptr erase(const node_ptr &, const node_ptr &); + static void unlink(const node_ptr &); + static node_ptr unlink_leftmost_without_rebalance(const node_ptr &); + static bool unique(const const_node_ptr &); + static std::size_t size(const const_node_ptr &); + static node_ptr next_node(const node_ptr &); + static node_ptr prev_node(const node_ptr &); + static void init(const node_ptr &); + static void init_header(const node_ptr &); + static node_ptr erase(const node_ptr &, const node_ptr &); template<typename Cloner, typename Disposer> - static void clone(const const_node_ptr &, const node_ptr &, Cloner, + static void clone(const const_node_ptr &, const node_ptr &, Cloner, Disposer); template<typename Disposer> - static void clear_and_dispose(const node_ptr &, Disposer); + static void clear_and_dispose(const node_ptr &, Disposer); template<typename KeyType, typename KeyNodePtrCompare> static node_ptr - lower_bound(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + lower_bound(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static node_ptr - upper_bound(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + upper_bound(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static node_ptr - find(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + find(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, node_ptr > - equal_range(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + equal_range(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, node_ptr > - bounded_range(const const_node_ptr &, const KeyType &, const KeyType &, + bounded_range(const const_node_ptr &, const KeyType &, const KeyType &, KeyNodePtrCompare, bool, bool); template<typename KeyType, typename KeyNodePtrCompare> static std::size_t - count(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + count(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename NodePtrCompare> static node_ptr - insert_equal_upper_bound(const node_ptr &, const node_ptr &, + insert_equal_upper_bound(const node_ptr &, const node_ptr &, NodePtrCompare); template<typename NodePtrCompare> static node_ptr - insert_equal_lower_bound(const node_ptr &, const node_ptr &, + insert_equal_lower_bound(const node_ptr &, const node_ptr &, NodePtrCompare); template<typename NodePtrCompare> static node_ptr - insert_equal(const node_ptr &, const node_ptr &, const node_ptr &, + insert_equal(const node_ptr &, const node_ptr &, const node_ptr &, NodePtrCompare); static node_ptr - insert_before(const node_ptr &, const node_ptr &, const node_ptr &); - static void push_back(const node_ptr &, const node_ptr &); - static void push_front(const node_ptr &, const node_ptr &); + insert_before(const node_ptr &, const node_ptr &, const node_ptr &); + static void push_back(const node_ptr &, const node_ptr &); + static void push_front(const node_ptr &, const node_ptr &); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, bool > - insert_unique_check(const const_node_ptr &, const KeyType &, + insert_unique_check(const const_node_ptr &, const KeyType &, KeyNodePtrCompare, insert_commit_data &); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, bool > - insert_unique_check(const const_node_ptr &, const node_ptr &, + insert_unique_check(const const_node_ptr &, const node_ptr &, const KeyType &, KeyNodePtrCompare, insert_commit_data &); - static void insert_unique_commit(const node_ptr &, const node_ptr &, + static void insert_unique_commit(const node_ptr &, const node_ptr &, const insert_commit_data &); - static bool is_header(const const_node_ptr &); + static bool is_header(const const_node_ptr &); };
    -

    Description

    +

    Description

    avltree_algorithms is configured with a NodeTraits class, which encapsulates the information about the node to be manipulated. NodeTraits must support the following interface:

    Typedefs:

    node: The type of the node that forms the binary search tree

    @@ -137,7 +137,7 @@

    static balance zero();

    static balance positive();

    -

    +

    avltree_algorithms public types

    @@ -148,39 +148,39 @@
    -

    -avltree_algorithms public static functions

    +

    +avltree_algorithms public static functions

    1. -
      static node_ptr get_header(const const_node_ptr & n);
      +
      static node_ptr get_header(const const_node_ptr & n);

      Requires: 'node' is a node of the tree or a header node.

      Effects: Returns the header of the tree.

      Complexity: Logarithmic.

      Throws: Nothing.

    2. -
      static node_ptr begin_node(const const_node_ptr & header);
      +
      static node_ptr begin_node(const const_node_ptr & header);

      Requires: 'header' is the header node of a tree.

      Effects: Returns the first node of the tree, the header if the tree is empty.

      Complexity: Constant time.

      Throws: Nothing.

    3. -
      static node_ptr end_node(const const_node_ptr & header);
      +
      static node_ptr end_node(const const_node_ptr & header);

      Requires: 'header' is the header node of a tree.

      Effects: Returns the header of the tree.

      Complexity: Constant time.

      Throws: Nothing.

    4. -
      static void swap_tree(const node_ptr & header1, const node_ptr & header2);
      +
      static void swap_tree(const node_ptr & header1, const node_ptr & header2);

      Requires: header1 and header2 must be the header nodes of two trees.

      Effects: Swaps two trees. After the function header1 will contain links to the second tree and header2 will have links to the first tree.

      Complexity: Constant.

      Throws: Nothing.

    5. -
      static void swap_nodes(const node_ptr & node1, const node_ptr & node2);
      +
      static void swap_nodes(const node_ptr & node1, const node_ptr & node2);

      Requires: node1 and node2 can't be header nodes of two trees.

      Effects: Swaps two nodes. After the function node1 will be inserted in the position node2 before the function. node2 will be inserted in the position node1 had before the function.

      Complexity: Logarithmic.

      @@ -189,7 +189,7 @@

      Experimental function

    6. -
      static void swap_nodes(const node_ptr & node1, const node_ptr & header1, 
+
      static void swap_nodes(const node_ptr & node1, const node_ptr & header1, 
                        const node_ptr & node2, const node_ptr & header2);
      
 
      Requires: node1 and node2 can't be header nodes of two trees with header header1 and header2.
      
 
      Effects: Swaps two nodes. After the function node1 will be inserted in the position node2 before the function. node2 will be inserted in the position node1 had before the function.
      
@@ -199,7 +199,7 @@
 
      Experimental function
    7. -
      static void replace_node(const node_ptr & node_to_be_replaced, 
+
      static void replace_node(const node_ptr & node_to_be_replaced, 
                          const node_ptr & new_node);
      
 
      Requires: node_to_be_replaced must be inserted in a tree and new_node must not be inserted in a tree.
      
 
      Effects: Replaces node_to_be_replaced in its position in the tree with new_node. The tree does not need to be rebalanced
      
@@ -208,7 +208,7 @@
 
      Note: This function will break container ordering invariants if new_node is not equivalent to node_to_be_replaced according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing and comparison is needed. Experimental function
    8. -
      static void replace_node(const node_ptr & node_to_be_replaced, 
+
      static void replace_node(const node_ptr & node_to_be_replaced, 
                          const node_ptr & header, const node_ptr & new_node);
      
 
      Requires: node_to_be_replaced must be inserted in a tree with header "header" and new_node must not be inserted in a tree.
      
 
      Effects: Replaces node_to_be_replaced in its position in the tree with new_node. The tree does not need to be rebalanced
      
@@ -217,14 +217,14 @@
 
      Note: This function will break container ordering invariants if new_node is not equivalent to node_to_be_replaced according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing or comparison is needed. Experimental function
    9. -
      static void unlink(const node_ptr & node);
      +
      static void unlink(const node_ptr & node);

      Requires: node is a tree node but not the header.

      Effects: Unlinks the node and rebalances the tree.

      Complexity: Average complexity is constant time.

      Throws: Nothing.

    10. -
      static node_ptr unlink_leftmost_without_rebalance(const node_ptr & header);
      +
      static node_ptr unlink_leftmost_without_rebalance(const node_ptr & header);

      Requires: header is the header of a tree.

      Effects: Unlinks the leftmost node from the tree, and updates the header link to the new leftmost node.

      Complexity: Average complexity is constant time.

      @@ -232,35 +232,35 @@

      Notes: This function breaks the tree and the tree can only be used for more unlink_leftmost_without_rebalance calls. This function is normally used to achieve a step by step controlled destruction of the tree.

    11. -
      static bool unique(const const_node_ptr & node);
      +
      static bool unique(const const_node_ptr & node);

      Requires: 'node' is a node of the tree or a node initialized by init(...) or init_node.

      Effects: Returns true if the node is initialized by init() or init_node().

      Complexity: Constant time.

      Throws: Nothing.

    12. -
      static std::size_t size(const const_node_ptr & header);
      +
      static std::size_t size(const const_node_ptr & header);

      Requires: node is a node of the tree but it's not the header.

      Effects: Returns the number of nodes of the subtree.

      Complexity: Linear time.

      Throws: Nothing.

    13. -
      static node_ptr next_node(const node_ptr & node);
      +
      static node_ptr next_node(const node_ptr & node);

      Requires: 'node' is a node from the tree except the header.

      Effects: Returns the next node of the tree.

      Complexity: Average constant time.

      Throws: Nothing.

    14. -
      static node_ptr prev_node(const node_ptr & node);
      +
      static node_ptr prev_node(const node_ptr & node);

      Requires: 'node' is a node from the tree except the leftmost node.

      Effects: Returns the previous node of the tree.

      Complexity: Average constant time.

      Throws: Nothing.

    15. -
      static void init(const node_ptr & node);
      +
      static void init(const node_ptr & node);

      Requires: 'node' must not be part of any tree.

      Effects: After the function unique(node) == true.

      Complexity: Constant.

      @@ -268,7 +268,7 @@

      Nodes: If node is inserted in a tree, this function corrupts the tree.

    16. -
      static void init_header(const node_ptr & header);
      +
      static void init_header(const node_ptr & header);

      Requires: node must not be part of any tree.

      Effects: Initializes the header to represent an empty tree. unique(header) == true.

      Complexity: Constant.

      @@ -276,7 +276,7 @@

      Nodes: If node is inserted in a tree, this function corrupts the tree.

    17. -
      static node_ptr erase(const node_ptr & header, const node_ptr & z);
      +
      static node_ptr erase(const node_ptr & header, const node_ptr & z);

      Requires: header must be the header of a tree, z a node of that tree and z != header.

      Effects: Erases node "z" from the tree with header "header".

      Complexity: Amortized constant time.

      @@ -284,7 +284,7 @@ 
    18. template<typename Cloner, typename Disposer> 
-  static void clone(const const_node_ptr & source_header, 
+  static void clone(const const_node_ptr & source_header, 
                     const node_ptr & target_header, Cloner cloner, 
                     Disposer disposer);

      Requires: "cloner" must be a function object taking a node_ptr and returning a new cloned node of it. "disposer" must take a node_ptr and shouldn't throw.

      @@ -295,7 +295,7 @@ 
    19. template<typename Disposer> 
-  static void clear_and_dispose(const node_ptr & header, Disposer disposer);
      + static void clear_and_dispose(const node_ptr & header, Disposer disposer);

      Requires: "disposer" must be an object function taking a node_ptr parameter and shouldn't throw.

      Effects: Empties the target tree calling void disposer::operator()(const node_ptr &) for every node of the tree except the header.

      Complexity: Linear to the number of element of the source tree plus the. number of elements of tree target tree when calling this function.

      @@ -304,7 +304,7 @@ 
    20. template<typename KeyType, typename KeyNodePtrCompare> 
   static node_ptr 
-  lower_bound(const const_node_ptr & header, const KeyType & key, 
+  lower_bound(const const_node_ptr & header, const KeyType & key, 
               KeyNodePtrCompare comp);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

      Effects: Returns a node_ptr to the first element that is not less than "key" according to "comp" or "header" if that element does not exist.

      @@ -314,7 +314,7 @@ 
    21. template<typename KeyType, typename KeyNodePtrCompare> 
   static node_ptr 
-  upper_bound(const const_node_ptr & header, const KeyType & key, 
+  upper_bound(const const_node_ptr & header, const KeyType & key, 
               KeyNodePtrCompare comp);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

      Effects: Returns a node_ptr to the first element that is greater than "key" according to "comp" or "header" if that element does not exist.

      @@ -324,7 +324,7 @@ 
    22. template<typename KeyType, typename KeyNodePtrCompare> 
   static node_ptr 
-  find(const const_node_ptr & header, const KeyType & key, 
+  find(const const_node_ptr & header, const KeyType & key, 
        KeyNodePtrCompare comp);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

      Effects: Returns a node_ptr to the first element that is equivalent to "key" according to "comp" or "header" if that element does not exist.

      @@ -334,7 +334,7 @@ 
    23. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, node_ptr > 
-  equal_range(const const_node_ptr & header, const KeyType & key, 
+  equal_range(const const_node_ptr & header, const KeyType & key, 
               KeyNodePtrCompare comp);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

      Effects: Returns an a pair of node_ptr delimiting a range containing all elements that are equivalent to "key" according to "comp" or an empty range that indicates the position where those elements would be if there are no equivalent elements.

      @@ -344,7 +344,7 @@ 
    24. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, node_ptr > 
-  bounded_range(const const_node_ptr & header, const KeyType & lower_key, 
+  bounded_range(const const_node_ptr & header, const KeyType & lower_key, 
                 const KeyType & upper_key, KeyNodePtrCompare comp, 
                 bool left_closed, bool right_closed);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs. 'lower_key' must not be greater than 'upper_key' according to 'comp'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be true.

      @@ -359,7 +359,7 @@ 
    25. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::size_t 
-  count(const const_node_ptr & header, const KeyType & key, 
+  count(const const_node_ptr & header, const KeyType & key, 
         KeyNodePtrCompare comp);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

      Effects: Returns the number of elements with a key equivalent to "key" according to "comp".

      @@ -369,7 +369,7 @@ 
    26. template<typename NodePtrCompare> 
   static node_ptr 
-  insert_equal_upper_bound(const node_ptr & h, const node_ptr & new_node, 
+  insert_equal_upper_bound(const node_ptr & h, const node_ptr & new_node, 
                            NodePtrCompare comp);

      Requires: "h" must be the header node of a tree. NodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares two node_ptrs.

      Effects: Inserts new_node into the tree before the upper bound according to "comp".

      @@ -379,7 +379,7 @@ 
    27. template<typename NodePtrCompare> 
   static node_ptr 
-  insert_equal_lower_bound(const node_ptr & h, const node_ptr & new_node, 
+  insert_equal_lower_bound(const node_ptr & h, const node_ptr & new_node, 
                            NodePtrCompare comp);

      Requires: "h" must be the header node of a tree. NodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares two node_ptrs.

      Effects: Inserts new_node into the tree before the lower bound according to "comp".

      @@ -389,7 +389,7 @@ 
    28. template<typename NodePtrCompare> 
   static node_ptr 
-  insert_equal(const node_ptr & header, const node_ptr & hint, 
+  insert_equal(const node_ptr & header, const node_ptr & hint, 
                const node_ptr & new_node, NodePtrCompare comp);

      Requires: "header" must be the header node of a tree. NodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares two node_ptrs. "hint" is node from the "header"'s tree.

      Effects: Inserts new_node into the tree, using "hint" as a hint to where it will be inserted. If "hint" is the upper_bound the insertion takes constant time (two comparisons in the worst case).

      @@ -398,7 +398,7 @@ 
    29. static node_ptr 
-insert_before(const node_ptr & header, const node_ptr & pos, 
+insert_before(const node_ptr & header, const node_ptr & pos, 
               const node_ptr & new_node);

      Requires: "header" must be the header node of a tree. "pos" must be a valid iterator or header (end) node. "pos" must be an iterator pointing to the successor to "new_node" once inserted according to the order of already inserted nodes. This function does not check "pos" and this precondition must be guaranteed by the caller.

      Effects: Inserts new_node into the tree before "pos".

      @@ -407,7 +407,7 @@

      Note: If "pos" is not the successor of the newly inserted "new_node" tree invariants might be broken.

    30. -
      static void push_back(const node_ptr & header, const node_ptr & new_node);
      +
      static void push_back(const node_ptr & header, const node_ptr & new_node);

      Requires: "header" must be the header node of a tree. "new_node" must be, according to the used ordering no less than the greatest inserted key.

      Effects: Inserts new_node into the tree before "pos".

      Complexity: Constant-time.

      @@ -415,7 +415,7 @@

      Note: If "new_node" is less than the greatest inserted key tree invariants are broken. This function is slightly faster than using "insert_before".

    31. -
      static void push_front(const node_ptr & header, const node_ptr & new_node);
      +
      static void push_front(const node_ptr & header, const node_ptr & new_node);

      Requires: "header" must be the header node of a tree. "new_node" must be, according to the used ordering, no greater than the lowest inserted key.

      Effects: Inserts new_node into the tree before "pos".

      Complexity: Constant-time.

      @@ -425,7 +425,7 @@ 
    32. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, bool > 
-  insert_unique_check(const const_node_ptr & header, const KeyType & key, 
+  insert_unique_check(const const_node_ptr & header, const KeyType & key, 
                       KeyNodePtrCompare comp, 
                       insert_commit_data & commit_data);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares KeyType with a node_ptr.

      @@ -440,7 +440,7 @@ 
    33. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, bool > 
-  insert_unique_check(const const_node_ptr & header, const node_ptr & hint, 
+  insert_unique_check(const const_node_ptr & header, const node_ptr & hint, 
                       const KeyType & key, KeyNodePtrCompare comp, 
                       insert_commit_data & commit_data);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares KeyType with a node_ptr. "hint" is node from the "header"'s tree.

      @@ -453,7 +453,7 @@

      "commit_data" remains valid for a subsequent "insert_unique_commit" only if no more objects are inserted or erased from the set.

    34. -
      static void insert_unique_commit(const node_ptr & header, 
+
      static void insert_unique_commit(const node_ptr & header, 
                                  const node_ptr & new_value, 
                                  const insert_commit_data & commit_data);
      
 
      Requires: "header" must be the header node of a tree. "commit_data" must have been obtained from a previous call to "insert_unique_check". No objects should have been inserted or erased from the set between the "insert_unique_check" that filled "commit_data" and the call to "insert_commit".
      
@@ -463,7 +463,7 @@
 
      Notes: This function has only sense if a "insert_unique_check" has been previously executed to fill "commit_data". No value should be inserted or erased between the "insert_check" and "insert_commit" calls.
    35. -
      static bool is_header(const const_node_ptr & p);
      +
      static bool is_header(const const_node_ptr & p);

      Requires: p is a node of a tree.

      Effects: Returns true if p is the header of the tree.

      Complexity: Constant.

      diff --git a/doc/html/boost/intrusive/base_hook.html b/doc/html/boost/intrusive/base_hook.html index 21831dd85f..798fa99455 100644 --- a/doc/html/boost/intrusive/base_hook.html +++ b/doc/html/boost/intrusive/base_hook.html @@ -36,7 +36,7 @@ struct base_hook { };
    -

    Description

    +

    Description

    This option setter specifies that the container must use the specified base hook

    diff --git a/doc/html/boost/intrusive/bs_multiset.html b/doc/html/boost/intrusive/bs_multiset.html index fe1be075f9..043d44dcd7 100644 --- a/doc/html/boost/intrusive/bs_multiset.html +++ b/doc/html/boost/intrusive/bs_multiset.html @@ -59,131 +59,131 @@ typedef implementation_defined::node_algorithms node_algorithms; // construct/copy/destruct - explicit bs_multiset(const key_compare & = key_compare(), + explicit bs_multiset(const key_compare & = key_compare(), const value_traits & = value_traits()); template<typename Iterator> - bs_multiset(Iterator, Iterator, const key_compare & = key_compare(), + bs_multiset(Iterator, Iterator, const key_compare & = key_compare(), const value_traits & = value_traits()); - bs_multiset(bs_multiset &&); - bs_multiset & operator=(bs_multiset &&); - ~bs_multiset(); + bs_multiset(bs_multiset &&); + bs_multiset & operator=(bs_multiset &&); + ~bs_multiset(); - // public member functions - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end(); - const_iterator end() const; - const_iterator cend() const; - reverse_iterator rbegin(); - const_reverse_iterator rbegin() const; - const_reverse_iterator crbegin() const; - reverse_iterator rend(); - const_reverse_iterator rend() const; - const_reverse_iterator crend() const; - key_compare key_comp() const; - value_compare value_comp() const; - bool empty() const; - size_type size() const; - void swap(bs_multiset &); + // public member functions + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end(); + const_iterator end() const; + const_iterator cend() const; + reverse_iterator rbegin(); + const_reverse_iterator rbegin() const; + const_reverse_iterator crbegin() const; + reverse_iterator rend(); + const_reverse_iterator rend() const; + const_reverse_iterator crend() const; + key_compare key_comp() const; + value_compare value_comp() const; + bool empty() const; + size_type size() const; + void swap(bs_multiset &); template<typename Cloner, typename Disposer> - void clone_from(const bs_multiset &, Cloner, Disposer); + void clone_from(const bs_multiset &, Cloner, Disposer); template<typename Cloner, typename Disposer> - void clone_from(bs_multiset &&, Cloner, Disposer); - iterator insert(reference); - iterator insert(const_iterator, reference); - template<typename Iterator> void insert(Iterator, Iterator); - iterator insert_before(const_iterator, reference); - void push_back(reference); - void push_front(reference); - iterator erase(const_iterator); - iterator erase(const_iterator, const_iterator); - size_type erase(const key_type &); + void clone_from(bs_multiset &&, Cloner, Disposer); + iterator insert(reference); + iterator insert(const_iterator, reference); + template<typename Iterator> void insert(Iterator, Iterator); + iterator insert_before(const_iterator, reference); + void push_back(reference); + void push_front(reference); + iterator erase(const_iterator); + iterator erase(const_iterator, const_iterator); + size_type erase(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - size_type erase(const KeyType &, KeyTypeKeyCompare); + size_type erase(const KeyType &, KeyTypeKeyCompare); template<typename Disposer> - iterator erase_and_dispose(const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, Disposer); template<typename Disposer> - iterator erase_and_dispose(const_iterator, const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, const_iterator, Disposer); template<typename Disposer> - size_type erase_and_dispose(const key_type &, Disposer); + size_type erase_and_dispose(const key_type &, Disposer); template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> - size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); - void clear(); - template<typename Disposer> void clear_and_dispose(Disposer); - size_type count(const key_type &) const; + size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); + void clear(); + template<typename Disposer> void clear_and_dispose(Disposer); + size_type count(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - size_type count(const KeyType &, KeyTypeKeyCompare) const; - iterator lower_bound(const key_type &); + size_type count(const KeyType &, KeyTypeKeyCompare) const; + iterator lower_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator lower_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator lower_bound(const key_type &) const; + iterator lower_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator lower_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator upper_bound(const key_type &); + const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator upper_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator upper_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator upper_bound(const key_type &) const; + iterator upper_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator upper_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator find(const key_type &); + const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator find(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator find(const KeyType &, KeyTypeKeyCompare); - const_iterator find(const key_type &) const; + iterator find(const KeyType &, KeyTypeKeyCompare); + const_iterator find(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator find(const KeyType &, KeyTypeKeyCompare) const; - std::pair< iterator, iterator > equal_range(const key_type &); + const_iterator find(const KeyType &, KeyTypeKeyCompare) const; + std::pair< iterator, iterator > equal_range(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - equal_range(const KeyType &, KeyTypeKeyCompare); + equal_range(const KeyType &, KeyTypeKeyCompare); std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; + equal_range(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - equal_range(const KeyType &, KeyTypeKeyCompare) const; + equal_range(const KeyType &, KeyTypeKeyCompare) const; std::pair< iterator, iterator > - bounded_range(const key_type &, const key_type &, bool, bool); + bounded_range(const key_type &, const key_type &, bool, bool); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool); std::pair< const_iterator, const_iterator > - bounded_range(const key_type &, const key_type &, bool, bool) const; + bounded_range(const key_type &, const key_type &, bool, bool) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool) const; - iterator iterator_to(reference); - const_iterator iterator_to(const_reference) const; - pointer unlink_leftmost_without_rebalance(); - void replace_node(iterator, reference); - void remove_node(reference); + iterator iterator_to(reference); + const_iterator iterator_to(const_reference) const; + pointer unlink_leftmost_without_rebalance(); + void replace_node(iterator, reference); + void remove_node(reference); - // public static functions - static bs_multiset & container_from_end_iterator(iterator); - static const bs_multiset & container_from_end_iterator(const_iterator); - static bs_multiset & container_from_iterator(iterator); - static const bs_multiset & container_from_iterator(const_iterator); - static iterator s_iterator_to(reference); - static const_iterator s_iterator_to(const_reference); - static void init_node(reference); + // public static functions + static bs_multiset & container_from_end_iterator(iterator); + static const bs_multiset & container_from_end_iterator(const_iterator); + static bs_multiset & container_from_iterator(iterator); + static const bs_multiset & container_from_iterator(const_iterator); + static iterator s_iterator_to(reference); + static const_iterator s_iterator_to(const_reference); + static void init_node(reference); // public data members static const bool constant_time_size; };
    -

    Description

    +

    Description

    The class template bs_multiset is an intrusive container, that mimics most of the interface of std::multiset as described in the C++ standard.

    The template parameter T is the type to be managed by the container. The user can specify additional options and if no options are provided default options are used.

    The container supports the following options: base_hook<>/member_hook<>/value_traits<>, constant_time_size<>, size_type<> and compare<>.

    -

    +

    bs_multiset public construct/copy/destruct

    1. -
      explicit bs_multiset(const key_compare & cmp = key_compare(), 
+
      explicit bs_multiset(const key_compare & cmp = key_compare(), 
                      const value_traits & v_traits = value_traits());
      
 
      Effects: Constructs an empty container.
      
 
      Complexity: Constant.
      
@@ -191,7 +191,7 @@
 
    2. template<typename Iterator> 
-  bs_multiset(Iterator b, Iterator e, const key_compare & cmp = key_compare(), 
+  bs_multiset(Iterator b, Iterator e, const key_compare & cmp = key_compare(), 
               const value_traits & v_traits = value_traits());

      Requires: Dereferencing iterator must yield an lvalue of type value_type. cmp must be a comparison function that induces a strict weak ordering.

      Effects: Constructs an empty container and inserts elements from [b, e).

      @@ -199,15 +199,15 @@

      Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor/operator() of the key_compare object throws. Basic guarantee.

    3. -
      bs_multiset(bs_multiset && x);
      +
      bs_multiset(bs_multiset && x);

      Effects: to-do

    4. -
      bs_multiset & operator=(bs_multiset && x);
      +
      bs_multiset & operator=(bs_multiset && x);

      Effects: to-do

    5. -
      ~bs_multiset();
      +
      ~bs_multiset();

      Effects: Detaches all elements from this. The objects in the set are not deleted (i.e. no destructors are called), but the nodes according to the value_traits template parameter are reinitialized and thus can be reused.

      Complexity: Linear to elements contained in *this.

      Throws: Nothing.

      @@ -215,114 +215,114 @@
    -

    -bs_multiset public member functions

    +

    +bs_multiset public member functions

    1. -
      iterator begin();
      +
      iterator begin();

      Effects: Returns an iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    2. -
      const_iterator begin() const;
      +
      const_iterator begin() const;

      Effects: Returns a const_iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    3. -
      const_iterator cbegin() const;
      +
      const_iterator cbegin() const;

      Effects: Returns a const_iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    4. -
      iterator end();
      +
      iterator end();

      Effects: Returns an iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    5. -
      const_iterator end() const;
      +
      const_iterator end() const;

      Effects: Returns a const_iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    6. -
      const_iterator cend() const;
      +
      const_iterator cend() const;

      Effects: Returns a const_iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    7. -
      reverse_iterator rbegin();
      +
      reverse_iterator rbegin();

      Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    8. -
      const_reverse_iterator rbegin() const;
      +
      const_reverse_iterator rbegin() const;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    9. -
      const_reverse_iterator crbegin() const;
      +
      const_reverse_iterator crbegin() const;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    10. -
      reverse_iterator rend();
      +
      reverse_iterator rend();

      Effects: Returns a reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    11. -
      const_reverse_iterator rend() const;
      +
      const_reverse_iterator rend() const;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    12. -
      const_reverse_iterator crend() const;
      +
      const_reverse_iterator crend() const;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    13. -
      key_compare key_comp() const;
      +
      key_compare key_comp() const;

      Effects: Returns the key_compare object used by the container.

      Complexity: Constant.

      Throws: If key_compare copy-constructor throws.

    14. -
      value_compare value_comp() const;
      +
      value_compare value_comp() const;

      Effects: Returns the value_compare object used by the container.

      Complexity: Constant.

      Throws: If value_compare copy-constructor throws.

    15. -
      bool empty() const;
      +
      bool empty() const;

      Effects: Returns true if the container is empty.

      Complexity: Constant.

      Throws: Nothing.

    16. -
      size_type size() const;
      +
      size_type size() const;

      Effects: Returns the number of elements stored in the container.

      Complexity: Linear to elements contained in *this if constant-time size option is disabled. Constant time otherwise.

      Throws: Nothing.

    17. -
      void swap(bs_multiset & other);
      +
      void swap(bs_multiset & other);

      Effects: Swaps the contents of two containers.

      Complexity: Constant.

      Throws: If the comparison functor's swap call throws. 

    18. template<typename Cloner, typename Disposer> 
-  void clone_from(const bs_multiset & src, Cloner cloner, Disposer disposer);
      + void clone_from(const bs_multiset & src, Cloner cloner, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

      Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(const_reference ) and inserts them on *this. Copies the predicate from the source container.

      If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

      @@ -331,7 +331,7 @@ 
    19. template<typename Cloner, typename Disposer> 
-  void clone_from(bs_multiset && src, Cloner cloner, Disposer disposer);
      + void clone_from(bs_multiset && src, Cloner cloner, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

      Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(reference) and inserts them on *this. Copies the predicate from the source container.

      If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

      @@ -340,7 +340,7 @@

      Note: This version can modify the source container, useful to implement move semantics.

    20. -
      iterator insert(reference value);
      +
      iterator insert(reference value);

      Requires: value must be an lvalue

      Effects: Inserts value into the container before the upper bound.

      Complexity: Average complexity for insert element is at most logarithmic.

      @@ -348,7 +348,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    21. -
      iterator insert(const_iterator hint, reference value);
      +
      iterator insert(const_iterator hint, reference value);

      Requires: value must be an lvalue, and "hint" must be a valid iterator.

      Effects: Inserts x into the container, using "hint" as a hint to where it will be inserted. If "hint" is the upper_bound the insertion takes constant time (two comparisons in the worst case)

      Complexity: Logarithmic in general, but it is amortized constant time if t is inserted immediately before hint.

      @@ -356,7 +356,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    22. -
      template<typename Iterator> void insert(Iterator b, Iterator e);
      +
      template<typename Iterator> void insert(Iterator b, Iterator e);

      Requires: Dereferencing iterator must yield an lvalue of type value_type.

      Effects: Inserts a each element of a range into the container before the upper bound of the key of each element.

      Complexity: Insert range is in general O(N * log(N)), where N is the size of the range. However, it is linear in N if the range is already sorted by value_comp().

      @@ -364,7 +364,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    23. -
      iterator insert_before(const_iterator pos, reference value);
      +
      iterator insert_before(const_iterator pos, reference value);

      Requires: value must be an lvalue, "pos" must be a valid iterator (or end) and must be the succesor of value once inserted according to the predicate

      Effects: Inserts x into the container before "pos".

      Complexity: Constant time.

      @@ -372,7 +372,7 @@

      Note: This function does not check preconditions so if "pos" is not the successor of "value" container ordering invariant will be broken. This is a low-level function to be used only for performance reasons by advanced users.

    24. -
      void push_back(reference value);
      +
      void push_back(reference value);

      Requires: value must be an lvalue, and it must be no less than the greatest inserted key

      Effects: Inserts x into the container in the last position.

      Complexity: Constant time.

      @@ -380,7 +380,7 @@

      Note: This function does not check preconditions so if value is less than the greatest inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

    25. -
      void push_front(reference value);
      +
      void push_front(reference value);

      Requires: value must be an lvalue, and it must be no greater than the minimum inserted key

      Effects: Inserts x into the container in the first position.

      Complexity: Constant time.

      @@ -388,21 +388,21 @@

      Note: This function does not check preconditions so if value is greater than the minimum inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

    26. -
      iterator erase(const_iterator i);
      +
      iterator erase(const_iterator i);

      Effects: Erases the element pointed to by i.

      Complexity: Average complexity for erase element is constant time.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    27. -
      iterator erase(const_iterator b, const_iterator e);
      +
      iterator erase(const_iterator b, const_iterator e);

      Effects: Erases the range pointed to by b end e.

      Complexity: Average complexity for erase range is at most O(log(size() + N)), where N is the number of elements in the range.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    28. -
      size_type erase(const key_type & key);
      +
      size_type erase(const key_type & key);

      Effects: Erases all the elements with the given value.

      Returns: The number of erased elements.

      Complexity: O(log(size() + N).

      @@ -411,7 +411,8 @@ 
    29. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type erase(const KeyType & key, KeyTypeKeyCompare comp);
      + size_type erase(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Erases all the elements with the given key. according to the comparison functor "comp".

      Returns: The number of erased elements.

      Complexity: O(log(size() + N).

      @@ -420,7 +421,7 @@ 
    30. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator i, Disposer disposer);
      + iterator erase_and_dispose(const_iterator i, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases the element pointed to by i. Disposer::operator()(pointer) is called for the removed element.

      Complexity: Average complexity for erase element is constant time.

      @@ -429,7 +430,7 @@ 
    31. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator b, const_iterator e, 
+  iterator erase_and_dispose(const_iterator b, const_iterator e, 
                              Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases the range pointed to by b end e. Disposer::operator()(pointer) is called for the removed elements.

      @@ -439,7 +440,7 @@ 
    32. template<typename Disposer> 
-  size_type erase_and_dispose(const key_type & key, Disposer disposer);
      + size_type erase_and_dispose(const key_type & key, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases all the elements with the given value. Disposer::operator()(pointer) is called for the removed elements.

      Returns: The number of erased elements.

      @@ -449,8 +450,9 @@ 
    33. template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> 
-  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
+  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
                               Disposer disposer);
      +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk) and nk the key_type of a value_type inserted into *this.

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases all the elements with the given key. according to the comparison functor "comp". Disposer::operator()(pointer) is called for the removed elements.

      Returns: The number of erased elements.

      @@ -459,46 +461,47 @@

      Note: Invalidates the iterators to the erased elements.

    34. -
      void clear();
      +
      void clear();

      Effects: Erases all of the elements.

      Complexity: Linear to the number of elements on the container. if it's a safe-mode or auto-unlink value_type. Constant time otherwise.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    35. -
      template<typename Disposer> void clear_and_dispose(Disposer disposer);
      +
      template<typename Disposer> void clear_and_dispose(Disposer disposer);

      Effects: Erases all of the elements calling disposer(p) for each node to be erased. Complexity: Average complexity for is at most O(log(size() + N)), where N is the number of elements in the container.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. Calls N times to disposer functor.

    36. -
      size_type count(const key_type & key) const;
      +
      size_type count(const key_type & key) const;

      Effects: Returns the number of contained elements with the given value

      Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given value.

      Throws: If key_compare throws. 

    37. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;
      + size_type count(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      Effects: Returns the number of contained elements with the given key

      Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given key.

      Throws: If comp throws.

    38. -
      iterator lower_bound(const key_type & key);
      +
      iterator lower_bound(const key_type & key);

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    39. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      -

      Throws: If comp throws.

      +

      Throws: If key_compare throws.

    40. -
      const_iterator lower_bound(const key_type & key) const;
      +
      const_iterator lower_bound(const key_type & key) const;

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -506,26 +509,27 @@ 
    41. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
      -

      Effects: Returns a const iterator to the first element whose key is not less than k or end() if that element does not exist.

      + lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      -

      Throws: If comp throws.

      +

      Throws: If key_compare throws.

    42. -
      iterator upper_bound(const key_type & key);
      +
      iterator upper_bound(const key_type & key);

      Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    43. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    44. -
      const_iterator upper_bound(const key_type & key) const;
      +
      const_iterator upper_bound(const key_type & key) const;

      Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -533,39 +537,42 @@ 
    45. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
      + upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    46. -
      iterator find(const key_type & key);
      +
      iterator find(const key_type & key);

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    47. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator find(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator find(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    48. -
      const_iterator find(const key_type & key) const;
      -

      Effects: Finds a const_iterator to the first element whose key is k or end() if that element does not exist.

      +
      const_iterator find(const key_type & key) const;
      +

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    49. template<typename KeyType, typename KeyTypeKeyCompare> 
-  const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;
      -

      Effects: Finds a const_iterator to the first element whose key is k or end() if that element does not exist.

      + const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      +

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    50. -
      std::pair< iterator, iterator > equal_range(const key_type & key);
      +
      std::pair< iterator, iterator > equal_range(const key_type & key);

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -573,14 +580,15 @@ 
    51. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp);
      + equal_range(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If comp throws. 

    52. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & key) const;
      +equal_range(const key_type & key) const;

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -588,16 +596,18 @@ 
    53. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;
      + equal_range(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If comp throws. 

    54. std::pair< iterator, iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed);
      -

      Requires: 'lower_key' must not be greater than 'upper_key'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key) if left_closed, upper_bound(lower_key) otherwise

      second = upper_bound(upper_key) if right_closed, lower_bound(upper_key) otherwise

      @@ -609,9 +619,12 @@ 
    55. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed);
      -

      Requires: KeyTypeKeyCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the container. 'lower_key' must not be greater than 'upper_key' according to 'comp'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

      +

      upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

      +

      upper_key shall not precede lower_key according to comp [comp(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!comp(upper_key, lower_key) && !comp(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key, comp) if left_closed, upper_bound(lower_key, comp) otherwise

      second = upper_bound(upper_key, comp) if right_closed, lower_bound(upper_key, comp) otherwise

      @@ -622,9 +635,10 @@ 
    56. std::pair< const_iterator, const_iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed) const;
      -

      Requires: 'lower_key' must not be greater than 'upper_key'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key) if left_closed, upper_bound(lower_key) otherwise

      second = upper_bound(upper_key) if right_closed, lower_bound(upper_key) otherwise

      @@ -636,9 +650,12 @@ 
    57. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed) const;
      -

      Requires: KeyTypeKeyCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the container. 'lower_key' must not be greater than 'upper_key' according to 'comp'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

      +

      upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

      +

      upper_key shall not precede lower_key according to comp [comp(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!comp(upper_key, lower_key) && !comp(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key, comp) if left_closed, upper_bound(lower_key, comp) otherwise

      second = upper_bound(upper_key, comp) if right_closed, lower_bound(upper_key, comp) otherwise

      @@ -648,28 +665,28 @@

      Note: Experimental function, the interface might change in future releases.

    58. -
      iterator iterator_to(reference value);
      +
      iterator iterator_to(reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      Throws: Nothing.

    59. -
      const_iterator iterator_to(const_reference value) const;
      +
      const_iterator iterator_to(const_reference value) const;

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid const_iterator i belonging to the set that points to the value

      Complexity: Constant.

      Throws: Nothing.

    60. -
      pointer unlink_leftmost_without_rebalance();
      +
      pointer unlink_leftmost_without_rebalance();

      Effects: Unlinks the leftmost node from the container.

      Complexity: Average complexity is constant time.

      Throws: Nothing.

      Notes: This function breaks the container and the container can only be used for more unlink_leftmost_without_rebalance calls. This function is normally used to achieve a step by step controlled destruction of the container.

    61. -
      void replace_node(iterator replace_this, reference with_this);
      +
      void replace_node(iterator replace_this, reference with_this);

      Requires: replace_this must be a valid iterator of *this and with_this must not be inserted in any container.

      Effects: Replaces replace_this in its position in the container with with_this. The container does not need to be rebalanced.

      Complexity: Constant.

      @@ -677,7 +694,7 @@

      Note: This function will break container ordering invariants if with_this is not equivalent to *replace_this according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing or comparison is needed.

    62. -
      void remove_node(reference value);
      +
      void remove_node(reference value);

      Effects: removes "value" from the container.

      Throws: Nothing.

      Complexity: Logarithmic time.

      @@ -687,11 +704,11 @@
    -

    -bs_multiset public static functions

    +

    +bs_multiset public static functions

    1. -
      static bs_multiset & container_from_end_iterator(iterator end_iterator);
      +
      static bs_multiset & container_from_end_iterator(iterator end_iterator);

      Precondition: end_iterator must be a valid end iterator of the container.

      Effects: Returns a const reference to the container associated to the end iterator

      Throws: Nothing.

      @@ -699,28 +716,28 @@ 
    2. static const bs_multiset & 
-container_from_end_iterator(const_iterator end_iterator);
      +container_from_end_iterator(const_iterator end_iterator);

      Precondition: end_iterator must be a valid end iterator of the container.

      Effects: Returns a const reference to the container associated to the end iterator

      Throws: Nothing.

      Complexity: Constant.

    3. -
      static bs_multiset & container_from_iterator(iterator it);
      +
      static bs_multiset & container_from_iterator(iterator it);

      Precondition: it must be a valid iterator of the container.

      Effects: Returns a const reference to the container associated to the iterator

      Throws: Nothing.

      Complexity: Logarithmic.

    4. -
      static const bs_multiset & container_from_iterator(const_iterator it);
      +
      static const bs_multiset & container_from_iterator(const_iterator it);

      Precondition: it must be a valid iterator of the container.

      Effects: Returns a const reference to the container associated to the iterator

      Throws: Nothing.

      Complexity: Logarithmic.

    5. -
      static iterator s_iterator_to(reference value);
      +
      static iterator s_iterator_to(reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      @@ -728,7 +745,7 @@

      Note: This static function is available only if the value traits is stateless.

    6. -
      static const_iterator s_iterator_to(const_reference value);
      +
      static const_iterator s_iterator_to(const_reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      @@ -736,7 +753,7 @@

      Note: This static function is available only if the value traits is stateless.

    7. -
      static void init_node(reference value);
      +
      static void init_node(reference value);

      Requires: value shall not be in a container.

      Effects: init_node puts the hook of a value in a well-known default state.

      Throws: Nothing.

      diff --git a/doc/html/boost/intrusive/bs_set.html b/doc/html/boost/intrusive/bs_set.html index 2bdeec9449..0d112f3742 100644 --- a/doc/html/boost/intrusive/bs_set.html +++ b/doc/html/boost/intrusive/bs_set.html @@ -59,139 +59,139 @@ typedef implementation_defined::node_algorithms node_algorithms; // construct/copy/destruct - explicit bs_set(const key_compare & = key_compare(), + explicit bs_set(const key_compare & = key_compare(), const value_traits & = value_traits()); template<typename Iterator> - bs_set(Iterator, Iterator, const key_compare & = key_compare(), + bs_set(Iterator, Iterator, const key_compare & = key_compare(), const value_traits & = value_traits()); - bs_set(bs_set &&); - bs_set & operator=(bs_set &&); - ~bs_set(); + bs_set(bs_set &&); + bs_set & operator=(bs_set &&); + ~bs_set(); - // public member functions - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end(); - const_iterator end() const; - const_iterator cend() const; - reverse_iterator rbegin(); - const_reverse_iterator rbegin() const; - const_reverse_iterator crbegin() const; - reverse_iterator rend(); - const_reverse_iterator rend() const; - const_reverse_iterator crend() const; - key_compare key_comp() const; - value_compare value_comp() const; - bool empty() const; - size_type size() const; - void swap(bs_set &); + // public member functions + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end(); + const_iterator end() const; + const_iterator cend() const; + reverse_iterator rbegin(); + const_reverse_iterator rbegin() const; + const_reverse_iterator crbegin() const; + reverse_iterator rend(); + const_reverse_iterator rend() const; + const_reverse_iterator crend() const; + key_compare key_comp() const; + value_compare value_comp() const; + bool empty() const; + size_type size() const; + void swap(bs_set &); template<typename Cloner, typename Disposer> - void clone_from(const bs_set &, Cloner, Disposer); + void clone_from(const bs_set &, Cloner, Disposer); template<typename Cloner, typename Disposer> - void clone_from(bs_set &&, Cloner, Disposer); - std::pair< iterator, bool > insert(reference); - iterator insert(const_iterator, reference); + void clone_from(bs_set &&, Cloner, Disposer); + std::pair< iterator, bool > insert(reference); + iterator insert(const_iterator, reference); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, bool > - insert_check(const KeyType &, KeyTypeKeyCompare, insert_commit_data &); + insert_check(const KeyType &, KeyTypeKeyCompare, insert_commit_data &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, bool > - insert_check(const_iterator, const KeyType &, KeyTypeKeyCompare, + insert_check(const_iterator, const KeyType &, KeyTypeKeyCompare, insert_commit_data &); - template<typename Iterator> void insert(Iterator, Iterator); - iterator insert_commit(reference, const insert_commit_data &); - iterator insert_before(const_iterator, reference); - void push_back(reference); - void push_front(reference); - iterator erase(const_iterator); - iterator erase(const_iterator, const_iterator); - size_type erase(const key_type &); + template<typename Iterator> void insert(Iterator, Iterator); + iterator insert_commit(reference, const insert_commit_data &); + iterator insert_before(const_iterator, reference); + void push_back(reference); + void push_front(reference); + iterator erase(const_iterator); + iterator erase(const_iterator, const_iterator); + size_type erase(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - size_type erase(const KeyType &, KeyTypeKeyCompare); + size_type erase(const KeyType &, KeyTypeKeyCompare); template<typename Disposer> - iterator erase_and_dispose(const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, Disposer); template<typename Disposer> - iterator erase_and_dispose(const_iterator, const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, const_iterator, Disposer); template<typename Disposer> - size_type erase_and_dispose(const key_type &, Disposer); + size_type erase_and_dispose(const key_type &, Disposer); template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> - size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); - void clear(); - template<typename Disposer> void clear_and_dispose(Disposer); - size_type count(const key_type &) const; + size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); + void clear(); + template<typename Disposer> void clear_and_dispose(Disposer); + size_type count(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - size_type count(const KeyType &, KeyTypeKeyCompare) const; - iterator lower_bound(const key_type &); + size_type count(const KeyType &, KeyTypeKeyCompare) const; + iterator lower_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator lower_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator lower_bound(const key_type &) const; + iterator lower_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator lower_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator upper_bound(const key_type &); + const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator upper_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator upper_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator upper_bound(const key_type &) const; + iterator upper_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator upper_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator find(const key_type &); + const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator find(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator find(const KeyType &, KeyTypeKeyCompare); - const_iterator find(const key_type &) const; + iterator find(const KeyType &, KeyTypeKeyCompare); + const_iterator find(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator find(const KeyType &, KeyTypeKeyCompare) const; - std::pair< iterator, iterator > equal_range(const key_type &); + const_iterator find(const KeyType &, KeyTypeKeyCompare) const; + std::pair< iterator, iterator > equal_range(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - equal_range(const KeyType &, KeyTypeKeyCompare); + equal_range(const KeyType &, KeyTypeKeyCompare); std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; + equal_range(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - equal_range(const KeyType &, KeyTypeKeyCompare) const; + equal_range(const KeyType &, KeyTypeKeyCompare) const; std::pair< iterator, iterator > - bounded_range(const key_type &, const key_type &, bool, bool); + bounded_range(const key_type &, const key_type &, bool, bool); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool); std::pair< const_iterator, const_iterator > - bounded_range(const key_type &, const key_type &, bool, bool) const; + bounded_range(const key_type &, const key_type &, bool, bool) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool) const; - iterator iterator_to(reference); - const_iterator iterator_to(const_reference) const; - pointer unlink_leftmost_without_rebalance(); - void replace_node(iterator, reference); - void remove_node(reference); + iterator iterator_to(reference); + const_iterator iterator_to(const_reference) const; + pointer unlink_leftmost_without_rebalance(); + void replace_node(iterator, reference); + void remove_node(reference); - // public static functions - static bs_set & container_from_end_iterator(iterator); - static const bs_set & container_from_end_iterator(const_iterator); - static bs_set & container_from_iterator(iterator); - static const bs_set & container_from_iterator(const_iterator); - static iterator s_iterator_to(reference); - static const_iterator s_iterator_to(const_reference); - static void init_node(reference); + // public static functions + static bs_set & container_from_end_iterator(iterator); + static const bs_set & container_from_end_iterator(const_iterator); + static bs_set & container_from_iterator(iterator); + static const bs_set & container_from_iterator(const_iterator); + static iterator s_iterator_to(reference); + static const_iterator s_iterator_to(const_reference); + static void init_node(reference); // public data members static const bool constant_time_size; };
    -

    Description

    +

    Description

    The class template bs_set is an intrusive container, that mimics most of the interface of std::set as described in the C++ standard.

    The template parameter T is the type to be managed by the container. The user can specify additional options and if no options are provided default options are used.

    The container supports the following options: base_hook<>/member_hook<>/value_traits<>, constant_time_size<>, size_type<> and compare<>.

    -

    +

    bs_set public construct/copy/destruct

    1. -
      explicit bs_set(const key_compare & cmp = key_compare(), 
+
      explicit bs_set(const key_compare & cmp = key_compare(), 
                 const value_traits & v_traits = value_traits());
      
 
      Effects: Constructs an empty container.
      
 
      Complexity: Constant.
      
@@ -199,7 +199,7 @@
 
    2. template<typename Iterator> 
-  bs_set(Iterator b, Iterator e, const key_compare & cmp = key_compare(), 
+  bs_set(Iterator b, Iterator e, const key_compare & cmp = key_compare(), 
          const value_traits & v_traits = value_traits());

      Requires: Dereferencing iterator must yield an lvalue of type value_type. cmp must be a comparison function that induces a strict weak ordering.

      Effects: Constructs an empty container and inserts elements from [b, e).

      @@ -207,15 +207,15 @@

      Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor/operator() of the key_compare object throws. Basic guarantee.

    3. -
      bs_set(bs_set && x);
      +
      bs_set(bs_set && x);

      Effects: to-do

    4. -
      bs_set & operator=(bs_set && x);
      +
      bs_set & operator=(bs_set && x);

      Effects: to-do

    5. -
      ~bs_set();
      +
      ~bs_set();

      Effects: Detaches all elements from this. The objects in the set are not deleted (i.e. no destructors are called), but the nodes according to the value_traits template parameter are reinitialized and thus can be reused.

      Complexity: Linear to elements contained in *this.

      Throws: Nothing.

      @@ -223,114 +223,114 @@
    -

    -bs_set public member functions

    +

    +bs_set public member functions

    1. -
      iterator begin();
      +
      iterator begin();

      Effects: Returns an iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    2. -
      const_iterator begin() const;
      +
      const_iterator begin() const;

      Effects: Returns a const_iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    3. -
      const_iterator cbegin() const;
      +
      const_iterator cbegin() const;

      Effects: Returns a const_iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    4. -
      iterator end();
      +
      iterator end();

      Effects: Returns an iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    5. -
      const_iterator end() const;
      +
      const_iterator end() const;

      Effects: Returns a const_iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    6. -
      const_iterator cend() const;
      +
      const_iterator cend() const;

      Effects: Returns a const_iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    7. -
      reverse_iterator rbegin();
      +
      reverse_iterator rbegin();

      Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    8. -
      const_reverse_iterator rbegin() const;
      +
      const_reverse_iterator rbegin() const;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    9. -
      const_reverse_iterator crbegin() const;
      +
      const_reverse_iterator crbegin() const;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    10. -
      reverse_iterator rend();
      +
      reverse_iterator rend();

      Effects: Returns a reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    11. -
      const_reverse_iterator rend() const;
      +
      const_reverse_iterator rend() const;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    12. -
      const_reverse_iterator crend() const;
      +
      const_reverse_iterator crend() const;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    13. -
      key_compare key_comp() const;
      +
      key_compare key_comp() const;

      Effects: Returns the key_compare object used by the container.

      Complexity: Constant.

      Throws: If key_compare copy-constructor throws.

    14. -
      value_compare value_comp() const;
      +
      value_compare value_comp() const;

      Effects: Returns the value_compare object used by the container.

      Complexity: Constant.

      Throws: If value_compare copy-constructor throws.

    15. -
      bool empty() const;
      +
      bool empty() const;

      Effects: Returns true if the container is empty.

      Complexity: Constant.

      Throws: Nothing.

    16. -
      size_type size() const;
      +
      size_type size() const;

      Effects: Returns the number of elements stored in the container.

      Complexity: Linear to elements contained in *this if constant-time size option is disabled. Constant time otherwise.

      Throws: Nothing.

    17. -
      void swap(bs_set & other);
      +
      void swap(bs_set & other);

      Effects: Swaps the contents of two containers.

      Complexity: Constant.

      Throws: If the comparison functor's swap call throws. 

    18. template<typename Cloner, typename Disposer> 
-  void clone_from(const bs_set & src, Cloner cloner, Disposer disposer);
      + void clone_from(const bs_set & src, Cloner cloner, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

      Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(const_reference ) and inserts them on *this. Copies the predicate from the source container.

      If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

      @@ -339,7 +339,7 @@ 
    19. template<typename Cloner, typename Disposer> 
-  void clone_from(bs_set && src, Cloner cloner, Disposer disposer);
      + void clone_from(bs_set && src, Cloner cloner, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

      Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(reference) and inserts them on *this. Copies the predicate from the source container.

      If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

      @@ -348,7 +348,7 @@

      Note: This version can modify the source container, useful to implement move semantics.

    20. -
      std::pair< iterator, bool > insert(reference value);
      +
      std::pair< iterator, bool > insert(reference value);

      Requires: value must be an lvalue

      Effects: Inserts value into the container if the value is not already present.

      Complexity: Average complexity for insert element is at most logarithmic.

      @@ -356,7 +356,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    21. -
      iterator insert(const_iterator hint, reference value);
      +
      iterator insert(const_iterator hint, reference value);

      Requires: value must be an lvalue, and "hint" must be a valid iterator

      Effects: Tries to insert x into the container, using "hint" as a hint to where it will be inserted.

      Complexity: Logarithmic in general, but it is amortized constant time (two comparisons in the worst case) if t is inserted immediately before hint.

      @@ -366,7 +366,7 @@ 
    22. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, bool > 
-  insert_check(const KeyType & key, KeyTypeKeyCompare comp, 
+  insert_check(const KeyType & key, KeyTypeKeyCompare comp, 
                insert_commit_data & commit_data);

      Requires: comp must be a comparison function that induces the same strict weak ordering as key_compare. The difference is that comp compares an arbitrary key with the contained values.

      Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself.

      @@ -380,7 +380,7 @@ 
    23. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, bool > 
-  insert_check(const_iterator hint, const KeyType & key, 
+  insert_check(const_iterator hint, const KeyType & key, 
                KeyTypeKeyCompare comp, insert_commit_data & commit_data);

      Requires: comp must be a comparison function that induces the same strict weak ordering as key_compare. The difference is that comp compares an arbitrary key with the contained values.

      Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself, using "hint" as a hint to where it will be inserted.

      @@ -392,7 +392,7 @@

      "commit_data" remains valid for a subsequent "insert_commit" only if no more objects are inserted or erased from the container.

    24. -
      template<typename Iterator> void insert(Iterator b, Iterator e);
      +
      template<typename Iterator> void insert(Iterator b, Iterator e);

      Requires: Dereferencing iterator must yield an lvalue of type value_type.

      Effects: Tries to insert each element of a range into the container.

      Complexity: Insert range is in general O(N * log(N)), where N is the size of the range. However, it is linear in N if the range is already sorted by value_comp().

      @@ -400,7 +400,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    25. -
      iterator insert_commit(reference value, 
+
      iterator insert_commit(reference value, 
                        const insert_commit_data & commit_data);
      
 
      Requires: value must be an lvalue of type value_type. commit_data must have been obtained from a previous call to "insert_check". No objects should have been inserted or erased from the container between the "insert_check" that filled "commit_data" and the call to "insert_commit".
      
 
      Effects: Inserts the value in the container using the information obtained from the "commit_data" that a previous "insert_check" filled.
      
@@ -410,7 +410,7 @@
 
      Notes: This function has only sense if a "insert_check" has been previously executed to fill "commit_data". No value should be inserted or erased between the "insert_check" and "insert_commit" calls.
    26. -
      iterator insert_before(const_iterator pos, reference value);
      +
      iterator insert_before(const_iterator pos, reference value);

      Requires: value must be an lvalue, "pos" must be a valid iterator (or end) and must be the succesor of value once inserted according to the predicate

      Effects: Inserts x into the container before "pos".

      Complexity: Constant time.

      @@ -418,7 +418,7 @@

      Note: This function does not check preconditions so if "pos" is not the successor of "value" container ordering invariant will be broken. This is a low-level function to be used only for performance reasons by advanced users.

    27. -
      void push_back(reference value);
      +
      void push_back(reference value);

      Requires: value must be an lvalue, and it must be no less than the greatest inserted key

      Effects: Inserts x into the container in the last position.

      Complexity: Constant time.

      @@ -426,7 +426,7 @@

      Note: This function does not check preconditions so if value is less than the greatest inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

    28. -
      void push_front(reference value);
      +
      void push_front(reference value);

      Requires: value must be an lvalue, and it must be no greater than the minimum inserted key

      Effects: Inserts x into the container in the first position.

      Complexity: Constant time.

      @@ -434,21 +434,21 @@

      Note: This function does not check preconditions so if value is greater than the minimum inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

    29. -
      iterator erase(const_iterator i);
      +
      iterator erase(const_iterator i);

      Effects: Erases the element pointed to by i.

      Complexity: Average complexity for erase element is constant time.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    30. -
      iterator erase(const_iterator b, const_iterator e);
      +
      iterator erase(const_iterator b, const_iterator e);

      Effects: Erases the range pointed to by b end e.

      Complexity: Average complexity for erase range is at most O(log(size() + N)), where N is the number of elements in the range.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    31. -
      size_type erase(const key_type & key);
      +
      size_type erase(const key_type & key);

      Effects: Erases all the elements with the given value.

      Returns: The number of erased elements.

      Complexity: O(log(size() + N).

      @@ -457,7 +457,8 @@ 
    32. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type erase(const KeyType & key, KeyTypeKeyCompare comp);
      + size_type erase(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Erases all the elements with the given key. according to the comparison functor "comp".

      Returns: The number of erased elements.

      Complexity: O(log(size() + N).

      @@ -466,7 +467,7 @@ 
    33. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator i, Disposer disposer);
      + iterator erase_and_dispose(const_iterator i, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases the element pointed to by i. Disposer::operator()(pointer) is called for the removed element.

      Complexity: Average complexity for erase element is constant time.

      @@ -475,7 +476,7 @@ 
    34. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator b, const_iterator e, 
+  iterator erase_and_dispose(const_iterator b, const_iterator e, 
                              Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases the range pointed to by b end e. Disposer::operator()(pointer) is called for the removed elements.

      @@ -485,7 +486,7 @@ 
    35. template<typename Disposer> 
-  size_type erase_and_dispose(const key_type & key, Disposer disposer);
      + size_type erase_and_dispose(const key_type & key, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases all the elements with the given value. Disposer::operator()(pointer) is called for the removed elements.

      Returns: The number of erased elements.

      @@ -495,8 +496,9 @@ 
    36. template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> 
-  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
+  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
                               Disposer disposer);
      +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk) and nk the key_type of a value_type inserted into *this.

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases all the elements with the given key. according to the comparison functor "comp". Disposer::operator()(pointer) is called for the removed elements.

      Returns: The number of erased elements.

      @@ -505,46 +507,47 @@

      Note: Invalidates the iterators to the erased elements.

    37. -
      void clear();
      +
      void clear();

      Effects: Erases all of the elements.

      Complexity: Linear to the number of elements on the container. if it's a safe-mode or auto-unlink value_type. Constant time otherwise.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    38. -
      template<typename Disposer> void clear_and_dispose(Disposer disposer);
      +
      template<typename Disposer> void clear_and_dispose(Disposer disposer);

      Effects: Erases all of the elements calling disposer(p) for each node to be erased. Complexity: Average complexity for is at most O(log(size() + N)), where N is the number of elements in the container.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. Calls N times to disposer functor.

    39. -
      size_type count(const key_type & key) const;
      +
      size_type count(const key_type & key) const;

      Effects: Returns the number of contained elements with the given value

      Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given value.

      Throws: If key_compare throws. 

    40. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;
      + size_type count(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      Effects: Returns the number of contained elements with the given key

      Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given key.

      Throws: If comp throws.

    41. -
      iterator lower_bound(const key_type &);
      +
      iterator lower_bound(const key_type &);

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    42. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      -

      Throws: If comp throws.

      +

      Throws: If key_compare throws.

    43. -
      const_iterator lower_bound(const key_type & key) const;
      +
      const_iterator lower_bound(const key_type & key) const;

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -552,26 +555,27 @@ 
    44. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
      -

      Effects: Returns a const iterator to the first element whose key is not less than k or end() if that element does not exist.

      + lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      -

      Throws: If comp throws.

      +

      Throws: If key_compare throws.

    45. -
      iterator upper_bound(const key_type & key);
      +
      iterator upper_bound(const key_type & key);

      Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    46. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    47. -
      const_iterator upper_bound(const key_type & key) const;
      +
      const_iterator upper_bound(const key_type & key) const;

      Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -579,39 +583,42 @@ 
    48. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
      + upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    49. -
      iterator find(const key_type & key);
      +
      iterator find(const key_type & key);

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    50. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator find(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator find(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    51. -
      const_iterator find(const key_type & key) const;
      -

      Effects: Finds a const_iterator to the first element whose key is k or end() if that element does not exist.

      +
      const_iterator find(const key_type & key) const;
      +

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    52. template<typename KeyType, typename KeyTypeKeyCompare> 
-  const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;
      -

      Effects: Finds a const_iterator to the first element whose key is k or end() if that element does not exist.

      + const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      +

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    53. -
      std::pair< iterator, iterator > equal_range(const key_type & key);
      +
      std::pair< iterator, iterator > equal_range(const key_type & key);

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -619,14 +626,15 @@ 
    54. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp);
      + equal_range(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If comp throws. 

    55. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & key) const;
      +equal_range(const key_type & key) const;

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -634,16 +642,18 @@ 
    56. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;
      + equal_range(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If comp throws. 

    57. std::pair< iterator, iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed);
      -

      Requires: 'lower_key' must not be greater than 'upper_key'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key) if left_closed, upper_bound(lower_key) otherwise

      second = upper_bound(upper_key) if right_closed, lower_bound(upper_key) otherwise

      @@ -655,9 +665,12 @@ 
    58. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed);
      -

      Requires: KeyTypeKeyCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the container. 'lower_key' must not be greater than 'upper_key' according to 'comp'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

      +

      upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

      +

      upper_key shall not precede lower_key according to comp [comp(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!comp(upper_key, lower_key) && !comp(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key, comp) if left_closed, upper_bound(lower_key, comp) otherwise

      second = upper_bound(upper_key, comp) if right_closed, lower_bound(upper_key, comp) otherwise

      @@ -668,9 +681,10 @@ 
    59. std::pair< const_iterator, const_iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed) const;
      -

      Requires: 'lower_key' must not be greater than 'upper_key'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key) if left_closed, upper_bound(lower_key) otherwise

      second = upper_bound(upper_key) if right_closed, lower_bound(upper_key) otherwise

      @@ -682,9 +696,12 @@ 
    60. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed) const;
      -

      Requires: KeyTypeKeyCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the container. 'lower_key' must not be greater than 'upper_key' according to 'comp'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

      +

      upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

      +

      upper_key shall not precede lower_key according to comp [comp(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!comp(upper_key, lower_key) && !comp(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key, comp) if left_closed, upper_bound(lower_key, comp) otherwise

      second = upper_bound(upper_key, comp) if right_closed, lower_bound(upper_key, comp) otherwise

      @@ -694,28 +711,28 @@

      Note: Experimental function, the interface might change in future releases.

    61. -
      iterator iterator_to(reference value);
      +
      iterator iterator_to(reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      Throws: Nothing.

    62. -
      const_iterator iterator_to(const_reference value) const;
      +
      const_iterator iterator_to(const_reference value) const;

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid const_iterator i belonging to the set that points to the value

      Complexity: Constant.

      Throws: Nothing.

    63. -
      pointer unlink_leftmost_without_rebalance();
      +
      pointer unlink_leftmost_without_rebalance();

      Effects: Unlinks the leftmost node from the container.

      Complexity: Average complexity is constant time.

      Throws: Nothing.

      Notes: This function breaks the container and the container can only be used for more unlink_leftmost_without_rebalance calls. This function is normally used to achieve a step by step controlled destruction of the container.

    64. -
      void replace_node(iterator replace_this, reference with_this);
      +
      void replace_node(iterator replace_this, reference with_this);

      Requires: replace_this must be a valid iterator of *this and with_this must not be inserted in any container.

      Effects: Replaces replace_this in its position in the container with with_this. The container does not need to be rebalanced.

      Complexity: Constant.

      @@ -723,7 +740,7 @@

      Note: This function will break container ordering invariants if with_this is not equivalent to *replace_this according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing or comparison is needed.

    65. -
      void remove_node(reference value);
      +
      void remove_node(reference value);

      Effects: removes "value" from the container.

      Throws: Nothing.

      Complexity: Logarithmic time.

      @@ -733,39 +750,39 @@
    -

    -bs_set public static functions

    +

    +bs_set public static functions

    1. -
      static bs_set & container_from_end_iterator(iterator end_iterator);
      +
      static bs_set & container_from_end_iterator(iterator end_iterator);

      Precondition: end_iterator must be a valid end iterator of the container.

      Effects: Returns a const reference to the container associated to the end iterator

      Throws: Nothing.

      Complexity: Constant.

    2. -
      static const bs_set & container_from_end_iterator(const_iterator end_iterator);
      +
      static const bs_set & container_from_end_iterator(const_iterator end_iterator);

      Precondition: end_iterator must be a valid end iterator of the container.

      Effects: Returns a const reference to the container associated to the end iterator

      Throws: Nothing.

      Complexity: Constant.

    3. -
      static bs_set & container_from_iterator(iterator it);
      +
      static bs_set & container_from_iterator(iterator it);

      Precondition: it must be a valid iterator of the container.

      Effects: Returns a const reference to the container associated to the iterator

      Throws: Nothing.

      Complexity: Logarithmic.

    4. -
      static const bs_set & container_from_iterator(const_iterator it);
      +
      static const bs_set & container_from_iterator(const_iterator it);

      Precondition: it must be a valid iterator of the container.

      Effects: Returns a const reference to the container associated to the iterator

      Throws: Nothing.

      Complexity: Logarithmic.

    5. -
      static iterator s_iterator_to(reference value);
      +
      static iterator s_iterator_to(reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      @@ -773,7 +790,7 @@

      Note: This static function is available only if the value traits is stateless.

    6. -
      static const_iterator s_iterator_to(const_reference value);
      +
      static const_iterator s_iterator_to(const_reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      @@ -781,7 +798,7 @@

      Note: This static function is available only if the value traits is stateless.

    7. -
      static void init_node(reference value);
      +
      static void init_node(reference value);

      Requires: value shall not be in a container.

      Effects: init_node puts the hook of a value in a well-known default state.

      Throws: Nothing.

      diff --git a/doc/html/boost/intrusive/bs_set_base_hook.html b/doc/html/boost/intrusive/bs_set_base_hook.html index b1fe9840c3..69bd00f6ea 100644 --- a/doc/html/boost/intrusive/bs_set_base_hook.html +++ b/doc/html/boost/intrusive/bs_set_base_hook.html @@ -36,71 +36,71 @@ class bs_set_base_hook : public make_bs_set_base_hook::type< O1, O2, O3 > { public: // construct/copy/destruct - bs_set_base_hook(); - bs_set_base_hook(const bs_set_base_hook &); - bs_set_base_hook & operator=(const bs_set_base_hook &); - ~bs_set_base_hook(); + bs_set_base_hook(); + bs_set_base_hook(const bs_set_base_hook &); + bs_set_base_hook & operator=(const bs_set_base_hook &); + ~bs_set_base_hook(); - // public member functions - void swap_nodes(bs_set_base_hook &); - bool is_linked() const; - void unlink(); + // public member functions + void swap_nodes(bs_set_base_hook &); + bool is_linked() const; + void unlink(); };
    -

    Description

    +

    Description

    Derive a class from bs_set_base_hook in order to store objects in in a bs_set/bs_multiset. bs_set_base_hook holds the data necessary to maintain the bs_set/bs_multiset and provides an appropriate value_traits class for bs_set/bs_multiset.

    The hook admits the following options: tag<>, void_pointer<>, link_mode<>.

    tag<> defines a tag to identify the node. The same tag value can be used in different classes, but if a class is derived from more than one list_base_hook, then each list_base_hook needs its unique tag.

    void_pointer<> is the pointer type that will be used internally in the hook and the container configured to use this hook.

    link_mode<> will specify the linking mode of the hook (normal_link, auto_unlink or safe_link).

    -

    +

    bs_set_base_hook public construct/copy/destruct

    1. -
      bs_set_base_hook();
      +
      bs_set_base_hook();

      Effects: If link_mode is auto_unlink or safe_link initializes the node to an unlinked state.

      Throws: Nothing.

    2. -
      bs_set_base_hook(const bs_set_base_hook &);
      +
      bs_set_base_hook(const bs_set_base_hook &);

      Effects: If link_mode is auto_unlink or safe_link initializes the node to an unlinked state. The argument is ignored.

      Throws: Nothing.

      Rationale: Providing a copy-constructor makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

    3. -
      bs_set_base_hook & operator=(const bs_set_base_hook &);
      +
      bs_set_base_hook & operator=(const bs_set_base_hook &);

      Effects: Empty function. The argument is ignored.

      Throws: Nothing.

      Rationale: Providing an assignment operator makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

    4. -
      ~bs_set_base_hook();
      +
      ~bs_set_base_hook();

      Effects: If link_mode is normal_link, the destructor does nothing (ie. no code is generated). If link_mode is safe_link and the object is stored in a set an assertion is raised. If link_mode is auto_unlink and is_linked() is true, the node is unlinked.

      Throws: Nothing.

    -

    -bs_set_base_hook public member functions

    +

    +bs_set_base_hook public member functions

    1. -
      void swap_nodes(bs_set_base_hook & other);
      +
      void swap_nodes(bs_set_base_hook & other);

      Effects: Swapping two nodes swaps the position of the elements related to those nodes in one or two containers. That is, if the node this is part of the element e1, the node x is part of the element e2 and both elements are included in the containers s1 and s2, then after the swap-operation e1 is in s2 at the position of e2 and e2 is in s1 at the position of e1. If one element is not in a container, then after the swap-operation the other element is not in a container. Iterators to e1 and e2 related to those nodes are invalidated.

      Complexity: Constant

      Throws: Nothing.

    2. -
      bool is_linked() const;
      +
      bool is_linked() const;

      Precondition: link_mode must be safe_link or auto_unlink.

      Returns: true, if the node belongs to a container, false otherwise. This function can be used to test whether set::iterator_to will return a valid iterator.

      Complexity: Constant

    3. -
      void unlink();
      +
      void unlink();

      Effects: Removes the node if it's inserted in a container. This function is only allowed if link_mode is auto_unlink.

      Throws: Nothing.

      4. diff --git a/doc/html/boost/intrusive/bs_set_member_hook.html b/doc/html/boost/intrusive/bs_set_member_hook.html index 9277f411b8..04e9827ba3 100644 --- a/doc/html/boost/intrusive/bs_set_member_hook.html +++ b/doc/html/boost/intrusive/bs_set_member_hook.html @@ -36,70 +36,70 @@ class bs_set_member_hook : public make_bs_set_member_hook::type< O1, O2, O3 > { public: // construct/copy/destruct - bs_set_member_hook(); - bs_set_member_hook(const bs_set_member_hook &); - bs_set_member_hook & operator=(const bs_set_member_hook &); - ~bs_set_member_hook(); + bs_set_member_hook(); + bs_set_member_hook(const bs_set_member_hook &); + bs_set_member_hook & operator=(const bs_set_member_hook &); + ~bs_set_member_hook(); - // public member functions - void swap_nodes(bs_set_member_hook &); - bool is_linked() const; - void unlink(); + // public member functions + void swap_nodes(bs_set_member_hook &); + bool is_linked() const; + void unlink(); };
    -

    Description

    +

    Description

    Put a public data member bs_set_member_hook in order to store objects of this class in a bs_set/bs_multiset. bs_set_member_hook holds the data necessary for maintaining the bs_set/bs_multiset and provides an appropriate value_traits class for bs_set/bs_multiset.

    The hook admits the following options: void_pointer<>, link_mode<>.

    void_pointer<> is the pointer type that will be used internally in the hook and the container configured to use this hook.

    link_mode<> will specify the linking mode of the hook (normal_link, auto_unlink or safe_link).

    -

    +

    bs_set_member_hook public construct/copy/destruct

    1. -
      bs_set_member_hook();
      +
      bs_set_member_hook();

      Effects: If link_mode is auto_unlink or safe_link initializes the node to an unlinked state.

      Throws: Nothing.

    2. -
      bs_set_member_hook(const bs_set_member_hook &);
      +
      bs_set_member_hook(const bs_set_member_hook &);

      Effects: If link_mode is auto_unlink or safe_link initializes the node to an unlinked state. The argument is ignored.

      Throws: Nothing.

      Rationale: Providing a copy-constructor makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

    3. -
      bs_set_member_hook & operator=(const bs_set_member_hook &);
      +
      bs_set_member_hook & operator=(const bs_set_member_hook &);

      Effects: Empty function. The argument is ignored.

      Throws: Nothing.

      Rationale: Providing an assignment operator makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

    4. -
      ~bs_set_member_hook();
      +
      ~bs_set_member_hook();

      Effects: If link_mode is normal_link, the destructor does nothing (ie. no code is generated). If link_mode is safe_link and the object is stored in a set an assertion is raised. If link_mode is auto_unlink and is_linked() is true, the node is unlinked.

      Throws: Nothing.

    -

    -bs_set_member_hook public member functions

    +

    +bs_set_member_hook public member functions

    1. -
      void swap_nodes(bs_set_member_hook & other);
      +
      void swap_nodes(bs_set_member_hook & other);

      Effects: Swapping two nodes swaps the position of the elements related to those nodes in one or two containers. That is, if the node this is part of the element e1, the node x is part of the element e2 and both elements are included in the containers s1 and s2, then after the swap-operation e1 is in s2 at the position of e2 and e2 is in s1 at the position of e1. If one element is not in a container, then after the swap-operation the other element is not in a container. Iterators to e1 and e2 related to those nodes are invalidated.

      Complexity: Constant

      Throws: Nothing.

    2. -
      bool is_linked() const;
      +
      bool is_linked() const;

      Precondition: link_mode must be safe_link or auto_unlink.

      Returns: true, if the node belongs to a container, false otherwise. This function can be used to test whether set::iterator_to will return a valid iterator.

      Complexity: Constant

    3. -
      void unlink();
      +
      void unlink();

      Effects: Removes the node if it's inserted in a container. This function is only allowed if link_mode is auto_unlink.

      Throws: Nothing.

      4. diff --git a/doc/html/boost/intrusive/bstree.html b/doc/html/boost/intrusive/bstree.html index 19366c96f8..2b31e8b2f5 100644 --- a/doc/html/boost/intrusive/bstree.html +++ b/doc/html/boost/intrusive/bstree.html @@ -61,149 +61,149 @@ typedef node_algorithms::insert_commit_data insert_commit_data; // construct/copy/destruct - explicit bstree(const key_compare & = key_compare(), + explicit bstree(const key_compare & = key_compare(), const value_traits & = value_traits()); template<typename Iterator> - bstree(bool, Iterator, Iterator, const key_compare & = key_compare(), + bstree(bool, Iterator, Iterator, const key_compare & = key_compare(), const value_traits & = value_traits()); - bstree(bstree &&); - bstree & operator=(bstree &&); - ~bstree(); + bstree(bstree &&); + bstree & operator=(bstree &&); + ~bstree(); - // public member functions - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end(); - const_iterator end() const; - const_iterator cend() const; - reverse_iterator rbegin(); - const_reverse_iterator rbegin() const; - const_reverse_iterator crbegin() const; - reverse_iterator rend(); - const_reverse_iterator rend() const; - const_reverse_iterator crend() const; - key_compare key_comp() const; - value_compare value_comp() const; - bool empty() const; - size_type size() const; - void swap(bstree &); + // public member functions + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end(); + const_iterator end() const; + const_iterator cend() const; + reverse_iterator rbegin(); + const_reverse_iterator rbegin() const; + const_reverse_iterator crbegin() const; + reverse_iterator rend(); + const_reverse_iterator rend() const; + const_reverse_iterator crend() const; + key_compare key_comp() const; + value_compare value_comp() const; + bool empty() const; + size_type size() const; + void swap(bstree &); template<typename Cloner, typename Disposer> - void clone_from(const bstree &, Cloner, Disposer); + void clone_from(const bstree &, Cloner, Disposer); template<typename Cloner, typename Disposer> - void clone_from(bstree &&, Cloner, Disposer); - iterator insert_equal(reference); - iterator insert_equal(const_iterator, reference); - template<typename Iterator> void insert_equal(Iterator, Iterator); - std::pair< iterator, bool > insert_unique(reference); - iterator insert_unique(const_iterator, reference); - template<typename Iterator> void insert_unique(Iterator, Iterator); + void clone_from(bstree &&, Cloner, Disposer); + iterator insert_equal(reference); + iterator insert_equal(const_iterator, reference); + template<typename Iterator> void insert_equal(Iterator, Iterator); + std::pair< iterator, bool > insert_unique(reference); + iterator insert_unique(const_iterator, reference); + template<typename Iterator> void insert_unique(Iterator, Iterator); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, bool > - insert_unique_check(const KeyType &, KeyTypeKeyCompare, + insert_unique_check(const KeyType &, KeyTypeKeyCompare, insert_commit_data &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, bool > - insert_unique_check(const_iterator, const KeyType &, KeyTypeKeyCompare, + insert_unique_check(const_iterator, const KeyType &, KeyTypeKeyCompare, insert_commit_data &); - iterator insert_unique_commit(reference, const insert_commit_data &); - iterator insert_before(const_iterator, reference); - void push_back(reference); - void push_front(reference); - iterator erase(const_iterator); - iterator erase(const_iterator, const_iterator); - size_type erase(const key_type &); + iterator insert_unique_commit(reference, const insert_commit_data &); + iterator insert_before(const_iterator, reference); + void push_back(reference); + void push_front(reference); + iterator erase(const_iterator); + iterator erase(const_iterator, const_iterator); + size_type erase(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - size_type erase(const KeyType &, KeyTypeKeyCompare); + size_type erase(const KeyType &, KeyTypeKeyCompare); template<typename Disposer> - iterator erase_and_dispose(const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, Disposer); template<typename Disposer> - size_type erase_and_dispose(const key_type &, Disposer); + size_type erase_and_dispose(const key_type &, Disposer); template<typename Disposer> - iterator erase_and_dispose(const_iterator, const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, const_iterator, Disposer); template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> - size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); - void clear(); - template<typename Disposer> void clear_and_dispose(Disposer); - size_type count(const key_type &) const; + size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); + void clear(); + template<typename Disposer> void clear_and_dispose(Disposer); + size_type count(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - size_type count(const KeyType &, KeyTypeKeyCompare) const; - iterator lower_bound(const key_type &); - const_iterator lower_bound(const key_type &) const; + size_type count(const KeyType &, KeyTypeKeyCompare) const; + iterator lower_bound(const key_type &); + const_iterator lower_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - iterator lower_bound(const KeyType &, KeyTypeKeyCompare); + iterator lower_bound(const KeyType &, KeyTypeKeyCompare); template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator upper_bound(const key_type &); + const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator upper_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator upper_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator upper_bound(const key_type &) const; + iterator upper_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator upper_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator find(const key_type &); + const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator find(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator find(const KeyType &, KeyTypeKeyCompare); - const_iterator find(const key_type &) const; + iterator find(const KeyType &, KeyTypeKeyCompare); + const_iterator find(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator find(const KeyType &, KeyTypeKeyCompare) const; - std::pair< iterator, iterator > equal_range(const key_type &); + const_iterator find(const KeyType &, KeyTypeKeyCompare) const; + std::pair< iterator, iterator > equal_range(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - equal_range(const KeyType &, KeyTypeKeyCompare); + equal_range(const KeyType &, KeyTypeKeyCompare); std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; + equal_range(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - equal_range(const KeyType &, KeyTypeKeyCompare) const; + equal_range(const KeyType &, KeyTypeKeyCompare) const; std::pair< iterator, iterator > - bounded_range(const key_type &, const key_type &, bool, bool); + bounded_range(const key_type &, const key_type &, bool, bool); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool); std::pair< const_iterator, const_iterator > - bounded_range(const key_type &, const key_type &, bool, bool) const; + bounded_range(const key_type &, const key_type &, bool, bool) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool) const; - iterator iterator_to(reference); - const_iterator iterator_to(const_reference) const; - pointer unlink_leftmost_without_rebalance(); - void replace_node(iterator, reference); - void rebalance(); - iterator rebalance_subtree(iterator); - template<typename ExtraChecker> void check(ExtraChecker) const; - void check() const; + iterator iterator_to(reference); + const_iterator iterator_to(const_reference) const; + pointer unlink_leftmost_without_rebalance(); + void replace_node(iterator, reference); + void rebalance(); + iterator rebalance_subtree(iterator); + template<typename ExtraChecker> void check(ExtraChecker) const; + void check() const; - // public static functions - static bstree & container_from_end_iterator(iterator); - static const bstree & container_from_end_iterator(const_iterator); - static bstree & container_from_iterator(iterator); - static const bstree & container_from_iterator(const_iterator); - static iterator s_iterator_to(reference); - static const_iterator s_iterator_to(const_reference); - static void init_node(reference); - static void remove_node(reference); + // public static functions + static bstree & container_from_end_iterator(iterator); + static const bstree & container_from_end_iterator(const_iterator); + static bstree & container_from_iterator(iterator); + static const bstree & container_from_iterator(const_iterator); + static iterator s_iterator_to(reference); + static const_iterator s_iterator_to(const_reference); + static void init_node(reference); + static void remove_node(reference); // public data members static const bool constant_time_size; static const bool stateful_value_traits; };
    -

    Description

    +

    Description

    The class template bstree is an unbalanced intrusive binary search tree container. The no-throw guarantee holds only, if the key_compare object doesn't throw.

    The complexity guarantees only hold if the tree is balanced, logarithmic complexity would increase to linear if the tree is totally unbalanced.

    The template parameter T is the type to be managed by the container. The user can specify additional options and if no options are provided default options are used.

    The container supports the following options: base_hook<>/member_hook<>/value_traits<>, constant_time_size<>, size_type<> and compare<>.

    -

    +

    bstree public construct/copy/destruct

    1. -
      explicit bstree(const key_compare & cmp = key_compare(), 
+
      explicit bstree(const key_compare & cmp = key_compare(), 
                 const value_traits & v_traits = value_traits());
      
 
      Effects: Constructs an empty container.
      
 
      Complexity: Constant.
      
@@ -211,7 +211,7 @@
 
    2. template<typename Iterator> 
-  bstree(bool unique, Iterator b, Iterator e, 
+  bstree(bool unique, Iterator b, Iterator e, 
          const key_compare & cmp = key_compare(), 
          const value_traits & v_traits = value_traits());

      Requires: Dereferencing iterator must yield an lvalue of type value_type. cmp must be a comparison function that induces a strict weak ordering.

      @@ -220,15 +220,15 @@

      Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor/operator() of the key_compare object throws. Basic guarantee.

    3. -
      bstree(bstree && x);
      +
      bstree(bstree && x);

      Effects: to-do

    4. -
      bstree & operator=(bstree && x);
      +
      bstree & operator=(bstree && x);

      Effects: to-do

    5. -
      ~bstree();
      +
      ~bstree();

      Effects: Detaches all elements from this. The objects in the set are not deleted (i.e. no destructors are called), but the nodes according to the value_traits template parameter are reinitialized and thus can be reused.

      Complexity: Linear to elements contained in *this.

      Throws: Nothing.

      @@ -236,114 +236,114 @@
    -

    -bstree public member functions

    +

    +bstree public member functions

    1. -
      iterator begin();
      +
      iterator begin();

      Effects: Returns an iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    2. -
      const_iterator begin() const;
      +
      const_iterator begin() const;

      Effects: Returns a const_iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    3. -
      const_iterator cbegin() const;
      +
      const_iterator cbegin() const;

      Effects: Returns a const_iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    4. -
      iterator end();
      +
      iterator end();

      Effects: Returns an iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    5. -
      const_iterator end() const;
      +
      const_iterator end() const;

      Effects: Returns a const_iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    6. -
      const_iterator cend() const;
      +
      const_iterator cend() const;

      Effects: Returns a const_iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    7. -
      reverse_iterator rbegin();
      +
      reverse_iterator rbegin();

      Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    8. -
      const_reverse_iterator rbegin() const;
      +
      const_reverse_iterator rbegin() const;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    9. -
      const_reverse_iterator crbegin() const;
      +
      const_reverse_iterator crbegin() const;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    10. -
      reverse_iterator rend();
      +
      reverse_iterator rend();

      Effects: Returns a reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    11. -
      const_reverse_iterator rend() const;
      +
      const_reverse_iterator rend() const;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    12. -
      const_reverse_iterator crend() const;
      +
      const_reverse_iterator crend() const;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    13. -
      key_compare key_comp() const;
      +
      key_compare key_comp() const;

      Effects: Returns the key_compare object used by the container.

      Complexity: Constant.

      Throws: If key_compare copy-constructor throws.

    14. -
      value_compare value_comp() const;
      +
      value_compare value_comp() const;

      Effects: Returns the value_compare object used by the container.

      Complexity: Constant.

      Throws: If value_compare copy-constructor throws.

    15. -
      bool empty() const;
      +
      bool empty() const;

      Effects: Returns true if the container is empty.

      Complexity: Constant.

      Throws: Nothing.

    16. -
      size_type size() const;
      +
      size_type size() const;

      Effects: Returns the number of elements stored in the container.

      Complexity: Linear to elements contained in *this if constant-time size option is disabled. Constant time otherwise.

      Throws: Nothing.

    17. -
      void swap(bstree & other);
      +
      void swap(bstree & other);

      Effects: Swaps the contents of two containers.

      Complexity: Constant.

      Throws: If the comparison functor's swap call throws. 

    18. template<typename Cloner, typename Disposer> 
-  void clone_from(const bstree & src, Cloner cloner, Disposer disposer);
      + void clone_from(const bstree & src, Cloner cloner, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

      Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(const_reference ) and inserts them on *this. Copies the predicate from the source container.

      If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

      @@ -352,7 +352,7 @@ 
    19. template<typename Cloner, typename Disposer> 
-  void clone_from(bstree && src, Cloner cloner, Disposer disposer);
      + void clone_from(bstree && src, Cloner cloner, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

      Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(reference) and inserts them on *this. Copies the predicate from the source container.

      If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

      @@ -361,7 +361,7 @@

      Note: This version can modify the source container, useful to implement move semantics.

    20. -
      iterator insert_equal(reference value);
      +
      iterator insert_equal(reference value);

      Requires: value must be an lvalue

      Effects: Inserts value into the container before the upper bound.

      Complexity: Average complexity for insert element is at most logarithmic.

      @@ -369,7 +369,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    21. -
      iterator insert_equal(const_iterator hint, reference value);
      +
      iterator insert_equal(const_iterator hint, reference value);

      Requires: value must be an lvalue, and "hint" must be a valid iterator.

      Effects: Inserts x into the container, using "hint" as a hint to where it will be inserted. If "hint" is the upper_bound the insertion takes constant time (two comparisons in the worst case)

      Complexity: Logarithmic in general, but it is amortized constant time if t is inserted immediately before hint.

      @@ -377,7 +377,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    22. -
      template<typename Iterator> void insert_equal(Iterator b, Iterator e);
      +
      template<typename Iterator> void insert_equal(Iterator b, Iterator e);

      Requires: Dereferencing iterator must yield an lvalue of type value_type.

      Effects: Inserts a each element of a range into the container before the upper bound of the key of each element.

      Complexity: Insert range is in general O(N * log(N)), where N is the size of the range. However, it is linear in N if the range is already sorted by value_comp().

      @@ -385,7 +385,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    23. -
      std::pair< iterator, bool > insert_unique(reference value);
      +
      std::pair< iterator, bool > insert_unique(reference value);

      Requires: value must be an lvalue

      Effects: Inserts value into the container if the value is not already present.

      Complexity: Average complexity for insert element is at most logarithmic.

      @@ -393,7 +393,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    24. -
      iterator insert_unique(const_iterator hint, reference value);
      +
      iterator insert_unique(const_iterator hint, reference value);

      Requires: value must be an lvalue, and "hint" must be a valid iterator

      Effects: Tries to insert x into the container, using "hint" as a hint to where it will be inserted.

      Complexity: Logarithmic in general, but it is amortized constant time (two comparisons in the worst case) if t is inserted immediately before hint.

      @@ -401,7 +401,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    25. -
      template<typename Iterator> void insert_unique(Iterator b, Iterator e);
      +
      template<typename Iterator> void insert_unique(Iterator b, Iterator e);

      Requires: Dereferencing iterator must yield an lvalue of type value_type.

      Effects: Tries to insert each element of a range into the container.

      Complexity: Insert range is in general O(N * log(N)), where N is the size of the range. However, it is linear in N if the range is already sorted by value_comp().

      @@ -411,7 +411,7 @@ 
    26. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, bool > 
-  insert_unique_check(const KeyType & key, KeyTypeKeyCompare comp, 
+  insert_unique_check(const KeyType & key, KeyTypeKeyCompare comp, 
                       insert_commit_data & commit_data);

      Requires: comp must be a comparison function that induces the same strict weak ordering as key_compare. The difference is that comp compares an arbitrary key with the contained values.

      Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself.

      @@ -425,7 +425,7 @@ 
    27. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, bool > 
-  insert_unique_check(const_iterator hint, const KeyType & key, 
+  insert_unique_check(const_iterator hint, const KeyType & key, 
                       KeyTypeKeyCompare comp, 
                       insert_commit_data & commit_data);

      Requires: comp must be a comparison function that induces the same strict weak ordering as key_compare. The difference is that comp compares an arbitrary key with the contained values.

      @@ -438,7 +438,7 @@

      "commit_data" remains valid for a subsequent "insert_commit" only if no more objects are inserted or erased from the container.

    28. -
      iterator insert_unique_commit(reference value, 
+
      iterator insert_unique_commit(reference value, 
                               const insert_commit_data & commit_data);
      
 
      Requires: value must be an lvalue of type value_type. commit_data must have been obtained from a previous call to "insert_check". No objects should have been inserted or erased from the container between the "insert_check" that filled "commit_data" and the call to "insert_commit".
      
 
      Effects: Inserts the value in the container using the information obtained from the "commit_data" that a previous "insert_check" filled.
      
@@ -448,7 +448,7 @@
 
      Notes: This function has only sense if a "insert_check" has been previously executed to fill "commit_data". No value should be inserted or erased between the "insert_check" and "insert_commit" calls.
    29. -
      iterator insert_before(const_iterator pos, reference value);
      +
      iterator insert_before(const_iterator pos, reference value);

      Requires: value must be an lvalue, "pos" must be a valid iterator (or end) and must be the succesor of value once inserted according to the predicate

      Effects: Inserts x into the container before "pos".

      Complexity: Constant time.

      @@ -456,7 +456,7 @@

      Note: This function does not check preconditions so if "pos" is not the successor of "value" container ordering invariant will be broken. This is a low-level function to be used only for performance reasons by advanced users.

    30. -
      void push_back(reference value);
      +
      void push_back(reference value);

      Requires: value must be an lvalue, and it must be no less than the greatest inserted key

      Effects: Inserts x into the container in the last position.

      Complexity: Constant time.

      @@ -464,7 +464,7 @@

      Note: This function does not check preconditions so if value is less than the greatest inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

    31. -
      void push_front(reference value);
      +
      void push_front(reference value);

      Requires: value must be an lvalue, and it must be no greater than the minimum inserted key

      Effects: Inserts x into the container in the first position.

      Complexity: Constant time.

      @@ -472,21 +472,21 @@

      Note: This function does not check preconditions so if value is greater than the minimum inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

    32. -
      iterator erase(const_iterator i);
      +
      iterator erase(const_iterator i);

      Effects: Erases the element pointed to by i.

      Complexity: Average complexity for erase element is constant time.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    33. -
      iterator erase(const_iterator b, const_iterator e);
      +
      iterator erase(const_iterator b, const_iterator e);

      Effects: Erases the range pointed to by b end e.

      Complexity: Average complexity for erase range is at most O(log(size() + N)), where N is the number of elements in the range.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    34. -
      size_type erase(const key_type & key);
      +
      size_type erase(const key_type & key);

      Effects: Erases all the elements with the given value.

      Returns: The number of erased elements.

      Complexity: O(log(size() + N).

      @@ -495,7 +495,8 @@ 
    35. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type erase(const KeyType & key, KeyTypeKeyCompare comp);
      + size_type erase(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Erases all the elements with the given key. according to the comparison functor "comp".

      Returns: The number of erased elements.

      Complexity: O(log(size() + N).

      @@ -504,7 +505,7 @@ 
    36. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator i, Disposer disposer);
      + iterator erase_and_dispose(const_iterator i, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases the element pointed to by i. Disposer::operator()(pointer) is called for the removed element.

      Complexity: Average complexity for erase element is constant time.

      @@ -513,7 +514,7 @@ 
    37. template<typename Disposer> 
-  size_type erase_and_dispose(const key_type & key, Disposer disposer);
      + size_type erase_and_dispose(const key_type & key, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases all the elements with the given value. Disposer::operator()(pointer) is called for the removed elements.

      Returns: The number of erased elements.

      @@ -523,7 +524,7 @@ 
    38. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator b, const_iterator e, 
+  iterator erase_and_dispose(const_iterator b, const_iterator e, 
                              Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases the range pointed to by b end e. Disposer::operator()(pointer) is called for the removed elements.

      @@ -533,8 +534,9 @@ 
    39. template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> 
-  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
+  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
                               Disposer disposer);
      +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk) and nk the key_type of a value_type inserted into *this.

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases all the elements with the given key. according to the comparison functor "comp". Disposer::operator()(pointer) is called for the removed elements.

      Returns: The number of erased elements.

      @@ -543,73 +545,75 @@

      Note: Invalidates the iterators to the erased elements.

    40. -
      void clear();
      +
      void clear();

      Effects: Erases all of the elements.

      Complexity: Linear to the number of elements on the container. if it's a safe-mode or auto-unlink value_type. Constant time otherwise.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    41. -
      template<typename Disposer> void clear_and_dispose(Disposer disposer);
      +
      template<typename Disposer> void clear_and_dispose(Disposer disposer);

      Effects: Erases all of the elements calling disposer(p) for each node to be erased. Complexity: Average complexity for is at most O(log(size() + N)), where N is the number of elements in the container.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. Calls N times to disposer functor.

    42. -
      size_type count(const key_type & key) const;
      +
      size_type count(const key_type & key) const;

      Effects: Returns the number of contained elements with the given value

      Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given value.

      Throws: If key_compare throws. 

    43. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;
      + size_type count(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      Effects: Returns the number of contained elements with the given key

      Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given key.

      Throws: If comp throws.

    44. -
      iterator lower_bound(const key_type & key);
      +
      iterator lower_bound(const key_type & key);

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

    45. -
      const_iterator lower_bound(const key_type & key) const;
      +
      const_iterator lower_bound(const key_type & key) const;

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    46. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      -

      Throws: If comp throws.

      +

      Throws: If key_compare throws. 

    47. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
      -

      Effects: Returns a const iterator to the first element whose key is not less than k or end() if that element does not exist.

      + lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      -

      Throws: If comp throws.

      +

      Throws: If key_compare throws.

    48. -
      iterator upper_bound(const key_type & key);
      +
      iterator upper_bound(const key_type & key);

      Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    49. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    50. -
      const_iterator upper_bound(const key_type & key) const;
      +
      const_iterator upper_bound(const key_type & key) const;

      Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -617,39 +621,42 @@ 
    51. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
      + upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    52. -
      iterator find(const key_type & key);
      +
      iterator find(const key_type & key);

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    53. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator find(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator find(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    54. -
      const_iterator find(const key_type & key) const;
      -

      Effects: Finds a const_iterator to the first element whose key is k or end() if that element does not exist.

      +
      const_iterator find(const key_type & key) const;
      +

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    55. template<typename KeyType, typename KeyTypeKeyCompare> 
-  const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;
      -

      Effects: Finds a const_iterator to the first element whose key is k or end() if that element does not exist.

      + const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      +

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    56. -
      std::pair< iterator, iterator > equal_range(const key_type & key);
      +
      std::pair< iterator, iterator > equal_range(const key_type & key);

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -657,14 +664,15 @@ 
    57. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp);
      + equal_range(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If comp throws. 

    58. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & key) const;
      +equal_range(const key_type & key) const;

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -672,16 +680,18 @@ 
    59. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;
      + equal_range(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If comp throws. 

    60. std::pair< iterator, iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_value, 
+bounded_range(const key_type & lower_key, const key_type & upper_value, 
               bool left_closed, bool right_closed);
      -

      Requires: 'lower_key' must not be greater than 'upper_key'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key) if left_closed, upper_bound(lower_key) otherwise

      second = upper_bound(upper_key) if right_closed, lower_bound(upper_key) otherwise

      @@ -693,9 +703,12 @@ 
    61. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed);
      -

      Requires: KeyTypeKeyCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the container. 'lower_key' must not be greater than 'upper_key' according to 'comp'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

      +

      upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

      +

      upper_key shall not precede lower_key according to comp [comp(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!comp(upper_key, lower_key) && !comp(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key, comp) if left_closed, upper_bound(lower_key, comp) otherwise

      second = upper_bound(upper_key, comp) if right_closed, lower_bound(upper_key, comp) otherwise

      @@ -706,9 +719,10 @@ 
    62. std::pair< const_iterator, const_iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed) const;
      -

      Requires: 'lower_key' must not be greater than 'upper_key'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key) if left_closed, upper_bound(lower_key) otherwise

      second = upper_bound(upper_key) if right_closed, lower_bound(upper_key) otherwise

      @@ -720,9 +734,12 @@ 
    63. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed) const;
      -

      Requires: KeyTypeKeyCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the container. 'lower_key' must not be greater than 'upper_key' according to 'comp'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

      +

      upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

      +

      upper_key shall not precede lower_key according to comp [comp(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!comp(upper_key, lower_key) && !comp(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key, comp) if left_closed, upper_bound(lower_key, comp) otherwise

      second = upper_bound(upper_key, comp) if right_closed, lower_bound(upper_key, comp) otherwise

      @@ -732,28 +749,28 @@

      Note: Experimental function, the interface might change in future releases.

    64. -
      iterator iterator_to(reference value);
      +
      iterator iterator_to(reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      Throws: Nothing.

    65. -
      const_iterator iterator_to(const_reference value) const;
      +
      const_iterator iterator_to(const_reference value) const;

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid const_iterator i belonging to the set that points to the value

      Complexity: Constant.

      Throws: Nothing.

    66. -
      pointer unlink_leftmost_without_rebalance();
      +
      pointer unlink_leftmost_without_rebalance();

      Effects: Unlinks the leftmost node from the container.

      Complexity: Average complexity is constant time.

      Throws: Nothing.

      Notes: This function breaks the container and the container can only be used for more unlink_leftmost_without_rebalance calls. This function is normally used to achieve a step by step controlled destruction of the container.

    67. -
      void replace_node(iterator replace_this, reference with_this);
      +
      void replace_node(iterator replace_this, reference with_this);

      Requires: replace_this must be a valid iterator of *this and with_this must not be inserted in any container.

      Effects: Replaces replace_this in its position in the container with with_this. The container does not need to be rebalanced.

      Complexity: Constant.

      @@ -761,13 +778,13 @@

      Note: This function will break container ordering invariants if with_this is not equivalent to *replace_this according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing or comparison is needed.

    68. -
      void rebalance();
      +
      void rebalance();

      Effects: Rebalances the tree.

      Throws: Nothing.

      Complexity: Linear.

    69. -
      iterator rebalance_subtree(iterator root);
      +
      iterator rebalance_subtree(iterator root);

      Requires: old_root is a node of a tree.

      Effects: Rebalances the subtree rooted at old_root.

      Returns: The new root of the subtree.

      @@ -775,13 +792,13 @@

      Complexity: Linear to the elements in the subtree.

    70. -
      template<typename ExtraChecker> void check(ExtraChecker extra_checker) const;
      +
      template<typename ExtraChecker> void check(ExtraChecker extra_checker) const;

      Effects: Asserts the integrity of the container with additional checks provided by the user.

      Complexity: Linear time.

      Note: The method might not have effect when asserts are turned off (e.g., with NDEBUG). Experimental function, interface might change in future versions.

    71. -
      void check() const;
      +
      void check() const;

      Effects: Asserts the integrity of the container.

      Complexity: Linear time.

      Note: The method has no effect when asserts are turned off (e.g., with NDEBUG). Experimental function, interface might change in future versions.

      @@ -789,39 +806,39 @@
    -

    -bstree public static functions

    +

    +bstree public static functions

    1. -
      static bstree & container_from_end_iterator(iterator end_iterator);
      +
      static bstree & container_from_end_iterator(iterator end_iterator);

      Precondition: end_iterator must be a valid end iterator of the container.

      Effects: Returns a const reference to the container associated to the end iterator

      Throws: Nothing.

      Complexity: Constant.

    2. -
      static const bstree & container_from_end_iterator(const_iterator end_iterator);
      +
      static const bstree & container_from_end_iterator(const_iterator end_iterator);

      Precondition: end_iterator must be a valid end const_iterator of the container.

      Effects: Returns a const reference to the container associated to the iterator

      Throws: Nothing.

      Complexity: Constant.

    3. -
      static bstree & container_from_iterator(iterator it);
      +
      static bstree & container_from_iterator(iterator it);

      Precondition: it must be a valid iterator of the container.

      Effects: Returns a const reference to the container associated to the iterator

      Throws: Nothing.

      Complexity: Logarithmic.

    4. -
      static const bstree & container_from_iterator(const_iterator it);
      +
      static const bstree & container_from_iterator(const_iterator it);

      Precondition: it must be a valid end const_iterator of container.

      Effects: Returns a const reference to the container associated to the end iterator

      Throws: Nothing.

      Complexity: Logarithmic.

    5. -
      static iterator s_iterator_to(reference value);
      +
      static iterator s_iterator_to(reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      @@ -829,7 +846,7 @@

      Note: This static function is available only if the value traits is stateless.

    6. -
      static const_iterator s_iterator_to(const_reference value);
      +
      static const_iterator s_iterator_to(const_reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid const_iterator i belonging to the set that points to the value

      Complexity: Constant.

      @@ -837,7 +854,7 @@

      Note: This static function is available only if the value traits is stateless.

    7. -
      static void init_node(reference value);
      +
      static void init_node(reference value);

      Requires: value shall not be in a container.

      Effects: init_node puts the hook of a value in a well-known default state.

      Throws: Nothing.

      @@ -845,7 +862,7 @@

      Note: This function puts the hook in the well-known default state used by auto_unlink and safe hooks.

    8. -
      static void remove_node(reference value);
      +
      static void remove_node(reference value);

      Effects: removes "value" from the container.

      Throws: Nothing.

      Complexity: Logarithmic time.

      diff --git a/doc/html/boost/intrusive/bstree_algorithms.html b/doc/html/boost/intrusive/bstree_algorithms.html index a7633d638e..9ef4cfa255 100644 --- a/doc/html/boost/intrusive/bstree_algorithms.html +++ b/doc/html/boost/intrusive/bstree_algorithms.html @@ -43,151 +43,151 @@ typedef insert_commit_data_t< node_ptr > insert_commit_data; typedef data_for_rebalance_t< node_ptr > data_for_rebalance; - // public static functions - static node_ptr begin_node(const const_node_ptr &); - static node_ptr end_node(const const_node_ptr &); - static node_ptr root_node(const const_node_ptr &); - static bool unique(const const_node_ptr &); - static node_ptr get_header(const const_node_ptr &); - static void swap_nodes(const node_ptr &, const node_ptr &); - static void swap_nodes(const node_ptr &, const node_ptr &, const node_ptr &, + // public static functions + static node_ptr begin_node(const const_node_ptr &); + static node_ptr end_node(const const_node_ptr &); + static node_ptr root_node(const const_node_ptr &); + static bool unique(const const_node_ptr &); + static node_ptr get_header(const const_node_ptr &); + static void swap_nodes(const node_ptr &, const node_ptr &); + static void swap_nodes(const node_ptr &, const node_ptr &, const node_ptr &, const node_ptr &); - static void replace_node(const node_ptr &, const node_ptr &); - static void replace_node(const node_ptr &, const node_ptr &, + static void replace_node(const node_ptr &, const node_ptr &); + static void replace_node(const node_ptr &, const node_ptr &, const node_ptr &); - static node_ptr next_node(const node_ptr &); - static node_ptr prev_node(const node_ptr &); - static node_ptr minimum(node_ptr); - static node_ptr maximum(node_ptr); - static void init(const node_ptr &); - static bool inited(const const_node_ptr &); - static void init_header(const node_ptr &); + static node_ptr next_node(const node_ptr &); + static node_ptr prev_node(const node_ptr &); + static node_ptr minimum(node_ptr); + static node_ptr maximum(node_ptr); + static void init(const node_ptr &); + static bool inited(const const_node_ptr &); + static void init_header(const node_ptr &); template<typename Disposer> - static void clear_and_dispose(const node_ptr &, Disposer); - static node_ptr unlink_leftmost_without_rebalance(const node_ptr &); - static std::size_t size(const const_node_ptr &); - static void swap_tree(const node_ptr &, const node_ptr &); - static bool is_header(const const_node_ptr &); + static void clear_and_dispose(const node_ptr &, Disposer); + static node_ptr unlink_leftmost_without_rebalance(const node_ptr &); + static std::size_t size(const const_node_ptr &); + static void swap_tree(const node_ptr &, const node_ptr &); + static bool is_header(const const_node_ptr &); template<typename KeyType, typename KeyNodePtrCompare> static node_ptr - find(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + find(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, node_ptr > - bounded_range(const const_node_ptr &, const KeyType &, const KeyType &, + bounded_range(const const_node_ptr &, const KeyType &, const KeyType &, KeyNodePtrCompare, bool, bool); template<typename KeyType, typename KeyNodePtrCompare> static std::size_t - count(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + count(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, node_ptr > - equal_range(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + equal_range(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, node_ptr > - lower_bound_range(const const_node_ptr &, const KeyType &, + lower_bound_range(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static node_ptr - lower_bound(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + lower_bound(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static node_ptr - upper_bound(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); - static void insert_unique_commit(const node_ptr &, const node_ptr &, + upper_bound(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + static void insert_unique_commit(const node_ptr &, const node_ptr &, const insert_commit_data &); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, bool > - insert_unique_check(const const_node_ptr &, const KeyType &, + insert_unique_check(const const_node_ptr &, const KeyType &, KeyNodePtrCompare, insert_commit_data &); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, bool > - insert_unique_check(const const_node_ptr &, const node_ptr &, + insert_unique_check(const const_node_ptr &, const node_ptr &, const KeyType &, KeyNodePtrCompare, insert_commit_data &); template<typename NodePtrCompare> static node_ptr - insert_equal(const node_ptr &, const node_ptr &, const node_ptr &, + insert_equal(const node_ptr &, const node_ptr &, const node_ptr &, NodePtrCompare); template<typename NodePtrCompare> static node_ptr - insert_equal_upper_bound(const node_ptr &, const node_ptr &, + insert_equal_upper_bound(const node_ptr &, const node_ptr &, NodePtrCompare); template<typename NodePtrCompare> static node_ptr - insert_equal_lower_bound(const node_ptr &, const node_ptr &, + insert_equal_lower_bound(const node_ptr &, const node_ptr &, NodePtrCompare); static node_ptr - insert_before(const node_ptr &, const node_ptr &, const node_ptr &); - static void push_back(const node_ptr &, const node_ptr &); - static void push_front(const node_ptr &, const node_ptr &); - static std::size_t depth(const_node_ptr); + insert_before(const node_ptr &, const node_ptr &, const node_ptr &); + static void push_back(const node_ptr &, const node_ptr &); + static void push_front(const node_ptr &, const node_ptr &); + static std::size_t depth(const_node_ptr); template<typename Cloner, typename Disposer> - static void clone(const const_node_ptr &, const node_ptr &, Cloner, + static void clone(const const_node_ptr &, const node_ptr &, Cloner, Disposer); - static void erase(const node_ptr &, const node_ptr &); - static void unlink(const node_ptr &); - static void rebalance(const node_ptr &); - static node_ptr rebalance_subtree(const node_ptr &); + static void erase(const node_ptr &, const node_ptr &); + static void unlink(const node_ptr &); + static void rebalance(const node_ptr &); + static node_ptr rebalance_subtree(const node_ptr &); template<typename Checker> - static void check(const const_node_ptr &, Checker, + static void check(const const_node_ptr &, Checker, typename Checker::return_type &); - // protected static functions - static void erase(const node_ptr &, const node_ptr &, data_for_rebalance &); - static std::size_t subtree_size(const const_node_ptr &); - static bool is_left_child(const node_ptr &); - static bool is_right_child(const node_ptr &); - static void insert_before_check(const node_ptr &, const node_ptr &, + // protected static functions + static void erase(const node_ptr &, const node_ptr &, data_for_rebalance &); + static std::size_t subtree_size(const const_node_ptr &); + static bool is_left_child(const node_ptr &); + static bool is_right_child(const node_ptr &); + static void insert_before_check(const node_ptr &, const node_ptr &, insert_commit_data &); - static void push_back_check(const node_ptr &, insert_commit_data &); - static void push_front_check(const node_ptr &, insert_commit_data &); + static void push_back_check(const node_ptr &, insert_commit_data &); + static void push_front_check(const node_ptr &, insert_commit_data &); template<typename NodePtrCompare> - static void insert_equal_check(const node_ptr &, const node_ptr &, + static void insert_equal_check(const node_ptr &, const node_ptr &, const node_ptr &, NodePtrCompare, insert_commit_data &); template<typename NodePtrCompare> - static void insert_equal_upper_bound_check(const node_ptr &, + static void insert_equal_upper_bound_check(const node_ptr &, const node_ptr &, NodePtrCompare, insert_commit_data &, std::size_t * = 0); template<typename NodePtrCompare> - static void insert_equal_lower_bound_check(const node_ptr &, + static void insert_equal_lower_bound_check(const node_ptr &, const node_ptr &, NodePtrCompare, insert_commit_data &, std::size_t * = 0); - static void insert_commit(const node_ptr &, const node_ptr &, + static void insert_commit(const node_ptr &, const node_ptr &, const insert_commit_data &); - static void set_child(const node_ptr &, const node_ptr &, const node_ptr &, + static void set_child(const node_ptr &, const node_ptr &, const node_ptr &, const bool); - static void rotate_left_no_parent_fix(const node_ptr &, const node_ptr &); - static void rotate_left(const node_ptr &, const node_ptr &, + static void rotate_left_no_parent_fix(const node_ptr &, const node_ptr &); + static void rotate_left(const node_ptr &, const node_ptr &, const node_ptr &, const node_ptr &); - static void rotate_right_no_parent_fix(const node_ptr &, const node_ptr &); - static void rotate_right(const node_ptr &, const node_ptr &, + static void rotate_right_no_parent_fix(const node_ptr &, const node_ptr &); + static void rotate_right(const node_ptr &, const node_ptr &, const node_ptr &, const node_ptr &); - // private static functions - static void subtree_to_vine(node_ptr, std::size_t &); - static void compress_subtree(node_ptr, std::size_t); - static void vine_to_subtree(const node_ptr &, std::size_t); - static node_ptr get_root(const node_ptr &); + // private static functions + static void subtree_to_vine(node_ptr, std::size_t &); + static void compress_subtree(node_ptr, std::size_t); + static void vine_to_subtree(const node_ptr &, std::size_t); + static node_ptr get_root(const node_ptr &); template<typename Cloner, typename Disposer> static node_ptr - clone_subtree(const const_node_ptr &, const node_ptr &, Cloner, Disposer, + clone_subtree(const const_node_ptr &, const node_ptr &, Cloner, Disposer, node_ptr &, node_ptr &); - template<typename Disposer> static void dispose_subtree(node_ptr, Disposer); + template<typename Disposer> static void dispose_subtree(node_ptr, Disposer); template<typename KeyType, typename KeyNodePtrCompare> static node_ptr - lower_bound_loop(node_ptr, node_ptr, const KeyType &, KeyNodePtrCompare); + lower_bound_loop(node_ptr, node_ptr, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static node_ptr - upper_bound_loop(node_ptr, node_ptr, const KeyType &, KeyNodePtrCompare); + upper_bound_loop(node_ptr, node_ptr, const KeyType &, KeyNodePtrCompare); template<typename Checker> - static void check_subtree(const const_node_ptr &, Checker, + static void check_subtree(const const_node_ptr &, Checker, typename Checker::return_type &); };
    -

    Description

    +

    Description

    This is an implementation of a binary search tree. A node in the search tree has references to its children and its parent. This is to allow traversal of the whole tree from a given node making the implementation of iterator a pointer to a node. At the top of the tree a node is used specially. This node's parent pointer is pointing to the root of the tree. Its left pointer points to the leftmost node in the tree and the right pointer to the rightmost one. This node is used to represent the end-iterator. +---------+ header------------------------------>| | | | @@ -270,46 +270,46 @@ header------------------------------>| |

    static node_ptr get_right(const_node_ptr n);

    static void set_right(node_ptr n, node_ptr right);

    -

    -bstree_algorithms public static functions

    +

    +bstree_algorithms public static functions

    1. -
      static node_ptr begin_node(const const_node_ptr & header);
      +
      static node_ptr begin_node(const const_node_ptr & header);

      Requires: 'header' is the header node of a tree.

      Effects: Returns the first node of the tree, the header if the tree is empty.

      Complexity: Constant time.

      Throws: Nothing.

    2. -
      static node_ptr end_node(const const_node_ptr & header);
      +
      static node_ptr end_node(const const_node_ptr & header);

      Requires: 'header' is the header node of a tree.

      Effects: Returns the header of the tree.

      Complexity: Constant time.

      Throws: Nothing.

    3. -
      static node_ptr root_node(const const_node_ptr & header);
      +
      static node_ptr root_node(const const_node_ptr & header);

      Requires: 'header' is the header node of a tree.

      Effects: Returns the root of the tree if any, header otherwise

      Complexity: Constant time.

      Throws: Nothing.

    4. -
      static bool unique(const const_node_ptr & node);
      +
      static bool unique(const const_node_ptr & node);

      Requires: 'node' is a node of the tree or a node initialized by init(...) or init_node.

      Effects: Returns true if the node is initialized by init() or init_node().

      Complexity: Constant time.

      Throws: Nothing.

    5. -
      static node_ptr get_header(const const_node_ptr & node);
      +
      static node_ptr get_header(const const_node_ptr & node);

      Requires: 'node' is a node of the tree or a header node.

      Effects: Returns the header of the tree.

      Complexity: Logarithmic.

      Throws: Nothing.

    6. -
      static void swap_nodes(const node_ptr & node1, const node_ptr & node2);
      +
      static void swap_nodes(const node_ptr & node1, const node_ptr & node2);

      Requires: node1 and node2 can't be header nodes of two trees.

      Effects: Swaps two nodes. After the function node1 will be inserted in the position node2 before the function. node2 will be inserted in the position node1 had before the function.

      Complexity: Logarithmic.

      @@ -318,7 +318,7 @@ header------------------------------>| |

      Experimental function

    7. -
      static void swap_nodes(const node_ptr & node1, const node_ptr & header1, 
+
      static void swap_nodes(const node_ptr & node1, const node_ptr & header1, 
                        const node_ptr & node2, const node_ptr & header2);
      
 
      Requires: node1 and node2 can't be header nodes of two trees with header header1 and header2.
      
 
      Effects: Swaps two nodes. After the function node1 will be inserted in the position node2 before the function. node2 will be inserted in the position node1 had before the function.
      
@@ -328,7 +328,7 @@ header------------------------------>|         |
 
      Experimental function
    8. -
      static void replace_node(const node_ptr & node_to_be_replaced, 
+
      static void replace_node(const node_ptr & node_to_be_replaced, 
                          const node_ptr & new_node);
      
 
      Requires: node_to_be_replaced must be inserted in a tree and new_node must not be inserted in a tree.
      
 
      Effects: Replaces node_to_be_replaced in its position in the tree with new_node. The tree does not need to be rebalanced
      
@@ -337,7 +337,7 @@ header------------------------------>|         |
 
      Note: This function will break container ordering invariants if new_node is not equivalent to node_to_be_replaced according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing and comparison is needed. Experimental function
    9. -
      static void replace_node(const node_ptr & node_to_be_replaced, 
+
      static void replace_node(const node_ptr & node_to_be_replaced, 
                          const node_ptr & header, const node_ptr & new_node);
      
 
      Requires: node_to_be_replaced must be inserted in a tree with header "header" and new_node must not be inserted in a tree.
      
 
      Effects: Replaces node_to_be_replaced in its position in the tree with new_node. The tree does not need to be rebalanced
      
@@ -346,35 +346,35 @@ header------------------------------>|         |
 
      Note: This function will break container ordering invariants if new_node is not equivalent to node_to_be_replaced according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing or comparison is needed. Experimental function
    10. -
      static node_ptr next_node(const node_ptr & node);
      +
      static node_ptr next_node(const node_ptr & node);

      Requires: 'node' is a node from the tree except the header.

      Effects: Returns the next node of the tree.

      Complexity: Average constant time.

      Throws: Nothing.

    11. -
      static node_ptr prev_node(const node_ptr & node);
      +
      static node_ptr prev_node(const node_ptr & node);

      Requires: 'node' is a node from the tree except the leftmost node.

      Effects: Returns the previous node of the tree.

      Complexity: Average constant time.

      Throws: Nothing.

    12. -
      static node_ptr minimum(node_ptr node);
      +
      static node_ptr minimum(node_ptr node);

      Requires: 'node' is a node of a tree but not the header.

      Effects: Returns the minimum node of the subtree starting at p.

      Complexity: Logarithmic to the size of the subtree.

      Throws: Nothing.

    13. -
      static node_ptr maximum(node_ptr node);
      +
      static node_ptr maximum(node_ptr node);

      Requires: 'node' is a node of a tree but not the header.

      Effects: Returns the maximum node of the subtree starting at p.

      Complexity: Logarithmic to the size of the subtree.

      Throws: Nothing.

    14. -
      static void init(const node_ptr & node);
      +
      static void init(const node_ptr & node);

      Requires: 'node' must not be part of any tree.

      Effects: After the function unique(node) == true.

      Complexity: Constant.

      @@ -382,13 +382,13 @@ header------------------------------>| |

      Nodes: If node is inserted in a tree, this function corrupts the tree.

    15. -
      static bool inited(const const_node_ptr & node);
      +
      static bool inited(const const_node_ptr & node);

      Effects: Returns true if node is in the same state as if called init(node)

      Complexity: Constant.

      Throws: Nothing.

    16. -
      static void init_header(const node_ptr & header);
      +
      static void init_header(const node_ptr & header);

      Requires: node must not be part of any tree.

      Effects: Initializes the header to represent an empty tree. unique(header) == true.

      Complexity: Constant.

      @@ -397,14 +397,14 @@ header------------------------------>| | 
    17. template<typename Disposer> 
-  static void clear_and_dispose(const node_ptr & header, Disposer disposer);
      + static void clear_and_dispose(const node_ptr & header, Disposer disposer);

      Requires: "disposer" must be an object function taking a node_ptr parameter and shouldn't throw.

      Effects: Empties the target tree calling void disposer::operator()(const node_ptr &) for every node of the tree except the header.

      Complexity: Linear to the number of element of the source tree plus the. number of elements of tree target tree when calling this function.

      Throws: If cloner functor throws. If this happens target nodes are disposed.

    18. -
      static node_ptr unlink_leftmost_without_rebalance(const node_ptr & header);
      +
      static node_ptr unlink_leftmost_without_rebalance(const node_ptr & header);

      Requires: header is the header of a tree.

      Effects: Unlinks the leftmost node from the tree, and updates the header link to the new leftmost node.

      Complexity: Average complexity is constant time.

      @@ -412,21 +412,21 @@ header------------------------------>| |

      Notes: This function breaks the tree and the tree can only be used for more unlink_leftmost_without_rebalance calls. This function is normally used to achieve a step by step controlled destruction of the tree.

    19. -
      static std::size_t size(const const_node_ptr & header);
      +
      static std::size_t size(const const_node_ptr & header);

      Requires: node is a node of the tree but it's not the header.

      Effects: Returns the number of nodes of the subtree.

      Complexity: Linear time.

      Throws: Nothing.

    20. -
      static void swap_tree(const node_ptr & header1, const node_ptr & header2);
      +
      static void swap_tree(const node_ptr & header1, const node_ptr & header2);

      Requires: header1 and header2 must be the header nodes of two trees.

      Effects: Swaps two trees. After the function header1 will contain links to the second tree and header2 will have links to the first tree.

      Complexity: Constant.

      Throws: Nothing.

    21. -
      static bool is_header(const const_node_ptr & p);
      +
      static bool is_header(const const_node_ptr & p);

      Requires: p is a node of a tree.

      Effects: Returns true if p is the header of the tree.

      Complexity: Constant.

      @@ -435,7 +435,7 @@ header------------------------------>| | 
    22. template<typename KeyType, typename KeyNodePtrCompare> 
   static node_ptr 
-  find(const const_node_ptr & header, const KeyType & key, 
+  find(const const_node_ptr & header, const KeyType & key, 
        KeyNodePtrCompare comp);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

      Effects: Returns a node_ptr to the first element that is equivalent to "key" according to "comp" or "header" if that element does not exist.

      @@ -445,7 +445,7 @@ header------------------------------>| | 
    23. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, node_ptr > 
-  bounded_range(const const_node_ptr & header, const KeyType & lower_key, 
+  bounded_range(const const_node_ptr & header, const KeyType & lower_key, 
                 const KeyType & upper_key, KeyNodePtrCompare comp, 
                 bool left_closed, bool right_closed);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs. 'lower_key' must not be greater than 'upper_key' according to 'comp'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be true.

      @@ -460,7 +460,7 @@ header------------------------------>| | 
    24. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::size_t 
-  count(const const_node_ptr & header, const KeyType & key, 
+  count(const const_node_ptr & header, const KeyType & key, 
         KeyNodePtrCompare comp);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

      Effects: Returns the number of elements with a key equivalent to "key" according to "comp".

      @@ -470,7 +470,7 @@ header------------------------------>| | 
    25. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, node_ptr > 
-  equal_range(const const_node_ptr & header, const KeyType & key, 
+  equal_range(const const_node_ptr & header, const KeyType & key, 
               KeyNodePtrCompare comp);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

      Effects: Returns an a pair of node_ptr delimiting a range containing all elements that are equivalent to "key" according to "comp" or an empty range that indicates the position where those elements would be if there are no equivalent elements.

      @@ -480,7 +480,7 @@ header------------------------------>| | 
    26. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, node_ptr > 
-  lower_bound_range(const const_node_ptr & header, const KeyType & key, 
+  lower_bound_range(const const_node_ptr & header, const KeyType & key, 
                     KeyNodePtrCompare comp);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

      Effects: Returns an a pair of node_ptr delimiting a range containing the first element that is equivalent to "key" according to "comp" or an empty range that indicates the position where that element would be if there are no equivalent elements.

      @@ -490,7 +490,7 @@ header------------------------------>| | 
    27. template<typename KeyType, typename KeyNodePtrCompare> 
   static node_ptr 
-  lower_bound(const const_node_ptr & header, const KeyType & key, 
+  lower_bound(const const_node_ptr & header, const KeyType & key, 
               KeyNodePtrCompare comp);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

      Effects: Returns a node_ptr to the first element that is not less than "key" according to "comp" or "header" if that element does not exist.

      @@ -500,7 +500,7 @@ header------------------------------>| | 
    28. template<typename KeyType, typename KeyNodePtrCompare> 
   static node_ptr 
-  upper_bound(const const_node_ptr & header, const KeyType & key, 
+  upper_bound(const const_node_ptr & header, const KeyType & key, 
               KeyNodePtrCompare comp);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

      Effects: Returns a node_ptr to the first element that is greater than "key" according to "comp" or "header" if that element does not exist.

      @@ -508,7 +508,7 @@ header------------------------------>| |

      Throws: If "comp" throws.

    29. -
      static void insert_unique_commit(const node_ptr & header, 
+
      static void insert_unique_commit(const node_ptr & header, 
                                  const node_ptr & new_value, 
                                  const insert_commit_data & commit_data);
      
 
      Requires: "header" must be the header node of a tree. "commit_data" must have been obtained from a previous call to "insert_unique_check". No objects should have been inserted or erased from the set between the "insert_unique_check" that filled "commit_data" and the call to "insert_commit".
      
@@ -520,7 +520,7 @@ header------------------------------>|         |
 
    30. 
 
      template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, bool > 
-  insert_unique_check(const const_node_ptr & header, const KeyType & key, 
+  insert_unique_check(const const_node_ptr & header, const KeyType & key, 
                       KeyNodePtrCompare comp, 
                       insert_commit_data & commit_data);
      
 
      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares KeyType with a node_ptr.
      
@@ -535,7 +535,7 @@ header------------------------------>|         |
 
    31. 
 
      template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, bool > 
-  insert_unique_check(const const_node_ptr & header, const node_ptr & hint, 
+  insert_unique_check(const const_node_ptr & header, const node_ptr & hint, 
                       const KeyType & key, KeyNodePtrCompare comp, 
                       insert_commit_data & commit_data);
      
 
      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares KeyType with a node_ptr. "hint" is node from the "header"'s tree.
      
@@ -550,7 +550,7 @@ header------------------------------>|         |
 
    32. 
 
      template<typename NodePtrCompare> 
   static node_ptr 
-  insert_equal(const node_ptr & h, const node_ptr & hint, 
+  insert_equal(const node_ptr & h, const node_ptr & hint, 
                const node_ptr & new_node, NodePtrCompare comp);
      
 
      Requires: "header" must be the header node of a tree. NodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares two node_ptrs. "hint" is node from the "header"'s tree.
      
 
      Effects: Inserts new_node into the tree, using "hint" as a hint to where it will be inserted. If "hint" is the upper_bound the insertion takes constant time (two comparisons in the worst case).
      
@@ -560,7 +560,7 @@ header------------------------------>|         |
 
    33. 
 
      template<typename NodePtrCompare> 
   static node_ptr 
-  insert_equal_upper_bound(const node_ptr & h, const node_ptr & new_node, 
+  insert_equal_upper_bound(const node_ptr & h, const node_ptr & new_node, 
                            NodePtrCompare comp);
      
 
      Requires: "h" must be the header node of a tree. NodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares two node_ptrs.
      
 
      Effects: Inserts new_node into the tree before the upper bound according to "comp".
      
@@ -570,7 +570,7 @@ header------------------------------>|         |
 
    34. 
 
      template<typename NodePtrCompare> 
   static node_ptr 
-  insert_equal_lower_bound(const node_ptr & h, const node_ptr & new_node, 
+  insert_equal_lower_bound(const node_ptr & h, const node_ptr & new_node, 
                            NodePtrCompare comp);
      
 
      Requires: "h" must be the header node of a tree. NodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares two node_ptrs.
      
 
      Effects: Inserts new_node into the tree before the lower bound according to "comp".
      
@@ -579,7 +579,7 @@ header------------------------------>|         |
 
      35. 
 
    35. 
 
      static node_ptr 
-insert_before(const node_ptr & header, const node_ptr & pos, 
+insert_before(const node_ptr & header, const node_ptr & pos, 
               const node_ptr & new_node);
      
 
      Requires: "header" must be the header node of a tree. "pos" must be a valid iterator or header (end) node. "pos" must be an iterator pointing to the successor to "new_node" once inserted according to the order of already inserted nodes. This function does not check "pos" and this precondition must be guaranteed by the caller.
      
 
      Effects: Inserts new_node into the tree before "pos".
      
@@ -588,7 +588,7 @@ header------------------------------>|         |
 
      Note: If "pos" is not the successor of the newly inserted "new_node" tree invariants might be broken. 
      
 
      36. 
 
    36. 
-
      static void push_back(const node_ptr & header, const node_ptr & new_node);
      
+
      static void push_back(const node_ptr & header, const node_ptr & new_node);
      
 
      Requires: "header" must be the header node of a tree. "new_node" must be, according to the used ordering no less than the greatest inserted key.
      
 
      Effects: Inserts new_node into the tree before "pos".
      
 
      Complexity: Constant-time.
      
@@ -596,7 +596,7 @@ header------------------------------>|         |
 
      Note: If "new_node" is less than the greatest inserted key tree invariants are broken. This function is slightly faster than using "insert_before". 
      
 
      37. 
 
    37. 
-
      static void push_front(const node_ptr & header, const node_ptr & new_node);
      
+
      static void push_front(const node_ptr & header, const node_ptr & new_node);
      
 
      Requires: "header" must be the header node of a tree. "new_node" must be, according to the used ordering, no greater than the lowest inserted key.
      
 
      Effects: Inserts new_node into the tree before "pos".
      
 
      Complexity: Constant-time.
      
@@ -604,7 +604,7 @@ header------------------------------>|         |
 
      Note: If "new_node" is greater than the lowest inserted key tree invariants are broken. This function is slightly faster than using "insert_before". 
      
 
      38. 
 
    38. 
-
      static std::size_t depth(const_node_ptr node);
      
+
      static std::size_t depth(const_node_ptr node);
      
 
      Requires: 'node' can't be a header node.
      
 
      Effects: Calculates the depth of a node: the depth of a node is the length (number of edges) of the path from the root to that node. (The root node is at depth 0.)
      
 
      Complexity: Logarithmic to the number of nodes in the tree.
      
@@ -612,7 +612,7 @@ header------------------------------>|         |
 
      39. 
 
    39. 
 
      template<typename Cloner, typename Disposer> 
-  static void clone(const const_node_ptr & source_header, 
+  static void clone(const const_node_ptr & source_header, 
                     const node_ptr & target_header, Cloner cloner, 
                     Disposer disposer);
      
 
      Requires: "cloner" must be a function object taking a node_ptr and returning a new cloned node of it. "disposer" must take a node_ptr and shouldn't throw.
      
@@ -622,28 +622,28 @@ header------------------------------>|         |
 
      Throws: If cloner functor throws. If this happens target nodes are disposed. 
      
 
      40. 
 
    40. 
-
      static void erase(const node_ptr & header, const node_ptr & z);
      
+
      static void erase(const node_ptr & header, const node_ptr & z);
      
 
      Requires: header must be the header of a tree, z a node of that tree and z != header.
      
 
      Effects: Erases node "z" from the tree with header "header".
      
 
      Complexity: Amortized constant time.
      
 
      Throws: Nothing. 
      
 
      41. 
 
    41. 
-
      static void unlink(const node_ptr & node);
      
+
      static void unlink(const node_ptr & node);
      
 
      Requires: node is a tree node but not the header.
      
 
      Effects: Unlinks the node and rebalances the tree.
      
 
      Complexity: Average complexity is constant time.
      
 
      Throws: Nothing. 
      
 
      42. 
 
    42. 
-
      static void rebalance(const node_ptr & header);
      
+
      static void rebalance(const node_ptr & header);
      
 
      Requires: header must be the header of a tree.
      
 
      Effects: Rebalances the tree.
      
 
      Throws: Nothing.
      
 
      Complexity: Linear. 
      
 
      43. 
 
    43. 
-
      static node_ptr rebalance_subtree(const node_ptr & old_root);
      
+
      static node_ptr rebalance_subtree(const node_ptr & old_root);
      
 
      Requires: old_root is a node of a tree. It shall not be null.
      
 
      Effects: Rebalances the subtree rooted at old_root.
      
 
      Returns: The new root of the subtree.
      
@@ -652,7 +652,7 @@ header------------------------------>|         |
 
      44. 
 
    44. 
 
      template<typename Checker> 
-  static void check(const const_node_ptr & header, Checker checker, 
+  static void check(const const_node_ptr & header, Checker checker, 
                     typename Checker::return_type & checker_return);
      
 
      Effects: Asserts the integrity of the container with additional checks provided by the user.
      
 
      Requires: header must be the header of a tree.
      
@@ -662,79 +662,79 @@ header------------------------------>|         |
    -

    -bstree_algorithms protected static functions

    +

    +bstree_algorithms protected static functions

      -
    1. static void erase(const node_ptr & header, const node_ptr & z, 
+
    2. static void erase(const node_ptr & header, const node_ptr & z, 
                   data_for_rebalance & info);
      3. 
 
    3. 
-
      static std::size_t subtree_size(const const_node_ptr & subtree);
      
+
      static std::size_t subtree_size(const const_node_ptr & subtree);
      
 
      Requires: node is a node of the tree but it's not the header.
      
 
      Effects: Returns the number of nodes of the subtree.
      
 
      Complexity: Linear time.
      
 
      Throws: Nothing. 
      
 
      4. 
 
    4. 
-
      static bool is_left_child(const node_ptr & p);
      
+
      static bool is_left_child(const node_ptr & p);
      
 
      Requires: p is a node of a tree.
      
 
      Effects: Returns true if p is a left child.
      
 
      Complexity: Constant.
      
 
      Throws: Nothing. 
      
 
      5. 
 
    5. 
-
      static bool is_right_child(const node_ptr & p);
      
+
      static bool is_right_child(const node_ptr & p);
      
 
      Requires: p is a node of a tree.
      
 
      Effects: Returns true if p is a right child.
      
 
      Complexity: Constant.
      
 
      Throws: Nothing. 
      
 
      6. 
-
    6. static void insert_before_check(const node_ptr & header, const node_ptr & pos, 
+
    7. static void insert_before_check(const node_ptr & header, const node_ptr & pos, 
                                 insert_commit_data & commit_data);
      8. 
-
    8. static void push_back_check(const node_ptr & header, 
+
    9. static void push_back_check(const node_ptr & header, 
                             insert_commit_data & commit_data);
      10. 
-
    10. static void push_front_check(const node_ptr & header, 
+
    11. static void push_front_check(const node_ptr & header, 
                              insert_commit_data & commit_data);
      12. 
 
    12. template<typename NodePtrCompare> 
-  static void insert_equal_check(const node_ptr & header, 
+  static void insert_equal_check(const node_ptr & header, 
                                  const node_ptr & hint, 
                                  const node_ptr & new_node, 
                                  NodePtrCompare comp, 
                                  insert_commit_data & commit_data);
      13. 
 
    13. template<typename NodePtrCompare> 
-  static void insert_equal_upper_bound_check(const node_ptr & h, 
+  static void insert_equal_upper_bound_check(const node_ptr & h, 
                                              const node_ptr & new_node, 
                                              NodePtrCompare comp, 
                                              insert_commit_data & commit_data, 
                                              std::size_t * pdepth = 0);
      14. 
 
    14. template<typename NodePtrCompare> 
-  static void insert_equal_lower_bound_check(const node_ptr & h, 
+  static void insert_equal_lower_bound_check(const node_ptr & h, 
                                              const node_ptr & new_node, 
                                              NodePtrCompare comp, 
                                              insert_commit_data & commit_data, 
                                              std::size_t * pdepth = 0);
      15. 
-
    15. static void insert_commit(const node_ptr & header, const node_ptr & new_node, 
+
    16. static void insert_commit(const node_ptr & header, const node_ptr & new_node, 
                           const insert_commit_data & commit_data);
      17. 
-
    17. static void set_child(const node_ptr & header, const node_ptr & new_child, 
+
    18. static void set_child(const node_ptr & header, const node_ptr & new_child, 
                       const node_ptr & new_parent, const bool link_left);
      19. 
-
    19. static void rotate_left_no_parent_fix(const node_ptr & p, 
+
    20. static void rotate_left_no_parent_fix(const node_ptr & p, 
                                       const node_ptr & p_right);
      21. 
-
    21. static void rotate_left(const node_ptr & p, const node_ptr & p_right, 
+
    22. static void rotate_left(const node_ptr & p, const node_ptr & p_right, 
                         const node_ptr & p_parent, const node_ptr & header);
      23. 
-
    23. static void rotate_right_no_parent_fix(const node_ptr & p, 
+
    24. static void rotate_right_no_parent_fix(const node_ptr & p, 
                                        const node_ptr & p_left);
      25. 
-
    25. static void rotate_right(const node_ptr & p, const node_ptr & p_left, 
+
    26. static void rotate_right(const node_ptr & p, const node_ptr & p_left, 
                          const node_ptr & p_parent, const node_ptr & header);
      27.
    -

    -bstree_algorithms private static functions

    +

    +bstree_algorithms private static functions

      -
    1. static void subtree_to_vine(node_ptr vine_tail, std::size_t & size);
      2. -
    2. static void compress_subtree(node_ptr scanner, std::size_t count);
      3. -
    3. static void vine_to_subtree(const node_ptr & super_root, std::size_t count);
      4. +
    4. static void subtree_to_vine(node_ptr vine_tail, std::size_t & size);
      5. +
    5. static void compress_subtree(node_ptr scanner, std::size_t count);
      6. +
    6. static void vine_to_subtree(const node_ptr & super_root, std::size_t count);
    7. -
      static node_ptr get_root(const node_ptr & node);
      +
      static node_ptr get_root(const node_ptr & node);

      Requires: "n" must be a node inserted in a tree.

      Effects: Returns a pointer to the header node of the tree.

      Complexity: Logarithmic.

      @@ -742,22 +742,22 @@ header------------------------------>| | 
    8. template<typename Cloner, typename Disposer> 
   static node_ptr 
-  clone_subtree(const const_node_ptr & source_parent, 
+  clone_subtree(const const_node_ptr & source_parent, 
                 const node_ptr & target_parent, Cloner cloner, 
                 Disposer disposer, node_ptr & leftmost_out, 
                 node_ptr & rightmost_out);
    9. template<typename Disposer> 
-  static void dispose_subtree(node_ptr x, Disposer disposer);
      10. + static void dispose_subtree(node_ptr x, Disposer disposer); 
    10. template<typename KeyType, typename KeyNodePtrCompare> 
   static node_ptr 
-  lower_bound_loop(node_ptr x, node_ptr y, const KeyType & key, 
+  lower_bound_loop(node_ptr x, node_ptr y, const KeyType & key, 
                    KeyNodePtrCompare comp);
    11. template<typename KeyType, typename KeyNodePtrCompare> 
   static node_ptr 
-  upper_bound_loop(node_ptr x, node_ptr y, const KeyType & key, 
+  upper_bound_loop(node_ptr x, node_ptr y, const KeyType & key, 
                    KeyNodePtrCompare comp);
    12. template<typename Checker> 
-  static void check_subtree(const const_node_ptr & node, Checker checker, 
+  static void check_subtree(const const_node_ptr & node, Checker checker, 
                             typename Checker::return_type & check_return);
    diff --git a/doc/html/boost/intrusive/bucket_traits.html b/doc/html/boost/intrusive/bucket_traits.html index 10a87f1e49..f26f6a0611 100644 --- a/doc/html/boost/intrusive/bucket_traits.html +++ b/doc/html/boost/intrusive/bucket_traits.html @@ -36,7 +36,7 @@ struct bucket_traits { };
    -

    Description

    +

    Description

    This option setter specifies the bucket traits class for unordered associative containers. When this option is specified, instead of using the default bucket traits, a user defined holder will be defined

    diff --git a/doc/html/boost/intrusive/cache_begin.html b/doc/html/boost/intrusive/cache_begin.html index cf6d630e43..f3f2d1db7a 100644 --- a/doc/html/boost/intrusive/cache_begin.html +++ b/doc/html/boost/intrusive/cache_begin.html @@ -36,7 +36,7 @@ struct cache_begin { };
    -

    Description

    +

    Description

    This option setter specifies if the container will cache a pointer to the first non-empty bucket so that begin() is always constant-time. This is specially helpful when we can have containers with a few elements but with big bucket arrays (that is, hashtables with low load factors).

    diff --git a/doc/html/boost/intrusive/cache_last.html b/doc/html/boost/intrusive/cache_last.html index 69ddc1bb7f..7ee1268515 100644 --- a/doc/html/boost/intrusive/cache_last.html +++ b/doc/html/boost/intrusive/cache_last.html @@ -36,7 +36,7 @@ struct cache_last { };
    -

    Description

    +

    Description

    If true, slist also stores a pointer to the last element of the singly linked list. This allows O(1) swap and splice_after(iterator, slist &) for circular slists and makes possible new functions like push_back(reference) and back().

    diff --git a/doc/html/boost/intrusive/circular_list_algorithms.html b/doc/html/boost/intrusive/circular_list_algorithms.html index 14d421f588..4b73ceb71c 100644 --- a/doc/html/boost/intrusive/circular_list_algorithms.html +++ b/doc/html/boost/intrusive/circular_list_algorithms.html @@ -51,33 +51,33 @@ node_ptr beg_2st_partition; }; - // public static functions - static void init(const node_ptr &); - static bool inited(const const_node_ptr &); - static void init_header(const node_ptr &); - static bool unique(const const_node_ptr &); - static std::size_t count(const const_node_ptr &); - static node_ptr unlink(const node_ptr &); - static void unlink(const node_ptr &, const node_ptr &); - static void link_before(const node_ptr &, const node_ptr &); - static void link_after(const node_ptr &, const node_ptr &); - static void swap_nodes(const node_ptr &, const node_ptr &); - static void transfer(const node_ptr &, const node_ptr &, const node_ptr &); - static void transfer(const node_ptr &, const node_ptr &); - static void reverse(const node_ptr &); - static void move_backwards(const node_ptr &, std::size_t); - static void move_forward(const node_ptr &, std::size_t); - static std::size_t distance(const const_node_ptr &, const const_node_ptr &); + // public static functions + static void init(const node_ptr &); + static bool inited(const const_node_ptr &); + static void init_header(const node_ptr &); + static bool unique(const const_node_ptr &); + static std::size_t count(const const_node_ptr &); + static node_ptr unlink(const node_ptr &); + static void unlink(const node_ptr &, const node_ptr &); + static void link_before(const node_ptr &, const node_ptr &); + static void link_after(const node_ptr &, const node_ptr &); + static void swap_nodes(const node_ptr &, const node_ptr &); + static void transfer(const node_ptr &, const node_ptr &, const node_ptr &); + static void transfer(const node_ptr &, const node_ptr &); + static void reverse(const node_ptr &); + static void move_backwards(const node_ptr &, std::size_t); + static void move_forward(const node_ptr &, std::size_t); + static std::size_t distance(const const_node_ptr &, const const_node_ptr &); template<typename Pred> - static void stable_partition(node_ptr, const node_ptr &, Pred, + static void stable_partition(node_ptr, const node_ptr &, Pred, stable_partition_info &); - // private static functions - static void swap_prev(const node_ptr &, const node_ptr &); - static void swap_next(const node_ptr &, const node_ptr &); + // private static functions + static void swap_prev(const node_ptr &, const node_ptr &); + static void swap_next(const node_ptr &, const node_ptr &); };
    -

    Description

    +

    Description

    circular_list_algorithms provides basic algorithms to manipulate nodes forming a circular doubly linked list. An empty circular list is formed by a node whose pointers point to itself.

    circular_list_algorithms is configured with a NodeTraits class, which encapsulates the information about the node to be manipulated. NodeTraits must support the following interface:

    Typedefs:

    @@ -90,71 +90,71 @@

    static node_ptr get_next(const_node_ptr n);

    static void set_next(node_ptr n, node_ptr next);

    -

    -circular_list_algorithms public static functions

    +

    +circular_list_algorithms public static functions

    1. -
      static void init(const node_ptr & this_node);
      +
      static void init(const node_ptr & this_node);

      Effects: Constructs an non-used list element, so that inited(this_node) == true

      Complexity: Constant

      Throws: Nothing.

    2. -
      static bool inited(const const_node_ptr & this_node);
      +
      static bool inited(const const_node_ptr & this_node);

      Effects: Returns true is "this_node" is in a non-used state as if it was initialized by the "init" function.

      Complexity: Constant

      Throws: Nothing.

    3. -
      static void init_header(const node_ptr & this_node);
      +
      static void init_header(const node_ptr & this_node);

      Effects: Constructs an empty list, making this_node the only node of the circular list: NodeTraits::get_next(this_node) == NodeTraits::get_previous(this_node) == this_node.

      Complexity: Constant

      Throws: Nothing.

    4. -
      static bool unique(const const_node_ptr & this_node);
      +
      static bool unique(const const_node_ptr & this_node);

      Requires: this_node must be in a circular list or be an empty circular list.

      Effects: Returns true is "this_node" is the only node of a circular list: return NodeTraits::get_next(this_node) == this_node

      Complexity: Constant

      Throws: Nothing.

    5. -
      static std::size_t count(const const_node_ptr & this_node);
      +
      static std::size_t count(const const_node_ptr & this_node);

      Requires: this_node must be in a circular list or be an empty circular list.

      Effects: Returns the number of nodes in a circular list. If the circular list is empty, returns 1.

      Complexity: Linear

      Throws: Nothing.

    6. -
      static node_ptr unlink(const node_ptr & this_node);
      +
      static node_ptr unlink(const node_ptr & this_node);

      Requires: this_node must be in a circular list or be an empty circular list.

      Effects: Unlinks the node from the circular list.

      Complexity: Constant

      Throws: Nothing.

    7. -
      static void unlink(const node_ptr & b, const node_ptr & e);
      +
      static void unlink(const node_ptr & b, const node_ptr & e);

      Requires: b and e must be nodes of the same circular list or an empty range.

      Effects: Unlinks the node [b, e) from the circular list.

      Complexity: Constant

      Throws: Nothing.

    8. -
      static void link_before(const node_ptr & nxt_node, const node_ptr & this_node);
      +
      static void link_before(const node_ptr & nxt_node, const node_ptr & this_node);

      Requires: nxt_node must be a node of a circular list.

      Effects: Links this_node before nxt_node in the circular list.

      Complexity: Constant

      Throws: Nothing.

    9. -
      static void link_after(const node_ptr & prev_node, const node_ptr & this_node);
      +
      static void link_after(const node_ptr & prev_node, const node_ptr & this_node);

      Requires: prev_node must be a node of a circular list.

      Effects: Links this_node after prev_node in the circular list.

      Complexity: Constant

      Throws: Nothing.

    10. -
      static void swap_nodes(const node_ptr & this_node, 
+
      static void swap_nodes(const node_ptr & this_node, 
                        const node_ptr & other_node);
      
 
      Requires: this_node and other_node must be nodes inserted in circular lists or be empty circular lists.
      
 
      Effects: Swaps the position of the nodes: this_node is inserted in other_nodes position in the second circular list and the other_node is inserted in this_node's position in the first circular list.
      
@@ -162,56 +162,56 @@
 
      Throws: Nothing.
    11. -
      static void transfer(const node_ptr & p, const node_ptr & b, 
+
      static void transfer(const node_ptr & p, const node_ptr & b, 
                      const node_ptr & e);
      
 
      Requires: b and e must be nodes of the same circular list or an empty range. and p must be a node of a different circular list or may not be an iterator in Effects: Removes the nodes from [b, e) range from their circular list and inserts them before p in p's circular list.
      
 
      Complexity: Constant
      
 
      Throws: Nothing.
    12. -
      static void transfer(const node_ptr & p, const node_ptr & i);
      +
      static void transfer(const node_ptr & p, const node_ptr & i);

      Requires: i must a node of a circular list and p must be a node of a different circular list.

      Effects: Removes the node i from its circular list and inserts it before p in p's circular list. If p == i or p == NodeTraits::get_next(i), this function is a null operation.

      Complexity: Constant

      Throws: Nothing.

    13. -
      static void reverse(const node_ptr & p);
      +
      static void reverse(const node_ptr & p);

      Effects: Reverses the order of elements in the list.

      Throws: Nothing.

      Complexity: This function is linear time.

    14. -
      static void move_backwards(const node_ptr & p, std::size_t n);
      +
      static void move_backwards(const node_ptr & p, std::size_t n);

      Effects: Moves the node p n positions towards the end of the list.

      Throws: Nothing.

      Complexity: Linear to the number of moved positions.

    15. -
      static void move_forward(const node_ptr & p, std::size_t n);
      +
      static void move_forward(const node_ptr & p, std::size_t n);

      Effects: Moves the node p n positions towards the beginning of the list.

      Throws: Nothing.

      Complexity: Linear to the number of moved positions. 

    16. static std::size_t 
-distance(const const_node_ptr & f, const const_node_ptr & l);
      +distance(const const_node_ptr & f, const const_node_ptr & l);

      Requires: f and l must be in a circular list.

      Effects: Returns the number of nodes in the range [f, l).

      Complexity: Linear

      Throws: Nothing. 

    17. template<typename Pred> 
-  static void stable_partition(node_ptr beg, const node_ptr & end, Pred pred, 
+  static void stable_partition(node_ptr beg, const node_ptr & end, Pred pred, 
                                stable_partition_info & info);
    -

    -circular_list_algorithms private static functions

    +

    +circular_list_algorithms private static functions

      -
    1. static void swap_prev(const node_ptr & this_node, const node_ptr & other_node);
      2. -
    2. static void swap_next(const node_ptr & this_node, const node_ptr & other_node);
      3. +
    3. static void swap_prev(const node_ptr & this_node, const node_ptr & other_node);
      4. +
    4. static void swap_next(const node_ptr & this_node, const node_ptr & other_node);
    diff --git a/doc/html/boost/intrusive/circular_list_algorithms/stable_partition_info.html b/doc/html/boost/intrusive/circular_list_algorithms/stable_partition_info.html index afb0988d8e..af34ec6ccb 100644 --- a/doc/html/boost/intrusive/circular_list_algorithms/stable_partition_info.html +++ b/doc/html/boost/intrusive/circular_list_algorithms/stable_partition_info.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -52,7 +52,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/intrusive/circular_slist_algorithms.html b/doc/html/boost/intrusive/circular_slist_algorithms.html index 699b8651f4..769660effc 100644 --- a/doc/html/boost/intrusive/circular_slist_algorithms.html +++ b/doc/html/boost/intrusive/circular_slist_algorithms.html @@ -41,29 +41,29 @@ typedef NodeTraits::const_node_ptr const_node_ptr; typedef NodeTraits node_traits; - // public static functions - static void init(node_ptr); - static bool unique(const_node_ptr); - static bool inited(const_node_ptr); - static void unlink_after(node_ptr); - static void unlink_after(node_ptr, node_ptr); - static void link_after(node_ptr, node_ptr); - static void transfer_after(node_ptr, node_ptr, node_ptr); - static void init_header(const node_ptr &); - static node_ptr get_previous_node(const node_ptr &, const node_ptr &); - static node_ptr get_previous_node(const node_ptr &); - static node_ptr get_previous_previous_node(const node_ptr &); - static node_ptr get_previous_previous_node(node_ptr, const node_ptr &); - static std::size_t count(const const_node_ptr &); - static void unlink(const node_ptr &); - static void link_before(const node_ptr &, const node_ptr &); - static void swap_nodes(const node_ptr &, const node_ptr &); - static void reverse(const node_ptr &); - static node_ptr move_backwards(const node_ptr &, std::size_t); - static node_ptr move_forward(const node_ptr &, std::size_t); + // public static functions + static void init(node_ptr); + static bool unique(const_node_ptr); + static bool inited(const_node_ptr); + static void unlink_after(node_ptr); + static void unlink_after(node_ptr, node_ptr); + static void link_after(node_ptr, node_ptr); + static void transfer_after(node_ptr, node_ptr, node_ptr); + static void init_header(const node_ptr &); + static node_ptr get_previous_node(const node_ptr &, const node_ptr &); + static node_ptr get_previous_node(const node_ptr &); + static node_ptr get_previous_previous_node(const node_ptr &); + static node_ptr get_previous_previous_node(node_ptr, const node_ptr &); + static std::size_t count(const const_node_ptr &); + static void unlink(const node_ptr &); + static void link_before(const node_ptr &, const node_ptr &); + static void swap_nodes(const node_ptr &, const node_ptr &); + static void reverse(const node_ptr &); + static node_ptr move_backwards(const node_ptr &, std::size_t); + static node_ptr move_forward(const node_ptr &, std::size_t); };
    -

    Description

    +

    Description

    circular_slist_algorithms provides basic algorithms to manipulate nodes forming a circular singly linked list. An empty circular list is formed by a node whose pointer to the next node points to itself.

    circular_slist_algorithms is configured with a NodeTraits class, which encapsulates the information about the node to be manipulated. NodeTraits must support the following interface:

    Typedefs:

    @@ -74,79 +74,79 @@

    static node_ptr get_next(const_node_ptr n);

    static void set_next(node_ptr n, node_ptr next);

    -

    -circular_slist_algorithms public static functions

    +

    +circular_slist_algorithms public static functions

    1. -
      static void init(node_ptr this_node);
      +
      static void init(node_ptr this_node);

      Effects: Constructs an non-used list element, putting the next pointer to null: NodeTraits::get_next(this_node) == node_ptr()

      Complexity: Constant

      Throws: Nothing.

    2. -
      static bool unique(const_node_ptr this_node);
      +
      static bool unique(const_node_ptr this_node);

      Requires: this_node must be in a circular list or be an empty circular list.

      Effects: Returns true is "this_node" is the only node of a circular list: or it's a not inserted node: return node_ptr() == NodeTraits::get_next(this_node) || NodeTraits::get_next(this_node) == this_node

      Complexity: Constant

      Throws: Nothing.

    3. -
      static bool inited(const_node_ptr this_node);
      +
      static bool inited(const_node_ptr this_node);

      Effects: Returns true is "this_node" has the same state as if it was inited using "init(node_ptr)"

      Complexity: Constant

      Throws: Nothing.

    4. -
      static void unlink_after(node_ptr prev_node);
      +
      static void unlink_after(node_ptr prev_node);

      Requires: prev_node must be in a circular list or be an empty circular list.

      Effects: Unlinks the next node of prev_node from the circular list.

      Complexity: Constant

      Throws: Nothing.

    5. -
      static void unlink_after(node_ptr prev_node, node_ptr last_node);
      +
      static void unlink_after(node_ptr prev_node, node_ptr last_node);

      Requires: prev_node and last_node must be in a circular list or be an empty circular list.

      Effects: Unlinks the range (prev_node, last_node) from the circular list.

      Complexity: Constant

      Throws: Nothing.

    6. -
      static void link_after(node_ptr prev_node, node_ptr this_node);
      +
      static void link_after(node_ptr prev_node, node_ptr this_node);

      Requires: prev_node must be a node of a circular list.

      Effects: Links this_node after prev_node in the circular list.

      Complexity: Constant

      Throws: Nothing.

    7. -
      static void transfer_after(node_ptr p, node_ptr b, node_ptr e);
      +
      static void transfer_after(node_ptr p, node_ptr b, node_ptr e);

      Requires: b and e must be nodes of the same circular list or an empty range. and p must be a node of a different circular list.

      Effects: Removes the nodes from (b, e] range from their circular list and inserts them after p in p's circular list.

      Complexity: Constant

      Throws: Nothing.

    8. -
      static void init_header(const node_ptr & this_node);
      +
      static void init_header(const node_ptr & this_node);

      Effects: Constructs an empty list, making this_node the only node of the circular list: NodeTraits::get_next(this_node) == this_node.

      Complexity: Constant

      Throws: Nothing. 

    9. static node_ptr 
-get_previous_node(const node_ptr & prev_init_node, const node_ptr & this_node);
      +get_previous_node(const node_ptr & prev_init_node, const node_ptr & this_node);

      Requires: this_node and prev_init_node must be in the same circular list.

      Effects: Returns the previous node of this_node in the circular list starting. the search from prev_init_node. The first node checked for equality is NodeTraits::get_next(prev_init_node).

      Complexity: Linear to the number of elements between prev_init_node and this_node.

      Throws: Nothing.

    10. -
      static node_ptr get_previous_node(const node_ptr & this_node);
      +
      static node_ptr get_previous_node(const node_ptr & this_node);

      Requires: this_node must be in a circular list or be an empty circular list.

      Effects: Returns the previous node of this_node in the circular list.

      Complexity: Linear to the number of elements in the circular list.

      Throws: Nothing.

    11. -
      static node_ptr get_previous_previous_node(const node_ptr & this_node);
      +
      static node_ptr get_previous_previous_node(const node_ptr & this_node);

      Requires: this_node must be in a circular list or be an empty circular list.

      Effects: Returns the previous node of the previous node of this_node in the circular list.

      Complexity: Linear to the number of elements in the circular list.

      @@ -154,35 +154,35 @@ 
    12. static node_ptr 
-get_previous_previous_node(node_ptr p, const node_ptr & this_node);
      +get_previous_previous_node(node_ptr p, const node_ptr & this_node);

      Requires: this_node and p must be in the same circular list.

      Effects: Returns the previous node of the previous node of this_node in the circular list starting. the search from p. The first node checked for equality is NodeTraits::get_next((NodeTraits::get_next(p)).

      Complexity: Linear to the number of elements in the circular list.

      Throws: Nothing.

    13. -
      static std::size_t count(const const_node_ptr & this_node);
      +
      static std::size_t count(const const_node_ptr & this_node);

      Requires: this_node must be in a circular list or be an empty circular list.

      Effects: Returns the number of nodes in a circular list. If the circular list is empty, returns 1.

      Complexity: Linear

      Throws: Nothing.

    14. -
      static void unlink(const node_ptr & this_node);
      +
      static void unlink(const node_ptr & this_node);

      Requires: this_node must be in a circular list, be an empty circular list or be inited.

      Effects: Unlinks the node from the circular list.

      Complexity: Linear to the number of elements in the circular list

      Throws: Nothing.

    15. -
      static void link_before(const node_ptr & nxt_node, const node_ptr & this_node);
      +
      static void link_before(const node_ptr & nxt_node, const node_ptr & this_node);

      Requires: nxt_node must be a node of a circular list.

      Effects: Links this_node before nxt_node in the circular list.

      Complexity: Linear to the number of elements in the circular list.

      Throws: Nothing.

    16. -
      static void swap_nodes(const node_ptr & this_node, 
+
      static void swap_nodes(const node_ptr & this_node, 
                        const node_ptr & other_node);
      
 
      Requires: this_node and other_node must be nodes inserted in circular lists or be empty circular lists.
      
 
      Effects: Swaps the position of the nodes: this_node is inserted in other_nodes position in the second circular list and the other_node is inserted in this_node's position in the first circular list.
      
@@ -190,20 +190,20 @@
 
      Throws: Nothing.
    17. -
      static void reverse(const node_ptr & p);
      +
      static void reverse(const node_ptr & p);

      Effects: Reverses the order of elements in the list.

      Throws: Nothing.

      Complexity: This function is linear to the contained elements.

    18. -
      static node_ptr move_backwards(const node_ptr & p, std::size_t n);
      +
      static node_ptr move_backwards(const node_ptr & p, std::size_t n);

      Effects: Moves the node p n positions towards the end of the list.

      Returns: The previous node of p after the function if there has been any movement, Null if n leads to no movement.

      Throws: Nothing.

      Complexity: Linear to the number of elements plus the number moved positions.

    19. -
      static node_ptr move_forward(const node_ptr & p, std::size_t n);
      +
      static node_ptr move_forward(const node_ptr & p, std::size_t n);

      Effects: Moves the node p n positions towards the beginning of the list.

      Returns: The previous node of p after the function if there has been any movement, Null if n leads equals to no movement.

      Throws: Nothing.

      diff --git a/doc/html/boost/intrusive/compare.html b/doc/html/boost/intrusive/compare.html index f402401e1d..be6fa7b5cf 100644 --- a/doc/html/boost/intrusive/compare.html +++ b/doc/html/boost/intrusive/compare.html @@ -36,7 +36,7 @@ struct compare { };
    -

    Description

    +

    Description

    This option setter specifies the strict weak ordering comparison functor for the value type

    diff --git a/doc/html/boost/intrusive/compare_hash.html b/doc/html/boost/intrusive/compare_hash.html index e60b79d387..330d0f2b8c 100644 --- a/doc/html/boost/intrusive/compare_hash.html +++ b/doc/html/boost/intrusive/compare_hash.html @@ -36,7 +36,7 @@ struct compare_hash { };
    -

    Description

    +

    Description

    This option setter specifies if the container will compare the hash value before comparing objects. This option can't be specified if store_hash<> is not true. This is specially helpful when we have containers with a high load factor. and the comparison function is much more expensive that comparing already stored hash values.

    diff --git a/doc/html/boost/intrusive/constant_time_size.html b/doc/html/boost/intrusive/constant_time_size.html index 2b6ecd6299..a6ba1a24e8 100644 --- a/doc/html/boost/intrusive/constant_time_size.html +++ b/doc/html/boost/intrusive/constant_time_size.html @@ -36,7 +36,7 @@ struct constant_time_size { };
    -

    Description

    +

    Description

    This option setter specifies if the intrusive container stores its size as a member to obtain constant-time size() member.

    diff --git a/doc/html/boost/intrusive/derivation_value_traits.html b/doc/html/boost/intrusive/derivation_value_traits.html index 6bf6d8a74b..a091946e35 100644 --- a/doc/html/boost/intrusive/derivation_value_traits.html +++ b/doc/html/boost/intrusive/derivation_value_traits.html @@ -45,26 +45,26 @@ typedef boost::intrusive::pointer_traits< pointer >::reference reference; typedef boost::intrusive::pointer_traits< const_pointer >::reference const_reference; - // public static functions - static node_ptr to_node_ptr(reference); - static const_node_ptr to_node_ptr(const_reference); - static pointer to_value_ptr(const node_ptr &); - static const_pointer to_value_ptr(const const_node_ptr &); + // public static functions + static node_ptr to_node_ptr(reference); + static const_node_ptr to_node_ptr(const_reference); + static pointer to_value_ptr(const node_ptr &); + static const_pointer to_value_ptr(const const_node_ptr &); // public data members static const link_mode_type link_mode; };
    -

    Description

    +

    Description

    This value traits template is used to create value traits from user defined node traits where value_traits::value_type will derive from node_traits::node

    -

    -derivation_value_traits public static functions

    +

    +derivation_value_traits public static functions

      -
    1. static node_ptr to_node_ptr(reference value);
      2. -
    2. static const_node_ptr to_node_ptr(const_reference value);
      3. -
    3. static pointer to_value_ptr(const node_ptr & n);
      4. -
    4. static const_pointer to_value_ptr(const const_node_ptr & n);
      5. +
    5. static node_ptr to_node_ptr(reference value);
      6. +
    6. static const_node_ptr to_node_ptr(const_reference value);
      7. +
    7. static pointer to_value_ptr(const node_ptr & n);
      8. +
    8. static const_pointer to_value_ptr(const const_node_ptr & n);
    diff --git a/doc/html/boost/intrusive/equal.html b/doc/html/boost/intrusive/equal.html index 1b8ef0b9a2..b5c46c63bb 100644 --- a/doc/html/boost/intrusive/equal.html +++ b/doc/html/boost/intrusive/equal.html @@ -36,7 +36,7 @@ struct equal { };
    -

    Description

    +

    Description

    This option setter specifies the equality functor for the value type

    diff --git a/doc/html/boost/intrusive/floating_point.html b/doc/html/boost/intrusive/floating_point.html index 1bb03e497c..0cfa0d87c3 100644 --- a/doc/html/boost/intrusive/floating_point.html +++ b/doc/html/boost/intrusive/floating_point.html @@ -36,7 +36,7 @@ struct floating_point { };
    -

    Description

    +

    Description

    This option setter for scapegoat containers specifies if the intrusive scapegoat container should use a non-variable alpha value that does not need floating-point operations.

    If activated, the fixed alpha value is 1/sqrt(2). This option also saves some space in the container since the alpha value and some additional data does not need to be stored in the container.

    If the user only needs an alpha value near 1/sqrt(2), this option also improves performance since avoids logarithm and division operations when rebalancing the tree.

    diff --git a/doc/html/boost/intrusive/function_hook.html b/doc/html/boost/intrusive/function_hook.html index 2720845908..2b8f827b4d 100644 --- a/doc/html/boost/intrusive/function_hook.html +++ b/doc/html/boost/intrusive/function_hook.html @@ -36,7 +36,7 @@ struct function_hook { };
    -

    Description

    +

    Description

    This option setter specifies the function object that will be used to convert between values to be inserted in a container and the hook to be used for that purpose.

    diff --git a/doc/html/boost/intrusive/get_pare_idm46322884338032.html b/doc/html/boost/intrusive/get_pare_idm46322884338032.html new file mode 100644 index 0000000000..acd34e590f --- /dev/null +++ b/doc/html/boost/intrusive/get_pare_idm46322884338032.html @@ -0,0 +1,58 @@ + + + + +Function template get_parent_from_member + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template get_parent_from_member

    +

    boost::intrusive::get_parent_from_member

    +
    +

    Synopsis

    +
    // In header: <boost/intrusive/parent_from_member.hpp>
+
+
+template<typename Parent, typename Member> 
+  const Parent * 
+  get_parent_from_member(const Member * member, 
+                         const Member Parent::* ptr_to_member);
    +
    +

    Description

    +

    Given a const pointer to a member and its corresponding const pointer to data member, this function returns the const pointer of the parent containing that member. Note: this function does not work with pointer to members that rely on virtual inheritance.

    +
    +
    + + + +
    Copyright © 2005 Olaf Krzikalla
    Copyright © 2006-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/intrusive/get_pare_idm46322884342304.html b/doc/html/boost/intrusive/get_pare_idm46322884342304.html new file mode 100644 index 0000000000..148048cf3e --- /dev/null +++ b/doc/html/boost/intrusive/get_pare_idm46322884342304.html @@ -0,0 +1,57 @@ + + + + +Function template get_parent_from_member + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template get_parent_from_member

    +

    boost::intrusive::get_parent_from_member

    +
    +

    Synopsis

    +
    // In header: <boost/intrusive/parent_from_member.hpp>
+
+
+template<typename Parent, typename Member> 
+  Parent * get_parent_from_member(Member * member, 
+                                  const Member Parent::* ptr_to_member);
    +
    +

    Description

    +

    Given a pointer to a member and its corresponding pointer to data member, this function returns the pointer of the parent containing that member. Note: this function does not work with pointer to members that rely on virtual inheritance.

    +
    +
    + + + +
    Copyright © 2005 Olaf Krzikalla
    Copyright © 2006-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/intrusive/get_parent_fro_idp48890800.html b/doc/html/boost/intrusive/get_parent_fro_idp48890800.html deleted file mode 100644 index e4787d5553..0000000000 --- a/doc/html/boost/intrusive/get_parent_fro_idp48890800.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function template get_parent_from_member - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template get_parent_from_member

    -

    boost::intrusive::get_parent_from_member

    -
    -

    Synopsis

    -
    // In header: <boost/intrusive/parent_from_member.hpp>
-
-
-template<typename Parent, typename Member> 
-  Parent * get_parent_from_member(Member * member, 
-                                  const Member Parent::* ptr_to_member);
    -
    -

    Description

    -

    Given a pointer to a member and its corresponding pointer to data member, this function returns the pointer of the parent containing that member. Note: this function does not work with pointer to members that rely on virtual inheritance.

    -
    -
    - - - -
    Copyright © 2005 Olaf Krzikalla
    Copyright © 2006-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/intrusive/get_parent_fro_idp48895072.html b/doc/html/boost/intrusive/get_parent_fro_idp48895072.html deleted file mode 100644 index 1b197e0353..0000000000 --- a/doc/html/boost/intrusive/get_parent_fro_idp48895072.html +++ /dev/null @@ -1,58 +0,0 @@ - - - - -Function template get_parent_from_member - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template get_parent_from_member

    -

    boost::intrusive::get_parent_from_member

    -
    -

    Synopsis

    -
    // In header: <boost/intrusive/parent_from_member.hpp>
-
-
-template<typename Parent, typename Member> 
-  const Parent * 
-  get_parent_from_member(const Member * member, 
-                         const Member Parent::* ptr_to_member);
    -
    -

    Description

    -

    Given a const pointer to a member and its corresponding const pointer to data member, this function returns the const pointer of the parent containing that member. Note: this function does not work with pointer to members that rely on virtual inheritance.

    -
    -
    - - - -
    Copyright © 2005 Olaf Krzikalla
    Copyright © 2006-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/intrusive/hash.html b/doc/html/boost/intrusive/hash.html index 7307d1daba..dcbad29573 100644 --- a/doc/html/boost/intrusive/hash.html +++ b/doc/html/boost/intrusive/hash.html @@ -36,7 +36,7 @@ struct hash { };
    -

    Description

    +

    Description

    This option setter specifies the hash functor for the value type

    diff --git a/doc/html/boost/intrusive/hashtable.html b/doc/html/boost/intrusive/hashtable.html index 3eea093964..a7bb23ea0d 100644 --- a/doc/html/boost/intrusive/hashtable.html +++ b/doc/html/boost/intrusive/hashtable.html @@ -67,102 +67,102 @@ typedef unspecified insert_commit_data; // construct/copy/destruct - explicit hashtable(const bucket_traits &, const hasher & = hasher(), + explicit hashtable(const bucket_traits &, const hasher & = hasher(), const key_equal & = key_equal(), const value_traits & = value_traits()); template<typename Iterator> - hashtable(bool, Iterator, Iterator, const bucket_traits &, + hashtable(bool, Iterator, Iterator, const bucket_traits &, const hasher & = hasher(), const key_equal & = key_equal(), const value_traits & = value_traits()); - hashtable(hashtable &&); - hashtable & operator=(hashtable &&); - ~hashtable(); + hashtable(hashtable &&); + hashtable & operator=(hashtable &&); + ~hashtable(); - // public member functions - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end(); - const_iterator end() const; - const_iterator cend() const; - hasher hash_function() const; - key_equal key_eq() const; - bool empty() const; - size_type size() const; - void swap(hashtable &); + // public member functions + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end(); + const_iterator end() const; + const_iterator cend() const; + hasher hash_function() const; + key_equal key_eq() const; + bool empty() const; + size_type size() const; + void swap(hashtable &); template<typename Cloner, typename Disposer> - void clone_from(const hashtable &, Cloner, Disposer); + void clone_from(const hashtable &, Cloner, Disposer); template<typename Cloner, typename Disposer> - void clone_from(hashtable &&, Cloner, Disposer); - iterator insert_equal(reference); - template<typename Iterator> void insert_equal(Iterator, Iterator); - std::pair< iterator, bool > insert_unique(reference); - template<typename Iterator> void insert_unique(Iterator, Iterator); + void clone_from(hashtable &&, Cloner, Disposer); + iterator insert_equal(reference); + template<typename Iterator> void insert_equal(Iterator, Iterator); + std::pair< iterator, bool > insert_unique(reference); + template<typename Iterator> void insert_unique(Iterator, Iterator); template<typename KeyType, typename KeyHasher, typename KeyEqual> std::pair< iterator, bool > - insert_unique_check(const KeyType &, KeyHasher, KeyEqual, + insert_unique_check(const KeyType &, KeyHasher, KeyEqual, insert_commit_data &); - iterator insert_unique_commit(reference, const insert_commit_data &); - void erase(const_iterator); - void erase(const_iterator, const_iterator); - size_type erase(const key_type &); + iterator insert_unique_commit(reference, const insert_commit_data &); + void erase(const_iterator); + void erase(const_iterator, const_iterator); + size_type erase(const key_type &); template<typename KeyType, typename KeyHasher, typename KeyEqual> - size_type erase(const KeyType &, KeyHasher, KeyEqual); - template<typename Disposer> void erase_and_dispose(const_iterator, Disposer); + size_type erase(const KeyType &, KeyHasher, KeyEqual); + template<typename Disposer> void erase_and_dispose(const_iterator, Disposer); template<typename Disposer> - void erase_and_dispose(const_iterator, const_iterator, Disposer); + void erase_and_dispose(const_iterator, const_iterator, Disposer); template<typename Disposer> - size_type erase_and_dispose(const key_type &, Disposer); + size_type erase_and_dispose(const key_type &, Disposer); template<typename KeyType, typename KeyHasher, typename KeyEqual, typename Disposer> - size_type erase_and_dispose(const KeyType &, KeyHasher, KeyEqual, + size_type erase_and_dispose(const KeyType &, KeyHasher, KeyEqual, Disposer); - void clear(); - template<typename Disposer> void clear_and_dispose(Disposer); - size_type count(const key_type &) const; + void clear(); + template<typename Disposer> void clear_and_dispose(Disposer); + size_type count(const key_type &) const; template<typename KeyType, typename KeyHasher, typename KeyEqual> - size_type count(const KeyType &, KeyHasher, KeyEqual) const; - iterator find(const key_type &); + size_type count(const KeyType &, KeyHasher, KeyEqual) const; + iterator find(const key_type &); template<typename KeyType, typename KeyHasher, typename KeyEqual> - iterator find(const KeyType &, KeyHasher, KeyEqual); - const_iterator find(const key_type &) const; + iterator find(const KeyType &, KeyHasher, KeyEqual); + const_iterator find(const key_type &) const; template<typename KeyType, typename KeyHasher, typename KeyEqual> - const_iterator find(const KeyType &, KeyHasher, KeyEqual) const; - std::pair< iterator, iterator > equal_range(const key_type &); + const_iterator find(const KeyType &, KeyHasher, KeyEqual) const; + std::pair< iterator, iterator > equal_range(const key_type &); template<typename KeyType, typename KeyHasher, typename KeyEqual> std::pair< iterator, iterator > - equal_range(const KeyType &, KeyHasher, KeyEqual); + equal_range(const KeyType &, KeyHasher, KeyEqual); std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; + equal_range(const key_type &) const; template<typename KeyType, typename KeyHasher, typename KeyEqual> std::pair< const_iterator, const_iterator > - equal_range(const KeyType &, KeyHasher, KeyEqual) const; - iterator iterator_to(reference); - const_iterator iterator_to(const_reference) const; - local_iterator local_iterator_to(reference); - const_local_iterator local_iterator_to(const_reference) const; - size_type bucket_count() const; - size_type bucket_size(size_type) const; - size_type bucket(const key_type &) const; + equal_range(const KeyType &, KeyHasher, KeyEqual) const; + iterator iterator_to(reference); + const_iterator iterator_to(const_reference) const; + local_iterator local_iterator_to(reference); + const_local_iterator local_iterator_to(const_reference) const; + size_type bucket_count() const; + size_type bucket_size(size_type) const; + size_type bucket(const key_type &) const; template<typename KeyType, typename KeyHasher> - size_type bucket(const KeyType &, KeyHasher) const; - bucket_ptr bucket_pointer() const; - local_iterator begin(size_type); - const_local_iterator begin(size_type) const; - const_local_iterator cbegin(size_type) const; - local_iterator end(size_type); - const_local_iterator end(size_type) const; - const_local_iterator cend(size_type) const; - void rehash(const bucket_traits &); - bool incremental_rehash(bool = true); - bool incremental_rehash(const bucket_traits &); - size_type split_count() const; + size_type bucket(const KeyType &, KeyHasher) const; + bucket_ptr bucket_pointer() const; + local_iterator begin(size_type); + const_local_iterator begin(size_type) const; + const_local_iterator cbegin(size_type) const; + local_iterator end(size_type); + const_local_iterator end(size_type) const; + const_local_iterator cend(size_type) const; + void rehash(const bucket_traits &); + bool incremental_rehash(bool = true); + bool incremental_rehash(const bucket_traits &); + size_type split_count() const; - // public static functions - static local_iterator s_local_iterator_to(reference); - static const_local_iterator s_local_iterator_to(const_reference); - static size_type suggested_upper_bucket_count(size_type); - static size_type suggested_lower_bucket_count(size_type); + // public static functions + static local_iterator s_local_iterator_to(reference); + static const_local_iterator s_local_iterator_to(const_reference); + static size_type suggested_upper_bucket_count(size_type); + static size_type suggested_lower_bucket_count(size_type); // public data members static const bool stateful_value_traits; @@ -176,7 +176,7 @@ static const bool optimize_multikey; };
    -

    Description

    +

    Description

    The class template hashtable is an intrusive hash table container, that is used to construct intrusive unordered_set and unordered_multiset containers. The no-throw guarantee holds only, if the VoidOrKeyEqual object and Hasher don't throw.

    hashtable is a semi-intrusive container: each object to be stored in the container must contain a proper hook, but the container also needs additional auxiliary memory to work: hashtable needs a pointer to an array of type bucket_type to be passed in the constructor. This bucket array must have at least the same lifetime as the container. This makes the use of hashtable more complicated than purely intrusive containers. bucket_type is default-constructible, copyable and assignable

    The template parameter T is the type to be managed by the container. The user can specify additional options and if no options are provided default options are used.

    @@ -186,13 +186,13 @@

    hashtables, does not make automatic rehashings nor offers functions related to a load factor. Rehashing can be explicitly requested and the user must provide a new bucket array that will be used from that moment.

    Since no automatic rehashing is done, iterators are never invalidated when inserting or erasing elements. Iterators are only invalidated when rehashing.

    -

    +

    hashtable public construct/copy/destruct

    1. -
      explicit hashtable(const bucket_traits & b_traits, 
+
      explicit hashtable(const bucket_traits & b_traits, 
                    const hasher & hash_func = hasher(), 
                    const key_equal & equal_func = key_equal(), 
                    const value_traits & v_traits = value_traits());
      
@@ -204,7 +204,7 @@
 
    2. template<typename Iterator> 
-  hashtable(bool unique, Iterator b, Iterator e, 
+  hashtable(bool unique, Iterator b, Iterator e, 
             const bucket_traits & b_traits, 
             const hasher & hash_func = hasher(), 
             const key_equal & equal_func = key_equal(), 
@@ -216,15 +216,15 @@
 
      Notes: buckets array must be disposed only after *this is disposed.
    3. -
      hashtable(hashtable && x);
      +
      hashtable(hashtable && x);

      Effects: to-do

    4. -
      hashtable & operator=(hashtable && x);
      +
      hashtable & operator=(hashtable && x);

      Effects: to-do

    5. -
      ~hashtable();
      +
      ~hashtable();

      Effects: Detaches all elements from this. The objects in the unordered_set are not deleted (i.e. no destructors are called).

      Complexity: Linear to the number of elements in the unordered_set, if it's a safe-mode or auto-unlink value. Otherwise constant.

      Throws: Nothing.

      @@ -232,71 +232,71 @@
    -

    -hashtable public member functions

    +

    +hashtable public member functions

    1. -
      iterator begin();
      +
      iterator begin();

      Effects: Returns an iterator pointing to the beginning of the unordered_set.

      Complexity: Amortized constant time. Worst case (empty unordered_set): O(this->bucket_count())

      Throws: Nothing.

    2. -
      const_iterator begin() const;
      +
      const_iterator begin() const;

      Effects: Returns a const_iterator pointing to the beginning of the unordered_set.

      Complexity: Amortized constant time. Worst case (empty unordered_set): O(this->bucket_count())

      Throws: Nothing.

    3. -
      const_iterator cbegin() const;
      +
      const_iterator cbegin() const;

      Effects: Returns a const_iterator pointing to the beginning of the unordered_set.

      Complexity: Amortized constant time. Worst case (empty unordered_set): O(this->bucket_count())

      Throws: Nothing.

    4. -
      iterator end();
      +
      iterator end();

      Effects: Returns an iterator pointing to the end of the unordered_set.

      Complexity: Constant.

      Throws: Nothing.

    5. -
      const_iterator end() const;
      +
      const_iterator end() const;

      Effects: Returns a const_iterator pointing to the end of the unordered_set.

      Complexity: Constant.

      Throws: Nothing.

    6. -
      const_iterator cend() const;
      +
      const_iterator cend() const;

      Effects: Returns a const_iterator pointing to the end of the unordered_set.

      Complexity: Constant.

      Throws: Nothing.

    7. -
      hasher hash_function() const;
      +
      hasher hash_function() const;

      Effects: Returns the hasher object used by the unordered_set.

      Complexity: Constant.

      Throws: If hasher copy-constructor throws.

    8. -
      key_equal key_eq() const;
      +
      key_equal key_eq() const;

      Effects: Returns the key_equal object used by the unordered_set.

      Complexity: Constant.

      Throws: If key_equal copy-constructor throws.

    9. -
      bool empty() const;
      +
      bool empty() const;

      Effects: Returns true if the container is empty.

      Complexity: if constant-time size and cache_begin options are disabled, average constant time (worst case, with empty() == true: O(this->bucket_count()). Otherwise constant.

      Throws: Nothing.

    10. -
      size_type size() const;
      +
      size_type size() const;

      Effects: Returns the number of elements stored in the unordered_set.

      Complexity: Linear to elements contained in *this if constant_time_size is false. Constant-time otherwise.

      Throws: Nothing.

    11. -
      void swap(hashtable & other);
      +
      void swap(hashtable & other);

      Requires: the hasher and the equality function unqualified swap call should not throw.

      Effects: Swaps the contents of two unordered_sets. Swaps also the contained bucket array and equality and hasher functors.

      Complexity: Constant.

      @@ -304,7 +304,7 @@ 
    12. template<typename Cloner, typename Disposer> 
-  void clone_from(const hashtable & src, Cloner cloner, Disposer disposer);
      + void clone_from(const hashtable & src, Cloner cloner, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw Cloner should yield to nodes that compare equal and produce the same hash than the original node.

      Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(const_reference ) and inserts them on *this. The hash function and the equality predicate are copied from the source.

      If store_hash option is true, this method does not use the hash function.

      @@ -314,7 +314,7 @@ 
    13. template<typename Cloner, typename Disposer> 
-  void clone_from(hashtable && src, Cloner cloner, Disposer disposer);
      + void clone_from(hashtable && src, Cloner cloner, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw Cloner should yield to nodes that compare equal and produce the same hash than the original node.

      Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(reference) and inserts them on *this. The hash function and the equality predicate are copied from the source.

      If store_hash option is true, this method does not use the hash function.

      @@ -323,7 +323,7 @@

      Throws: If cloner or hasher throw or hash or equality predicate copying throws. Basic guarantee.

    14. -
      iterator insert_equal(reference value);
      +
      iterator insert_equal(reference value);

      Requires: value must be an lvalue

      Effects: Inserts the value into the unordered_set.

      Returns: An iterator to the inserted value.

      @@ -332,7 +332,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    15. -
      template<typename Iterator> void insert_equal(Iterator b, Iterator e);
      +
      template<typename Iterator> void insert_equal(Iterator b, Iterator e);

      Requires: Dereferencing iterator must yield an lvalue of type value_type.

      Effects: Equivalent to this->insert_equal(t) for each element in [b, e).

      Complexity: Average case O(N), where N is distance(b, e). Worst case O(N*this->size()).

      @@ -340,7 +340,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    16. -
      std::pair< iterator, bool > insert_unique(reference value);
      +
      std::pair< iterator, bool > insert_unique(reference value);

      Requires: value must be an lvalue

      Effects: Tries to inserts value into the unordered_set.

      Returns: If the value is not already present inserts it and returns a pair containing the iterator to the new value and true. If there is an equivalent value returns a pair containing an iterator to the already present value and false.

      @@ -349,7 +349,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    17. -
      template<typename Iterator> void insert_unique(Iterator b, Iterator e);
      +
      template<typename Iterator> void insert_unique(Iterator b, Iterator e);

      Requires: Dereferencing iterator must yield an lvalue of type value_type.

      Effects: Equivalent to this->insert_unique(t) for each element in [b, e).

      Complexity: Average case O(N), where N is distance(b, e). Worst case O(N*this->size()).

      @@ -359,7 +359,7 @@ 
    18. template<typename KeyType, typename KeyHasher, typename KeyEqual> 
   std::pair< iterator, bool > 
-  insert_unique_check(const KeyType & key, KeyHasher hash_func, 
+  insert_unique_check(const KeyType & key, KeyHasher hash_func, 
                       KeyEqual equal_func, insert_commit_data & commit_data);

      Requires: "hash_func" must be a hash function that induces the same hash values as the stored hasher. The difference is that "hash_func" hashes the given key instead of the value_type.

      "equal_func" must be a equality function that induces the same equality as key_equal. The difference is that "equal_func" compares an arbitrary key with the contained values.

      @@ -373,7 +373,7 @@

      After a successful rehashing insert_commit_data remains valid.

    19. -
      iterator insert_unique_commit(reference value, 
+
      iterator insert_unique_commit(reference value, 
                               const insert_commit_data & commit_data);
      
 
      Requires: value must be an lvalue of type value_type. commit_data must have been obtained from a previous call to "insert_check". No objects should have been inserted or erased from the unordered_set between the "insert_check" that filled "commit_data" and the call to "insert_commit".
      
 
      Effects: Inserts the value in the unordered_set using the information obtained from the "commit_data" that a previous "insert_check" filled.
      
@@ -384,21 +384,21 @@
 
      After a successful rehashing insert_commit_data remains valid.
    20. -
      void erase(const_iterator i);
      +
      void erase(const_iterator i);

      Effects: Erases the element pointed to by i.

      Complexity: Average case O(1), worst case O(this->size()).

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased element. No destructors are called.

    21. -
      void erase(const_iterator b, const_iterator e);
      +
      void erase(const_iterator b, const_iterator e);

      Effects: Erases the range pointed to by b end e.

      Complexity: Average case O(distance(b, e)), worst case O(this->size()).

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    22. -
      size_type erase(const key_type & key);
      +
      size_type erase(const key_type & key);

      Effects: Erases all the elements with the given value.

      Returns: The number of erased elements.

      Complexity: Average case O(this->count(value)). Worst case O(this->size()).

      @@ -407,7 +407,7 @@ 
    23. template<typename KeyType, typename KeyHasher, typename KeyEqual> 
-  size_type erase(const KeyType & key, KeyHasher hash_func, 
+  size_type erase(const KeyType & key, KeyHasher hash_func, 
                   KeyEqual equal_func);

      Requires: "hash_func" must be a hash function that induces the same hash values as the stored hasher. The difference is that "hash_func" hashes the given key instead of the value_type.

      "equal_func" must be a equality function that induces the same equality as key_equal. The difference is that "equal_func" compares an arbitrary key with the contained values.

      @@ -419,7 +419,7 @@ 
    24. template<typename Disposer> 
-  void erase_and_dispose(const_iterator i, Disposer disposer);
      + void erase_and_dispose(const_iterator i, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases the element pointed to by i. Disposer::operator()(pointer) is called for the removed element.

      Complexity: Average case O(1), worst case O(this->size()).

      @@ -428,7 +428,7 @@ 
    25. template<typename Disposer> 
-  void erase_and_dispose(const_iterator b, const_iterator e, 
+  void erase_and_dispose(const_iterator b, const_iterator e, 
                          Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases the range pointed to by b end e. Disposer::operator()(pointer) is called for the removed elements.

      @@ -438,7 +438,7 @@ 
    26. template<typename Disposer> 
-  size_type erase_and_dispose(const key_type & key, Disposer disposer);
      + size_type erase_and_dispose(const key_type & key, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases all the elements with the given value. Disposer::operator()(pointer) is called for the removed elements.

      Returns: The number of erased elements.

      @@ -449,7 +449,7 @@ 
    27. template<typename KeyType, typename KeyHasher, typename KeyEqual, 
          typename Disposer> 
-  size_type erase_and_dispose(const KeyType & key, KeyHasher hash_func, 
+  size_type erase_and_dispose(const KeyType & key, KeyHasher hash_func, 
                               KeyEqual equal_func, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases all the elements with the given key. according to the comparison functor "equal_func". Disposer::operator()(pointer) is called for the removed elements.

      @@ -459,14 +459,14 @@

      Note: Invalidates the iterators to the erased elements.

    28. -
      void clear();
      +
      void clear();

      Effects: Erases all of the elements.

      Complexity: Linear to the number of elements on the container. if it's a safe-mode or auto-unlink value_type. Constant time otherwise.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    29. -
      template<typename Disposer> void clear_and_dispose(Disposer disposer);
      +
      template<typename Disposer> void clear_and_dispose(Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases all of the elements.

      Complexity: Linear to the number of elements on the container. Disposer::operator()(pointer) is called for the removed elements.

      @@ -474,14 +474,14 @@

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    30. -
      size_type count(const key_type & key) const;
      +
      size_type count(const key_type & key) const;

      Effects: Returns the number of contained elements with the given value

      Complexity: Average case O(1), worst case O(this->size()).

      Throws: If the internal hasher or the equality functor throws. 

    31. template<typename KeyType, typename KeyHasher, typename KeyEqual> 
-  size_type count(const KeyType & key, KeyHasher hash_func, 
+  size_type count(const KeyType & key, KeyHasher hash_func, 
                   KeyEqual equal_func) const;

      Requires: "hash_func" must be a hash function that induces the same hash values as the stored hasher. The difference is that "hash_func" hashes the given key instead of the value_type.

      "equal_func" must be a equality function that induces the same equality as key_equal. The difference is that "equal_func" compares an arbitrary key with the contained values.

      @@ -490,14 +490,14 @@

      Throws: If hash_func or equal throw.

    32. -
      iterator find(const key_type & key);
      +
      iterator find(const key_type & key);

      Effects: Finds an iterator to the first element is equal to "value" or end() if that element does not exist.

      Complexity: Average case O(1), worst case O(this->size()).

      Throws: If the internal hasher or the equality functor throws. 

    33. template<typename KeyType, typename KeyHasher, typename KeyEqual> 
-  iterator find(const KeyType & key, KeyHasher hash_func, KeyEqual equal_func);
      + iterator find(const KeyType & key, KeyHasher hash_func, KeyEqual equal_func);

      Requires: "hash_func" must be a hash function that induces the same hash values as the stored hasher. The difference is that "hash_func" hashes the given key instead of the value_type.

      "equal_func" must be a equality function that induces the same equality as key_equal. The difference is that "equal_func" compares an arbitrary key with the contained values.

      Effects: Finds an iterator to the first element whose key is "key" according to the given hash and equality functor or end() if that element does not exist.

      @@ -506,7 +506,7 @@

      Note: This function is used when constructing a value_type is expensive and the value_type can be compared with a cheaper key type. Usually this key is part of the value_type.

    34. -
      const_iterator find(const key_type & key) const;
      +
      const_iterator find(const key_type & key) const;

      Effects: Finds a const_iterator to the first element whose key is "key" or end() if that element does not exist.

      Complexity: Average case O(1), worst case O(this->size()).

      Throws: If the internal hasher or the equality functor throws.

      @@ -514,7 +514,7 @@ 
    35. template<typename KeyType, typename KeyHasher, typename KeyEqual> 
   const_iterator 
-  find(const KeyType & key, KeyHasher hash_func, KeyEqual equal_func) const;
      + find(const KeyType & key, KeyHasher hash_func, KeyEqual equal_func) const;

      Requires: "hash_func" must be a hash function that induces the same hash values as the stored hasher. The difference is that "hash_func" hashes the given key instead of the value_type.

      "equal_func" must be a equality function that induces the same equality as key_equal. The difference is that "equal_func" compares an arbitrary key with the contained values.

      Effects: Finds an iterator to the first element whose key is "key" according to the given hasher and equality functor or end() if that element does not exist.

      @@ -523,7 +523,7 @@

      Note: This function is used when constructing a value_type is expensive and the value_type can be compared with a cheaper key type. Usually this key is part of the value_type.

    36. -
      std::pair< iterator, iterator > equal_range(const key_type & key);
      +
      std::pair< iterator, iterator > equal_range(const key_type & key);

      Effects: Returns a range containing all elements with values equivalent to value. Returns std::make_pair(this->end(), this->end()) if no such elements exist.

      Complexity: Average case O(this->count(value)). Worst case O(this->size()).

      Throws: If the internal hasher or the equality functor throws.

      @@ -531,7 +531,7 @@ 
    37. template<typename KeyType, typename KeyHasher, typename KeyEqual> 
   std::pair< iterator, iterator > 
-  equal_range(const KeyType & key, KeyHasher hash_func, KeyEqual equal_func);
      + equal_range(const KeyType & key, KeyHasher hash_func, KeyEqual equal_func);

      Requires: "hash_func" must be a hash function that induces the same hash values as the stored hasher. The difference is that "hash_func" hashes the given key instead of the value_type.

      "equal_func" must be a equality function that induces the same equality as key_equal. The difference is that "equal_func" compares an arbitrary key with the contained values.

      Effects: Returns a range containing all elements with equivalent keys. Returns std::make_pair(this->end(), this->end()) if no such elements exist.

      @@ -541,7 +541,7 @@ 
    38. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & key) const;
      +equal_range(const key_type & key) const;

      Effects: Returns a range containing all elements with values equivalent to value. Returns std::make_pair(this->end(), this->end()) if no such elements exist.

      Complexity: Average case O(this->count(value)). Worst case O(this->size()).

      Throws: If the internal hasher or the equality functor throws.

      @@ -549,7 +549,7 @@ 
    39. template<typename KeyType, typename KeyHasher, typename KeyEqual> 
   std::pair< const_iterator, const_iterator > 
-  equal_range(const KeyType & key, KeyHasher hash_func, KeyEqual equal_func) const;
      + equal_range(const KeyType & key, KeyHasher hash_func, KeyEqual equal_func) const;

      Requires: "hash_func" must be a hash function that induces the same hash values as the stored hasher. The difference is that "hash_func" hashes the given key instead of the value_type.

      "equal_func" must be a equality function that induces the same equality as key_equal. The difference is that "equal_func" compares an arbitrary key with the contained values.

      Effects: Returns a range containing all elements with equivalent keys. Returns std::make_pair(this->end(), this->end()) if no such elements exist.

      @@ -558,48 +558,48 @@

      Note: This function is used when constructing a value_type is expensive and the value_type can be compared with a cheaper key type. Usually this key is part of the value_type.

    40. -
      iterator iterator_to(reference value);
      +
      iterator iterator_to(reference value);

      Requires: value must be an lvalue and shall be in a unordered_set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator belonging to the unordered_set that points to the value

      Complexity: Constant.

      Throws: If the internal hash function throws.

    41. -
      const_iterator iterator_to(const_reference value) const;
      +
      const_iterator iterator_to(const_reference value) const;

      Requires: value must be an lvalue and shall be in a unordered_set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid const_iterator belonging to the unordered_set that points to the value

      Complexity: Constant.

      Throws: If the internal hash function throws.

    42. -
      local_iterator local_iterator_to(reference value);
      +
      local_iterator local_iterator_to(reference value);

      Requires: value must be an lvalue and shall be in a unordered_set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid local_iterator belonging to the unordered_set that points to the value

      Complexity: Constant.

      Throws: Nothing.

    43. -
      const_local_iterator local_iterator_to(const_reference value) const;
      +
      const_local_iterator local_iterator_to(const_reference value) const;

      Requires: value must be an lvalue and shall be in a unordered_set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid const_local_iterator belonging to the unordered_set that points to the value

      Complexity: Constant.

      Throws: Nothing.

    44. -
      size_type bucket_count() const;
      +
      size_type bucket_count() const;

      Effects: Returns the number of buckets passed in the constructor or the last rehash function.

      Complexity: Constant.

      Throws: Nothing.

    45. -
      size_type bucket_size(size_type n) const;
      +
      size_type bucket_size(size_type n) const;

      Requires: n is in the range [0, this->bucket_count()).

      Effects: Returns the number of elements in the nth bucket.

      Complexity: Constant.

      Throws: Nothing.

    46. -
      size_type bucket(const key_type & k) const;
      +
      size_type bucket(const key_type & k) const;

      Effects: Returns the index of the bucket in which elements with keys equivalent to k would be found, if any such element existed.

      Complexity: Constant.

      Throws: If the hash functor throws.

      @@ -607,7 +607,7 @@ 
    47. template<typename KeyType, typename KeyHasher> 
-  size_type bucket(const KeyType & k, KeyHasher hash_func) const;
      + size_type bucket(const KeyType & k, KeyHasher hash_func) const;

      Requires: "hash_func" must be a hash function that induces the same hash values as the stored hasher. The difference is that "hash_func" hashes the given key instead of the value_type.

      Effects: Returns the index of the bucket in which elements with keys equivalent to k would be found, if any such element existed.

      Complexity: Constant.

      @@ -615,13 +615,13 @@

      Note: the return value is in the range [0, this->bucket_count()).

    48. -
      bucket_ptr bucket_pointer() const;
      +
      bucket_ptr bucket_pointer() const;

      Effects: Returns the bucket array pointer passed in the constructor or the last rehash function.

      Complexity: Constant.

      Throws: Nothing.

    49. -
      local_iterator begin(size_type n);
      +
      local_iterator begin(size_type n);

      Requires: n is in the range [0, this->bucket_count()).

      Effects: Returns a local_iterator pointing to the beginning of the sequence stored in the bucket n.

      Complexity: Constant.

      @@ -629,7 +629,7 @@

      Note: [this->begin(n), this->end(n)) is a valid range containing all of the elements in the nth bucket.

    50. -
      const_local_iterator begin(size_type n) const;
      +
      const_local_iterator begin(size_type n) const;

      Requires: n is in the range [0, this->bucket_count()).

      Effects: Returns a const_local_iterator pointing to the beginning of the sequence stored in the bucket n.

      Complexity: Constant.

      @@ -637,7 +637,7 @@

      Note: [this->begin(n), this->end(n)) is a valid range containing all of the elements in the nth bucket.

    51. -
      const_local_iterator cbegin(size_type n) const;
      +
      const_local_iterator cbegin(size_type n) const;

      Requires: n is in the range [0, this->bucket_count()).

      Effects: Returns a const_local_iterator pointing to the beginning of the sequence stored in the bucket n.

      Complexity: Constant.

      @@ -645,7 +645,7 @@

      Note: [this->begin(n), this->end(n)) is a valid range containing all of the elements in the nth bucket.

    52. -
      local_iterator end(size_type n);
      +
      local_iterator end(size_type n);

      Requires: n is in the range [0, this->bucket_count()).

      Effects: Returns a local_iterator pointing to the end of the sequence stored in the bucket n.

      Complexity: Constant.

      @@ -653,7 +653,7 @@

      Note: [this->begin(n), this->end(n)) is a valid range containing all of the elements in the nth bucket.

    53. -
      const_local_iterator end(size_type n) const;
      +
      const_local_iterator end(size_type n) const;

      Requires: n is in the range [0, this->bucket_count()).

      Effects: Returns a const_local_iterator pointing to the end of the sequence stored in the bucket n.

      Complexity: Constant.

      @@ -661,7 +661,7 @@

      Note: [this->begin(n), this->end(n)) is a valid range containing all of the elements in the nth bucket.

    54. -
      const_local_iterator cend(size_type n) const;
      +
      const_local_iterator cend(size_type n) const;

      Requires: n is in the range [0, this->bucket_count()).

      Effects: Returns a const_local_iterator pointing to the end of the sequence stored in the bucket n.

      Complexity: Constant.

      @@ -669,7 +669,7 @@

      Note: [this->begin(n), this->end(n)) is a valid range containing all of the elements in the nth bucket.

    55. -
      void rehash(const bucket_traits & new_bucket_traits);
      +
      void rehash(const bucket_traits & new_bucket_traits);

      Requires: new_bucket_traits can hold a pointer to a new bucket array or the same as the old bucket array with a different length. new_size is the length of the the array pointed by new_buckets. If new_bucket_traits.bucket_begin() == this->bucket_pointer() new_bucket_traits.bucket_count() can be bigger or smaller than this->bucket_count(). 'new_bucket_traits' copy constructor should not throw.

      Effects: Updates the internal reference with the new bucket, erases the values from the old bucket and inserts then in the new one. Bucket traits hold by *this is assigned from new_bucket_traits. If the container is configured as incremental<>, the split bucket is set to the new bucket_count().

      If store_hash option is true, this method does not use the hash function.

      @@ -677,7 +677,7 @@

      Throws: If the hasher functor throws. Basic guarantee.

    56. -
      bool incremental_rehash(bool grow = true);
      +
      bool incremental_rehash(bool grow = true);

      Requires:

      Effects:

      Complexity:

      @@ -686,7 +686,7 @@

      grow

    57. -
      bool incremental_rehash(const bucket_traits & new_bucket_traits);
      +
      bool incremental_rehash(const bucket_traits & new_bucket_traits);

      Effects: If new_bucket_traits.bucket_count() is not this->bucket_count()/2 or this->bucket_count()*2, or this->split_bucket() != new_bucket_traits.bucket_count() returns false and does nothing.

      Otherwise, copy assigns new_bucket_traits to the internal bucket_traits and transfers all the objects from old buckets to the new ones.

      Complexity: Linear to size().

      @@ -694,7 +694,7 @@

      Note: this method is only available if incremental<true> option is activated.

    58. -
      size_type split_count() const;
      +
      size_type split_count() const;

      Requires: incremental<> option must be set

      Effects: returns the current split count

      Complexity: Constant

      @@ -703,11 +703,11 @@
    -

    -hashtable public static functions

    +

    +hashtable public static functions

    1. -
      static local_iterator s_local_iterator_to(reference value);
      +
      static local_iterator s_local_iterator_to(reference value);

      Requires: value must be an lvalue and shall be in a unordered_set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid local_iterator belonging to the unordered_set that points to the value

      Complexity: Constant.

      @@ -715,7 +715,7 @@

      Note: This static function is available only if the value traits is stateless.

    2. -
      static const_local_iterator s_local_iterator_to(const_reference value);
      +
      static const_local_iterator s_local_iterator_to(const_reference value);

      Requires: value must be an lvalue and shall be in a unordered_set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid const_local_iterator belonging to the unordered_set that points to the value

      Complexity: Constant.

      @@ -723,13 +723,13 @@

      Note: This static function is available only if the value traits is stateless.

    3. -
      static size_type suggested_upper_bucket_count(size_type n);
      +
      static size_type suggested_upper_bucket_count(size_type n);

      Effects: Returns the nearest new bucket count optimized for the container that is bigger or equal than n. This suggestion can be used to create bucket arrays with a size that will usually improve container's performance. If such value does not exist, the higher possible value is returned.

      Complexity: Amortized constant time.

      Throws: Nothing.

    4. -
      static size_type suggested_lower_bucket_count(size_type n);
      +
      static size_type suggested_lower_bucket_count(size_type n);

      Effects: Returns the nearest new bucket count optimized for the container that is smaller or equal than n. This suggestion can be used to create bucket arrays with a size that will usually improve container's performance. If such value does not exist, the lowest possible value is returned.

      Complexity: Amortized constant time.

      Throws: Nothing.

      diff --git a/doc/html/boost/intrusive/incremental.html b/doc/html/boost/intrusive/incremental.html index 5f1c6a8585..00bdaea605 100644 --- a/doc/html/boost/intrusive/incremental.html +++ b/doc/html/boost/intrusive/incremental.html @@ -36,7 +36,7 @@ struct incremental { };
    -

    Description

    +

    Description

    This option setter specifies if the hash container will use incremental hashing. With incremental hashing the cost of hash table expansion is spread out across each hash table insertion operation, as opposed to be incurred all at once. Therefore linear hashing is well suited for interactive applications or real-time appplications where the worst-case insertion time of non-incremental hash containers (rehashing the whole bucket array) is not admisible.

    diff --git a/doc/html/boost/intrusive/key_of_value.html b/doc/html/boost/intrusive/key_of_value.html index a786156c93..2f92833ba4 100644 --- a/doc/html/boost/intrusive/key_of_value.html +++ b/doc/html/boost/intrusive/key_of_value.html @@ -36,7 +36,7 @@ struct key_of_value { };
    -

    Description

    +

    Description

    This option setter specifies the a function object that specifies the type of the key of an associative container and an operator to obtain it from a value type.

    This function object must the define a key_type and a member with signature const key_type & operator()(const value_type &) const that will return the key from a value_type of an associative container

    diff --git a/doc/html/boost/intrusive/linear.html b/doc/html/boost/intrusive/linear.html index 71dc4703e5..5e351b1cb1 100644 --- a/doc/html/boost/intrusive/linear.html +++ b/doc/html/boost/intrusive/linear.html @@ -36,7 +36,7 @@ struct linear { };
    -

    Description

    +

    Description

    This option setter specifies if the slist container should use a linear implementation instead of a circular one.

    diff --git a/doc/html/boost/intrusive/linear_slist_algorithms.html b/doc/html/boost/intrusive/linear_slist_algorithms.html index e09d78f130..f87d0a9f07 100644 --- a/doc/html/boost/intrusive/linear_slist_algorithms.html +++ b/doc/html/boost/intrusive/linear_slist_algorithms.html @@ -41,27 +41,27 @@ typedef NodeTraits::const_node_ptr const_node_ptr; typedef NodeTraits node_traits; - // public static functions - static void init(const node_ptr &); - static bool unique(const_node_ptr); - static bool inited(const_node_ptr); - static void unlink_after(const node_ptr &); - static void unlink_after(const node_ptr &, const node_ptr &); - static void link_after(const node_ptr &, const node_ptr &); - static void transfer_after(const node_ptr &, const node_ptr &, + // public static functions + static void init(const node_ptr &); + static bool unique(const_node_ptr); + static bool inited(const_node_ptr); + static void unlink_after(const node_ptr &); + static void unlink_after(const node_ptr &, const node_ptr &); + static void link_after(const node_ptr &, const node_ptr &); + static void transfer_after(const node_ptr &, const node_ptr &, const node_ptr &); - static void init_header(const node_ptr &); - static node_ptr get_previous_node(const node_ptr &, const node_ptr &); - static std::size_t count(const const_node_ptr &); - static void swap_trailing_nodes(const node_ptr &, const node_ptr &); - static node_ptr reverse(const node_ptr &); + static void init_header(const node_ptr &); + static node_ptr get_previous_node(const node_ptr &, const node_ptr &); + static std::size_t count(const const_node_ptr &); + static void swap_trailing_nodes(const node_ptr &, const node_ptr &); + static node_ptr reverse(const node_ptr &); static std::pair< node_ptr, node_ptr > - move_first_n_backwards(const node_ptr &, std::size_t); + move_first_n_backwards(const node_ptr &, std::size_t); static std::pair< node_ptr, node_ptr > - move_first_n_forward(const node_ptr &, std::size_t); + move_first_n_forward(const node_ptr &, std::size_t); };
    -

    Description

    +

    Description

    linear_slist_algorithms provides basic algorithms to manipulate nodes forming a linear singly linked list.

    linear_slist_algorithms is configured with a NodeTraits class, which encapsulates the information about the node to be manipulated. NodeTraits must support the following interface:

    Typedefs:

    @@ -72,37 +72,37 @@

    static node_ptr get_next(const_node_ptr n);

    static void set_next(node_ptr n, node_ptr next);

    -

    -linear_slist_algorithms public static functions

    +

    +linear_slist_algorithms public static functions

    1. -
      static void init(const node_ptr & this_node);
      +
      static void init(const node_ptr & this_node);

      Effects: Constructs an non-used list element, putting the next pointer to null: NodeTraits::get_next(this_node) == node_ptr()

      Complexity: Constant

      Throws: Nothing.

    2. -
      static bool unique(const_node_ptr this_node);
      +
      static bool unique(const_node_ptr this_node);

      Requires: this_node must be in a circular list or be an empty circular list.

      Effects: Returns true is "this_node" is the only node of a circular list: or it's a not inserted node: return node_ptr() == NodeTraits::get_next(this_node) || NodeTraits::get_next(this_node) == this_node

      Complexity: Constant

      Throws: Nothing.

    3. -
      static bool inited(const_node_ptr this_node);
      +
      static bool inited(const_node_ptr this_node);

      Effects: Returns true is "this_node" has the same state as if it was inited using "init(node_ptr)"

      Complexity: Constant

      Throws: Nothing.

    4. -
      static void unlink_after(const node_ptr & prev_node);
      +
      static void unlink_after(const node_ptr & prev_node);

      Requires: prev_node must be in a circular list or be an empty circular list.

      Effects: Unlinks the next node of prev_node from the circular list.

      Complexity: Constant

      Throws: Nothing.

    5. -
      static void unlink_after(const node_ptr & prev_node, 
+
      static void unlink_after(const node_ptr & prev_node, 
                          const node_ptr & last_node);
      
 
      Requires: prev_node and last_node must be in a circular list or be an empty circular list.
      
 
      Effects: Unlinks the range (prev_node, last_node) from the linear list.
      
@@ -110,14 +110,14 @@
 
      Throws: Nothing.
    6. -
      static void link_after(const node_ptr & prev_node, const node_ptr & this_node);
      +
      static void link_after(const node_ptr & prev_node, const node_ptr & this_node);

      Requires: prev_node must be a node of a linear list.

      Effects: Links this_node after prev_node in the linear list.

      Complexity: Constant

      Throws: Nothing.

    7. -
      static void transfer_after(const node_ptr & p, const node_ptr & b, 
+
      static void transfer_after(const node_ptr & p, const node_ptr & b, 
                            const node_ptr & e);
      
 
      Requires: b and e must be nodes of the same linear list or an empty range. and p must be a node of a different linear list.
      
 
      Effects: Removes the nodes from (b, e] range from their linear list and inserts them after p in p's linear list.
      
@@ -125,28 +125,28 @@
 
      Throws: Nothing.
    8. -
      static void init_header(const node_ptr & this_node);
      +
      static void init_header(const node_ptr & this_node);

      Effects: Constructs an empty list, making this_node the only node of the circular list: NodeTraits::get_next(this_node) == this_node.

      Complexity: Constant

      Throws: Nothing. 

    9. static node_ptr 
-get_previous_node(const node_ptr & prev_init_node, const node_ptr & this_node);
      +get_previous_node(const node_ptr & prev_init_node, const node_ptr & this_node);

      Requires: this_node and prev_init_node must be in the same linear list.

      Effects: Returns the previous node of this_node in the linear list starting. the search from prev_init_node. The first node checked for equality is NodeTraits::get_next(prev_init_node).

      Complexity: Linear to the number of elements between prev_init_node and this_node.

      Throws: Nothing.

    10. -
      static std::size_t count(const const_node_ptr & this_node);
      +
      static std::size_t count(const const_node_ptr & this_node);

      Requires: this_node must be in a linear list or be an empty linear list.

      Effects: Returns the number of nodes in a linear list. If the linear list is empty, returns 1.

      Complexity: Linear

      Throws: Nothing.

    11. -
      static void swap_trailing_nodes(const node_ptr & this_node, 
+
      static void swap_trailing_nodes(const node_ptr & this_node, 
                                 const node_ptr & other_node);
      
 
      Requires: this_node and other_node must be nodes inserted in linear lists or be empty linear lists.
      
 
      Effects: Moves all the nodes previously chained after this_node after other_node and vice-versa.
      
@@ -154,7 +154,7 @@
 
      Throws: Nothing.
    12. -
      static node_ptr reverse(const node_ptr & p);
      +
      static node_ptr reverse(const node_ptr & p);

      Effects: Reverses the order of elements in the list.

      Returns: The new first node of the list.

      Throws: Nothing.

      @@ -162,7 +162,7 @@ 
    13. static std::pair< node_ptr, node_ptr > 
-move_first_n_backwards(const node_ptr & p, std::size_t n);
      +move_first_n_backwards(const node_ptr & p, std::size_t n);

      Effects: Moves the first n nodes starting at p to the end of the list.

      Returns: A pair containing the new first and last node of the list or if there has been any movement, a null pair if n leads to no movement.

      Throws: Nothing.

      @@ -170,7 +170,7 @@ 
    14. static std::pair< node_ptr, node_ptr > 
-move_first_n_forward(const node_ptr & p, std::size_t n);
      +move_first_n_forward(const node_ptr & p, std::size_t n);

      Effects: Moves the first n nodes starting at p to the beginning of the list.

      Returns: A pair containing the new first and last node of the list or if there has been any movement, a null pair if n leads to no movement.

      Throws: Nothing.

      diff --git a/doc/html/boost/intrusive/link_mode.html b/doc/html/boost/intrusive/link_mode.html index ecf6cb8d7d..da05fd651c 100644 --- a/doc/html/boost/intrusive/link_mode.html +++ b/doc/html/boost/intrusive/link_mode.html @@ -36,7 +36,7 @@ struct link_mode { };
    -

    Description

    +

    Description

    This option setter specifies the link mode (normal_link, safe_link or auto_unlink)

    diff --git a/doc/html/boost/intrusive/link_mode_type.html b/doc/html/boost/intrusive/link_mode_type.html index b15461e8d6..153efa1cbf 100644 --- a/doc/html/boost/intrusive/link_mode_type.html +++ b/doc/html/boost/intrusive/link_mode_type.html @@ -35,7 +35,7 @@ enum link_mode_type { normal_link, safe_link, auto_unlink };
    -

    Description

    +

    Description

    This enumeration defines the type of value_traits that can be defined for Boost.Intrusive containers

    normal_link
    diff --git a/doc/html/boost/intrusive/list.html b/doc/html/boost/intrusive/list.html index 4d8788b384..11b26f0acb 100644 --- a/doc/html/boost/intrusive/list.html +++ b/doc/html/boost/intrusive/list.html @@ -56,89 +56,89 @@ typedef unspecified header_holder_type; // construct/copy/destruct - explicit list(const value_traits & = value_traits()); + explicit list(const value_traits & = value_traits()); template<typename Iterator> - list(Iterator, Iterator, const value_traits & = value_traits()); - list(list &&); - list & operator=(list &&); - ~list(); + list(Iterator, Iterator, const value_traits & = value_traits()); + list(list &&); + list & operator=(list &&); + ~list(); - // public member functions - void push_back(reference); - void push_front(reference); - void pop_back(); - template<typename Disposer> void pop_back_and_dispose(Disposer); - void pop_front(); - template<typename Disposer> void pop_front_and_dispose(Disposer); - reference front(); - const_reference front() const; - reference back(); - const_reference back() const; - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end(); - const_iterator end() const; - const_iterator cend() const; - reverse_iterator rbegin(); - const_reverse_iterator rbegin() const; - const_reverse_iterator crbegin() const; - reverse_iterator rend(); - const_reverse_iterator rend() const; - const_reverse_iterator crend() const; - size_type size() const; - bool empty() const; - void swap(list &); - void shift_backwards(size_type = 1); - void shift_forward(size_type = 1); - iterator erase(const_iterator); - iterator erase(const_iterator, const_iterator); - iterator erase(const_iterator, const_iterator, size_type); + // public member functions + void push_back(reference); + void push_front(reference); + void pop_back(); + template<typename Disposer> void pop_back_and_dispose(Disposer); + void pop_front(); + template<typename Disposer> void pop_front_and_dispose(Disposer); + reference front(); + const_reference front() const; + reference back(); + const_reference back() const; + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end(); + const_iterator end() const; + const_iterator cend() const; + reverse_iterator rbegin(); + const_reverse_iterator rbegin() const; + const_reverse_iterator crbegin() const; + reverse_iterator rend(); + const_reverse_iterator rend() const; + const_reverse_iterator crend() const; + size_type size() const; + bool empty() const; + void swap(list &); + void shift_backwards(size_type = 1); + void shift_forward(size_type = 1); + iterator erase(const_iterator); + iterator erase(const_iterator, const_iterator); + iterator erase(const_iterator, const_iterator, size_type); template<typename Disposer> - iterator erase_and_dispose(const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, Disposer); template<typename Disposer> - iterator erase_and_dispose(const_iterator, const_iterator, Disposer); - void clear(); - template<typename Disposer> void clear_and_dispose(Disposer); + iterator erase_and_dispose(const_iterator, const_iterator, Disposer); + void clear(); + template<typename Disposer> void clear_and_dispose(Disposer); template<typename Cloner, typename Disposer> - void clone_from(const list &, Cloner, Disposer); + void clone_from(const list &, Cloner, Disposer); template<typename Cloner, typename Disposer> - void clone_from(list &&, Cloner, Disposer); - iterator insert(const_iterator, reference); - template<typename Iterator> void insert(const_iterator, Iterator, Iterator); - template<typename Iterator> void assign(Iterator, Iterator); + void clone_from(list &&, Cloner, Disposer); + iterator insert(const_iterator, reference); + template<typename Iterator> void insert(const_iterator, Iterator, Iterator); + template<typename Iterator> void assign(Iterator, Iterator); template<typename Iterator, typename Disposer> - void dispose_and_assign(Disposer, Iterator, Iterator); - void splice(const_iterator, list &); - void splice(const_iterator, list &, const_iterator); - void splice(const_iterator, list &, const_iterator, const_iterator); - void splice(const_iterator, list &, const_iterator, const_iterator, + void dispose_and_assign(Disposer, Iterator, Iterator); + void splice(const_iterator, list &); + void splice(const_iterator, list &, const_iterator); + void splice(const_iterator, list &, const_iterator, const_iterator); + void splice(const_iterator, list &, const_iterator, const_iterator, size_type); - void sort(); - template<typename Predicate> void sort(Predicate); - void merge(list &); - template<typename Predicate> void merge(list &, Predicate); - void reverse(); - void remove(const_reference); + void sort(); + template<typename Predicate> void sort(Predicate); + void merge(list &); + template<typename Predicate> void merge(list &, Predicate); + void reverse(); + void remove(const_reference); template<typename Disposer> - void remove_and_dispose(const_reference, Disposer); - template<typename Pred> void remove_if(Pred); + void remove_and_dispose(const_reference, Disposer); + template<typename Pred> void remove_if(Pred); template<typename Pred, typename Disposer> - void remove_and_dispose_if(Pred, Disposer); - void unique(); - template<typename BinaryPredicate> void unique(BinaryPredicate); - template<typename Disposer> void unique_and_dispose(Disposer); + void remove_and_dispose_if(Pred, Disposer); + void unique(); + template<typename BinaryPredicate> void unique(BinaryPredicate); + template<typename Disposer> void unique_and_dispose(Disposer); template<typename BinaryPredicate, typename Disposer> - void unique_and_dispose(BinaryPredicate, Disposer); - iterator iterator_to(reference); - const_iterator iterator_to(const_reference) const; - void check() const; + void unique_and_dispose(BinaryPredicate, Disposer); + iterator iterator_to(reference); + const_iterator iterator_to(const_reference) const; + void check() const; - // public static functions - static list & container_from_end_iterator(iterator); - static const list & container_from_end_iterator(const_iterator); - static iterator s_iterator_to(reference); - static const_iterator s_iterator_to(const_reference); + // public static functions + static list & container_from_end_iterator(iterator); + static const list & container_from_end_iterator(const_iterator); + static iterator s_iterator_to(reference); + static const_iterator s_iterator_to(const_reference); // public data members static const bool constant_time_size; @@ -146,51 +146,51 @@ static const bool has_container_from_iterator; };
    -

    Description

    +

    Description

    The class template list is an intrusive container that mimics most of the interface of std::list as described in the C++ standard.

    The template parameter T is the type to be managed by the container. The user can specify additional options and if no options are provided default options are used.

    The container supports the following options: base_hook<>/member_hook<>/value_traits<>, constant_time_size<> and size_type<>.

    -

    +

    list public construct/copy/destruct

    1. -
      explicit list(const value_traits & v_traits = value_traits());
      +
      explicit list(const value_traits & v_traits = value_traits());

      Effects: constructs an empty list.

      Complexity: Constant

      Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks). 

    2. template<typename Iterator> 
-  list(Iterator b, Iterator e, const value_traits & v_traits = value_traits());
      + list(Iterator b, Iterator e, const value_traits & v_traits = value_traits());

      Requires: Dereferencing iterator must yield an lvalue of type value_type.

      Effects: Constructs a list equal to the range [first,last).

      Complexity: Linear in distance(b, e). No copy constructors are called.

      Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks).

    3. -
      list(list && x);
      +
      list(list && x);

      Effects: to-do

    4. -
      list & operator=(list && x);
      +
      list & operator=(list && x);

      Effects: to-do

    5. -
      ~list();
      +
      ~list();

      Effects: If it's not a safe-mode or an auto-unlink value_type the destructor does nothing (ie. no code is generated). Otherwise it detaches all elements from this. In this case the objects in the list are not deleted (i.e. no destructors are called), but the hooks according to the ValueTraits template parameter are set to their default value.

      Complexity: Linear to the number of elements in the list, if it's a safe-mode or auto-unlink value . Otherwise constant.

    -

    -list public member functions

    +

    +list public member functions

    1. -
      void push_back(reference value);
      +
      void push_back(reference value);

      Requires: value must be an lvalue.

      Effects: Inserts the value in the back of the list. No copy constructors are called.

      Throws: Nothing.

      @@ -198,7 +198,7 @@

      Note: Does not affect the validity of iterators and references.

    2. -
      void push_front(reference value);
      +
      void push_front(reference value);

      Requires: value must be an lvalue.

      Effects: Inserts the value in the front of the list. No copy constructors are called.

      Throws: Nothing.

      @@ -206,14 +206,14 @@

      Note: Does not affect the validity of iterators and references.

    3. -
      void pop_back();
      +
      void pop_back();

      Effects: Erases the last element of the list. No destructors are called.

      Throws: Nothing.

      Complexity: Constant.

      Note: Invalidates the iterators (but not the references) to the erased element.

    4. -
      template<typename Disposer> void pop_back_and_dispose(Disposer disposer);
      +
      template<typename Disposer> void pop_back_and_dispose(Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases the last element of the list. No destructors are called. Disposer::operator()(pointer) is called for the removed element.

      Throws: Nothing.

      @@ -221,14 +221,14 @@

      Note: Invalidates the iterators to the erased element.

    5. -
      void pop_front();
      +
      void pop_front();

      Effects: Erases the first element of the list. No destructors are called.

      Throws: Nothing.

      Complexity: Constant.

      Note: Invalidates the iterators (but not the references) to the erased element.

    6. -
      template<typename Disposer> void pop_front_and_dispose(Disposer disposer);
      +
      template<typename Disposer> void pop_front_and_dispose(Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases the first element of the list. No destructors are called. Disposer::operator()(pointer) is called for the removed element.

      Throws: Nothing.

      @@ -236,138 +236,138 @@

      Note: Invalidates the iterators to the erased element.

    7. -
      reference front();
      +
      reference front();

      Effects: Returns a reference to the first element of the list.

      Throws: Nothing.

      Complexity: Constant.

    8. -
      const_reference front() const;
      +
      const_reference front() const;

      Effects: Returns a const_reference to the first element of the list.

      Throws: Nothing.

      Complexity: Constant.

    9. -
      reference back();
      +
      reference back();

      Effects: Returns a reference to the last element of the list.

      Throws: Nothing.

      Complexity: Constant.

    10. -
      const_reference back() const;
      +
      const_reference back() const;

      Effects: Returns a const_reference to the last element of the list.

      Throws: Nothing.

      Complexity: Constant.

    11. -
      iterator begin();
      +
      iterator begin();

      Effects: Returns an iterator to the first element contained in the list.

      Throws: Nothing.

      Complexity: Constant.

    12. -
      const_iterator begin() const;
      +
      const_iterator begin() const;

      Effects: Returns a const_iterator to the first element contained in the list.

      Throws: Nothing.

      Complexity: Constant.

    13. -
      const_iterator cbegin() const;
      +
      const_iterator cbegin() const;

      Effects: Returns a const_iterator to the first element contained in the list.

      Throws: Nothing.

      Complexity: Constant.

    14. -
      iterator end();
      +
      iterator end();

      Effects: Returns an iterator to the end of the list.

      Throws: Nothing.

      Complexity: Constant.

    15. -
      const_iterator end() const;
      +
      const_iterator end() const;

      Effects: Returns a const_iterator to the end of the list.

      Throws: Nothing.

      Complexity: Constant.

    16. -
      const_iterator cend() const;
      +
      const_iterator cend() const;

      Effects: Returns a constant iterator to the end of the list.

      Throws: Nothing.

      Complexity: Constant.

    17. -
      reverse_iterator rbegin();
      +
      reverse_iterator rbegin();

      Effects: Returns a reverse_iterator pointing to the beginning of the reversed list.

      Throws: Nothing.

      Complexity: Constant.

    18. -
      const_reverse_iterator rbegin() const;
      +
      const_reverse_iterator rbegin() const;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed list.

      Throws: Nothing.

      Complexity: Constant.

    19. -
      const_reverse_iterator crbegin() const;
      +
      const_reverse_iterator crbegin() const;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed list.

      Throws: Nothing.

      Complexity: Constant.

    20. -
      reverse_iterator rend();
      +
      reverse_iterator rend();

      Effects: Returns a reverse_iterator pointing to the end of the reversed list.

      Throws: Nothing.

      Complexity: Constant.

    21. -
      const_reverse_iterator rend() const;
      +
      const_reverse_iterator rend() const;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed list.

      Throws: Nothing.

      Complexity: Constant.

    22. -
      const_reverse_iterator crend() const;
      +
      const_reverse_iterator crend() const;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed list.

      Throws: Nothing.

      Complexity: Constant.

    23. -
      size_type size() const;
      +
      size_type size() const;

      Effects: Returns the number of the elements contained in the list.

      Throws: Nothing.

      Complexity: Linear to the number of elements contained in the list. if constant-time size option is disabled. Constant time otherwise.

      Note: Does not affect the validity of iterators and references.

    24. -
      bool empty() const;
      +
      bool empty() const;

      Effects: Returns true if the list contains no elements.

      Throws: Nothing.

      Complexity: Constant.

      Note: Does not affect the validity of iterators and references.

    25. -
      void swap(list & other);
      +
      void swap(list & other);

      Effects: Swaps the elements of x and *this.

      Throws: Nothing.

      Complexity: Constant.

      Note: Does not affect the validity of iterators and references.

    26. -
      void shift_backwards(size_type n = 1);
      +
      void shift_backwards(size_type n = 1);

      Effects: Moves backwards all the elements, so that the first element becomes the second, the second becomes the third... the last element becomes the first one.

      Throws: Nothing.

      Complexity: Linear to the number of shifts.

      Note: Does not affect the validity of iterators and references.

    27. -
      void shift_forward(size_type n = 1);
      +
      void shift_forward(size_type n = 1);

      Effects: Moves forward all the elements, so that the second element becomes the first, the third becomes the second... the first element becomes the last one.

      Throws: Nothing.

      Complexity: Linear to the number of shifts.

      Note: Does not affect the validity of iterators and references.

    28. -
      iterator erase(const_iterator i);
      +
      iterator erase(const_iterator i);

      Effects: Erases the element pointed by i of the list. No destructors are called.

      Returns: the first element remaining beyond the removed element, or end() if no such element exists.

      Throws: Nothing.

      @@ -375,7 +375,7 @@

      Note: Invalidates the iterators (but not the references) to the erased element.

    29. -
      iterator erase(const_iterator b, const_iterator e);
      +
      iterator erase(const_iterator b, const_iterator e);

      Requires: b and e must be valid iterators to elements in *this.

      Effects: Erases the element range pointed by b and e No destructors are called.

      Returns: the first element remaining beyond the removed elements, or end() if no such element exists.

      @@ -384,7 +384,7 @@

      Note: Invalidates the iterators (but not the references) to the erased elements.

    30. -
      iterator erase(const_iterator b, const_iterator e, size_type n);
      +
      iterator erase(const_iterator b, const_iterator e, size_type n);

      Requires: b and e must be valid iterators to elements in *this. n must be distance(b, e).

      Effects: Erases the element range pointed by b and e No destructors are called.

      Returns: the first element remaining beyond the removed elements, or end() if no such element exists.

      @@ -394,7 +394,7 @@ 
    31. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator i, Disposer disposer);
      + iterator erase_and_dispose(const_iterator i, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases the element pointed by i of the list. No destructors are called. Disposer::operator()(pointer) is called for the removed element.

      Returns: the first element remaining beyond the removed element, or end() if no such element exists.

      @@ -404,7 +404,7 @@ 
    32. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator b, const_iterator e, 
+  iterator erase_and_dispose(const_iterator b, const_iterator e, 
                              Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases the element range pointed by b and e No destructors are called. Disposer::operator()(pointer) is called for the removed elements.

      @@ -414,14 +414,14 @@

      Note: Invalidates the iterators to the erased elements.

    33. -
      void clear();
      +
      void clear();

      Effects: Erases all the elements of the container. No destructors are called.

      Throws: Nothing.

      Complexity: Linear to the number of elements of the list. if it's a safe-mode or auto-unlink value_type. Constant time otherwise.

      Note: Invalidates the iterators (but not the references) to the erased elements.

    34. -
      template<typename Disposer> void clear_and_dispose(Disposer disposer);
      +
      template<typename Disposer> void clear_and_dispose(Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases all the elements of the container. No destructors are called. Disposer::operator()(pointer) is called for the removed elements.

      Throws: Nothing.

      @@ -430,7 +430,7 @@ 
    35. template<typename Cloner, typename Disposer> 
-  void clone_from(const list & src, Cloner cloner, Disposer disposer);
      + void clone_from(const list & src, Cloner cloner, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

      Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(const_reference ) and inserts them on *this.

      If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

      @@ -439,7 +439,7 @@ 
    36. template<typename Cloner, typename Disposer> 
-  void clone_from(list && src, Cloner cloner, Disposer disposer);
      + void clone_from(list && src, Cloner cloner, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

      Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(reference) and inserts them on *this.

      If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

      @@ -447,7 +447,7 @@

      Throws: If cloner throws. Basic guarantee.

    37. -
      iterator insert(const_iterator p, reference value);
      +
      iterator insert(const_iterator p, reference value);

      Requires: value must be an lvalue and p must be a valid iterator of *this.

      Effects: Inserts the value before the position pointed by p.

      Returns: An iterator to the inserted element.

      @@ -457,7 +457,7 @@ 
    38. template<typename Iterator> 
-  void insert(const_iterator p, Iterator b, Iterator e);
      + void insert(const_iterator p, Iterator b, Iterator e);

      Requires: Dereferencing iterator must yield an lvalue of type value_type and p must be a valid iterator of *this.

      Effects: Inserts the range pointed by b and e before the position p. No copy constructors are called.

      Throws: Nothing.

      @@ -465,7 +465,7 @@

      Note: Does not affect the validity of iterators and references.

    39. -
      template<typename Iterator> void assign(Iterator b, Iterator e);
      +
      template<typename Iterator> void assign(Iterator b, Iterator e);

      Requires: Dereferencing iterator must yield an lvalue of type value_type.

      Effects: Clears the list and inserts the range pointed by b and e. No destructors or copy constructors are called.

      Throws: Nothing.

      @@ -474,7 +474,7 @@ 
    40. template<typename Iterator, typename Disposer> 
-  void dispose_and_assign(Disposer disposer, Iterator b, Iterator e);
      + void dispose_and_assign(Disposer disposer, Iterator b, Iterator e);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Requires: Dereferencing iterator must yield an lvalue of type value_type.

      Effects: Clears the list and inserts the range pointed by b and e. No destructors or copy constructors are called. Disposer::operator()(pointer) is called for the removed elements.

      @@ -483,7 +483,7 @@

      Note: Invalidates the iterators (but not the references) to the erased elements.

    41. -
      void splice(const_iterator p, list & x);
      +
      void splice(const_iterator p, list & x);

      Requires: p must be a valid iterator of *this.

      Effects: Transfers all the elements of list x to this list, before the the element pointed by p. No destructors or copy constructors are called.

      Throws: Nothing.

      @@ -491,7 +491,7 @@

      Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.

    42. -
      void splice(const_iterator p, list & x, const_iterator new_ele);
      +
      void splice(const_iterator p, list & x, const_iterator new_ele);

      Requires: p must be a valid iterator of *this. new_ele must point to an element contained in list x.

      Effects: Transfers the value pointed by new_ele, from list x to this list, before the element pointed by p. No destructors or copy constructors are called. If p == new_ele or p == ++new_ele, this function is a null operation.

      Throws: Nothing.

      @@ -499,7 +499,7 @@

      Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.

    43. -
      void splice(const_iterator p, list & x, const_iterator f, const_iterator e);
      +
      void splice(const_iterator p, list & x, const_iterator f, const_iterator e);

      Requires: p must be a valid iterator of *this. f and e must point to elements contained in list x.

      Effects: Transfers the range pointed by f and e from list x to this list, before the element pointed by p. No destructors or copy constructors are called.

      Throws: Nothing.

      @@ -507,7 +507,7 @@

      Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.

    44. -
      void splice(const_iterator p, list & x, const_iterator f, const_iterator e, 
+
      void splice(const_iterator p, list & x, const_iterator f, const_iterator e, 
             size_type n);
      
 
      Requires: p must be a valid iterator of *this. f and e must point to elements contained in list x. n == distance(f, e)
      
 
      Effects: Transfers the range pointed by f and e from list x to this list, before the element pointed by p. No destructors or copy constructors are called.
      
@@ -516,14 +516,14 @@
 
      Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.
    45. -
      void sort();
      +
      void sort();

      Effects: This function sorts the list *this according to std::less<value_type>. The sort is stable, that is, the relative order of equivalent elements is preserved.

      Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or std::less<value_type> throws. Basic guarantee.

      Notes: Iterators and references are not invalidated.

      Complexity: The number of comparisons is approximately N log N, where N is the list's size.

    46. -
      template<typename Predicate> void sort(Predicate p);
      +
      template<typename Predicate> void sort(Predicate p);

      Requires: p must be a comparison function that induces a strict weak ordering

      Effects: This function sorts the list *this according to p. The sort is stable, that is, the relative order of equivalent elements is preserved.

      Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the predicate throws. Basic guarantee.

      @@ -531,14 +531,14 @@

      Complexity: The number of comparisons is approximately N log N, where N is the list's size.

    47. -
      void merge(list & x);
      +
      void merge(list & x);

      Effects: This function removes all of x's elements and inserts them in order into *this according to std::less<value_type>. The merge is stable; that is, if an element from *this is equivalent to one from x, then the element from *this will precede the one from x.

      Throws: If std::less<value_type> throws. Basic guarantee.

      Complexity: This function is linear time: it performs at most size() + x.size() - 1 comparisons.

      Note: Iterators and references are not invalidated

    48. -
      template<typename Predicate> void merge(list & x, Predicate p);
      +
      template<typename Predicate> void merge(list & x, Predicate p);

      Requires: p must be a comparison function that induces a strict weak ordering and both *this and x must be sorted according to that ordering The lists x and *this must be distinct.

      Effects: This function removes all of x's elements and inserts them in order into *this. The merge is stable; that is, if an element from *this is equivalent to one from x, then the element from *this will precede the one from x.

      Throws: If the predicate throws. Basic guarantee.

      @@ -546,14 +546,14 @@

      Note: Iterators and references are not invalidated.

    49. -
      void reverse();
      +
      void reverse();

      Effects: Reverses the order of elements in the list.

      Throws: Nothing.

      Complexity: This function is linear time.

      Note: Iterators and references are not invalidated

    50. -
      void remove(const_reference value);
      +
      void remove(const_reference value);

      Effects: Removes all the elements that compare equal to value. No destructors are called.

      Throws: If std::equal_to<value_type> throws. Basic guarantee.

      Complexity: Linear time. It performs exactly size() comparisons for equality.

      @@ -561,7 +561,7 @@ 
    51. template<typename Disposer> 
-  void remove_and_dispose(const_reference value, Disposer disposer);
      + void remove_and_dispose(const_reference value, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Removes all the elements that compare equal to value. Disposer::operator()(pointer) is called for every removed element.

      Throws: If std::equal_to<value_type> throws. Basic guarantee.

      @@ -569,7 +569,7 @@

      Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid.

    52. -
      template<typename Pred> void remove_if(Pred pred);
      +
      template<typename Pred> void remove_if(Pred pred);

      Effects: Removes all the elements for which a specified predicate is satisfied. No destructors are called.

      Throws: If pred throws. Basic guarantee.

      Complexity: Linear time. It performs exactly size() calls to the predicate.

      @@ -577,7 +577,7 @@ 
    53. template<typename Pred, typename Disposer> 
-  void remove_and_dispose_if(Pred pred, Disposer disposer);
      + void remove_and_dispose_if(Pred pred, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Removes all the elements for which a specified predicate is satisfied. Disposer::operator()(pointer) is called for every removed element.

      Throws: If pred throws. Basic guarantee.

      @@ -585,21 +585,21 @@

      Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid.

    54. -
      void unique();
      +
      void unique();

      Effects: Removes adjacent duplicate elements or adjacent elements that are equal from the list. No destructors are called.

      Throws: If std::equal_to<value_type throws. Basic guarantee.

      Complexity: Linear time (size()-1 comparisons calls to pred()).

      Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid.

    55. -
      template<typename BinaryPredicate> void unique(BinaryPredicate pred);
      +
      template<typename BinaryPredicate> void unique(BinaryPredicate pred);

      Effects: Removes adjacent duplicate elements or adjacent elements that satisfy some binary predicate from the list. No destructors are called.

      Throws: If pred throws. Basic guarantee.

      Complexity: Linear time (size()-1 comparisons equality comparisons).

      Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid.

    56. -
      template<typename Disposer> void unique_and_dispose(Disposer disposer);
      +
      template<typename Disposer> void unique_and_dispose(Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Removes adjacent duplicate elements or adjacent elements that are equal from the list. Disposer::operator()(pointer) is called for every removed element.

      Throws: If std::equal_to<value_type throws. Basic guarantee.

      @@ -608,7 +608,7 @@ 
    57. template<typename BinaryPredicate, typename Disposer> 
-  void unique_and_dispose(BinaryPredicate pred, Disposer disposer);
      + void unique_and_dispose(BinaryPredicate pred, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Removes adjacent duplicate elements or adjacent elements that satisfy some binary predicate from the list. Disposer::operator()(pointer) is called for every removed element.

      Throws: If pred throws. Basic guarantee.

      @@ -616,7 +616,7 @@

      Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid.

    58. -
      iterator iterator_to(reference value);
      +
      iterator iterator_to(reference value);

      Requires: value must be a reference to a value inserted in a list.

      Effects: This function returns a const_iterator pointing to the element

      Throws: Nothing.

      @@ -624,7 +624,7 @@

      Note: Iterators and references are not invalidated.

    59. -
      const_iterator iterator_to(const_reference value) const;
      +
      const_iterator iterator_to(const_reference value) const;

      Requires: value must be a const reference to a value inserted in a list.

      Effects: This function returns an iterator pointing to the element.

      Throws: Nothing.

      @@ -632,7 +632,7 @@

      Note: Iterators and references are not invalidated.

    60. -
      void check() const;
      +
      void check() const;

      Effects: Asserts the integrity of the container.

      Complexity: Linear time.

      Note: The method has no effect when asserts are turned off (e.g., with NDEBUG). Experimental function, interface might change in future versions.

      @@ -640,25 +640,25 @@
    -

    -list public static functions

    +

    +list public static functions

    1. -
      static list & container_from_end_iterator(iterator end_iterator);
      +
      static list & container_from_end_iterator(iterator end_iterator);

      Precondition: end_iterator must be a valid end iterator of list.

      Effects: Returns a const reference to the list associated to the end iterator

      Throws: Nothing.

      Complexity: Constant.

    2. -
      static const list & container_from_end_iterator(const_iterator end_iterator);
      +
      static const list & container_from_end_iterator(const_iterator end_iterator);

      Precondition: end_iterator must be a valid end const_iterator of list.

      Effects: Returns a const reference to the list associated to the end iterator

      Throws: Nothing.

      Complexity: Constant.

    3. -
      static iterator s_iterator_to(reference value);
      +
      static iterator s_iterator_to(reference value);

      Requires: value must be a reference to a value inserted in a list.

      Effects: This function returns a const_iterator pointing to the element

      Throws: Nothing.

      @@ -666,7 +666,7 @@

      Note: Iterators and references are not invalidated. This static function is available only if the value traits is stateless.

    4. -
      static const_iterator s_iterator_to(const_reference value);
      +
      static const_iterator s_iterator_to(const_reference value);

      Requires: value must be a const reference to a value inserted in a list.

      Effects: This function returns an iterator pointing to the element.

      Throws: Nothing.

      diff --git a/doc/html/boost/intrusive/list_base_hook.html b/doc/html/boost/intrusive/list_base_hook.html index a45f6ec757..221487d1ce 100644 --- a/doc/html/boost/intrusive/list_base_hook.html +++ b/doc/html/boost/intrusive/list_base_hook.html @@ -36,71 +36,71 @@ class list_base_hook : public make_list_base_hook::type< O1, O2, O3 > { public: // construct/copy/destruct - list_base_hook(); - list_base_hook(const list_base_hook &); - list_base_hook & operator=(const list_base_hook &); - ~list_base_hook(); + list_base_hook(); + list_base_hook(const list_base_hook &); + list_base_hook & operator=(const list_base_hook &); + ~list_base_hook(); - // public member functions - void swap_nodes(list_base_hook &); - bool is_linked() const; - void unlink(); + // public member functions + void swap_nodes(list_base_hook &); + bool is_linked() const; + void unlink(); };
    -

    Description

    +

    Description

    Derive a class from this hook in order to store objects of that class in an list.

    The hook admits the following options: tag<>, void_pointer<> and link_mode<>.

    tag<> defines a tag to identify the node. The same tag value can be used in different classes, but if a class is derived from more than one list_base_hook, then each list_base_hook needs its unique tag.

    link_mode<> will specify the linking mode of the hook (normal_link, auto_unlink or safe_link).

    void_pointer<> is the pointer type that will be used internally in the hook and the container configured to use this hook.

    -

    +

    list_base_hook public construct/copy/destruct

    1. -
      list_base_hook();
      +
      list_base_hook();

      Effects: If link_mode is auto_unlink or safe_link initializes the node to an unlinked state.

      Throws: Nothing.

    2. -
      list_base_hook(const list_base_hook &);
      +
      list_base_hook(const list_base_hook &);

      Effects: If link_mode is auto_unlink or safe_link initializes the node to an unlinked state. The argument is ignored.

      Throws: Nothing.

      Rationale: Providing a copy-constructor makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

    3. -
      list_base_hook & operator=(const list_base_hook &);
      +
      list_base_hook & operator=(const list_base_hook &);

      Effects: Empty function. The argument is ignored.

      Throws: Nothing.

      Rationale: Providing an assignment operator makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

    4. -
      ~list_base_hook();
      +
      ~list_base_hook();

      Effects: If link_mode is normal_link, the destructor does nothing (ie. no code is generated). If link_mode is safe_link and the object is stored in an list an assertion is raised. If link_mode is auto_unlink and is_linked() is true, the node is unlinked.

      Throws: Nothing.

    -

    -list_base_hook public member functions

    +

    +list_base_hook public member functions

    1. -
      void swap_nodes(list_base_hook & other);
      +
      void swap_nodes(list_base_hook & other);

      Effects: Swapping two nodes swaps the position of the elements related to those nodes in one or two containers. That is, if the node this is part of the element e1, the node x is part of the element e2 and both elements are included in the containers s1 and s2, then after the swap-operation e1 is in s2 at the position of e2 and e2 is in s1 at the position of e1. If one element is not in a container, then after the swap-operation the other element is not in a container. Iterators to e1 and e2 related to those nodes are invalidated.

      Complexity: Constant

      Throws: Nothing.

    2. -
      bool is_linked() const;
      +
      bool is_linked() const;

      Precondition: link_mode must be safe_link or auto_unlink.

      Returns: true, if the node belongs to a container, false otherwise. This function can be used to test whether list::iterator_to will return a valid iterator.

      Complexity: Constant

    3. -
      void unlink();
      +
      void unlink();

      Effects: Removes the node if it's inserted in a container. This function is only allowed if link_mode is auto_unlink.

      Throws: Nothing.

      4. diff --git a/doc/html/boost/intrusive/list_member_hook.html b/doc/html/boost/intrusive/list_member_hook.html index 9673c2f0a4..3c69c88750 100644 --- a/doc/html/boost/intrusive/list_member_hook.html +++ b/doc/html/boost/intrusive/list_member_hook.html @@ -36,70 +36,70 @@ class list_member_hook : public make_list_member_hook::type< O1, O2, O3 > { public: // construct/copy/destruct - list_member_hook(); - list_member_hook(const list_member_hook &); - list_member_hook & operator=(const list_member_hook &); - ~list_member_hook(); + list_member_hook(); + list_member_hook(const list_member_hook &); + list_member_hook & operator=(const list_member_hook &); + ~list_member_hook(); - // public member functions - void swap_nodes(list_member_hook &); - bool is_linked() const; - void unlink(); + // public member functions + void swap_nodes(list_member_hook &); + bool is_linked() const; + void unlink(); };
    -

    Description

    +

    Description

    Store this hook in a class to be inserted in an list.

    The hook admits the following options: void_pointer<> and link_mode<>.

    link_mode<> will specify the linking mode of the hook (normal_link, auto_unlink or safe_link).

    void_pointer<> is the pointer type that will be used internally in the hook and the container configured to use this hook.

    -

    +

    list_member_hook public construct/copy/destruct

    1. -
      list_member_hook();
      +
      list_member_hook();

      Effects: If link_mode is auto_unlink or safe_link initializes the node to an unlinked state.

      Throws: Nothing.

    2. -
      list_member_hook(const list_member_hook &);
      +
      list_member_hook(const list_member_hook &);

      Effects: If link_mode is auto_unlink or safe_link initializes the node to an unlinked state. The argument is ignored.

      Throws: Nothing.

      Rationale: Providing a copy-constructor makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

    3. -
      list_member_hook & operator=(const list_member_hook &);
      +
      list_member_hook & operator=(const list_member_hook &);

      Effects: Empty function. The argument is ignored.

      Throws: Nothing.

      Rationale: Providing an assignment operator makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

    4. -
      ~list_member_hook();
      +
      ~list_member_hook();

      Effects: If link_mode is normal_link, the destructor does nothing (ie. no code is generated). If link_mode is safe_link and the object is stored in an list an assertion is raised. If link_mode is auto_unlink and is_linked() is true, the node is unlinked.

      Throws: Nothing.

    -

    -list_member_hook public member functions

    +

    +list_member_hook public member functions

    1. -
      void swap_nodes(list_member_hook & other);
      +
      void swap_nodes(list_member_hook & other);

      Effects: Swapping two nodes swaps the position of the elements related to those nodes in one or two containers. That is, if the node this is part of the element e1, the node x is part of the element e2 and both elements are included in the containers s1 and s2, then after the swap-operation e1 is in s2 at the position of e2 and e2 is in s1 at the position of e1. If one element is not in a container, then after the swap-operation the other element is not in a container. Iterators to e1 and e2 related to those nodes are invalidated.

      Complexity: Constant

      Throws: Nothing.

    2. -
      bool is_linked() const;
      +
      bool is_linked() const;

      Precondition: link_mode must be safe_link or auto_unlink.

      Returns: true, if the node belongs to a container, false otherwise. This function can be used to test whether list::iterator_to will return a valid iterator.

      Complexity: Constant

    3. -
      void unlink();
      +
      void unlink();

      Effects: Removes the node if it's inserted in a container. This function is only allowed if link_mode is auto_unlink.

      Throws: Nothing.

      4. diff --git a/doc/html/boost/intrusive/make_any_base_hook.html b/doc/html/boost/intrusive/make_any_base_hook.html index e3ecd1313c..7f8283fe32 100644 --- a/doc/html/boost/intrusive/make_any_base_hook.html +++ b/doc/html/boost/intrusive/make_any_base_hook.html @@ -38,7 +38,7 @@ typedef implementation_defined type; };
    -

    Description

    +

    Description

    Helper metafunction to define a any_base_hook that yields to the same type when the same options (either explicitly or implicitly) are used.

    diff --git a/doc/html/boost/intrusive/make_any_member_hook.html b/doc/html/boost/intrusive/make_any_member_hook.html index 5839b74f12..32afdb89cf 100644 --- a/doc/html/boost/intrusive/make_any_member_hook.html +++ b/doc/html/boost/intrusive/make_any_member_hook.html @@ -38,7 +38,7 @@ typedef implementation_defined type; };
    -

    Description

    +

    Description

    Helper metafunction to define a any_member_hook that yields to the same type when the same options (either explicitly or implicitly) are used.

    diff --git a/doc/html/boost/intrusive/make_avl_multiset.html b/doc/html/boost/intrusive/make_avl_multiset.html index 2a0db0a09f..cbdf0b2f6a 100644 --- a/doc/html/boost/intrusive/make_avl_multiset.html +++ b/doc/html/boost/intrusive/make_avl_multiset.html @@ -38,7 +38,7 @@ typedef implementation_defined type; };
    -

    Description

    +

    Description

    Helper metafunction to define a avl_multiset that yields to the same type when the same options (either explicitly or implicitly) are used.

    diff --git a/doc/html/boost/intrusive/make_avl_set.html b/doc/html/boost/intrusive/make_avl_set.html index 4ca5736361..69e036aa56 100644 --- a/doc/html/boost/intrusive/make_avl_set.html +++ b/doc/html/boost/intrusive/make_avl_set.html @@ -38,7 +38,7 @@ typedef implementation_defined type; };
    -

    Description

    +

    Description

    Helper metafunction to define a set that yields to the same type when the same options (either explicitly or implicitly) are used.

    diff --git a/doc/html/boost/intrusive/make_avl_set_base_hook.html b/doc/html/boost/intrusive/make_avl_set_base_hook.html index cf696aa1c2..f6580bb90c 100644 --- a/doc/html/boost/intrusive/make_avl_set_base_hook.html +++ b/doc/html/boost/intrusive/make_avl_set_base_hook.html @@ -38,7 +38,7 @@ typedef implementation_defined type; };
    -

    Description

    +

    Description

    Helper metafunction to define a avl_set_base_hook that yields to the same type when the same options (either explicitly or implicitly) are used.

    diff --git a/doc/html/boost/intrusive/make_avl_set_member_hook.html b/doc/html/boost/intrusive/make_avl_set_member_hook.html index bec4e6f0ea..200df25344 100644 --- a/doc/html/boost/intrusive/make_avl_set_member_hook.html +++ b/doc/html/boost/intrusive/make_avl_set_member_hook.html @@ -38,7 +38,7 @@ typedef implementation_defined type; };
    -

    Description

    +

    Description

    Helper metafunction to define a avl_set_member_hook that yields to the same type when the same options (either explicitly or implicitly) are used.

    diff --git a/doc/html/boost/intrusive/make_avltree.html b/doc/html/boost/intrusive/make_avltree.html index 7e889dcfae..dbd835220b 100644 --- a/doc/html/boost/intrusive/make_avltree.html +++ b/doc/html/boost/intrusive/make_avltree.html @@ -38,7 +38,7 @@ typedef implementation_defined type; };
    -

    Description

    +

    Description

    Helper metafunction to define a avltree that yields to the same type when the same options (either explicitly or implicitly) are used.

    diff --git a/doc/html/boost/intrusive/make_bs_multiset.html b/doc/html/boost/intrusive/make_bs_multiset.html index 0506b796b1..3c9f00b409 100644 --- a/doc/html/boost/intrusive/make_bs_multiset.html +++ b/doc/html/boost/intrusive/make_bs_multiset.html @@ -38,7 +38,7 @@ typedef implementation_defined type; };
    -

    Description

    +

    Description

    Helper metafunction to define a bs_multiset that yields to the same type when the same options (either explicitly or implicitly) are used.

    diff --git a/doc/html/boost/intrusive/make_bs_set.html b/doc/html/boost/intrusive/make_bs_set.html index 172dd013ec..cbdb6cb8c1 100644 --- a/doc/html/boost/intrusive/make_bs_set.html +++ b/doc/html/boost/intrusive/make_bs_set.html @@ -38,7 +38,7 @@ typedef implementation_defined type; };
    -

    Description

    +

    Description

    Helper metafunction to define a bs_set that yields to the same type when the same options (either explicitly or implicitly) are used.

    diff --git a/doc/html/boost/intrusive/make_bs_set_base_hook.html b/doc/html/boost/intrusive/make_bs_set_base_hook.html index 18d5005e3b..81ebdb9353 100644 --- a/doc/html/boost/intrusive/make_bs_set_base_hook.html +++ b/doc/html/boost/intrusive/make_bs_set_base_hook.html @@ -38,7 +38,7 @@ typedef implementation_defined type; };
    -

    Description

    +

    Description

    Helper metafunction to define a bs_set_base_hook that yields to the same type when the same options (either explicitly or implicitly) are used.

    diff --git a/doc/html/boost/intrusive/make_bs_set_member_hook.html b/doc/html/boost/intrusive/make_bs_set_member_hook.html index 8472a249e9..0b10ddbc1e 100644 --- a/doc/html/boost/intrusive/make_bs_set_member_hook.html +++ b/doc/html/boost/intrusive/make_bs_set_member_hook.html @@ -38,7 +38,7 @@ typedef implementation_defined type; };
    -

    Description

    +

    Description

    Helper metafunction to define a bs_set_member_hook that yields to the same type when the same options (either explicitly or implicitly) are used.

    diff --git a/doc/html/boost/intrusive/make_bstree.html b/doc/html/boost/intrusive/make_bstree.html index cfc199e499..a0593e67bc 100644 --- a/doc/html/boost/intrusive/make_bstree.html +++ b/doc/html/boost/intrusive/make_bstree.html @@ -38,7 +38,7 @@ typedef implementation_defined type; };
    -

    Description

    +

    Description

    Helper metafunction to define a bstree that yields to the same type when the same options (either explicitly or implicitly) are used.

    diff --git a/doc/html/boost/intrusive/make_hashtable.html b/doc/html/boost/intrusive/make_hashtable.html index 187e69a0c2..0460c207ef 100644 --- a/doc/html/boost/intrusive/make_hashtable.html +++ b/doc/html/boost/intrusive/make_hashtable.html @@ -38,7 +38,7 @@ typedef implementation_defined type; };
    -

    Description

    +

    Description

    Helper metafunction to define a hashtable that yields to the same type when the same options (either explicitly or implicitly) are used.

    diff --git a/doc/html/boost/intrusive/make_list.html b/doc/html/boost/intrusive/make_list.html index d42b19feb9..e623b2d087 100644 --- a/doc/html/boost/intrusive/make_list.html +++ b/doc/html/boost/intrusive/make_list.html @@ -38,7 +38,7 @@ typedef implementation_defined type; };
    -

    Description

    +

    Description

    Helper metafunction to define a list that yields to the same type when the same options (either explicitly or implicitly) are used.

    diff --git a/doc/html/boost/intrusive/make_list_base_hook.html b/doc/html/boost/intrusive/make_list_base_hook.html index 4d3d4fed64..d17f0a71f7 100644 --- a/doc/html/boost/intrusive/make_list_base_hook.html +++ b/doc/html/boost/intrusive/make_list_base_hook.html @@ -38,7 +38,7 @@ typedef implementation_defined type; };
    -

    Description

    +

    Description

    Helper metafunction to define a list_base_hook that yields to the same type when the same options (either explicitly or implicitly) are used.

    diff --git a/doc/html/boost/intrusive/make_list_member_hook.html b/doc/html/boost/intrusive/make_list_member_hook.html index 14550d3edd..c661b76945 100644 --- a/doc/html/boost/intrusive/make_list_member_hook.html +++ b/doc/html/boost/intrusive/make_list_member_hook.html @@ -38,7 +38,7 @@ typedef implementation_defined type; };
    -

    Description

    +

    Description

    Helper metafunction to define a list_member_hook that yields to the same type when the same options (either explicitly or implicitly) are used.

    diff --git a/doc/html/boost/intrusive/make_multiset.html b/doc/html/boost/intrusive/make_multiset.html index b3e84e528b..165bfc721a 100644 --- a/doc/html/boost/intrusive/make_multiset.html +++ b/doc/html/boost/intrusive/make_multiset.html @@ -38,7 +38,7 @@ typedef implementation_defined type; };
    -

    Description

    +

    Description

    Helper metafunction to define a multiset that yields to the same type when the same options (either explicitly or implicitly) are used.

    diff --git a/doc/html/boost/intrusive/make_rbtree.html b/doc/html/boost/intrusive/make_rbtree.html index 8a5e896e69..777420ddbb 100644 --- a/doc/html/boost/intrusive/make_rbtree.html +++ b/doc/html/boost/intrusive/make_rbtree.html @@ -38,7 +38,7 @@ typedef implementation_defined type; };
    -

    Description

    +

    Description

    Helper metafunction to define a rbtree that yields to the same type when the same options (either explicitly or implicitly) are used.

    diff --git a/doc/html/boost/intrusive/make_set.html b/doc/html/boost/intrusive/make_set.html index 46bfc0de08..dda0cf9465 100644 --- a/doc/html/boost/intrusive/make_set.html +++ b/doc/html/boost/intrusive/make_set.html @@ -38,7 +38,7 @@ typedef implementation_defined type; };
    -

    Description

    +

    Description

    Helper metafunction to define a set that yields to the same type when the same options (either explicitly or implicitly) are used.

    diff --git a/doc/html/boost/intrusive/make_set_base_hook.html b/doc/html/boost/intrusive/make_set_base_hook.html index db676f0c06..8e41426bb8 100644 --- a/doc/html/boost/intrusive/make_set_base_hook.html +++ b/doc/html/boost/intrusive/make_set_base_hook.html @@ -38,7 +38,7 @@ typedef implementation_defined type; };
    -

    Description

    +

    Description

    Helper metafunction to define a set_base_hook that yields to the same type when the same options (either explicitly or implicitly) are used.

    diff --git a/doc/html/boost/intrusive/make_set_member_hook.html b/doc/html/boost/intrusive/make_set_member_hook.html index 3cde8cc2d9..b44626a246 100644 --- a/doc/html/boost/intrusive/make_set_member_hook.html +++ b/doc/html/boost/intrusive/make_set_member_hook.html @@ -38,7 +38,7 @@ typedef implementation_defined type; };
    -

    Description

    +

    Description

    Helper metafunction to define a set_member_hook that yields to the same type when the same options (either explicitly or implicitly) are used.

    diff --git a/doc/html/boost/intrusive/make_sg_multiset.html b/doc/html/boost/intrusive/make_sg_multiset.html index 28017a2609..19bc631c27 100644 --- a/doc/html/boost/intrusive/make_sg_multiset.html +++ b/doc/html/boost/intrusive/make_sg_multiset.html @@ -38,7 +38,7 @@ typedef implementation_defined type; };
    -

    Description

    +

    Description

    Helper metafunction to define a sg_multiset that yields to the same type when the same options (either explicitly or implicitly) are used.

    diff --git a/doc/html/boost/intrusive/make_sg_set.html b/doc/html/boost/intrusive/make_sg_set.html index 13350fb17d..25b728f527 100644 --- a/doc/html/boost/intrusive/make_sg_set.html +++ b/doc/html/boost/intrusive/make_sg_set.html @@ -38,7 +38,7 @@ typedef implementation_defined type; };
    -

    Description

    +

    Description

    Helper metafunction to define a sg_set that yields to the same type when the same options (either explicitly or implicitly) are used.

    diff --git a/doc/html/boost/intrusive/make_sgtree.html b/doc/html/boost/intrusive/make_sgtree.html index b2a6fe661c..d9cdc5cc92 100644 --- a/doc/html/boost/intrusive/make_sgtree.html +++ b/doc/html/boost/intrusive/make_sgtree.html @@ -38,7 +38,7 @@ typedef implementation_defined type; };
    -

    Description

    +

    Description

    Helper metafunction to define a sgtree that yields to the same type when the same options (either explicitly or implicitly) are used.

    diff --git a/doc/html/boost/intrusive/make_slist.html b/doc/html/boost/intrusive/make_slist.html index 31131cb0e9..d010b30e43 100644 --- a/doc/html/boost/intrusive/make_slist.html +++ b/doc/html/boost/intrusive/make_slist.html @@ -38,7 +38,7 @@ typedef implementation_defined type; };
    -

    Description

    +

    Description

    Helper metafunction to define a slist that yields to the same type when the same options (either explicitly or implicitly) are used.

    diff --git a/doc/html/boost/intrusive/make_slist_base_hook.html b/doc/html/boost/intrusive/make_slist_base_hook.html index 81c67569ba..510df93e00 100644 --- a/doc/html/boost/intrusive/make_slist_base_hook.html +++ b/doc/html/boost/intrusive/make_slist_base_hook.html @@ -38,7 +38,7 @@ typedef implementation_defined type; };
    -

    Description

    +

    Description

    Helper metafunction to define a slist_base_hook that yields to the same type when the same options (either explicitly or implicitly) are used.

    diff --git a/doc/html/boost/intrusive/make_slist_member_hook.html b/doc/html/boost/intrusive/make_slist_member_hook.html index 7049063780..12d7ddf872 100644 --- a/doc/html/boost/intrusive/make_slist_member_hook.html +++ b/doc/html/boost/intrusive/make_slist_member_hook.html @@ -38,7 +38,7 @@ typedef implementation_defined type; };
    -

    Description

    +

    Description

    Helper metafunction to define a slist_member_hook that yields to the same type when the same options (either explicitly or implicitly) are used.

    diff --git a/doc/html/boost/intrusive/make_splay_multiset.html b/doc/html/boost/intrusive/make_splay_multiset.html index 192d6f5ab7..33a24a1c8d 100644 --- a/doc/html/boost/intrusive/make_splay_multiset.html +++ b/doc/html/boost/intrusive/make_splay_multiset.html @@ -38,7 +38,7 @@ typedef implementation_defined type; };
    -

    Description

    +

    Description

    Helper metafunction to define a splay_multiset that yields to the same type when the same options (either explicitly or implicitly) are used.

    diff --git a/doc/html/boost/intrusive/make_splay_set.html b/doc/html/boost/intrusive/make_splay_set.html index 835e265ab9..51b15921dd 100644 --- a/doc/html/boost/intrusive/make_splay_set.html +++ b/doc/html/boost/intrusive/make_splay_set.html @@ -38,7 +38,7 @@ typedef implementation_defined type; };
    -

    Description

    +

    Description

    Helper metafunction to define a splay_set that yields to the same type when the same options (either explicitly or implicitly) are used.

    diff --git a/doc/html/boost/intrusive/make_splaytree.html b/doc/html/boost/intrusive/make_splaytree.html index f1c5c9dc61..9e546aafbd 100644 --- a/doc/html/boost/intrusive/make_splaytree.html +++ b/doc/html/boost/intrusive/make_splaytree.html @@ -38,7 +38,7 @@ typedef implementation_defined type; };
    -

    Description

    +

    Description

    Helper metafunction to define a splaytree that yields to the same type when the same options (either explicitly or implicitly) are used.

    diff --git a/doc/html/boost/intrusive/make_treap.html b/doc/html/boost/intrusive/make_treap.html index 0fcee6836b..29feb0c408 100644 --- a/doc/html/boost/intrusive/make_treap.html +++ b/doc/html/boost/intrusive/make_treap.html @@ -41,7 +41,7 @@ typedef implementation_defined type; };
    -

    Description

    +

    Description

    Helper metafunction to define a treap that yields to the same type when the same options (either explicitly or implicitly) are used.

    diff --git a/doc/html/boost/intrusive/make_treap_multiset.html b/doc/html/boost/intrusive/make_treap_multiset.html index dde000553a..94928946f4 100644 --- a/doc/html/boost/intrusive/make_treap_multiset.html +++ b/doc/html/boost/intrusive/make_treap_multiset.html @@ -41,7 +41,7 @@ typedef implementation_defined type; };
    -

    Description

    +

    Description

    Helper metafunction to define a treap_multiset that yields to the same type when the same options (either explicitly or implicitly) are used.

    diff --git a/doc/html/boost/intrusive/make_treap_set.html b/doc/html/boost/intrusive/make_treap_set.html index 22b4c44731..314d2fe1e8 100644 --- a/doc/html/boost/intrusive/make_treap_set.html +++ b/doc/html/boost/intrusive/make_treap_set.html @@ -41,7 +41,7 @@ typedef implementation_defined type; };
    -

    Description

    +

    Description

    Helper metafunction to define a treap_set that yields to the same type when the same options (either explicitly or implicitly) are used.

    diff --git a/doc/html/boost/intrusive/make_uno_idm46322874274752.html b/doc/html/boost/intrusive/make_uno_idm46322874274752.html new file mode 100644 index 0000000000..e7beb9e42f --- /dev/null +++ b/doc/html/boost/intrusive/make_uno_idm46322874274752.html @@ -0,0 +1,58 @@ + + + + +Struct template make_unordered_set_member_hook + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct template make_unordered_set_member_hook

    +

    boost::intrusive::make_unordered_set_member_hook

    +
    +

    Synopsis

    +
    // In header: <boost/intrusive/unordered_set_hook.hpp>
+
+template<class... Options> 
+struct make_unordered_set_member_hook {
+  // types
+  typedef implementation_defined type;
+};
    +
    +

    Description

    +

    Helper metafunction to define a unordered_set_member_hook that yields to the same type when the same options (either explicitly or implicitly) are used.

    +
    +
    + + + +
    Copyright © 2005 Olaf Krzikalla
    Copyright © 2006-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/intrusive/make_uno_idm46322874278544.html b/doc/html/boost/intrusive/make_uno_idm46322874278544.html new file mode 100644 index 0000000000..ae422d11a0 --- /dev/null +++ b/doc/html/boost/intrusive/make_uno_idm46322874278544.html @@ -0,0 +1,58 @@ + + + + +Struct template make_unordered_set_base_hook + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct template make_unordered_set_base_hook

    +

    boost::intrusive::make_unordered_set_base_hook

    +
    +

    Synopsis

    +
    // In header: <boost/intrusive/unordered_set_hook.hpp>
+
+template<class... Options> 
+struct make_unordered_set_base_hook {
+  // types
+  typedef implementation_defined type;
+};
    +
    +

    Description

    +

    Helper metafunction to define a unordered_set_base_hook that yields to the same type when the same options (either explicitly or implicitly) are used.

    +
    +
    + + + +
    Copyright © 2005 Olaf Krzikalla
    Copyright © 2006-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/intrusive/make_unordered_idp58605632.html b/doc/html/boost/intrusive/make_unordered_idp58605632.html deleted file mode 100644 index 54da649869..0000000000 --- a/doc/html/boost/intrusive/make_unordered_idp58605632.html +++ /dev/null @@ -1,58 +0,0 @@ - - - - -Struct template make_unordered_set_base_hook - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template make_unordered_set_base_hook

    -

    boost::intrusive::make_unordered_set_base_hook

    -
    -

    Synopsis

    -
    // In header: <boost/intrusive/unordered_set_hook.hpp>
-
-template<class... Options> 
-struct make_unordered_set_base_hook {
-  // types
-  typedef implementation_defined type;
-};
    -
    -

    Description

    -

    Helper metafunction to define a unordered_set_base_hook that yields to the same type when the same options (either explicitly or implicitly) are used.

    -
    -
    - - - -
    Copyright © 2005 Olaf Krzikalla
    Copyright © 2006-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/intrusive/make_unordered_idp58609424.html b/doc/html/boost/intrusive/make_unordered_idp58609424.html deleted file mode 100644 index 7605e50251..0000000000 --- a/doc/html/boost/intrusive/make_unordered_idp58609424.html +++ /dev/null @@ -1,58 +0,0 @@ - - - - -Struct template make_unordered_set_member_hook - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template make_unordered_set_member_hook

    -

    boost::intrusive::make_unordered_set_member_hook

    -
    -

    Synopsis

    -
    // In header: <boost/intrusive/unordered_set_hook.hpp>
-
-template<class... Options> 
-struct make_unordered_set_member_hook {
-  // types
-  typedef implementation_defined type;
-};
    -
    -

    Description

    -

    Helper metafunction to define a unordered_set_member_hook that yields to the same type when the same options (either explicitly or implicitly) are used.

    -
    -
    - - - -
    Copyright © 2005 Olaf Krzikalla
    Copyright © 2006-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/intrusive/make_unordered_multiset.html b/doc/html/boost/intrusive/make_unordered_multiset.html index e4afd9a138..bf540e6b9e 100644 --- a/doc/html/boost/intrusive/make_unordered_multiset.html +++ b/doc/html/boost/intrusive/make_unordered_multiset.html @@ -38,7 +38,7 @@ typedef implementation_defined type; };
    -

    Description

    +

    Description

    Helper metafunction to define an unordered_multiset that yields to the same type when the same options (either explicitly or implicitly) are used.

    diff --git a/doc/html/boost/intrusive/make_unordered_set.html b/doc/html/boost/intrusive/make_unordered_set.html index e88b25761d..802804743f 100644 --- a/doc/html/boost/intrusive/make_unordered_set.html +++ b/doc/html/boost/intrusive/make_unordered_set.html @@ -38,7 +38,7 @@ typedef implementation_defined type; };
    -

    Description

    +

    Description

    Helper metafunction to define an unordered_set that yields to the same type when the same options (either explicitly or implicitly) are used.

    diff --git a/doc/html/boost/intrusive/max_poin_idm46322884327776.html b/doc/html/boost/intrusive/max_poin_idm46322884327776.html new file mode 100644 index 0000000000..a94bd6ce4a --- /dev/null +++ b/doc/html/boost/intrusive/max_poin_idm46322884327776.html @@ -0,0 +1,59 @@ + + + + +Struct template max_pointer_plus_bits<void *, Alignment> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct template max_pointer_plus_bits<void *, Alignment>

    +

    boost::intrusive::max_pointer_plus_bits<void *, Alignment>

    +
    +

    Synopsis

    +
    // In header: <boost/intrusive/pointer_plus_bits.hpp>
+
+template<std::size_t Alignment> 
+struct max_pointer_plus_bits<void *, Alignment> {
+
+  // public data members
+  static const std::size_t value;
+};
    +
    +

    Description

    +

    This is a specialization for raw pointers. Raw pointers can embed extra bits in the lower bits if the alignment is multiple of 2pow(NumBits).

    +
    +
    + + + +
    Copyright © 2005 Olaf Krzikalla
    Copyright © 2006-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/intrusive/max_pointer_pl_idp48905328.html b/doc/html/boost/intrusive/max_pointer_pl_idp48905328.html deleted file mode 100644 index f81e3930b7..0000000000 --- a/doc/html/boost/intrusive/max_pointer_pl_idp48905328.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Struct template max_pointer_plus_bits<void *, Alignment> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template max_pointer_plus_bits<void *, Alignment>

    -

    boost::intrusive::max_pointer_plus_bits<void *, Alignment>

    -
    -

    Synopsis

    -
    // In header: <boost/intrusive/pointer_plus_bits.hpp>
-
-template<std::size_t Alignment> 
-struct max_pointer_plus_bits<void *, Alignment> {
-
-  // public data members
-  static const std::size_t value;
-};
    -
    -

    Description

    -

    This is a specialization for raw pointers. Raw pointers can embed extra bits in the lower bits if the alignment is multiple of 2pow(NumBits).

    -
    -
    - - - -
    Copyright © 2005 Olaf Krzikalla
    Copyright © 2006-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/intrusive/max_pointer_plus_bits.html b/doc/html/boost/intrusive/max_pointer_plus_bits.html index 3bfc7727db..d514a0d012 100644 --- a/doc/html/boost/intrusive/max_pointer_plus_bits.html +++ b/doc/html/boost/intrusive/max_pointer_plus_bits.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -39,7 +39,7 @@ static const std::size_t value; };
    -

    Description

    +

    Description

    This trait class is used to know if a pointer can embed extra bits of information if it's going to be used to point to objects with an alignment of "Alignment" bytes.

    @@ -53,7 +53,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/intrusive/member_hook.html b/doc/html/boost/intrusive/member_hook.html index 8b6791846e..bb6c7046c4 100644 --- a/doc/html/boost/intrusive/member_hook.html +++ b/doc/html/boost/intrusive/member_hook.html @@ -37,7 +37,7 @@ struct member_hook { };
    -

    Description

    +

    Description

    This option setter specifies the member hook the container must use.

    diff --git a/doc/html/boost/intrusive/member_value_traits.html b/doc/html/boost/intrusive/member_value_traits.html index 33d9343287..18943346dc 100644 --- a/doc/html/boost/intrusive/member_value_traits.html +++ b/doc/html/boost/intrusive/member_value_traits.html @@ -48,26 +48,26 @@ typedef value_type & reference; typedef const value_type & const_reference; - // public static functions - static node_ptr to_node_ptr(reference); - static const_node_ptr to_node_ptr(const_reference); - static pointer to_value_ptr(const node_ptr &); - static const_pointer to_value_ptr(const const_node_ptr &); + // public static functions + static node_ptr to_node_ptr(reference); + static const_node_ptr to_node_ptr(const_reference); + static pointer to_value_ptr(const node_ptr &); + static const_pointer to_value_ptr(const const_node_ptr &); // public data members static const link_mode_type link_mode; };
    -

    Description

    +

    Description

    This value traits template is used to create value traits from user defined node traits where value_traits::value_type will store a node_traits::node

    -

    -member_value_traits public static functions

    +

    +member_value_traits public static functions

      -
    1. static node_ptr to_node_ptr(reference value);
      2. -
    2. static const_node_ptr to_node_ptr(const_reference value);
      3. -
    3. static pointer to_value_ptr(const node_ptr & n);
      4. -
    4. static const_pointer to_value_ptr(const const_node_ptr & n);
      5. +
    5. static node_ptr to_node_ptr(reference value);
      6. +
    6. static const_node_ptr to_node_ptr(const_reference value);
      7. +
    7. static pointer to_value_ptr(const node_ptr & n);
      8. +
    8. static const_pointer to_value_ptr(const const_node_ptr & n);
    diff --git a/doc/html/boost/intrusive/multiset.html b/doc/html/boost/intrusive/multiset.html index a0ccdd24a0..6c128efe46 100644 --- a/doc/html/boost/intrusive/multiset.html +++ b/doc/html/boost/intrusive/multiset.html @@ -60,131 +60,131 @@ typedef implementation_defined::node_algorithms node_algorithms; // construct/copy/destruct - explicit multiset(const key_compare & = key_compare(), + explicit multiset(const key_compare & = key_compare(), const value_traits & = value_traits()); template<typename Iterator> - multiset(Iterator, Iterator, const key_compare & = key_compare(), + multiset(Iterator, Iterator, const key_compare & = key_compare(), const value_traits & = value_traits()); - multiset(multiset &&); - multiset & operator=(multiset &&); - ~multiset(); + multiset(multiset &&); + multiset & operator=(multiset &&); + ~multiset(); - // public member functions - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end(); - const_iterator end() const; - const_iterator cend() const; - reverse_iterator rbegin(); - const_reverse_iterator rbegin() const; - const_reverse_iterator crbegin() const; - reverse_iterator rend(); - const_reverse_iterator rend() const; - const_reverse_iterator crend() const; - key_compare key_comp() const; - value_compare value_comp() const; - bool empty() const; - size_type size() const; - void swap(multiset &); + // public member functions + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end(); + const_iterator end() const; + const_iterator cend() const; + reverse_iterator rbegin(); + const_reverse_iterator rbegin() const; + const_reverse_iterator crbegin() const; + reverse_iterator rend(); + const_reverse_iterator rend() const; + const_reverse_iterator crend() const; + key_compare key_comp() const; + value_compare value_comp() const; + bool empty() const; + size_type size() const; + void swap(multiset &); template<typename Cloner, typename Disposer> - void clone_from(const multiset &, Cloner, Disposer); + void clone_from(const multiset &, Cloner, Disposer); template<typename Cloner, typename Disposer> - void clone_from(multiset &&, Cloner, Disposer); - iterator insert(reference); - iterator insert(const_iterator, reference); - template<typename Iterator> void insert(Iterator, Iterator); - iterator insert_before(const_iterator, reference); - void push_back(reference); - void push_front(reference); - iterator erase(const_iterator); - iterator erase(const_iterator, const_iterator); - size_type erase(const key_type &); + void clone_from(multiset &&, Cloner, Disposer); + iterator insert(reference); + iterator insert(const_iterator, reference); + template<typename Iterator> void insert(Iterator, Iterator); + iterator insert_before(const_iterator, reference); + void push_back(reference); + void push_front(reference); + iterator erase(const_iterator); + iterator erase(const_iterator, const_iterator); + size_type erase(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - size_type erase(const KeyType &, KeyTypeKeyCompare); + size_type erase(const KeyType &, KeyTypeKeyCompare); template<typename Disposer> - iterator erase_and_dispose(const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, Disposer); template<typename Disposer> - iterator erase_and_dispose(const_iterator, const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, const_iterator, Disposer); template<typename Disposer> - size_type erase_and_dispose(const key_type &, Disposer); + size_type erase_and_dispose(const key_type &, Disposer); template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> - size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); - void clear(); - template<typename Disposer> void clear_and_dispose(Disposer); - size_type count(const key_type &) const; + size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); + void clear(); + template<typename Disposer> void clear_and_dispose(Disposer); + size_type count(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - size_type count(const KeyType &, KeyTypeKeyCompare) const; - iterator lower_bound(const key_type &); + size_type count(const KeyType &, KeyTypeKeyCompare) const; + iterator lower_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator lower_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator lower_bound(const key_type &) const; + iterator lower_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator lower_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator upper_bound(const key_type &); + const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator upper_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator upper_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator upper_bound(const key_type &) const; + iterator upper_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator upper_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator find(const key_type &); + const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator find(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator find(const KeyType &, KeyTypeKeyCompare); - const_iterator find(const key_type &) const; + iterator find(const KeyType &, KeyTypeKeyCompare); + const_iterator find(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator find(const KeyType &, KeyTypeKeyCompare) const; - std::pair< iterator, iterator > equal_range(const key_type &); + const_iterator find(const KeyType &, KeyTypeKeyCompare) const; + std::pair< iterator, iterator > equal_range(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - equal_range(const KeyType &, KeyTypeKeyCompare); + equal_range(const KeyType &, KeyTypeKeyCompare); std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; + equal_range(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - equal_range(const KeyType &, KeyTypeKeyCompare) const; + equal_range(const KeyType &, KeyTypeKeyCompare) const; std::pair< iterator, iterator > - bounded_range(const key_type &, const key_type &, bool, bool); + bounded_range(const key_type &, const key_type &, bool, bool); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool); std::pair< const_iterator, const_iterator > - bounded_range(const key_type &, const key_type &, bool, bool) const; + bounded_range(const key_type &, const key_type &, bool, bool) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool) const; - iterator iterator_to(reference); - const_iterator iterator_to(const_reference) const; - pointer unlink_leftmost_without_rebalance(); - void replace_node(iterator, reference); - void remove_node(reference); + iterator iterator_to(reference); + const_iterator iterator_to(const_reference) const; + pointer unlink_leftmost_without_rebalance(); + void replace_node(iterator, reference); + void remove_node(reference); - // public static functions - static multiset & container_from_end_iterator(iterator); - static const multiset & container_from_end_iterator(const_iterator); - static multiset & container_from_iterator(iterator); - static const multiset & container_from_iterator(const_iterator); - static iterator s_iterator_to(reference); - static const_iterator s_iterator_to(const_reference); - static void init_node(reference); + // public static functions + static multiset & container_from_end_iterator(iterator); + static const multiset & container_from_end_iterator(const_iterator); + static multiset & container_from_iterator(iterator); + static const multiset & container_from_iterator(const_iterator); + static iterator s_iterator_to(reference); + static const_iterator s_iterator_to(const_reference); + static void init_node(reference); // public data members static const bool constant_time_size; };
    -

    Description

    +

    Description

    The class template multiset is an intrusive container, that mimics most of the interface of std::multiset as described in the C++ standard.

    The template parameter T is the type to be managed by the container. The user can specify additional options and if no options are provided default options are used.

    The container supports the following options: base_hook<>/member_hook<>/value_traits<>, constant_time_size<>, size_type<> and compare<>.

    -

    +

    multiset public construct/copy/destruct

    1. -
      explicit multiset(const key_compare & cmp = key_compare(), 
+
      explicit multiset(const key_compare & cmp = key_compare(), 
                   const value_traits & v_traits = value_traits());
      
 
      Effects: Constructs an empty container.
      
 
      Complexity: Constant.
      
@@ -192,7 +192,7 @@
 
    2. template<typename Iterator> 
-  multiset(Iterator b, Iterator e, const key_compare & cmp = key_compare(), 
+  multiset(Iterator b, Iterator e, const key_compare & cmp = key_compare(), 
            const value_traits & v_traits = value_traits());

      Requires: Dereferencing iterator must yield an lvalue of type value_type. cmp must be a comparison function that induces a strict weak ordering.

      Effects: Constructs an empty container and inserts elements from [b, e).

      @@ -200,15 +200,15 @@

      Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor/operator() of the key_compare object throws. Basic guarantee.

    3. -
      multiset(multiset && x);
      +
      multiset(multiset && x);

      Effects: to-do

    4. -
      multiset & operator=(multiset && x);
      +
      multiset & operator=(multiset && x);

      Effects: to-do

    5. -
      ~multiset();
      +
      ~multiset();

      Effects: Detaches all elements from this. The objects in the set are not deleted (i.e. no destructors are called), but the nodes according to the value_traits template parameter are reinitialized and thus can be reused.

      Complexity: Linear to elements contained in *this.

      Throws: Nothing.

      @@ -216,114 +216,114 @@
    -

    -multiset public member functions

    +

    +multiset public member functions

    1. -
      iterator begin();
      +
      iterator begin();

      Effects: Returns an iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    2. -
      const_iterator begin() const;
      +
      const_iterator begin() const;

      Effects: Returns a const_iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    3. -
      const_iterator cbegin() const;
      +
      const_iterator cbegin() const;

      Effects: Returns a const_iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    4. -
      iterator end();
      +
      iterator end();

      Effects: Returns an iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    5. -
      const_iterator end() const;
      +
      const_iterator end() const;

      Effects: Returns a const_iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    6. -
      const_iterator cend() const;
      +
      const_iterator cend() const;

      Effects: Returns a const_iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    7. -
      reverse_iterator rbegin();
      +
      reverse_iterator rbegin();

      Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    8. -
      const_reverse_iterator rbegin() const;
      +
      const_reverse_iterator rbegin() const;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    9. -
      const_reverse_iterator crbegin() const;
      +
      const_reverse_iterator crbegin() const;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    10. -
      reverse_iterator rend();
      +
      reverse_iterator rend();

      Effects: Returns a reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    11. -
      const_reverse_iterator rend() const;
      +
      const_reverse_iterator rend() const;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    12. -
      const_reverse_iterator crend() const;
      +
      const_reverse_iterator crend() const;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    13. -
      key_compare key_comp() const;
      +
      key_compare key_comp() const;

      Effects: Returns the key_compare object used by the container.

      Complexity: Constant.

      Throws: If key_compare copy-constructor throws.

    14. -
      value_compare value_comp() const;
      +
      value_compare value_comp() const;

      Effects: Returns the value_compare object used by the container.

      Complexity: Constant.

      Throws: If value_compare copy-constructor throws.

    15. -
      bool empty() const;
      +
      bool empty() const;

      Effects: Returns true if the container is empty.

      Complexity: Constant.

      Throws: Nothing.

    16. -
      size_type size() const;
      +
      size_type size() const;

      Effects: Returns the number of elements stored in the container.

      Complexity: Linear to elements contained in *this if constant-time size option is disabled. Constant time otherwise.

      Throws: Nothing.

    17. -
      void swap(multiset & other);
      +
      void swap(multiset & other);

      Effects: Swaps the contents of two containers.

      Complexity: Constant.

      Throws: If the comparison functor's swap call throws. 

    18. template<typename Cloner, typename Disposer> 
-  void clone_from(const multiset & src, Cloner cloner, Disposer disposer);
      + void clone_from(const multiset & src, Cloner cloner, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

      Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(const_reference ) and inserts them on *this. Copies the predicate from the source container.

      If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

      @@ -332,7 +332,7 @@ 
    19. template<typename Cloner, typename Disposer> 
-  void clone_from(multiset && src, Cloner cloner, Disposer disposer);
      + void clone_from(multiset && src, Cloner cloner, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

      Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(reference) and inserts them on *this. Copies the predicate from the source container.

      If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

      @@ -341,7 +341,7 @@

      Note: This version can modify the source container, useful to implement move semantics.

    20. -
      iterator insert(reference value);
      +
      iterator insert(reference value);

      Requires: value must be an lvalue

      Effects: Inserts value into the container before the upper bound.

      Complexity: Average complexity for insert element is at most logarithmic.

      @@ -349,7 +349,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    21. -
      iterator insert(const_iterator hint, reference value);
      +
      iterator insert(const_iterator hint, reference value);

      Requires: value must be an lvalue, and "hint" must be a valid iterator.

      Effects: Inserts x into the container, using "hint" as a hint to where it will be inserted. If "hint" is the upper_bound the insertion takes constant time (two comparisons in the worst case)

      Complexity: Logarithmic in general, but it is amortized constant time if t is inserted immediately before hint.

      @@ -357,7 +357,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    22. -
      template<typename Iterator> void insert(Iterator b, Iterator e);
      +
      template<typename Iterator> void insert(Iterator b, Iterator e);

      Requires: Dereferencing iterator must yield an lvalue of type value_type.

      Effects: Inserts a each element of a range into the container before the upper bound of the key of each element.

      Complexity: Insert range is in general O(N * log(N)), where N is the size of the range. However, it is linear in N if the range is already sorted by value_comp().

      @@ -365,7 +365,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    23. -
      iterator insert_before(const_iterator pos, reference value);
      +
      iterator insert_before(const_iterator pos, reference value);

      Requires: value must be an lvalue, "pos" must be a valid iterator (or end) and must be the succesor of value once inserted according to the predicate

      Effects: Inserts x into the container before "pos".

      Complexity: Constant time.

      @@ -373,7 +373,7 @@

      Note: This function does not check preconditions so if "pos" is not the successor of "value" container ordering invariant will be broken. This is a low-level function to be used only for performance reasons by advanced users.

    24. -
      void push_back(reference value);
      +
      void push_back(reference value);

      Requires: value must be an lvalue, and it must be no less than the greatest inserted key

      Effects: Inserts x into the container in the last position.

      Complexity: Constant time.

      @@ -381,7 +381,7 @@

      Note: This function does not check preconditions so if value is less than the greatest inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

    25. -
      void push_front(reference value);
      +
      void push_front(reference value);

      Requires: value must be an lvalue, and it must be no greater than the minimum inserted key

      Effects: Inserts x into the container in the first position.

      Complexity: Constant time.

      @@ -389,21 +389,21 @@

      Note: This function does not check preconditions so if value is greater than the minimum inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

    26. -
      iterator erase(const_iterator i);
      +
      iterator erase(const_iterator i);

      Effects: Erases the element pointed to by i.

      Complexity: Average complexity for erase element is constant time.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    27. -
      iterator erase(const_iterator b, const_iterator e);
      +
      iterator erase(const_iterator b, const_iterator e);

      Effects: Erases the range pointed to by b end e.

      Complexity: Average complexity for erase range is at most O(log(size() + N)), where N is the number of elements in the range.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    28. -
      size_type erase(const key_type & key);
      +
      size_type erase(const key_type & key);

      Effects: Erases all the elements with the given value.

      Returns: The number of erased elements.

      Complexity: O(log(size() + N).

      @@ -412,7 +412,8 @@ 
    29. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type erase(const KeyType & key, KeyTypeKeyCompare comp);
      + size_type erase(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Erases all the elements with the given key. according to the comparison functor "comp".

      Returns: The number of erased elements.

      Complexity: O(log(size() + N).

      @@ -421,7 +422,7 @@ 
    30. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator i, Disposer disposer);
      + iterator erase_and_dispose(const_iterator i, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases the element pointed to by i. Disposer::operator()(pointer) is called for the removed element.

      Complexity: Average complexity for erase element is constant time.

      @@ -430,7 +431,7 @@ 
    31. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator b, const_iterator e, 
+  iterator erase_and_dispose(const_iterator b, const_iterator e, 
                              Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases the range pointed to by b end e. Disposer::operator()(pointer) is called for the removed elements.

      @@ -440,7 +441,7 @@ 
    32. template<typename Disposer> 
-  size_type erase_and_dispose(const key_type & key, Disposer disposer);
      + size_type erase_and_dispose(const key_type & key, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases all the elements with the given value. Disposer::operator()(pointer) is called for the removed elements.

      Returns: The number of erased elements.

      @@ -450,8 +451,9 @@ 
    33. template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> 
-  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
+  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
                               Disposer disposer);
      +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk) and nk the key_type of a value_type inserted into *this.

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases all the elements with the given key. according to the comparison functor "comp". Disposer::operator()(pointer) is called for the removed elements.

      Returns: The number of erased elements.

      @@ -460,46 +462,47 @@

      Note: Invalidates the iterators to the erased elements.

    34. -
      void clear();
      +
      void clear();

      Effects: Erases all of the elements.

      Complexity: Linear to the number of elements on the container. if it's a safe-mode or auto-unlink value_type. Constant time otherwise.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    35. -
      template<typename Disposer> void clear_and_dispose(Disposer disposer);
      +
      template<typename Disposer> void clear_and_dispose(Disposer disposer);

      Effects: Erases all of the elements calling disposer(p) for each node to be erased. Complexity: Average complexity for is at most O(log(size() + N)), where N is the number of elements in the container.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. Calls N times to disposer functor.

    36. -
      size_type count(const key_type & key) const;
      +
      size_type count(const key_type & key) const;

      Effects: Returns the number of contained elements with the given value

      Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given value.

      Throws: If key_compare throws. 

    37. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;
      + size_type count(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      Effects: Returns the number of contained elements with the given key

      Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given key.

      Throws: If comp throws.

    38. -
      iterator lower_bound(const key_type & key);
      +
      iterator lower_bound(const key_type & key);

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    39. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      -

      Throws: If comp throws.

      +

      Throws: If key_compare throws.

    40. -
      const_iterator lower_bound(const key_type & key) const;
      +
      const_iterator lower_bound(const key_type & key) const;

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -507,26 +510,27 @@ 
    41. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
      -

      Effects: Returns a const iterator to the first element whose key is not less than k or end() if that element does not exist.

      + lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      -

      Throws: If comp throws.

      +

      Throws: If key_compare throws.

    42. -
      iterator upper_bound(const key_type & key);
      +
      iterator upper_bound(const key_type & key);

      Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    43. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    44. -
      const_iterator upper_bound(const key_type & key) const;
      +
      const_iterator upper_bound(const key_type & key) const;

      Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -534,39 +538,42 @@ 
    45. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
      + upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    46. -
      iterator find(const key_type & key);
      +
      iterator find(const key_type & key);

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    47. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator find(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator find(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    48. -
      const_iterator find(const key_type & key) const;
      -

      Effects: Finds a const_iterator to the first element whose key is k or end() if that element does not exist.

      +
      const_iterator find(const key_type & key) const;
      +

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    49. template<typename KeyType, typename KeyTypeKeyCompare> 
-  const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;
      -

      Effects: Finds a const_iterator to the first element whose key is k or end() if that element does not exist.

      + const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      +

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    50. -
      std::pair< iterator, iterator > equal_range(const key_type & key);
      +
      std::pair< iterator, iterator > equal_range(const key_type & key);

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -574,14 +581,15 @@ 
    51. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp);
      + equal_range(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If comp throws. 

    52. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & key) const;
      +equal_range(const key_type & key) const;

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -589,16 +597,18 @@ 
    53. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;
      + equal_range(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If comp throws. 

    54. std::pair< iterator, iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed);
      -

      Requires: 'lower_key' must not be greater than 'upper_key'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key) if left_closed, upper_bound(lower_key) otherwise

      second = upper_bound(upper_key) if right_closed, lower_bound(upper_key) otherwise

      @@ -610,9 +620,12 @@ 
    55. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed);
      -

      Requires: KeyTypeKeyCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the container. 'lower_key' must not be greater than 'upper_key' according to 'comp'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

      +

      upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

      +

      upper_key shall not precede lower_key according to comp [comp(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!comp(upper_key, lower_key) && !comp(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key, comp) if left_closed, upper_bound(lower_key, comp) otherwise

      second = upper_bound(upper_key, comp) if right_closed, lower_bound(upper_key, comp) otherwise

      @@ -623,9 +636,10 @@ 
    56. std::pair< const_iterator, const_iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed) const;
      -

      Requires: 'lower_key' must not be greater than 'upper_key'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key) if left_closed, upper_bound(lower_key) otherwise

      second = upper_bound(upper_key) if right_closed, lower_bound(upper_key) otherwise

      @@ -637,9 +651,12 @@ 
    57. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed) const;
      -

      Requires: KeyTypeKeyCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the container. 'lower_key' must not be greater than 'upper_key' according to 'comp'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

      +

      upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

      +

      upper_key shall not precede lower_key according to comp [comp(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!comp(upper_key, lower_key) && !comp(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key, comp) if left_closed, upper_bound(lower_key, comp) otherwise

      second = upper_bound(upper_key, comp) if right_closed, lower_bound(upper_key, comp) otherwise

      @@ -649,28 +666,28 @@

      Note: Experimental function, the interface might change in future releases.

    58. -
      iterator iterator_to(reference value);
      +
      iterator iterator_to(reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      Throws: Nothing.

    59. -
      const_iterator iterator_to(const_reference value) const;
      +
      const_iterator iterator_to(const_reference value) const;

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid const_iterator i belonging to the set that points to the value

      Complexity: Constant.

      Throws: Nothing.

    60. -
      pointer unlink_leftmost_without_rebalance();
      +
      pointer unlink_leftmost_without_rebalance();

      Effects: Unlinks the leftmost node from the container.

      Complexity: Average complexity is constant time.

      Throws: Nothing.

      Notes: This function breaks the container and the container can only be used for more unlink_leftmost_without_rebalance calls. This function is normally used to achieve a step by step controlled destruction of the container.

    61. -
      void replace_node(iterator replace_this, reference with_this);
      +
      void replace_node(iterator replace_this, reference with_this);

      Requires: replace_this must be a valid iterator of *this and with_this must not be inserted in any container.

      Effects: Replaces replace_this in its position in the container with with_this. The container does not need to be rebalanced.

      Complexity: Constant.

      @@ -678,7 +695,7 @@

      Note: This function will break container ordering invariants if with_this is not equivalent to *replace_this according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing or comparison is needed.

    62. -
      void remove_node(reference value);
      +
      void remove_node(reference value);

      Effects: removes "value" from the container.

      Throws: Nothing.

      Complexity: Logarithmic time.

      @@ -688,11 +705,11 @@
    -

    -multiset public static functions

    +

    +multiset public static functions

    1. -
      static multiset & container_from_end_iterator(iterator end_iterator);
      +
      static multiset & container_from_end_iterator(iterator end_iterator);

      Precondition: end_iterator must be a valid end iterator of the container.

      Effects: Returns a const reference to the container associated to the end iterator

      Throws: Nothing.

      @@ -700,28 +717,28 @@ 
    2. static const multiset & 
-container_from_end_iterator(const_iterator end_iterator);
      +container_from_end_iterator(const_iterator end_iterator);

      Precondition: end_iterator must be a valid end iterator of the container.

      Effects: Returns a const reference to the container associated to the end iterator

      Throws: Nothing.

      Complexity: Constant.

    3. -
      static multiset & container_from_iterator(iterator it);
      +
      static multiset & container_from_iterator(iterator it);

      Precondition: it must be a valid iterator of the container.

      Effects: Returns a const reference to the container associated to the iterator

      Throws: Nothing.

      Complexity: Logarithmic.

    4. -
      static const multiset & container_from_iterator(const_iterator it);
      +
      static const multiset & container_from_iterator(const_iterator it);

      Precondition: it must be a valid iterator of the container.

      Effects: Returns a const reference to the container associated to the iterator

      Throws: Nothing.

      Complexity: Logarithmic.

    5. -
      static iterator s_iterator_to(reference value);
      +
      static iterator s_iterator_to(reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      @@ -729,7 +746,7 @@

      Note: This static function is available only if the value traits is stateless.

    6. -
      static const_iterator s_iterator_to(const_reference value);
      +
      static const_iterator s_iterator_to(const_reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      @@ -737,7 +754,7 @@

      Note: This static function is available only if the value traits is stateless.

    7. -
      static void init_node(reference value);
      +
      static void init_node(reference value);

      Requires: value shall not be in a container.

      Effects: init_node puts the hook of a value in a well-known default state.

      Throws: Nothing.

      diff --git a/doc/html/boost/intrusive/optimize_multikey.html b/doc/html/boost/intrusive/optimize_multikey.html index a9fa3a3620..a181270a92 100644 --- a/doc/html/boost/intrusive/optimize_multikey.html +++ b/doc/html/boost/intrusive/optimize_multikey.html @@ -36,7 +36,7 @@ struct optimize_multikey { };
    -

    Description

    +

    Description

    This option setter specifies if the unordered hook should offer room to store another link to another node with the same key. Storing this link will speed up lookups and insertions on unordered_multiset containers with a great number of elements with the same key.

    diff --git a/doc/html/boost/intrusive/optimize_size.html b/doc/html/boost/intrusive/optimize_size.html index 7d57a7af0d..99afee9495 100644 --- a/doc/html/boost/intrusive/optimize_size.html +++ b/doc/html/boost/intrusive/optimize_size.html @@ -36,7 +36,7 @@ struct optimize_size { };
    -

    Description

    +

    Description

    This option setter specifies if the hook should be optimized for size instead of for speed.

    diff --git a/doc/html/boost/intrusive/pack_options.html b/doc/html/boost/intrusive/pack_options.html index f6008236e9..1c05f8dc25 100644 --- a/doc/html/boost/intrusive/pack_options.html +++ b/doc/html/boost/intrusive/pack_options.html @@ -38,7 +38,7 @@ typedef unspecified_type type; };
    -

    Description

    +

    Description

    This class is a utility that takes:

    • a default options class defining initial static constant and typedefs

      • diff --git a/doc/html/boost/intrusive/pointer__idm46322884203360.html b/doc/html/boost/intrusive/pointer__idm46322884203360.html new file mode 100644 index 0000000000..eb805dac89 --- /dev/null +++ b/doc/html/boost/intrusive/pointer__idm46322884203360.html @@ -0,0 +1,109 @@ + + + + +Struct template pointer_traits<T *> + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Struct template pointer_traits<T *>

      +

      boost::intrusive::pointer_traits<T *>

      +
      +

      Synopsis

      +
      // In header: <boost/intrusive/pointer_traits.hpp>
+
+template<typename T> 
+struct pointer_traits<T *> {
+  // types
+  typedef T              element_type;   
+  typedef T *            pointer;        
+  typedef std::ptrdiff_t difference_type;
+  typedef T &            reference;      
+  typedef U *            rebind;         
+
+  // member classes/structs/unions
+  template<typename U> 
+  struct rebind_pointer {
+    // types
+    typedef U * type;
+  };
+
+  // public static functions
+  static pointer pointer_to(reference);
+  template<typename U> static pointer static_cast_from(U *);
+  template<typename U> static pointer const_cast_from(U *);
+  template<typename U> static pointer dynamic_cast_from(U *);
+};
      +
      +

      Description

      +

      Specialization of pointer_traits for raw pointers

      +
      +

      +pointer_traits + public + types

      +
      1. +

        +typedef U * rebind;

        +

        typedef for <preformatted>U *</preformatted>

        +

        For portable code for C++03 and C++11, <preformatted>typename rebind_pointer<U>::type</preformatted> shall be used instead of rebind<U> to obtain a pointer to U.

        +
      +
      +
      +

      +pointer_traits public static functions

      +
        +
      1. +
        static pointer pointer_to(reference r);
        +

        Returns: addressof(r)

        +
        2. +
      2. +
        template<typename U> static pointer static_cast_from(U * uptr);
        +

        Returns: static_cast<pointer>(uptr)

        +
        3. +
      3. +
        template<typename U> static pointer const_cast_from(U * uptr);
        +

        Returns: const_cast<pointer>(uptr)

        +
        4. +
      4. +
        template<typename U> static pointer dynamic_cast_from(U * uptr);
        +

        Returns: dynamic_cast<pointer>(uptr)

        +
        5. +
      +
      +
      +
      + + + +
      Copyright © 2005 Olaf Krzikalla
      Copyright © 2006-2015 Ion Gaztanaga

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/intrusive/pointer__idm46322884203360/rebind_pointer.html b/doc/html/boost/intrusive/pointer__idm46322884203360/rebind_pointer.html new file mode 100644 index 0000000000..c59022ec7d --- /dev/null +++ b/doc/html/boost/intrusive/pointer__idm46322884203360/rebind_pointer.html @@ -0,0 +1,55 @@ + + + + +Struct template rebind_pointer + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Struct template rebind_pointer

      +

      boost::intrusive::pointer_traits<T *>::rebind_pointer

      +
      +

      Synopsis

      +
      // In header: <boost/intrusive/pointer_traits.hpp>
+
+
+template<typename U> 
+struct rebind_pointer {
+  // types
+  typedef U * type;
+};
      +
      + + + +
      Copyright © 2005 Olaf Krzikalla
      Copyright © 2006-2015 Ion Gaztanaga

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/intrusive/pointer__idm46322884251312.html b/doc/html/boost/intrusive/pointer__idm46322884251312.html new file mode 100644 index 0000000000..c136eede52 --- /dev/null +++ b/doc/html/boost/intrusive/pointer__idm46322884251312.html @@ -0,0 +1,55 @@ + + + + +Struct template pointer_rebinder<Ptr< A, An...>, U, 0u> + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Struct template pointer_rebinder<Ptr< A, An...>, U, 0u>

      +

      boost::intrusive::pointer_rebinder<Ptr< A, An...>, U, 0u>

      +
      +

      Synopsis

      +
      // In header: <boost/intrusive/pointer_rebind.hpp>
+
+template<template< class, class...> class Ptr, typename A, class... An, 
+         typename U> 
+struct pointer_rebinder<Ptr< A, An...>, U, 0u> {
+  // types
+  typedef Ptr< U, An...> type;
+};
      +
      + + + +
      Copyright © 2005 Olaf Krzikalla
      Copyright © 2006-2015 Ion Gaztanaga

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/intrusive/pointer__idm46322884255808.html b/doc/html/boost/intrusive/pointer__idm46322884255808.html new file mode 100644 index 0000000000..f48725a8a7 --- /dev/null +++ b/doc/html/boost/intrusive/pointer__idm46322884255808.html @@ -0,0 +1,54 @@ + + + + +Struct template pointer_rebinder<Ptr< A >, U, 0u> + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Struct template pointer_rebinder<Ptr< A >, U, 0u>

      +

      boost::intrusive::pointer_rebinder<Ptr< A >, U, 0u>

      +
      +

      Synopsis

      +
      // In header: <boost/intrusive/pointer_rebind.hpp>
+
+template<template< class > class Ptr, typename A, typename U> 
+struct pointer_rebinder<Ptr< A >, U, 0u> {
+  // types
+  typedef Ptr< U > type;
+};
      +
      + + + +
      Copyright © 2005 Olaf Krzikalla
      Copyright © 2006-2015 Ion Gaztanaga

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/intrusive/pointer__idm46322884259472.html b/doc/html/boost/intrusive/pointer__idm46322884259472.html new file mode 100644 index 0000000000..8120943f07 --- /dev/null +++ b/doc/html/boost/intrusive/pointer__idm46322884259472.html @@ -0,0 +1,54 @@ + + + + +Struct template pointer_rebinder<Ptr, U, 2u> + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Struct template pointer_rebinder<Ptr, U, 2u>

      +

      boost::intrusive::pointer_rebinder<Ptr, U, 2u>

      +
      +

      Synopsis

      +
      // In header: <boost/intrusive/pointer_rebind.hpp>
+
+template<typename Ptr, typename U> 
+struct pointer_rebinder<Ptr, U, 2u> {
+  // types
+  typedef Ptr::template rebind< U >::other type;
+};
      +
      + + + +
      Copyright © 2005 Olaf Krzikalla
      Copyright © 2006-2015 Ion Gaztanaga

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/intrusive/pointer__idm46322884263136.html b/doc/html/boost/intrusive/pointer__idm46322884263136.html new file mode 100644 index 0000000000..d8556380a2 --- /dev/null +++ b/doc/html/boost/intrusive/pointer__idm46322884263136.html @@ -0,0 +1,54 @@ + + + + +Struct template pointer_rebinder<Ptr, U, 1u> + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Struct template pointer_rebinder<Ptr, U, 1u>

      +

      boost::intrusive::pointer_rebinder<Ptr, U, 1u>

      +
      +

      Synopsis

      +
      // In header: <boost/intrusive/pointer_rebind.hpp>
+
+template<typename Ptr, typename U> 
+struct pointer_rebinder<Ptr, U, 1u> {
+  // types
+  typedef Ptr::template rebind< U > type;
+};
      +
      + + + +
      Copyright © 2005 Olaf Krzikalla
      Copyright © 2006-2015 Ion Gaztanaga

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/intrusive/pointer__idm46322884274320.html b/doc/html/boost/intrusive/pointer__idm46322884274320.html new file mode 100644 index 0000000000..d29f198982 --- /dev/null +++ b/doc/html/boost/intrusive/pointer__idm46322884274320.html @@ -0,0 +1,54 @@ + + + + +Struct template pointer_rebind<T *, U> + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Struct template pointer_rebind<T *, U>

      +

      boost::intrusive::pointer_rebind<T *, U>

      +
      +

      Synopsis

      +
      // In header: <boost/intrusive/pointer_rebind.hpp>
+
+template<typename T, typename U> 
+struct pointer_rebind<T *, U> {
+  // types
+  typedef U * type;
+};
      +
      + + + +
      Copyright © 2005 Olaf Krzikalla
      Copyright © 2006-2015 Ion Gaztanaga

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/intrusive/pointer__idm46322884320704.html b/doc/html/boost/intrusive/pointer__idm46322884320704.html new file mode 100644 index 0000000000..de473746f1 --- /dev/null +++ b/doc/html/boost/intrusive/pointer__idm46322884320704.html @@ -0,0 +1,77 @@ + + + + +Struct template pointer_plus_bits<T *, NumBits> + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Struct template pointer_plus_bits<T *, NumBits>

      +

      boost::intrusive::pointer_plus_bits<T *, NumBits>

      +
      +

      Synopsis

      +
      // In header: <boost/intrusive/pointer_plus_bits.hpp>
+
+template<typename T, std::size_t NumBits> 
+struct pointer_plus_bits<T *, NumBits> {
+  // types
+  typedef T * pointer;
+
+  // public static functions
+  static pointer get_pointer(pointer);
+  static void set_pointer(pointer &, pointer);
+  static std::size_t get_bits(pointer);
+  static void set_bits(pointer &, std::size_t);
+
+  // public data members
+  static const uintptr_t Mask;
+};
      +
      +

      Description

      +

      This is the specialization to embed extra bits of information in a raw pointer. The extra bits are stored in the lower bits of the pointer.

      +
      +

      +pointer_plus_bits public static functions

      +
        +
      1. static pointer get_pointer(pointer n);
        2. +
      2. static void set_pointer(pointer & n, pointer p);
        3. +
      3. static std::size_t get_bits(pointer n);
        4. +
      4. static void set_bits(pointer & n, std::size_t c);
        5. +
      +
      +
      +
      + + + +
      Copyright © 2005 Olaf Krzikalla
      Copyright © 2006-2015 Ion Gaztanaga

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/intrusive/pointer_has_rebind.html b/doc/html/boost/intrusive/pointer_has_rebind.html index 59e5d6ba95..f27dfb2bed 100644 --- a/doc/html/boost/intrusive/pointer_has_rebind.html +++ b/doc/html/boost/intrusive/pointer_has_rebind.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      @@ -38,25 +38,25 @@ template<typename V> struct any { // construct/copy/destruct - any(const V &); + any(const V &); }; - // public static functions + // public static functions template<typename X> - static char test(int, typename X::template rebind< U > *); - template<typename X> static int test(any< int >, void *); + static char test(int, typename X::template rebind< U > *); + template<typename X> static int test(any< int >, void *); // public data members static const bool value; };
      -

      Description

      +

      Description

      -

      -pointer_has_rebind public static functions

      +

      +pointer_has_rebind public static functions

        -
      1. template<typename X> static char test(int, typename X::template rebind< U > *);
        2. -
      2. template<typename X> static int test(any< int >, void *);
        3. +
      3. template<typename X> static char test(int, typename X::template rebind< U > *);
        4. +
      4. template<typename X> static int test(any< int >, void *);
      @@ -71,7 +71,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/intrusive/pointer_has_rebind/any.html b/doc/html/boost/intrusive/pointer_has_rebind/any.html index 37dba71083..28126cc766 100644 --- a/doc/html/boost/intrusive/pointer_has_rebind/any.html +++ b/doc/html/boost/intrusive/pointer_has_rebind/any.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      @@ -36,16 +36,16 @@ template<typename V> struct any { // construct/copy/destruct - any(const V &); + any(const V &); };
      -

      Description

      +

      Description

      -

      +

      any public construct/copy/destruct

      -
      1. any(const V &);
      +
      1. any(const V &);
    @@ -59,7 +59,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/intrusive/pointer_has_rebind_other.html b/doc/html/boost/intrusive/pointer_has_rebind_other.html index 11d844757a..fd6d21476c 100644 --- a/doc/html/boost/intrusive/pointer_has_rebind_other.html +++ b/doc/html/boost/intrusive/pointer_has_rebind_other.html @@ -38,26 +38,26 @@ template<typename V> struct any { // construct/copy/destruct - any(const V &); + any(const V &); }; - // public static functions + // public static functions template<typename X> - static char test(int, typename X::template rebind< U >::other *); - template<typename X> static int test(any< int >, void *); + static char test(int, typename X::template rebind< U >::other *); + template<typename X> static int test(any< int >, void *); // public data members static const bool value; };
    -

    Description

    +

    Description

    -

    -pointer_has_rebind_other public static functions

    +

    +pointer_has_rebind_other public static functions

    1. template<typename X> 
-  static char test(int, typename X::template rebind< U >::other *);
      2. -
    2. template<typename X> static int test(any< int >, void *);
      3. + static char test(int, typename X::template rebind< U >::other *); +
    3. template<typename X> static int test(any< int >, void *);
    diff --git a/doc/html/boost/intrusive/pointer_has_rebind_other/any.html b/doc/html/boost/intrusive/pointer_has_rebind_other/any.html index dee7475d53..872a77c1e4 100644 --- a/doc/html/boost/intrusive/pointer_has_rebind_other/any.html +++ b/doc/html/boost/intrusive/pointer_has_rebind_other/any.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -36,16 +36,16 @@ template<typename V> struct any { // construct/copy/destruct - any(const V &); + any(const V &); };
    -

    Description

    +

    Description

    -

    +

    any public construct/copy/destruct

    -
    1. any(const V &);
    +
    1. any(const V &);
    @@ -59,7 +59,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/intrusive/pointer_plus_b_idp48912400.html b/doc/html/boost/intrusive/pointer_plus_b_idp48912400.html deleted file mode 100644 index 9f4d239be2..0000000000 --- a/doc/html/boost/intrusive/pointer_plus_b_idp48912400.html +++ /dev/null @@ -1,77 +0,0 @@ - - - - -Struct template pointer_plus_bits<T *, NumBits> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template pointer_plus_bits<T *, NumBits>

    -

    boost::intrusive::pointer_plus_bits<T *, NumBits>

    -
    -

    Synopsis

    -
    // In header: <boost/intrusive/pointer_plus_bits.hpp>
-
-template<typename T, std::size_t NumBits> 
-struct pointer_plus_bits<T *, NumBits> {
-  // types
-  typedef T * pointer;
-
-  // public static functions
-  static pointer get_pointer(pointer);
-  static void set_pointer(pointer &, pointer);
-  static std::size_t get_bits(pointer);
-  static void set_bits(pointer &, std::size_t);
-
-  // public data members
-  static const std::size_t Mask;
-};
    -
    -

    Description

    -

    This is the specialization to embed extra bits of information in a raw pointer. The extra bits are stored in the lower bits of the pointer.

    -
    -

    -pointer_plus_bits public static functions

    -
      -
    1. static pointer get_pointer(pointer n);
      2. -
    2. static void set_pointer(pointer & n, pointer p);
      3. -
    3. static std::size_t get_bits(pointer n);
      4. -
    4. static void set_bits(pointer & n, std::size_t c);
      5. -
    -
    -
    -
    - - - -
    Copyright © 2005 Olaf Krzikalla
    Copyright © 2006-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/intrusive/pointer_plus_bits.html b/doc/html/boost/intrusive/pointer_plus_bits.html index 683c7c4dc7..a8142d34f7 100644 --- a/doc/html/boost/intrusive/pointer_plus_bits.html +++ b/doc/html/boost/intrusive/pointer_plus_bits.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -36,7 +36,7 @@ struct pointer_plus_bits { };
    -

    Description

    +

    Description

    This is class that is supposed to have static methods to embed extra bits of information in a pointer. This is a declaration and there is no default implementation, because operations to embed the bits change with every pointer type.

    An implementation that detects that a pointer type whose has_pointer_plus_bits<>::value is non-zero can make use of these operations to embed the bits in the pointer.

    @@ -51,7 +51,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/intrusive/pointer_rebind.html b/doc/html/boost/intrusive/pointer_rebind.html index aed417e6ec..9f07413ba0 100644 --- a/doc/html/boost/intrusive/pointer_rebind.html +++ b/doc/html/boost/intrusive/pointer_rebind.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -47,7 +47,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/intrusive/pointer_rebind_idp48958784.html b/doc/html/boost/intrusive/pointer_rebind_idp48958784.html deleted file mode 100644 index d1f76d8630..0000000000 --- a/doc/html/boost/intrusive/pointer_rebind_idp48958784.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template pointer_rebind<T *, U> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template pointer_rebind<T *, U>

    -

    boost::intrusive::pointer_rebind<T *, U>

    -
    -

    Synopsis

    -
    // In header: <boost/intrusive/pointer_rebind.hpp>
-
-template<typename T, typename U> 
-struct pointer_rebind<T *, U> {
-  // types
-  typedef U * type;
-};
    -
    - - - -
    Copyright © 2005 Olaf Krzikalla
    Copyright © 2006-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/intrusive/pointer_rebind_idp48969968.html b/doc/html/boost/intrusive/pointer_rebind_idp48969968.html deleted file mode 100644 index 3aa327e605..0000000000 --- a/doc/html/boost/intrusive/pointer_rebind_idp48969968.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template pointer_rebinder<Ptr, U, 1u> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template pointer_rebinder<Ptr, U, 1u>

    -

    boost::intrusive::pointer_rebinder<Ptr, U, 1u>

    -
    -

    Synopsis

    -
    // In header: <boost/intrusive/pointer_rebind.hpp>
-
-template<typename Ptr, typename U> 
-struct pointer_rebinder<Ptr, U, 1u> {
-  // types
-  typedef Ptr::template rebind< U > type;
-};
    -
    - - - -
    Copyright © 2005 Olaf Krzikalla
    Copyright © 2006-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/intrusive/pointer_rebind_idp48973632.html b/doc/html/boost/intrusive/pointer_rebind_idp48973632.html deleted file mode 100644 index fe2691c6d9..0000000000 --- a/doc/html/boost/intrusive/pointer_rebind_idp48973632.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template pointer_rebinder<Ptr, U, 2u> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template pointer_rebinder<Ptr, U, 2u>

    -

    boost::intrusive::pointer_rebinder<Ptr, U, 2u>

    -
    -

    Synopsis

    -
    // In header: <boost/intrusive/pointer_rebind.hpp>
-
-template<typename Ptr, typename U> 
-struct pointer_rebinder<Ptr, U, 2u> {
-  // types
-  typedef Ptr::template rebind< U >::other type;
-};
    -
    - - - -
    Copyright © 2005 Olaf Krzikalla
    Copyright © 2006-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/intrusive/pointer_rebind_idp48977296.html b/doc/html/boost/intrusive/pointer_rebind_idp48977296.html deleted file mode 100644 index 59f4f5576d..0000000000 --- a/doc/html/boost/intrusive/pointer_rebind_idp48977296.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template pointer_rebinder<Ptr< A >, U, 0u> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template pointer_rebinder<Ptr< A >, U, 0u>

    -

    boost::intrusive::pointer_rebinder<Ptr< A >, U, 0u>

    -
    -

    Synopsis

    -
    // In header: <boost/intrusive/pointer_rebind.hpp>
-
-template<template< class > class Ptr, typename A, typename U> 
-struct pointer_rebinder<Ptr< A >, U, 0u> {
-  // types
-  typedef Ptr< U > type;
-};
    -
    - - - -
    Copyright © 2005 Olaf Krzikalla
    Copyright © 2006-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/intrusive/pointer_rebind_idp48981792.html b/doc/html/boost/intrusive/pointer_rebind_idp48981792.html deleted file mode 100644 index 91fe17b845..0000000000 --- a/doc/html/boost/intrusive/pointer_rebind_idp48981792.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template pointer_rebinder<Ptr< A, An...>, U, 0u> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template pointer_rebinder<Ptr< A, An...>, U, 0u>

    -

    boost::intrusive::pointer_rebinder<Ptr< A, An...>, U, 0u>

    -
    -

    Synopsis

    -
    // In header: <boost/intrusive/pointer_rebind.hpp>
-
-template<template< class, class...> class Ptr, typename A, class... An, 
-         typename U> 
-struct pointer_rebinder<Ptr< A, An...>, U, 0u> {
-  // types
-  typedef Ptr< U, An...> type;
-};
    -
    - - - -
    Copyright © 2005 Olaf Krzikalla
    Copyright © 2006-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/intrusive/pointer_rebind_mode.html b/doc/html/boost/intrusive/pointer_rebind_mode.html index 15d0876ece..a3f0dfbb15 100644 --- a/doc/html/boost/intrusive/pointer_rebind_mode.html +++ b/doc/html/boost/intrusive/pointer_rebind_mode.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -51,7 +51,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/intrusive/pointer_rebinder.html b/doc/html/boost/intrusive/pointer_rebinder.html index 6d9c4b3487..c8b00b9770 100644 --- a/doc/html/boost/intrusive/pointer_rebinder.html +++ b/doc/html/boost/intrusive/pointer_rebinder.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -46,7 +46,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/intrusive/pointer_traits.html b/doc/html/boost/intrusive/pointer_traits.html index 18c73a1e41..71a57cd7d3 100644 --- a/doc/html/boost/intrusive/pointer_traits.html +++ b/doc/html/boost/intrusive/pointer_traits.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -41,19 +41,19 @@ typedef unspecified rebind; typedef unspecified_type reference; - // public static functions - static pointer pointer_to(reference); - template<typename UPtr> static pointer static_cast_from(const UPtr &); - template<typename UPtr> static pointer const_cast_from(const UPtr &); - template<typename UPtr> static pointer dynamic_cast_from(const UPtr &); + // public static functions + static pointer pointer_to(reference); + template<typename UPtr> static pointer static_cast_from(const UPtr &); + template<typename UPtr> static pointer const_cast_from(const UPtr &); + template<typename UPtr> static pointer dynamic_cast_from(const UPtr &); };
    -

    Description

    +

    Description

    pointer_traits is the implementation of C++11 std::pointer_traits class with some extensions like castings.

    pointer_traits supplies a uniform interface to certain attributes of pointer-like types.

    Note: When defining a custom family of pointers or references to be used with BI library, make sure the public static conversion functions accessed through the pointer_traits interface (*_cast_from and pointer_to) can properly convert between const and nonconst referred member types without the use of implicit constructor calls. It is suggested these conversions be implemented as function templates, where the template argument is the type of the object being converted from.

    -

    +

    pointer_traits public types

    @@ -87,29 +87,29 @@
    -

    -pointer_traits public static functions

    +

    +pointer_traits public static functions

    1. -
      static pointer pointer_to(reference r);
      +
      static pointer pointer_to(reference r);

      Remark: If element_type is (possibly cv-qualified) void, r type is unspecified; otherwise, it is element_type &.

      Returns: A dereferenceable pointer to r obtained by calling Ptr::pointer_to(reference). Non-standard extension: If such function does not exist, returns pointer(addressof(r));

      Note: For non-conforming compilers only the existence of a member function called pointer_to is checked.

    2. -
      template<typename UPtr> static pointer static_cast_from(const UPtr & uptr);
      +
      template<typename UPtr> static pointer static_cast_from(const UPtr & uptr);

      Remark: Non-standard extension.

      Returns: A dereferenceable pointer to r obtained by calling the static template function Ptr::static_cast_from(UPpr/const UPpr &). If such function does not exist, returns pointer_to(static_cast<element_type&>(*uptr))

      Note: For non-conforming compilers only the existence of a member function called static_cast_from is checked.

    3. -
      template<typename UPtr> static pointer const_cast_from(const UPtr & uptr);
      +
      template<typename UPtr> static pointer const_cast_from(const UPtr & uptr);

      Remark: Non-standard extension.

      Returns: A dereferenceable pointer to r obtained by calling the static template function Ptr::const_cast_from<UPtr>(UPpr/const UPpr &). If such function does not exist, returns pointer_to(const_cast<element_type&>(*uptr))

      Note: For non-conforming compilers only the existence of a member function called const_cast_from is checked.

    4. -
      template<typename UPtr> static pointer dynamic_cast_from(const UPtr & uptr);
      +
      template<typename UPtr> static pointer dynamic_cast_from(const UPtr & uptr);

      Remark: Non-standard extension.

      Returns: A dereferenceable pointer to r obtained by calling the static template function Ptr::dynamic_cast_from<UPtr>(UPpr/const UPpr &). If such function does not exist, returns pointer_to(dynamic_cast<element_type>(&*uptr))

      Note: For non-conforming compilers only the existence of a member function called dynamic_cast_from is checked.

      @@ -128,7 +128,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/intrusive/pointer_traits_idp49029744.html b/doc/html/boost/intrusive/pointer_traits_idp49029744.html deleted file mode 100644 index 9456a087c8..0000000000 --- a/doc/html/boost/intrusive/pointer_traits_idp49029744.html +++ /dev/null @@ -1,109 +0,0 @@ - - - - -Struct template pointer_traits<T *> - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Struct template pointer_traits<T *>

      -

      boost::intrusive::pointer_traits<T *>

      -
      -

      Synopsis

      -
      // In header: <boost/intrusive/pointer_traits.hpp>
-
-template<typename T> 
-struct pointer_traits<T *> {
-  // types
-  typedef T              element_type;   
-  typedef T *            pointer;        
-  typedef std::ptrdiff_t difference_type;
-  typedef T &            reference;      
-  typedef U *            rebind;         
-
-  // member classes/structs/unions
-  template<typename U> 
-  struct rebind_pointer {
-    // types
-    typedef U * type;
-  };
-
-  // public static functions
-  static pointer pointer_to(reference);
-  template<typename U> static pointer static_cast_from(U *);
-  template<typename U> static pointer const_cast_from(U *);
-  template<typename U> static pointer dynamic_cast_from(U *);
-};
      -
      -

      Description

      -

      Specialization of pointer_traits for raw pointers

      -
      -

      -pointer_traits - public - types

      -
      1. -

        -typedef U * rebind;

        -

        typedef for <preformatted>U *</preformatted>

        -

        For portable code for C++03 and C++11, <preformatted>typename rebind_pointer<U>::type</preformatted> shall be used instead of rebind<U> to obtain a pointer to U.

        -
      -
      -
      -

      -pointer_traits public static functions

      -
        -
      1. -
        static pointer pointer_to(reference r);
        -

        Returns: addressof(r)

        -
        2. -
      2. -
        template<typename U> static pointer static_cast_from(U * uptr);
        -

        Returns: static_cast<pointer>(uptr)

        -
        3. -
      3. -
        template<typename U> static pointer const_cast_from(U * uptr);
        -

        Returns: const_cast<pointer>(uptr)

        -
        4. -
      4. -
        template<typename U> static pointer dynamic_cast_from(U * uptr);
        -

        Returns: dynamic_cast<pointer>(uptr)

        -
        5. -
      -
      -
      -
      - - - -
      Copyright © 2005 Olaf Krzikalla
      Copyright © 2006-2015 Ion Gaztanaga

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/intrusive/pointer_traits_idp49029744/rebind_pointer.html b/doc/html/boost/intrusive/pointer_traits_idp49029744/rebind_pointer.html deleted file mode 100644 index f0b7f6a0c7..0000000000 --- a/doc/html/boost/intrusive/pointer_traits_idp49029744/rebind_pointer.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template rebind_pointer - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Struct template rebind_pointer

      -

      boost::intrusive::pointer_traits<T *>::rebind_pointer

      -
      -

      Synopsis

      -
      // In header: <boost/intrusive/pointer_traits.hpp>
-
-
-template<typename U> 
-struct rebind_pointer {
-  // types
-  typedef U * type;
-};
      -
      - - - -
      Copyright © 2005 Olaf Krzikalla
      Copyright © 2006-2015 Ion Gaztanaga

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/intrusive/power_2_buckets.html b/doc/html/boost/intrusive/power_2_buckets.html index 041c54de02..cc708fe539 100644 --- a/doc/html/boost/intrusive/power_2_buckets.html +++ b/doc/html/boost/intrusive/power_2_buckets.html @@ -36,7 +36,7 @@ struct power_2_buckets { };
    -

    Description

    +

    Description

    This option setter specifies if the bucket array will be always power of two. This allows using masks instead of the default modulo operation to determine the bucket number from the hash value, leading to better performance. In debug mode, if power of two buckets mode is activated, the bucket length will be checked with assertions.

    diff --git a/doc/html/boost/intrusive/priority.html b/doc/html/boost/intrusive/priority.html index 5c21ef032b..2b18c322be 100644 --- a/doc/html/boost/intrusive/priority.html +++ b/doc/html/boost/intrusive/priority.html @@ -36,7 +36,7 @@ struct priority { };
    -

    Description

    +

    Description

    This option setter specifies the equality functor for the value type

    diff --git a/doc/html/boost/intrusive/priority_compare.html b/doc/html/boost/intrusive/priority_compare.html index 4267c01817..f1dfca1424 100644 --- a/doc/html/boost/intrusive/priority_compare.html +++ b/doc/html/boost/intrusive/priority_compare.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -39,15 +39,15 @@ typedef T second_argument_type; typedef bool result_type; - // public member functions - bool operator()(const T &, const T &) const; + // public member functions + bool operator()(const T &, const T &) const; };
    -

    Description

    +

    Description

    -

    -priority_compare public member functions

    -
    1. bool operator()(const T & val, const T & val2) const;
    +

    +priority_compare public member functions

    +
    1. bool operator()(const T & val, const T & val2) const;
    @@ -61,7 +61,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/intrusive/rbtree.html b/doc/html/boost/intrusive/rbtree.html index d09bbfd0b4..ec12a507af 100644 --- a/doc/html/boost/intrusive/rbtree.html +++ b/doc/html/boost/intrusive/rbtree.html @@ -60,145 +60,145 @@ typedef implementation_defined::insert_commit_data insert_commit_data; // construct/copy/destruct - explicit rbtree(const key_compare & = key_compare(), + explicit rbtree(const key_compare & = key_compare(), const value_traits & = value_traits()); template<typename Iterator> - rbtree(bool, Iterator, Iterator, const key_compare & = key_compare(), + rbtree(bool, Iterator, Iterator, const key_compare & = key_compare(), const value_traits & = value_traits()); - rbtree(rbtree &&); - rbtree & operator=(rbtree &&); - ~rbtree(); + rbtree(rbtree &&); + rbtree & operator=(rbtree &&); + ~rbtree(); - // public member functions - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end(); - const_iterator end() const; - const_iterator cend() const; - reverse_iterator rbegin(); - const_reverse_iterator rbegin() const; - const_reverse_iterator crbegin() const; - reverse_iterator rend(); - const_reverse_iterator rend() const; - const_reverse_iterator crend() const; - key_compare key_comp() const; - value_compare value_comp() const; - bool empty() const; - size_type size() const; - void swap(rbtree &); + // public member functions + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end(); + const_iterator end() const; + const_iterator cend() const; + reverse_iterator rbegin(); + const_reverse_iterator rbegin() const; + const_reverse_iterator crbegin() const; + reverse_iterator rend(); + const_reverse_iterator rend() const; + const_reverse_iterator crend() const; + key_compare key_comp() const; + value_compare value_comp() const; + bool empty() const; + size_type size() const; + void swap(rbtree &); template<typename Cloner, typename Disposer> - void clone_from(const rbtree &, Cloner, Disposer); + void clone_from(const rbtree &, Cloner, Disposer); template<typename Cloner, typename Disposer> - void clone_from(rbtree &&, Cloner, Disposer); + void clone_from(rbtree &&, Cloner, Disposer); template<typename Cloner, typename Disposer> - void clone_from(rbtree &&, Cloner, Disposer); - iterator insert_equal(reference); - iterator insert_equal(const_iterator, reference); - template<typename Iterator> void insert_equal(Iterator, Iterator); - std::pair< iterator, bool > insert_unique(reference); - iterator insert_unique(const_iterator, reference); + void clone_from(rbtree &&, Cloner, Disposer); + iterator insert_equal(reference); + iterator insert_equal(const_iterator, reference); + template<typename Iterator> void insert_equal(Iterator, Iterator); + std::pair< iterator, bool > insert_unique(reference); + iterator insert_unique(const_iterator, reference); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, bool > - insert_unique_check(const KeyType &, KeyTypeKeyCompare, + insert_unique_check(const KeyType &, KeyTypeKeyCompare, insert_commit_data &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, bool > - insert_unique_check(const_iterator, const KeyType &, KeyTypeKeyCompare, + insert_unique_check(const_iterator, const KeyType &, KeyTypeKeyCompare, insert_commit_data &); - iterator insert_unique_commit(reference, const insert_commit_data &); - template<typename Iterator> void insert_unique(Iterator, Iterator); - iterator insert_before(const_iterator, reference); - void push_back(reference); - void push_front(reference); - iterator erase(const_iterator); - iterator erase(const_iterator, const_iterator); - size_type erase(const key_type &); + iterator insert_unique_commit(reference, const insert_commit_data &); + template<typename Iterator> void insert_unique(Iterator, Iterator); + iterator insert_before(const_iterator, reference); + void push_back(reference); + void push_front(reference); + iterator erase(const_iterator); + iterator erase(const_iterator, const_iterator); + size_type erase(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - size_type erase(const KeyType &, KeyTypeKeyCompare); + size_type erase(const KeyType &, KeyTypeKeyCompare); template<typename Disposer> - iterator erase_and_dispose(const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, Disposer); template<typename Disposer> - iterator erase_and_dispose(const_iterator, const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, const_iterator, Disposer); template<typename Disposer> - size_type erase_and_dispose(const key_type &, Disposer); + size_type erase_and_dispose(const key_type &, Disposer); template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> - size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); - void clear(); - template<typename Disposer> void clear_and_dispose(Disposer); - size_type count(const key_type &) const; + size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); + void clear(); + template<typename Disposer> void clear_and_dispose(Disposer); + size_type count(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - size_type count(const KeyType &, KeyTypeKeyCompare) const; - iterator lower_bound(const key_type &); + size_type count(const KeyType &, KeyTypeKeyCompare) const; + iterator lower_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator lower_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator lower_bound(const key_type &) const; + iterator lower_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator lower_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator upper_bound(const key_type &); + const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator upper_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator upper_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator upper_bound(const key_type &) const; + iterator upper_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator upper_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator find(const key_type &); + const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator find(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator find(const KeyType &, KeyTypeKeyCompare); - const_iterator find(const key_type &) const; + iterator find(const KeyType &, KeyTypeKeyCompare); + const_iterator find(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator find(const KeyType &, KeyTypeKeyCompare) const; - std::pair< iterator, iterator > equal_range(const key_type &); + const_iterator find(const KeyType &, KeyTypeKeyCompare) const; + std::pair< iterator, iterator > equal_range(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - equal_range(const KeyType &, KeyTypeKeyCompare); + equal_range(const KeyType &, KeyTypeKeyCompare); std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; + equal_range(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - equal_range(const KeyType &, KeyTypeKeyCompare) const; + equal_range(const KeyType &, KeyTypeKeyCompare) const; std::pair< iterator, iterator > - bounded_range(const key_type &, const key_type &, bool, bool); + bounded_range(const key_type &, const key_type &, bool, bool); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool); std::pair< const_iterator, const_iterator > - bounded_range(const key_type &, const key_type &, bool, bool) const; + bounded_range(const key_type &, const key_type &, bool, bool) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool) const; - iterator iterator_to(reference); - const_iterator iterator_to(const_reference) const; - pointer unlink_leftmost_without_rebalance(); - void replace_node(iterator, reference); - void remove_node(reference); + iterator iterator_to(reference); + const_iterator iterator_to(const_reference) const; + pointer unlink_leftmost_without_rebalance(); + void replace_node(iterator, reference); + void remove_node(reference); - // public static functions - static rbtree & container_from_end_iterator(iterator); - static const rbtree & container_from_end_iterator(const_iterator); - static rbtree & container_from_iterator(iterator); - static const rbtree & container_from_iterator(const_iterator); - static iterator s_iterator_to(reference); - static const_iterator s_iterator_to(const_reference); - static void init_node(reference); + // public static functions + static rbtree & container_from_end_iterator(iterator); + static const rbtree & container_from_end_iterator(const_iterator); + static rbtree & container_from_iterator(iterator); + static const rbtree & container_from_iterator(const_iterator); + static iterator s_iterator_to(reference); + static const_iterator s_iterator_to(const_reference); + static void init_node(reference); // public data members static const bool constant_time_size; };
    -

    Description

    +

    Description

    The class template rbtree is an intrusive red-black tree container, that is used to construct intrusive set and multiset containers. The no-throw guarantee holds only, if the key_compare object doesn't throw.

    The template parameter T is the type to be managed by the container. The user can specify additional options and if no options are provided default options are used.

    The container supports the following options: base_hook<>/member_hook<>/value_traits<>, constant_time_size<>, size_type<> and compare<>.

    -

    +

    rbtree public construct/copy/destruct

    1. -
      explicit rbtree(const key_compare & cmp = key_compare(), 
+
      explicit rbtree(const key_compare & cmp = key_compare(), 
                 const value_traits & v_traits = value_traits());
      
 
      Effects: Constructs an empty container.
      
 
      Complexity: Constant.
      
@@ -206,7 +206,7 @@
 
    2. template<typename Iterator> 
-  rbtree(bool unique, Iterator b, Iterator e, 
+  rbtree(bool unique, Iterator b, Iterator e, 
          const key_compare & cmp = key_compare(), 
          const value_traits & v_traits = value_traits());

      Requires: Dereferencing iterator must yield an lvalue of type value_type. cmp must be a comparison function that induces a strict weak ordering.

      @@ -215,15 +215,15 @@

      Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor/operator() of the key_compare object throws. Basic guarantee.

    3. -
      rbtree(rbtree && x);
      +
      rbtree(rbtree && x);

      Effects: to-do

    4. -
      rbtree & operator=(rbtree && x);
      +
      rbtree & operator=(rbtree && x);

      Effects: to-do

    5. -
      ~rbtree();
      +
      ~rbtree();

      Effects: Detaches all elements from this. The objects in the set are not deleted (i.e. no destructors are called), but the nodes according to the value_traits template parameter are reinitialized and thus can be reused.

      Complexity: Linear to elements contained in *this.

      Throws: Nothing.

      @@ -231,114 +231,114 @@
    -

    -rbtree public member functions

    +

    +rbtree public member functions

    1. -
      iterator begin();
      +
      iterator begin();

      Effects: Returns an iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    2. -
      const_iterator begin() const;
      +
      const_iterator begin() const;

      Effects: Returns a const_iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    3. -
      const_iterator cbegin() const;
      +
      const_iterator cbegin() const;

      Effects: Returns a const_iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    4. -
      iterator end();
      +
      iterator end();

      Effects: Returns an iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    5. -
      const_iterator end() const;
      +
      const_iterator end() const;

      Effects: Returns a const_iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    6. -
      const_iterator cend() const;
      +
      const_iterator cend() const;

      Effects: Returns a const_iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    7. -
      reverse_iterator rbegin();
      +
      reverse_iterator rbegin();

      Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    8. -
      const_reverse_iterator rbegin() const;
      +
      const_reverse_iterator rbegin() const;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    9. -
      const_reverse_iterator crbegin() const;
      +
      const_reverse_iterator crbegin() const;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    10. -
      reverse_iterator rend();
      +
      reverse_iterator rend();

      Effects: Returns a reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    11. -
      const_reverse_iterator rend() const;
      +
      const_reverse_iterator rend() const;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    12. -
      const_reverse_iterator crend() const;
      +
      const_reverse_iterator crend() const;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    13. -
      key_compare key_comp() const;
      +
      key_compare key_comp() const;

      Effects: Returns the key_compare object used by the container.

      Complexity: Constant.

      Throws: If key_compare copy-constructor throws.

    14. -
      value_compare value_comp() const;
      +
      value_compare value_comp() const;

      Effects: Returns the value_compare object used by the container.

      Complexity: Constant.

      Throws: If value_compare copy-constructor throws.

    15. -
      bool empty() const;
      +
      bool empty() const;

      Effects: Returns true if the container is empty.

      Complexity: Constant.

      Throws: Nothing.

    16. -
      size_type size() const;
      +
      size_type size() const;

      Effects: Returns the number of elements stored in the container.

      Complexity: Linear to elements contained in *this if constant-time size option is disabled. Constant time otherwise.

      Throws: Nothing.

    17. -
      void swap(rbtree & other);
      +
      void swap(rbtree & other);

      Effects: Swaps the contents of two containers.

      Complexity: Constant.

      Throws: If the comparison functor's swap call throws. 

    18. template<typename Cloner, typename Disposer> 
-  void clone_from(const rbtree & src, Cloner cloner, Disposer disposer);
      + void clone_from(const rbtree & src, Cloner cloner, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

      Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(const_reference ) and inserts them on *this. Copies the predicate from the source container.

      If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

      @@ -347,7 +347,7 @@ 
    19. template<typename Cloner, typename Disposer> 
-  void clone_from(rbtree && src, Cloner cloner, Disposer disposer);
      + void clone_from(rbtree && src, Cloner cloner, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

      Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(reference) and inserts them on *this. Copies the predicate from the source container.

      If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

      @@ -357,7 +357,7 @@ 
    20. template<typename Cloner, typename Disposer> 
-  void clone_from(rbtree && src, Cloner cloner, Disposer disposer);
      + void clone_from(rbtree && src, Cloner cloner, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

      Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(reference) and inserts them on *this. Copies the predicate from the source container.

      If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

      @@ -366,7 +366,7 @@

      Note: This version can modify the source container, useful to implement move semantics.

    21. -
      iterator insert_equal(reference value);
      +
      iterator insert_equal(reference value);

      Requires: value must be an lvalue

      Effects: Inserts value into the container before the upper bound.

      Complexity: Average complexity for insert element is at most logarithmic.

      @@ -374,7 +374,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    22. -
      iterator insert_equal(const_iterator hint, reference value);
      +
      iterator insert_equal(const_iterator hint, reference value);

      Requires: value must be an lvalue, and "hint" must be a valid iterator.

      Effects: Inserts x into the container, using "hint" as a hint to where it will be inserted. If "hint" is the upper_bound the insertion takes constant time (two comparisons in the worst case)

      Complexity: Logarithmic in general, but it is amortized constant time if t is inserted immediately before hint.

      @@ -382,7 +382,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    23. -
      template<typename Iterator> void insert_equal(Iterator b, Iterator e);
      +
      template<typename Iterator> void insert_equal(Iterator b, Iterator e);

      Requires: Dereferencing iterator must yield an lvalue of type value_type.

      Effects: Inserts a each element of a range into the container before the upper bound of the key of each element.

      Complexity: Insert range is in general O(N * log(N)), where N is the size of the range. However, it is linear in N if the range is already sorted by value_comp().

      @@ -390,7 +390,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    24. -
      std::pair< iterator, bool > insert_unique(reference value);
      +
      std::pair< iterator, bool > insert_unique(reference value);

      Requires: value must be an lvalue

      Effects: Inserts value into the container if the value is not already present.

      Complexity: Average complexity for insert element is at most logarithmic.

      @@ -398,7 +398,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    25. -
      iterator insert_unique(const_iterator hint, reference value);
      +
      iterator insert_unique(const_iterator hint, reference value);

      Requires: value must be an lvalue, and "hint" must be a valid iterator

      Effects: Tries to insert x into the container, using "hint" as a hint to where it will be inserted.

      Complexity: Logarithmic in general, but it is amortized constant time (two comparisons in the worst case) if t is inserted immediately before hint.

      @@ -408,7 +408,7 @@ 
    26. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, bool > 
-  insert_unique_check(const KeyType & key, KeyTypeKeyCompare comp, 
+  insert_unique_check(const KeyType & key, KeyTypeKeyCompare comp, 
                       insert_commit_data & commit_data);

      Requires: comp must be a comparison function that induces the same strict weak ordering as key_compare. The difference is that comp compares an arbitrary key with the contained values.

      Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself.

      @@ -422,7 +422,7 @@ 
    27. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, bool > 
-  insert_unique_check(const_iterator hint, const KeyType & key, 
+  insert_unique_check(const_iterator hint, const KeyType & key, 
                       KeyTypeKeyCompare comp, 
                       insert_commit_data & commit_data);

      Requires: comp must be a comparison function that induces the same strict weak ordering as key_compare. The difference is that comp compares an arbitrary key with the contained values.

      @@ -435,7 +435,7 @@

      "commit_data" remains valid for a subsequent "insert_commit" only if no more objects are inserted or erased from the container.

    28. -
      iterator insert_unique_commit(reference value, 
+
      iterator insert_unique_commit(reference value, 
                               const insert_commit_data & commit_data);
      
 
      Requires: value must be an lvalue of type value_type. commit_data must have been obtained from a previous call to "insert_check". No objects should have been inserted or erased from the container between the "insert_check" that filled "commit_data" and the call to "insert_commit".
      
 
      Effects: Inserts the value in the container using the information obtained from the "commit_data" that a previous "insert_check" filled.
      
@@ -445,7 +445,7 @@
 
      Notes: This function has only sense if a "insert_check" has been previously executed to fill "commit_data". No value should be inserted or erased between the "insert_check" and "insert_commit" calls.
    29. -
      template<typename Iterator> void insert_unique(Iterator b, Iterator e);
      +
      template<typename Iterator> void insert_unique(Iterator b, Iterator e);

      Requires: Dereferencing iterator must yield an lvalue of type value_type.

      Effects: Tries to insert each element of a range into the container.

      Complexity: Insert range is in general O(N * log(N)), where N is the size of the range. However, it is linear in N if the range is already sorted by value_comp().

      @@ -453,7 +453,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    30. -
      iterator insert_before(const_iterator pos, reference value);
      +
      iterator insert_before(const_iterator pos, reference value);

      Requires: value must be an lvalue, "pos" must be a valid iterator (or end) and must be the succesor of value once inserted according to the predicate

      Effects: Inserts x into the container before "pos".

      Complexity: Constant time.

      @@ -461,7 +461,7 @@

      Note: This function does not check preconditions so if "pos" is not the successor of "value" container ordering invariant will be broken. This is a low-level function to be used only for performance reasons by advanced users.

    31. -
      void push_back(reference value);
      +
      void push_back(reference value);

      Requires: value must be an lvalue, and it must be no less than the greatest inserted key

      Effects: Inserts x into the container in the last position.

      Complexity: Constant time.

      @@ -469,7 +469,7 @@

      Note: This function does not check preconditions so if value is less than the greatest inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

    32. -
      void push_front(reference value);
      +
      void push_front(reference value);

      Requires: value must be an lvalue, and it must be no greater than the minimum inserted key

      Effects: Inserts x into the container in the first position.

      Complexity: Constant time.

      @@ -477,21 +477,21 @@

      Note: This function does not check preconditions so if value is greater than the minimum inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

    33. -
      iterator erase(const_iterator i);
      +
      iterator erase(const_iterator i);

      Effects: Erases the element pointed to by i.

      Complexity: Average complexity for erase element is constant time.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    34. -
      iterator erase(const_iterator b, const_iterator e);
      +
      iterator erase(const_iterator b, const_iterator e);

      Effects: Erases the range pointed to by b end e.

      Complexity: Average complexity for erase range is at most O(log(size() + N)), where N is the number of elements in the range.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    35. -
      size_type erase(const key_type & key);
      +
      size_type erase(const key_type & key);

      Effects: Erases all the elements with the given value.

      Returns: The number of erased elements.

      Complexity: O(log(size() + N).

      @@ -500,7 +500,8 @@ 
    36. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type erase(const KeyType & key, KeyTypeKeyCompare comp);
      + size_type erase(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Erases all the elements with the given key. according to the comparison functor "comp".

      Returns: The number of erased elements.

      Complexity: O(log(size() + N).

      @@ -509,7 +510,7 @@ 
    37. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator i, Disposer disposer);
      + iterator erase_and_dispose(const_iterator i, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases the element pointed to by i. Disposer::operator()(pointer) is called for the removed element.

      Complexity: Average complexity for erase element is constant time.

      @@ -518,7 +519,7 @@ 
    38. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator b, const_iterator e, 
+  iterator erase_and_dispose(const_iterator b, const_iterator e, 
                              Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases the range pointed to by b end e. Disposer::operator()(pointer) is called for the removed elements.

      @@ -528,7 +529,7 @@ 
    39. template<typename Disposer> 
-  size_type erase_and_dispose(const key_type & key, Disposer disposer);
      + size_type erase_and_dispose(const key_type & key, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases all the elements with the given value. Disposer::operator()(pointer) is called for the removed elements.

      Returns: The number of erased elements.

      @@ -538,8 +539,9 @@ 
    40. template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> 
-  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
+  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
                               Disposer disposer);
      +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk) and nk the key_type of a value_type inserted into *this.

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases all the elements with the given key. according to the comparison functor "comp". Disposer::operator()(pointer) is called for the removed elements.

      Returns: The number of erased elements.

      @@ -548,46 +550,47 @@

      Note: Invalidates the iterators to the erased elements.

    41. -
      void clear();
      +
      void clear();

      Effects: Erases all of the elements.

      Complexity: Linear to the number of elements on the container. if it's a safe-mode or auto-unlink value_type. Constant time otherwise.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    42. -
      template<typename Disposer> void clear_and_dispose(Disposer disposer);
      +
      template<typename Disposer> void clear_and_dispose(Disposer disposer);

      Effects: Erases all of the elements calling disposer(p) for each node to be erased. Complexity: Average complexity for is at most O(log(size() + N)), where N is the number of elements in the container.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. Calls N times to disposer functor.

    43. -
      size_type count(const key_type & key) const;
      +
      size_type count(const key_type & key) const;

      Effects: Returns the number of contained elements with the given value

      Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given value.

      Throws: If key_compare throws. 

    44. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;
      + size_type count(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      Effects: Returns the number of contained elements with the given key

      Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given key.

      Throws: If comp throws.

    45. -
      iterator lower_bound(const key_type & key);
      +
      iterator lower_bound(const key_type & key);

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    46. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      -

      Throws: If comp throws.

      +

      Throws: If key_compare throws.

    47. -
      const_iterator lower_bound(const key_type & key) const;
      +
      const_iterator lower_bound(const key_type & key) const;

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -595,26 +598,27 @@ 
    48. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
      -

      Effects: Returns a const iterator to the first element whose key is not less than k or end() if that element does not exist.

      + lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      -

      Throws: If comp throws.

      +

      Throws: If key_compare throws.

    49. -
      iterator upper_bound(const key_type & key);
      +
      iterator upper_bound(const key_type & key);

      Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    50. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    51. -
      const_iterator upper_bound(const key_type & key) const;
      +
      const_iterator upper_bound(const key_type & key) const;

      Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -622,39 +626,42 @@ 
    52. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
      + upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    53. -
      iterator find(const key_type & key);
      +
      iterator find(const key_type & key);

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    54. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator find(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator find(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    55. -
      const_iterator find(const key_type & key) const;
      -

      Effects: Finds a const_iterator to the first element whose key is k or end() if that element does not exist.

      +
      const_iterator find(const key_type & key) const;
      +

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    56. template<typename KeyType, typename KeyTypeKeyCompare> 
-  const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;
      -

      Effects: Finds a const_iterator to the first element whose key is k or end() if that element does not exist.

      + const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      +

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    57. -
      std::pair< iterator, iterator > equal_range(const key_type & key);
      +
      std::pair< iterator, iterator > equal_range(const key_type & key);

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -662,14 +669,15 @@ 
    58. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp);
      + equal_range(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If comp throws. 

    59. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & key) const;
      +equal_range(const key_type & key) const;

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -677,16 +685,18 @@ 
    60. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;
      + equal_range(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If comp throws. 

    61. std::pair< iterator, iterator > 
-bounded_range(const key_type & lower, const key_type & upper_key, 
+bounded_range(const key_type & lower, const key_type & upper_key, 
               bool left_closed, bool right_closed);
      -

      Requires: 'lower_key' must not be greater than 'upper_key'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key) if left_closed, upper_bound(lower_key) otherwise

      second = upper_bound(upper_key) if right_closed, lower_bound(upper_key) otherwise

      @@ -698,9 +708,12 @@ 
    62. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed);
      -

      Requires: KeyTypeKeyCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the container. 'lower_key' must not be greater than 'upper_key' according to 'comp'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

      +

      upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

      +

      upper_key shall not precede lower_key according to comp [comp(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!comp(upper_key, lower_key) && !comp(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key, comp) if left_closed, upper_bound(lower_key, comp) otherwise

      second = upper_bound(upper_key, comp) if right_closed, lower_bound(upper_key, comp) otherwise

      @@ -711,9 +724,10 @@ 
    63. std::pair< const_iterator, const_iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed) const;
      -

      Requires: 'lower_key' must not be greater than 'upper_key'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key) if left_closed, upper_bound(lower_key) otherwise

      second = upper_bound(upper_key) if right_closed, lower_bound(upper_key) otherwise

      @@ -725,9 +739,12 @@ 
    64. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed) const;
      -

      Requires: KeyTypeKeyCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the container. 'lower_key' must not be greater than 'upper_key' according to 'comp'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

      +

      upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

      +

      upper_key shall not precede lower_key according to comp [comp(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!comp(upper_key, lower_key) && !comp(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key, comp) if left_closed, upper_bound(lower_key, comp) otherwise

      second = upper_bound(upper_key, comp) if right_closed, lower_bound(upper_key, comp) otherwise

      @@ -737,28 +754,28 @@

      Note: Experimental function, the interface might change in future releases.

    65. -
      iterator iterator_to(reference value);
      +
      iterator iterator_to(reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      Throws: Nothing.

    66. -
      const_iterator iterator_to(const_reference value) const;
      +
      const_iterator iterator_to(const_reference value) const;

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid const_iterator i belonging to the set that points to the value

      Complexity: Constant.

      Throws: Nothing.

    67. -
      pointer unlink_leftmost_without_rebalance();
      +
      pointer unlink_leftmost_without_rebalance();

      Effects: Unlinks the leftmost node from the container.

      Complexity: Average complexity is constant time.

      Throws: Nothing.

      Notes: This function breaks the container and the container can only be used for more unlink_leftmost_without_rebalance calls. This function is normally used to achieve a step by step controlled destruction of the container.

    68. -
      void replace_node(iterator replace_this, reference with_this);
      +
      void replace_node(iterator replace_this, reference with_this);

      Requires: replace_this must be a valid iterator of *this and with_this must not be inserted in any container.

      Effects: Replaces replace_this in its position in the container with with_this. The container does not need to be rebalanced.

      Complexity: Constant.

      @@ -766,7 +783,7 @@

      Note: This function will break container ordering invariants if with_this is not equivalent to *replace_this according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing or comparison is needed.

    69. -
      void remove_node(reference value);
      +
      void remove_node(reference value);

      Effects: removes "value" from the container.

      Throws: Nothing.

      Complexity: Logarithmic time.

      @@ -776,39 +793,39 @@
    -

    -rbtree public static functions

    +

    +rbtree public static functions

    1. -
      static rbtree & container_from_end_iterator(iterator end_iterator);
      +
      static rbtree & container_from_end_iterator(iterator end_iterator);

      Precondition: end_iterator must be a valid end iterator of the container.

      Effects: Returns a const reference to the container associated to the end iterator

      Throws: Nothing.

      Complexity: Constant.

    2. -
      static const rbtree & container_from_end_iterator(const_iterator end_iterator);
      +
      static const rbtree & container_from_end_iterator(const_iterator end_iterator);

      Precondition: end_iterator must be a valid end iterator of the container.

      Effects: Returns a const reference to the container associated to the end iterator

      Throws: Nothing.

      Complexity: Constant.

    3. -
      static rbtree & container_from_iterator(iterator it);
      +
      static rbtree & container_from_iterator(iterator it);

      Precondition: it must be a valid iterator of the container.

      Effects: Returns a const reference to the container associated to the iterator

      Throws: Nothing.

      Complexity: Logarithmic.

    4. -
      static const rbtree & container_from_iterator(const_iterator it);
      +
      static const rbtree & container_from_iterator(const_iterator it);

      Precondition: it must be a valid iterator of the container.

      Effects: Returns a const reference to the container associated to the iterator

      Throws: Nothing.

      Complexity: Logarithmic.

    5. -
      static iterator s_iterator_to(reference value);
      +
      static iterator s_iterator_to(reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      @@ -816,7 +833,7 @@

      Note: This static function is available only if the value traits is stateless.

    6. -
      static const_iterator s_iterator_to(const_reference value);
      +
      static const_iterator s_iterator_to(const_reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      @@ -824,7 +841,7 @@

      Note: This static function is available only if the value traits is stateless.

    7. -
      static void init_node(reference value);
      +
      static void init_node(reference value);

      Requires: value shall not be in a container.

      Effects: init_node puts the hook of a value in a well-known default state.

      Throws: Nothing.

      diff --git a/doc/html/boost/intrusive/rbtree_algorithms.html b/doc/html/boost/intrusive/rbtree_algorithms.html index 069e77243c..2b28173dcd 100644 --- a/doc/html/boost/intrusive/rbtree_algorithms.html +++ b/doc/html/boost/intrusive/rbtree_algorithms.html @@ -43,81 +43,81 @@ typedef NodeTraits::color color; typedef bstree_algo::insert_commit_data insert_commit_data; - // public static functions - static node_ptr get_header(const const_node_ptr &); - static node_ptr begin_node(const const_node_ptr &); - static node_ptr end_node(const const_node_ptr &); - static void swap_tree(const node_ptr &, const node_ptr &); - static void swap_nodes(const node_ptr &, const node_ptr &); - static void swap_nodes(const node_ptr &, const node_ptr &, const node_ptr &, + // public static functions + static node_ptr get_header(const const_node_ptr &); + static node_ptr begin_node(const const_node_ptr &); + static node_ptr end_node(const const_node_ptr &); + static void swap_tree(const node_ptr &, const node_ptr &); + static void swap_nodes(const node_ptr &, const node_ptr &); + static void swap_nodes(const node_ptr &, const node_ptr &, const node_ptr &, const node_ptr &); - static void replace_node(const node_ptr &, const node_ptr &); - static void replace_node(const node_ptr &, const node_ptr &, + static void replace_node(const node_ptr &, const node_ptr &); + static void replace_node(const node_ptr &, const node_ptr &, const node_ptr &); - static void unlink(const node_ptr &); - static node_ptr unlink_leftmost_without_rebalance(const node_ptr &); - static bool unique(const const_node_ptr &); - static std::size_t size(const const_node_ptr &); - static node_ptr next_node(const node_ptr &); - static node_ptr prev_node(const node_ptr &); - static void init(const node_ptr &); - static void init_header(const node_ptr &); - static node_ptr erase(const node_ptr &, const node_ptr &); + static void unlink(const node_ptr &); + static node_ptr unlink_leftmost_without_rebalance(const node_ptr &); + static bool unique(const const_node_ptr &); + static std::size_t size(const const_node_ptr &); + static node_ptr next_node(const node_ptr &); + static node_ptr prev_node(const node_ptr &); + static void init(const node_ptr &); + static void init_header(const node_ptr &); + static node_ptr erase(const node_ptr &, const node_ptr &); template<typename Cloner, typename Disposer> - static void clone(const const_node_ptr &, const node_ptr &, Cloner, + static void clone(const const_node_ptr &, const node_ptr &, Cloner, Disposer); template<typename Disposer> - static void clear_and_dispose(const node_ptr &, Disposer); + static void clear_and_dispose(const node_ptr &, Disposer); template<typename KeyType, typename KeyNodePtrCompare> static node_ptr - lower_bound(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + lower_bound(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static node_ptr - upper_bound(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + upper_bound(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static node_ptr - find(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + find(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, node_ptr > - equal_range(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + equal_range(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, node_ptr > - bounded_range(const const_node_ptr &, const KeyType &, const KeyType &, + bounded_range(const const_node_ptr &, const KeyType &, const KeyType &, KeyNodePtrCompare, bool, bool); template<typename KeyType, typename KeyNodePtrCompare> static std::size_t - count(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + count(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename NodePtrCompare> static node_ptr - insert_equal_upper_bound(const node_ptr &, const node_ptr &, + insert_equal_upper_bound(const node_ptr &, const node_ptr &, NodePtrCompare); template<typename NodePtrCompare> static node_ptr - insert_equal_lower_bound(const node_ptr &, const node_ptr &, + insert_equal_lower_bound(const node_ptr &, const node_ptr &, NodePtrCompare); template<typename NodePtrCompare> static node_ptr - insert_equal(const node_ptr &, const node_ptr &, const node_ptr &, + insert_equal(const node_ptr &, const node_ptr &, const node_ptr &, NodePtrCompare); static node_ptr - insert_before(const node_ptr &, const node_ptr &, const node_ptr &); - static void push_back(const node_ptr &, const node_ptr &); - static void push_front(const node_ptr &, const node_ptr &); + insert_before(const node_ptr &, const node_ptr &, const node_ptr &); + static void push_back(const node_ptr &, const node_ptr &); + static void push_front(const node_ptr &, const node_ptr &); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, bool > - insert_unique_check(const const_node_ptr &, const KeyType &, + insert_unique_check(const const_node_ptr &, const KeyType &, KeyNodePtrCompare, insert_commit_data &); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, bool > - insert_unique_check(const const_node_ptr &, const node_ptr &, + insert_unique_check(const const_node_ptr &, const node_ptr &, const KeyType &, KeyNodePtrCompare, insert_commit_data &); - static void insert_unique_commit(const node_ptr &, const node_ptr &, + static void insert_unique_commit(const node_ptr &, const node_ptr &, const insert_commit_data &); - static bool is_header(const const_node_ptr &); + static bool is_header(const const_node_ptr &); };
    -

    Description

    +

    Description

    rbtree_algorithms provides basic algorithms to manipulate nodes forming a red-black tree. The insertion and deletion algorithms are based on those in Cormen, Leiserson, and Rivest, Introduction to Algorithms (MIT Press, 1990), except that

    (1) the header node is maintained with links not only to the root but also to the leftmost node of the tree, to enable constant time begin(), and to the rightmost node of the tree, to enable linear time performance when used with the generic set algorithms (set_union, etc.);

    (2) when a node being deleted has two children its successor node is relinked into its place, rather than copied, so that the only pointers invalidated are those referring to the deleted node.

    @@ -139,7 +139,7 @@

    static color black();

    static color red();

    -

    +

    rbtree_algorithms public types

    @@ -150,39 +150,39 @@
    -

    -rbtree_algorithms public static functions

    +

    +rbtree_algorithms public static functions

    1. -
      static node_ptr get_header(const const_node_ptr & n);
      +
      static node_ptr get_header(const const_node_ptr & n);

      Requires: 'node' is a node of the tree or a header node.

      Effects: Returns the header of the tree.

      Complexity: Logarithmic.

      Throws: Nothing.

    2. -
      static node_ptr begin_node(const const_node_ptr & header);
      +
      static node_ptr begin_node(const const_node_ptr & header);

      Requires: 'header' is the header node of a tree.

      Effects: Returns the first node of the tree, the header if the tree is empty.

      Complexity: Constant time.

      Throws: Nothing.

    3. -
      static node_ptr end_node(const const_node_ptr & header);
      +
      static node_ptr end_node(const const_node_ptr & header);

      Requires: 'header' is the header node of a tree.

      Effects: Returns the header of the tree.

      Complexity: Constant time.

      Throws: Nothing.

    4. -
      static void swap_tree(const node_ptr & header1, const node_ptr & header2);
      +
      static void swap_tree(const node_ptr & header1, const node_ptr & header2);

      Requires: header1 and header2 must be the header nodes of two trees.

      Effects: Swaps two trees. After the function header1 will contain links to the second tree and header2 will have links to the first tree.

      Complexity: Constant.

      Throws: Nothing.

    5. -
      static void swap_nodes(const node_ptr & node1, const node_ptr & node2);
      +
      static void swap_nodes(const node_ptr & node1, const node_ptr & node2);

      Requires: node1 and node2 can't be header nodes of two trees.

      Effects: Swaps two nodes. After the function node1 will be inserted in the position node2 before the function. node2 will be inserted in the position node1 had before the function.

      Complexity: Logarithmic.

      @@ -191,7 +191,7 @@

      Experimental function

    6. -
      static void swap_nodes(const node_ptr & node1, const node_ptr & header1, 
+
      static void swap_nodes(const node_ptr & node1, const node_ptr & header1, 
                        const node_ptr & node2, const node_ptr & header2);
      
 
      Requires: node1 and node2 can't be header nodes of two trees with header header1 and header2.
      
 
      Effects: Swaps two nodes. After the function node1 will be inserted in the position node2 before the function. node2 will be inserted in the position node1 had before the function.
      
@@ -201,7 +201,7 @@
 
      Experimental function
    7. -
      static void replace_node(const node_ptr & node_to_be_replaced, 
+
      static void replace_node(const node_ptr & node_to_be_replaced, 
                          const node_ptr & new_node);
      
 
      Requires: node_to_be_replaced must be inserted in a tree and new_node must not be inserted in a tree.
      
 
      Effects: Replaces node_to_be_replaced in its position in the tree with new_node. The tree does not need to be rebalanced
      
@@ -210,7 +210,7 @@
 
      Note: This function will break container ordering invariants if new_node is not equivalent to node_to_be_replaced according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing and comparison is needed. Experimental function
    8. -
      static void replace_node(const node_ptr & node_to_be_replaced, 
+
      static void replace_node(const node_ptr & node_to_be_replaced, 
                          const node_ptr & header, const node_ptr & new_node);
      
 
      Requires: node_to_be_replaced must be inserted in a tree with header "header" and new_node must not be inserted in a tree.
      
 
      Effects: Replaces node_to_be_replaced in its position in the tree with new_node. The tree does not need to be rebalanced
      
@@ -219,14 +219,14 @@
 
      Note: This function will break container ordering invariants if new_node is not equivalent to node_to_be_replaced according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing or comparison is needed. Experimental function
    9. -
      static void unlink(const node_ptr & node);
      +
      static void unlink(const node_ptr & node);

      Requires: node is a tree node but not the header.

      Effects: Unlinks the node and rebalances the tree.

      Complexity: Average complexity is constant time.

      Throws: Nothing.

    10. -
      static node_ptr unlink_leftmost_without_rebalance(const node_ptr & header);
      +
      static node_ptr unlink_leftmost_without_rebalance(const node_ptr & header);

      Requires: header is the header of a tree.

      Effects: Unlinks the leftmost node from the tree, and updates the header link to the new leftmost node.

      Complexity: Average complexity is constant time.

      @@ -234,35 +234,35 @@

      Notes: This function breaks the tree and the tree can only be used for more unlink_leftmost_without_rebalance calls. This function is normally used to achieve a step by step controlled destruction of the tree.

    11. -
      static bool unique(const const_node_ptr & node);
      +
      static bool unique(const const_node_ptr & node);

      Requires: 'node' is a node of the tree or a node initialized by init(...) or init_node.

      Effects: Returns true if the node is initialized by init() or init_node().

      Complexity: Constant time.

      Throws: Nothing.

    12. -
      static std::size_t size(const const_node_ptr & header);
      +
      static std::size_t size(const const_node_ptr & header);

      Requires: node is a node of the tree but it's not the header.

      Effects: Returns the number of nodes of the subtree.

      Complexity: Linear time.

      Throws: Nothing.

    13. -
      static node_ptr next_node(const node_ptr & node);
      +
      static node_ptr next_node(const node_ptr & node);

      Requires: 'node' is a node from the tree except the header.

      Effects: Returns the next node of the tree.

      Complexity: Average constant time.

      Throws: Nothing.

    14. -
      static node_ptr prev_node(const node_ptr & node);
      +
      static node_ptr prev_node(const node_ptr & node);

      Requires: 'node' is a node from the tree except the leftmost node.

      Effects: Returns the previous node of the tree.

      Complexity: Average constant time.

      Throws: Nothing.

    15. -
      static void init(const node_ptr & node);
      +
      static void init(const node_ptr & node);

      Requires: 'node' must not be part of any tree.

      Effects: After the function unique(node) == true.

      Complexity: Constant.

      @@ -270,7 +270,7 @@

      Nodes: If node is inserted in a tree, this function corrupts the tree.

    16. -
      static void init_header(const node_ptr & header);
      +
      static void init_header(const node_ptr & header);

      Requires: node must not be part of any tree.

      Effects: Initializes the header to represent an empty tree. unique(header) == true.

      Complexity: Constant.

      @@ -278,7 +278,7 @@

      Nodes: If node is inserted in a tree, this function corrupts the tree.

    17. -
      static node_ptr erase(const node_ptr & header, const node_ptr & z);
      +
      static node_ptr erase(const node_ptr & header, const node_ptr & z);

      Requires: header must be the header of a tree, z a node of that tree and z != header.

      Effects: Erases node "z" from the tree with header "header".

      Complexity: Amortized constant time.

      @@ -286,7 +286,7 @@ 
    18. template<typename Cloner, typename Disposer> 
-  static void clone(const const_node_ptr & source_header, 
+  static void clone(const const_node_ptr & source_header, 
                     const node_ptr & target_header, Cloner cloner, 
                     Disposer disposer);

      Requires: "cloner" must be a function object taking a node_ptr and returning a new cloned node of it. "disposer" must take a node_ptr and shouldn't throw.

      @@ -297,7 +297,7 @@ 
    19. template<typename Disposer> 
-  static void clear_and_dispose(const node_ptr & header, Disposer disposer);
      + static void clear_and_dispose(const node_ptr & header, Disposer disposer);

      Requires: "disposer" must be an object function taking a node_ptr parameter and shouldn't throw.

      Effects: Empties the target tree calling void disposer::operator()(const node_ptr &) for every node of the tree except the header.

      Complexity: Linear to the number of element of the source tree plus the. number of elements of tree target tree when calling this function.

      @@ -306,7 +306,7 @@ 
    20. template<typename KeyType, typename KeyNodePtrCompare> 
   static node_ptr 
-  lower_bound(const const_node_ptr & header, const KeyType & key, 
+  lower_bound(const const_node_ptr & header, const KeyType & key, 
               KeyNodePtrCompare comp);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

      Effects: Returns a node_ptr to the first element that is not less than "key" according to "comp" or "header" if that element does not exist.

      @@ -316,7 +316,7 @@ 
    21. template<typename KeyType, typename KeyNodePtrCompare> 
   static node_ptr 
-  upper_bound(const const_node_ptr & header, const KeyType & key, 
+  upper_bound(const const_node_ptr & header, const KeyType & key, 
               KeyNodePtrCompare comp);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

      Effects: Returns a node_ptr to the first element that is greater than "key" according to "comp" or "header" if that element does not exist.

      @@ -326,7 +326,7 @@ 
    22. template<typename KeyType, typename KeyNodePtrCompare> 
   static node_ptr 
-  find(const const_node_ptr & header, const KeyType & key, 
+  find(const const_node_ptr & header, const KeyType & key, 
        KeyNodePtrCompare comp);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

      Effects: Returns a node_ptr to the first element that is equivalent to "key" according to "comp" or "header" if that element does not exist.

      @@ -336,7 +336,7 @@ 
    23. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, node_ptr > 
-  equal_range(const const_node_ptr & header, const KeyType & key, 
+  equal_range(const const_node_ptr & header, const KeyType & key, 
               KeyNodePtrCompare comp);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

      Effects: Returns an a pair of node_ptr delimiting a range containing all elements that are equivalent to "key" according to "comp" or an empty range that indicates the position where those elements would be if there are no equivalent elements.

      @@ -346,7 +346,7 @@ 
    24. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, node_ptr > 
-  bounded_range(const const_node_ptr & header, const KeyType & lower_key, 
+  bounded_range(const const_node_ptr & header, const KeyType & lower_key, 
                 const KeyType & upper_key, KeyNodePtrCompare comp, 
                 bool left_closed, bool right_closed);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs. 'lower_key' must not be greater than 'upper_key' according to 'comp'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be true.

      @@ -361,7 +361,7 @@ 
    25. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::size_t 
-  count(const const_node_ptr & header, const KeyType & key, 
+  count(const const_node_ptr & header, const KeyType & key, 
         KeyNodePtrCompare comp);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

      Effects: Returns the number of elements with a key equivalent to "key" according to "comp".

      @@ -371,7 +371,7 @@ 
    26. template<typename NodePtrCompare> 
   static node_ptr 
-  insert_equal_upper_bound(const node_ptr & h, const node_ptr & new_node, 
+  insert_equal_upper_bound(const node_ptr & h, const node_ptr & new_node, 
                            NodePtrCompare comp);

      Requires: "h" must be the header node of a tree. NodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares two node_ptrs.

      Effects: Inserts new_node into the tree before the upper bound according to "comp".

      @@ -381,7 +381,7 @@ 
    27. template<typename NodePtrCompare> 
   static node_ptr 
-  insert_equal_lower_bound(const node_ptr & h, const node_ptr & new_node, 
+  insert_equal_lower_bound(const node_ptr & h, const node_ptr & new_node, 
                            NodePtrCompare comp);

      Requires: "h" must be the header node of a tree. NodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares two node_ptrs.

      Effects: Inserts new_node into the tree before the lower bound according to "comp".

      @@ -391,7 +391,7 @@ 
    28. template<typename NodePtrCompare> 
   static node_ptr 
-  insert_equal(const node_ptr & header, const node_ptr & hint, 
+  insert_equal(const node_ptr & header, const node_ptr & hint, 
                const node_ptr & new_node, NodePtrCompare comp);

      Requires: "header" must be the header node of a tree. NodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares two node_ptrs. "hint" is node from the "header"'s tree.

      Effects: Inserts new_node into the tree, using "hint" as a hint to where it will be inserted. If "hint" is the upper_bound the insertion takes constant time (two comparisons in the worst case).

      @@ -400,7 +400,7 @@ 
    29. static node_ptr 
-insert_before(const node_ptr & header, const node_ptr & pos, 
+insert_before(const node_ptr & header, const node_ptr & pos, 
               const node_ptr & new_node);

      Requires: "header" must be the header node of a tree. "pos" must be a valid iterator or header (end) node. "pos" must be an iterator pointing to the successor to "new_node" once inserted according to the order of already inserted nodes. This function does not check "pos" and this precondition must be guaranteed by the caller.

      Effects: Inserts new_node into the tree before "pos".

      @@ -409,7 +409,7 @@

      Note: If "pos" is not the successor of the newly inserted "new_node" tree invariants might be broken.

    30. -
      static void push_back(const node_ptr & header, const node_ptr & new_node);
      +
      static void push_back(const node_ptr & header, const node_ptr & new_node);

      Requires: "header" must be the header node of a tree. "new_node" must be, according to the used ordering no less than the greatest inserted key.

      Effects: Inserts new_node into the tree before "pos".

      Complexity: Constant-time.

      @@ -417,7 +417,7 @@

      Note: If "new_node" is less than the greatest inserted key tree invariants are broken. This function is slightly faster than using "insert_before".

    31. -
      static void push_front(const node_ptr & header, const node_ptr & new_node);
      +
      static void push_front(const node_ptr & header, const node_ptr & new_node);

      Requires: "header" must be the header node of a tree. "new_node" must be, according to the used ordering, no greater than the lowest inserted key.

      Effects: Inserts new_node into the tree before "pos".

      Complexity: Constant-time.

      @@ -427,7 +427,7 @@ 
    32. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, bool > 
-  insert_unique_check(const const_node_ptr & header, const KeyType & key, 
+  insert_unique_check(const const_node_ptr & header, const KeyType & key, 
                       KeyNodePtrCompare comp, 
                       insert_commit_data & commit_data);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares KeyType with a node_ptr.

      @@ -442,7 +442,7 @@ 
    33. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, bool > 
-  insert_unique_check(const const_node_ptr & header, const node_ptr & hint, 
+  insert_unique_check(const const_node_ptr & header, const node_ptr & hint, 
                       const KeyType & key, KeyNodePtrCompare comp, 
                       insert_commit_data & commit_data);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares KeyType with a node_ptr. "hint" is node from the "header"'s tree.

      @@ -455,7 +455,7 @@

      "commit_data" remains valid for a subsequent "insert_unique_commit" only if no more objects are inserted or erased from the set.

    34. -
      static void insert_unique_commit(const node_ptr & header, 
+
      static void insert_unique_commit(const node_ptr & header, 
                                  const node_ptr & new_value, 
                                  const insert_commit_data & commit_data);
      
 
      Requires: "header" must be the header node of a tree. "commit_data" must have been obtained from a previous call to "insert_unique_check". No objects should have been inserted or erased from the set between the "insert_unique_check" that filled "commit_data" and the call to "insert_commit".
      
@@ -465,7 +465,7 @@
 
      Notes: This function has only sense if a "insert_unique_check" has been previously executed to fill "commit_data". No value should be inserted or erased between the "insert_check" and "insert_commit" calls.
    35. -
      static bool is_header(const const_node_ptr & p);
      +
      static bool is_header(const const_node_ptr & p);

      Requires: p is a node of a tree.

      Effects: Returns true if p is the header of the tree.

      Complexity: Constant.

      diff --git a/doc/html/boost/intrusive/set.html b/doc/html/boost/intrusive/set.html index 69436c13db..25efcb4fd3 100644 --- a/doc/html/boost/intrusive/set.html +++ b/doc/html/boost/intrusive/set.html @@ -60,139 +60,139 @@ typedef implementation_defined::node_algorithms node_algorithms; // construct/copy/destruct - explicit set(const key_compare & = key_compare(), + explicit set(const key_compare & = key_compare(), const value_traits & = value_traits()); template<typename Iterator> - set(Iterator, Iterator, const key_compare & = key_compare(), + set(Iterator, Iterator, const key_compare & = key_compare(), const value_traits & = value_traits()); - set(set &&); - set & operator=(set &&); - ~set(); + set(set &&); + set & operator=(set &&); + ~set(); - // public member functions - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end(); - const_iterator end() const; - const_iterator cend() const; - reverse_iterator rbegin(); - const_reverse_iterator rbegin() const; - const_reverse_iterator crbegin() const; - reverse_iterator rend(); - const_reverse_iterator rend() const; - const_reverse_iterator crend() const; - key_compare key_comp() const; - value_compare value_comp() const; - bool empty() const; - size_type size() const; - void swap(set &); + // public member functions + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end(); + const_iterator end() const; + const_iterator cend() const; + reverse_iterator rbegin(); + const_reverse_iterator rbegin() const; + const_reverse_iterator crbegin() const; + reverse_iterator rend(); + const_reverse_iterator rend() const; + const_reverse_iterator crend() const; + key_compare key_comp() const; + value_compare value_comp() const; + bool empty() const; + size_type size() const; + void swap(set &); template<typename Cloner, typename Disposer> - void clone_from(const set &, Cloner, Disposer); + void clone_from(const set &, Cloner, Disposer); template<typename Cloner, typename Disposer> - void clone_from(set &&, Cloner, Disposer); - std::pair< iterator, bool > insert(reference); - iterator insert(const_iterator, reference); + void clone_from(set &&, Cloner, Disposer); + std::pair< iterator, bool > insert(reference); + iterator insert(const_iterator, reference); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, bool > - insert_check(const KeyType &, KeyTypeKeyCompare, insert_commit_data &); + insert_check(const KeyType &, KeyTypeKeyCompare, insert_commit_data &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, bool > - insert_check(const_iterator, const KeyType &, KeyTypeKeyCompare, + insert_check(const_iterator, const KeyType &, KeyTypeKeyCompare, insert_commit_data &); - template<typename Iterator> void insert(Iterator, Iterator); - iterator insert_commit(reference, const insert_commit_data &); - iterator insert_before(const_iterator, reference); - void push_back(reference); - void push_front(reference); - iterator erase(const_iterator); - iterator erase(const_iterator, const_iterator); - size_type erase(const key_type &); + template<typename Iterator> void insert(Iterator, Iterator); + iterator insert_commit(reference, const insert_commit_data &); + iterator insert_before(const_iterator, reference); + void push_back(reference); + void push_front(reference); + iterator erase(const_iterator); + iterator erase(const_iterator, const_iterator); + size_type erase(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - size_type erase(const KeyType &, KeyTypeKeyCompare); + size_type erase(const KeyType &, KeyTypeKeyCompare); template<typename Disposer> - iterator erase_and_dispose(const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, Disposer); template<typename Disposer> - iterator erase_and_dispose(const_iterator, const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, const_iterator, Disposer); template<typename Disposer> - size_type erase_and_dispose(const key_type &, Disposer); + size_type erase_and_dispose(const key_type &, Disposer); template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> - size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); - void clear(); - template<typename Disposer> void clear_and_dispose(Disposer); - size_type count(const key_type &) const; + size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); + void clear(); + template<typename Disposer> void clear_and_dispose(Disposer); + size_type count(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - size_type count(const KeyType &, KeyTypeKeyCompare) const; - iterator lower_bound(const key_type &); + size_type count(const KeyType &, KeyTypeKeyCompare) const; + iterator lower_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator lower_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator lower_bound(const key_type &) const; + iterator lower_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator lower_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator upper_bound(const key_type &); + const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator upper_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator upper_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator upper_bound(const key_type &) const; + iterator upper_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator upper_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator find(const key_type &); + const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator find(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator find(const KeyType &, KeyTypeKeyCompare); - const_iterator find(const key_type &) const; + iterator find(const KeyType &, KeyTypeKeyCompare); + const_iterator find(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator find(const KeyType &, KeyTypeKeyCompare) const; - std::pair< iterator, iterator > equal_range(const key_type &); + const_iterator find(const KeyType &, KeyTypeKeyCompare) const; + std::pair< iterator, iterator > equal_range(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - equal_range(const KeyType &, KeyTypeKeyCompare); + equal_range(const KeyType &, KeyTypeKeyCompare); std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; + equal_range(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - equal_range(const KeyType &, KeyTypeKeyCompare) const; + equal_range(const KeyType &, KeyTypeKeyCompare) const; std::pair< iterator, iterator > - bounded_range(const key_type &, const key_type &, bool, bool); + bounded_range(const key_type &, const key_type &, bool, bool); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool); std::pair< const_iterator, const_iterator > - bounded_range(const key_type &, const key_type &, bool, bool) const; + bounded_range(const key_type &, const key_type &, bool, bool) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool) const; - iterator iterator_to(reference); - const_iterator iterator_to(const_reference) const; - pointer unlink_leftmost_without_rebalance(); - void replace_node(iterator, reference); - void remove_node(reference); + iterator iterator_to(reference); + const_iterator iterator_to(const_reference) const; + pointer unlink_leftmost_without_rebalance(); + void replace_node(iterator, reference); + void remove_node(reference); - // public static functions - static set & container_from_end_iterator(iterator); - static const set & container_from_end_iterator(const_iterator); - static set & container_from_iterator(iterator); - static const set & container_from_iterator(const_iterator); - static iterator s_iterator_to(reference); - static const_iterator s_iterator_to(const_reference); - static void init_node(reference); + // public static functions + static set & container_from_end_iterator(iterator); + static const set & container_from_end_iterator(const_iterator); + static set & container_from_iterator(iterator); + static const set & container_from_iterator(const_iterator); + static iterator s_iterator_to(reference); + static const_iterator s_iterator_to(const_reference); + static void init_node(reference); // public data members static const bool constant_time_size; };
    -

    Description

    +

    Description

    The class template set is an intrusive container, that mimics most of the interface of std::set as described in the C++ standard.

    The template parameter T is the type to be managed by the container. The user can specify additional options and if no options are provided default options are used.

    The container supports the following options: base_hook<>/member_hook<>/value_traits<>, constant_time_size<>, size_type<> and compare<>.

    -

    +

    set public construct/copy/destruct

    1. -
      explicit set(const key_compare & cmp = key_compare(), 
+
      explicit set(const key_compare & cmp = key_compare(), 
              const value_traits & v_traits = value_traits());
      
 
      Effects: Constructs an empty container.
      
 
      Complexity: Constant.
      
@@ -200,7 +200,7 @@
 
    2. template<typename Iterator> 
-  set(Iterator b, Iterator e, const key_compare & cmp = key_compare(), 
+  set(Iterator b, Iterator e, const key_compare & cmp = key_compare(), 
       const value_traits & v_traits = value_traits());

      Requires: Dereferencing iterator must yield an lvalue of type value_type. cmp must be a comparison function that induces a strict weak ordering.

      Effects: Constructs an empty container and inserts elements from [b, e).

      @@ -208,15 +208,15 @@

      Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor/operator() of the key_compare object throws. Basic guarantee.

    3. -
      set(set && x);
      +
      set(set && x);

      Effects: to-do

    4. -
      set & operator=(set && x);
      +
      set & operator=(set && x);

      Effects: to-do

    5. -
      ~set();
      +
      ~set();

      Effects: Detaches all elements from this. The objects in the set are not deleted (i.e. no destructors are called), but the nodes according to the value_traits template parameter are reinitialized and thus can be reused.

      Complexity: Linear to elements contained in *this.

      Throws: Nothing.

      @@ -224,114 +224,114 @@
    -

    -set public member functions

    +

    +set public member functions

    1. -
      iterator begin();
      +
      iterator begin();

      Effects: Returns an iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    2. -
      const_iterator begin() const;
      +
      const_iterator begin() const;

      Effects: Returns a const_iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    3. -
      const_iterator cbegin() const;
      +
      const_iterator cbegin() const;

      Effects: Returns a const_iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    4. -
      iterator end();
      +
      iterator end();

      Effects: Returns an iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    5. -
      const_iterator end() const;
      +
      const_iterator end() const;

      Effects: Returns a const_iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    6. -
      const_iterator cend() const;
      +
      const_iterator cend() const;

      Effects: Returns a const_iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    7. -
      reverse_iterator rbegin();
      +
      reverse_iterator rbegin();

      Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    8. -
      const_reverse_iterator rbegin() const;
      +
      const_reverse_iterator rbegin() const;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    9. -
      const_reverse_iterator crbegin() const;
      +
      const_reverse_iterator crbegin() const;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    10. -
      reverse_iterator rend();
      +
      reverse_iterator rend();

      Effects: Returns a reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    11. -
      const_reverse_iterator rend() const;
      +
      const_reverse_iterator rend() const;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    12. -
      const_reverse_iterator crend() const;
      +
      const_reverse_iterator crend() const;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    13. -
      key_compare key_comp() const;
      +
      key_compare key_comp() const;

      Effects: Returns the key_compare object used by the container.

      Complexity: Constant.

      Throws: If key_compare copy-constructor throws.

    14. -
      value_compare value_comp() const;
      +
      value_compare value_comp() const;

      Effects: Returns the value_compare object used by the container.

      Complexity: Constant.

      Throws: If value_compare copy-constructor throws.

    15. -
      bool empty() const;
      +
      bool empty() const;

      Effects: Returns true if the container is empty.

      Complexity: Constant.

      Throws: Nothing.

    16. -
      size_type size() const;
      +
      size_type size() const;

      Effects: Returns the number of elements stored in the container.

      Complexity: Linear to elements contained in *this if constant-time size option is disabled. Constant time otherwise.

      Throws: Nothing.

    17. -
      void swap(set & other);
      +
      void swap(set & other);

      Effects: Swaps the contents of two containers.

      Complexity: Constant.

      Throws: If the comparison functor's swap call throws. 

    18. template<typename Cloner, typename Disposer> 
-  void clone_from(const set & src, Cloner cloner, Disposer disposer);
      + void clone_from(const set & src, Cloner cloner, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

      Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(const_reference ) and inserts them on *this. Copies the predicate from the source container.

      If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

      @@ -340,7 +340,7 @@ 
    19. template<typename Cloner, typename Disposer> 
-  void clone_from(set && src, Cloner cloner, Disposer disposer);
      + void clone_from(set && src, Cloner cloner, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

      Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(reference) and inserts them on *this. Copies the predicate from the source container.

      If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

      @@ -349,7 +349,7 @@

      Note: This version can modify the source container, useful to implement move semantics.

    20. -
      std::pair< iterator, bool > insert(reference value);
      +
      std::pair< iterator, bool > insert(reference value);

      Requires: value must be an lvalue

      Effects: Inserts value into the container if the value is not already present.

      Complexity: Average complexity for insert element is at most logarithmic.

      @@ -357,7 +357,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    21. -
      iterator insert(const_iterator hint, reference value);
      +
      iterator insert(const_iterator hint, reference value);

      Requires: value must be an lvalue, and "hint" must be a valid iterator

      Effects: Tries to insert x into the container, using "hint" as a hint to where it will be inserted.

      Complexity: Logarithmic in general, but it is amortized constant time (two comparisons in the worst case) if t is inserted immediately before hint.

      @@ -367,7 +367,7 @@ 
    22. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, bool > 
-  insert_check(const KeyType & key, KeyTypeKeyCompare comp, 
+  insert_check(const KeyType & key, KeyTypeKeyCompare comp, 
                insert_commit_data & commit_data);

      Requires: comp must be a comparison function that induces the same strict weak ordering as key_compare. The difference is that comp compares an arbitrary key with the contained values.

      Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself.

      @@ -381,7 +381,7 @@ 
    23. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, bool > 
-  insert_check(const_iterator hint, const KeyType & key, 
+  insert_check(const_iterator hint, const KeyType & key, 
                KeyTypeKeyCompare comp, insert_commit_data & commit_data);

      Requires: comp must be a comparison function that induces the same strict weak ordering as key_compare. The difference is that comp compares an arbitrary key with the contained values.

      Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself, using "hint" as a hint to where it will be inserted.

      @@ -393,7 +393,7 @@

      "commit_data" remains valid for a subsequent "insert_commit" only if no more objects are inserted or erased from the container.

    24. -
      template<typename Iterator> void insert(Iterator b, Iterator e);
      +
      template<typename Iterator> void insert(Iterator b, Iterator e);

      Requires: Dereferencing iterator must yield an lvalue of type value_type.

      Effects: Tries to insert each element of a range into the container.

      Complexity: Insert range is in general O(N * log(N)), where N is the size of the range. However, it is linear in N if the range is already sorted by value_comp().

      @@ -401,7 +401,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    25. -
      iterator insert_commit(reference value, 
+
      iterator insert_commit(reference value, 
                        const insert_commit_data & commit_data);
      
 
      Requires: value must be an lvalue of type value_type. commit_data must have been obtained from a previous call to "insert_check". No objects should have been inserted or erased from the container between the "insert_check" that filled "commit_data" and the call to "insert_commit".
      
 
      Effects: Inserts the value in the container using the information obtained from the "commit_data" that a previous "insert_check" filled.
      
@@ -411,7 +411,7 @@
 
      Notes: This function has only sense if a "insert_check" has been previously executed to fill "commit_data". No value should be inserted or erased between the "insert_check" and "insert_commit" calls.
    26. -
      iterator insert_before(const_iterator pos, reference value);
      +
      iterator insert_before(const_iterator pos, reference value);

      Requires: value must be an lvalue, "pos" must be a valid iterator (or end) and must be the succesor of value once inserted according to the predicate

      Effects: Inserts x into the container before "pos".

      Complexity: Constant time.

      @@ -419,7 +419,7 @@

      Note: This function does not check preconditions so if "pos" is not the successor of "value" container ordering invariant will be broken. This is a low-level function to be used only for performance reasons by advanced users.

    27. -
      void push_back(reference value);
      +
      void push_back(reference value);

      Requires: value must be an lvalue, and it must be no less than the greatest inserted key

      Effects: Inserts x into the container in the last position.

      Complexity: Constant time.

      @@ -427,7 +427,7 @@

      Note: This function does not check preconditions so if value is less than the greatest inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

    28. -
      void push_front(reference value);
      +
      void push_front(reference value);

      Requires: value must be an lvalue, and it must be no greater than the minimum inserted key

      Effects: Inserts x into the container in the first position.

      Complexity: Constant time.

      @@ -435,21 +435,21 @@

      Note: This function does not check preconditions so if value is greater than the minimum inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

    29. -
      iterator erase(const_iterator i);
      +
      iterator erase(const_iterator i);

      Effects: Erases the element pointed to by i.

      Complexity: Average complexity for erase element is constant time.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    30. -
      iterator erase(const_iterator b, const_iterator e);
      +
      iterator erase(const_iterator b, const_iterator e);

      Effects: Erases the range pointed to by b end e.

      Complexity: Average complexity for erase range is at most O(log(size() + N)), where N is the number of elements in the range.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    31. -
      size_type erase(const key_type & key);
      +
      size_type erase(const key_type & key);

      Effects: Erases all the elements with the given value.

      Returns: The number of erased elements.

      Complexity: O(log(size() + N).

      @@ -458,7 +458,8 @@ 
    32. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type erase(const KeyType & key, KeyTypeKeyCompare comp);
      + size_type erase(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Erases all the elements with the given key. according to the comparison functor "comp".

      Returns: The number of erased elements.

      Complexity: O(log(size() + N).

      @@ -467,7 +468,7 @@ 
    33. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator i, Disposer disposer);
      + iterator erase_and_dispose(const_iterator i, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases the element pointed to by i. Disposer::operator()(pointer) is called for the removed element.

      Complexity: Average complexity for erase element is constant time.

      @@ -476,7 +477,7 @@ 
    34. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator b, const_iterator e, 
+  iterator erase_and_dispose(const_iterator b, const_iterator e, 
                              Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases the range pointed to by b end e. Disposer::operator()(pointer) is called for the removed elements.

      @@ -486,7 +487,7 @@ 
    35. template<typename Disposer> 
-  size_type erase_and_dispose(const key_type & key, Disposer disposer);
      + size_type erase_and_dispose(const key_type & key, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases all the elements with the given value. Disposer::operator()(pointer) is called for the removed elements.

      Returns: The number of erased elements.

      @@ -496,8 +497,9 @@ 
    36. template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> 
-  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
+  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
                               Disposer disposer);
      +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk) and nk the key_type of a value_type inserted into *this.

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases all the elements with the given key. according to the comparison functor "comp". Disposer::operator()(pointer) is called for the removed elements.

      Returns: The number of erased elements.

      @@ -506,46 +508,47 @@

      Note: Invalidates the iterators to the erased elements.

    37. -
      void clear();
      +
      void clear();

      Effects: Erases all of the elements.

      Complexity: Linear to the number of elements on the container. if it's a safe-mode or auto-unlink value_type. Constant time otherwise.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    38. -
      template<typename Disposer> void clear_and_dispose(Disposer disposer);
      +
      template<typename Disposer> void clear_and_dispose(Disposer disposer);

      Effects: Erases all of the elements calling disposer(p) for each node to be erased. Complexity: Average complexity for is at most O(log(size() + N)), where N is the number of elements in the container.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. Calls N times to disposer functor.

    39. -
      size_type count(const key_type & key) const;
      +
      size_type count(const key_type & key) const;

      Effects: Returns the number of contained elements with the given value

      Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given value.

      Throws: If key_compare throws. 

    40. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;
      + size_type count(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      Effects: Returns the number of contained elements with the given key

      Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given key.

      Throws: If comp throws.

    41. -
      iterator lower_bound(const key_type & key);
      +
      iterator lower_bound(const key_type & key);

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    42. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      -

      Throws: If comp throws.

      +

      Throws: If key_compare throws.

    43. -
      const_iterator lower_bound(const key_type & key) const;
      +
      const_iterator lower_bound(const key_type & key) const;

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -553,26 +556,27 @@ 
    44. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
      -

      Effects: Returns a const iterator to the first element whose key is not less than k or end() if that element does not exist.

      + lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      -

      Throws: If comp throws.

      +

      Throws: If key_compare throws.

    45. -
      iterator upper_bound(const key_type & key);
      +
      iterator upper_bound(const key_type & key);

      Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    46. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    47. -
      const_iterator upper_bound(const key_type & key) const;
      +
      const_iterator upper_bound(const key_type & key) const;

      Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -580,39 +584,42 @@ 
    48. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
      + upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    49. -
      iterator find(const key_type & key);
      +
      iterator find(const key_type & key);

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    50. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator find(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator find(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    51. -
      const_iterator find(const key_type & key) const;
      -

      Effects: Finds a const_iterator to the first element whose key is k or end() if that element does not exist.

      +
      const_iterator find(const key_type & key) const;
      +

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    52. template<typename KeyType, typename KeyTypeKeyCompare> 
-  const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;
      -

      Effects: Finds a const_iterator to the first element whose key is k or end() if that element does not exist.

      + const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      +

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    53. -
      std::pair< iterator, iterator > equal_range(const key_type & key);
      +
      std::pair< iterator, iterator > equal_range(const key_type & key);

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -620,14 +627,15 @@ 
    54. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp);
      + equal_range(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If comp throws. 

    55. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & key) const;
      +equal_range(const key_type & key) const;

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -635,16 +643,18 @@ 
    56. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;
      + equal_range(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If comp throws. 

    57. std::pair< iterator, iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed);
      -

      Requires: 'lower_key' must not be greater than 'upper_key'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key) if left_closed, upper_bound(lower_key) otherwise

      second = upper_bound(upper_key) if right_closed, lower_bound(upper_key) otherwise

      @@ -656,9 +666,12 @@ 
    58. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed);
      -

      Requires: KeyTypeKeyCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the container. 'lower_key' must not be greater than 'upper_key' according to 'comp'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

      +

      upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

      +

      upper_key shall not precede lower_key according to comp [comp(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!comp(upper_key, lower_key) && !comp(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key, comp) if left_closed, upper_bound(lower_key, comp) otherwise

      second = upper_bound(upper_key, comp) if right_closed, lower_bound(upper_key, comp) otherwise

      @@ -669,9 +682,10 @@ 
    59. std::pair< const_iterator, const_iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed) const;
      -

      Requires: 'lower_key' must not be greater than 'upper_key'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key) if left_closed, upper_bound(lower_key) otherwise

      second = upper_bound(upper_key) if right_closed, lower_bound(upper_key) otherwise

      @@ -683,9 +697,12 @@ 
    60. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed) const;
      -

      Requires: KeyTypeKeyCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the container. 'lower_key' must not be greater than 'upper_key' according to 'comp'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

      +

      upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

      +

      upper_key shall not precede lower_key according to comp [comp(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!comp(upper_key, lower_key) && !comp(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key, comp) if left_closed, upper_bound(lower_key, comp) otherwise

      second = upper_bound(upper_key, comp) if right_closed, lower_bound(upper_key, comp) otherwise

      @@ -695,28 +712,28 @@

      Note: Experimental function, the interface might change in future releases.

    61. -
      iterator iterator_to(reference value);
      +
      iterator iterator_to(reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      Throws: Nothing.

    62. -
      const_iterator iterator_to(const_reference value) const;
      +
      const_iterator iterator_to(const_reference value) const;

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid const_iterator i belonging to the set that points to the value

      Complexity: Constant.

      Throws: Nothing.

    63. -
      pointer unlink_leftmost_without_rebalance();
      +
      pointer unlink_leftmost_without_rebalance();

      Effects: Unlinks the leftmost node from the container.

      Complexity: Average complexity is constant time.

      Throws: Nothing.

      Notes: This function breaks the container and the container can only be used for more unlink_leftmost_without_rebalance calls. This function is normally used to achieve a step by step controlled destruction of the container.

    64. -
      void replace_node(iterator replace_this, reference with_this);
      +
      void replace_node(iterator replace_this, reference with_this);

      Requires: replace_this must be a valid iterator of *this and with_this must not be inserted in any container.

      Effects: Replaces replace_this in its position in the container with with_this. The container does not need to be rebalanced.

      Complexity: Constant.

      @@ -724,7 +741,7 @@

      Note: This function will break container ordering invariants if with_this is not equivalent to *replace_this according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing or comparison is needed.

    65. -
      void remove_node(reference value);
      +
      void remove_node(reference value);

      Effects: removes "value" from the container.

      Throws: Nothing.

      Complexity: Logarithmic time.

      @@ -734,39 +751,39 @@
    -

    -set public static functions

    +

    +set public static functions

    1. -
      static set & container_from_end_iterator(iterator end_iterator);
      +
      static set & container_from_end_iterator(iterator end_iterator);

      Precondition: end_iterator must be a valid end iterator of the container.

      Effects: Returns a const reference to the container associated to the end iterator

      Throws: Nothing.

      Complexity: Constant.

    2. -
      static const set & container_from_end_iterator(const_iterator end_iterator);
      +
      static const set & container_from_end_iterator(const_iterator end_iterator);

      Precondition: end_iterator must be a valid end iterator of the container.

      Effects: Returns a const reference to the container associated to the end iterator

      Throws: Nothing.

      Complexity: Constant.

    3. -
      static set & container_from_iterator(iterator it);
      +
      static set & container_from_iterator(iterator it);

      Precondition: it must be a valid iterator of the container.

      Effects: Returns a const reference to the container associated to the iterator

      Throws: Nothing.

      Complexity: Logarithmic.

    4. -
      static const set & container_from_iterator(const_iterator it);
      +
      static const set & container_from_iterator(const_iterator it);

      Precondition: it must be a valid iterator of the container.

      Effects: Returns a const reference to the container associated to the iterator

      Throws: Nothing.

      Complexity: Logarithmic.

    5. -
      static iterator s_iterator_to(reference value);
      +
      static iterator s_iterator_to(reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      @@ -774,7 +791,7 @@

      Note: This static function is available only if the value traits is stateless.

    6. -
      static const_iterator s_iterator_to(const_reference value);
      +
      static const_iterator s_iterator_to(const_reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      @@ -782,7 +799,7 @@

      Note: This static function is available only if the value traits is stateless.

    7. -
      static void init_node(reference value);
      +
      static void init_node(reference value);

      Requires: value shall not be in a container.

      Effects: init_node puts the hook of a value in a well-known default state.

      Throws: Nothing.

      diff --git a/doc/html/boost/intrusive/set_base_hook.html b/doc/html/boost/intrusive/set_base_hook.html index 00efbb24ce..438ae7e79c 100644 --- a/doc/html/boost/intrusive/set_base_hook.html +++ b/doc/html/boost/intrusive/set_base_hook.html @@ -36,18 +36,18 @@ class set_base_hook : public make_set_base_hook::type< O1, O2, O3, O4 > { public: // construct/copy/destruct - set_base_hook(); - set_base_hook(const set_base_hook &); - set_base_hook & operator=(const set_base_hook &); - ~set_base_hook(); + set_base_hook(); + set_base_hook(const set_base_hook &); + set_base_hook & operator=(const set_base_hook &); + ~set_base_hook(); - // public member functions - void swap_nodes(set_base_hook &); - bool is_linked() const; - void unlink(); + // public member functions + void swap_nodes(set_base_hook &); + bool is_linked() const; + void unlink(); };
    -

    Description

    +

    Description

    Derive a class from set_base_hook in order to store objects in in a set/multiset. set_base_hook holds the data necessary to maintain the set/multiset and provides an appropriate value_traits class for set/multiset.

    The hook admits the following options: tag<>, void_pointer<>, link_mode<> and optimize_size<>.

    tag<> defines a tag to identify the node. The same tag value can be used in different classes, but if a class is derived from more than one list_base_hook, then each list_base_hook needs its unique tag.

    @@ -55,53 +55,53 @@

    link_mode<> will specify the linking mode of the hook (normal_link, auto_unlink or safe_link).

    optimize_size<> will tell the hook to optimize the hook for size instead of speed.

    -

    +

    set_base_hook public construct/copy/destruct

    1. -
      set_base_hook();
      +
      set_base_hook();

      Effects: If link_mode is auto_unlink or safe_link initializes the node to an unlinked state.

      Throws: Nothing.

    2. -
      set_base_hook(const set_base_hook &);
      +
      set_base_hook(const set_base_hook &);

      Effects: If link_mode is auto_unlink or safe_link initializes the node to an unlinked state. The argument is ignored.

      Throws: Nothing.

      Rationale: Providing a copy-constructor makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

    3. -
      set_base_hook & operator=(const set_base_hook &);
      +
      set_base_hook & operator=(const set_base_hook &);

      Effects: Empty function. The argument is ignored.

      Throws: Nothing.

      Rationale: Providing an assignment operator makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

    4. -
      ~set_base_hook();
      +
      ~set_base_hook();

      Effects: If link_mode is normal_link, the destructor does nothing (ie. no code is generated). If link_mode is safe_link and the object is stored in a set an assertion is raised. If link_mode is auto_unlink and is_linked() is true, the node is unlinked.

      Throws: Nothing.

    -

    -set_base_hook public member functions

    +

    +set_base_hook public member functions

    1. -
      void swap_nodes(set_base_hook & other);
      +
      void swap_nodes(set_base_hook & other);

      Effects: Swapping two nodes swaps the position of the elements related to those nodes in one or two containers. That is, if the node this is part of the element e1, the node x is part of the element e2 and both elements are included in the containers s1 and s2, then after the swap-operation e1 is in s2 at the position of e2 and e2 is in s1 at the position of e1. If one element is not in a container, then after the swap-operation the other element is not in a container. Iterators to e1 and e2 related to those nodes are invalidated.

      Complexity: Constant

      Throws: Nothing.

    2. -
      bool is_linked() const;
      +
      bool is_linked() const;

      Precondition: link_mode must be safe_link or auto_unlink.

      Returns: true, if the node belongs to a container, false otherwise. This function can be used to test whether set::iterator_to will return a valid iterator.

      Complexity: Constant

    3. -
      void unlink();
      +
      void unlink();

      Effects: Removes the node if it's inserted in a container. This function is only allowed if link_mode is auto_unlink.

      Throws: Nothing.

      4. diff --git a/doc/html/boost/intrusive/set_member_hook.html b/doc/html/boost/intrusive/set_member_hook.html index b479ed942e..fe203c80e2 100644 --- a/doc/html/boost/intrusive/set_member_hook.html +++ b/doc/html/boost/intrusive/set_member_hook.html @@ -36,71 +36,71 @@ class set_member_hook : public make_set_member_hook::type< O1, O2, O3, O4 > { public: // construct/copy/destruct - set_member_hook(); - set_member_hook(const set_member_hook &); - set_member_hook & operator=(const set_member_hook &); - ~set_member_hook(); + set_member_hook(); + set_member_hook(const set_member_hook &); + set_member_hook & operator=(const set_member_hook &); + ~set_member_hook(); - // public member functions - void swap_nodes(set_member_hook &); - bool is_linked() const; - void unlink(); + // public member functions + void swap_nodes(set_member_hook &); + bool is_linked() const; + void unlink(); };
    -

    Description

    +

    Description

    Put a public data member set_member_hook in order to store objects of this class in a set/multiset. set_member_hook holds the data necessary for maintaining the set/multiset and provides an appropriate value_traits class for set/multiset.

    The hook admits the following options: void_pointer<>, link_mode<> and optimize_size<>.

    void_pointer<> is the pointer type that will be used internally in the hook and the container configured to use this hook.

    link_mode<> will specify the linking mode of the hook (normal_link, auto_unlink or safe_link).

    optimize_size<> will tell the hook to optimize the hook for size instead of speed.

    -

    +

    set_member_hook public construct/copy/destruct

    1. -
      set_member_hook();
      +
      set_member_hook();

      Effects: If link_mode is auto_unlink or safe_link initializes the node to an unlinked state.

      Throws: Nothing.

    2. -
      set_member_hook(const set_member_hook &);
      +
      set_member_hook(const set_member_hook &);

      Effects: If link_mode is auto_unlink or safe_link initializes the node to an unlinked state. The argument is ignored.

      Throws: Nothing.

      Rationale: Providing a copy-constructor makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

    3. -
      set_member_hook & operator=(const set_member_hook &);
      +
      set_member_hook & operator=(const set_member_hook &);

      Effects: Empty function. The argument is ignored.

      Throws: Nothing.

      Rationale: Providing an assignment operator makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

    4. -
      ~set_member_hook();
      +
      ~set_member_hook();

      Effects: If link_mode is normal_link, the destructor does nothing (ie. no code is generated). If link_mode is safe_link and the object is stored in a set an assertion is raised. If link_mode is auto_unlink and is_linked() is true, the node is unlinked.

      Throws: Nothing.

    -

    -set_member_hook public member functions

    +

    +set_member_hook public member functions

    1. -
      void swap_nodes(set_member_hook & other);
      +
      void swap_nodes(set_member_hook & other);

      Effects: Swapping two nodes swaps the position of the elements related to those nodes in one or two containers. That is, if the node this is part of the element e1, the node x is part of the element e2 and both elements are included in the containers s1 and s2, then after the swap-operation e1 is in s2 at the position of e2 and e2 is in s1 at the position of e1. If one element is not in a container, then after the swap-operation the other element is not in a container. Iterators to e1 and e2 related to those nodes are invalidated.

      Complexity: Constant

      Throws: Nothing.

    2. -
      bool is_linked() const;
      +
      bool is_linked() const;

      Precondition: link_mode must be safe_link or auto_unlink.

      Returns: true, if the node belongs to a container, false otherwise. This function can be used to test whether set::iterator_to will return a valid iterator.

      Complexity: Constant

    3. -
      void unlink();
      +
      void unlink();

      Effects: Removes the node if it's inserted in a container. This function is only allowed if link_mode is auto_unlink.

      Throws: Nothing.

      4. diff --git a/doc/html/boost/intrusive/sg_multiset.html b/doc/html/boost/intrusive/sg_multiset.html index c914224798..3b666dc526 100644 --- a/doc/html/boost/intrusive/sg_multiset.html +++ b/doc/html/boost/intrusive/sg_multiset.html @@ -60,135 +60,135 @@ typedef implementation_defined::node_algorithms node_algorithms; // construct/copy/destruct - explicit sg_multiset(const key_compare & = key_compare(), + explicit sg_multiset(const key_compare & = key_compare(), const value_traits & = value_traits()); template<typename Iterator> - sg_multiset(Iterator, Iterator, const key_compare & = key_compare(), + sg_multiset(Iterator, Iterator, const key_compare & = key_compare(), const value_traits & = value_traits()); - sg_multiset(sg_multiset &&); - sg_multiset & operator=(sg_multiset &&); - ~sg_multiset(); + sg_multiset(sg_multiset &&); + sg_multiset & operator=(sg_multiset &&); + ~sg_multiset(); - // public member functions - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end(); - const_iterator end() const; - const_iterator cend() const; - reverse_iterator rbegin(); - const_reverse_iterator rbegin() const; - const_reverse_iterator crbegin() const; - reverse_iterator rend(); - const_reverse_iterator rend() const; - const_reverse_iterator crend() const; - key_compare key_comp() const; - value_compare value_comp() const; - bool empty() const; - size_type size() const; - void swap(sg_multiset &); + // public member functions + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end(); + const_iterator end() const; + const_iterator cend() const; + reverse_iterator rbegin(); + const_reverse_iterator rbegin() const; + const_reverse_iterator crbegin() const; + reverse_iterator rend(); + const_reverse_iterator rend() const; + const_reverse_iterator crend() const; + key_compare key_comp() const; + value_compare value_comp() const; + bool empty() const; + size_type size() const; + void swap(sg_multiset &); template<typename Cloner, typename Disposer> - void clone_from(const sg_multiset &, Cloner, Disposer); + void clone_from(const sg_multiset &, Cloner, Disposer); template<typename Cloner, typename Disposer> - void clone_from(sg_multiset &&, Cloner, Disposer); - iterator insert(reference); - iterator insert(const_iterator, reference); - template<typename Iterator> void insert(Iterator, Iterator); - iterator insert_before(const_iterator, reference); - void push_back(reference); - void push_front(reference); - iterator erase(const_iterator); - iterator erase(const_iterator, const_iterator); - size_type erase(const key_type &); + void clone_from(sg_multiset &&, Cloner, Disposer); + iterator insert(reference); + iterator insert(const_iterator, reference); + template<typename Iterator> void insert(Iterator, Iterator); + iterator insert_before(const_iterator, reference); + void push_back(reference); + void push_front(reference); + iterator erase(const_iterator); + iterator erase(const_iterator, const_iterator); + size_type erase(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - size_type erase(const KeyType &, KeyTypeKeyCompare); + size_type erase(const KeyType &, KeyTypeKeyCompare); template<typename Disposer> - iterator erase_and_dispose(const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, Disposer); template<typename Disposer> - iterator erase_and_dispose(const_iterator, const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, const_iterator, Disposer); template<typename Disposer> - size_type erase_and_dispose(const key_type &, Disposer); + size_type erase_and_dispose(const key_type &, Disposer); template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> - size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); - void clear(); - template<typename Disposer> void clear_and_dispose(Disposer); - size_type count(const key_type &) const; + size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); + void clear(); + template<typename Disposer> void clear_and_dispose(Disposer); + size_type count(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - size_type count(const KeyType &, KeyTypeKeyCompare) const; - iterator lower_bound(const key_type &); + size_type count(const KeyType &, KeyTypeKeyCompare) const; + iterator lower_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator lower_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator lower_bound(const key_type &) const; + iterator lower_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator lower_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator upper_bound(const key_type &); + const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator upper_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator upper_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator upper_bound(const key_type &) const; + iterator upper_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator upper_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator find(const key_type &); + const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator find(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator find(const KeyType &, KeyTypeKeyCompare); - const_iterator find(const key_type &) const; + iterator find(const KeyType &, KeyTypeKeyCompare); + const_iterator find(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator find(const KeyType &, KeyTypeKeyCompare) const; - std::pair< iterator, iterator > equal_range(const key_type &); + const_iterator find(const KeyType &, KeyTypeKeyCompare) const; + std::pair< iterator, iterator > equal_range(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - equal_range(const KeyType &, KeyTypeKeyCompare); + equal_range(const KeyType &, KeyTypeKeyCompare); std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; + equal_range(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - equal_range(const KeyType &, KeyTypeKeyCompare) const; + equal_range(const KeyType &, KeyTypeKeyCompare) const; std::pair< iterator, iterator > - bounded_range(const key_type &, const key_type &, bool, bool); + bounded_range(const key_type &, const key_type &, bool, bool); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool); std::pair< const_iterator, const_iterator > - bounded_range(const key_type &, const key_type &, bool, bool) const; + bounded_range(const key_type &, const key_type &, bool, bool) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool) const; - iterator iterator_to(reference); - const_iterator iterator_to(const_reference) const; - pointer unlink_leftmost_without_rebalance(); - void replace_node(iterator, reference); - void remove_node(reference); - void rebalance(); - iterator rebalance_subtree(iterator); - float balance_factor() const; - void balance_factor(float); + iterator iterator_to(reference); + const_iterator iterator_to(const_reference) const; + pointer unlink_leftmost_without_rebalance(); + void replace_node(iterator, reference); + void remove_node(reference); + void rebalance(); + iterator rebalance_subtree(iterator); + float balance_factor() const; + void balance_factor(float); - // public static functions - static sg_multiset & container_from_end_iterator(iterator); - static const sg_multiset & container_from_end_iterator(const_iterator); - static sg_multiset & container_from_iterator(iterator); - static const sg_multiset & container_from_iterator(const_iterator); - static iterator s_iterator_to(reference); - static const_iterator s_iterator_to(const_reference); - static void init_node(reference); + // public static functions + static sg_multiset & container_from_end_iterator(iterator); + static const sg_multiset & container_from_end_iterator(const_iterator); + static sg_multiset & container_from_iterator(iterator); + static const sg_multiset & container_from_iterator(const_iterator); + static iterator s_iterator_to(reference); + static const_iterator s_iterator_to(const_reference); + static void init_node(reference); // public data members static const bool constant_time_size; };
    -

    Description

    +

    Description

    The class template sg_multiset is an intrusive container, that mimics most of the interface of std::sg_multiset as described in the C++ standard.

    The template parameter T is the type to be managed by the container. The user can specify additional options and if no options are provided default options are used.

    The container supports the following options: base_hook<>/member_hook<>/value_traits<>, floating_point<>, size_type<> and compare<>.

    -

    +

    sg_multiset public construct/copy/destruct

    1. -
      explicit sg_multiset(const key_compare & cmp = key_compare(), 
+
      explicit sg_multiset(const key_compare & cmp = key_compare(), 
                      const value_traits & v_traits = value_traits());
      
 
      Effects: Constructs an empty container.
      
 
      Complexity: Constant.
      
@@ -196,7 +196,7 @@
 
    2. template<typename Iterator> 
-  sg_multiset(Iterator b, Iterator e, const key_compare & cmp = key_compare(), 
+  sg_multiset(Iterator b, Iterator e, const key_compare & cmp = key_compare(), 
               const value_traits & v_traits = value_traits());

      Requires: Dereferencing iterator must yield an lvalue of type value_type. cmp must be a comparison function that induces a strict weak ordering.

      Effects: Constructs an empty container and inserts elements from [b, e).

      @@ -204,15 +204,15 @@

      Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor/operator() of the key_compare object throws. Basic guarantee.

    3. -
      sg_multiset(sg_multiset && x);
      +
      sg_multiset(sg_multiset && x);

      Effects: to-do

    4. -
      sg_multiset & operator=(sg_multiset && x);
      +
      sg_multiset & operator=(sg_multiset && x);

      Effects: to-do

    5. -
      ~sg_multiset();
      +
      ~sg_multiset();

      Effects: Detaches all elements from this. The objects in the set are not deleted (i.e. no destructors are called), but the nodes according to the value_traits template parameter are reinitialized and thus can be reused.

      Complexity: Linear to elements contained in *this.

      Throws: Nothing.

      @@ -220,114 +220,114 @@
    -

    -sg_multiset public member functions

    +

    +sg_multiset public member functions

    1. -
      iterator begin();
      +
      iterator begin();

      Effects: Returns an iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    2. -
      const_iterator begin() const;
      +
      const_iterator begin() const;

      Effects: Returns a const_iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    3. -
      const_iterator cbegin() const;
      +
      const_iterator cbegin() const;

      Effects: Returns a const_iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    4. -
      iterator end();
      +
      iterator end();

      Effects: Returns an iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    5. -
      const_iterator end() const;
      +
      const_iterator end() const;

      Effects: Returns a const_iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    6. -
      const_iterator cend() const;
      +
      const_iterator cend() const;

      Effects: Returns a const_iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    7. -
      reverse_iterator rbegin();
      +
      reverse_iterator rbegin();

      Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    8. -
      const_reverse_iterator rbegin() const;
      +
      const_reverse_iterator rbegin() const;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    9. -
      const_reverse_iterator crbegin() const;
      +
      const_reverse_iterator crbegin() const;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    10. -
      reverse_iterator rend();
      +
      reverse_iterator rend();

      Effects: Returns a reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    11. -
      const_reverse_iterator rend() const;
      +
      const_reverse_iterator rend() const;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    12. -
      const_reverse_iterator crend() const;
      +
      const_reverse_iterator crend() const;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    13. -
      key_compare key_comp() const;
      +
      key_compare key_comp() const;

      Effects: Returns the key_compare object used by the container.

      Complexity: Constant.

      Throws: If key_compare copy-constructor throws.

    14. -
      value_compare value_comp() const;
      +
      value_compare value_comp() const;

      Effects: Returns the value_compare object used by the container.

      Complexity: Constant.

      Throws: If value_compare copy-constructor throws.

    15. -
      bool empty() const;
      +
      bool empty() const;

      Effects: Returns true if the container is empty.

      Complexity: Constant.

      Throws: Nothing.

    16. -
      size_type size() const;
      +
      size_type size() const;

      Effects: Returns the number of elements stored in the container.

      Complexity: Linear to elements contained in *this if constant-time size option is disabled. Constant time otherwise.

      Throws: Nothing.

    17. -
      void swap(sg_multiset & other);
      +
      void swap(sg_multiset & other);

      Effects: Swaps the contents of two containers.

      Complexity: Constant.

      Throws: If the comparison functor's swap call throws. 

    18. template<typename Cloner, typename Disposer> 
-  void clone_from(const sg_multiset & src, Cloner cloner, Disposer disposer);
      + void clone_from(const sg_multiset & src, Cloner cloner, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

      Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(const_reference ) and inserts them on *this. Copies the predicate from the source container.

      If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

      @@ -336,7 +336,7 @@ 
    19. template<typename Cloner, typename Disposer> 
-  void clone_from(sg_multiset && src, Cloner cloner, Disposer disposer);
      + void clone_from(sg_multiset && src, Cloner cloner, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

      Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(reference) and inserts them on *this. Copies the predicate from the source container.

      If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

      @@ -345,7 +345,7 @@

      Note: This version can modify the source container, useful to implement move semantics. Additional notes: it also copies the alpha factor from the source container.

    20. -
      iterator insert(reference value);
      +
      iterator insert(reference value);

      Requires: value must be an lvalue

      Effects: Inserts value into the container before the upper bound.

      Complexity: Average complexity for insert element is at most logarithmic.

      @@ -353,7 +353,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    21. -
      iterator insert(const_iterator hint, reference value);
      +
      iterator insert(const_iterator hint, reference value);

      Requires: value must be an lvalue, and "hint" must be a valid iterator.

      Effects: Inserts x into the container, using "hint" as a hint to where it will be inserted. If "hint" is the upper_bound the insertion takes constant time (two comparisons in the worst case)

      Complexity: Logarithmic in general, but it is amortized constant time if t is inserted immediately before hint.

      @@ -361,7 +361,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    22. -
      template<typename Iterator> void insert(Iterator b, Iterator e);
      +
      template<typename Iterator> void insert(Iterator b, Iterator e);

      Requires: Dereferencing iterator must yield an lvalue of type value_type.

      Effects: Inserts a each element of a range into the container before the upper bound of the key of each element.

      Complexity: Insert range is in general O(N * log(N)), where N is the size of the range. However, it is linear in N if the range is already sorted by value_comp().

      @@ -369,7 +369,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    23. -
      iterator insert_before(const_iterator pos, reference value);
      +
      iterator insert_before(const_iterator pos, reference value);

      Requires: value must be an lvalue, "pos" must be a valid iterator (or end) and must be the succesor of value once inserted according to the predicate

      Effects: Inserts x into the container before "pos".

      Complexity: Constant time.

      @@ -377,7 +377,7 @@

      Note: This function does not check preconditions so if "pos" is not the successor of "value" container ordering invariant will be broken. This is a low-level function to be used only for performance reasons by advanced users.

    24. -
      void push_back(reference value);
      +
      void push_back(reference value);

      Requires: value must be an lvalue, and it must be no less than the greatest inserted key

      Effects: Inserts x into the container in the last position.

      Complexity: Constant time.

      @@ -385,7 +385,7 @@

      Note: This function does not check preconditions so if value is less than the greatest inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

    25. -
      void push_front(reference value);
      +
      void push_front(reference value);

      Requires: value must be an lvalue, and it must be no greater than the minimum inserted key

      Effects: Inserts x into the container in the first position.

      Complexity: Constant time.

      @@ -393,21 +393,21 @@

      Note: This function does not check preconditions so if value is greater than the minimum inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

    26. -
      iterator erase(const_iterator i);
      +
      iterator erase(const_iterator i);

      Effects: Erases the element pointed to by i.

      Complexity: Average complexity for erase element is constant time.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    27. -
      iterator erase(const_iterator b, const_iterator e);
      +
      iterator erase(const_iterator b, const_iterator e);

      Effects: Erases the range pointed to by b end e.

      Complexity: Average complexity for erase range is at most O(log(size() + N)), where N is the number of elements in the range.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    28. -
      size_type erase(const key_type & key);
      +
      size_type erase(const key_type & key);

      Effects: Erases all the elements with the given value.

      Returns: The number of erased elements.

      Complexity: O(log(size() + N).

      @@ -416,7 +416,8 @@ 
    29. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type erase(const KeyType & key, KeyTypeKeyCompare comp);
      + size_type erase(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Erases all the elements with the given key. according to the comparison functor "comp".

      Returns: The number of erased elements.

      Complexity: O(log(size() + N).

      @@ -425,7 +426,7 @@ 
    30. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator i, Disposer disposer);
      + iterator erase_and_dispose(const_iterator i, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases the element pointed to by i. Disposer::operator()(pointer) is called for the removed element.

      Complexity: Average complexity for erase element is constant time.

      @@ -434,7 +435,7 @@ 
    31. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator b, const_iterator e, 
+  iterator erase_and_dispose(const_iterator b, const_iterator e, 
                              Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases the range pointed to by b end e. Disposer::operator()(pointer) is called for the removed elements.

      @@ -444,7 +445,7 @@ 
    32. template<typename Disposer> 
-  size_type erase_and_dispose(const key_type & key, Disposer disposer);
      + size_type erase_and_dispose(const key_type & key, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases all the elements with the given value. Disposer::operator()(pointer) is called for the removed elements.

      Returns: The number of erased elements.

      @@ -454,8 +455,9 @@ 
    33. template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> 
-  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
+  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
                               Disposer disposer);
      +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk) and nk the key_type of a value_type inserted into *this.

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases all the elements with the given key. according to the comparison functor "comp". Disposer::operator()(pointer) is called for the removed elements.

      Returns: The number of erased elements.

      @@ -464,46 +466,47 @@

      Note: Invalidates the iterators to the erased elements.

    34. -
      void clear();
      +
      void clear();

      Effects: Erases all of the elements.

      Complexity: Linear to the number of elements on the container. if it's a safe-mode or auto-unlink value_type. Constant time otherwise.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    35. -
      template<typename Disposer> void clear_and_dispose(Disposer disposer);
      +
      template<typename Disposer> void clear_and_dispose(Disposer disposer);

      Effects: Erases all of the elements calling disposer(p) for each node to be erased. Complexity: Average complexity for is at most O(log(size() + N)), where N is the number of elements in the container.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. Calls N times to disposer functor.

    36. -
      size_type count(const key_type & key) const;
      +
      size_type count(const key_type & key) const;

      Effects: Returns the number of contained elements with the given value

      Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given value.

      Throws: If key_compare throws. 

    37. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;
      + size_type count(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      Effects: Returns the number of contained elements with the given key

      Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given key.

      Throws: If comp throws.

    38. -
      iterator lower_bound(const key_type & key);
      +
      iterator lower_bound(const key_type & key);

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    39. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      -

      Throws: If comp throws.

      +

      Throws: If key_compare throws.

    40. -
      const_iterator lower_bound(const key_type & key) const;
      +
      const_iterator lower_bound(const key_type & key) const;

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -511,26 +514,27 @@ 
    41. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
      -

      Effects: Returns a const iterator to the first element whose key is not less than k or end() if that element does not exist.

      + lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      -

      Throws: If comp throws.

      +

      Throws: If key_compare throws.

    42. -
      iterator upper_bound(const key_type & key);
      +
      iterator upper_bound(const key_type & key);

      Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    43. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    44. -
      const_iterator upper_bound(const key_type & key) const;
      +
      const_iterator upper_bound(const key_type & key) const;

      Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -538,39 +542,42 @@ 
    45. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
      + upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    46. -
      iterator find(const key_type & key);
      +
      iterator find(const key_type & key);

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    47. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator find(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator find(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    48. -
      const_iterator find(const key_type & key) const;
      -

      Effects: Finds a const_iterator to the first element whose key is k or end() if that element does not exist.

      +
      const_iterator find(const key_type & key) const;
      +

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    49. template<typename KeyType, typename KeyTypeKeyCompare> 
-  const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;
      -

      Effects: Finds a const_iterator to the first element whose key is k or end() if that element does not exist.

      + const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      +

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    50. -
      std::pair< iterator, iterator > equal_range(const key_type & key);
      +
      std::pair< iterator, iterator > equal_range(const key_type & key);

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -578,14 +585,15 @@ 
    51. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp);
      + equal_range(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If comp throws. 

    52. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & key) const;
      +equal_range(const key_type & key) const;

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -593,16 +601,18 @@ 
    53. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;
      + equal_range(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If comp throws. 

    54. std::pair< iterator, iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed);
      -

      Requires: 'lower_key' must not be greater than 'upper_key'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key) if left_closed, upper_bound(lower_key) otherwise

      second = upper_bound(upper_key) if right_closed, lower_bound(upper_key) otherwise

      @@ -614,9 +624,12 @@ 
    55. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed);
      -

      Requires: KeyTypeKeyCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the container. 'lower_key' must not be greater than 'upper_key' according to 'comp'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

      +

      upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

      +

      upper_key shall not precede lower_key according to comp [comp(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!comp(upper_key, lower_key) && !comp(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key, comp) if left_closed, upper_bound(lower_key, comp) otherwise

      second = upper_bound(upper_key, comp) if right_closed, lower_bound(upper_key, comp) otherwise

      @@ -627,9 +640,10 @@ 
    56. std::pair< const_iterator, const_iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed) const;
      -

      Requires: 'lower_key' must not be greater than 'upper_key'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key) if left_closed, upper_bound(lower_key) otherwise

      second = upper_bound(upper_key) if right_closed, lower_bound(upper_key) otherwise

      @@ -641,9 +655,12 @@ 
    57. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed) const;
      -

      Requires: KeyTypeKeyCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the container. 'lower_key' must not be greater than 'upper_key' according to 'comp'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

      +

      upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

      +

      upper_key shall not precede lower_key according to comp [comp(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!comp(upper_key, lower_key) && !comp(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key, comp) if left_closed, upper_bound(lower_key, comp) otherwise

      second = upper_bound(upper_key, comp) if right_closed, lower_bound(upper_key, comp) otherwise

      @@ -653,28 +670,28 @@

      Note: Experimental function, the interface might change in future releases.

    58. -
      iterator iterator_to(reference value);
      +
      iterator iterator_to(reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      Throws: Nothing.

    59. -
      const_iterator iterator_to(const_reference value) const;
      +
      const_iterator iterator_to(const_reference value) const;

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid const_iterator i belonging to the set that points to the value

      Complexity: Constant.

      Throws: Nothing.

    60. -
      pointer unlink_leftmost_without_rebalance();
      +
      pointer unlink_leftmost_without_rebalance();

      Effects: Unlinks the leftmost node from the container.

      Complexity: Average complexity is constant time.

      Throws: Nothing.

      Notes: This function breaks the container and the container can only be used for more unlink_leftmost_without_rebalance calls. This function is normally used to achieve a step by step controlled destruction of the container.

    61. -
      void replace_node(iterator replace_this, reference with_this);
      +
      void replace_node(iterator replace_this, reference with_this);

      Requires: replace_this must be a valid iterator of *this and with_this must not be inserted in any container.

      Effects: Replaces replace_this in its position in the container with with_this. The container does not need to be rebalanced.

      Complexity: Constant.

      @@ -682,7 +699,7 @@

      Note: This function will break container ordering invariants if with_this is not equivalent to *replace_this according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing or comparison is needed.

    62. -
      void remove_node(reference value);
      +
      void remove_node(reference value);

      Effects: removes "value" from the container.

      Throws: Nothing.

      Complexity: Logarithmic time.

      @@ -690,13 +707,13 @@

      If the user calls this function with a constant time size container or stateful comparison functor a compilation error will be issued.

    63. -
      void rebalance();
      +
      void rebalance();

      Effects: Rebalances the tree.

      Throws: Nothing.

      Complexity: Linear.

    64. -
      iterator rebalance_subtree(iterator root);
      +
      iterator rebalance_subtree(iterator root);

      Requires: old_root is a node of a tree.

      Effects: Rebalances the subtree rooted at old_root.

      Returns: The new root of the subtree.

      @@ -704,13 +721,13 @@

      Complexity: Linear to the elements in the subtree.

    65. -
      float balance_factor() const;
      +
      float balance_factor() const;

      Returns: The balance factor (alpha) used in this tree

      Throws: Nothing.

      Complexity: Constant.

    66. -
      void balance_factor(float new_alpha);
      +
      void balance_factor(float new_alpha);

      Requires: new_alpha must be a value between 0.5 and 1.0

      Effects: Establishes a new balance factor (alpha) and rebalances the tree if the new balance factor is stricter (less) than the old factor.

      Throws: Nothing.

      @@ -719,11 +736,11 @@
    -

    -sg_multiset public static functions

    +

    +sg_multiset public static functions

    1. -
      static sg_multiset & container_from_end_iterator(iterator end_iterator);
      +
      static sg_multiset & container_from_end_iterator(iterator end_iterator);

      Precondition: end_iterator must be a valid end iterator of the container.

      Effects: Returns a const reference to the container associated to the end iterator

      Throws: Nothing.

      @@ -731,28 +748,28 @@ 
    2. static const sg_multiset & 
-container_from_end_iterator(const_iterator end_iterator);
      +container_from_end_iterator(const_iterator end_iterator);

      Precondition: end_iterator must be a valid end iterator of the container.

      Effects: Returns a const reference to the container associated to the end iterator

      Throws: Nothing.

      Complexity: Constant.

    3. -
      static sg_multiset & container_from_iterator(iterator it);
      +
      static sg_multiset & container_from_iterator(iterator it);

      Precondition: it must be a valid iterator of the container.

      Effects: Returns a const reference to the container associated to the iterator

      Throws: Nothing.

      Complexity: Logarithmic.

    4. -
      static const sg_multiset & container_from_iterator(const_iterator it);
      +
      static const sg_multiset & container_from_iterator(const_iterator it);

      Precondition: it must be a valid iterator of the container.

      Effects: Returns a const reference to the container associated to the iterator

      Throws: Nothing.

      Complexity: Logarithmic.

    5. -
      static iterator s_iterator_to(reference value);
      +
      static iterator s_iterator_to(reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      @@ -760,7 +777,7 @@

      Note: This static function is available only if the value traits is stateless.

    6. -
      static const_iterator s_iterator_to(const_reference value);
      +
      static const_iterator s_iterator_to(const_reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      @@ -768,7 +785,7 @@

      Note: This static function is available only if the value traits is stateless.

    7. -
      static void init_node(reference value);
      +
      static void init_node(reference value);

      Requires: value shall not be in a container.

      Effects: init_node puts the hook of a value in a well-known default state.

      Throws: Nothing.

      diff --git a/doc/html/boost/intrusive/sg_set.html b/doc/html/boost/intrusive/sg_set.html index 31f226c135..7d0323fc17 100644 --- a/doc/html/boost/intrusive/sg_set.html +++ b/doc/html/boost/intrusive/sg_set.html @@ -60,143 +60,143 @@ typedef implementation_defined::node_algorithms node_algorithms; // construct/copy/destruct - explicit sg_set(const key_compare & = key_compare(), + explicit sg_set(const key_compare & = key_compare(), const value_traits & = value_traits()); template<typename Iterator> - sg_set(Iterator, Iterator, const key_compare & = key_compare(), + sg_set(Iterator, Iterator, const key_compare & = key_compare(), const value_traits & = value_traits()); - sg_set(sg_set &&); - sg_set & operator=(sg_set &&); - ~sg_set(); + sg_set(sg_set &&); + sg_set & operator=(sg_set &&); + ~sg_set(); - // public member functions - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end(); - const_iterator end() const; - const_iterator cend() const; - reverse_iterator rbegin(); - const_reverse_iterator rbegin() const; - const_reverse_iterator crbegin() const; - reverse_iterator rend(); - const_reverse_iterator rend() const; - const_reverse_iterator crend() const; - key_compare key_comp() const; - value_compare value_comp() const; - bool empty() const; - size_type size() const; - void swap(sg_set &); + // public member functions + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end(); + const_iterator end() const; + const_iterator cend() const; + reverse_iterator rbegin(); + const_reverse_iterator rbegin() const; + const_reverse_iterator crbegin() const; + reverse_iterator rend(); + const_reverse_iterator rend() const; + const_reverse_iterator crend() const; + key_compare key_comp() const; + value_compare value_comp() const; + bool empty() const; + size_type size() const; + void swap(sg_set &); template<typename Cloner, typename Disposer> - void clone_from(const sg_set &, Cloner, Disposer); + void clone_from(const sg_set &, Cloner, Disposer); template<typename Cloner, typename Disposer> - void clone_from(sg_set &&, Cloner, Disposer); - std::pair< iterator, bool > insert(reference); - iterator insert(const_iterator, reference); + void clone_from(sg_set &&, Cloner, Disposer); + std::pair< iterator, bool > insert(reference); + iterator insert(const_iterator, reference); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, bool > - insert_check(const KeyType &, KeyTypeKeyCompare, insert_commit_data &); + insert_check(const KeyType &, KeyTypeKeyCompare, insert_commit_data &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, bool > - insert_check(const_iterator, const KeyType &, KeyTypeKeyCompare, + insert_check(const_iterator, const KeyType &, KeyTypeKeyCompare, insert_commit_data &); - template<typename Iterator> void insert(Iterator, Iterator); - iterator insert_commit(reference, const insert_commit_data &); - iterator insert_before(const_iterator, reference); - void push_back(reference); - void push_front(reference); - iterator erase(const_iterator); - iterator erase(const_iterator, const_iterator); - size_type erase(const key_type &); + template<typename Iterator> void insert(Iterator, Iterator); + iterator insert_commit(reference, const insert_commit_data &); + iterator insert_before(const_iterator, reference); + void push_back(reference); + void push_front(reference); + iterator erase(const_iterator); + iterator erase(const_iterator, const_iterator); + size_type erase(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - size_type erase(const KeyType &, KeyTypeKeyCompare); + size_type erase(const KeyType &, KeyTypeKeyCompare); template<typename Disposer> - iterator erase_and_dispose(const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, Disposer); template<typename Disposer> - iterator erase_and_dispose(const_iterator, const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, const_iterator, Disposer); template<typename Disposer> - size_type erase_and_dispose(const key_type &, Disposer); + size_type erase_and_dispose(const key_type &, Disposer); template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> - size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); - void clear(); - template<typename Disposer> void clear_and_dispose(Disposer); - size_type count(const key_type &) const; + size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); + void clear(); + template<typename Disposer> void clear_and_dispose(Disposer); + size_type count(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - size_type count(const KeyType &, KeyTypeKeyCompare) const; - iterator lower_bound(const key_type &); + size_type count(const KeyType &, KeyTypeKeyCompare) const; + iterator lower_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator lower_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator lower_bound(const key_type &) const; + iterator lower_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator lower_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator upper_bound(const key_type &); + const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator upper_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator upper_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator upper_bound(const key_type &) const; + iterator upper_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator upper_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator find(const key_type &); + const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator find(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator find(const KeyType &, KeyTypeKeyCompare); - const_iterator find(const key_type &) const; + iterator find(const KeyType &, KeyTypeKeyCompare); + const_iterator find(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator find(const KeyType &, KeyTypeKeyCompare) const; - std::pair< iterator, iterator > equal_range(const key_type &); + const_iterator find(const KeyType &, KeyTypeKeyCompare) const; + std::pair< iterator, iterator > equal_range(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - equal_range(const KeyType &, KeyTypeKeyCompare); + equal_range(const KeyType &, KeyTypeKeyCompare); std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; + equal_range(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - equal_range(const KeyType &, KeyTypeKeyCompare) const; + equal_range(const KeyType &, KeyTypeKeyCompare) const; std::pair< iterator, iterator > - bounded_range(const key_type &, const key_type &, bool, bool); + bounded_range(const key_type &, const key_type &, bool, bool); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool); std::pair< const_iterator, const_iterator > - bounded_range(const key_type &, const key_type &, bool, bool) const; + bounded_range(const key_type &, const key_type &, bool, bool) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool) const; - iterator iterator_to(reference); - const_iterator iterator_to(const_reference) const; - pointer unlink_leftmost_without_rebalance(); - void replace_node(iterator, reference); - void remove_node(reference); - void rebalance(); - iterator rebalance_subtree(iterator); - float balance_factor() const; - void balance_factor(float); + iterator iterator_to(reference); + const_iterator iterator_to(const_reference) const; + pointer unlink_leftmost_without_rebalance(); + void replace_node(iterator, reference); + void remove_node(reference); + void rebalance(); + iterator rebalance_subtree(iterator); + float balance_factor() const; + void balance_factor(float); - // public static functions - static sg_set & container_from_end_iterator(iterator); - static const sg_set & container_from_end_iterator(const_iterator); - static sg_set & container_from_iterator(iterator); - static const sg_set & container_from_iterator(const_iterator); - static iterator s_iterator_to(reference); - static const_iterator s_iterator_to(const_reference); - static void init_node(reference); + // public static functions + static sg_set & container_from_end_iterator(iterator); + static const sg_set & container_from_end_iterator(const_iterator); + static sg_set & container_from_iterator(iterator); + static const sg_set & container_from_iterator(const_iterator); + static iterator s_iterator_to(reference); + static const_iterator s_iterator_to(const_reference); + static void init_node(reference); // public data members static const bool constant_time_size; };
    -

    Description

    +

    Description

    The class template sg_set is an intrusive container, that mimics most of the interface of std::sg_set as described in the C++ standard.

    The template parameter T is the type to be managed by the container. The user can specify additional options and if no options are provided default options are used.

    The container supports the following options: base_hook<>/member_hook<>/value_traits<>, floating_point<>, size_type<> and compare<>.

    -

    +

    sg_set public construct/copy/destruct

    1. -
      explicit sg_set(const key_compare & cmp = key_compare(), 
+
      explicit sg_set(const key_compare & cmp = key_compare(), 
                 const value_traits & v_traits = value_traits());
      
 
      Effects: Constructs an empty container.
      
 
      Complexity: Constant.
      
@@ -204,7 +204,7 @@
 
    2. template<typename Iterator> 
-  sg_set(Iterator b, Iterator e, const key_compare & cmp = key_compare(), 
+  sg_set(Iterator b, Iterator e, const key_compare & cmp = key_compare(), 
          const value_traits & v_traits = value_traits());

      Requires: Dereferencing iterator must yield an lvalue of type value_type. cmp must be a comparison function that induces a strict weak ordering.

      Effects: Constructs an empty container and inserts elements from [b, e).

      @@ -212,15 +212,15 @@

      Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor/operator() of the key_compare object throws. Basic guarantee.

    3. -
      sg_set(sg_set && x);
      +
      sg_set(sg_set && x);

      Effects: to-do

    4. -
      sg_set & operator=(sg_set && x);
      +
      sg_set & operator=(sg_set && x);

      Effects: to-do

    5. -
      ~sg_set();
      +
      ~sg_set();

      Effects: Detaches all elements from this. The objects in the set are not deleted (i.e. no destructors are called), but the nodes according to the value_traits template parameter are reinitialized and thus can be reused.

      Complexity: Linear to elements contained in *this.

      Throws: Nothing.

      @@ -228,114 +228,114 @@
    -

    -sg_set public member functions

    +

    +sg_set public member functions

    1. -
      iterator begin();
      +
      iterator begin();

      Effects: Returns an iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    2. -
      const_iterator begin() const;
      +
      const_iterator begin() const;

      Effects: Returns a const_iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    3. -
      const_iterator cbegin() const;
      +
      const_iterator cbegin() const;

      Effects: Returns a const_iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    4. -
      iterator end();
      +
      iterator end();

      Effects: Returns an iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    5. -
      const_iterator end() const;
      +
      const_iterator end() const;

      Effects: Returns a const_iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    6. -
      const_iterator cend() const;
      +
      const_iterator cend() const;

      Effects: Returns a const_iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    7. -
      reverse_iterator rbegin();
      +
      reverse_iterator rbegin();

      Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    8. -
      const_reverse_iterator rbegin() const;
      +
      const_reverse_iterator rbegin() const;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    9. -
      const_reverse_iterator crbegin() const;
      +
      const_reverse_iterator crbegin() const;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    10. -
      reverse_iterator rend();
      +
      reverse_iterator rend();

      Effects: Returns a reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    11. -
      const_reverse_iterator rend() const;
      +
      const_reverse_iterator rend() const;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    12. -
      const_reverse_iterator crend() const;
      +
      const_reverse_iterator crend() const;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    13. -
      key_compare key_comp() const;
      +
      key_compare key_comp() const;

      Effects: Returns the key_compare object used by the container.

      Complexity: Constant.

      Throws: If key_compare copy-constructor throws.

    14. -
      value_compare value_comp() const;
      +
      value_compare value_comp() const;

      Effects: Returns the value_compare object used by the container.

      Complexity: Constant.

      Throws: If value_compare copy-constructor throws.

    15. -
      bool empty() const;
      +
      bool empty() const;

      Effects: Returns true if the container is empty.

      Complexity: Constant.

      Throws: Nothing.

    16. -
      size_type size() const;
      +
      size_type size() const;

      Effects: Returns the number of elements stored in the container.

      Complexity: Linear to elements contained in *this if constant-time size option is disabled. Constant time otherwise.

      Throws: Nothing.

    17. -
      void swap(sg_set & other);
      +
      void swap(sg_set & other);

      Effects: Swaps the contents of two containers.

      Complexity: Constant.

      Throws: If the comparison functor's swap call throws. 

    18. template<typename Cloner, typename Disposer> 
-  void clone_from(const sg_set & src, Cloner cloner, Disposer disposer);
      + void clone_from(const sg_set & src, Cloner cloner, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

      Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(const_reference ) and inserts them on *this. Copies the predicate from the source container.

      If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

      @@ -344,7 +344,7 @@ 
    19. template<typename Cloner, typename Disposer> 
-  void clone_from(sg_set && src, Cloner cloner, Disposer disposer);
      + void clone_from(sg_set && src, Cloner cloner, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

      Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(reference) and inserts them on *this. Copies the predicate from the source container.

      If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

      @@ -353,7 +353,7 @@

      Note: This version can modify the source container, useful to implement move semantics. Additional notes: it also copies the alpha factor from the source container.

    20. -
      std::pair< iterator, bool > insert(reference value);
      +
      std::pair< iterator, bool > insert(reference value);

      Requires: value must be an lvalue

      Effects: Inserts value into the container if the value is not already present.

      Complexity: Average complexity for insert element is at most logarithmic.

      @@ -361,7 +361,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    21. -
      iterator insert(const_iterator hint, reference value);
      +
      iterator insert(const_iterator hint, reference value);

      Requires: value must be an lvalue, and "hint" must be a valid iterator

      Effects: Tries to insert x into the container, using "hint" as a hint to where it will be inserted.

      Complexity: Logarithmic in general, but it is amortized constant time (two comparisons in the worst case) if t is inserted immediately before hint.

      @@ -371,7 +371,7 @@ 
    22. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, bool > 
-  insert_check(const KeyType & key, KeyTypeKeyCompare comp, 
+  insert_check(const KeyType & key, KeyTypeKeyCompare comp, 
                insert_commit_data & commit_data);

      Requires: comp must be a comparison function that induces the same strict weak ordering as key_compare. The difference is that comp compares an arbitrary key with the contained values.

      Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself.

      @@ -385,7 +385,7 @@ 
    23. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, bool > 
-  insert_check(const_iterator hint, const KeyType & key, 
+  insert_check(const_iterator hint, const KeyType & key, 
                KeyTypeKeyCompare comp, insert_commit_data & commit_data);

      Requires: comp must be a comparison function that induces the same strict weak ordering as key_compare. The difference is that comp compares an arbitrary key with the contained values.

      Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself, using "hint" as a hint to where it will be inserted.

      @@ -397,7 +397,7 @@

      "commit_data" remains valid for a subsequent "insert_commit" only if no more objects are inserted or erased from the container.

    24. -
      template<typename Iterator> void insert(Iterator b, Iterator e);
      +
      template<typename Iterator> void insert(Iterator b, Iterator e);

      Requires: Dereferencing iterator must yield an lvalue of type value_type.

      Effects: Tries to insert each element of a range into the container.

      Complexity: Insert range is in general O(N * log(N)), where N is the size of the range. However, it is linear in N if the range is already sorted by value_comp().

      @@ -405,7 +405,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    25. -
      iterator insert_commit(reference value, 
+
      iterator insert_commit(reference value, 
                        const insert_commit_data & commit_data);
      
 
      Requires: value must be an lvalue of type value_type. commit_data must have been obtained from a previous call to "insert_check". No objects should have been inserted or erased from the container between the "insert_check" that filled "commit_data" and the call to "insert_commit".
      
 
      Effects: Inserts the value in the container using the information obtained from the "commit_data" that a previous "insert_check" filled.
      
@@ -415,7 +415,7 @@
 
      Notes: This function has only sense if a "insert_check" has been previously executed to fill "commit_data". No value should be inserted or erased between the "insert_check" and "insert_commit" calls.
    26. -
      iterator insert_before(const_iterator pos, reference value);
      +
      iterator insert_before(const_iterator pos, reference value);

      Requires: value must be an lvalue, "pos" must be a valid iterator (or end) and must be the succesor of value once inserted according to the predicate

      Effects: Inserts x into the container before "pos".

      Complexity: Constant time.

      @@ -423,7 +423,7 @@

      Note: This function does not check preconditions so if "pos" is not the successor of "value" container ordering invariant will be broken. This is a low-level function to be used only for performance reasons by advanced users.

    27. -
      void push_back(reference value);
      +
      void push_back(reference value);

      Requires: value must be an lvalue, and it must be no less than the greatest inserted key

      Effects: Inserts x into the container in the last position.

      Complexity: Constant time.

      @@ -431,7 +431,7 @@

      Note: This function does not check preconditions so if value is less than the greatest inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

    28. -
      void push_front(reference value);
      +
      void push_front(reference value);

      Requires: value must be an lvalue, and it must be no greater than the minimum inserted key

      Effects: Inserts x into the container in the first position.

      Complexity: Constant time.

      @@ -439,21 +439,21 @@

      Note: This function does not check preconditions so if value is greater than the minimum inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

    29. -
      iterator erase(const_iterator i);
      +
      iterator erase(const_iterator i);

      Effects: Erases the element pointed to by i.

      Complexity: Average complexity for erase element is constant time.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    30. -
      iterator erase(const_iterator b, const_iterator e);
      +
      iterator erase(const_iterator b, const_iterator e);

      Effects: Erases the range pointed to by b end e.

      Complexity: Average complexity for erase range is at most O(log(size() + N)), where N is the number of elements in the range.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    31. -
      size_type erase(const key_type & key);
      +
      size_type erase(const key_type & key);

      Effects: Erases all the elements with the given value.

      Returns: The number of erased elements.

      Complexity: O(log(size() + N).

      @@ -462,7 +462,8 @@ 
    32. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type erase(const KeyType & key, KeyTypeKeyCompare comp);
      + size_type erase(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Erases all the elements with the given key. according to the comparison functor "comp".

      Returns: The number of erased elements.

      Complexity: O(log(size() + N).

      @@ -471,7 +472,7 @@ 
    33. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator i, Disposer disposer);
      + iterator erase_and_dispose(const_iterator i, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases the element pointed to by i. Disposer::operator()(pointer) is called for the removed element.

      Complexity: Average complexity for erase element is constant time.

      @@ -480,7 +481,7 @@ 
    34. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator b, const_iterator e, 
+  iterator erase_and_dispose(const_iterator b, const_iterator e, 
                              Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases the range pointed to by b end e. Disposer::operator()(pointer) is called for the removed elements.

      @@ -490,7 +491,7 @@ 
    35. template<typename Disposer> 
-  size_type erase_and_dispose(const key_type & key, Disposer disposer);
      + size_type erase_and_dispose(const key_type & key, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases all the elements with the given value. Disposer::operator()(pointer) is called for the removed elements.

      Returns: The number of erased elements.

      @@ -500,8 +501,9 @@ 
    36. template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> 
-  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
+  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
                               Disposer disposer);
      +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk) and nk the key_type of a value_type inserted into *this.

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases all the elements with the given key. according to the comparison functor "comp". Disposer::operator()(pointer) is called for the removed elements.

      Returns: The number of erased elements.

      @@ -510,46 +512,47 @@

      Note: Invalidates the iterators to the erased elements.

    37. -
      void clear();
      +
      void clear();

      Effects: Erases all of the elements.

      Complexity: Linear to the number of elements on the container. if it's a safe-mode or auto-unlink value_type. Constant time otherwise.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    38. -
      template<typename Disposer> void clear_and_dispose(Disposer disposer);
      +
      template<typename Disposer> void clear_and_dispose(Disposer disposer);

      Effects: Erases all of the elements calling disposer(p) for each node to be erased. Complexity: Average complexity for is at most O(log(size() + N)), where N is the number of elements in the container.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. Calls N times to disposer functor.

    39. -
      size_type count(const key_type & key) const;
      +
      size_type count(const key_type & key) const;

      Effects: Returns the number of contained elements with the given value

      Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given value.

      Throws: If key_compare throws. 

    40. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;
      + size_type count(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      Effects: Returns the number of contained elements with the given key

      Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given key.

      Throws: If comp throws.

    41. -
      iterator lower_bound(const key_type & key);
      +
      iterator lower_bound(const key_type & key);

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    42. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      -

      Throws: If comp throws.

      +

      Throws: If key_compare throws.

    43. -
      const_iterator lower_bound(const key_type & key) const;
      +
      const_iterator lower_bound(const key_type & key) const;

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -557,26 +560,27 @@ 
    44. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
      -

      Effects: Returns a const iterator to the first element whose key is not less than k or end() if that element does not exist.

      + lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      -

      Throws: If comp throws.

      +

      Throws: If key_compare throws.

    45. -
      iterator upper_bound(const key_type & key);
      +
      iterator upper_bound(const key_type & key);

      Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    46. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    47. -
      const_iterator upper_bound(const key_type & key) const;
      +
      const_iterator upper_bound(const key_type & key) const;

      Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -584,39 +588,42 @@ 
    48. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
      + upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    49. -
      iterator find(const key_type & key);
      +
      iterator find(const key_type & key);

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    50. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator find(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator find(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    51. -
      const_iterator find(const key_type & key) const;
      -

      Effects: Finds a const_iterator to the first element whose key is k or end() if that element does not exist.

      +
      const_iterator find(const key_type & key) const;
      +

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    52. template<typename KeyType, typename KeyTypeKeyCompare> 
-  const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;
      -

      Effects: Finds a const_iterator to the first element whose key is k or end() if that element does not exist.

      + const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      +

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    53. -
      std::pair< iterator, iterator > equal_range(const key_type & key);
      +
      std::pair< iterator, iterator > equal_range(const key_type & key);

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -624,14 +631,15 @@ 
    54. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp);
      + equal_range(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If comp throws. 

    55. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & key) const;
      +equal_range(const key_type & key) const;

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -639,16 +647,18 @@ 
    56. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;
      + equal_range(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If comp throws. 

    57. std::pair< iterator, iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed);
      -

      Requires: 'lower_key' must not be greater than 'upper_key'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key) if left_closed, upper_bound(lower_key) otherwise

      second = upper_bound(upper_key) if right_closed, lower_bound(upper_key) otherwise

      @@ -660,9 +670,12 @@ 
    58. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed);
      -

      Requires: KeyTypeKeyCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the container. 'lower_key' must not be greater than 'upper_key' according to 'comp'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

      +

      upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

      +

      upper_key shall not precede lower_key according to comp [comp(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!comp(upper_key, lower_key) && !comp(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key, comp) if left_closed, upper_bound(lower_key, comp) otherwise

      second = upper_bound(upper_key, comp) if right_closed, lower_bound(upper_key, comp) otherwise

      @@ -673,9 +686,10 @@ 
    59. std::pair< const_iterator, const_iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed) const;
      -

      Requires: 'lower_key' must not be greater than 'upper_key'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key) if left_closed, upper_bound(lower_key) otherwise

      second = upper_bound(upper_key) if right_closed, lower_bound(upper_key) otherwise

      @@ -687,9 +701,12 @@ 
    60. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed) const;
      -

      Requires: KeyTypeKeyCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the container. 'lower_key' must not be greater than 'upper_key' according to 'comp'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

      +

      upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

      +

      upper_key shall not precede lower_key according to comp [comp(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!comp(upper_key, lower_key) && !comp(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key, comp) if left_closed, upper_bound(lower_key, comp) otherwise

      second = upper_bound(upper_key, comp) if right_closed, lower_bound(upper_key, comp) otherwise

      @@ -699,28 +716,28 @@

      Note: Experimental function, the interface might change in future releases.

    61. -
      iterator iterator_to(reference value);
      +
      iterator iterator_to(reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      Throws: Nothing.

    62. -
      const_iterator iterator_to(const_reference value) const;
      +
      const_iterator iterator_to(const_reference value) const;

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid const_iterator i belonging to the set that points to the value

      Complexity: Constant.

      Throws: Nothing.

    63. -
      pointer unlink_leftmost_without_rebalance();
      +
      pointer unlink_leftmost_without_rebalance();

      Effects: Unlinks the leftmost node from the container.

      Complexity: Average complexity is constant time.

      Throws: Nothing.

      Notes: This function breaks the container and the container can only be used for more unlink_leftmost_without_rebalance calls. This function is normally used to achieve a step by step controlled destruction of the container.

    64. -
      void replace_node(iterator replace_this, reference with_this);
      +
      void replace_node(iterator replace_this, reference with_this);

      Requires: replace_this must be a valid iterator of *this and with_this must not be inserted in any container.

      Effects: Replaces replace_this in its position in the container with with_this. The container does not need to be rebalanced.

      Complexity: Constant.

      @@ -728,7 +745,7 @@

      Note: This function will break container ordering invariants if with_this is not equivalent to *replace_this according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing or comparison is needed.

    65. -
      void remove_node(reference value);
      +
      void remove_node(reference value);

      Effects: removes "value" from the container.

      Throws: Nothing.

      Complexity: Logarithmic time.

      @@ -736,13 +753,13 @@

      If the user calls this function with a constant time size container or stateful comparison functor a compilation error will be issued.

    66. -
      void rebalance();
      +
      void rebalance();

      Effects: Rebalances the tree.

      Throws: Nothing.

      Complexity: Linear.

    67. -
      iterator rebalance_subtree(iterator root);
      +
      iterator rebalance_subtree(iterator root);

      Requires: old_root is a node of a tree.

      Effects: Rebalances the subtree rooted at old_root.

      Returns: The new root of the subtree.

      @@ -750,13 +767,13 @@

      Complexity: Linear to the elements in the subtree.

    68. -
      float balance_factor() const;
      +
      float balance_factor() const;

      Returns: The balance factor (alpha) used in this tree

      Throws: Nothing.

      Complexity: Constant.

    69. -
      void balance_factor(float new_alpha);
      +
      void balance_factor(float new_alpha);

      Requires: new_alpha must be a value between 0.5 and 1.0

      Effects: Establishes a new balance factor (alpha) and rebalances the tree if the new balance factor is stricter (less) than the old factor.

      Throws: Nothing.

      @@ -765,39 +782,39 @@
    -

    -sg_set public static functions

    +

    +sg_set public static functions

    1. -
      static sg_set & container_from_end_iterator(iterator end_iterator);
      +
      static sg_set & container_from_end_iterator(iterator end_iterator);

      Precondition: end_iterator must be a valid end iterator of the container.

      Effects: Returns a const reference to the container associated to the end iterator

      Throws: Nothing.

      Complexity: Constant.

    2. -
      static const sg_set & container_from_end_iterator(const_iterator end_iterator);
      +
      static const sg_set & container_from_end_iterator(const_iterator end_iterator);

      Precondition: end_iterator must be a valid end iterator of the container.

      Effects: Returns a const reference to the container associated to the end iterator

      Throws: Nothing.

      Complexity: Constant.

    3. -
      static sg_set & container_from_iterator(iterator it);
      +
      static sg_set & container_from_iterator(iterator it);

      Precondition: it must be a valid iterator of the container.

      Effects: Returns a const reference to the container associated to the iterator

      Throws: Nothing.

      Complexity: Logarithmic.

    4. -
      static const sg_set & container_from_iterator(const_iterator it);
      +
      static const sg_set & container_from_iterator(const_iterator it);

      Precondition: it must be a valid iterator of the container.

      Effects: Returns a const reference to the container associated to the iterator

      Throws: Nothing.

      Complexity: Logarithmic.

    5. -
      static iterator s_iterator_to(reference value);
      +
      static iterator s_iterator_to(reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      @@ -805,7 +822,7 @@

      Note: This static function is available only if the value traits is stateless.

    6. -
      static const_iterator s_iterator_to(const_reference value);
      +
      static const_iterator s_iterator_to(const_reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      @@ -813,7 +830,7 @@

      Note: This static function is available only if the value traits is stateless.

    7. -
      static void init_node(reference value);
      +
      static void init_node(reference value);

      Requires: value shall not be in a container.

      Effects: init_node puts the hook of a value in a well-known default state.

      Throws: Nothing.

      diff --git a/doc/html/boost/intrusive/sgtree.html b/doc/html/boost/intrusive/sgtree.html index 500c4bb2bd..005b109f03 100644 --- a/doc/html/boost/intrusive/sgtree.html +++ b/doc/html/boost/intrusive/sgtree.html @@ -60,130 +60,130 @@ typedef implementation_defined insert_commit_data; // construct/copy/destruct - explicit sgtree(const key_compare & = key_compare(), + explicit sgtree(const key_compare & = key_compare(), const value_traits & = value_traits()); template<typename Iterator> - sgtree(bool, Iterator, Iterator, const key_compare & = key_compare(), + sgtree(bool, Iterator, Iterator, const key_compare & = key_compare(), const value_traits & = value_traits()); - sgtree(sgtree &&); - sgtree & operator=(sgtree &&); - ~sgtree(); + sgtree(sgtree &&); + sgtree & operator=(sgtree &&); + ~sgtree(); - // public member functions - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end(); - const_iterator end() const; - const_iterator cend() const; - reverse_iterator rbegin(); - const_reverse_iterator rbegin() const; - const_reverse_iterator crbegin() const; - reverse_iterator rend(); - const_reverse_iterator rend() const; - const_reverse_iterator crend() const; - key_compare key_comp() const; - value_compare value_comp() const; - bool empty() const; - size_type size() const; - void swap(sgtree &); + // public member functions + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end(); + const_iterator end() const; + const_iterator cend() const; + reverse_iterator rbegin(); + const_reverse_iterator rbegin() const; + const_reverse_iterator crbegin() const; + reverse_iterator rend(); + const_reverse_iterator rend() const; + const_reverse_iterator crend() const; + key_compare key_comp() const; + value_compare value_comp() const; + bool empty() const; + size_type size() const; + void swap(sgtree &); template<typename Cloner, typename Disposer> - void clone_from(const sgtree &, Cloner, Disposer); + void clone_from(const sgtree &, Cloner, Disposer); template<typename Cloner, typename Disposer> - void clone_from(sgtree &&, Cloner, Disposer); - iterator insert_equal(reference); - iterator insert_equal(const_iterator, reference); - template<typename Iterator> void insert_equal(Iterator, Iterator); - std::pair< iterator, bool > insert_unique(reference); - iterator insert_unique(const_iterator, reference); + void clone_from(sgtree &&, Cloner, Disposer); + iterator insert_equal(reference); + iterator insert_equal(const_iterator, reference); + template<typename Iterator> void insert_equal(Iterator, Iterator); + std::pair< iterator, bool > insert_unique(reference); + iterator insert_unique(const_iterator, reference); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, bool > - insert_unique_check(const KeyType &, KeyTypeKeyCompare, + insert_unique_check(const KeyType &, KeyTypeKeyCompare, insert_commit_data &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, bool > - insert_unique_check(const_iterator, const KeyType &, KeyTypeKeyCompare, + insert_unique_check(const_iterator, const KeyType &, KeyTypeKeyCompare, insert_commit_data &); - iterator insert_unique_commit(reference, const insert_commit_data &); - template<typename Iterator> void insert_unique(Iterator, Iterator); - iterator insert_before(const_iterator, reference); - void push_back(reference); - void push_front(reference); - iterator erase(const_iterator); - iterator erase(const_iterator, const_iterator); - size_type erase(const key_type &); + iterator insert_unique_commit(reference, const insert_commit_data &); + template<typename Iterator> void insert_unique(Iterator, Iterator); + iterator insert_before(const_iterator, reference); + void push_back(reference); + void push_front(reference); + iterator erase(const_iterator); + iterator erase(const_iterator, const_iterator); + size_type erase(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - size_type erase(const KeyType &, KeyTypeKeyCompare); + size_type erase(const KeyType &, KeyTypeKeyCompare); template<typename Disposer> - iterator erase_and_dispose(const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, Disposer); template<typename Disposer> - iterator erase_and_dispose(const_iterator, const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, const_iterator, Disposer); template<typename Disposer> - size_type erase_and_dispose(const key_type &, Disposer); + size_type erase_and_dispose(const key_type &, Disposer); template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> - size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); - void clear(); - template<typename Disposer> void clear_and_dispose(Disposer); - size_type count(const key_type &) const; + size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); + void clear(); + template<typename Disposer> void clear_and_dispose(Disposer); + size_type count(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - size_type count(const KeyType &, KeyTypeKeyCompare) const; - iterator lower_bound(const key_type &); + size_type count(const KeyType &, KeyTypeKeyCompare) const; + iterator lower_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator lower_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator lower_bound(const key_type &) const; + iterator lower_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator lower_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator upper_bound(const key_type &); + const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator upper_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator upper_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator upper_bound(const key_type &) const; + iterator upper_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator upper_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator find(const key_type &); + const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator find(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator find(const KeyType &, KeyTypeKeyCompare); - const_iterator find(const key_type &) const; + iterator find(const KeyType &, KeyTypeKeyCompare); + const_iterator find(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator find(const KeyType &, KeyTypeKeyCompare) const; - std::pair< iterator, iterator > equal_range(const key_type &); + const_iterator find(const KeyType &, KeyTypeKeyCompare) const; + std::pair< iterator, iterator > equal_range(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - equal_range(const KeyType &, KeyTypeKeyCompare); + equal_range(const KeyType &, KeyTypeKeyCompare); std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; + equal_range(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - equal_range(const KeyType &, KeyTypeKeyCompare) const; + equal_range(const KeyType &, KeyTypeKeyCompare) const; std::pair< iterator, iterator > - bounded_range(const key_type &, const key_type &, bool, bool); + bounded_range(const key_type &, const key_type &, bool, bool); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool); std::pair< const_iterator, const_iterator > - bounded_range(const key_type &, const key_type &, bool, bool) const; + bounded_range(const key_type &, const key_type &, bool, bool) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool) const; - iterator iterator_to(reference); - const_iterator iterator_to(const_reference) const; - pointer unlink_leftmost_without_rebalance(); - void replace_node(iterator, reference); - void remove_node(reference); - void rebalance(); - iterator rebalance_subtree(iterator); - float balance_factor() const; - void balance_factor(float); + iterator iterator_to(reference); + const_iterator iterator_to(const_reference) const; + pointer unlink_leftmost_without_rebalance(); + void replace_node(iterator, reference); + void remove_node(reference); + void rebalance(); + iterator rebalance_subtree(iterator); + float balance_factor() const; + void balance_factor(float); - // public static functions - static sgtree & container_from_end_iterator(iterator); - static const sgtree & container_from_end_iterator(const_iterator); - static sgtree & container_from_iterator(iterator); - static const sgtree & container_from_iterator(const_iterator); - static iterator s_iterator_to(reference); - static const_iterator s_iterator_to(const_reference); - static void init_node(reference); + // public static functions + static sgtree & container_from_end_iterator(iterator); + static const sgtree & container_from_end_iterator(const_iterator); + static sgtree & container_from_iterator(iterator); + static const sgtree & container_from_iterator(const_iterator); + static iterator s_iterator_to(reference); + static const_iterator s_iterator_to(const_reference); + static void init_node(reference); // public data members static const bool constant_time_size; @@ -191,18 +191,18 @@ static const bool stateful_value_traits; };
    -

    Description

    +

    Description

    The class template sgtree is an intrusive scapegoat tree container, that is used to construct intrusive sg_set and sg_multiset containers. The no-throw guarantee holds only, if the value_compare object doesn't throw.

    The template parameter T is the type to be managed by the container. The user can specify additional options and if no options are provided default options are used.

    The container supports the following options: base_hook<>/member_hook<>/value_traits<>, floating_point<>, size_type<> and compare<>.

    -

    +

    sgtree public construct/copy/destruct

    1. -
      explicit sgtree(const key_compare & cmp = key_compare(), 
+
      explicit sgtree(const key_compare & cmp = key_compare(), 
                 const value_traits & v_traits = value_traits());
      
 
      Effects: Constructs an empty container.
      
 
      Complexity: Constant.
      
@@ -210,7 +210,7 @@
 
    2. template<typename Iterator> 
-  sgtree(bool unique, Iterator b, Iterator e, 
+  sgtree(bool unique, Iterator b, Iterator e, 
          const key_compare & cmp = key_compare(), 
          const value_traits & v_traits = value_traits());

      Requires: Dereferencing iterator must yield an lvalue of type value_type. cmp must be a comparison function that induces a strict weak ordering.

      @@ -219,15 +219,15 @@

      Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor/operator() of the key_compare object throws. Basic guarantee.

    3. -
      sgtree(sgtree && x);
      +
      sgtree(sgtree && x);

      Effects: to-do

    4. -
      sgtree & operator=(sgtree && x);
      +
      sgtree & operator=(sgtree && x);

      Effects: to-do

    5. -
      ~sgtree();
      +
      ~sgtree();

      Effects: Detaches all elements from this. The objects in the set are not deleted (i.e. no destructors are called), but the nodes according to the value_traits template parameter are reinitialized and thus can be reused.

      Complexity: Linear to elements contained in *this.

      Throws: Nothing.

      @@ -235,114 +235,114 @@
    -

    -sgtree public member functions

    +

    +sgtree public member functions

    1. -
      iterator begin();
      +
      iterator begin();

      Effects: Returns an iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    2. -
      const_iterator begin() const;
      +
      const_iterator begin() const;

      Effects: Returns a const_iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    3. -
      const_iterator cbegin() const;
      +
      const_iterator cbegin() const;

      Effects: Returns a const_iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    4. -
      iterator end();
      +
      iterator end();

      Effects: Returns an iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    5. -
      const_iterator end() const;
      +
      const_iterator end() const;

      Effects: Returns a const_iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    6. -
      const_iterator cend() const;
      +
      const_iterator cend() const;

      Effects: Returns a const_iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    7. -
      reverse_iterator rbegin();
      +
      reverse_iterator rbegin();

      Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    8. -
      const_reverse_iterator rbegin() const;
      +
      const_reverse_iterator rbegin() const;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    9. -
      const_reverse_iterator crbegin() const;
      +
      const_reverse_iterator crbegin() const;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    10. -
      reverse_iterator rend();
      +
      reverse_iterator rend();

      Effects: Returns a reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    11. -
      const_reverse_iterator rend() const;
      +
      const_reverse_iterator rend() const;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    12. -
      const_reverse_iterator crend() const;
      +
      const_reverse_iterator crend() const;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    13. -
      key_compare key_comp() const;
      +
      key_compare key_comp() const;

      Effects: Returns the key_compare object used by the container.

      Complexity: Constant.

      Throws: If key_compare copy-constructor throws.

    14. -
      value_compare value_comp() const;
      +
      value_compare value_comp() const;

      Effects: Returns the value_compare object used by the container.

      Complexity: Constant.

      Throws: If value_compare copy-constructor throws.

    15. -
      bool empty() const;
      +
      bool empty() const;

      Effects: Returns true if the container is empty.

      Complexity: Constant.

      Throws: Nothing.

    16. -
      size_type size() const;
      +
      size_type size() const;

      Effects: Returns the number of elements stored in the container.

      Complexity: Linear to elements contained in *this if constant-time size option is disabled. Constant time otherwise.

      Throws: Nothing.

    17. -
      void swap(sgtree & other);
      +
      void swap(sgtree & other);

      Effects: Swaps the contents of two containers.

      Complexity: Constant.

      Throws: If the comparison functor's swap call throws. 

    18. template<typename Cloner, typename Disposer> 
-  void clone_from(const sgtree & src, Cloner cloner, Disposer disposer);
      + void clone_from(const sgtree & src, Cloner cloner, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

      Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(const_reference ) and inserts them on *this. Copies the predicate from the source container.

      If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

      @@ -351,7 +351,7 @@ 
    19. template<typename Cloner, typename Disposer> 
-  void clone_from(sgtree && src, Cloner cloner, Disposer disposer);
      + void clone_from(sgtree && src, Cloner cloner, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

      Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(reference) and inserts them on *this. Copies the predicate from the source container.

      If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

      @@ -360,7 +360,7 @@

      Note: This version can modify the source container, useful to implement move semantics. Additional notes: it also copies the alpha factor from the source container.

    20. -
      iterator insert_equal(reference value);
      +
      iterator insert_equal(reference value);

      Requires: value must be an lvalue

      Effects: Inserts value into the container before the upper bound.

      Complexity: Average complexity for insert element is at most logarithmic.

      @@ -368,7 +368,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    21. -
      iterator insert_equal(const_iterator hint, reference value);
      +
      iterator insert_equal(const_iterator hint, reference value);

      Requires: value must be an lvalue, and "hint" must be a valid iterator.

      Effects: Inserts x into the container, using "hint" as a hint to where it will be inserted. If "hint" is the upper_bound the insertion takes constant time (two comparisons in the worst case)

      Complexity: Logarithmic in general, but it is amortized constant time if t is inserted immediately before hint.

      @@ -376,7 +376,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    22. -
      template<typename Iterator> void insert_equal(Iterator b, Iterator e);
      +
      template<typename Iterator> void insert_equal(Iterator b, Iterator e);

      Requires: Dereferencing iterator must yield an lvalue of type value_type.

      Effects: Inserts a each element of a range into the container before the upper bound of the key of each element.

      Complexity: Insert range is in general O(N * log(N)), where N is the size of the range. However, it is linear in N if the range is already sorted by value_comp().

      @@ -384,7 +384,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    23. -
      std::pair< iterator, bool > insert_unique(reference value);
      +
      std::pair< iterator, bool > insert_unique(reference value);

      Requires: value must be an lvalue

      Effects: Inserts value into the container if the value is not already present.

      Complexity: Average complexity for insert element is at most logarithmic.

      @@ -392,7 +392,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    24. -
      iterator insert_unique(const_iterator hint, reference value);
      +
      iterator insert_unique(const_iterator hint, reference value);

      Requires: value must be an lvalue, and "hint" must be a valid iterator

      Effects: Tries to insert x into the container, using "hint" as a hint to where it will be inserted.

      Complexity: Logarithmic in general, but it is amortized constant time (two comparisons in the worst case) if t is inserted immediately before hint.

      @@ -402,7 +402,7 @@ 
    25. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, bool > 
-  insert_unique_check(const KeyType & key, KeyTypeKeyCompare comp, 
+  insert_unique_check(const KeyType & key, KeyTypeKeyCompare comp, 
                       insert_commit_data & commit_data);

      Requires: comp must be a comparison function that induces the same strict weak ordering as key_compare. The difference is that comp compares an arbitrary key with the contained values.

      Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself.

      @@ -416,7 +416,7 @@ 
    26. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, bool > 
-  insert_unique_check(const_iterator hint, const KeyType & key, 
+  insert_unique_check(const_iterator hint, const KeyType & key, 
                       KeyTypeKeyCompare comp, 
                       insert_commit_data & commit_data);

      Requires: comp must be a comparison function that induces the same strict weak ordering as key_compare. The difference is that comp compares an arbitrary key with the contained values.

      @@ -429,7 +429,7 @@

      "commit_data" remains valid for a subsequent "insert_commit" only if no more objects are inserted or erased from the container.

    27. -
      iterator insert_unique_commit(reference value, 
+
      iterator insert_unique_commit(reference value, 
                               const insert_commit_data & commit_data);
      
 
      Requires: value must be an lvalue of type value_type. commit_data must have been obtained from a previous call to "insert_check". No objects should have been inserted or erased from the container between the "insert_check" that filled "commit_data" and the call to "insert_commit".
      
 
      Effects: Inserts the value in the container using the information obtained from the "commit_data" that a previous "insert_check" filled.
      
@@ -439,7 +439,7 @@
 
      Notes: This function has only sense if a "insert_check" has been previously executed to fill "commit_data". No value should be inserted or erased between the "insert_check" and "insert_commit" calls.
    28. -
      template<typename Iterator> void insert_unique(Iterator b, Iterator e);
      +
      template<typename Iterator> void insert_unique(Iterator b, Iterator e);

      Requires: Dereferencing iterator must yield an lvalue of type value_type.

      Effects: Tries to insert each element of a range into the container.

      Complexity: Insert range is in general O(N * log(N)), where N is the size of the range. However, it is linear in N if the range is already sorted by value_comp().

      @@ -447,7 +447,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    29. -
      iterator insert_before(const_iterator pos, reference value);
      +
      iterator insert_before(const_iterator pos, reference value);

      Requires: value must be an lvalue, "pos" must be a valid iterator (or end) and must be the succesor of value once inserted according to the predicate

      Effects: Inserts x into the container before "pos".

      Complexity: Constant time.

      @@ -455,7 +455,7 @@

      Note: This function does not check preconditions so if "pos" is not the successor of "value" container ordering invariant will be broken. This is a low-level function to be used only for performance reasons by advanced users.

    30. -
      void push_back(reference value);
      +
      void push_back(reference value);

      Requires: value must be an lvalue, and it must be no less than the greatest inserted key

      Effects: Inserts x into the container in the last position.

      Complexity: Constant time.

      @@ -463,7 +463,7 @@

      Note: This function does not check preconditions so if value is less than the greatest inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

    31. -
      void push_front(reference value);
      +
      void push_front(reference value);

      Requires: value must be an lvalue, and it must be no greater than the minimum inserted key

      Effects: Inserts x into the container in the first position.

      Complexity: Constant time.

      @@ -471,21 +471,21 @@

      Note: This function does not check preconditions so if value is greater than the minimum inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

    32. -
      iterator erase(const_iterator i);
      +
      iterator erase(const_iterator i);

      Effects: Erases the element pointed to by i.

      Complexity: Average complexity for erase element is constant time.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    33. -
      iterator erase(const_iterator b, const_iterator e);
      +
      iterator erase(const_iterator b, const_iterator e);

      Effects: Erases the range pointed to by b end e.

      Complexity: Average complexity for erase range is at most O(log(size() + N)), where N is the number of elements in the range.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    34. -
      size_type erase(const key_type & key);
      +
      size_type erase(const key_type & key);

      Effects: Erases all the elements with the given value.

      Returns: The number of erased elements.

      Complexity: O(log(size() + N).

      @@ -494,7 +494,8 @@ 
    35. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type erase(const KeyType & key, KeyTypeKeyCompare comp);
      + size_type erase(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Erases all the elements with the given key. according to the comparison functor "comp".

      Returns: The number of erased elements.

      Complexity: O(log(size() + N).

      @@ -503,7 +504,7 @@ 
    36. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator i, Disposer disposer);
      + iterator erase_and_dispose(const_iterator i, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases the element pointed to by i. Disposer::operator()(pointer) is called for the removed element.

      Complexity: Average complexity for erase element is constant time.

      @@ -512,7 +513,7 @@ 
    37. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator b, const_iterator e, 
+  iterator erase_and_dispose(const_iterator b, const_iterator e, 
                              Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases the range pointed to by b end e. Disposer::operator()(pointer) is called for the removed elements.

      @@ -522,7 +523,7 @@ 
    38. template<typename Disposer> 
-  size_type erase_and_dispose(const key_type & key, Disposer disposer);
      + size_type erase_and_dispose(const key_type & key, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases all the elements with the given value. Disposer::operator()(pointer) is called for the removed elements.

      Returns: The number of erased elements.

      @@ -532,8 +533,9 @@ 
    39. template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> 
-  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
+  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
                               Disposer disposer);
      +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk) and nk the key_type of a value_type inserted into *this.

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases all the elements with the given key. according to the comparison functor "comp". Disposer::operator()(pointer) is called for the removed elements.

      Returns: The number of erased elements.

      @@ -542,46 +544,47 @@

      Note: Invalidates the iterators to the erased elements.

    40. -
      void clear();
      +
      void clear();

      Effects: Erases all of the elements.

      Complexity: Linear to the number of elements on the container. if it's a safe-mode or auto-unlink value_type. Constant time otherwise.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    41. -
      template<typename Disposer> void clear_and_dispose(Disposer disposer);
      +
      template<typename Disposer> void clear_and_dispose(Disposer disposer);

      Effects: Erases all of the elements calling disposer(p) for each node to be erased. Complexity: Average complexity for is at most O(log(size() + N)), where N is the number of elements in the container.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. Calls N times to disposer functor.

    42. -
      size_type count(const key_type & key) const;
      +
      size_type count(const key_type & key) const;

      Effects: Returns the number of contained elements with the given value

      Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given value.

      Throws: If key_compare throws. 

    43. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;
      + size_type count(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      Effects: Returns the number of contained elements with the given key

      Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given key.

      Throws: If comp throws.

    44. -
      iterator lower_bound(const key_type & key);
      +
      iterator lower_bound(const key_type & key);

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    45. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      -

      Throws: If comp throws.

      +

      Throws: If key_compare throws.

    46. -
      const_iterator lower_bound(const key_type & key) const;
      +
      const_iterator lower_bound(const key_type & key) const;

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -589,26 +592,27 @@ 
    47. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
      -

      Effects: Returns a const iterator to the first element whose key is not less than k or end() if that element does not exist.

      + lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      -

      Throws: If comp throws.

      +

      Throws: If key_compare throws.

    48. -
      iterator upper_bound(const key_type & key);
      +
      iterator upper_bound(const key_type & key);

      Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    49. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    50. -
      const_iterator upper_bound(const key_type & key) const;
      +
      const_iterator upper_bound(const key_type & key) const;

      Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -616,39 +620,42 @@ 
    51. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
      + upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    52. -
      iterator find(const key_type & key);
      +
      iterator find(const key_type & key);

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    53. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator find(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator find(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    54. -
      const_iterator find(const key_type & key) const;
      -

      Effects: Finds a const_iterator to the first element whose key is k or end() if that element does not exist.

      +
      const_iterator find(const key_type & key) const;
      +

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    55. template<typename KeyType, typename KeyTypeKeyCompare> 
-  const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;
      -

      Effects: Finds a const_iterator to the first element whose key is k or end() if that element does not exist.

      + const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      +

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    56. -
      std::pair< iterator, iterator > equal_range(const key_type & key);
      +
      std::pair< iterator, iterator > equal_range(const key_type & key);

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -656,14 +663,15 @@ 
    57. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp);
      + equal_range(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If comp throws. 

    58. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & key) const;
      +equal_range(const key_type & key) const;

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -671,16 +679,18 @@ 
    59. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;
      + equal_range(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If comp throws. 

    60. std::pair< iterator, iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed);
      -

      Requires: 'lower_key' must not be greater than 'upper_key'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key) if left_closed, upper_bound(lower_key) otherwise

      second = upper_bound(upper_key) if right_closed, lower_bound(upper_key) otherwise

      @@ -692,9 +702,12 @@ 
    61. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed);
      -

      Requires: KeyTypeKeyCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the container. 'lower_key' must not be greater than 'upper_key' according to 'comp'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

      +

      upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

      +

      upper_key shall not precede lower_key according to comp [comp(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!comp(upper_key, lower_key) && !comp(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key, comp) if left_closed, upper_bound(lower_key, comp) otherwise

      second = upper_bound(upper_key, comp) if right_closed, lower_bound(upper_key, comp) otherwise

      @@ -705,9 +718,10 @@ 
    62. std::pair< const_iterator, const_iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed) const;
      -

      Requires: 'lower_key' must not be greater than 'upper_key'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key) if left_closed, upper_bound(lower_key) otherwise

      second = upper_bound(upper_key) if right_closed, lower_bound(upper_key) otherwise

      @@ -719,9 +733,12 @@ 
    63. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed) const;
      -

      Requires: KeyTypeKeyCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the container. 'lower_key' must not be greater than 'upper_key' according to 'comp'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

      +

      upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

      +

      upper_key shall not precede lower_key according to comp [comp(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!comp(upper_key, lower_key) && !comp(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key, comp) if left_closed, upper_bound(lower_key, comp) otherwise

      second = upper_bound(upper_key, comp) if right_closed, lower_bound(upper_key, comp) otherwise

      @@ -731,28 +748,28 @@

      Note: Experimental function, the interface might change in future releases.

    64. -
      iterator iterator_to(reference value);
      +
      iterator iterator_to(reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      Throws: Nothing.

    65. -
      const_iterator iterator_to(const_reference value) const;
      +
      const_iterator iterator_to(const_reference value) const;

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid const_iterator i belonging to the set that points to the value

      Complexity: Constant.

      Throws: Nothing.

    66. -
      pointer unlink_leftmost_without_rebalance();
      +
      pointer unlink_leftmost_without_rebalance();

      Effects: Unlinks the leftmost node from the container.

      Complexity: Average complexity is constant time.

      Throws: Nothing.

      Notes: This function breaks the container and the container can only be used for more unlink_leftmost_without_rebalance calls. This function is normally used to achieve a step by step controlled destruction of the container.

    67. -
      void replace_node(iterator replace_this, reference with_this);
      +
      void replace_node(iterator replace_this, reference with_this);

      Requires: replace_this must be a valid iterator of *this and with_this must not be inserted in any container.

      Effects: Replaces replace_this in its position in the container with with_this. The container does not need to be rebalanced.

      Complexity: Constant.

      @@ -760,7 +777,7 @@

      Note: This function will break container ordering invariants if with_this is not equivalent to *replace_this according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing or comparison is needed.

    68. -
      void remove_node(reference value);
      +
      void remove_node(reference value);

      Effects: removes "value" from the container.

      Throws: Nothing.

      Complexity: Logarithmic time.

      @@ -768,13 +785,13 @@

      If the user calls this function with a constant time size container or stateful comparison functor a compilation error will be issued.

    69. -
      void rebalance();
      +
      void rebalance();

      Effects: Rebalances the tree.

      Throws: Nothing.

      Complexity: Linear.

    70. -
      iterator rebalance_subtree(iterator root);
      +
      iterator rebalance_subtree(iterator root);

      Requires: old_root is a node of a tree.

      Effects: Rebalances the subtree rooted at old_root.

      Returns: The new root of the subtree.

      @@ -782,13 +799,13 @@

      Complexity: Linear to the elements in the subtree.

    71. -
      float balance_factor() const;
      +
      float balance_factor() const;

      Returns: The balance factor (alpha) used in this tree

      Throws: Nothing.

      Complexity: Constant.

    72. -
      void balance_factor(float new_alpha);
      +
      void balance_factor(float new_alpha);

      Requires: new_alpha must be a value between 0.5 and 1.0

      Effects: Establishes a new balance factor (alpha) and rebalances the tree if the new balance factor is stricter (less) than the old factor.

      Throws: Nothing.

      @@ -797,39 +814,39 @@
    -

    -sgtree public static functions

    +

    +sgtree public static functions

    1. -
      static sgtree & container_from_end_iterator(iterator end_iterator);
      +
      static sgtree & container_from_end_iterator(iterator end_iterator);

      Precondition: end_iterator must be a valid end iterator of the container.

      Effects: Returns a const reference to the container associated to the end iterator

      Throws: Nothing.

      Complexity: Constant.

    2. -
      static const sgtree & container_from_end_iterator(const_iterator end_iterator);
      +
      static const sgtree & container_from_end_iterator(const_iterator end_iterator);

      Precondition: end_iterator must be a valid end iterator of the container.

      Effects: Returns a const reference to the container associated to the end iterator

      Throws: Nothing.

      Complexity: Constant.

    3. -
      static sgtree & container_from_iterator(iterator it);
      +
      static sgtree & container_from_iterator(iterator it);

      Precondition: it must be a valid iterator of the container.

      Effects: Returns a const reference to the container associated to the iterator

      Throws: Nothing.

      Complexity: Logarithmic.

    4. -
      static const sgtree & container_from_iterator(const_iterator it);
      +
      static const sgtree & container_from_iterator(const_iterator it);

      Precondition: it must be a valid iterator of the container.

      Effects: Returns a const reference to the container associated to the iterator

      Throws: Nothing.

      Complexity: Logarithmic.

    5. -
      static iterator s_iterator_to(reference value);
      +
      static iterator s_iterator_to(reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      @@ -837,7 +854,7 @@

      Note: This static function is available only if the value traits is stateless.

    6. -
      static const_iterator s_iterator_to(const_reference value);
      +
      static const_iterator s_iterator_to(const_reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      @@ -845,7 +862,7 @@

      Note: This static function is available only if the value traits is stateless.

    7. -
      static void init_node(reference value);
      +
      static void init_node(reference value);

      Requires: value shall not be in a container.

      Effects: init_node puts the hook of a value in a well-known default state.

      Throws: Nothing.

      diff --git a/doc/html/boost/intrusive/sgtree_algorithms.html b/doc/html/boost/intrusive/sgtree_algorithms.html index 641758ad5b..e2b94f43e6 100644 --- a/doc/html/boost/intrusive/sgtree_algorithms.html +++ b/doc/html/boost/intrusive/sgtree_algorithms.html @@ -49,94 +49,94 @@ std::size_t depth; }; - // public static functions - static node_ptr get_header(const const_node_ptr &); - static node_ptr begin_node(const const_node_ptr &); - static node_ptr end_node(const const_node_ptr &); - static void swap_tree(const node_ptr &, const node_ptr &); - static void swap_nodes(const node_ptr &, const node_ptr &); - static void swap_nodes(const node_ptr &, const node_ptr &, const node_ptr &, + // public static functions + static node_ptr get_header(const const_node_ptr &); + static node_ptr begin_node(const const_node_ptr &); + static node_ptr end_node(const const_node_ptr &); + static void swap_tree(const node_ptr &, const node_ptr &); + static void swap_nodes(const node_ptr &, const node_ptr &); + static void swap_nodes(const node_ptr &, const node_ptr &, const node_ptr &, const node_ptr &); - static void replace_node(const node_ptr &, const node_ptr &); - static void replace_node(const node_ptr &, const node_ptr &, + static void replace_node(const node_ptr &, const node_ptr &); + static void replace_node(const node_ptr &, const node_ptr &, const node_ptr &); - static node_ptr unlink_leftmost_without_rebalance(const node_ptr &); - static bool unique(const const_node_ptr &); - static std::size_t size(const const_node_ptr &); - static node_ptr next_node(const node_ptr &); - static node_ptr prev_node(const node_ptr &); - static void init(const node_ptr &); - static void init_header(const node_ptr &); + static node_ptr unlink_leftmost_without_rebalance(const node_ptr &); + static bool unique(const const_node_ptr &); + static std::size_t size(const const_node_ptr &); + static node_ptr next_node(const node_ptr &); + static node_ptr prev_node(const node_ptr &); + static void init(const node_ptr &); + static void init_header(const node_ptr &); template<typename AlphaByMaxSize> static node_ptr - erase(const node_ptr &, const node_ptr &, std::size_t, std::size_t &, + erase(const node_ptr &, const node_ptr &, std::size_t, std::size_t &, AlphaByMaxSize); template<typename Cloner, typename Disposer> - static void clone(const const_node_ptr &, const node_ptr &, Cloner, + static void clone(const const_node_ptr &, const node_ptr &, Cloner, Disposer); template<typename Disposer> - static void clear_and_dispose(const node_ptr &, Disposer); + static void clear_and_dispose(const node_ptr &, Disposer); template<typename KeyType, typename KeyNodePtrCompare> static node_ptr - lower_bound(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + lower_bound(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static node_ptr - upper_bound(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + upper_bound(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static node_ptr - find(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + find(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, node_ptr > - equal_range(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + equal_range(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, node_ptr > - bounded_range(const const_node_ptr &, const KeyType &, const KeyType &, + bounded_range(const const_node_ptr &, const KeyType &, const KeyType &, KeyNodePtrCompare, bool, bool); template<typename KeyType, typename KeyNodePtrCompare> static std::size_t - count(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + count(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename NodePtrCompare, typename H_Alpha> static node_ptr - insert_equal_upper_bound(const node_ptr &, const node_ptr &, + insert_equal_upper_bound(const node_ptr &, const node_ptr &, NodePtrCompare, std::size_t, H_Alpha, std::size_t &); template<typename NodePtrCompare, typename H_Alpha> static node_ptr - insert_equal_lower_bound(const node_ptr &, const node_ptr &, + insert_equal_lower_bound(const node_ptr &, const node_ptr &, NodePtrCompare, std::size_t, H_Alpha, std::size_t &); template<typename NodePtrCompare, typename H_Alpha> static node_ptr - insert_equal(const node_ptr &, const node_ptr &, const node_ptr &, + insert_equal(const node_ptr &, const node_ptr &, const node_ptr &, NodePtrCompare, std::size_t, H_Alpha, std::size_t &); template<typename H_Alpha> static node_ptr - insert_before(const node_ptr &, const node_ptr &, const node_ptr &, + insert_before(const node_ptr &, const node_ptr &, const node_ptr &, std::size_t, H_Alpha, std::size_t &); template<typename H_Alpha> - static void push_back(const node_ptr &, const node_ptr &, std::size_t, + static void push_back(const node_ptr &, const node_ptr &, std::size_t, H_Alpha, std::size_t &); template<typename H_Alpha> - static void push_front(const node_ptr &, const node_ptr &, std::size_t, + static void push_front(const node_ptr &, const node_ptr &, std::size_t, H_Alpha, std::size_t &); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, bool > - insert_unique_check(const const_node_ptr &, const KeyType &, + insert_unique_check(const const_node_ptr &, const KeyType &, KeyNodePtrCompare, insert_commit_data &); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, bool > - insert_unique_check(const const_node_ptr &, const node_ptr &, + insert_unique_check(const const_node_ptr &, const node_ptr &, const KeyType &, KeyNodePtrCompare, insert_commit_data &); template<typename H_Alpha> - static void insert_unique_commit(const node_ptr &, const node_ptr &, + static void insert_unique_commit(const node_ptr &, const node_ptr &, const insert_commit_data &, std::size_t, H_Alpha, std::size_t &); - static bool is_header(const const_node_ptr &); - static void rebalance(const node_ptr &); + static bool is_header(const const_node_ptr &); + static void rebalance(const node_ptr &); };
    -

    Description

    +

    Description

    sgtree_algorithms is configured with a NodeTraits class, which encapsulates the information about the node to be manipulated. NodeTraits must support the following interface:

    Typedefs:

    node: The type of the node that forms the binary search tree

    @@ -150,39 +150,39 @@

    static node_ptr get_right(const_node_ptr n);

    static void set_right(node_ptr n, node_ptr right);

    -

    -sgtree_algorithms public static functions

    +

    +sgtree_algorithms public static functions

    1. -
      static node_ptr get_header(const const_node_ptr & n);
      +
      static node_ptr get_header(const const_node_ptr & n);

      Requires: 'node' is a node of the tree or a header node.

      Effects: Returns the header of the tree.

      Complexity: Logarithmic.

      Throws: Nothing.

    2. -
      static node_ptr begin_node(const const_node_ptr & header);
      +
      static node_ptr begin_node(const const_node_ptr & header);

      Requires: 'header' is the header node of a tree.

      Effects: Returns the first node of the tree, the header if the tree is empty.

      Complexity: Constant time.

      Throws: Nothing.

    3. -
      static node_ptr end_node(const const_node_ptr & header);
      +
      static node_ptr end_node(const const_node_ptr & header);

      Requires: 'header' is the header node of a tree.

      Effects: Returns the header of the tree.

      Complexity: Constant time.

      Throws: Nothing.

    4. -
      static void swap_tree(const node_ptr & header1, const node_ptr & header2);
      +
      static void swap_tree(const node_ptr & header1, const node_ptr & header2);

      Requires: header1 and header2 must be the header nodes of two trees.

      Effects: Swaps two trees. After the function header1 will contain links to the second tree and header2 will have links to the first tree.

      Complexity: Constant.

      Throws: Nothing.

    5. -
      static void swap_nodes(const node_ptr & node1, const node_ptr & node2);
      +
      static void swap_nodes(const node_ptr & node1, const node_ptr & node2);

      Requires: node1 and node2 can't be header nodes of two trees.

      Effects: Swaps two nodes. After the function node1 will be inserted in the position node2 before the function. node2 will be inserted in the position node1 had before the function.

      Complexity: Logarithmic.

      @@ -191,7 +191,7 @@

      Experimental function

    6. -
      static void swap_nodes(const node_ptr & node1, const node_ptr & header1, 
+
      static void swap_nodes(const node_ptr & node1, const node_ptr & header1, 
                        const node_ptr & node2, const node_ptr & header2);
      
 
      Requires: node1 and node2 can't be header nodes of two trees with header header1 and header2.
      
 
      Effects: Swaps two nodes. After the function node1 will be inserted in the position node2 before the function. node2 will be inserted in the position node1 had before the function.
      
@@ -201,7 +201,7 @@
 
      Experimental function
    7. -
      static void replace_node(const node_ptr & node_to_be_replaced, 
+
      static void replace_node(const node_ptr & node_to_be_replaced, 
                          const node_ptr & new_node);
      
 
      Requires: node_to_be_replaced must be inserted in a tree and new_node must not be inserted in a tree.
      
 
      Effects: Replaces node_to_be_replaced in its position in the tree with new_node. The tree does not need to be rebalanced
      
@@ -210,7 +210,7 @@
 
      Note: This function will break container ordering invariants if new_node is not equivalent to node_to_be_replaced according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing and comparison is needed. Experimental function
    8. -
      static void replace_node(const node_ptr & node_to_be_replaced, 
+
      static void replace_node(const node_ptr & node_to_be_replaced, 
                          const node_ptr & header, const node_ptr & new_node);
      
 
      Requires: node_to_be_replaced must be inserted in a tree with header "header" and new_node must not be inserted in a tree.
      
 
      Effects: Replaces node_to_be_replaced in its position in the tree with new_node. The tree does not need to be rebalanced
      
@@ -219,42 +219,42 @@
 
      Note: This function will break container ordering invariants if new_node is not equivalent to node_to_be_replaced according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing or comparison is needed. Experimental function
    9. -
      static node_ptr unlink_leftmost_without_rebalance(const node_ptr & header);
      static void unlink(const node_ptr & node);

      Requires: header is the header of a tree.

      +
      static node_ptr unlink_leftmost_without_rebalance(const node_ptr & header);
      static void unlink(const node_ptr & node);

      Requires: header is the header of a tree.

      Effects: Unlinks the leftmost node from the tree, and updates the header link to the new leftmost node.

      Complexity: Average complexity is constant time.

      Throws: Nothing.

      Notes: This function breaks the tree and the tree can only be used for more unlink_leftmost_without_rebalance calls. This function is normally used to achieve a step by step controlled destruction of the tree.

    10. -
      static bool unique(const const_node_ptr & node);
      +
      static bool unique(const const_node_ptr & node);

      Requires: 'node' is a node of the tree or a node initialized by init(...) or init_node.

      Effects: Returns true if the node is initialized by init() or init_node().

      Complexity: Constant time.

      Throws: Nothing.

    11. -
      static std::size_t size(const const_node_ptr & header);
      +
      static std::size_t size(const const_node_ptr & header);

      Requires: node is a node of the tree but it's not the header.

      Effects: Returns the number of nodes of the subtree.

      Complexity: Linear time.

      Throws: Nothing.

    12. -
      static node_ptr next_node(const node_ptr & node);
      +
      static node_ptr next_node(const node_ptr & node);

      Requires: 'node' is a node from the tree except the header.

      Effects: Returns the next node of the tree.

      Complexity: Average constant time.

      Throws: Nothing.

    13. -
      static node_ptr prev_node(const node_ptr & node);
      +
      static node_ptr prev_node(const node_ptr & node);

      Requires: 'node' is a node from the tree except the leftmost node.

      Effects: Returns the previous node of the tree.

      Complexity: Average constant time.

      Throws: Nothing.

    14. -
      static void init(const node_ptr & node);
      +
      static void init(const node_ptr & node);

      Requires: 'node' must not be part of any tree.

      Effects: After the function unique(node) == true.

      Complexity: Constant.

      @@ -262,7 +262,7 @@

      Nodes: If node is inserted in a tree, this function corrupts the tree.

    15. -
      static void init_header(const node_ptr & header);
      +
      static void init_header(const node_ptr & header);

      Requires: node must not be part of any tree.

      Effects: Initializes the header to represent an empty tree. unique(header) == true.

      Complexity: Constant.

      @@ -272,7 +272,7 @@ 
    16. template<typename AlphaByMaxSize> 
   static node_ptr 
-  erase(const node_ptr & header, const node_ptr & z, std::size_t tree_size, 
+  erase(const node_ptr & header, const node_ptr & z, std::size_t tree_size, 
         std::size_t & max_tree_size, AlphaByMaxSize alpha_by_maxsize);

      Requires: header must be the header of a tree, z a node of that tree and z != header.

      Effects: Erases node "z" from the tree with header "header".

      @@ -281,7 +281,7 @@ 
    17. template<typename Cloner, typename Disposer> 
-  static void clone(const const_node_ptr & source_header, 
+  static void clone(const const_node_ptr & source_header, 
                     const node_ptr & target_header, Cloner cloner, 
                     Disposer disposer);

      Requires: "cloner" must be a function object taking a node_ptr and returning a new cloned node of it. "disposer" must take a node_ptr and shouldn't throw.

      @@ -292,7 +292,7 @@ 
    18. template<typename Disposer> 
-  static void clear_and_dispose(const node_ptr & header, Disposer disposer);
      + static void clear_and_dispose(const node_ptr & header, Disposer disposer);

      Requires: "disposer" must be an object function taking a node_ptr parameter and shouldn't throw.

      Effects: Empties the target tree calling void disposer::operator()(const node_ptr &) for every node of the tree except the header.

      Complexity: Linear to the number of element of the source tree plus the. number of elements of tree target tree when calling this function.

      @@ -301,7 +301,7 @@ 
    19. template<typename KeyType, typename KeyNodePtrCompare> 
   static node_ptr 
-  lower_bound(const const_node_ptr & header, const KeyType & key, 
+  lower_bound(const const_node_ptr & header, const KeyType & key, 
               KeyNodePtrCompare comp);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

      Effects: Returns a node_ptr to the first element that is not less than "key" according to "comp" or "header" if that element does not exist.

      @@ -311,7 +311,7 @@ 
    20. template<typename KeyType, typename KeyNodePtrCompare> 
   static node_ptr 
-  upper_bound(const const_node_ptr & header, const KeyType & key, 
+  upper_bound(const const_node_ptr & header, const KeyType & key, 
               KeyNodePtrCompare comp);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

      Effects: Returns a node_ptr to the first element that is greater than "key" according to "comp" or "header" if that element does not exist.

      @@ -321,7 +321,7 @@ 
    21. template<typename KeyType, typename KeyNodePtrCompare> 
   static node_ptr 
-  find(const const_node_ptr & header, const KeyType & key, 
+  find(const const_node_ptr & header, const KeyType & key, 
        KeyNodePtrCompare comp);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

      Effects: Returns a node_ptr to the first element that is equivalent to "key" according to "comp" or "header" if that element does not exist.

      @@ -331,7 +331,7 @@ 
    22. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, node_ptr > 
-  equal_range(const const_node_ptr & header, const KeyType & key, 
+  equal_range(const const_node_ptr & header, const KeyType & key, 
               KeyNodePtrCompare comp);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

      Effects: Returns an a pair of node_ptr delimiting a range containing all elements that are equivalent to "key" according to "comp" or an empty range that indicates the position where those elements would be if there are no equivalent elements.

      @@ -341,7 +341,7 @@ 
    23. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, node_ptr > 
-  bounded_range(const const_node_ptr & header, const KeyType & lower_key, 
+  bounded_range(const const_node_ptr & header, const KeyType & lower_key, 
                 const KeyType & upper_key, KeyNodePtrCompare comp, 
                 bool left_closed, bool right_closed);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs. 'lower_key' must not be greater than 'upper_key' according to 'comp'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be true.

      @@ -356,7 +356,7 @@ 
    24. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::size_t 
-  count(const const_node_ptr & header, const KeyType & key, 
+  count(const const_node_ptr & header, const KeyType & key, 
         KeyNodePtrCompare comp);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

      Effects: Returns the number of elements with a key equivalent to "key" according to "comp".

      @@ -366,7 +366,7 @@ 
    25. template<typename NodePtrCompare, typename H_Alpha> 
   static node_ptr 
-  insert_equal_upper_bound(const node_ptr & h, const node_ptr & new_node, 
+  insert_equal_upper_bound(const node_ptr & h, const node_ptr & new_node, 
                            NodePtrCompare comp, std::size_t tree_size, 
                            H_Alpha h_alpha, std::size_t & max_tree_size);

      Requires: "h" must be the header node of a tree. NodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares two node_ptrs.

      @@ -377,7 +377,7 @@ 
    26. template<typename NodePtrCompare, typename H_Alpha> 
   static node_ptr 
-  insert_equal_lower_bound(const node_ptr & h, const node_ptr & new_node, 
+  insert_equal_lower_bound(const node_ptr & h, const node_ptr & new_node, 
                            NodePtrCompare comp, std::size_t tree_size, 
                            H_Alpha h_alpha, std::size_t & max_tree_size);

      Requires: "h" must be the header node of a tree. NodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares two node_ptrs.

      @@ -388,7 +388,7 @@ 
    27. template<typename NodePtrCompare, typename H_Alpha> 
   static node_ptr 
-  insert_equal(const node_ptr & header, const node_ptr & hint, 
+  insert_equal(const node_ptr & header, const node_ptr & hint, 
                const node_ptr & new_node, NodePtrCompare comp, 
                std::size_t tree_size, H_Alpha h_alpha, 
                std::size_t & max_tree_size);
      @@ -400,7 +400,7 @@ 
    28. template<typename H_Alpha> 
   static node_ptr 
-  insert_before(const node_ptr & header, const node_ptr & pos, 
+  insert_before(const node_ptr & header, const node_ptr & pos, 
                 const node_ptr & new_node, std::size_t tree_size, 
                 H_Alpha h_alpha, std::size_t & max_tree_size);

      Requires: "header" must be the header node of a tree. "pos" must be a valid iterator or header (end) node. "pos" must be an iterator pointing to the successor to "new_node" once inserted according to the order of already inserted nodes. This function does not check "pos" and this precondition must be guaranteed by the caller.

      @@ -411,7 +411,7 @@ 
    29. template<typename H_Alpha> 
-  static void push_back(const node_ptr & header, const node_ptr & new_node, 
+  static void push_back(const node_ptr & header, const node_ptr & new_node, 
                         std::size_t tree_size, H_Alpha h_alpha, 
                         std::size_t & max_tree_size);

      Requires: "header" must be the header node of a tree. "new_node" must be, according to the used ordering no less than the greatest inserted key.

      @@ -422,7 +422,7 @@ 
    30. template<typename H_Alpha> 
-  static void push_front(const node_ptr & header, const node_ptr & new_node, 
+  static void push_front(const node_ptr & header, const node_ptr & new_node, 
                          std::size_t tree_size, H_Alpha h_alpha, 
                          std::size_t & max_tree_size);

      Requires: "header" must be the header node of a tree. "new_node" must be, according to the used ordering, no greater than the lowest inserted key.

      @@ -434,7 +434,7 @@ 
    31. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, bool > 
-  insert_unique_check(const const_node_ptr & header, const KeyType & key, 
+  insert_unique_check(const const_node_ptr & header, const KeyType & key, 
                       KeyNodePtrCompare comp, 
                       insert_commit_data & commit_data);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares KeyType with a node_ptr.

      @@ -449,7 +449,7 @@ 
    32. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, bool > 
-  insert_unique_check(const const_node_ptr & header, const node_ptr & hint, 
+  insert_unique_check(const const_node_ptr & header, const node_ptr & hint, 
                       const KeyType & key, KeyNodePtrCompare comp, 
                       insert_commit_data & commit_data);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares KeyType with a node_ptr. "hint" is node from the "header"'s tree.

      @@ -463,7 +463,7 @@ 
    33. template<typename H_Alpha> 
-  static void insert_unique_commit(const node_ptr & header, 
+  static void insert_unique_commit(const node_ptr & header, 
                                    const node_ptr & new_value, 
                                    const insert_commit_data & commit_data, 
                                    std::size_t tree_size, H_Alpha h_alpha, 
@@ -475,14 +475,14 @@
 
      Notes: This function has only sense if a "insert_unique_check" has been previously executed to fill "commit_data". No value should be inserted or erased between the "insert_check" and "insert_commit" calls.
    34. -
      static bool is_header(const const_node_ptr & p);
      +
      static bool is_header(const const_node_ptr & p);

      Requires: p is a node of a tree.

      Effects: Returns true if p is the header of the tree.

      Complexity: Constant.

      Throws: Nothing.

    35. -
      static void rebalance(const node_ptr & header);
      +
      static void rebalance(const node_ptr & header);

      Requires: p is a node of a tree.

      Effects: Returns true if p is the header of the tree.

      Complexity: Constant.

      diff --git a/doc/html/boost/intrusive/sgtree_algorithms/insert_commit_data.html b/doc/html/boost/intrusive/sgtree_algorithms/insert_commit_data.html index 95e952ebcb..09f2382771 100644 --- a/doc/html/boost/intrusive/sgtree_algorithms/insert_commit_data.html +++ b/doc/html/boost/intrusive/sgtree_algorithms/insert_commit_data.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      @@ -40,7 +40,7 @@ std::size_t depth; };
      -

      Description

      +

      Description

      This type is the information that will be filled by insert_unique_check

    @@ -54,7 +54,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/intrusive/size_type.html b/doc/html/boost/intrusive/size_type.html index 1de8e2c8f3..341582ae41 100644 --- a/doc/html/boost/intrusive/size_type.html +++ b/doc/html/boost/intrusive/size_type.html @@ -36,7 +36,7 @@ struct size_type { };
    -

    Description

    +

    Description

    This option setter specifies the type that the container will use to store its size.

    diff --git a/doc/html/boost/intrusive/slist.html b/doc/html/boost/intrusive/slist.html index 381788545c..e3ad56ed8e 100644 --- a/doc/html/boost/intrusive/slist.html +++ b/doc/html/boost/intrusive/slist.html @@ -54,125 +54,125 @@ typedef unspecified node_algorithms; // construct/copy/destruct - explicit slist(const value_traits & = value_traits()); + explicit slist(const value_traits & = value_traits()); template<typename Iterator> - slist(Iterator, Iterator, const value_traits & = value_traits()); - slist(slist &&); - slist & operator=(slist &&); - ~slist(); + slist(Iterator, Iterator, const value_traits & = value_traits()); + slist(slist &&); + slist & operator=(slist &&); + ~slist(); - // public member functions - void clear(); - template<typename Disposer> void clear_and_dispose(Disposer); - void push_front(reference); - void push_back(reference); - void pop_front(); - template<typename Disposer> void pop_front_and_dispose(Disposer); - reference front(); - const_reference front() const; - reference back(); - const_reference back() const; - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end(); - const_iterator end() const; - const_iterator cend() const; - iterator before_begin(); - const_iterator before_begin() const; - const_iterator cbefore_begin() const; - iterator last(); - const_iterator last() const; - const_iterator clast() const; - size_type size() const; - bool empty() const; - void swap(slist &); - void shift_backwards(size_type = 1); - void shift_forward(size_type = 1); + // public member functions + void clear(); + template<typename Disposer> void clear_and_dispose(Disposer); + void push_front(reference); + void push_back(reference); + void pop_front(); + template<typename Disposer> void pop_front_and_dispose(Disposer); + reference front(); + const_reference front() const; + reference back(); + const_reference back() const; + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end(); + const_iterator end() const; + const_iterator cend() const; + iterator before_begin(); + const_iterator before_begin() const; + const_iterator cbefore_begin() const; + iterator last(); + const_iterator last() const; + const_iterator clast() const; + size_type size() const; + bool empty() const; + void swap(slist &); + void shift_backwards(size_type = 1); + void shift_forward(size_type = 1); template<typename Cloner, typename Disposer> - void clone_from(const slist &, Cloner, Disposer); + void clone_from(const slist &, Cloner, Disposer); template<typename Cloner, typename Disposer> - void clone_from(slist &&, Cloner, Disposer); - iterator insert_after(const_iterator, reference); + void clone_from(slist &&, Cloner, Disposer); + iterator insert_after(const_iterator, reference); template<typename Iterator> - void insert_after(const_iterator, Iterator, Iterator); - iterator insert(const_iterator, reference); - template<typename Iterator> void insert(const_iterator, Iterator, Iterator); - iterator erase_after(const_iterator); - iterator erase_after(const_iterator, const_iterator); - iterator erase_after(const_iterator, const_iterator, size_type); - iterator erase(const_iterator); - iterator erase(const_iterator, const_iterator); - iterator erase(const_iterator, const_iterator, size_type); + void insert_after(const_iterator, Iterator, Iterator); + iterator insert(const_iterator, reference); + template<typename Iterator> void insert(const_iterator, Iterator, Iterator); + iterator erase_after(const_iterator); + iterator erase_after(const_iterator, const_iterator); + iterator erase_after(const_iterator, const_iterator, size_type); + iterator erase(const_iterator); + iterator erase(const_iterator, const_iterator); + iterator erase(const_iterator, const_iterator, size_type); template<typename Disposer> - iterator erase_after_and_dispose(const_iterator, Disposer); + iterator erase_after_and_dispose(const_iterator, Disposer); template<typename Disposer> - iterator erase_after_and_dispose(const_iterator, const_iterator, Disposer); + iterator erase_after_and_dispose(const_iterator, const_iterator, Disposer); template<typename Disposer> - iterator erase_and_dispose(const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, Disposer); template<typename Disposer> - iterator erase_and_dispose(const_iterator, const_iterator, Disposer); - template<typename Iterator> void assign(Iterator, Iterator); + iterator erase_and_dispose(const_iterator, const_iterator, Disposer); + template<typename Iterator> void assign(Iterator, Iterator); template<typename Iterator, typename Disposer> - void dispose_and_assign(Disposer, Iterator, Iterator); - void splice_after(const_iterator, slist &, const_iterator * = 0); - void splice_after(const_iterator, slist &, const_iterator); - void splice_after(const_iterator, slist &, const_iterator, const_iterator); - void splice_after(const_iterator, slist &, const_iterator, const_iterator, + void dispose_and_assign(Disposer, Iterator, Iterator); + void splice_after(const_iterator, slist &, const_iterator * = 0); + void splice_after(const_iterator, slist &, const_iterator); + void splice_after(const_iterator, slist &, const_iterator, const_iterator); + void splice_after(const_iterator, slist &, const_iterator, const_iterator, size_type); - void splice(const_iterator, slist &, const_iterator * = 0); - void splice(const_iterator, slist &, const_iterator); - void splice(const_iterator, slist &, const_iterator, const_iterator); - void splice(const_iterator, slist &, const_iterator, const_iterator, + void splice(const_iterator, slist &, const_iterator * = 0); + void splice(const_iterator, slist &, const_iterator); + void splice(const_iterator, slist &, const_iterator, const_iterator); + void splice(const_iterator, slist &, const_iterator, const_iterator, size_type); - template<typename Predicate> void sort(Predicate); - void sort(); + template<typename Predicate> void sort(Predicate); + void sort(); template<typename Predicate> - void merge(slist &, Predicate, const_iterator * = 0); - void merge(slist &); - void reverse(); - void remove(const_reference); + void merge(slist &, Predicate, const_iterator * = 0); + void merge(slist &); + void reverse(); + void remove(const_reference); template<typename Disposer> - void remove_and_dispose(const_reference, Disposer); - template<typename Pred> void remove_if(Pred); + void remove_and_dispose(const_reference, Disposer); + template<typename Pred> void remove_if(Pred); template<typename Pred, typename Disposer> - void remove_and_dispose_if(Pred, Disposer); - void unique(); - template<typename BinaryPredicate> void unique(BinaryPredicate); - template<typename Disposer> void unique_and_dispose(Disposer); + void remove_and_dispose_if(Pred, Disposer); + void unique(); + template<typename BinaryPredicate> void unique(BinaryPredicate); + template<typename Disposer> void unique_and_dispose(Disposer); template<typename BinaryPredicate, typename Disposer> - void unique_and_dispose(BinaryPredicate, Disposer); - iterator iterator_to(reference); - const_iterator iterator_to(const_reference) const; - iterator previous(iterator); - const_iterator previous(const_iterator) const; - iterator previous(const_iterator, iterator); - const_iterator previous(const_iterator, const_iterator) const; - void check() const; + void unique_and_dispose(BinaryPredicate, Disposer); + iterator iterator_to(reference); + const_iterator iterator_to(const_reference) const; + iterator previous(iterator); + const_iterator previous(const_iterator) const; + iterator previous(const_iterator, iterator); + const_iterator previous(const_iterator, const_iterator) const; + void check() const; - // public static functions - static slist & container_from_end_iterator(iterator); - static const slist & container_from_end_iterator(const_iterator); - static iterator s_iterator_to(reference); - static const_iterator s_iterator_to(const_reference); + // public static functions + static slist & container_from_end_iterator(iterator); + static const slist & container_from_end_iterator(const_iterator); + static iterator s_iterator_to(reference); + static const_iterator s_iterator_to(const_reference); - // private member functions - void priv_splice_after(const node_ptr &, slist &, const node_ptr &, + // private member functions + void priv_splice_after(const node_ptr &, slist &, const node_ptr &, const node_ptr &); - void priv_incorporate_after(const node_ptr &, const node_ptr &, + void priv_incorporate_after(const node_ptr &, const node_ptr &, const node_ptr &); - void priv_reverse(unspecified); - void priv_reverse(unspecified); - void priv_shift_backwards(size_type, unspecified); - void priv_shift_backwards(size_type, unspecified); - void priv_shift_forward(size_type, unspecified); - void priv_shift_forward(size_type, unspecified); + void priv_reverse(unspecified); + void priv_reverse(unspecified); + void priv_shift_backwards(size_type, unspecified); + void priv_shift_backwards(size_type, unspecified); + void priv_shift_forward(size_type, unspecified); + void priv_shift_forward(size_type, unspecified); - // private static functions - static void priv_swap_cache_last(slist *, slist *); - static void priv_swap_lists(const node_ptr &, const node_ptr &, unspecified); - static void priv_swap_lists(const node_ptr &, const node_ptr &, unspecified); - static slist & priv_container_from_end_iterator(const const_iterator &); + // private static functions + static void priv_swap_cache_last(slist *, slist *); + static void priv_swap_lists(const node_ptr &, const node_ptr &, unspecified); + static void priv_swap_lists(const node_ptr &, const node_ptr &, unspecified); + static slist & priv_container_from_end_iterator(const const_iterator &); // public data members static const bool constant_time_size; @@ -182,26 +182,26 @@ static const bool has_container_from_iterator; };
    -

    Description

    +

    Description

    The class template slist is an intrusive container, that encapsulates a singly-linked list. You can use such a list to squeeze the last bit of performance from your application. Unfortunately, the little gains come with some huge drawbacks. A lot of member functions can't be implemented as efficiently as for standard containers. To overcome this limitation some other member functions with rather unusual semantics have to be introduced.

    The template parameter T is the type to be managed by the container. The user can specify additional options and if no options are provided default options are used.

    The container supports the following options: base_hook<>/member_hook<>/value_traits<>, constant_time_size<>, size_type<>, linear<> and cache_last<>.

    The iterators of slist are forward iterators. slist provides a static function called "previous" to compute the previous iterator of a given iterator. This function has linear complexity. To improve the usability esp. with the '*_after' functions, ++end() == begin() and previous(begin()) == end() are defined. An new special function "before_begin()" is defined, which returns an iterator that points one less the beginning of the list: ++before_begin() == begin()

    -

    +

    slist public construct/copy/destruct

    1. -
      explicit slist(const value_traits & v_traits = value_traits());
      +
      explicit slist(const value_traits & v_traits = value_traits());

      Effects: constructs an empty list.

      Complexity: Constant

      Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks). 

    2. template<typename Iterator> 
-  slist(Iterator b, Iterator e, 
+  slist(Iterator b, Iterator e, 
         const value_traits & v_traits = value_traits());

      Requires: Dereferencing iterator must yield an lvalue of type value_type.

      Effects: Constructs a list equal to [b ,e).

      @@ -209,33 +209,33 @@

      Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks).

    3. -
      slist(slist && x);
      +
      slist(slist && x);

      Effects: to-do

    4. -
      slist & operator=(slist && x);
      +
      slist & operator=(slist && x);

      Effects: to-do

    5. -
      ~slist();
      +
      ~slist();

      Effects: If it's a safe-mode or auto-unlink value, the destructor does nothing (ie. no code is generated). Otherwise it detaches all elements from this. In this case the objects in the list are not deleted (i.e. no destructors are called), but the hooks according to the value_traits template parameter are set to their default value.

      Complexity: Linear to the number of elements in the list, if it's a safe-mode or auto-unlink value. Otherwise constant.

    -

    -slist public member functions

    +

    +slist public member functions

    1. -
      void clear();
      +
      void clear();

      Effects: Erases all the elements of the container.

      Throws: Nothing.

      Complexity: Linear to the number of elements of the list. if it's a safe-mode or auto-unlink value_type. Constant time otherwise.

      Note: Invalidates the iterators (but not the references) to the erased elements.

    2. -
      template<typename Disposer> void clear_and_dispose(Disposer disposer);
      +
      template<typename Disposer> void clear_and_dispose(Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases all the elements of the container Disposer::operator()(pointer) is called for the removed elements.

      Throws: Nothing.

      @@ -243,7 +243,7 @@

      Note: Invalidates the iterators to the erased elements.

    3. -
      void push_front(reference value);
      +
      void push_front(reference value);

      Requires: value must be an lvalue.

      Effects: Inserts the value in the front of the list. No copy constructors are called.

      Throws: Nothing.

      @@ -251,7 +251,7 @@

      Note: Does not affect the validity of iterators and references.

    4. -
      void push_back(reference value);
      +
      void push_back(reference value);

      Requires: value must be an lvalue.

      Effects: Inserts the value in the back of the list. No copy constructors are called.

      Throws: Nothing.

      @@ -259,14 +259,14 @@

      Note: Does not affect the validity of iterators and references. This function is only available is cache_last<> is true.

    5. -
      void pop_front();
      +
      void pop_front();

      Effects: Erases the first element of the list. No destructors are called.

      Throws: Nothing.

      Complexity: Constant.

      Note: Invalidates the iterators (but not the references) to the erased element.

    6. -
      template<typename Disposer> void pop_front_and_dispose(Disposer disposer);
      +
      template<typename Disposer> void pop_front_and_dispose(Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases the first element of the list. Disposer::operator()(pointer) is called for the removed element.

      Throws: Nothing.

      @@ -274,136 +274,136 @@

      Note: Invalidates the iterators to the erased element.

    7. -
      reference front();
      +
      reference front();

      Effects: Returns a reference to the first element of the list.

      Throws: Nothing.

      Complexity: Constant.

    8. -
      const_reference front() const;
      +
      const_reference front() const;

      Effects: Returns a const_reference to the first element of the list.

      Throws: Nothing.

      Complexity: Constant.

    9. -
      reference back();
      +
      reference back();

      Effects: Returns a reference to the last element of the list.

      Throws: Nothing.

      Complexity: Constant.

      Note: Does not affect the validity of iterators and references. This function is only available is cache_last<> is true.

    10. -
      const_reference back() const;
      +
      const_reference back() const;

      Effects: Returns a const_reference to the last element of the list.

      Throws: Nothing.

      Complexity: Constant.

      Note: Does not affect the validity of iterators and references. This function is only available is cache_last<> is true.

    11. -
      iterator begin();
      +
      iterator begin();

      Effects: Returns an iterator to the first element contained in the list.

      Throws: Nothing.

      Complexity: Constant.

    12. -
      const_iterator begin() const;
      +
      const_iterator begin() const;

      Effects: Returns a const_iterator to the first element contained in the list.

      Throws: Nothing.

      Complexity: Constant.

    13. -
      const_iterator cbegin() const;
      +
      const_iterator cbegin() const;

      Effects: Returns a const_iterator to the first element contained in the list.

      Throws: Nothing.

      Complexity: Constant.

    14. -
      iterator end();
      +
      iterator end();

      Effects: Returns an iterator to the end of the list.

      Throws: Nothing.

      Complexity: Constant.

    15. -
      const_iterator end() const;
      +
      const_iterator end() const;

      Effects: Returns a const_iterator to the end of the list.

      Throws: Nothing.

      Complexity: Constant.

    16. -
      const_iterator cend() const;
      +
      const_iterator cend() const;

      Effects: Returns a const_iterator to the end of the list.

      Throws: Nothing.

      Complexity: Constant.

    17. -
      iterator before_begin();
      +
      iterator before_begin();

      Effects: Returns an iterator that points to a position before the first element. Equivalent to "end()"

      Throws: Nothing.

      Complexity: Constant.

    18. -
      const_iterator before_begin() const;
      +
      const_iterator before_begin() const;

      Effects: Returns an iterator that points to a position before the first element. Equivalent to "end()"

      Throws: Nothing.

      Complexity: Constant.

    19. -
      const_iterator cbefore_begin() const;
      +
      const_iterator cbefore_begin() const;

      Effects: Returns an iterator that points to a position before the first element. Equivalent to "end()"

      Throws: Nothing.

      Complexity: Constant.

    20. -
      iterator last();
      +
      iterator last();

      Effects: Returns an iterator to the last element contained in the list.

      Throws: Nothing.

      Complexity: Constant.

      Note: This function is present only if cached_last<> option is true.

    21. -
      const_iterator last() const;
      +
      const_iterator last() const;

      Effects: Returns a const_iterator to the last element contained in the list.

      Throws: Nothing.

      Complexity: Constant.

      Note: This function is present only if cached_last<> option is true.

    22. -
      const_iterator clast() const;
      +
      const_iterator clast() const;

      Effects: Returns a const_iterator to the last element contained in the list.

      Throws: Nothing.

      Complexity: Constant.

      Note: This function is present only if cached_last<> option is true.

    23. -
      size_type size() const;
      +
      size_type size() const;

      Effects: Returns the number of the elements contained in the list.

      Throws: Nothing.

      Complexity: Linear to the number of elements contained in the list. if constant_time_size is false. Constant time otherwise.

      Note: Does not affect the validity of iterators and references.

    24. -
      bool empty() const;
      +
      bool empty() const;

      Effects: Returns true if the list contains no elements.

      Throws: Nothing.

      Complexity: Constant.

      Note: Does not affect the validity of iterators and references.

    25. -
      void swap(slist & other);
      +
      void swap(slist & other);

      Effects: Swaps the elements of x and *this.

      Throws: Nothing.

      Complexity: Linear to the number of elements of both lists. Constant-time if linear<> and/or cache_last<> options are used.

      Note: Does not affect the validity of iterators and references.

    26. -
      void shift_backwards(size_type n = 1);
      +
      void shift_backwards(size_type n = 1);

      Effects: Moves backwards all the elements, so that the first element becomes the second, the second becomes the third... the last element becomes the first one.

      Throws: Nothing.

      Complexity: Linear to the number of elements plus the number shifts.

      Note: Iterators Does not affect the validity of iterators and references.

    27. -
      void shift_forward(size_type n = 1);
      +
      void shift_forward(size_type n = 1);

      Effects: Moves forward all the elements, so that the second element becomes the first, the third becomes the second... the first element becomes the last one.

      Throws: Nothing.

      Complexity: Linear to the number of elements plus the number shifts.

      @@ -411,7 +411,7 @@ 
    28. template<typename Cloner, typename Disposer> 
-  void clone_from(const slist & src, Cloner cloner, Disposer disposer);
      + void clone_from(const slist & src, Cloner cloner, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

      Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(const_reference ) and inserts them on *this.

      If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

      @@ -420,7 +420,7 @@ 
    29. template<typename Cloner, typename Disposer> 
-  void clone_from(slist && src, Cloner cloner, Disposer disposer);
      + void clone_from(slist && src, Cloner cloner, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

      Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(reference) and inserts them on *this.

      If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

      @@ -428,7 +428,7 @@

      Throws: If cloner throws.

    30. -
      iterator insert_after(const_iterator prev_p, reference value);
      +
      iterator insert_after(const_iterator prev_p, reference value);

      Requires: value must be an lvalue and prev_p must point to an element contained by the list or to end().

      Effects: Inserts the value after the position pointed by prev_p. No copy constructor is called.

      Returns: An iterator to the inserted element.

      @@ -438,7 +438,7 @@ 
    31. template<typename Iterator> 
-  void insert_after(const_iterator prev_p, Iterator f, Iterator l);
      + void insert_after(const_iterator prev_p, Iterator f, Iterator l);

      Requires: Dereferencing iterator must yield an lvalue of type value_type and prev_p must point to an element contained by the list or to the end node.

      Effects: Inserts the [f, l) after the position prev_p.

      Throws: Nothing.

      @@ -446,7 +446,7 @@

      Note: Does not affect the validity of iterators and references.

    32. -
      iterator insert(const_iterator p, reference value);
      +
      iterator insert(const_iterator p, reference value);

      Requires: value must be an lvalue and p must point to an element contained by the list or to end().

      Effects: Inserts the value before the position pointed by p. No copy constructor is called.

      Throws: Nothing.

      @@ -455,7 +455,7 @@ 
    33. template<typename Iterator> 
-  void insert(const_iterator p, Iterator b, Iterator e);
      + void insert(const_iterator p, Iterator b, Iterator e);

      Requires: Dereferencing iterator must yield an lvalue of type value_type and p must point to an element contained by the list or to the end node.

      Effects: Inserts the pointed by b and e before the position p. No copy constructors are called.

      Throws: Nothing.

      @@ -463,7 +463,7 @@

      Note: Does not affect the validity of iterators and references.

    34. -
      iterator erase_after(const_iterator prev);
      +
      iterator erase_after(const_iterator prev);

      Effects: Erases the element after the element pointed by prev of the list. No destructors are called.

      Returns: the first element remaining beyond the removed elements, or end() if no such element exists.

      Throws: Nothing.

      @@ -471,7 +471,7 @@

      Note: Invalidates the iterators (but not the references) to the erased element.

    35. -
      iterator erase_after(const_iterator before_f, const_iterator l);
      +
      iterator erase_after(const_iterator before_f, const_iterator l);

      Effects: Erases the range (before_f, l) from the list. No destructors are called.

      Returns: the first element remaining beyond the removed elements, or end() if no such element exists.

      Throws: Nothing.

      @@ -479,7 +479,7 @@

      Note: Invalidates the iterators (but not the references) to the erased element.

    36. -
      iterator erase_after(const_iterator before_f, const_iterator l, size_type n);
      +
      iterator erase_after(const_iterator before_f, const_iterator l, size_type n);

      Effects: Erases the range (before_f, l) from the list. n must be distance(before_f, l) - 1. No destructors are called.

      Returns: the first element remaining beyond the removed elements, or end() if no such element exists.

      Throws: Nothing.

      @@ -487,7 +487,7 @@

      Note: Invalidates the iterators (but not the references) to the erased element.

    37. -
      iterator erase(const_iterator i);
      +
      iterator erase(const_iterator i);

      Effects: Erases the element pointed by i of the list. No destructors are called.

      Returns: the first element remaining beyond the removed element, or end() if no such element exists.

      Throws: Nothing.

      @@ -495,7 +495,7 @@

      Note: Invalidates the iterators (but not the references) to the erased element.

    38. -
      iterator erase(const_iterator f, const_iterator l);
      +
      iterator erase(const_iterator f, const_iterator l);

      Requires: f and l must be valid iterator to elements in *this.

      Effects: Erases the range pointed by b and e. No destructors are called.

      Returns: the first element remaining beyond the removed elements, or end() if no such element exists.

      @@ -504,7 +504,7 @@

      Note: Invalidates the iterators (but not the references) to the erased elements.

    39. -
      iterator erase(const_iterator f, const_iterator l, size_type n);
      +
      iterator erase(const_iterator f, const_iterator l, size_type n);

      Effects: Erases the range [f, l) from the list. n must be distance(f, l). No destructors are called.

      Returns: the first element remaining beyond the removed elements, or end() if no such element exists.

      Throws: Nothing.

      @@ -513,7 +513,7 @@ 
    40. template<typename Disposer> 
-  iterator erase_after_and_dispose(const_iterator prev, Disposer disposer);
      + iterator erase_after_and_dispose(const_iterator prev, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases the element after the element pointed by prev of the list. Disposer::operator()(pointer) is called for the removed element.

      Returns: the first element remaining beyond the removed elements, or end() if no such element exists.

      @@ -523,7 +523,7 @@ 
    41. template<typename Disposer> 
-  iterator erase_after_and_dispose(const_iterator before_f, const_iterator l, 
+  iterator erase_after_and_dispose(const_iterator before_f, const_iterator l, 
                                    Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases the range (before_f, l) from the list. Disposer::operator()(pointer) is called for the removed elements.

      @@ -534,7 +534,7 @@ 
    42. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator i, Disposer disposer);
      + iterator erase_and_dispose(const_iterator i, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases the element pointed by i of the list. No destructors are called. Disposer::operator()(pointer) is called for the removed element.

      Returns: the first element remaining beyond the removed element, or end() if no such element exists.

      @@ -544,7 +544,7 @@ 
    43. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator f, const_iterator l, 
+  iterator erase_and_dispose(const_iterator f, const_iterator l, 
                              Disposer disposer);

      Requires: f and l must be valid iterator to elements in *this. Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases the range pointed by b and e. No destructors are called. Disposer::operator()(pointer) is called for the removed elements.

      @@ -554,7 +554,7 @@

      Note: Invalidates the iterators (but not the references) to the erased elements.

    44. -
      template<typename Iterator> void assign(Iterator b, Iterator e);
      +
      template<typename Iterator> void assign(Iterator b, Iterator e);

      Requires: Dereferencing iterator must yield an lvalue of type value_type.

      Effects: Clears the list and inserts the range pointed by b and e. No destructors or copy constructors are called.

      Throws: Nothing.

      @@ -563,7 +563,7 @@ 
    45. template<typename Iterator, typename Disposer> 
-  void dispose_and_assign(Disposer disposer, Iterator b, Iterator e);
      + void dispose_and_assign(Disposer disposer, Iterator b, Iterator e);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Requires: Dereferencing iterator must yield an lvalue of type value_type.

      Effects: Clears the list and inserts the range pointed by b and e. No destructors or copy constructors are called. Disposer::operator()(pointer) is called for the removed elements.

      @@ -572,7 +572,7 @@

      Note: Invalidates the iterators (but not the references) to the erased elements.

    46. -
      void splice_after(const_iterator prev, slist & x, const_iterator * l = 0);
      +
      void splice_after(const_iterator prev, slist & x, const_iterator * l = 0);

      Requires: prev must point to an element contained by this list or to the before_begin() element

      Effects: Transfers all the elements of list x to this list, after the the element pointed by prev. No destructors or copy constructors are called.

      Returns: Nothing.

      @@ -582,7 +582,7 @@

      Additional note: If the optional parameter "l" is provided, it will be assigned to the last spliced element or prev if x is empty. This iterator can be used as new "prev" iterator for a new splice_after call. that will splice new values after the previously spliced values.

    47. -
      void splice_after(const_iterator prev_pos, slist & x, const_iterator prev_ele);
      +
      void splice_after(const_iterator prev_pos, slist & x, const_iterator prev_ele);

      Requires: prev must point to an element contained by this list or to the before_begin() element. prev_ele must point to an element contained in list x or must be x.before_begin().

      Effects: Transfers the element after prev_ele, from list x to this list, after the element pointed by prev. No destructors or copy constructors are called.

      Throws: Nothing.

      @@ -590,7 +590,7 @@

      Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.

    48. -
      void splice_after(const_iterator prev_pos, slist & x, const_iterator before_f, 
+
      void splice_after(const_iterator prev_pos, slist & x, const_iterator before_f, 
                   const_iterator before_l);
      
 
      Requires: prev_pos must be a dereferenceable iterator in *this or be before_begin(), and before_f and before_l belong to x and ++before_f != x.end() && before_l != x.end().
      
 
      Effects: Transfers the range (before_f, before_l] from list x to this list, after the element pointed by prev_pos. No destructors or copy constructors are called.
      
@@ -599,7 +599,7 @@
 
      Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.
    49. -
      void splice_after(const_iterator prev_pos, slist & x, const_iterator before_f, 
+
      void splice_after(const_iterator prev_pos, slist & x, const_iterator before_f, 
                   const_iterator before_l, size_type n);
      
 
      Requires: prev_pos must be a dereferenceable iterator in *this or be before_begin(), and before_f and before_l belong to x and ++before_f != x.end() && before_l != x.end() and n == distance(before_f, before_l).
      
 
      Effects: Transfers the range (before_f, before_l] from list x to this list, after the element pointed by p. No destructors or copy constructors are called.
      
@@ -608,7 +608,7 @@
 
      Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.
    50. -
      void splice(const_iterator it, slist & x, const_iterator * l = 0);
      +
      void splice(const_iterator it, slist & x, const_iterator * l = 0);

      Requires: it is an iterator to an element in *this.

      Effects: Transfers all the elements of list x to this list, before the the element pointed by it. No destructors or copy constructors are called.

      Returns: Nothing.

      @@ -618,7 +618,7 @@

      Additional note: If the optional parameter "l" is provided, it will be assigned to the last spliced element or prev if x is empty. This iterator can be used as new "prev" iterator for a new splice_after call. that will splice new values after the previously spliced values.

    51. -
      void splice(const_iterator pos, slist & x, const_iterator elem);
      +
      void splice(const_iterator pos, slist & x, const_iterator elem);

      Requires: it p must be a valid iterator of *this. elem must point to an element contained in list x.

      Effects: Transfers the element elem, from list x to this list, before the element pointed by pos. No destructors or copy constructors are called.

      Throws: Nothing.

      @@ -626,7 +626,7 @@

      Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.

    52. -
      void splice(const_iterator pos, slist & x, const_iterator f, const_iterator l);
      +
      void splice(const_iterator pos, slist & x, const_iterator f, const_iterator l);

      Requires: pos must be a dereferenceable iterator in *this and f and f belong to x and f and f a valid range on x.

      Effects: Transfers the range [f, l) from list x to this list, before the element pointed by pos. No destructors or copy constructors are called.

      Throws: Nothing.

      @@ -634,7 +634,7 @@

      Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.

    53. -
      void splice(const_iterator pos, slist & x, const_iterator f, const_iterator l, 
+
      void splice(const_iterator pos, slist & x, const_iterator f, const_iterator l, 
             size_type n);
      
 
      Requires: pos must be a dereferenceable iterator in *this and f and l belong to x and f and l a valid range on x. n == distance(f, l).
      
 
      Effects: Transfers the range [f, l) from list x to this list, before the element pointed by pos. No destructors or copy constructors are called.
      
@@ -643,14 +643,14 @@
 
      Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.
    54. -
      template<typename Predicate> void sort(Predicate p);
      +
      template<typename Predicate> void sort(Predicate p);

      Effects: This function sorts the list *this according to std::less<value_type>. The sort is stable, that is, the relative order of equivalent elements is preserved.

      Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the predicate throws. Basic guarantee.

      Complexity: The number of comparisons is approximately N log N, where N is the list's size.

      Note: Iterators and references are not invalidated

    55. -
      void sort();
      +
      void sort();

      Requires: p must be a comparison function that induces a strict weak ordering and both *this and x must be sorted according to that ordering The lists x and *this must be distinct.

      Effects: This function removes all of x's elements and inserts them in order into *this. The merge is stable; that is, if an element from *this is equivalent to one from x, then the element from *this will precede the one from x.

      Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or std::less<value_type> throws. Basic guarantee.

      @@ -659,7 +659,7 @@ 
    56. template<typename Predicate> 
-  void merge(slist & x, Predicate p, const_iterator * l = 0);
      + void merge(slist & x, Predicate p, const_iterator * l = 0);

      Requires: p must be a comparison function that induces a strict weak ordering and both *this and x must be sorted according to that ordering The lists x and *this must be distinct.

      Effects: This function removes all of x's elements and inserts them in order into *this. The merge is stable; that is, if an element from *this is equivalent to one from x, then the element from *this will precede the one from x.

      Returns: Nothing.

      @@ -669,21 +669,21 @@

      Additional note: If optional "l" argument is passed, it is assigned to an iterator to the last transferred value or end() is x is empty.

    57. -
      void merge(slist & x);
      +
      void merge(slist & x);

      Effects: This function removes all of x's elements and inserts them in order into *this according to std::less<value_type>. The merge is stable; that is, if an element from *this is equivalent to one from x, then the element from *this will precede the one from x.

      Throws: if std::less<value_type> throws. Basic guarantee.

      Complexity: This function is linear time: it performs at most size() + x.size() - 1 comparisons.

      Note: Iterators and references are not invalidated

    58. -
      void reverse();
      +
      void reverse();

      Effects: Reverses the order of elements in the list.

      Throws: Nothing.

      Complexity: This function is linear to the contained elements.

      Note: Iterators and references are not invalidated

    59. -
      void remove(const_reference value);
      +
      void remove(const_reference value);

      Effects: Removes all the elements that compare equal to value. No destructors are called.

      Throws: If std::equal_to<value_type> throws. Basic guarantee.

      Complexity: Linear time. It performs exactly size() comparisons for equality.

      @@ -691,7 +691,7 @@ 
    60. template<typename Disposer> 
-  void remove_and_dispose(const_reference value, Disposer disposer);
      + void remove_and_dispose(const_reference value, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Removes all the elements that compare equal to value. Disposer::operator()(pointer) is called for every removed element.

      Throws: If std::equal_to<value_type> throws. Basic guarantee.

      @@ -699,7 +699,7 @@

      Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid.

    61. -
      template<typename Pred> void remove_if(Pred pred);
      +
      template<typename Pred> void remove_if(Pred pred);

      Effects: Removes all the elements for which a specified predicate is satisfied. No destructors are called.

      Throws: If pred throws. Basic guarantee.

      Complexity: Linear time. It performs exactly size() calls to the predicate.

      @@ -707,7 +707,7 @@ 
    62. template<typename Pred, typename Disposer> 
-  void remove_and_dispose_if(Pred pred, Disposer disposer);
      + void remove_and_dispose_if(Pred pred, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Removes all the elements for which a specified predicate is satisfied. Disposer::operator()(pointer) is called for every removed element.

      Throws: If pred throws. Basic guarantee.

      @@ -715,21 +715,21 @@

      Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid.

    63. -
      void unique();
      +
      void unique();

      Effects: Removes adjacent duplicate elements or adjacent elements that are equal from the list. No destructors are called.

      Throws: If std::equal_to<value_type> throws. Basic guarantee.

      Complexity: Linear time (size()-1) comparisons calls to pred()).

      Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid.

    64. -
      template<typename BinaryPredicate> void unique(BinaryPredicate pred);
      +
      template<typename BinaryPredicate> void unique(BinaryPredicate pred);

      Effects: Removes adjacent duplicate elements or adjacent elements that satisfy some binary predicate from the list. No destructors are called.

      Throws: If the predicate throws. Basic guarantee.

      Complexity: Linear time (size()-1) comparisons equality comparisons.

      Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid.

    65. -
      template<typename Disposer> void unique_and_dispose(Disposer disposer);
      +
      template<typename Disposer> void unique_and_dispose(Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Removes adjacent duplicate elements or adjacent elements that satisfy some binary predicate from the list. Disposer::operator()(pointer) is called for every removed element.

      Throws: If std::equal_to<value_type> throws. Basic guarantee.

      @@ -738,7 +738,7 @@ 
    66. template<typename BinaryPredicate, typename Disposer> 
-  void unique_and_dispose(BinaryPredicate pred, Disposer disposer);
      + void unique_and_dispose(BinaryPredicate pred, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Removes adjacent duplicate elements or adjacent elements that satisfy some binary predicate from the list. Disposer::operator()(pointer) is called for every removed element.

      Throws: If the predicate throws. Basic guarantee.

      @@ -746,7 +746,7 @@

      Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid.

    67. -
      iterator iterator_to(reference value);
      +
      iterator iterator_to(reference value);

      Requires: value must be a reference to a value inserted in a list.

      Effects: This function returns a const_iterator pointing to the element

      Throws: Nothing.

      @@ -754,7 +754,7 @@

      Note: Iterators and references are not invalidated.

    68. -
      const_iterator iterator_to(const_reference value) const;
      +
      const_iterator iterator_to(const_reference value) const;

      Requires: value must be a const reference to a value inserted in a list.

      Effects: This function returns an iterator pointing to the element.

      Throws: Nothing.

      @@ -762,31 +762,31 @@

      Note: Iterators and references are not invalidated.

    69. -
      iterator previous(iterator i);
      +
      iterator previous(iterator i);

      Returns: The iterator to the element before i in the list. Returns the end-iterator, if either i is the begin-iterator or the list is empty.

      Throws: Nothing.

      Complexity: Linear to the number of elements before i. Constant if cache_last<> is true and i == end().

    70. -
      const_iterator previous(const_iterator i) const;
      +
      const_iterator previous(const_iterator i) const;

      Returns: The const_iterator to the element before i in the list. Returns the end-const_iterator, if either i is the begin-const_iterator or the list is empty.

      Throws: Nothing.

      Complexity: Linear to the number of elements before i. Constant if cache_last<> is true and i == end().

    71. -
      iterator previous(const_iterator prev_from, iterator i);
      +
      iterator previous(const_iterator prev_from, iterator i);

      Returns: The iterator to the element before i in the list, starting the search on element after prev_from. Returns the end-iterator, if either i is the begin-iterator or the list is empty.

      Throws: Nothing.

      Complexity: Linear to the number of elements before i. Constant if cache_last<> is true and i == end().

    72. -
      const_iterator previous(const_iterator prev_from, const_iterator i) const;
      +
      const_iterator previous(const_iterator prev_from, const_iterator i) const;

      Returns: The const_iterator to the element before i in the list, starting the search on element after prev_from. Returns the end-const_iterator, if either i is the begin-const_iterator or the list is empty.

      Throws: Nothing.

      Complexity: Linear to the number of elements before i. Constant if cache_last<> is true and i == end().

    73. -
      void check() const;
      +
      void check() const;

      Effects: Asserts the integrity of the container.

      Complexity: Linear time.

      Note: The method has no effect when asserts are turned off (e.g., with NDEBUG). Experimental function, interface might change in future versions.

      @@ -794,25 +794,25 @@
    -

    -slist public static functions

    +

    +slist public static functions

    1. -
      static slist & container_from_end_iterator(iterator end_iterator);
      +
      static slist & container_from_end_iterator(iterator end_iterator);

      Precondition: end_iterator must be a valid end iterator of slist.

      Effects: Returns a const reference to the slist associated to the end iterator

      Throws: Nothing.

      Complexity: Constant.

    2. -
      static const slist & container_from_end_iterator(const_iterator end_iterator);
      +
      static const slist & container_from_end_iterator(const_iterator end_iterator);

      Precondition: end_iterator must be a valid end const_iterator of slist.

      Effects: Returns a const reference to the slist associated to the end iterator

      Throws: Nothing.

      Complexity: Constant.

    3. -
      static iterator s_iterator_to(reference value);
      +
      static iterator s_iterator_to(reference value);

      Requires: value must be a reference to a value inserted in a list.

      Effects: This function returns a const_iterator pointing to the element

      Throws: Nothing.

      @@ -820,7 +820,7 @@

      Note: Iterators and references are not invalidated. This static function is available only if the value traits is stateless.

    4. -
      static const_iterator s_iterator_to(const_reference value);
      +
      static const_iterator s_iterator_to(const_reference value);

      Requires: value must be a const reference to a value inserted in a list.

      Effects: This function returns an iterator pointing to the element.

      Throws: Nothing.

      @@ -830,34 +830,34 @@
    -

    -slist private member functions

    +

    +slist private member functions

      -
    1. void priv_splice_after(const node_ptr & prev_pos_n, slist & x, 
+
    2. void priv_splice_after(const node_ptr & prev_pos_n, slist & x, 
                        const node_ptr & before_f_n, 
                        const node_ptr & before_l_n);
      3. 
-
    3. void priv_incorporate_after(const node_ptr & prev_pos_n, 
+
    4. void priv_incorporate_after(const node_ptr & prev_pos_n, 
                             const node_ptr & first_n, 
                             const node_ptr & before_l_n);
      5. 
-
    5. void priv_reverse(unspecified);
      6. 
-
    6. void priv_reverse(unspecified);
      7. 
-
    7. void priv_shift_backwards(size_type n, unspecified);
      8. 
-
    8. void priv_shift_backwards(size_type n, unspecified);
      9. 
-
    9. void priv_shift_forward(size_type n, unspecified);
      10. 
-
    10. void priv_shift_forward(size_type n, unspecified);
      11. 
+
    11. void priv_reverse(unspecified);
      12. 
+
    12. void priv_reverse(unspecified);
      13. 
+
    13. void priv_shift_backwards(size_type n, unspecified);
      14. 
+
    14. void priv_shift_backwards(size_type n, unspecified);
      15. 
+
    15. void priv_shift_forward(size_type n, unspecified);
      16. 
+
    16. void priv_shift_forward(size_type n, unspecified);
      17.
    -

    -slist private static functions

    +

    +slist private static functions

      -
    1. static void priv_swap_cache_last(slist * this_impl, slist * other_impl);
      2. -
    2. static void priv_swap_lists(const node_ptr & this_node, 
+
    3. static void priv_swap_cache_last(slist * this_impl, slist * other_impl);
      4. 
+
    4. static void priv_swap_lists(const node_ptr & this_node, 
                             const node_ptr & other_node, unspecified);
      5. 
-
    5. static void priv_swap_lists(const node_ptr & this_node, 
+
    6. static void priv_swap_lists(const node_ptr & this_node, 
                             const node_ptr & other_node, unspecified);
      7. 
 
    7. static slist & 
-priv_container_from_end_iterator(const const_iterator & end_iterator);
      8. 
+priv_container_from_end_iterator(const const_iterator & end_iterator);
      8.
    diff --git a/doc/html/boost/intrusive/slist_base_hook.html b/doc/html/boost/intrusive/slist_base_hook.html index 7b2530bcd9..49fae55cc1 100644 --- a/doc/html/boost/intrusive/slist_base_hook.html +++ b/doc/html/boost/intrusive/slist_base_hook.html @@ -36,71 +36,71 @@ class slist_base_hook : public make_slist_base_hook::type< O1, O2, O3 > { public: // construct/copy/destruct - slist_base_hook(); - slist_base_hook(const slist_base_hook &); - slist_base_hook & operator=(const slist_base_hook &); - ~slist_base_hook(); + slist_base_hook(); + slist_base_hook(const slist_base_hook &); + slist_base_hook & operator=(const slist_base_hook &); + ~slist_base_hook(); - // public member functions - void swap_nodes(slist_base_hook &); - bool is_linked() const; - void unlink(); + // public member functions + void swap_nodes(slist_base_hook &); + bool is_linked() const; + void unlink(); };
    -

    Description

    +

    Description

    Derive a class from slist_base_hook in order to store objects in in an list. slist_base_hook holds the data necessary to maintain the list and provides an appropriate value_traits class for list.

    The hook admits the following options: tag<>, void_pointer<> and link_mode<>.

    tag<> defines a tag to identify the node. The same tag value can be used in different classes, but if a class is derived from more than one list_base_hook, then each list_base_hook needs its unique tag.

    link_mode<> will specify the linking mode of the hook (normal_link, auto_unlink or safe_link).

    void_pointer<> is the pointer type that will be used internally in the hook and the container configured to use this hook.

    -

    +

    slist_base_hook public construct/copy/destruct

    1. -
      slist_base_hook();
      +
      slist_base_hook();

      Effects: If link_mode is auto_unlink or safe_link initializes the node to an unlinked state.

      Throws: Nothing.

    2. -
      slist_base_hook(const slist_base_hook &);
      +
      slist_base_hook(const slist_base_hook &);

      Effects: If link_mode is auto_unlink or safe_link initializes the node to an unlinked state. The argument is ignored.

      Throws: Nothing.

      Rationale: Providing a copy-constructor makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

    3. -
      slist_base_hook & operator=(const slist_base_hook &);
      +
      slist_base_hook & operator=(const slist_base_hook &);

      Effects: Empty function. The argument is ignored.

      Throws: Nothing.

      Rationale: Providing an assignment operator makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

    4. -
      ~slist_base_hook();
      +
      ~slist_base_hook();

      Effects: If link_mode is normal_link, the destructor does nothing (ie. no code is generated). If link_mode is safe_link and the object is stored in an slist an assertion is raised. If link_mode is auto_unlink and is_linked() is true, the node is unlinked.

      Throws: Nothing.

    -

    -slist_base_hook public member functions

    +

    +slist_base_hook public member functions

    1. -
      void swap_nodes(slist_base_hook & other);
      +
      void swap_nodes(slist_base_hook & other);

      Effects: Swapping two nodes swaps the position of the elements related to those nodes in one or two containers. That is, if the node this is part of the element e1, the node x is part of the element e2 and both elements are included in the containers s1 and s2, then after the swap-operation e1 is in s2 at the position of e2 and e2 is in s1 at the position of e1. If one element is not in a container, then after the swap-operation the other element is not in a container. Iterators to e1 and e2 related to those nodes are invalidated.

      Complexity: Constant

      Throws: Nothing.

    2. -
      bool is_linked() const;
      +
      bool is_linked() const;

      Precondition: link_mode must be safe_link or auto_unlink.

      Returns: true, if the node belongs to a container, false otherwise. This function can be used to test whether slist::iterator_to will return a valid iterator.

      Complexity: Constant

    3. -
      void unlink();
      +
      void unlink();

      Effects: Removes the node if it's inserted in a container. This function is only allowed if link_mode is auto_unlink.

      Throws: Nothing.

      4. diff --git a/doc/html/boost/intrusive/slist_member_hook.html b/doc/html/boost/intrusive/slist_member_hook.html index e3d4343a41..208fd0665f 100644 --- a/doc/html/boost/intrusive/slist_member_hook.html +++ b/doc/html/boost/intrusive/slist_member_hook.html @@ -36,70 +36,70 @@ class slist_member_hook : public make_slist_member_hook::type< O1, O2, O3 > { public: // construct/copy/destruct - slist_member_hook(); - slist_member_hook(const slist_member_hook &); - slist_member_hook & operator=(const slist_member_hook &); - ~slist_member_hook(); + slist_member_hook(); + slist_member_hook(const slist_member_hook &); + slist_member_hook & operator=(const slist_member_hook &); + ~slist_member_hook(); - // public member functions - void swap_nodes(slist_member_hook &); - bool is_linked() const; - void unlink(); + // public member functions + void swap_nodes(slist_member_hook &); + bool is_linked() const; + void unlink(); };
    -

    Description

    +

    Description

    Put a public data member slist_member_hook in order to store objects of this class in an list. slist_member_hook holds the data necessary for maintaining the list and provides an appropriate value_traits class for list.

    The hook admits the following options: void_pointer<> and link_mode<>.

    link_mode<> will specify the linking mode of the hook (normal_link, auto_unlink or safe_link).

    void_pointer<> is the pointer type that will be used internally in the hook and the container configured to use this hook.

    -

    +

    slist_member_hook public construct/copy/destruct

    1. -
      slist_member_hook();
      +
      slist_member_hook();

      Effects: If link_mode is auto_unlink or safe_link initializes the node to an unlinked state.

      Throws: Nothing.

    2. -
      slist_member_hook(const slist_member_hook &);
      +
      slist_member_hook(const slist_member_hook &);

      Effects: If link_mode is auto_unlink or safe_link initializes the node to an unlinked state. The argument is ignored.

      Throws: Nothing.

      Rationale: Providing a copy-constructor makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

    3. -
      slist_member_hook & operator=(const slist_member_hook &);
      +
      slist_member_hook & operator=(const slist_member_hook &);

      Effects: Empty function. The argument is ignored.

      Throws: Nothing.

      Rationale: Providing an assignment operator makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

    4. -
      ~slist_member_hook();
      +
      ~slist_member_hook();

      Effects: If link_mode is normal_link, the destructor does nothing (ie. no code is generated). If link_mode is safe_link and the object is stored in an slist an assertion is raised. If link_mode is auto_unlink and is_linked() is true, the node is unlinked.

      Throws: Nothing.

    -

    -slist_member_hook public member functions

    +

    +slist_member_hook public member functions

    1. -
      void swap_nodes(slist_member_hook & other);
      +
      void swap_nodes(slist_member_hook & other);

      Effects: Swapping two nodes swaps the position of the elements related to those nodes in one or two containers. That is, if the node this is part of the element e1, the node x is part of the element e2 and both elements are included in the containers s1 and s2, then after the swap-operation e1 is in s2 at the position of e2 and e2 is in s1 at the position of e1. If one element is not in a container, then after the swap-operation the other element is not in a container. Iterators to e1 and e2 related to those nodes are invalidated.

      Complexity: Constant

      Throws: Nothing.

    2. -
      bool is_linked() const;
      +
      bool is_linked() const;

      Precondition: link_mode must be safe_link or auto_unlink.

      Returns: true, if the node belongs to a container, false otherwise. This function can be used to test whether slist::iterator_to will return a valid iterator.

      Complexity: Constant

    3. -
      void unlink();
      +
      void unlink();

      Effects: Removes the node if it's inserted in a container. This function is only allowed if link_mode is auto_unlink.

      Throws: Nothing.

      4. diff --git a/doc/html/boost/intrusive/splay_multiset.html b/doc/html/boost/intrusive/splay_multiset.html index 9e4cf1e36b..94f6cc1645 100644 --- a/doc/html/boost/intrusive/splay_multiset.html +++ b/doc/html/boost/intrusive/splay_multiset.html @@ -60,137 +60,137 @@ typedef implementation_defined::node_algorithms node_algorithms; // construct/copy/destruct - explicit splay_multiset(const key_compare & = key_compare(), + explicit splay_multiset(const key_compare & = key_compare(), const value_traits & = value_traits()); template<typename Iterator> - splay_multiset(Iterator, Iterator, const key_compare & = key_compare(), + splay_multiset(Iterator, Iterator, const key_compare & = key_compare(), const value_traits & = value_traits()); - splay_multiset(splay_multiset &&); - splay_multiset & operator=(splay_multiset &&); - ~splay_multiset(); + splay_multiset(splay_multiset &&); + splay_multiset & operator=(splay_multiset &&); + ~splay_multiset(); - // public member functions - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end(); - const_iterator end() const; - const_iterator cend() const; - reverse_iterator rbegin(); - const_reverse_iterator rbegin() const; - const_reverse_iterator crbegin() const; - reverse_iterator rend(); - const_reverse_iterator rend() const; - const_reverse_iterator crend() const; - key_compare key_comp() const; - value_compare value_comp() const; - bool empty() const; - size_type size() const; - void swap(splay_multiset &); + // public member functions + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end(); + const_iterator end() const; + const_iterator cend() const; + reverse_iterator rbegin(); + const_reverse_iterator rbegin() const; + const_reverse_iterator crbegin() const; + reverse_iterator rend(); + const_reverse_iterator rend() const; + const_reverse_iterator crend() const; + key_compare key_comp() const; + value_compare value_comp() const; + bool empty() const; + size_type size() const; + void swap(splay_multiset &); template<typename Cloner, typename Disposer> - void clone_from(const splay_multiset &, Cloner, Disposer); + void clone_from(const splay_multiset &, Cloner, Disposer); template<typename Cloner, typename Disposer> - void clone_from(splay_multiset &&, Cloner, Disposer); - iterator insert(reference); - iterator insert(const_iterator, reference); - template<typename Iterator> void insert(Iterator, Iterator); - iterator insert_before(const_iterator, reference); - void push_back(reference); - void push_front(reference); - iterator erase(const_iterator); - iterator erase(const_iterator, const_iterator); - size_type erase(const key_type &); + void clone_from(splay_multiset &&, Cloner, Disposer); + iterator insert(reference); + iterator insert(const_iterator, reference); + template<typename Iterator> void insert(Iterator, Iterator); + iterator insert_before(const_iterator, reference); + void push_back(reference); + void push_front(reference); + iterator erase(const_iterator); + iterator erase(const_iterator, const_iterator); + size_type erase(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - size_type erase(const KeyType &, KeyTypeKeyCompare); + size_type erase(const KeyType &, KeyTypeKeyCompare); template<typename Disposer> - iterator erase_and_dispose(const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, Disposer); template<typename Disposer> - iterator erase_and_dispose(const_iterator, const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, const_iterator, Disposer); template<typename Disposer> - size_type erase_and_dispose(const key_type &, Disposer); + size_type erase_and_dispose(const key_type &, Disposer); template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> - size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); - void clear(); - template<typename Disposer> void clear_and_dispose(Disposer); - size_type count(const key_type &); + size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); + void clear(); + template<typename Disposer> void clear_and_dispose(Disposer); + size_type count(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - size_type count(const KeyType &, KeyTypeKeyCompare); - iterator lower_bound(const key_type &); + size_type count(const KeyType &, KeyTypeKeyCompare); + iterator lower_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator lower_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator lower_bound(const key_type &) const; + iterator lower_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator lower_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator upper_bound(const key_type &); + const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator upper_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator upper_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator upper_bound(const key_type &) const; + iterator upper_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator upper_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator find(const key_type &); + const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator find(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator find(const KeyType &, KeyTypeKeyCompare); - const_iterator find(const key_type &) const; + iterator find(const KeyType &, KeyTypeKeyCompare); + const_iterator find(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator find(const KeyType &, KeyTypeKeyCompare) const; - std::pair< iterator, iterator > equal_range(const key_type &); + const_iterator find(const KeyType &, KeyTypeKeyCompare) const; + std::pair< iterator, iterator > equal_range(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - equal_range(const KeyType &, KeyTypeKeyCompare); + equal_range(const KeyType &, KeyTypeKeyCompare); std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; + equal_range(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - equal_range(const KeyType &, KeyTypeKeyCompare) const; + equal_range(const KeyType &, KeyTypeKeyCompare) const; std::pair< iterator, iterator > - bounded_range(const_reference, const_reference, bool, bool); + bounded_range(const_reference, const_reference, bool, bool); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool); std::pair< const_iterator, const_iterator > - bounded_range(const_reference, const_reference, bool, bool) const; + bounded_range(const_reference, const_reference, bool, bool) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool) const; - iterator iterator_to(reference); - const_iterator iterator_to(const_reference) const; - pointer unlink_leftmost_without_rebalance(); - void replace_node(iterator, reference); - void remove_node(reference); - void splay_up(iterator); + iterator iterator_to(reference); + const_iterator iterator_to(const_reference) const; + pointer unlink_leftmost_without_rebalance(); + void replace_node(iterator, reference); + void remove_node(reference); + void splay_up(iterator); template<typename KeyType, typename KeyTypeKeyCompare> - iterator splay_down(const KeyType &, KeyTypeKeyCompare); - iterator splay_down(const key_type &); - void rebalance(); - iterator rebalance_subtree(iterator); + iterator splay_down(const KeyType &, KeyTypeKeyCompare); + iterator splay_down(const key_type &); + void rebalance(); + iterator rebalance_subtree(iterator); - // public static functions - static splay_multiset & container_from_end_iterator(iterator); - static const splay_multiset & container_from_end_iterator(const_iterator); - static splay_multiset & container_from_iterator(iterator); - static const splay_multiset & container_from_iterator(const_iterator); - static iterator s_iterator_to(reference); - static const_iterator s_iterator_to(const_reference); - static void init_node(reference); + // public static functions + static splay_multiset & container_from_end_iterator(iterator); + static const splay_multiset & container_from_end_iterator(const_iterator); + static splay_multiset & container_from_iterator(iterator); + static const splay_multiset & container_from_iterator(const_iterator); + static iterator s_iterator_to(reference); + static const_iterator s_iterator_to(const_reference); + static void init_node(reference); // public data members static const bool constant_time_size; };
    -

    Description

    +

    Description

    The class template splay_multiset is an intrusive container, that mimics most of the interface of std::multiset as described in the C++ standard.

    The template parameter T is the type to be managed by the container. The user can specify additional options and if no options are provided default options are used.

    The container supports the following options: base_hook<>/member_hook<>/value_traits<>, constant_time_size<>, size_type<> and compare<>.

    -

    +

    splay_multiset public construct/copy/destruct

    1. -
      explicit splay_multiset(const key_compare & cmp = key_compare(), 
+
      explicit splay_multiset(const key_compare & cmp = key_compare(), 
                         const value_traits & v_traits = value_traits());
      
 
      Effects: Constructs an empty container.
      
 
      Complexity: Constant.
      
@@ -198,7 +198,7 @@
 
    2. template<typename Iterator> 
-  splay_multiset(Iterator b, Iterator e, 
+  splay_multiset(Iterator b, Iterator e, 
                  const key_compare & cmp = key_compare(), 
                  const value_traits & v_traits = value_traits());

      Requires: Dereferencing iterator must yield an lvalue of type value_type. cmp must be a comparison function that induces a strict weak ordering.

      @@ -207,15 +207,15 @@

      Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor/operator() of the key_compare object throws. Basic guarantee.

    3. -
      splay_multiset(splay_multiset && x);
      +
      splay_multiset(splay_multiset && x);

      Effects: to-do

    4. -
      splay_multiset & operator=(splay_multiset && x);
      +
      splay_multiset & operator=(splay_multiset && x);

      Effects: to-do

    5. -
      ~splay_multiset();
      +
      ~splay_multiset();

      Effects: Detaches all elements from this. The objects in the set are not deleted (i.e. no destructors are called), but the nodes according to the value_traits template parameter are reinitialized and thus can be reused.

      Complexity: Linear to elements contained in *this.

      Throws: Nothing.

      @@ -223,114 +223,114 @@
    -

    -splay_multiset public member functions

    +

    +splay_multiset public member functions

    1. -
      iterator begin();
      +
      iterator begin();

      Effects: Returns an iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    2. -
      const_iterator begin() const;
      +
      const_iterator begin() const;

      Effects: Returns a const_iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    3. -
      const_iterator cbegin() const;
      +
      const_iterator cbegin() const;

      Effects: Returns a const_iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    4. -
      iterator end();
      +
      iterator end();

      Effects: Returns an iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    5. -
      const_iterator end() const;
      +
      const_iterator end() const;

      Effects: Returns a const_iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    6. -
      const_iterator cend() const;
      +
      const_iterator cend() const;

      Effects: Returns a const_iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    7. -
      reverse_iterator rbegin();
      +
      reverse_iterator rbegin();

      Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    8. -
      const_reverse_iterator rbegin() const;
      +
      const_reverse_iterator rbegin() const;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    9. -
      const_reverse_iterator crbegin() const;
      +
      const_reverse_iterator crbegin() const;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    10. -
      reverse_iterator rend();
      +
      reverse_iterator rend();

      Effects: Returns a reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    11. -
      const_reverse_iterator rend() const;
      +
      const_reverse_iterator rend() const;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    12. -
      const_reverse_iterator crend() const;
      +
      const_reverse_iterator crend() const;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    13. -
      key_compare key_comp() const;
      +
      key_compare key_comp() const;

      Effects: Returns the key_compare object used by the container.

      Complexity: Constant.

      Throws: If key_compare copy-constructor throws.

    14. -
      value_compare value_comp() const;
      +
      value_compare value_comp() const;

      Effects: Returns the value_compare object used by the container.

      Complexity: Constant.

      Throws: If value_compare copy-constructor throws.

    15. -
      bool empty() const;
      +
      bool empty() const;

      Effects: Returns true if the container is empty.

      Complexity: Constant.

      Throws: Nothing.

    16. -
      size_type size() const;
      +
      size_type size() const;

      Effects: Returns the number of elements stored in the container.

      Complexity: Linear to elements contained in *this if constant-time size option is disabled. Constant time otherwise.

      Throws: Nothing.

    17. -
      void swap(splay_multiset & other);
      +
      void swap(splay_multiset & other);

      Effects: Swaps the contents of two containers.

      Complexity: Constant.

      Throws: If the comparison functor's swap call throws. 

    18. template<typename Cloner, typename Disposer> 
-  void clone_from(const splay_multiset & src, Cloner cloner, 
+  void clone_from(const splay_multiset & src, Cloner cloner, 
                   Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

      Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(const_reference ) and inserts them on *this. Copies the predicate from the source container.

      @@ -340,7 +340,7 @@ 
    19. template<typename Cloner, typename Disposer> 
-  void clone_from(splay_multiset && src, Cloner cloner, Disposer disposer);
      + void clone_from(splay_multiset && src, Cloner cloner, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

      Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(reference) and inserts them on *this. Copies the predicate from the source container.

      If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

      @@ -349,7 +349,7 @@

      Note: This version can modify the source container, useful to implement move semantics.

    20. -
      iterator insert(reference value);
      +
      iterator insert(reference value);

      Requires: value must be an lvalue

      Effects: Inserts value into the container before the upper bound.

      Complexity: Average complexity for insert element is at most logarithmic.

      @@ -357,7 +357,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    21. -
      iterator insert(const_iterator hint, reference value);
      +
      iterator insert(const_iterator hint, reference value);

      Requires: value must be an lvalue, and "hint" must be a valid iterator.

      Effects: Inserts x into the container, using "hint" as a hint to where it will be inserted. If "hint" is the upper_bound the insertion takes constant time (two comparisons in the worst case)

      Complexity: Logarithmic in general, but it is amortized constant time if t is inserted immediately before hint.

      @@ -365,7 +365,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    22. -
      template<typename Iterator> void insert(Iterator b, Iterator e);
      +
      template<typename Iterator> void insert(Iterator b, Iterator e);

      Requires: Dereferencing iterator must yield an lvalue of type value_type.

      Effects: Inserts a each element of a range into the container before the upper bound of the key of each element.

      Complexity: Insert range is in general O(N * log(N)), where N is the size of the range. However, it is linear in N if the range is already sorted by value_comp().

      @@ -373,7 +373,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    23. -
      iterator insert_before(const_iterator pos, reference value);
      +
      iterator insert_before(const_iterator pos, reference value);

      Requires: value must be an lvalue, "pos" must be a valid iterator (or end) and must be the succesor of value once inserted according to the predicate

      Effects: Inserts x into the container before "pos".

      Complexity: Constant time.

      @@ -381,7 +381,7 @@

      Note: This function does not check preconditions so if "pos" is not the successor of "value" container ordering invariant will be broken. This is a low-level function to be used only for performance reasons by advanced users.

    24. -
      void push_back(reference value);
      +
      void push_back(reference value);

      Requires: value must be an lvalue, and it must be no less than the greatest inserted key

      Effects: Inserts x into the container in the last position.

      Complexity: Constant time.

      @@ -389,7 +389,7 @@

      Note: This function does not check preconditions so if value is less than the greatest inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

    25. -
      void push_front(reference value);
      +
      void push_front(reference value);

      Requires: value must be an lvalue, and it must be no greater than the minimum inserted key

      Effects: Inserts x into the container in the first position.

      Complexity: Constant time.

      @@ -397,21 +397,21 @@

      Note: This function does not check preconditions so if value is greater than the minimum inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

    26. -
      iterator erase(const_iterator i);
      +
      iterator erase(const_iterator i);

      Effects: Erases the element pointed to by i.

      Complexity: Average complexity for erase element is constant time.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    27. -
      iterator erase(const_iterator b, const_iterator e);
      +
      iterator erase(const_iterator b, const_iterator e);

      Effects: Erases the range pointed to by b end e.

      Complexity: Average complexity for erase range is at most O(log(size() + N)), where N is the number of elements in the range.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    28. -
      size_type erase(const key_type & key);
      +
      size_type erase(const key_type & key);

      Effects: Erases all the elements with the given value.

      Returns: The number of erased elements.

      Complexity: O(log(size() + N).

      @@ -420,7 +420,8 @@ 
    29. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type erase(const KeyType & key, KeyTypeKeyCompare comp);
      + size_type erase(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Erases all the elements with the given key. according to the comparison functor "comp".

      Returns: The number of erased elements.

      Complexity: O(log(size() + N).

      @@ -429,7 +430,7 @@ 
    30. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator i, Disposer disposer);
      + iterator erase_and_dispose(const_iterator i, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases the element pointed to by i. Disposer::operator()(pointer) is called for the removed element.

      Complexity: Average complexity for erase element is constant time.

      @@ -438,7 +439,7 @@ 
    31. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator b, const_iterator e, 
+  iterator erase_and_dispose(const_iterator b, const_iterator e, 
                              Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases the range pointed to by b end e. Disposer::operator()(pointer) is called for the removed elements.

      @@ -448,7 +449,7 @@ 
    32. template<typename Disposer> 
-  size_type erase_and_dispose(const key_type & key, Disposer disposer);
      + size_type erase_and_dispose(const key_type & key, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases all the elements with the given value. Disposer::operator()(pointer) is called for the removed elements.

      Returns: The number of erased elements.

      @@ -458,8 +459,9 @@ 
    33. template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> 
-  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
+  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
                               Disposer disposer);
      +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk) and nk the key_type of a value_type inserted into *this.

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases all the elements with the given key. according to the comparison functor "comp". Disposer::operator()(pointer) is called for the removed elements.

      Returns: The number of erased elements.

      @@ -468,46 +470,47 @@

      Note: Invalidates the iterators to the erased elements.

    34. -
      void clear();
      +
      void clear();

      Effects: Erases all of the elements.

      Complexity: Linear to the number of elements on the container. if it's a safe-mode or auto-unlink value_type. Constant time otherwise.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    35. -
      template<typename Disposer> void clear_and_dispose(Disposer disposer);
      +
      template<typename Disposer> void clear_and_dispose(Disposer disposer);

      Effects: Erases all of the elements calling disposer(p) for each node to be erased. Complexity: Average complexity for is at most O(log(size() + N)), where N is the number of elements in the container.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. Calls N times to disposer functor.

    36. -
      size_type count(const key_type &);
      +
      size_type count(const key_type &);

      Effects: Returns the number of contained elements with the given value

      Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given value.

      Throws: If key_compare throws. Additional note: non-const function, splaying is performed. 

    37. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type count(const KeyType & key, KeyTypeKeyCompare comp);
      + size_type count(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      Effects: Returns the number of contained elements with the given key

      Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given key.

      Throws: If comp throws. Additional note: const function, no splaying is performed

    38. -
      iterator lower_bound(const key_type & key);
      +
      iterator lower_bound(const key_type & key);

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. Additional note: non-const function, splaying is performed. 

    39. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      -

      Throws: If comp throws. Additional note: non-const function, splaying is performed for the first element of the equal range of "key"

      +

      Throws: If key_compare throws. Additional note: non-const function, splaying is performed for the first element of the equal range of "key"

    40. -
      const_iterator lower_bound(const key_type & key) const;
      +
      const_iterator lower_bound(const key_type & key) const;

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. Additional note: const function, no splaying is performed

      @@ -515,26 +518,27 @@ 
    41. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
      -

      Effects: Returns a const iterator to the first element whose key is not less than k or end() if that element does not exist.

      + lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      -

      Throws: If comp throws. Additional note: const function, no splaying is performed

      +

      Throws: If key_compare throws. Additional note: const function, no splaying is performed

    42. -
      iterator upper_bound(const key_type & key);
      +
      iterator upper_bound(const key_type & key);

      Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. Additional note: non-const function, splaying is performed for the first element of the equal range of "value" 

    43. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws. Additional note: non-const function, splaying is performed for the first element of the equal range of "key"

    44. -
      const_iterator upper_bound(const key_type & key) const;
      +
      const_iterator upper_bound(const key_type & key) const;

      Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. Additional note: const function, no splaying is performed

      @@ -542,39 +546,42 @@ 
    45. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
      + upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws. Additional note: const function, no splaying is performed

    46. -
      iterator find(const key_type & key);
      +
      iterator find(const key_type & key);

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. Additional note: non-const function, splaying is performed for the first element of the equal range of "value" 

    47. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator find(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator find(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws. Additional note: non-const function, splaying is performed for the first element of the equal range of "key"

    48. -
      const_iterator find(const key_type & key) const;
      -

      Effects: Finds a const_iterator to the first element whose key is k or end() if that element does not exist.

      +
      const_iterator find(const key_type & key) const;
      +

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. Additional note: const function, no splaying is performed 

    49. template<typename KeyType, typename KeyTypeKeyCompare> 
-  const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;
      -

      Effects: Finds a const_iterator to the first element whose key is k or end() if that element does not exist.

      + const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      +

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws. Additional note: const function, no splaying is performed

    50. -
      std::pair< iterator, iterator > equal_range(const key_type & key);
      +
      std::pair< iterator, iterator > equal_range(const key_type & key);

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If key_compare throws. Additional note: non-const function, splaying is performed for the first element of the equal range of "value"

      @@ -582,14 +589,15 @@ 
    51. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp);
      + equal_range(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If comp throws. Additional note: non-const function, splaying is performed for the first element of the equal range of "key" 

    52. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & key) const;
      +equal_range(const key_type & key) const;

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If key_compare throws. Additional note: const function, no splaying is performed

      @@ -597,16 +605,18 @@ 
    53. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;
      + equal_range(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If comp throws. Additional note: const function, no splaying is performed 

    54. std::pair< iterator, iterator > 
-bounded_range(const_reference lower_value, const_reference upper_value, 
+bounded_range(const_reference lower_value, const_reference upper_value, 
               bool left_closed, bool right_closed);
      -

      Requires: 'lower_key' must not be greater than 'upper_key'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key) if left_closed, upper_bound(lower_key) otherwise

      second = upper_bound(upper_key) if right_closed, lower_bound(upper_key) otherwise

      @@ -618,9 +628,12 @@ 
    55. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed);
      -

      Requires: KeyTypeKeyCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the container. 'lower_key' must not be greater than 'upper_key' according to 'comp'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

      +

      upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

      +

      upper_key shall not precede lower_key according to comp [comp(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!comp(upper_key, lower_key) && !comp(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key, comp) if left_closed, upper_bound(lower_key, comp) otherwise

      second = upper_bound(upper_key, comp) if right_closed, lower_bound(upper_key, comp) otherwise

      @@ -631,9 +644,10 @@ 
    56. std::pair< const_iterator, const_iterator > 
-bounded_range(const_reference lower_value, const_reference upper_value, 
+bounded_range(const_reference lower_value, const_reference upper_value, 
               bool left_closed, bool right_closed) const;
      -

      Requires: 'lower_key' must not be greater than 'upper_key'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key) if left_closed, upper_bound(lower_key) otherwise

      second = upper_bound(upper_key) if right_closed, lower_bound(upper_key) otherwise

      @@ -645,9 +659,12 @@ 
    57. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed) const;
      -

      Requires: KeyTypeKeyCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the container. 'lower_key' must not be greater than 'upper_key' according to 'comp'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

      +

      upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

      +

      upper_key shall not precede lower_key according to comp [comp(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!comp(upper_key, lower_key) && !comp(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key, comp) if left_closed, upper_bound(lower_key, comp) otherwise

      second = upper_bound(upper_key, comp) if right_closed, lower_bound(upper_key, comp) otherwise

      @@ -657,28 +674,28 @@

      Note: Experimental function, the interface might change in future releases.

    58. -
      iterator iterator_to(reference value);
      +
      iterator iterator_to(reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      Throws: Nothing.

    59. -
      const_iterator iterator_to(const_reference value) const;
      +
      const_iterator iterator_to(const_reference value) const;

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid const_iterator i belonging to the set that points to the value

      Complexity: Constant.

      Throws: Nothing.

    60. -
      pointer unlink_leftmost_without_rebalance();
      +
      pointer unlink_leftmost_without_rebalance();

      Effects: Unlinks the leftmost node from the container.

      Complexity: Average complexity is constant time.

      Throws: Nothing.

      Notes: This function breaks the container and the container can only be used for more unlink_leftmost_without_rebalance calls. This function is normally used to achieve a step by step controlled destruction of the container.

    61. -
      void replace_node(iterator replace_this, reference with_this);
      +
      void replace_node(iterator replace_this, reference with_this);

      Requires: replace_this must be a valid iterator of *this and with_this must not be inserted in any container.

      Effects: Replaces replace_this in its position in the container with with_this. The container does not need to be rebalanced.

      Complexity: Constant.

      @@ -686,7 +703,7 @@

      Note: This function will break container ordering invariants if with_this is not equivalent to *replace_this according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing or comparison is needed.

    62. -
      void remove_node(reference value);
      +
      void remove_node(reference value);

      Effects: removes "value" from the container.

      Throws: Nothing.

      Complexity: Logarithmic time.

      @@ -694,7 +711,7 @@

      If the user calls this function with a constant time size container or stateful comparison functor a compilation error will be issued.

    63. -
      void splay_up(iterator i);
      +
      void splay_up(iterator i);

      Requires: i must be a valid iterator of *this.

      Effects: Rearranges the container so that the element pointed by i is placed as the root of the tree, improving future searches of this value.

      Complexity: Amortized logarithmic.

      @@ -702,27 +719,27 @@ 
    64. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator splay_down(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator splay_down(const KeyType & key, KeyTypeKeyCompare comp);

      Effects: Rearranges the container so that if *this stores an element with a key equivalent to value the element is placed as the root of the tree. If the element is not present returns the last node compared with the key. If the tree is empty, end() is returned.

      Complexity: Amortized logarithmic.

      Returns: An iterator to the new root of the tree, end() if the tree is empty.

      Throws: If the comparison functor throws.

    65. -
      iterator splay_down(const key_type & key);
      +
      iterator splay_down(const key_type & key);

      Effects: Rearranges the container so that if *this stores an element with a key equivalent to value the element is placed as the root of the tree.

      Complexity: Amortized logarithmic.

      Returns: An iterator to the new root of the tree, end() if the tree is empty.

      Throws: If the predicate throws.

    66. -
      void rebalance();
      +
      void rebalance();

      Effects: Rebalances the tree.

      Throws: Nothing.

      Complexity: Linear.

    67. -
      iterator rebalance_subtree(iterator root);
      +
      iterator rebalance_subtree(iterator root);

      Requires: old_root is a node of a tree.

      Effects: Rebalances the subtree rooted at old_root.

      Returns: The new root of the subtree.

      @@ -732,11 +749,11 @@
    -

    -splay_multiset public static functions

    +

    +splay_multiset public static functions

    1. -
      static splay_multiset & container_from_end_iterator(iterator end_iterator);
      +
      static splay_multiset & container_from_end_iterator(iterator end_iterator);

      Precondition: end_iterator must be a valid end iterator of the container.

      Effects: Returns a const reference to the container associated to the end iterator

      Throws: Nothing.

      @@ -744,28 +761,28 @@ 
    2. static const splay_multiset & 
-container_from_end_iterator(const_iterator end_iterator);
      +container_from_end_iterator(const_iterator end_iterator);

      Precondition: end_iterator must be a valid end iterator of the container.

      Effects: Returns a const reference to the container associated to the end iterator

      Throws: Nothing.

      Complexity: Constant.

    3. -
      static splay_multiset & container_from_iterator(iterator it);
      +
      static splay_multiset & container_from_iterator(iterator it);

      Precondition: it must be a valid iterator of the container.

      Effects: Returns a const reference to the container associated to the iterator

      Throws: Nothing.

      Complexity: Logarithmic.

    4. -
      static const splay_multiset & container_from_iterator(const_iterator it);
      +
      static const splay_multiset & container_from_iterator(const_iterator it);

      Precondition: it must be a valid iterator of the container.

      Effects: Returns a const reference to the container associated to the iterator

      Throws: Nothing.

      Complexity: Logarithmic.

    5. -
      static iterator s_iterator_to(reference value);
      +
      static iterator s_iterator_to(reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      @@ -773,7 +790,7 @@

      Note: This static function is available only if the value traits is stateless.

    6. -
      static const_iterator s_iterator_to(const_reference value);
      +
      static const_iterator s_iterator_to(const_reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      @@ -781,7 +798,7 @@

      Note: This static function is available only if the value traits is stateless.

    7. -
      static void init_node(reference value);
      +
      static void init_node(reference value);

      Requires: value shall not be in a container.

      Effects: init_node puts the hook of a value in a well-known default state.

      Throws: Nothing.

      diff --git a/doc/html/boost/intrusive/splay_set.html b/doc/html/boost/intrusive/splay_set.html index 58e053f06d..53ce0065dd 100644 --- a/doc/html/boost/intrusive/splay_set.html +++ b/doc/html/boost/intrusive/splay_set.html @@ -60,148 +60,148 @@ typedef implementation_defined::node_algorithms node_algorithms; // construct/copy/destruct - explicit splay_set(const key_compare & = key_compare(), + explicit splay_set(const key_compare & = key_compare(), const value_traits & = value_traits()); template<typename Iterator> - splay_set(Iterator, Iterator, const key_compare & = key_compare(), + splay_set(Iterator, Iterator, const key_compare & = key_compare(), const value_traits & = value_traits()); - splay_set(splay_set &&); - splay_set & operator=(splay_set &&); - ~splay_set(); + splay_set(splay_set &&); + splay_set & operator=(splay_set &&); + ~splay_set(); - // public member functions - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end(); - const_iterator end() const; - const_iterator cend() const; - reverse_iterator rbegin(); - const_reverse_iterator rbegin() const; - const_reverse_iterator crbegin() const; - reverse_iterator rend(); - const_reverse_iterator rend() const; - const_reverse_iterator crend() const; - key_compare key_comp() const; - value_compare value_comp() const; - bool empty() const; - size_type size() const; - void swap(splay_set &); + // public member functions + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end(); + const_iterator end() const; + const_iterator cend() const; + reverse_iterator rbegin(); + const_reverse_iterator rbegin() const; + const_reverse_iterator crbegin() const; + reverse_iterator rend(); + const_reverse_iterator rend() const; + const_reverse_iterator crend() const; + key_compare key_comp() const; + value_compare value_comp() const; + bool empty() const; + size_type size() const; + void swap(splay_set &); template<typename Cloner, typename Disposer> - void clone_from(const splay_set &, Cloner, Disposer); + void clone_from(const splay_set &, Cloner, Disposer); template<typename Cloner, typename Disposer> - void clone_from(splay_set &&, Cloner, Disposer); - std::pair< iterator, bool > insert(reference); - iterator insert(const_iterator, reference); + void clone_from(splay_set &&, Cloner, Disposer); + std::pair< iterator, bool > insert(reference); + iterator insert(const_iterator, reference); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, bool > - insert_check(const KeyType &, KeyTypeKeyCompare, insert_commit_data &); + insert_check(const KeyType &, KeyTypeKeyCompare, insert_commit_data &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, bool > - insert_check(const_iterator, const KeyType &, KeyTypeKeyCompare, + insert_check(const_iterator, const KeyType &, KeyTypeKeyCompare, insert_commit_data &); - template<typename Iterator> void insert(Iterator, Iterator); - iterator insert_commit(reference, const insert_commit_data &); - iterator insert_before(const_iterator, reference); - void push_back(reference); - void push_front(reference); - iterator erase(const_iterator); - iterator erase(const_iterator, const_iterator); - size_type erase(const key_type &); + template<typename Iterator> void insert(Iterator, Iterator); + iterator insert_commit(reference, const insert_commit_data &); + iterator insert_before(const_iterator, reference); + void push_back(reference); + void push_front(reference); + iterator erase(const_iterator); + iterator erase(const_iterator, const_iterator); + size_type erase(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - size_type erase(const KeyType &, KeyTypeKeyCompare); + size_type erase(const KeyType &, KeyTypeKeyCompare); template<typename Disposer> - iterator erase_and_dispose(const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, Disposer); template<typename Disposer> - iterator erase_and_dispose(const_iterator, const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, const_iterator, Disposer); template<typename Disposer> - size_type erase_and_dispose(const key_type &, Disposer); + size_type erase_and_dispose(const key_type &, Disposer); template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> - size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); - void clear(); - template<typename Disposer> void clear_and_dispose(Disposer); - size_type count(const key_type &) const; + size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); + void clear(); + template<typename Disposer> void clear_and_dispose(Disposer); + size_type count(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - size_type count(const KeyType &, KeyTypeKeyCompare) const; - size_type count(const key_type &) const; + size_type count(const KeyType &, KeyTypeKeyCompare) const; + size_type count(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - size_type count(const KeyType &, KeyTypeKeyCompare) const; - iterator lower_bound(const key_type &); + size_type count(const KeyType &, KeyTypeKeyCompare) const; + iterator lower_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator lower_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator lower_bound(const key_type &) const; + iterator lower_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator lower_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator upper_bound(const key_type &); + const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator upper_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator upper_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator upper_bound(const key_type &) const; + iterator upper_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator upper_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator find(const key_type &); + const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator find(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator find(const KeyType &, KeyTypeKeyCompare); - const_iterator find(const key_type &) const; + iterator find(const KeyType &, KeyTypeKeyCompare); + const_iterator find(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator find(const KeyType &, KeyTypeKeyCompare) const; - std::pair< iterator, iterator > equal_range(const key_type &); + const_iterator find(const KeyType &, KeyTypeKeyCompare) const; + std::pair< iterator, iterator > equal_range(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - equal_range(const KeyType &, KeyTypeKeyCompare); + equal_range(const KeyType &, KeyTypeKeyCompare); std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; + equal_range(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - equal_range(const KeyType &, KeyTypeKeyCompare) const; + equal_range(const KeyType &, KeyTypeKeyCompare) const; std::pair< iterator, iterator > - bounded_range(const key_type &, const key_type &, bool, bool); + bounded_range(const key_type &, const key_type &, bool, bool); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool); std::pair< const_iterator, const_iterator > - bounded_range(const key_type &, const key_type &, bool, bool) const; + bounded_range(const key_type &, const key_type &, bool, bool) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool) const; - iterator iterator_to(reference); - const_iterator iterator_to(const_reference) const; - pointer unlink_leftmost_without_rebalance(); - void replace_node(iterator, reference); - void remove_node(reference); - void splay_up(iterator); + iterator iterator_to(reference); + const_iterator iterator_to(const_reference) const; + pointer unlink_leftmost_without_rebalance(); + void replace_node(iterator, reference); + void remove_node(reference); + void splay_up(iterator); template<typename KeyType, typename KeyTypeKeyCompare> - iterator splay_down(const KeyType &, KeyTypeKeyCompare); - iterator splay_down(const key_type &); - void rebalance(); - iterator rebalance_subtree(iterator); + iterator splay_down(const KeyType &, KeyTypeKeyCompare); + iterator splay_down(const key_type &); + void rebalance(); + iterator rebalance_subtree(iterator); - // public static functions - static splay_set & container_from_end_iterator(iterator); - static const splay_set & container_from_end_iterator(const_iterator); - static splay_set & container_from_iterator(iterator); - static const splay_set & container_from_iterator(const_iterator); - static iterator s_iterator_to(reference); - static const_iterator s_iterator_to(const_reference); - static void init_node(reference); + // public static functions + static splay_set & container_from_end_iterator(iterator); + static const splay_set & container_from_end_iterator(const_iterator); + static splay_set & container_from_iterator(iterator); + static const splay_set & container_from_iterator(const_iterator); + static iterator s_iterator_to(reference); + static const_iterator s_iterator_to(const_reference); + static void init_node(reference); // public data members static const bool constant_time_size; };
    -

    Description

    +

    Description

    The class template splay_set is an intrusive container, that mimics most of the interface of std::set as described in the C++ standard.

    The template parameter T is the type to be managed by the container. The user can specify additional options and if no options are provided default options are used.

    The container supports the following options: base_hook<>/member_hook<>/value_traits<>, constant_time_size<>, size_type<> and compare<>.

    -

    +

    splay_set public construct/copy/destruct

    1. -
      explicit splay_set(const key_compare & cmp = key_compare(), 
+
      explicit splay_set(const key_compare & cmp = key_compare(), 
                    const value_traits & v_traits = value_traits());
      
 
      Effects: Constructs an empty container.
      
 
      Complexity: Constant.
      
@@ -209,7 +209,7 @@
 
    2. template<typename Iterator> 
-  splay_set(Iterator b, Iterator e, const key_compare & cmp = key_compare(), 
+  splay_set(Iterator b, Iterator e, const key_compare & cmp = key_compare(), 
             const value_traits & v_traits = value_traits());

      Requires: Dereferencing iterator must yield an lvalue of type value_type. cmp must be a comparison function that induces a strict weak ordering.

      Effects: Constructs an empty container and inserts elements from [b, e).

      @@ -217,15 +217,15 @@

      Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor/operator() of the key_compare object throws. Basic guarantee.

    3. -
      splay_set(splay_set && x);
      +
      splay_set(splay_set && x);

      Effects: to-do

    4. -
      splay_set & operator=(splay_set && x);
      +
      splay_set & operator=(splay_set && x);

      Effects: to-do

    5. -
      ~splay_set();
      +
      ~splay_set();

      Effects: Detaches all elements from this. The objects in the set are not deleted (i.e. no destructors are called), but the nodes according to the value_traits template parameter are reinitialized and thus can be reused.

      Complexity: Linear to elements contained in *this.

      Throws: Nothing.

      @@ -233,114 +233,114 @@
    -

    -splay_set public member functions

    +

    +splay_set public member functions

    1. -
      iterator begin();
      +
      iterator begin();

      Effects: Returns an iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    2. -
      const_iterator begin() const;
      +
      const_iterator begin() const;

      Effects: Returns a const_iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    3. -
      const_iterator cbegin() const;
      +
      const_iterator cbegin() const;

      Effects: Returns a const_iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    4. -
      iterator end();
      +
      iterator end();

      Effects: Returns an iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    5. -
      const_iterator end() const;
      +
      const_iterator end() const;

      Effects: Returns a const_iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    6. -
      const_iterator cend() const;
      +
      const_iterator cend() const;

      Effects: Returns a const_iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    7. -
      reverse_iterator rbegin();
      +
      reverse_iterator rbegin();

      Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    8. -
      const_reverse_iterator rbegin() const;
      +
      const_reverse_iterator rbegin() const;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    9. -
      const_reverse_iterator crbegin() const;
      +
      const_reverse_iterator crbegin() const;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    10. -
      reverse_iterator rend();
      +
      reverse_iterator rend();

      Effects: Returns a reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    11. -
      const_reverse_iterator rend() const;
      +
      const_reverse_iterator rend() const;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    12. -
      const_reverse_iterator crend() const;
      +
      const_reverse_iterator crend() const;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    13. -
      key_compare key_comp() const;
      +
      key_compare key_comp() const;

      Effects: Returns the key_compare object used by the container.

      Complexity: Constant.

      Throws: If key_compare copy-constructor throws.

    14. -
      value_compare value_comp() const;
      +
      value_compare value_comp() const;

      Effects: Returns the value_compare object used by the container.

      Complexity: Constant.

      Throws: If value_compare copy-constructor throws.

    15. -
      bool empty() const;
      +
      bool empty() const;

      Effects: Returns true if the container is empty.

      Complexity: Constant.

      Throws: Nothing.

    16. -
      size_type size() const;
      +
      size_type size() const;

      Effects: Returns the number of elements stored in the container.

      Complexity: Linear to elements contained in *this if constant-time size option is disabled. Constant time otherwise.

      Throws: Nothing.

    17. -
      void swap(splay_set & other);
      +
      void swap(splay_set & other);

      Effects: Swaps the contents of two containers.

      Complexity: Constant.

      Throws: If the comparison functor's swap call throws. 

    18. template<typename Cloner, typename Disposer> 
-  void clone_from(const splay_set & src, Cloner cloner, Disposer disposer);
      + void clone_from(const splay_set & src, Cloner cloner, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

      Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(const_reference ) and inserts them on *this. Copies the predicate from the source container.

      If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

      @@ -349,7 +349,7 @@ 
    19. template<typename Cloner, typename Disposer> 
-  void clone_from(splay_set && src, Cloner cloner, Disposer disposer);
      + void clone_from(splay_set && src, Cloner cloner, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

      Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(reference) and inserts them on *this. Copies the predicate from the source container.

      If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

      @@ -358,7 +358,7 @@

      Note: This version can modify the source container, useful to implement move semantics.

    20. -
      std::pair< iterator, bool > insert(reference value);
      +
      std::pair< iterator, bool > insert(reference value);

      Requires: value must be an lvalue

      Effects: Inserts value into the container if the value is not already present.

      Complexity: Average complexity for insert element is at most logarithmic.

      @@ -366,7 +366,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    21. -
      iterator insert(const_iterator hint, reference value);
      +
      iterator insert(const_iterator hint, reference value);

      Requires: value must be an lvalue, and "hint" must be a valid iterator

      Effects: Tries to insert x into the container, using "hint" as a hint to where it will be inserted.

      Complexity: Logarithmic in general, but it is amortized constant time (two comparisons in the worst case) if t is inserted immediately before hint.

      @@ -376,7 +376,7 @@ 
    22. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, bool > 
-  insert_check(const KeyType & key, KeyTypeKeyCompare comp, 
+  insert_check(const KeyType & key, KeyTypeKeyCompare comp, 
                insert_commit_data & commit_data);

      Requires: comp must be a comparison function that induces the same strict weak ordering as key_compare. The difference is that comp compares an arbitrary key with the contained values.

      Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself.

      @@ -390,7 +390,7 @@ 
    23. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, bool > 
-  insert_check(const_iterator hint, const KeyType & key, 
+  insert_check(const_iterator hint, const KeyType & key, 
                KeyTypeKeyCompare comp, insert_commit_data & commit_data);

      Requires: comp must be a comparison function that induces the same strict weak ordering as key_compare. The difference is that comp compares an arbitrary key with the contained values.

      Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself, using "hint" as a hint to where it will be inserted.

      @@ -402,7 +402,7 @@

      "commit_data" remains valid for a subsequent "insert_commit" only if no more objects are inserted or erased from the container.

    24. -
      template<typename Iterator> void insert(Iterator b, Iterator e);
      +
      template<typename Iterator> void insert(Iterator b, Iterator e);

      Requires: Dereferencing iterator must yield an lvalue of type value_type.

      Effects: Tries to insert each element of a range into the container.

      Complexity: Insert range is in general O(N * log(N)), where N is the size of the range. However, it is linear in N if the range is already sorted by value_comp().

      @@ -410,7 +410,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    25. -
      iterator insert_commit(reference value, 
+
      iterator insert_commit(reference value, 
                        const insert_commit_data & commit_data);
      
 
      Requires: value must be an lvalue of type value_type. commit_data must have been obtained from a previous call to "insert_check". No objects should have been inserted or erased from the container between the "insert_check" that filled "commit_data" and the call to "insert_commit".
      
 
      Effects: Inserts the value in the container using the information obtained from the "commit_data" that a previous "insert_check" filled.
      
@@ -420,7 +420,7 @@
 
      Notes: This function has only sense if a "insert_check" has been previously executed to fill "commit_data". No value should be inserted or erased between the "insert_check" and "insert_commit" calls.
    26. -
      iterator insert_before(const_iterator pos, reference value);
      +
      iterator insert_before(const_iterator pos, reference value);

      Requires: value must be an lvalue, "pos" must be a valid iterator (or end) and must be the succesor of value once inserted according to the predicate

      Effects: Inserts x into the container before "pos".

      Complexity: Constant time.

      @@ -428,7 +428,7 @@

      Note: This function does not check preconditions so if "pos" is not the successor of "value" container ordering invariant will be broken. This is a low-level function to be used only for performance reasons by advanced users.

    27. -
      void push_back(reference value);
      +
      void push_back(reference value);

      Requires: value must be an lvalue, and it must be no less than the greatest inserted key

      Effects: Inserts x into the container in the last position.

      Complexity: Constant time.

      @@ -436,7 +436,7 @@

      Note: This function does not check preconditions so if value is less than the greatest inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

    28. -
      void push_front(reference value);
      +
      void push_front(reference value);

      Requires: value must be an lvalue, and it must be no greater than the minimum inserted key

      Effects: Inserts x into the container in the first position.

      Complexity: Constant time.

      @@ -444,21 +444,21 @@

      Note: This function does not check preconditions so if value is greater than the minimum inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

    29. -
      iterator erase(const_iterator i);
      +
      iterator erase(const_iterator i);

      Effects: Erases the element pointed to by i.

      Complexity: Average complexity for erase element is constant time.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    30. -
      iterator erase(const_iterator b, const_iterator e);
      +
      iterator erase(const_iterator b, const_iterator e);

      Effects: Erases the range pointed to by b end e.

      Complexity: Average complexity for erase range is at most O(log(size() + N)), where N is the number of elements in the range.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    31. -
      size_type erase(const key_type & key);
      +
      size_type erase(const key_type & key);

      Effects: Erases all the elements with the given value.

      Returns: The number of erased elements.

      Complexity: O(log(size() + N).

      @@ -467,7 +467,8 @@ 
    32. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type erase(const KeyType & key, KeyTypeKeyCompare comp);
      + size_type erase(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Erases all the elements with the given key. according to the comparison functor "comp".

      Returns: The number of erased elements.

      Complexity: O(log(size() + N).

      @@ -476,7 +477,7 @@ 
    33. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator i, Disposer disposer);
      + iterator erase_and_dispose(const_iterator i, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases the element pointed to by i. Disposer::operator()(pointer) is called for the removed element.

      Complexity: Average complexity for erase element is constant time.

      @@ -485,7 +486,7 @@ 
    34. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator b, const_iterator e, 
+  iterator erase_and_dispose(const_iterator b, const_iterator e, 
                              Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases the range pointed to by b end e. Disposer::operator()(pointer) is called for the removed elements.

      @@ -495,7 +496,7 @@ 
    35. template<typename Disposer> 
-  size_type erase_and_dispose(const key_type & key, Disposer disposer);
      + size_type erase_and_dispose(const key_type & key, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases all the elements with the given value. Disposer::operator()(pointer) is called for the removed elements.

      Returns: The number of erased elements.

      @@ -505,8 +506,9 @@ 
    36. template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> 
-  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
+  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
                               Disposer disposer);
      +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk) and nk the key_type of a value_type inserted into *this.

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases all the elements with the given key. according to the comparison functor "comp". Disposer::operator()(pointer) is called for the removed elements.

      Returns: The number of erased elements.

      @@ -515,59 +517,61 @@

      Note: Invalidates the iterators to the erased elements.

    37. -
      void clear();
      +
      void clear();

      Effects: Erases all of the elements.

      Complexity: Linear to the number of elements on the container. if it's a safe-mode or auto-unlink value_type. Constant time otherwise.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    38. -
      template<typename Disposer> void clear_and_dispose(Disposer disposer);
      +
      template<typename Disposer> void clear_and_dispose(Disposer disposer);

      Effects: Erases all of the elements calling disposer(p) for each node to be erased. Complexity: Average complexity for is at most O(log(size() + N)), where N is the number of elements in the container.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. Calls N times to disposer functor.

    39. -
      size_type count(const key_type & key) const;
      +
      size_type count(const key_type & key) const;

      Effects: Returns the number of contained elements with the given value

      Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given value.

      Throws: If key_compare throws. Additional note: const function, no splaying is performed 

    40. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;
      + size_type count(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      Effects: Returns the number of contained elements with the given key

      Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given key.

      Throws: If comp throws. Additional note: const function, no splaying is performed

    41. -
      size_type count(const key_type & key) const;
      +
      size_type count(const key_type & key) const;

      Effects: Returns the number of contained elements with the given value

      Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given value.

      Throws: If key_compare throws. Additional note: const function, no splaying is performed 

    42. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;
      + size_type count(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      Effects: Returns the number of contained elements with the given key

      Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given key.

      Throws: If comp throws. Additional note: const function, no splaying is performed

    43. -
      iterator lower_bound(const key_type & key);
      +
      iterator lower_bound(const key_type & key);

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. Additional note: non-const function, splaying is performed. 

    44. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      -

      Throws: If comp throws. Additional note: non-const function, splaying is performed for the first element of the equal range of "key"

      +

      Throws: If key_compare throws. Additional note: non-const function, splaying is performed for the first element of the equal range of "key"

    45. -
      const_iterator lower_bound(const key_type & key) const;
      +
      const_iterator lower_bound(const key_type & key) const;

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. Additional note: const function, no splaying is performed

      @@ -575,26 +579,27 @@ 
    46. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
      -

      Effects: Returns a const iterator to the first element whose key is not less than k or end() if that element does not exist.

      + lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      -

      Throws: If comp throws. Additional note: const function, no splaying is performed

      +

      Throws: If key_compare throws. Additional note: const function, no splaying is performed

    47. -
      iterator upper_bound(const key_type & key);
      +
      iterator upper_bound(const key_type & key);

      Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. Additional note: non-const function, splaying is performed for the first element of the equal range of "value" 

    48. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws. Additional note: non-const function, splaying is performed for the first element of the equal range of "key"

    49. -
      const_iterator upper_bound(const key_type & key) const;
      +
      const_iterator upper_bound(const key_type & key) const;

      Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. Additional note: const function, no splaying is performed

      @@ -602,39 +607,42 @@ 
    50. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
      + upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws. Additional note: const function, no splaying is performed

    51. -
      iterator find(const key_type & key);
      +
      iterator find(const key_type & key);

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. Additional note: non-const function, splaying is performed for the first element of the equal range of "value" 

    52. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator find(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator find(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws. Additional note: non-const function, splaying is performed for the first element of the equal range of "key"

    53. -
      const_iterator find(const key_type & key) const;
      -

      Effects: Finds a const_iterator to the first element whose key is k or end() if that element does not exist.

      +
      const_iterator find(const key_type & key) const;
      +

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. Additional note: const function, no splaying is performed 

    54. template<typename KeyType, typename KeyTypeKeyCompare> 
-  const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;
      -

      Effects: Finds a const_iterator to the first element whose key is k or end() if that element does not exist.

      + const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      +

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws. Additional note: const function, no splaying is performed

    55. -
      std::pair< iterator, iterator > equal_range(const key_type & key);
      +
      std::pair< iterator, iterator > equal_range(const key_type & key);

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -642,14 +650,15 @@ 
    56. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp);
      + equal_range(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If comp throws. 

    57. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & key) const;
      +equal_range(const key_type & key) const;

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -657,16 +666,18 @@ 
    58. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;
      + equal_range(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If comp throws. 

    59. std::pair< iterator, iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed);
      -

      Requires: 'lower_key' must not be greater than 'upper_key'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key) if left_closed, upper_bound(lower_key) otherwise

      second = upper_bound(upper_key) if right_closed, lower_bound(upper_key) otherwise

      @@ -678,9 +689,12 @@ 
    60. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed);
      -

      Requires: KeyTypeKeyCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the container. 'lower_key' must not be greater than 'upper_key' according to 'comp'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

      +

      upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

      +

      upper_key shall not precede lower_key according to comp [comp(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!comp(upper_key, lower_key) && !comp(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key, comp) if left_closed, upper_bound(lower_key, comp) otherwise

      second = upper_bound(upper_key, comp) if right_closed, lower_bound(upper_key, comp) otherwise

      @@ -691,9 +705,10 @@ 
    61. std::pair< const_iterator, const_iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed) const;
      -

      Requires: 'lower_key' must not be greater than 'upper_key'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key) if left_closed, upper_bound(lower_key) otherwise

      second = upper_bound(upper_key) if right_closed, lower_bound(upper_key) otherwise

      @@ -705,9 +720,12 @@ 
    62. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed) const;
      -

      Requires: KeyTypeKeyCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the container. 'lower_key' must not be greater than 'upper_key' according to 'comp'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

      +

      upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

      +

      upper_key shall not precede lower_key according to comp [comp(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!comp(upper_key, lower_key) && !comp(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key, comp) if left_closed, upper_bound(lower_key, comp) otherwise

      second = upper_bound(upper_key, comp) if right_closed, lower_bound(upper_key, comp) otherwise

      @@ -717,28 +735,28 @@

      Note: Experimental function, the interface might change in future releases.

    63. -
      iterator iterator_to(reference value);
      +
      iterator iterator_to(reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      Throws: Nothing.

    64. -
      const_iterator iterator_to(const_reference value) const;
      +
      const_iterator iterator_to(const_reference value) const;

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid const_iterator i belonging to the set that points to the value

      Complexity: Constant.

      Throws: Nothing.

    65. -
      pointer unlink_leftmost_without_rebalance();
      +
      pointer unlink_leftmost_without_rebalance();

      Effects: Unlinks the leftmost node from the container.

      Complexity: Average complexity is constant time.

      Throws: Nothing.

      Notes: This function breaks the container and the container can only be used for more unlink_leftmost_without_rebalance calls. This function is normally used to achieve a step by step controlled destruction of the container.

    66. -
      void replace_node(iterator replace_this, reference with_this);
      +
      void replace_node(iterator replace_this, reference with_this);

      Requires: replace_this must be a valid iterator of *this and with_this must not be inserted in any container.

      Effects: Replaces replace_this in its position in the container with with_this. The container does not need to be rebalanced.

      Complexity: Constant.

      @@ -746,7 +764,7 @@

      Note: This function will break container ordering invariants if with_this is not equivalent to *replace_this according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing or comparison is needed.

    67. -
      void remove_node(reference value);
      +
      void remove_node(reference value);

      Effects: removes "value" from the container.

      Throws: Nothing.

      Complexity: Logarithmic time.

      @@ -754,7 +772,7 @@

      If the user calls this function with a constant time size container or stateful comparison functor a compilation error will be issued.

    68. -
      void splay_up(iterator i);
      +
      void splay_up(iterator i);

      Requires: i must be a valid iterator of *this.

      Effects: Rearranges the container so that the element pointed by i is placed as the root of the tree, improving future searches of this value.

      Complexity: Amortized logarithmic.

      @@ -762,27 +780,27 @@ 
    69. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator splay_down(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator splay_down(const KeyType & key, KeyTypeKeyCompare comp);

      Effects: Rearranges the container so that if *this stores an element with a key equivalent to value the element is placed as the root of the tree. If the element is not present returns the last node compared with the key. If the tree is empty, end() is returned.

      Complexity: Amortized logarithmic.

      Returns: An iterator to the new root of the tree, end() if the tree is empty.

      Throws: If the comparison functor throws.

    70. -
      iterator splay_down(const key_type & key);
      +
      iterator splay_down(const key_type & key);

      Effects: Rearranges the container so that if *this stores an element with a key equivalent to value the element is placed as the root of the tree.

      Complexity: Amortized logarithmic.

      Returns: An iterator to the new root of the tree, end() if the tree is empty.

      Throws: If the predicate throws.

    71. -
      void rebalance();
      +
      void rebalance();

      Effects: Rebalances the tree.

      Throws: Nothing.

      Complexity: Linear.

    72. -
      iterator rebalance_subtree(iterator root);
      +
      iterator rebalance_subtree(iterator root);

      Requires: old_root is a node of a tree.

      Effects: Rebalances the subtree rooted at old_root.

      Returns: The new root of the subtree.

      @@ -792,11 +810,11 @@
    -

    -splay_set public static functions

    +

    +splay_set public static functions

    1. -
      static splay_set & container_from_end_iterator(iterator end_iterator);
      +
      static splay_set & container_from_end_iterator(iterator end_iterator);

      Precondition: end_iterator must be a valid end iterator of the container.

      Effects: Returns a const reference to the container associated to the end iterator

      Throws: Nothing.

      @@ -804,28 +822,28 @@ 
    2. static const splay_set & 
-container_from_end_iterator(const_iterator end_iterator);
      +container_from_end_iterator(const_iterator end_iterator);

      Precondition: end_iterator must be a valid end iterator of the container.

      Effects: Returns a const reference to the container associated to the end iterator

      Throws: Nothing.

      Complexity: Constant.

    3. -
      static splay_set & container_from_iterator(iterator it);
      +
      static splay_set & container_from_iterator(iterator it);

      Precondition: it must be a valid iterator of the container.

      Effects: Returns a const reference to the container associated to the iterator

      Throws: Nothing.

      Complexity: Logarithmic.

    4. -
      static const splay_set & container_from_iterator(const_iterator it);
      +
      static const splay_set & container_from_iterator(const_iterator it);

      Precondition: it must be a valid iterator of the container.

      Effects: Returns a const reference to the container associated to the iterator

      Throws: Nothing.

      Complexity: Logarithmic.

    5. -
      static iterator s_iterator_to(reference value);
      +
      static iterator s_iterator_to(reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      @@ -833,7 +851,7 @@

      Note: This static function is available only if the value traits is stateless.

    6. -
      static const_iterator s_iterator_to(const_reference value);
      +
      static const_iterator s_iterator_to(const_reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      @@ -841,7 +859,7 @@

      Note: This static function is available only if the value traits is stateless.

    7. -
      static void init_node(reference value);
      +
      static void init_node(reference value);

      Requires: value shall not be in a container.

      Effects: init_node puts the hook of a value in a well-known default state.

      Throws: Nothing.

      diff --git a/doc/html/boost/intrusive/splaytree.html b/doc/html/boost/intrusive/splaytree.html index cc274f8a12..950206204e 100644 --- a/doc/html/boost/intrusive/splaytree.html +++ b/doc/html/boost/intrusive/splaytree.html @@ -60,152 +60,152 @@ typedef implementation_defined::insert_commit_data insert_commit_data; // construct/copy/destruct - explicit splaytree(const key_compare & = key_compare(), + explicit splaytree(const key_compare & = key_compare(), const value_traits & = value_traits()); template<typename Iterator> - splaytree(bool, Iterator, Iterator, const key_compare & = key_compare(), + splaytree(bool, Iterator, Iterator, const key_compare & = key_compare(), const value_traits & = value_traits()); - splaytree(splaytree &&); - splaytree & operator=(splaytree &&); - ~splaytree(); + splaytree(splaytree &&); + splaytree & operator=(splaytree &&); + ~splaytree(); - // public member functions - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end(); - const_iterator end() const; - const_iterator cend() const; - reverse_iterator rbegin(); - const_reverse_iterator rbegin() const; - const_reverse_iterator crbegin() const; - reverse_iterator rend(); - const_reverse_iterator rend() const; - const_reverse_iterator crend() const; - key_compare key_comp() const; - value_compare value_comp() const; - bool empty() const; - size_type size() const; - void swap(splaytree &); + // public member functions + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end(); + const_iterator end() const; + const_iterator cend() const; + reverse_iterator rbegin(); + const_reverse_iterator rbegin() const; + const_reverse_iterator crbegin() const; + reverse_iterator rend(); + const_reverse_iterator rend() const; + const_reverse_iterator crend() const; + key_compare key_comp() const; + value_compare value_comp() const; + bool empty() const; + size_type size() const; + void swap(splaytree &); template<typename Cloner, typename Disposer> - void clone_from(const splaytree &, Cloner, Disposer); + void clone_from(const splaytree &, Cloner, Disposer); template<typename Cloner, typename Disposer> - void clone_from(splaytree &&, Cloner, Disposer); - iterator insert_equal(reference); - iterator insert_equal(const_iterator, reference); - template<typename Iterator> void insert_equal(Iterator, Iterator); - std::pair< iterator, bool > insert_unique(reference); - iterator insert_unique(const_iterator, reference); + void clone_from(splaytree &&, Cloner, Disposer); + iterator insert_equal(reference); + iterator insert_equal(const_iterator, reference); + template<typename Iterator> void insert_equal(Iterator, Iterator); + std::pair< iterator, bool > insert_unique(reference); + iterator insert_unique(const_iterator, reference); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, bool > - insert_unique_check(const KeyType &, KeyTypeKeyCompare, + insert_unique_check(const KeyType &, KeyTypeKeyCompare, insert_commit_data &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, bool > - insert_unique_check(const_iterator, const KeyType &, KeyTypeKeyCompare, + insert_unique_check(const_iterator, const KeyType &, KeyTypeKeyCompare, insert_commit_data &); - iterator insert_unique_commit(reference, const insert_commit_data &); - template<typename Iterator> void insert_unique(Iterator, Iterator); - iterator insert_before(const_iterator, reference); - void push_back(reference); - void push_front(reference); - iterator erase(const_iterator); - iterator erase(const_iterator, const_iterator); - size_type erase(const key_type &); + iterator insert_unique_commit(reference, const insert_commit_data &); + template<typename Iterator> void insert_unique(Iterator, Iterator); + iterator insert_before(const_iterator, reference); + void push_back(reference); + void push_front(reference); + iterator erase(const_iterator); + iterator erase(const_iterator, const_iterator); + size_type erase(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - size_type erase(const KeyType &, KeyTypeKeyCompare); + size_type erase(const KeyType &, KeyTypeKeyCompare); template<typename Disposer> - iterator erase_and_dispose(const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, Disposer); template<typename Disposer> - iterator erase_and_dispose(const_iterator, const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, const_iterator, Disposer); template<typename Disposer> - size_type erase_and_dispose(const key_type &, Disposer); + size_type erase_and_dispose(const key_type &, Disposer); template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> - size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); - void clear(); - template<typename Disposer> void clear_and_dispose(Disposer); - size_type count(const key_type &); + size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); + void clear(); + template<typename Disposer> void clear_and_dispose(Disposer); + size_type count(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - size_type count(const KeyType &, KeyTypeKeyCompare); - size_type count(const key_type &) const; + size_type count(const KeyType &, KeyTypeKeyCompare); + size_type count(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - size_type count(const KeyType &, KeyTypeKeyCompare) const; - iterator lower_bound(const key_type &); - const_iterator lower_bound(const key_type &) const; + size_type count(const KeyType &, KeyTypeKeyCompare) const; + iterator lower_bound(const key_type &); + const_iterator lower_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - iterator lower_bound(const KeyType &, KeyTypeKeyCompare); + iterator lower_bound(const KeyType &, KeyTypeKeyCompare); template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator upper_bound(const key_type &); - const_iterator upper_bound(const key_type &) const; + const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator upper_bound(const key_type &); + const_iterator upper_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - iterator upper_bound(const KeyType &, KeyTypeKeyCompare); + iterator upper_bound(const KeyType &, KeyTypeKeyCompare); template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator find(const key_type &); - const_iterator find(const key_type &) const; + const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator find(const key_type &); + const_iterator find(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - iterator find(const KeyType &, KeyTypeKeyCompare); + iterator find(const KeyType &, KeyTypeKeyCompare); template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator find(const KeyType &, KeyTypeKeyCompare) const; - std::pair< iterator, iterator > equal_range(const key_type &); + const_iterator find(const KeyType &, KeyTypeKeyCompare) const; + std::pair< iterator, iterator > equal_range(const key_type &); std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; + equal_range(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - equal_range(const KeyType &, KeyTypeKeyCompare); + equal_range(const KeyType &, KeyTypeKeyCompare); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - equal_range(const KeyType &, KeyTypeKeyCompare) const; + equal_range(const KeyType &, KeyTypeKeyCompare) const; std::pair< iterator, iterator > - bounded_range(const key_type &, const key_type &, bool, bool); + bounded_range(const key_type &, const key_type &, bool, bool); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool); std::pair< const_iterator, const_iterator > - bounded_range(const key_type &, const key_type &, bool, bool) const; + bounded_range(const key_type &, const key_type &, bool, bool) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool) const; - iterator iterator_to(reference); - const_iterator iterator_to(const_reference) const; - pointer unlink_leftmost_without_rebalance(); - void replace_node(iterator, reference); - void remove_node(reference); - void splay_up(iterator); + iterator iterator_to(reference); + const_iterator iterator_to(const_reference) const; + pointer unlink_leftmost_without_rebalance(); + void replace_node(iterator, reference); + void remove_node(reference); + void splay_up(iterator); template<typename KeyType, typename KeyTypeKeyCompare> - iterator splay_down(const KeyType &, KeyTypeKeyCompare); - iterator splay_down(const key_type &); - void rebalance(); - iterator rebalance_subtree(iterator); + iterator splay_down(const KeyType &, KeyTypeKeyCompare); + iterator splay_down(const key_type &); + void rebalance(); + iterator rebalance_subtree(iterator); - // public static functions - static splaytree & container_from_end_iterator(iterator); - static const splaytree & container_from_end_iterator(const_iterator); - static splaytree & container_from_iterator(iterator); - static const splaytree & container_from_iterator(const_iterator); - static iterator s_iterator_to(reference); - static const_iterator s_iterator_to(const_reference); - static void init_node(reference); + // public static functions + static splaytree & container_from_end_iterator(iterator); + static const splaytree & container_from_end_iterator(const_iterator); + static splaytree & container_from_iterator(iterator); + static const splaytree & container_from_iterator(const_iterator); + static iterator s_iterator_to(reference); + static const_iterator s_iterator_to(const_reference); + static void init_node(reference); // public data members static const bool constant_time_size; };
    -

    Description

    +

    Description

    The class template splaytree is an intrusive splay tree container that is used to construct intrusive splay_set and splay_multiset containers. The no-throw guarantee holds only, if the key_compare object doesn't throw.

    The template parameter T is the type to be managed by the container. The user can specify additional options and if no options are provided default options are used.

    The container supports the following options: base_hook<>/member_hook<>/value_traits<>, constant_time_size<>, size_type<> and compare<>.

    -

    +

    splaytree public construct/copy/destruct

    1. -
      explicit splaytree(const key_compare & cmp = key_compare(), 
+
      explicit splaytree(const key_compare & cmp = key_compare(), 
                    const value_traits & v_traits = value_traits());
      
 
      Effects: Constructs an empty container.
      
 
      Complexity: Constant.
      
@@ -213,7 +213,7 @@
 
    2. template<typename Iterator> 
-  splaytree(bool unique, Iterator b, Iterator e, 
+  splaytree(bool unique, Iterator b, Iterator e, 
             const key_compare & cmp = key_compare(), 
             const value_traits & v_traits = value_traits());

      Requires: Dereferencing iterator must yield an lvalue of type value_type. cmp must be a comparison function that induces a strict weak ordering.

      @@ -222,15 +222,15 @@

      Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor/operator() of the key_compare object throws. Basic guarantee.

    3. -
      splaytree(splaytree && x);
      +
      splaytree(splaytree && x);

      Effects: to-do

    4. -
      splaytree & operator=(splaytree && x);
      +
      splaytree & operator=(splaytree && x);

      Effects: to-do

    5. -
      ~splaytree();
      +
      ~splaytree();

      Effects: Detaches all elements from this. The objects in the set are not deleted (i.e. no destructors are called), but the nodes according to the value_traits template parameter are reinitialized and thus can be reused.

      Complexity: Linear to elements contained in *this.

      Throws: Nothing.

      @@ -238,114 +238,114 @@
    -

    -splaytree public member functions

    +

    +splaytree public member functions

    1. -
      iterator begin();
      +
      iterator begin();

      Effects: Returns an iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    2. -
      const_iterator begin() const;
      +
      const_iterator begin() const;

      Effects: Returns a const_iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    3. -
      const_iterator cbegin() const;
      +
      const_iterator cbegin() const;

      Effects: Returns a const_iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    4. -
      iterator end();
      +
      iterator end();

      Effects: Returns an iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    5. -
      const_iterator end() const;
      +
      const_iterator end() const;

      Effects: Returns a const_iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    6. -
      const_iterator cend() const;
      +
      const_iterator cend() const;

      Effects: Returns a const_iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    7. -
      reverse_iterator rbegin();
      +
      reverse_iterator rbegin();

      Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    8. -
      const_reverse_iterator rbegin() const;
      +
      const_reverse_iterator rbegin() const;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    9. -
      const_reverse_iterator crbegin() const;
      +
      const_reverse_iterator crbegin() const;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    10. -
      reverse_iterator rend();
      +
      reverse_iterator rend();

      Effects: Returns a reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    11. -
      const_reverse_iterator rend() const;
      +
      const_reverse_iterator rend() const;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    12. -
      const_reverse_iterator crend() const;
      +
      const_reverse_iterator crend() const;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    13. -
      key_compare key_comp() const;
      +
      key_compare key_comp() const;

      Effects: Returns the key_compare object used by the container.

      Complexity: Constant.

      Throws: If key_compare copy-constructor throws.

    14. -
      value_compare value_comp() const;
      +
      value_compare value_comp() const;

      Effects: Returns the value_compare object used by the container.

      Complexity: Constant.

      Throws: If value_compare copy-constructor throws.

    15. -
      bool empty() const;
      +
      bool empty() const;

      Effects: Returns true if the container is empty.

      Complexity: Constant.

      Throws: Nothing.

    16. -
      size_type size() const;
      +
      size_type size() const;

      Effects: Returns the number of elements stored in the container.

      Complexity: Linear to elements contained in *this if constant-time size option is disabled. Constant time otherwise.

      Throws: Nothing.

    17. -
      void swap(splaytree & other);
      +
      void swap(splaytree & other);

      Effects: Swaps the contents of two containers.

      Complexity: Constant.

      Throws: If the comparison functor's swap call throws. 

    18. template<typename Cloner, typename Disposer> 
-  void clone_from(const splaytree & src, Cloner cloner, Disposer disposer);
      + void clone_from(const splaytree & src, Cloner cloner, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

      Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(const_reference ) and inserts them on *this. Copies the predicate from the source container.

      If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

      @@ -354,7 +354,7 @@ 
    19. template<typename Cloner, typename Disposer> 
-  void clone_from(splaytree && src, Cloner cloner, Disposer disposer);
      + void clone_from(splaytree && src, Cloner cloner, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

      Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(reference) and inserts them on *this. Copies the predicate from the source container.

      If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

      @@ -363,7 +363,7 @@

      Note: This version can modify the source container, useful to implement move semantics.

    20. -
      iterator insert_equal(reference value);
      +
      iterator insert_equal(reference value);

      Requires: value must be an lvalue

      Effects: Inserts value into the container before the upper bound.

      Complexity: Average complexity for insert element is at most logarithmic.

      @@ -371,7 +371,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    21. -
      iterator insert_equal(const_iterator hint, reference value);
      +
      iterator insert_equal(const_iterator hint, reference value);

      Requires: value must be an lvalue, and "hint" must be a valid iterator.

      Effects: Inserts x into the container, using "hint" as a hint to where it will be inserted. If "hint" is the upper_bound the insertion takes constant time (two comparisons in the worst case)

      Complexity: Logarithmic in general, but it is amortized constant time if t is inserted immediately before hint.

      @@ -379,7 +379,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    22. -
      template<typename Iterator> void insert_equal(Iterator b, Iterator e);
      +
      template<typename Iterator> void insert_equal(Iterator b, Iterator e);

      Requires: Dereferencing iterator must yield an lvalue of type value_type.

      Effects: Inserts a each element of a range into the container before the upper bound of the key of each element.

      Complexity: Insert range is in general O(N * log(N)), where N is the size of the range. However, it is linear in N if the range is already sorted by value_comp().

      @@ -387,7 +387,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    23. -
      std::pair< iterator, bool > insert_unique(reference value);
      +
      std::pair< iterator, bool > insert_unique(reference value);

      Requires: value must be an lvalue

      Effects: Inserts value into the container if the value is not already present.

      Complexity: Average complexity for insert element is at most logarithmic.

      @@ -395,7 +395,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    24. -
      iterator insert_unique(const_iterator hint, reference value);
      +
      iterator insert_unique(const_iterator hint, reference value);

      Requires: value must be an lvalue, and "hint" must be a valid iterator

      Effects: Tries to insert x into the container, using "hint" as a hint to where it will be inserted.

      Complexity: Logarithmic in general, but it is amortized constant time (two comparisons in the worst case) if t is inserted immediately before hint.

      @@ -405,7 +405,7 @@ 
    25. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, bool > 
-  insert_unique_check(const KeyType & key, KeyTypeKeyCompare comp, 
+  insert_unique_check(const KeyType & key, KeyTypeKeyCompare comp, 
                       insert_commit_data & commit_data);

      Requires: comp must be a comparison function that induces the same strict weak ordering as key_compare. The difference is that comp compares an arbitrary key with the contained values.

      Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself.

      @@ -419,7 +419,7 @@ 
    26. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, bool > 
-  insert_unique_check(const_iterator hint, const KeyType & key, 
+  insert_unique_check(const_iterator hint, const KeyType & key, 
                       KeyTypeKeyCompare comp, 
                       insert_commit_data & commit_data);

      Requires: comp must be a comparison function that induces the same strict weak ordering as key_compare. The difference is that comp compares an arbitrary key with the contained values.

      @@ -432,7 +432,7 @@

      "commit_data" remains valid for a subsequent "insert_commit" only if no more objects are inserted or erased from the container.

    27. -
      iterator insert_unique_commit(reference value, 
+
      iterator insert_unique_commit(reference value, 
                               const insert_commit_data & commit_data);
      
 
      Requires: value must be an lvalue of type value_type. commit_data must have been obtained from a previous call to "insert_check". No objects should have been inserted or erased from the container between the "insert_check" that filled "commit_data" and the call to "insert_commit".
      
 
      Effects: Inserts the value in the container using the information obtained from the "commit_data" that a previous "insert_check" filled.
      
@@ -442,7 +442,7 @@
 
      Notes: This function has only sense if a "insert_check" has been previously executed to fill "commit_data". No value should be inserted or erased between the "insert_check" and "insert_commit" calls.
    28. -
      template<typename Iterator> void insert_unique(Iterator b, Iterator e);
      +
      template<typename Iterator> void insert_unique(Iterator b, Iterator e);

      Requires: Dereferencing iterator must yield an lvalue of type value_type.

      Effects: Tries to insert each element of a range into the container.

      Complexity: Insert range is in general O(N * log(N)), where N is the size of the range. However, it is linear in N if the range is already sorted by value_comp().

      @@ -450,7 +450,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    29. -
      iterator insert_before(const_iterator pos, reference value);
      +
      iterator insert_before(const_iterator pos, reference value);

      Requires: value must be an lvalue, "pos" must be a valid iterator (or end) and must be the succesor of value once inserted according to the predicate

      Effects: Inserts x into the container before "pos".

      Complexity: Constant time.

      @@ -458,7 +458,7 @@

      Note: This function does not check preconditions so if "pos" is not the successor of "value" container ordering invariant will be broken. This is a low-level function to be used only for performance reasons by advanced users.

    30. -
      void push_back(reference value);
      +
      void push_back(reference value);

      Requires: value must be an lvalue, and it must be no less than the greatest inserted key

      Effects: Inserts x into the container in the last position.

      Complexity: Constant time.

      @@ -466,7 +466,7 @@

      Note: This function does not check preconditions so if value is less than the greatest inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

    31. -
      void push_front(reference value);
      +
      void push_front(reference value);

      Requires: value must be an lvalue, and it must be no greater than the minimum inserted key

      Effects: Inserts x into the container in the first position.

      Complexity: Constant time.

      @@ -474,21 +474,21 @@

      Note: This function does not check preconditions so if value is greater than the minimum inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

    32. -
      iterator erase(const_iterator i);
      +
      iterator erase(const_iterator i);

      Effects: Erases the element pointed to by i.

      Complexity: Average complexity for erase element is constant time.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    33. -
      iterator erase(const_iterator b, const_iterator e);
      +
      iterator erase(const_iterator b, const_iterator e);

      Effects: Erases the range pointed to by b end e.

      Complexity: Average complexity for erase range is at most O(log(size() + N)), where N is the number of elements in the range.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    34. -
      size_type erase(const key_type & key);
      +
      size_type erase(const key_type & key);

      Effects: Erases all the elements with the given value.

      Returns: The number of erased elements.

      Complexity: O(log(size() + N).

      @@ -497,7 +497,8 @@ 
    35. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type erase(const KeyType & key, KeyTypeKeyCompare comp);
      + size_type erase(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Erases all the elements with the given key. according to the comparison functor "comp".

      Returns: The number of erased elements.

      Complexity: O(log(size() + N).

      @@ -506,7 +507,7 @@ 
    36. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator i, Disposer disposer);
      + iterator erase_and_dispose(const_iterator i, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases the element pointed to by i. Disposer::operator()(pointer) is called for the removed element.

      Complexity: Average complexity for erase element is constant time.

      @@ -515,7 +516,7 @@ 
    37. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator b, const_iterator e, 
+  iterator erase_and_dispose(const_iterator b, const_iterator e, 
                              Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases the range pointed to by b end e. Disposer::operator()(pointer) is called for the removed elements.

      @@ -525,7 +526,7 @@ 
    38. template<typename Disposer> 
-  size_type erase_and_dispose(const key_type & key, Disposer disposer);
      + size_type erase_and_dispose(const key_type & key, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases all the elements with the given value. Disposer::operator()(pointer) is called for the removed elements.

      Returns: The number of erased elements.

      @@ -535,8 +536,9 @@ 
    39. template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> 
-  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
+  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
                               Disposer disposer);
      +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk) and nk the key_type of a value_type inserted into *this.

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases all the elements with the given key. according to the comparison functor "comp". Disposer::operator()(pointer) is called for the removed elements.

      Returns: The number of erased elements.

      @@ -545,86 +547,89 @@

      Note: Invalidates the iterators to the erased elements.

    40. -
      void clear();
      +
      void clear();

      Effects: Erases all of the elements.

      Complexity: Linear to the number of elements on the container. if it's a safe-mode or auto-unlink value_type. Constant time otherwise.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    41. -
      template<typename Disposer> void clear_and_dispose(Disposer disposer);
      +
      template<typename Disposer> void clear_and_dispose(Disposer disposer);

      Effects: Erases all of the elements calling disposer(p) for each node to be erased. Complexity: Average complexity for is at most O(log(size() + N)), where N is the number of elements in the container.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. Calls N times to disposer functor.

    42. -
      size_type count(const key_type & key);
      +
      size_type count(const key_type & key);

      Effects: Returns the number of contained elements with the given value

      Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given value.

      Throws: If key_compare throws. Additional note: non-const function, splaying is performed. 

    43. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type count(const KeyType & key, KeyTypeKeyCompare comp);
      + size_type count(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      Effects: Returns the number of contained elements with the given key

      Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given key.

      Throws: If comp throws. Additional note: non-const function, splaying is performed.

    44. -
      size_type count(const key_type & key) const;
      +
      size_type count(const key_type & key) const;

      Effects: Returns the number of contained elements with the given value

      Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given value.

      Throws: If key_compare throws. Additional note: const function, no splaying is performed 

    45. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;
      + size_type count(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      Effects: Returns the number of contained elements with the given key

      Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given key.

      Throws: If comp throws. Additional note: const function, no splaying is performed

    46. -
      iterator lower_bound(const key_type & key);
      +
      iterator lower_bound(const key_type & key);

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. Additional note: non-const function, splaying is performed.

    47. -
      const_iterator lower_bound(const key_type & key) const;
      +
      const_iterator lower_bound(const key_type & key) const;

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. Additional note: const function, no splaying is performed 

    48. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      -

      Throws: If comp throws. Additional note: non-const function, splaying is performed for the first element of the equal range of "key"

      +

      Throws: If key_compare throws. Additional note: non-const function, splaying is performed for the first element of the equal range of "key" 

    49. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
      -

      Effects: Returns a const iterator to the first element whose key is not less than k or end() if that element does not exist.

      + lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      -

      Throws: If comp throws. Additional note: const function, no splaying is performed

      +

      Throws: If key_compare throws. Additional note: const function, no splaying is performed

    50. -
      iterator upper_bound(const key_type & key);
      +
      iterator upper_bound(const key_type & key);

      Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. Additional note: non-const function, splaying is performed for the first element of the equal range of "value"

    51. -
      const_iterator upper_bound(const key_type & key) const;
      +
      const_iterator upper_bound(const key_type & key) const;

      Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. Additional note: const function, no splaying is performed 

    52. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws. Additional note: non-const function, splaying is performed for the first element of the equal range of "key"

      @@ -632,46 +637,49 @@ 
    53. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
      + upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws. Additional note: const function, no splaying is performed

    54. -
      iterator find(const key_type & key);
      +
      iterator find(const key_type & key);

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. Additional note: non-const function, splaying is performed for the first element of the equal range of "value"

    55. -
      const_iterator find(const key_type & key) const;
      -

      Effects: Finds a const_iterator to the first element whose key is k or end() if that element does not exist.

      +
      const_iterator find(const key_type & key) const;
      +

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. Additional note: const function, no splaying is performed 

    56. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator find(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator find(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws. Additional note: non-const function, splaying is performed for the first element of the equal range of "key" 

    57. template<typename KeyType, typename KeyTypeKeyCompare> 
-  const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;
      -

      Effects: Finds a const_iterator to the first element whose key is k or end() if that element does not exist.

      + const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      +

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws. Additional note: const function, no splaying is performed

    58. -
      std::pair< iterator, iterator > equal_range(const key_type & key);
      +
      std::pair< iterator, iterator > equal_range(const key_type & key);

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If key_compare throws. Additional note: non-const function, splaying is performed for the first element of the equal range of "value" 

    59. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & key) const;
      +equal_range(const key_type & key) const;

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If key_compare throws. Additional note: const function, no splaying is performed

      @@ -679,7 +687,8 @@ 
    60. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp);
      + equal_range(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If comp throws. Additional note: non-const function, splaying is performed for the first element of the equal range of "key"

      @@ -687,16 +696,18 @@ 
    61. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;
      + equal_range(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If comp throws. Additional note: const function, no splaying is performed 

    62. std::pair< iterator, iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed);
      -

      Requires: 'lower_key' must not be greater than 'upper_key'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key) if left_closed, upper_bound(lower_key) otherwise

      second = upper_bound(upper_key) if right_closed, lower_bound(upper_key) otherwise

      @@ -708,9 +719,12 @@ 
    63. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed);
      -

      Requires: KeyTypeKeyCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the container. 'lower_key' must not be greater than 'upper_key' according to 'comp'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

      +

      upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

      +

      upper_key shall not precede lower_key according to comp [comp(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!comp(upper_key, lower_key) && !comp(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key, comp) if left_closed, upper_bound(lower_key, comp) otherwise

      second = upper_bound(upper_key, comp) if right_closed, lower_bound(upper_key, comp) otherwise

      @@ -721,9 +735,10 @@ 
    64. std::pair< const_iterator, const_iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed) const;
      -

      Requires: 'lower_key' must not be greater than 'upper_key'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key) if left_closed, upper_bound(lower_key) otherwise

      second = upper_bound(upper_key) if right_closed, lower_bound(upper_key) otherwise

      @@ -735,9 +750,12 @@ 
    65. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed) const;
      -

      Requires: KeyTypeKeyCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the container. 'lower_key' must not be greater than 'upper_key' according to 'comp'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

      +

      upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

      +

      upper_key shall not precede lower_key according to comp [comp(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!comp(upper_key, lower_key) && !comp(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key, comp) if left_closed, upper_bound(lower_key, comp) otherwise

      second = upper_bound(upper_key, comp) if right_closed, lower_bound(upper_key, comp) otherwise

      @@ -747,28 +765,28 @@

      Note: Experimental function, the interface might change in future releases.

    66. -
      iterator iterator_to(reference value);
      +
      iterator iterator_to(reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      Throws: Nothing.

    67. -
      const_iterator iterator_to(const_reference value) const;
      +
      const_iterator iterator_to(const_reference value) const;

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid const_iterator i belonging to the set that points to the value

      Complexity: Constant.

      Throws: Nothing.

    68. -
      pointer unlink_leftmost_without_rebalance();
      +
      pointer unlink_leftmost_without_rebalance();

      Effects: Unlinks the leftmost node from the container.

      Complexity: Average complexity is constant time.

      Throws: Nothing.

      Notes: This function breaks the container and the container can only be used for more unlink_leftmost_without_rebalance calls. This function is normally used to achieve a step by step controlled destruction of the container.

    69. -
      void replace_node(iterator replace_this, reference with_this);
      +
      void replace_node(iterator replace_this, reference with_this);

      Requires: replace_this must be a valid iterator of *this and with_this must not be inserted in any container.

      Effects: Replaces replace_this in its position in the container with with_this. The container does not need to be rebalanced.

      Complexity: Constant.

      @@ -776,7 +794,7 @@

      Note: This function will break container ordering invariants if with_this is not equivalent to *replace_this according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing or comparison is needed.

    70. -
      void remove_node(reference value);
      +
      void remove_node(reference value);

      Effects: removes "value" from the container.

      Throws: Nothing.

      Complexity: Logarithmic time.

      @@ -784,7 +802,7 @@

      If the user calls this function with a constant time size container or stateful comparison functor a compilation error will be issued.

    71. -
      void splay_up(iterator i);
      +
      void splay_up(iterator i);

      Requires: i must be a valid iterator of *this.

      Effects: Rearranges the container so that the element pointed by i is placed as the root of the tree, improving future searches of this value.

      Complexity: Amortized logarithmic.

      @@ -792,27 +810,27 @@ 
    72. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator splay_down(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator splay_down(const KeyType & key, KeyTypeKeyCompare comp);

      Effects: Rearranges the container so that if *this stores an element with a key equivalent to value the element is placed as the root of the tree. If the element is not present returns the last node compared with the key. If the tree is empty, end() is returned.

      Complexity: Amortized logarithmic.

      Returns: An iterator to the new root of the tree, end() if the tree is empty.

      Throws: If the comparison functor throws.

    73. -
      iterator splay_down(const key_type & key);
      +
      iterator splay_down(const key_type & key);

      Effects: Rearranges the container so that if *this stores an element with a key equivalent to value the element is placed as the root of the tree.

      Complexity: Amortized logarithmic.

      Returns: An iterator to the new root of the tree, end() if the tree is empty.

      Throws: If the predicate throws.

    74. -
      void rebalance();
      +
      void rebalance();

      Effects: Rebalances the tree.

      Throws: Nothing.

      Complexity: Linear.

    75. -
      iterator rebalance_subtree(iterator root);
      +
      iterator rebalance_subtree(iterator root);

      Requires: old_root is a node of a tree.

      Effects: Rebalances the subtree rooted at old_root.

      Returns: The new root of the subtree.

      @@ -822,11 +840,11 @@
    -

    -splaytree public static functions

    +

    +splaytree public static functions

    1. -
      static splaytree & container_from_end_iterator(iterator end_iterator);
      +
      static splaytree & container_from_end_iterator(iterator end_iterator);

      Precondition: end_iterator must be a valid end iterator of the container.

      Effects: Returns a const reference to the container associated to the end iterator

      Throws: Nothing.

      @@ -834,28 +852,28 @@ 
    2. static const splaytree & 
-container_from_end_iterator(const_iterator end_iterator);
      +container_from_end_iterator(const_iterator end_iterator);

      Precondition: end_iterator must be a valid end iterator of the container.

      Effects: Returns a const reference to the container associated to the end iterator

      Throws: Nothing.

      Complexity: Constant.

    3. -
      static splaytree & container_from_iterator(iterator it);
      +
      static splaytree & container_from_iterator(iterator it);

      Precondition: it must be a valid iterator of the container.

      Effects: Returns a const reference to the container associated to the iterator

      Throws: Nothing.

      Complexity: Logarithmic.

    4. -
      static const splaytree & container_from_iterator(const_iterator it);
      +
      static const splaytree & container_from_iterator(const_iterator it);

      Precondition: it must be a valid iterator of the container.

      Effects: Returns a const reference to the container associated to the iterator

      Throws: Nothing.

      Complexity: Logarithmic.

    5. -
      static iterator s_iterator_to(reference value);
      +
      static iterator s_iterator_to(reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      @@ -863,7 +881,7 @@

      Note: This static function is available only if the value traits is stateless.

    6. -
      static const_iterator s_iterator_to(const_reference value);
      +
      static const_iterator s_iterator_to(const_reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      @@ -871,7 +889,7 @@

      Note: This static function is available only if the value traits is stateless.

    7. -
      static void init_node(reference value);
      +
      static void init_node(reference value);

      Requires: value shall not be in a container.

      Effects: init_node puts the hook of a value in a well-known default state.

      Throws: Nothing.

      diff --git a/doc/html/boost/intrusive/splaytree_algorithms.html b/doc/html/boost/intrusive/splaytree_algorithms.html index ea6a343a1b..66608bab19 100644 --- a/doc/html/boost/intrusive/splaytree_algorithms.html +++ b/doc/html/boost/intrusive/splaytree_algorithms.html @@ -42,112 +42,112 @@ typedef NodeTraits::const_node_ptr const_node_ptr; typedef bstree_algo::insert_commit_data insert_commit_data; - // public static functions - static node_ptr get_header(const const_node_ptr &); - static node_ptr begin_node(const const_node_ptr &); - static node_ptr end_node(const const_node_ptr &); - static void swap_tree(const node_ptr &, const node_ptr &); - static void swap_nodes(const node_ptr &, const node_ptr &); - static void swap_nodes(const node_ptr &, const node_ptr &, const node_ptr &, + // public static functions + static node_ptr get_header(const const_node_ptr &); + static node_ptr begin_node(const const_node_ptr &); + static node_ptr end_node(const const_node_ptr &); + static void swap_tree(const node_ptr &, const node_ptr &); + static void swap_nodes(const node_ptr &, const node_ptr &); + static void swap_nodes(const node_ptr &, const node_ptr &, const node_ptr &, const node_ptr &); - static void replace_node(const node_ptr &, const node_ptr &); - static void replace_node(const node_ptr &, const node_ptr &, + static void replace_node(const node_ptr &, const node_ptr &); + static void replace_node(const node_ptr &, const node_ptr &, const node_ptr &); - static void unlink(const node_ptr &); - static node_ptr unlink_leftmost_without_rebalance(const node_ptr &); - static bool unique(const const_node_ptr &); - static std::size_t size(const const_node_ptr &); - static node_ptr next_node(const node_ptr &); - static node_ptr prev_node(const node_ptr &); - static void init(const node_ptr &); - static void init_header(const node_ptr &); - static void erase(const node_ptr &, const node_ptr &); + static void unlink(const node_ptr &); + static node_ptr unlink_leftmost_without_rebalance(const node_ptr &); + static bool unique(const const_node_ptr &); + static std::size_t size(const const_node_ptr &); + static node_ptr next_node(const node_ptr &); + static node_ptr prev_node(const node_ptr &); + static void init(const node_ptr &); + static void init_header(const node_ptr &); + static void erase(const node_ptr &, const node_ptr &); template<typename Cloner, typename Disposer> - static void clone(const const_node_ptr &, const node_ptr &, Cloner, + static void clone(const const_node_ptr &, const node_ptr &, Cloner, Disposer); template<typename Disposer> - static void clear_and_dispose(const node_ptr &, Disposer); + static void clear_and_dispose(const node_ptr &, Disposer); template<typename KeyType, typename KeyNodePtrCompare> static std::size_t - count(const node_ptr &, const KeyType &, KeyNodePtrCompare); + count(const node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static std::size_t - count(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + count(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static node_ptr - lower_bound(const node_ptr &, const KeyType &, KeyNodePtrCompare); + lower_bound(const node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static node_ptr - lower_bound(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + lower_bound(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static node_ptr - upper_bound(const node_ptr &, const KeyType &, KeyNodePtrCompare); + upper_bound(const node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static node_ptr - upper_bound(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + upper_bound(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> - static node_ptr find(const node_ptr &, const KeyType &, KeyNodePtrCompare); + static node_ptr find(const node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static node_ptr - find(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + find(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, node_ptr > - equal_range(const node_ptr &, const KeyType &, KeyNodePtrCompare); + equal_range(const node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, node_ptr > - equal_range(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + equal_range(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, node_ptr > - lower_bound_range(const node_ptr &, const KeyType &, KeyNodePtrCompare); + lower_bound_range(const node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, node_ptr > - lower_bound_range(const const_node_ptr &, const KeyType &, + lower_bound_range(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, node_ptr > - bounded_range(const node_ptr &, const KeyType &, const KeyType &, + bounded_range(const node_ptr &, const KeyType &, const KeyType &, KeyNodePtrCompare, bool, bool); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, node_ptr > - bounded_range(const const_node_ptr &, const KeyType &, const KeyType &, + bounded_range(const const_node_ptr &, const KeyType &, const KeyType &, KeyNodePtrCompare, bool, bool); template<typename NodePtrCompare> static node_ptr - insert_equal_upper_bound(const node_ptr &, const node_ptr &, + insert_equal_upper_bound(const node_ptr &, const node_ptr &, NodePtrCompare); template<typename NodePtrCompare> static node_ptr - insert_equal_lower_bound(const node_ptr &, const node_ptr &, + insert_equal_lower_bound(const node_ptr &, const node_ptr &, NodePtrCompare); template<typename NodePtrCompare> static node_ptr - insert_equal(const node_ptr &, const node_ptr &, const node_ptr &, + insert_equal(const node_ptr &, const node_ptr &, const node_ptr &, NodePtrCompare); static node_ptr - insert_before(const node_ptr &, const node_ptr &, const node_ptr &); - static void push_back(const node_ptr &, const node_ptr &); - static void push_front(const node_ptr &, const node_ptr &); + insert_before(const node_ptr &, const node_ptr &, const node_ptr &); + static void push_back(const node_ptr &, const node_ptr &); + static void push_front(const node_ptr &, const node_ptr &); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, bool > - insert_unique_check(const node_ptr &, const KeyType &, KeyNodePtrCompare, + insert_unique_check(const node_ptr &, const KeyType &, KeyNodePtrCompare, insert_commit_data &); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, bool > - insert_unique_check(const node_ptr &, const node_ptr &, const KeyType &, + insert_unique_check(const node_ptr &, const node_ptr &, const KeyType &, KeyNodePtrCompare, insert_commit_data &); - static void insert_unique_commit(const node_ptr &, const node_ptr &, + static void insert_unique_commit(const node_ptr &, const node_ptr &, const insert_commit_data &); - static bool is_header(const const_node_ptr &); - static void rebalance(const node_ptr &); - static node_ptr rebalance_subtree(const node_ptr &); - static void splay_up(const node_ptr &, const node_ptr &); + static bool is_header(const const_node_ptr &); + static void rebalance(const node_ptr &); + static node_ptr rebalance_subtree(const node_ptr &); + static void splay_up(const node_ptr &, const node_ptr &); template<typename KeyType, typename KeyNodePtrCompare> static node_ptr - splay_down(const node_ptr &, const KeyType &, KeyNodePtrCompare, + splay_down(const node_ptr &, const KeyType &, KeyNodePtrCompare, bool * = 0); };
    -

    Description

    +

    Description

    A splay tree is an implementation of a binary search tree. The tree is self balancing using the splay algorithm as described in

    "Self-Adjusting Binary Search Trees by Daniel Dominic Sleator and Robert Endre Tarjan AT&T Bell Laboratories, Murray Hill, NJ Journal of the ACM, Vol 32, no 3, July 1985, pp 652-686

    splaytree_algorithms is configured with a NodeTraits class, which encapsulates the information about the node to be manipulated. NodeTraits must support the following interface:

    @@ -163,7 +163,7 @@

    static node_ptr get_right(const_node_ptr n);

    static void set_right(node_ptr n, node_ptr right);

    -

    +

    splaytree_algorithms public types

    @@ -174,39 +174,39 @@
    -

    -splaytree_algorithms public static functions

    +

    +splaytree_algorithms public static functions

    1. -
      static node_ptr get_header(const const_node_ptr & n);
      +
      static node_ptr get_header(const const_node_ptr & n);

      Requires: 'node' is a node of the tree or a header node.

      Effects: Returns the header of the tree.

      Complexity: Logarithmic.

      Throws: Nothing.

    2. -
      static node_ptr begin_node(const const_node_ptr & header);
      +
      static node_ptr begin_node(const const_node_ptr & header);

      Requires: 'header' is the header node of a tree.

      Effects: Returns the first node of the tree, the header if the tree is empty.

      Complexity: Constant time.

      Throws: Nothing.

    3. -
      static node_ptr end_node(const const_node_ptr & header);
      +
      static node_ptr end_node(const const_node_ptr & header);

      Requires: 'header' is the header node of a tree.

      Effects: Returns the header of the tree.

      Complexity: Constant time.

      Throws: Nothing.

    4. -
      static void swap_tree(const node_ptr & header1, const node_ptr & header2);
      +
      static void swap_tree(const node_ptr & header1, const node_ptr & header2);

      Requires: header1 and header2 must be the header nodes of two trees.

      Effects: Swaps two trees. After the function header1 will contain links to the second tree and header2 will have links to the first tree.

      Complexity: Constant.

      Throws: Nothing.

    5. -
      static void swap_nodes(const node_ptr & node1, const node_ptr & node2);
      +
      static void swap_nodes(const node_ptr & node1, const node_ptr & node2);

      Requires: node1 and node2 can't be header nodes of two trees.

      Effects: Swaps two nodes. After the function node1 will be inserted in the position node2 before the function. node2 will be inserted in the position node1 had before the function.

      Complexity: Logarithmic.

      @@ -215,7 +215,7 @@

      Experimental function

    6. -
      static void swap_nodes(const node_ptr & node1, const node_ptr & header1, 
+
      static void swap_nodes(const node_ptr & node1, const node_ptr & header1, 
                        const node_ptr & node2, const node_ptr & header2);
      
 
      Requires: node1 and node2 can't be header nodes of two trees with header header1 and header2.
      
 
      Effects: Swaps two nodes. After the function node1 will be inserted in the position node2 before the function. node2 will be inserted in the position node1 had before the function.
      
@@ -225,7 +225,7 @@
 
      Experimental function
    7. -
      static void replace_node(const node_ptr & node_to_be_replaced, 
+
      static void replace_node(const node_ptr & node_to_be_replaced, 
                          const node_ptr & new_node);
      
 
      Requires: node_to_be_replaced must be inserted in a tree and new_node must not be inserted in a tree.
      
 
      Effects: Replaces node_to_be_replaced in its position in the tree with new_node. The tree does not need to be rebalanced
      
@@ -234,7 +234,7 @@
 
      Note: This function will break container ordering invariants if new_node is not equivalent to node_to_be_replaced according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing and comparison is needed. Experimental function
    8. -
      static void replace_node(const node_ptr & node_to_be_replaced, 
+
      static void replace_node(const node_ptr & node_to_be_replaced, 
                          const node_ptr & header, const node_ptr & new_node);
      
 
      Requires: node_to_be_replaced must be inserted in a tree with header "header" and new_node must not be inserted in a tree.
      
 
      Effects: Replaces node_to_be_replaced in its position in the tree with new_node. The tree does not need to be rebalanced
      
@@ -243,14 +243,14 @@
 
      Note: This function will break container ordering invariants if new_node is not equivalent to node_to_be_replaced according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing or comparison is needed. Experimental function
    9. -
      static void unlink(const node_ptr & node);
      +
      static void unlink(const node_ptr & node);

      Requires: node is a tree node but not the header.

      Effects: Unlinks the node and rebalances the tree.

      Complexity: Average complexity is constant time.

      Throws: Nothing.

    10. -
      static node_ptr unlink_leftmost_without_rebalance(const node_ptr & header);
      +
      static node_ptr unlink_leftmost_without_rebalance(const node_ptr & header);

      Requires: header is the header of a tree.

      Effects: Unlinks the leftmost node from the tree, and updates the header link to the new leftmost node.

      Complexity: Average complexity is constant time.

      @@ -258,35 +258,35 @@

      Notes: This function breaks the tree and the tree can only be used for more unlink_leftmost_without_rebalance calls. This function is normally used to achieve a step by step controlled destruction of the tree.

    11. -
      static bool unique(const const_node_ptr & node);
      +
      static bool unique(const const_node_ptr & node);

      Requires: 'node' is a node of the tree or a node initialized by init(...) or init_node.

      Effects: Returns true if the node is initialized by init() or init_node().

      Complexity: Constant time.

      Throws: Nothing.

    12. -
      static std::size_t size(const const_node_ptr & header);
      +
      static std::size_t size(const const_node_ptr & header);

      Requires: node is a node of the tree but it's not the header.

      Effects: Returns the number of nodes of the subtree.

      Complexity: Linear time.

      Throws: Nothing.

    13. -
      static node_ptr next_node(const node_ptr & node);
      +
      static node_ptr next_node(const node_ptr & node);

      Requires: 'node' is a node from the tree except the header.

      Effects: Returns the next node of the tree.

      Complexity: Average constant time.

      Throws: Nothing.

    14. -
      static node_ptr prev_node(const node_ptr & node);
      +
      static node_ptr prev_node(const node_ptr & node);

      Requires: 'node' is a node from the tree except the leftmost node.

      Effects: Returns the previous node of the tree.

      Complexity: Average constant time.

      Throws: Nothing.

    15. -
      static void init(const node_ptr & node);
      +
      static void init(const node_ptr & node);

      Requires: 'node' must not be part of any tree.

      Effects: After the function unique(node) == true.

      Complexity: Constant.

      @@ -294,7 +294,7 @@

      Nodes: If node is inserted in a tree, this function corrupts the tree.

    16. -
      static void init_header(const node_ptr & header);
      +
      static void init_header(const node_ptr & header);

      Requires: node must not be part of any tree.

      Effects: Initializes the header to represent an empty tree. unique(header) == true.

      Complexity: Constant.

      @@ -302,7 +302,7 @@

      Nodes: If node is inserted in a tree, this function corrupts the tree.

    17. -
      static void erase(const node_ptr & header, const node_ptr & z);
      +
      static void erase(const node_ptr & header, const node_ptr & z);

      Requires: header must be the header of a tree, z a node of that tree and z != header.

      Effects: Erases node "z" from the tree with header "header".

      Complexity: Amortized constant time.

      @@ -310,7 +310,7 @@ 
    18. template<typename Cloner, typename Disposer> 
-  static void clone(const const_node_ptr & source_header, 
+  static void clone(const const_node_ptr & source_header, 
                     const node_ptr & target_header, Cloner cloner, 
                     Disposer disposer);

      Requires: "cloner" must be a function object taking a node_ptr and returning a new cloned node of it. "disposer" must take a node_ptr and shouldn't throw.

      @@ -321,7 +321,7 @@ 
    19. template<typename Disposer> 
-  static void clear_and_dispose(const node_ptr & header, Disposer disposer);
      + static void clear_and_dispose(const node_ptr & header, Disposer disposer);

      Requires: "disposer" must be an object function taking a node_ptr parameter and shouldn't throw.

      Effects: Empties the target tree calling void disposer::operator()(const node_ptr &) for every node of the tree except the header.

      Complexity: Linear to the number of element of the source tree plus the. number of elements of tree target tree when calling this function.

      @@ -330,7 +330,7 @@ 
    20. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::size_t 
-  count(const node_ptr & header, const KeyType & key, KeyNodePtrCompare comp);
      + count(const node_ptr & header, const KeyType & key, KeyNodePtrCompare comp);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

      Effects: Returns the number of elements with a key equivalent to "key" according to "comp".

      Complexity: Logarithmic.

      @@ -339,7 +339,7 @@ 
    21. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::size_t 
-  count(const const_node_ptr & header, const KeyType & key, 
+  count(const const_node_ptr & header, const KeyType & key, 
         KeyNodePtrCompare comp);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

      Effects: Returns the number of elements with a key equivalent to "key" according to "comp".

      @@ -349,7 +349,7 @@ 
    22. template<typename KeyType, typename KeyNodePtrCompare> 
   static node_ptr 
-  lower_bound(const node_ptr & header, const KeyType & key, 
+  lower_bound(const node_ptr & header, const KeyType & key, 
               KeyNodePtrCompare comp);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

      Effects: Returns a node_ptr to the first element that is not less than "key" according to "comp" or "header" if that element does not exist.

      @@ -359,7 +359,7 @@ 
    23. template<typename KeyType, typename KeyNodePtrCompare> 
   static node_ptr 
-  lower_bound(const const_node_ptr & header, const KeyType & key, 
+  lower_bound(const const_node_ptr & header, const KeyType & key, 
               KeyNodePtrCompare comp);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

      Effects: Returns a node_ptr to the first element that is not less than "key" according to "comp" or "header" if that element does not exist.

      @@ -369,7 +369,7 @@ 
    24. template<typename KeyType, typename KeyNodePtrCompare> 
   static node_ptr 
-  upper_bound(const node_ptr & header, const KeyType & key, 
+  upper_bound(const node_ptr & header, const KeyType & key, 
               KeyNodePtrCompare comp);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

      Effects: Returns a node_ptr to the first element that is greater than "key" according to "comp" or "header" if that element does not exist.

      @@ -379,7 +379,7 @@ 
    25. template<typename KeyType, typename KeyNodePtrCompare> 
   static node_ptr 
-  upper_bound(const const_node_ptr & header, const KeyType & key, 
+  upper_bound(const const_node_ptr & header, const KeyType & key, 
               KeyNodePtrCompare comp);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

      Effects: Returns a node_ptr to the first element that is greater than "key" according to "comp" or "header" if that element does not exist.

      @@ -389,7 +389,7 @@ 
    26. template<typename KeyType, typename KeyNodePtrCompare> 
   static node_ptr 
-  find(const node_ptr & header, const KeyType & key, KeyNodePtrCompare comp);
      + find(const node_ptr & header, const KeyType & key, KeyNodePtrCompare comp);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

      Effects: Returns a node_ptr to the first element that is equivalent to "key" according to "comp" or "header" if that element does not exist.

      Complexity: Logarithmic.

      @@ -398,7 +398,7 @@ 
    27. template<typename KeyType, typename KeyNodePtrCompare> 
   static node_ptr 
-  find(const const_node_ptr & header, const KeyType & key, 
+  find(const const_node_ptr & header, const KeyType & key, 
        KeyNodePtrCompare comp);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

      Effects: Returns a node_ptr to the first element that is equivalent to "key" according to "comp" or "header" if that element does not exist.

      @@ -408,7 +408,7 @@ 
    28. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, node_ptr > 
-  equal_range(const node_ptr & header, const KeyType & key, 
+  equal_range(const node_ptr & header, const KeyType & key, 
               KeyNodePtrCompare comp);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

      Effects: Returns an a pair of node_ptr delimiting a range containing all elements that are equivalent to "key" according to "comp" or an empty range that indicates the position where those elements would be if there are no equivalent elements.

      @@ -418,7 +418,7 @@ 
    29. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, node_ptr > 
-  equal_range(const const_node_ptr & header, const KeyType & key, 
+  equal_range(const const_node_ptr & header, const KeyType & key, 
               KeyNodePtrCompare comp);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

      Effects: Returns an a pair of node_ptr delimiting a range containing all elements that are equivalent to "key" according to "comp" or an empty range that indicates the position where those elements would be if there are no equivalent elements.

      @@ -428,7 +428,7 @@ 
    30. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, node_ptr > 
-  lower_bound_range(const node_ptr & header, const KeyType & key, 
+  lower_bound_range(const node_ptr & header, const KeyType & key, 
                     KeyNodePtrCompare comp);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

      Effects: Returns an a pair of node_ptr delimiting a range containing the first element that is equivalent to "key" according to "comp" or an empty range that indicates the position where that element would be if there are no equivalent elements.

      @@ -438,7 +438,7 @@ 
    31. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, node_ptr > 
-  lower_bound_range(const const_node_ptr & header, const KeyType & key, 
+  lower_bound_range(const const_node_ptr & header, const KeyType & key, 
                     KeyNodePtrCompare comp);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

      Effects: Returns an a pair of node_ptr delimiting a range containing the first element that is equivalent to "key" according to "comp" or an empty range that indicates the position where that element would be if there are no equivalent elements.

      @@ -448,7 +448,7 @@ 
    32. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, node_ptr > 
-  bounded_range(const node_ptr & header, const KeyType & lower_key, 
+  bounded_range(const node_ptr & header, const KeyType & lower_key, 
                 const KeyType & upper_key, KeyNodePtrCompare comp, 
                 bool left_closed, bool right_closed);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs. 'lower_key' must not be greater than 'upper_key' according to 'comp'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be true.

      @@ -463,7 +463,7 @@ 
    33. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, node_ptr > 
-  bounded_range(const const_node_ptr & header, const KeyType & lower_key, 
+  bounded_range(const const_node_ptr & header, const KeyType & lower_key, 
                 const KeyType & upper_key, KeyNodePtrCompare comp, 
                 bool left_closed, bool right_closed);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs. 'lower_key' must not be greater than 'upper_key' according to 'comp'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be true.

      @@ -478,7 +478,7 @@ 
    34. template<typename NodePtrCompare> 
   static node_ptr 
-  insert_equal_upper_bound(const node_ptr & header, const node_ptr & new_node, 
+  insert_equal_upper_bound(const node_ptr & header, const node_ptr & new_node, 
                            NodePtrCompare comp);

      Requires: "h" must be the header node of a tree. NodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares two node_ptrs.

      Effects: Inserts new_node into the tree before the upper bound according to "comp".

      @@ -488,7 +488,7 @@ 
    35. template<typename NodePtrCompare> 
   static node_ptr 
-  insert_equal_lower_bound(const node_ptr & header, const node_ptr & new_node, 
+  insert_equal_lower_bound(const node_ptr & header, const node_ptr & new_node, 
                            NodePtrCompare comp);

      Requires: "h" must be the header node of a tree. NodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares two node_ptrs.

      Effects: Inserts new_node into the tree before the lower bound according to "comp".

      @@ -498,7 +498,7 @@ 
    36. template<typename NodePtrCompare> 
   static node_ptr 
-  insert_equal(const node_ptr & header, const node_ptr & hint, 
+  insert_equal(const node_ptr & header, const node_ptr & hint, 
                const node_ptr & new_node, NodePtrCompare comp);

      Requires: "header" must be the header node of a tree. NodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares two node_ptrs. "hint" is node from the "header"'s tree.

      Effects: Inserts new_node into the tree, using "hint" as a hint to where it will be inserted. If "hint" is the upper_bound the insertion takes constant time (two comparisons in the worst case).

      @@ -507,7 +507,7 @@ 
    37. static node_ptr 
-insert_before(const node_ptr & header, const node_ptr & pos, 
+insert_before(const node_ptr & header, const node_ptr & pos, 
               const node_ptr & new_node);

      Requires: "header" must be the header node of a tree. "pos" must be a valid iterator or header (end) node. "pos" must be an iterator pointing to the successor to "new_node" once inserted according to the order of already inserted nodes. This function does not check "pos" and this precondition must be guaranteed by the caller.

      Effects: Inserts new_node into the tree before "pos".

      @@ -516,7 +516,7 @@

      Note: If "pos" is not the successor of the newly inserted "new_node" tree invariants might be broken. Additional note: the inserted node is splayed

    38. -
      static void push_back(const node_ptr & header, const node_ptr & new_node);
      +
      static void push_back(const node_ptr & header, const node_ptr & new_node);

      Requires: "header" must be the header node of a tree. "new_node" must be, according to the used ordering no less than the greatest inserted key.

      Effects: Inserts new_node into the tree before "pos".

      Complexity: Constant-time.

      @@ -524,7 +524,7 @@

      Note: If "new_node" is less than the greatest inserted key tree invariants are broken. This function is slightly faster than using "insert_before". Additional note: the inserted node is splayed

    39. -
      static void push_front(const node_ptr & header, const node_ptr & new_node);
      +
      static void push_front(const node_ptr & header, const node_ptr & new_node);

      Requires: "header" must be the header node of a tree. "new_node" must be, according to the used ordering, no greater than the lowest inserted key.

      Effects: Inserts new_node into the tree before "pos".

      Complexity: Constant-time.

      @@ -534,7 +534,7 @@ 
    40. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, bool > 
-  insert_unique_check(const node_ptr & header, const KeyType & key, 
+  insert_unique_check(const node_ptr & header, const KeyType & key, 
                       KeyNodePtrCompare comp, 
                       insert_commit_data & commit_data);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares KeyType with a node_ptr.

      @@ -549,7 +549,7 @@ 
    41. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, bool > 
-  insert_unique_check(const node_ptr & header, const node_ptr & hint, 
+  insert_unique_check(const node_ptr & header, const node_ptr & hint, 
                       const KeyType & key, KeyNodePtrCompare comp, 
                       insert_commit_data & commit_data);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares KeyType with a node_ptr. "hint" is node from the "header"'s tree.

      @@ -562,7 +562,7 @@

      "commit_data" remains valid for a subsequent "insert_unique_commit" only if no more objects are inserted or erased from the set. Additional note: nodes with the given key are splayed

    42. -
      static void insert_unique_commit(const node_ptr & header, 
+
      static void insert_unique_commit(const node_ptr & header, 
                                  const node_ptr & new_value, 
                                  const insert_commit_data & commit_data);
      
 
      Requires: "header" must be the header node of a tree. "commit_data" must have been obtained from a previous call to "insert_unique_check". No objects should have been inserted or erased from the set between the "insert_unique_check" that filled "commit_data" and the call to "insert_commit".
      
@@ -572,31 +572,31 @@
 
      Notes: This function has only sense if a "insert_unique_check" has been previously executed to fill "commit_data". No value should be inserted or erased between the "insert_check" and "insert_commit" calls.
    43. -
      static bool is_header(const const_node_ptr & p);
      +
      static bool is_header(const const_node_ptr & p);

      Requires: p is a node of a tree.

      Effects: Returns true if p is the header of the tree.

      Complexity: Constant.

      Throws: Nothing.

    44. -
      static void rebalance(const node_ptr & header);
      +
      static void rebalance(const node_ptr & header);

      Requires: header must be the header of a tree.

      Effects: Rebalances the tree.

      Throws: Nothing.

      Complexity: Linear.

    45. -
      static node_ptr rebalance_subtree(const node_ptr & old_root);
      +
      static node_ptr rebalance_subtree(const node_ptr & old_root);

      Requires: old_root is a node of a tree. It shall not be null.

      Effects: Rebalances the subtree rooted at old_root.

      Returns: The new root of the subtree.

      Throws: Nothing.

      Complexity: Linear.

      46. -
    46. static void splay_up(const node_ptr & node, const node_ptr & header);
      47. +
    47. static void splay_up(const node_ptr & node, const node_ptr & header);
    48. template<typename KeyType, typename KeyNodePtrCompare> 
   static node_ptr 
-  splay_down(const node_ptr & header, const KeyType & key, 
+  splay_down(const node_ptr & header, const KeyType & key, 
              KeyNodePtrCompare comp, bool * pfound = 0);
    diff --git a/doc/html/boost/intrusive/store_hash.html b/doc/html/boost/intrusive/store_hash.html index f50d10bdfa..e3cc824ec9 100644 --- a/doc/html/boost/intrusive/store_hash.html +++ b/doc/html/boost/intrusive/store_hash.html @@ -36,7 +36,7 @@ struct store_hash { };
    -

    Description

    +

    Description

    This option setter specifies if the unordered hook should offer room to store the hash value. Storing the hash in the hook will speed up rehashing processes in applications where rehashing is frequent, rehashing might throw or the value is heavy to hash.

    diff --git a/doc/html/boost/intrusive/tag.html b/doc/html/boost/intrusive/tag.html index 1e9df09882..83e0212056 100644 --- a/doc/html/boost/intrusive/tag.html +++ b/doc/html/boost/intrusive/tag.html @@ -36,7 +36,7 @@ struct tag { };
    -

    Description

    +

    Description

    This option setter specifies the type of the tag of a base hook. A type cannot have two base hooks of the same type, so a tag can be used to differentiate two base hooks with otherwise same type

    diff --git a/doc/html/boost/intrusive/treap.html b/doc/html/boost/intrusive/treap.html index cfb522efbc..571a01005a 100644 --- a/doc/html/boost/intrusive/treap.html +++ b/doc/html/boost/intrusive/treap.html @@ -62,142 +62,142 @@ typedef node_algorithms::insert_commit_data insert_commit_data; // construct/copy/destruct - explicit treap(const key_compare & = key_compare(), + explicit treap(const key_compare & = key_compare(), const priority_compare & = priority_compare(), const value_traits & = value_traits()); template<typename Iterator> - treap(bool, Iterator, Iterator, const key_compare & = key_compare(), + treap(bool, Iterator, Iterator, const key_compare & = key_compare(), const priority_compare & = priority_compare(), const value_traits & = value_traits()); - treap(treap &&); - treap & operator=(treap &&); - ~treap(); + treap(treap &&); + treap & operator=(treap &&); + ~treap(); - // public member functions + // public member functions template<typename KeyPrioComp> - unspecified key_node_prio_comp(KeyPrioComp) const; - value_node_prio_comp_t value_node_prio_comp() const; - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end(); - const_iterator end() const; - const_iterator cend() const; - iterator top(); - const_iterator top() const; - const_iterator ctop() const; - reverse_iterator rbegin(); - const_reverse_iterator rbegin() const; - const_reverse_iterator crbegin() const; - reverse_iterator rend(); - const_reverse_iterator rend() const; - const_reverse_iterator crend() const; - reverse_iterator rtop(); - const_reverse_iterator rtop() const; - const_reverse_iterator crtop() const; - key_compare key_comp() const; - value_compare value_comp() const; - bool empty() const; - size_type size() const; - priority_compare priority_comp() const; - void swap(treap &); + unspecified key_node_prio_comp(KeyPrioComp) const; + value_node_prio_comp_t value_node_prio_comp() const; + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end(); + const_iterator end() const; + const_iterator cend() const; + iterator top(); + const_iterator top() const; + const_iterator ctop() const; + reverse_iterator rbegin(); + const_reverse_iterator rbegin() const; + const_reverse_iterator crbegin() const; + reverse_iterator rend(); + const_reverse_iterator rend() const; + const_reverse_iterator crend() const; + reverse_iterator rtop(); + const_reverse_iterator rtop() const; + const_reverse_iterator crtop() const; + key_compare key_comp() const; + value_compare value_comp() const; + bool empty() const; + size_type size() const; + priority_compare priority_comp() const; + void swap(treap &); template<typename Cloner, typename Disposer> - void clone_from(const treap &, Cloner, Disposer); + void clone_from(const treap &, Cloner, Disposer); template<typename Cloner, typename Disposer> - void clone_from(treap &&, Cloner, Disposer); - iterator insert_equal(reference); - iterator insert_equal(const_iterator, reference); - template<typename Iterator> void insert_equal(Iterator, Iterator); - std::pair< iterator, bool > insert_unique(reference); - iterator insert_unique(const_iterator, reference); - template<typename Iterator> void insert_unique(Iterator, Iterator); + void clone_from(treap &&, Cloner, Disposer); + iterator insert_equal(reference); + iterator insert_equal(const_iterator, reference); + template<typename Iterator> void insert_equal(Iterator, Iterator); + std::pair< iterator, bool > insert_unique(reference); + iterator insert_unique(const_iterator, reference); + template<typename Iterator> void insert_unique(Iterator, Iterator); template<typename KeyType, typename KeyTypeKeyCompare, typename KeyValuePrioCompare> std::pair< iterator, bool > - insert_unique_check(const KeyType &, KeyTypeKeyCompare, + insert_unique_check(const KeyType &, KeyTypeKeyCompare, KeyValuePrioCompare, insert_commit_data &); template<typename KeyType, typename KeyTypeKeyCompare, typename KeyValuePrioCompare> std::pair< iterator, bool > - insert_unique_check(const_iterator, const KeyType &, KeyTypeKeyCompare, + insert_unique_check(const_iterator, const KeyType &, KeyTypeKeyCompare, KeyValuePrioCompare, insert_commit_data &); - iterator insert_unique_commit(reference, const insert_commit_data &); - iterator insert_before(const_iterator, reference); - void push_back(reference); - void push_front(reference); - iterator erase(const_iterator); - iterator erase(const_iterator, const_iterator); - size_type erase(const key_type &); + iterator insert_unique_commit(reference, const insert_commit_data &); + iterator insert_before(const_iterator, reference); + void push_back(reference); + void push_front(reference); + iterator erase(const_iterator); + iterator erase(const_iterator, const_iterator); + size_type erase(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - size_type erase(const KeyType &, KeyTypeKeyCompare); + size_type erase(const KeyType &, KeyTypeKeyCompare); template<typename Disposer> - iterator erase_and_dispose(const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, Disposer); template<typename Disposer> - iterator erase_and_dispose(const_iterator, const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, const_iterator, Disposer); template<typename Disposer> - size_type erase_and_dispose(const key_type &, Disposer); + size_type erase_and_dispose(const key_type &, Disposer); template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> - size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); - void clear(); - template<typename Disposer> void clear_and_dispose(Disposer); - template<typename ExtraChecker> void check(ExtraChecker) const; - void check() const; - size_type count(const key_type &) const; + size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); + void clear(); + template<typename Disposer> void clear_and_dispose(Disposer); + template<typename ExtraChecker> void check(ExtraChecker) const; + void check() const; + size_type count(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - size_type count(const KeyType &, KeyTypeKeyCompare) const; - iterator lower_bound(const key_type &); + size_type count(const KeyType &, KeyTypeKeyCompare) const; + iterator lower_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator lower_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator lower_bound(const key_type &) const; + iterator lower_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator lower_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator upper_bound(const key_type &); + const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator upper_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator upper_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator upper_bound(const key_type &) const; + iterator upper_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator upper_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator find(const key_type &); + const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator find(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator find(const KeyType &, KeyTypeKeyCompare); - const_iterator find(const key_type &) const; + iterator find(const KeyType &, KeyTypeKeyCompare); + const_iterator find(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator find(const KeyType &, KeyTypeKeyCompare) const; - std::pair< iterator, iterator > equal_range(const key_type &); + const_iterator find(const KeyType &, KeyTypeKeyCompare) const; + std::pair< iterator, iterator > equal_range(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - equal_range(const KeyType &, KeyTypeKeyCompare); + equal_range(const KeyType &, KeyTypeKeyCompare); std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; + equal_range(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - equal_range(const KeyType &, KeyTypeKeyCompare) const; + equal_range(const KeyType &, KeyTypeKeyCompare) const; std::pair< iterator, iterator > - bounded_range(const key_type &, const key_type &, bool, bool); + bounded_range(const key_type &, const key_type &, bool, bool); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool); std::pair< const_iterator, const_iterator > - bounded_range(const key_type &, const key_type &, bool, bool) const; + bounded_range(const key_type &, const key_type &, bool, bool) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool) const; - iterator iterator_to(reference); - const_iterator iterator_to(const_reference) const; - pointer unlink_leftmost_without_rebalance(); - void replace_node(iterator, reference); - void remove_node(reference); + iterator iterator_to(reference); + const_iterator iterator_to(const_reference) const; + pointer unlink_leftmost_without_rebalance(); + void replace_node(iterator, reference); + void remove_node(reference); - // public static functions - static treap & container_from_end_iterator(iterator); - static const treap & container_from_end_iterator(const_iterator); - static treap & container_from_iterator(iterator); - static const treap & container_from_iterator(const_iterator); - static iterator s_iterator_to(reference); - static const_iterator s_iterator_to(const_reference); - static void init_node(reference); + // public static functions + static treap & container_from_end_iterator(iterator); + static const treap & container_from_end_iterator(const_iterator); + static treap & container_from_iterator(iterator); + static const treap & container_from_iterator(const_iterator); + static iterator s_iterator_to(reference); + static const_iterator s_iterator_to(const_reference); + static void init_node(reference); // public data members static const bool constant_time_size; @@ -205,18 +205,18 @@ static const bool safemode_or_autounlink; };
    -

    Description

    +

    Description

    The class template treap is an intrusive treap container that is used to construct intrusive set and multiset containers. The no-throw guarantee holds only, if the key_compare object and priority_compare object don't throw.

    The template parameter T is the type to be managed by the container. The user can specify additional options and if no options are provided default options are used.

    The container supports the following options: base_hook<>/member_hook<>/value_traits<>, constant_time_size<>, size_type<>, compare<> and priority_compare<>

    -

    +

    treap public construct/copy/destruct

    1. -
      explicit treap(const key_compare & cmp = key_compare(), 
+
      explicit treap(const key_compare & cmp = key_compare(), 
                const priority_compare & pcmp = priority_compare(), 
                const value_traits & v_traits = value_traits());
      
 
      Effects: Constructs an empty container.
      
@@ -225,7 +225,7 @@
 
    2. template<typename Iterator> 
-  treap(bool unique, Iterator b, Iterator e, 
+  treap(bool unique, Iterator b, Iterator e, 
         const key_compare & cmp = key_compare(), 
         const priority_compare & pcmp = priority_compare(), 
         const value_traits & v_traits = value_traits());
      @@ -235,15 +235,15 @@

      Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor/operator() of the key_compare/priority_compare objects throw. Basic guarantee.

    3. -
      treap(treap && x);
      +
      treap(treap && x);

      Effects: to-do

    4. -
      treap & operator=(treap && x);
      +
      treap & operator=(treap && x);

      Effects: to-do

    5. -
      ~treap();
      +
      ~treap();

      Effects: Detaches all elements from this. The objects in the set are not deleted (i.e. no destructors are called), but the nodes according to the value_traits template parameter are reinitialized and thus can be reused.

      Complexity: Linear to elements contained in *this.

      Throws: Nothing.

      @@ -251,159 +251,159 @@
    -

    -treap public member functions

    +

    +treap public member functions

    1. template<typename KeyPrioComp> 
-  unspecified key_node_prio_comp(KeyPrioComp keypriocomp) const;
      2. -
    2. value_node_prio_comp_t value_node_prio_comp() const;
      3. + unspecified key_node_prio_comp(KeyPrioComp keypriocomp) const; +
    3. value_node_prio_comp_t value_node_prio_comp() const;
    4. -
      iterator begin();
      +
      iterator begin();

      Effects: Returns an iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    5. -
      const_iterator begin() const;
      +
      const_iterator begin() const;

      Effects: Returns a const_iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    6. -
      const_iterator cbegin() const;
      +
      const_iterator cbegin() const;

      Effects: Returns a const_iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    7. -
      iterator end();
      +
      iterator end();

      Effects: Returns an iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    8. -
      const_iterator end() const;
      +
      const_iterator end() const;

      Effects: Returns a const_iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    9. -
      const_iterator cend() const;
      +
      const_iterator cend() const;

      Effects: Returns a const_iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    10. -
      iterator top();
      +
      iterator top();

      Effects: Returns an iterator pointing to the highest priority object of the treap.

      Complexity: Constant.

      Throws: Nothing.

    11. -
      const_iterator top() const;
      +
      const_iterator top() const;

      Effects: Returns a const_iterator pointing to the highest priority object of the treap..

      Complexity: Constant.

      Throws: Nothing.

    12. -
      const_iterator ctop() const;
      +
      const_iterator ctop() const;

      Effects: Returns a const_iterator pointing to the highest priority object of the treap..

      Complexity: Constant.

      Throws: Nothing.

    13. -
      reverse_iterator rbegin();
      +
      reverse_iterator rbegin();

      Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    14. -
      const_reverse_iterator rbegin() const;
      +
      const_reverse_iterator rbegin() const;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    15. -
      const_reverse_iterator crbegin() const;
      +
      const_reverse_iterator crbegin() const;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    16. -
      reverse_iterator rend();
      +
      reverse_iterator rend();

      Effects: Returns a reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    17. -
      const_reverse_iterator rend() const;
      +
      const_reverse_iterator rend() const;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    18. -
      const_reverse_iterator crend() const;
      +
      const_reverse_iterator crend() const;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    19. -
      reverse_iterator rtop();
      +
      reverse_iterator rtop();

      Effects: Returns a reverse_iterator pointing to the highest priority object of the reversed treap.

      Complexity: Constant.

      Throws: Nothing.

    20. -
      const_reverse_iterator rtop() const;
      +
      const_reverse_iterator rtop() const;

      Effects: Returns a const_reverse_iterator pointing to the highest priority objec of the reversed treap.

      Complexity: Constant.

      Throws: Nothing.

    21. -
      const_reverse_iterator crtop() const;
      +
      const_reverse_iterator crtop() const;

      Effects: Returns a const_reverse_iterator pointing to the highest priority object of the reversed treap.

      Complexity: Constant.

      Throws: Nothing.

    22. -
      key_compare key_comp() const;
      +
      key_compare key_comp() const;

      Effects: Returns the key_compare object used by the container.

      Complexity: Constant.

      Throws: If key_compare copy-constructor throws.

    23. -
      value_compare value_comp() const;
      +
      value_compare value_comp() const;

      Effects: Returns the value_compare object used by the container.

      Complexity: Constant.

      Throws: If value_compare copy-constructor throws.

    24. -
      bool empty() const;
      +
      bool empty() const;

      Effects: Returns true if the container is empty.

      Complexity: Constant.

      Throws: Nothing.

    25. -
      size_type size() const;
      +
      size_type size() const;

      Effects: Returns the number of elements stored in the container.

      Complexity: Linear to elements contained in *this if constant-time size option is disabled. Constant time otherwise.

      Throws: Nothing.

    26. -
      priority_compare priority_comp() const;
      +
      priority_compare priority_comp() const;

      Effects: Returns the priority_compare object used by the container.

      Complexity: Constant.

      Throws: If priority_compare copy-constructor throws.

    27. -
      void swap(treap & other);
      +
      void swap(treap & other);

      Effects: Swaps the contents of two treaps.

      Complexity: Constant.

      Throws: If the comparison functor's swap call throws. 

    28. template<typename Cloner, typename Disposer> 
-  void clone_from(const treap & src, Cloner cloner, Disposer disposer);
      + void clone_from(const treap & src, Cloner cloner, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

      Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(const_reference ) and inserts them on *this. Copies the predicate from the source container.

      If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

      @@ -412,7 +412,7 @@ 
    29. template<typename Cloner, typename Disposer> 
-  void clone_from(treap && src, Cloner cloner, Disposer disposer);
      + void clone_from(treap && src, Cloner cloner, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

      Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(reference) and inserts them on *this. Copies the predicate from the source container.

      If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

      @@ -420,7 +420,7 @@

      Throws: If cloner throws or predicate copy assignment throws. Basic guarantee.

    30. -
      iterator insert_equal(reference value);
      +
      iterator insert_equal(reference value);

      Requires: value must be an lvalue

      Effects: Inserts value into the container before the upper bound.

      Complexity: Average complexity for insert element is at most logarithmic.

      @@ -428,7 +428,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    31. -
      iterator insert_equal(const_iterator hint, reference value);
      +
      iterator insert_equal(const_iterator hint, reference value);

      Requires: value must be an lvalue, and "hint" must be a valid iterator.

      Effects: Inserts x into the container, using "hint" as a hint to where it will be inserted. If "hint" is the upper_bound the insertion takes constant time (two comparisons in the worst case)

      Complexity: Logarithmic in general, but it is amortized constant time if t is inserted immediately before hint.

      @@ -436,7 +436,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    32. -
      template<typename Iterator> void insert_equal(Iterator b, Iterator e);
      +
      template<typename Iterator> void insert_equal(Iterator b, Iterator e);

      Requires: Dereferencing iterator must yield an lvalue of type value_type.

      Effects: Inserts a each element of a range into the container before the upper bound of the key of each element.

      Complexity: Insert range is in general O(N * log(N)), where N is the size of the range. However, it is linear in N if the range is already sorted by key_comp().

      @@ -444,7 +444,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    33. -
      std::pair< iterator, bool > insert_unique(reference value);
      +
      std::pair< iterator, bool > insert_unique(reference value);

      Requires: value must be an lvalue

      Effects: Inserts value into the container if the value is not already present.

      Complexity: Average complexity for insert element is at most logarithmic.

      @@ -452,7 +452,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    34. -
      iterator insert_unique(const_iterator hint, reference value);
      +
      iterator insert_unique(const_iterator hint, reference value);

      Requires: value must be an lvalue, and "hint" must be a valid iterator

      Effects: Tries to insert x into the container, using "hint" as a hint to where it will be inserted.

      Complexity: Logarithmic in general, but it is amortized constant time (two comparisons in the worst case) if t is inserted immediately before hint.

      @@ -460,7 +460,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    35. -
      template<typename Iterator> void insert_unique(Iterator b, Iterator e);
      +
      template<typename Iterator> void insert_unique(Iterator b, Iterator e);

      Requires: Dereferencing iterator must yield an lvalue of type value_type.

      Effects: Tries to insert each element of a range into the container.

      Complexity: Insert range is in general O(N * log(N)), where N is the size of the range. However, it is linear in N if the range is already sorted by key_comp().

      @@ -471,7 +471,7 @@ 
      template<typename KeyType, typename KeyTypeKeyCompare, 
          typename KeyValuePrioCompare> 
   std::pair< iterator, bool > 
-  insert_unique_check(const KeyType & key, KeyTypeKeyCompare comp, 
+  insert_unique_check(const KeyType & key, KeyTypeKeyCompare comp, 
                       KeyValuePrioCompare key_value_pcomp, 
                       insert_commit_data & commit_data);

      Requires: comp must be a comparison function that induces the same strict weak ordering as key_compare. key_value_pcomp must be a comparison function that induces the same strict weak ordering as priority_compare. The difference is that key_value_pcomp and comp compare an arbitrary key with the contained values.

      @@ -487,7 +487,7 @@ 
      template<typename KeyType, typename KeyTypeKeyCompare, 
          typename KeyValuePrioCompare> 
   std::pair< iterator, bool > 
-  insert_unique_check(const_iterator hint, const KeyType & key, 
+  insert_unique_check(const_iterator hint, const KeyType & key, 
                       KeyTypeKeyCompare comp, 
                       KeyValuePrioCompare key_value_pcomp, 
                       insert_commit_data & commit_data);
      @@ -501,7 +501,7 @@

      "commit_data" remains valid for a subsequent "insert_commit" only if no more objects are inserted or erased from the container.

    36. -
      iterator insert_unique_commit(reference value, 
+
      iterator insert_unique_commit(reference value, 
                               const insert_commit_data & commit_data);
      
 
      Requires: value must be an lvalue of type value_type. commit_data must have been obtained from a previous call to "insert_check". No objects should have been inserted or erased from the container between the "insert_check" that filled "commit_data" and the call to "insert_commit".
      
 
      Effects: Inserts the value in the avl_set using the information obtained from the "commit_data" that a previous "insert_check" filled.
      
@@ -511,7 +511,7 @@
 
      Notes: This function has only sense if a "insert_check" has been previously executed to fill "commit_data". No value should be inserted or erased between the "insert_check" and "insert_commit" calls.
    37. -
      iterator insert_before(const_iterator pos, reference value);
      +
      iterator insert_before(const_iterator pos, reference value);

      Requires: value must be an lvalue, "pos" must be a valid iterator (or end) and must be the succesor of value once inserted according to the predicate

      Effects: Inserts x into the container before "pos".

      Complexity: Constant time.

      @@ -519,7 +519,7 @@

      Note: This function does not check preconditions so if "pos" is not the successor of "value" container ordering invariant will be broken. This is a low-level function to be used only for performance reasons by advanced users.

    38. -
      void push_back(reference value);
      +
      void push_back(reference value);

      Requires: value must be an lvalue, and it must be no less than the greatest inserted key

      Effects: Inserts x into the container in the last position.

      Complexity: Constant time.

      @@ -527,7 +527,7 @@

      Note: This function does not check preconditions so if value is less than the greatest inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

    39. -
      void push_front(reference value);
      +
      void push_front(reference value);

      Requires: value must be an lvalue, and it must be no greater than the minimum inserted key

      Effects: Inserts x into the container in the first position.

      Complexity: Constant time.

      @@ -535,21 +535,21 @@

      Note: This function does not check preconditions so if value is greater than the minimum inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

    40. -
      iterator erase(const_iterator i);
      +
      iterator erase(const_iterator i);

      Effects: Erases the element pointed to by i.

      Complexity: Average complexity for erase element is constant time.

      Throws: if the internal priority_compare function throws. Strong guarantee.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    41. -
      iterator erase(const_iterator b, const_iterator e);
      +
      iterator erase(const_iterator b, const_iterator e);

      Effects: Erases the range pointed to by b end e.

      Complexity: Average complexity for erase range is at most O(log(size() + N)), where N is the number of elements in the range.

      Throws: if the internal priority_compare function throws. Strong guarantee.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    42. -
      size_type erase(const key_type & key);
      +
      size_type erase(const key_type & key);

      Effects: Erases all the elements with the given value.

      Returns: The number of erased elements.

      Complexity: O(log(size() + N).

      @@ -558,7 +558,7 @@ 
    43. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type erase(const KeyType & key, KeyTypeKeyCompare comp);
      + size_type erase(const KeyType & key, KeyTypeKeyCompare comp);

      Effects: Erases all the elements with the given key. according to the comparison functor "comp".

      Returns: The number of erased elements.

      Complexity: O(log(size() + N).

      @@ -567,7 +567,7 @@ 
    44. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator i, Disposer disposer);
      + iterator erase_and_dispose(const_iterator i, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases the element pointed to by i. Disposer::operator()(pointer) is called for the removed element.

      Complexity: Average complexity for erase element is constant time.

      @@ -576,7 +576,7 @@ 
    45. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator b, const_iterator e, 
+  iterator erase_and_dispose(const_iterator b, const_iterator e, 
                              Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases the range pointed to by b end e. Disposer::operator()(pointer) is called for the removed elements.

      @@ -586,7 +586,7 @@ 
    46. template<typename Disposer> 
-  size_type erase_and_dispose(const key_type & key, Disposer disposer);
      + size_type erase_and_dispose(const key_type & key, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases all the elements with the given value. Disposer::operator()(pointer) is called for the removed elements.

      Returns: The number of erased elements.

      @@ -596,7 +596,7 @@ 
    47. template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> 
-  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
+  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
                               Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases all the elements with the given key. according to the comparison functor "comp". Disposer::operator()(pointer) is called for the removed elements.

      @@ -606,58 +606,59 @@

      Note: Invalidates the iterators to the erased elements.

    48. -
      void clear();
      +
      void clear();

      Effects: Erases all of the elements.

      Complexity: Linear to the number of elements on the container. if it's a safe-mode or auto-unlink value_type. Constant time otherwise.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    49. -
      template<typename Disposer> void clear_and_dispose(Disposer disposer);
      +
      template<typename Disposer> void clear_and_dispose(Disposer disposer);

      Effects: Erases all of the elements calling disposer(p) for each node to be erased. Complexity: Average complexity for is at most O(log(size() + N)), where N is the number of elements in the container.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. Calls N times to disposer functor.

    50. -
      template<typename ExtraChecker> void check(ExtraChecker extra_checker) const;
      +
      template<typename ExtraChecker> void check(ExtraChecker extra_checker) const;

      Effects: Asserts the integrity of the container with additional checks provided by the user.

      Complexity: Linear time.

      Note: The method might not have effect when asserts are turned off (e.g., with NDEBUG). Experimental function, interface might change in future versions.

    51. -
      void check() const;
      +
      void check() const;

      Effects: Asserts the integrity of the container.

      Complexity: Linear time.

      Note: The method has no effect when asserts are turned off (e.g., with NDEBUG). Experimental function, interface might change in future versions.

    52. -
      size_type count(const key_type & key) const;
      +
      size_type count(const key_type & key) const;

      Effects: Returns the number of contained elements with the given value

      Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given value.

      Throws: If key_compare throws. 

    53. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;
      + size_type count(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      Effects: Returns the number of contained elements with the given key

      Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given key.

      Throws: If comp throws.

    54. -
      iterator lower_bound(const key_type & key);
      +
      iterator lower_bound(const key_type & key);

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    55. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      -

      Throws: If comp throws.

      +

      Throws: If key_compare throws.

    56. -
      const_iterator lower_bound(const key_type & key) const;
      +
      const_iterator lower_bound(const key_type & key) const;

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -665,26 +666,27 @@ 
    57. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
      -

      Effects: Returns a const iterator to the first element whose key is not less than k or end() if that element does not exist.

      + lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      -

      Throws: If comp throws.

      +

      Throws: If key_compare throws.

    58. -
      iterator upper_bound(const key_type & key);
      +
      iterator upper_bound(const key_type & key);

      Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    59. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    60. -
      const_iterator upper_bound(const key_type & key) const;
      +
      const_iterator upper_bound(const key_type & key) const;

      Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -692,39 +694,42 @@ 
    61. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
      + upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    62. -
      iterator find(const key_type & key);
      +
      iterator find(const key_type & key);

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    63. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator find(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator find(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    64. -
      const_iterator find(const key_type & key) const;
      -

      Effects: Finds a const_iterator to the first element whose key is k or end() if that element does not exist.

      +
      const_iterator find(const key_type & key) const;
      +

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    65. template<typename KeyType, typename KeyTypeKeyCompare> 
-  const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;
      -

      Effects: Finds a const_iterator to the first element whose key is k or end() if that element does not exist.

      + const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      +

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    66. -
      std::pair< iterator, iterator > equal_range(const key_type & key);
      +
      std::pair< iterator, iterator > equal_range(const key_type & key);

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -732,14 +737,15 @@ 
    67. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp);
      + equal_range(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If comp throws. 

    68. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & key) const;
      +equal_range(const key_type & key) const;

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -747,16 +753,18 @@ 
    69. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;
      + equal_range(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If comp throws. 

    70. std::pair< iterator, iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed);
      -

      Requires: 'lower_key' must not be greater than 'upper_key'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key) if left_closed, upper_bound(lower_key) otherwise

      second = upper_bound(upper_key) if right_closed, lower_bound(upper_key) otherwise

      @@ -768,9 +776,12 @@ 
    71. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed);
      -

      Requires: KeyTypeKeyCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the container. 'lower_key' must not be greater than 'upper_key' according to 'comp'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

      +

      upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

      +

      upper_key shall not precede lower_key according to comp [comp(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!comp(upper_key, lower_key) && !comp(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key, comp) if left_closed, upper_bound(lower_key, comp) otherwise

      second = upper_bound(upper_key, comp) if right_closed, lower_bound(upper_key, comp) otherwise

      @@ -781,9 +792,10 @@ 
    72. std::pair< const_iterator, const_iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed) const;
      -

      Requires: 'lower_key' must not be greater than 'upper_key'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key) if left_closed, upper_bound(lower_key) otherwise

      second = upper_bound(upper_key) if right_closed, lower_bound(upper_key) otherwise

      @@ -795,9 +807,12 @@ 
    73. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed) const;
      -

      Requires: KeyTypeKeyCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the container. 'lower_key' must not be greater than 'upper_key' according to 'comp'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

      +

      upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

      +

      upper_key shall not precede lower_key according to comp [comp(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!comp(upper_key, lower_key) && !comp(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key, comp) if left_closed, upper_bound(lower_key, comp) otherwise

      second = upper_bound(upper_key, comp) if right_closed, lower_bound(upper_key, comp) otherwise

      @@ -807,28 +822,28 @@

      Note: Experimental function, the interface might change in future releases.

    74. -
      iterator iterator_to(reference value);
      +
      iterator iterator_to(reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      Throws: Nothing.

    75. -
      const_iterator iterator_to(const_reference value) const;
      +
      const_iterator iterator_to(const_reference value) const;

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid const_iterator i belonging to the set that points to the value

      Complexity: Constant.

      Throws: Nothing.

    76. -
      pointer unlink_leftmost_without_rebalance();
      +
      pointer unlink_leftmost_without_rebalance();

      Effects: Unlinks the leftmost node from the container.

      Complexity: Average complexity is constant time.

      Throws: Nothing.

      Notes: This function breaks the container and the container can only be used for more unlink_leftmost_without_rebalance calls. This function is normally used to achieve a step by step controlled destruction of the container.

    77. -
      void replace_node(iterator replace_this, reference with_this);
      +
      void replace_node(iterator replace_this, reference with_this);

      Requires: replace_this must be a valid iterator of *this and with_this must not be inserted in any container.

      Effects: Replaces replace_this in its position in the container with with_this. The container does not need to be rebalanced.

      Complexity: Constant.

      @@ -836,7 +851,7 @@

      Note: This function will break container ordering invariants if with_this is not equivalent to *replace_this according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing or comparison is needed.

    78. -
      void remove_node(reference value);
      +
      void remove_node(reference value);

      Effects: removes "value" from the container.

      Throws: Nothing.

      Complexity: Logarithmic time.

      @@ -846,39 +861,39 @@
    -

    -treap public static functions

    +

    +treap public static functions

    1. -
      static treap & container_from_end_iterator(iterator end_iterator);
      +
      static treap & container_from_end_iterator(iterator end_iterator);

      Precondition: end_iterator must be a valid end iterator of the container.

      Effects: Returns a const reference to the container associated to the end iterator

      Throws: Nothing.

      Complexity: Constant.

    2. -
      static const treap & container_from_end_iterator(const_iterator end_iterator);
      +
      static const treap & container_from_end_iterator(const_iterator end_iterator);

      Precondition: end_iterator must be a valid end iterator of the container.

      Effects: Returns a const reference to the container associated to the end iterator

      Throws: Nothing.

      Complexity: Constant.

    3. -
      static treap & container_from_iterator(iterator it);
      +
      static treap & container_from_iterator(iterator it);

      Precondition: it must be a valid iterator of the container.

      Effects: Returns a const reference to the container associated to the iterator

      Throws: Nothing.

      Complexity: Logarithmic.

    4. -
      static const treap & container_from_iterator(const_iterator it);
      +
      static const treap & container_from_iterator(const_iterator it);

      Precondition: it must be a valid iterator of the container.

      Effects: Returns a const reference to the container associated to the iterator

      Throws: Nothing.

      Complexity: Logarithmic.

    5. -
      static iterator s_iterator_to(reference value);
      +
      static iterator s_iterator_to(reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      @@ -886,7 +901,7 @@

      Note: This static function is available only if the value traits is stateless.

    6. -
      static const_iterator s_iterator_to(const_reference value);
      +
      static const_iterator s_iterator_to(const_reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      @@ -894,7 +909,7 @@

      Note: This static function is available only if the value traits is stateless.

    7. -
      static void init_node(reference value);
      +
      static void init_node(reference value);

      Requires: value shall not be in a container.

      Effects: init_node puts the hook of a value in a well-known default state.

      Throws: Nothing.

      diff --git a/doc/html/boost/intrusive/treap_algorithms.html b/doc/html/boost/intrusive/treap_algorithms.html index 1cf7b06730..41c6a99479 100644 --- a/doc/html/boost/intrusive/treap_algorithms.html +++ b/doc/html/boost/intrusive/treap_algorithms.html @@ -46,93 +46,93 @@ struct insert_commit_data { }; - // public static functions - static node_ptr get_header(const const_node_ptr &); - static node_ptr begin_node(const const_node_ptr &); - static node_ptr end_node(const const_node_ptr &); - static void swap_tree(const node_ptr &, const node_ptr &); - static void swap_nodes(const node_ptr &, const node_ptr &); - static void swap_nodes(const node_ptr &, const node_ptr &, const node_ptr &, + // public static functions + static node_ptr get_header(const const_node_ptr &); + static node_ptr begin_node(const const_node_ptr &); + static node_ptr end_node(const const_node_ptr &); + static void swap_tree(const node_ptr &, const node_ptr &); + static void swap_nodes(const node_ptr &, const node_ptr &); + static void swap_nodes(const node_ptr &, const node_ptr &, const node_ptr &, const node_ptr &); - static void replace_node(const node_ptr &, const node_ptr &); - static void replace_node(const node_ptr &, const node_ptr &, + static void replace_node(const node_ptr &, const node_ptr &); + static void replace_node(const node_ptr &, const node_ptr &, const node_ptr &); template<typename NodePtrPriorityCompare> - static void unlink(const node_ptr &, NodePtrPriorityCompare); - static node_ptr unlink_leftmost_without_rebalance(const node_ptr &); - static bool unique(const const_node_ptr &); - static std::size_t size(const const_node_ptr &); - static node_ptr next_node(const node_ptr &); - static node_ptr prev_node(const node_ptr &); - static void init(const node_ptr &); - static void init_header(const node_ptr &); + static void unlink(const node_ptr &, NodePtrPriorityCompare); + static node_ptr unlink_leftmost_without_rebalance(const node_ptr &); + static bool unique(const const_node_ptr &); + static std::size_t size(const const_node_ptr &); + static node_ptr next_node(const node_ptr &); + static node_ptr prev_node(const node_ptr &); + static void init(const node_ptr &); + static void init_header(const node_ptr &); template<typename NodePtrPriorityCompare> static node_ptr - erase(const node_ptr &, const node_ptr &, NodePtrPriorityCompare); + erase(const node_ptr &, const node_ptr &, NodePtrPriorityCompare); template<typename Cloner, typename Disposer> - static void clone(const const_node_ptr &, const node_ptr &, Cloner, + static void clone(const const_node_ptr &, const node_ptr &, Cloner, Disposer); template<typename Disposer> - static void clear_and_dispose(const node_ptr &, Disposer); + static void clear_and_dispose(const node_ptr &, Disposer); template<typename KeyType, typename KeyNodePtrCompare> static node_ptr - lower_bound(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + lower_bound(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static node_ptr - upper_bound(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + upper_bound(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static node_ptr - find(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + find(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, node_ptr > - equal_range(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + equal_range(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, node_ptr > - bounded_range(const const_node_ptr &, const KeyType &, const KeyType &, + bounded_range(const const_node_ptr &, const KeyType &, const KeyType &, KeyNodePtrCompare, bool, bool); template<typename KeyType, typename KeyNodePtrCompare> static std::size_t - count(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + count(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename NodePtrCompare, typename NodePtrPriorityCompare> static node_ptr - insert_equal_upper_bound(const node_ptr &, const node_ptr &, + insert_equal_upper_bound(const node_ptr &, const node_ptr &, NodePtrCompare, NodePtrPriorityCompare); template<typename NodePtrCompare, typename NodePtrPriorityCompare> static node_ptr - insert_equal_lower_bound(const node_ptr &, const node_ptr &, + insert_equal_lower_bound(const node_ptr &, const node_ptr &, NodePtrCompare, NodePtrPriorityCompare); template<typename NodePtrCompare, typename NodePtrPriorityCompare> static node_ptr - insert_equal(const node_ptr &, const node_ptr &, const node_ptr &, + insert_equal(const node_ptr &, const node_ptr &, const node_ptr &, NodePtrCompare, NodePtrPriorityCompare); template<typename NodePtrPriorityCompare> static node_ptr - insert_before(const node_ptr &, const node_ptr &, const node_ptr &, + insert_before(const node_ptr &, const node_ptr &, const node_ptr &, NodePtrPriorityCompare); template<typename NodePtrPriorityCompare> - static void push_back(const node_ptr &, const node_ptr &, + static void push_back(const node_ptr &, const node_ptr &, NodePtrPriorityCompare); template<typename NodePtrPriorityCompare> - static void push_front(const node_ptr &, const node_ptr &, + static void push_front(const node_ptr &, const node_ptr &, NodePtrPriorityCompare); template<typename KeyType, typename KeyNodePtrCompare, typename KeyNodePtrPrioCompare> static std::pair< node_ptr, bool > - insert_unique_check(const const_node_ptr &, const KeyType &, + insert_unique_check(const const_node_ptr &, const KeyType &, KeyNodePtrCompare, KeyNodePtrPrioCompare, insert_commit_data &); template<typename KeyType, typename KeyNodePtrCompare, typename KeyNodePtrPrioCompare> static std::pair< node_ptr, bool > - insert_unique_check(const const_node_ptr &, const node_ptr &, + insert_unique_check(const const_node_ptr &, const node_ptr &, const KeyType &, KeyNodePtrCompare, KeyNodePtrPrioCompare, insert_commit_data &); - static void insert_unique_commit(const node_ptr &, const node_ptr &, + static void insert_unique_commit(const node_ptr &, const node_ptr &, const insert_commit_data &); - static bool is_header(const const_node_ptr &); + static bool is_header(const const_node_ptr &); };
    -

    Description

    +

    Description

    treap_algorithms provides basic algorithms to manipulate nodes forming a treap.

    (1) the header node is maintained with links not only to the root but also to the leftmost node of the tree, to enable constant time begin(), and to the rightmost node of the tree, to enable linear time performance when used with the generic set algorithms (set_union, etc.);

    (2) when a node being deleted has two children its successor node is relinked into its place, rather than copied, so that the only pointers invalidated are those referring to the deleted node.

    @@ -149,39 +149,39 @@

    static node_ptr get_right(const_node_ptr n);

    static void set_right(node_ptr n, node_ptr right);

    -

    -treap_algorithms public static functions

    +

    +treap_algorithms public static functions

    1. -
      static node_ptr get_header(const const_node_ptr & n);
      +
      static node_ptr get_header(const const_node_ptr & n);

      Requires: 'node' is a node of the tree or a header node.

      Effects: Returns the header of the tree.

      Complexity: Logarithmic.

      Throws: Nothing.

    2. -
      static node_ptr begin_node(const const_node_ptr & header);
      +
      static node_ptr begin_node(const const_node_ptr & header);

      Requires: 'header' is the header node of a tree.

      Effects: Returns the first node of the tree, the header if the tree is empty.

      Complexity: Constant time.

      Throws: Nothing.

    3. -
      static node_ptr end_node(const const_node_ptr & header);
      +
      static node_ptr end_node(const const_node_ptr & header);

      Requires: 'header' is the header node of a tree.

      Effects: Returns the header of the tree.

      Complexity: Constant time.

      Throws: Nothing.

    4. -
      static void swap_tree(const node_ptr & header1, const node_ptr & header2);
      +
      static void swap_tree(const node_ptr & header1, const node_ptr & header2);

      Requires: header1 and header2 must be the header nodes of two trees.

      Effects: Swaps two trees. After the function header1 will contain links to the second tree and header2 will have links to the first tree.

      Complexity: Constant.

      Throws: Nothing.

    5. -
      static void swap_nodes(const node_ptr & node1, const node_ptr & node2);
      +
      static void swap_nodes(const node_ptr & node1, const node_ptr & node2);

      Requires: node1 and node2 can't be header nodes of two trees.

      Effects: Swaps two nodes. After the function node1 will be inserted in the position node2 before the function. node2 will be inserted in the position node1 had before the function.

      Complexity: Logarithmic.

      @@ -190,7 +190,7 @@

      Experimental function

    6. -
      static void swap_nodes(const node_ptr & node1, const node_ptr & header1, 
+
      static void swap_nodes(const node_ptr & node1, const node_ptr & header1, 
                        const node_ptr & node2, const node_ptr & header2);
      
 
      Requires: node1 and node2 can't be header nodes of two trees with header header1 and header2.
      
 
      Effects: Swaps two nodes. After the function node1 will be inserted in the position node2 before the function. node2 will be inserted in the position node1 had before the function.
      
@@ -200,7 +200,7 @@
 
      Experimental function
    7. -
      static void replace_node(const node_ptr & node_to_be_replaced, 
+
      static void replace_node(const node_ptr & node_to_be_replaced, 
                          const node_ptr & new_node);
      
 
      Requires: node_to_be_replaced must be inserted in a tree and new_node must not be inserted in a tree.
      
 
      Effects: Replaces node_to_be_replaced in its position in the tree with new_node. The tree does not need to be rebalanced
      
@@ -209,7 +209,7 @@
 
      Note: This function will break container ordering invariants if new_node is not equivalent to node_to_be_replaced according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing and comparison is needed. Experimental function
    8. -
      static void replace_node(const node_ptr & node_to_be_replaced, 
+
      static void replace_node(const node_ptr & node_to_be_replaced, 
                          const node_ptr & header, const node_ptr & new_node);
      
 
      Requires: node_to_be_replaced must be inserted in a tree with header "header" and new_node must not be inserted in a tree.
      
 
      Effects: Replaces node_to_be_replaced in its position in the tree with new_node. The tree does not need to be rebalanced
      
@@ -219,14 +219,14 @@
 
    9. template<typename NodePtrPriorityCompare> 
-  static void unlink(const node_ptr & node, NodePtrPriorityCompare pcomp);
      + static void unlink(const node_ptr & node, NodePtrPriorityCompare pcomp);

      Requires: node is a tree node but not the header.

      Effects: Unlinks the node and rebalances the tree.

      Complexity: Average complexity is constant time.

      Throws: Nothing.

    10. -
      static node_ptr unlink_leftmost_without_rebalance(const node_ptr & header);
      +
      static node_ptr unlink_leftmost_without_rebalance(const node_ptr & header);

      Requires: header is the header of a tree.

      Effects: Unlinks the leftmost node from the tree, and updates the header link to the new leftmost node.

      Complexity: Average complexity is constant time.

      @@ -234,35 +234,35 @@

      Notes: This function breaks the tree and the tree can only be used for more unlink_leftmost_without_rebalance calls. This function is normally used to achieve a step by step controlled destruction of the tree.

    11. -
      static bool unique(const const_node_ptr & node);
      +
      static bool unique(const const_node_ptr & node);

      Requires: 'node' is a node of the tree or a node initialized by init(...) or init_node.

      Effects: Returns true if the node is initialized by init() or init_node().

      Complexity: Constant time.

      Throws: Nothing.

    12. -
      static std::size_t size(const const_node_ptr & header);
      +
      static std::size_t size(const const_node_ptr & header);

      Requires: node is a node of the tree but it's not the header.

      Effects: Returns the number of nodes of the subtree.

      Complexity: Linear time.

      Throws: Nothing.

    13. -
      static node_ptr next_node(const node_ptr & node);
      +
      static node_ptr next_node(const node_ptr & node);

      Requires: 'node' is a node from the tree except the header.

      Effects: Returns the next node of the tree.

      Complexity: Average constant time.

      Throws: Nothing.

    14. -
      static node_ptr prev_node(const node_ptr & node);
      +
      static node_ptr prev_node(const node_ptr & node);

      Requires: 'node' is a node from the tree except the leftmost node.

      Effects: Returns the previous node of the tree.

      Complexity: Average constant time.

      Throws: Nothing.

    15. -
      static void init(const node_ptr & node);
      +
      static void init(const node_ptr & node);

      Requires: 'node' must not be part of any tree.

      Effects: After the function unique(node) == true.

      Complexity: Constant.

      @@ -270,7 +270,7 @@

      Nodes: If node is inserted in a tree, this function corrupts the tree.

    16. -
      static void init_header(const node_ptr & header);
      +
      static void init_header(const node_ptr & header);

      Requires: node must not be part of any tree.

      Effects: Initializes the header to represent an empty tree. unique(header) == true.

      Complexity: Constant.

      @@ -280,7 +280,7 @@ 
    17. template<typename NodePtrPriorityCompare> 
   static node_ptr 
-  erase(const node_ptr & header, const node_ptr & z, 
+  erase(const node_ptr & header, const node_ptr & z, 
         NodePtrPriorityCompare pcomp);

      Requires: header must be the header of a tree, z a node of that tree and z != header.

      Effects: Erases node "z" from the tree with header "header".

      @@ -289,7 +289,7 @@ 
    18. template<typename Cloner, typename Disposer> 
-  static void clone(const const_node_ptr & source_header, 
+  static void clone(const const_node_ptr & source_header, 
                     const node_ptr & target_header, Cloner cloner, 
                     Disposer disposer);

      Requires: "cloner" must be a function object taking a node_ptr and returning a new cloned node of it. "disposer" must take a node_ptr and shouldn't throw.

      @@ -300,7 +300,7 @@ 
    19. template<typename Disposer> 
-  static void clear_and_dispose(const node_ptr & header, Disposer disposer);
      + static void clear_and_dispose(const node_ptr & header, Disposer disposer);

      Requires: "disposer" must be an object function taking a node_ptr parameter and shouldn't throw.

      Effects: Empties the target tree calling void disposer::operator()(const node_ptr &) for every node of the tree except the header.

      Complexity: Linear to the number of element of the source tree plus the. number of elements of tree target tree when calling this function.

      @@ -309,7 +309,7 @@ 
    20. template<typename KeyType, typename KeyNodePtrCompare> 
   static node_ptr 
-  lower_bound(const const_node_ptr & header, const KeyType & key, 
+  lower_bound(const const_node_ptr & header, const KeyType & key, 
               KeyNodePtrCompare comp);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

      Effects: Returns a node_ptr to the first element that is not less than "key" according to "comp" or "header" if that element does not exist.

      @@ -319,7 +319,7 @@ 
    21. template<typename KeyType, typename KeyNodePtrCompare> 
   static node_ptr 
-  upper_bound(const const_node_ptr & header, const KeyType & key, 
+  upper_bound(const const_node_ptr & header, const KeyType & key, 
               KeyNodePtrCompare comp);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

      Effects: Returns a node_ptr to the first element that is greater than "key" according to "comp" or "header" if that element does not exist.

      @@ -329,7 +329,7 @@ 
    22. template<typename KeyType, typename KeyNodePtrCompare> 
   static node_ptr 
-  find(const const_node_ptr & header, const KeyType & key, 
+  find(const const_node_ptr & header, const KeyType & key, 
        KeyNodePtrCompare comp);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

      Effects: Returns a node_ptr to the first element that is equivalent to "key" according to "comp" or "header" if that element does not exist.

      @@ -339,7 +339,7 @@ 
    23. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, node_ptr > 
-  equal_range(const const_node_ptr & header, const KeyType & key, 
+  equal_range(const const_node_ptr & header, const KeyType & key, 
               KeyNodePtrCompare comp);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

      Effects: Returns an a pair of node_ptr delimiting a range containing all elements that are equivalent to "key" according to "comp" or an empty range that indicates the position where those elements would be if there are no equivalent elements.

      @@ -349,7 +349,7 @@ 
    24. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, node_ptr > 
-  bounded_range(const const_node_ptr & header, const KeyType & lower_key, 
+  bounded_range(const const_node_ptr & header, const KeyType & lower_key, 
                 const KeyType & upper_key, KeyNodePtrCompare comp, 
                 bool left_closed, bool right_closed);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs. 'lower_key' must not be greater than 'upper_key' according to 'comp'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be true.

      @@ -364,7 +364,7 @@ 
    25. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::size_t 
-  count(const const_node_ptr & header, const KeyType & key, 
+  count(const const_node_ptr & header, const KeyType & key, 
         KeyNodePtrCompare comp);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

      Effects: Returns the number of elements with a key equivalent to "key" according to "comp".

      @@ -374,7 +374,7 @@ 
    26. template<typename NodePtrCompare, typename NodePtrPriorityCompare> 
   static node_ptr 
-  insert_equal_upper_bound(const node_ptr & h, const node_ptr & new_node, 
+  insert_equal_upper_bound(const node_ptr & h, const node_ptr & new_node, 
                            NodePtrCompare comp, NodePtrPriorityCompare pcomp);

      Requires: "h" must be the header node of a tree. NodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares two node_ptrs. NodePtrPriorityCompare is a priority function object that induces a strict weak ordering compatible with the one used to create the the tree. NodePtrPriorityCompare compares two node_ptrs.

      Effects: Inserts new_node into the tree before the upper bound according to "comp" and rotates the tree according to "pcomp".

      @@ -384,7 +384,7 @@ 
    27. template<typename NodePtrCompare, typename NodePtrPriorityCompare> 
   static node_ptr 
-  insert_equal_lower_bound(const node_ptr & h, const node_ptr & new_node, 
+  insert_equal_lower_bound(const node_ptr & h, const node_ptr & new_node, 
                            NodePtrCompare comp, NodePtrPriorityCompare pcomp);

      Requires: "h" must be the header node of a tree. NodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares two node_ptrs. NodePtrPriorityCompare is a priority function object that induces a strict weak ordering compatible with the one used to create the the tree. NodePtrPriorityCompare compares two node_ptrs.

      Effects: Inserts new_node into the tree before the upper bound according to "comp" and rotates the tree according to "pcomp".

      @@ -394,7 +394,7 @@ 
    28. template<typename NodePtrCompare, typename NodePtrPriorityCompare> 
   static node_ptr 
-  insert_equal(const node_ptr & h, const node_ptr & hint, 
+  insert_equal(const node_ptr & h, const node_ptr & hint, 
                const node_ptr & new_node, NodePtrCompare comp, 
                NodePtrPriorityCompare pcomp);

      Requires: "header" must be the header node of a tree. NodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares two node_ptrs. "hint" is node from the "header"'s tree. NodePtrPriorityCompare is a priority function object that induces a strict weak ordering compatible with the one used to create the the tree. NodePtrPriorityCompare compares two node_ptrs.

      @@ -405,7 +405,7 @@ 
    29. template<typename NodePtrPriorityCompare> 
   static node_ptr 
-  insert_before(const node_ptr & header, const node_ptr & pos, 
+  insert_before(const node_ptr & header, const node_ptr & pos, 
                 const node_ptr & new_node, NodePtrPriorityCompare pcomp);

      Requires: "header" must be the header node of a tree. "pos" must be a valid node of the tree (including header end) node. "pos" must be a node pointing to the successor to "new_node" once inserted according to the order of already inserted nodes. This function does not check "pos" and this precondition must be guaranteed by the caller. NodePtrPriorityCompare is a priority function object that induces a strict weak ordering compatible with the one used to create the the tree. NodePtrPriorityCompare compares two node_ptrs.

      Effects: Inserts new_node into the tree before "pos" and rotates the tree according to "pcomp".

      @@ -415,7 +415,7 @@ 
    30. template<typename NodePtrPriorityCompare> 
-  static void push_back(const node_ptr & header, const node_ptr & new_node, 
+  static void push_back(const node_ptr & header, const node_ptr & new_node, 
                         NodePtrPriorityCompare pcomp);

      Requires: "header" must be the header node of a tree. "new_node" must be, according to the used ordering no less than the greatest inserted key. NodePtrPriorityCompare is a priority function object that induces a strict weak ordering compatible with the one used to create the the tree. NodePtrPriorityCompare compares two node_ptrs.

      Effects: Inserts x into the tree in the last position and rotates the tree according to "pcomp".

      @@ -425,7 +425,7 @@ 
    31. template<typename NodePtrPriorityCompare> 
-  static void push_front(const node_ptr & header, const node_ptr & new_node, 
+  static void push_front(const node_ptr & header, const node_ptr & new_node, 
                          NodePtrPriorityCompare pcomp);

      Requires: "header" must be the header node of a tree. "new_node" must be, according to the used ordering, no greater than the lowest inserted key. NodePtrPriorityCompare is a priority function object that induces a strict weak ordering compatible with the one used to create the the tree. NodePtrPriorityCompare compares two node_ptrs.

      Effects: Inserts x into the tree in the first position and rotates the tree according to "pcomp".

      @@ -437,7 +437,7 @@ 
      template<typename KeyType, typename KeyNodePtrCompare, 
          typename KeyNodePtrPrioCompare> 
   static std::pair< node_ptr, bool > 
-  insert_unique_check(const const_node_ptr & header, const KeyType & key, 
+  insert_unique_check(const const_node_ptr & header, const KeyType & key, 
                       KeyNodePtrCompare comp, KeyNodePtrPrioCompare pcomp, 
                       insert_commit_data & commit_data);

      Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares KeyType with a node_ptr.

      @@ -453,7 +453,7 @@ 
      template<typename KeyType, typename KeyNodePtrCompare, 
          typename KeyNodePtrPrioCompare> 
   static std::pair< node_ptr, bool > 
-  insert_unique_check(const const_node_ptr & header, const node_ptr & hint, 
+  insert_unique_check(const const_node_ptr & header, const node_ptr & hint, 
                       const KeyType & key, KeyNodePtrCompare comp, 
                       KeyNodePtrPrioCompare pcomp, 
                       insert_commit_data & commit_data);
      @@ -467,7 +467,7 @@

      "commit_data" remains valid for a subsequent "insert_unique_commit" only if no more objects are inserted or erased from the set.

    32. -
      static void insert_unique_commit(const node_ptr & header, 
+
      static void insert_unique_commit(const node_ptr & header, 
                                  const node_ptr & new_node, 
                                  const insert_commit_data & commit_data);
      
 
      Requires: "header" must be the header node of a tree. "commit_data" must have been obtained from a previous call to "insert_unique_check". No objects should have been inserted or erased from the set between the "insert_unique_check" that filled "commit_data" and the call to "insert_commit".
      
@@ -477,7 +477,7 @@
 
      Notes: This function has only sense if a "insert_unique_check" has been previously executed to fill "commit_data". No value should be inserted or erased between the "insert_check" and "insert_commit" calls.
    33. -
      static bool is_header(const const_node_ptr & p);
      +
      static bool is_header(const const_node_ptr & p);

      Requires: p is a node of a tree.

      Effects: Returns true if p is the header of the tree.

      Complexity: Constant.

      diff --git a/doc/html/boost/intrusive/treap_algorithms/insert_commit_data.html b/doc/html/boost/intrusive/treap_algorithms/insert_commit_data.html index b800780d6c..2e5b53bdec 100644 --- a/doc/html/boost/intrusive/treap_algorithms/insert_commit_data.html +++ b/doc/html/boost/intrusive/treap_algorithms/insert_commit_data.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      @@ -37,7 +37,7 @@ struct insert_commit_data { };
      -

      Description

      +

      Description

      This type is the information that will be filled by insert_unique_check

    @@ -51,7 +51,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/intrusive/treap_multiset.html b/doc/html/boost/intrusive/treap_multiset.html index 4422ce99ea..49176a972a 100644 --- a/doc/html/boost/intrusive/treap_multiset.html +++ b/doc/html/boost/intrusive/treap_multiset.html @@ -61,140 +61,140 @@ typedef implementation_defined::node_algorithms node_algorithms; // construct/copy/destruct - explicit treap_multiset(const key_compare & = key_compare(), + explicit treap_multiset(const key_compare & = key_compare(), const priority_compare & = priority_compare(), const value_traits & = value_traits()); template<typename Iterator> - treap_multiset(Iterator, Iterator, const key_compare & = key_compare(), + treap_multiset(Iterator, Iterator, const key_compare & = key_compare(), const priority_compare & = priority_compare(), const value_traits & = value_traits()); - treap_multiset(treap_multiset &&); - treap_multiset & operator=(treap_multiset &&); - ~treap_multiset(); + treap_multiset(treap_multiset &&); + treap_multiset & operator=(treap_multiset &&); + ~treap_multiset(); - // public member functions - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end(); - const_iterator end() const; - const_iterator cend() const; - reverse_iterator rbegin(); - const_reverse_iterator rbegin() const; - const_reverse_iterator crbegin() const; - reverse_iterator rend(); - const_reverse_iterator rend() const; - const_reverse_iterator crend() const; - key_compare key_comp() const; - value_compare value_comp() const; - bool empty() const; - size_type size() const; - void swap(treap_multiset &); + // public member functions + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end(); + const_iterator end() const; + const_iterator cend() const; + reverse_iterator rbegin(); + const_reverse_iterator rbegin() const; + const_reverse_iterator crbegin() const; + reverse_iterator rend(); + const_reverse_iterator rend() const; + const_reverse_iterator crend() const; + key_compare key_comp() const; + value_compare value_comp() const; + bool empty() const; + size_type size() const; + void swap(treap_multiset &); template<typename Cloner, typename Disposer> - void clone_from(const treap_multiset &, Cloner, Disposer); + void clone_from(const treap_multiset &, Cloner, Disposer); template<typename Cloner, typename Disposer> - void clone_from(treap_multiset &&, Cloner, Disposer); - iterator top(); - const_iterator top() const; - const_iterator ctop() const; - reverse_iterator rtop(); - const_reverse_iterator rtop() const; - const_reverse_iterator crtop() const; - priority_compare priority_comp() const; - iterator insert(reference); - iterator insert(const_iterator, reference); - template<typename Iterator> void insert(Iterator, Iterator); - iterator insert_before(const_iterator, reference); - void push_back(reference); - void push_front(reference); - iterator erase(const_iterator); - iterator erase(const_iterator, const_iterator); - size_type erase(const key_type &); + void clone_from(treap_multiset &&, Cloner, Disposer); + iterator top(); + const_iterator top() const; + const_iterator ctop() const; + reverse_iterator rtop(); + const_reverse_iterator rtop() const; + const_reverse_iterator crtop() const; + priority_compare priority_comp() const; + iterator insert(reference); + iterator insert(const_iterator, reference); + template<typename Iterator> void insert(Iterator, Iterator); + iterator insert_before(const_iterator, reference); + void push_back(reference); + void push_front(reference); + iterator erase(const_iterator); + iterator erase(const_iterator, const_iterator); + size_type erase(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - size_type erase(const KeyType &, KeyTypeKeyCompare); + size_type erase(const KeyType &, KeyTypeKeyCompare); template<typename Disposer> - iterator erase_and_dispose(const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, Disposer); template<typename Disposer> - iterator erase_and_dispose(const_iterator, const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, const_iterator, Disposer); template<typename Disposer> - size_type erase_and_dispose(const key_type &, Disposer); + size_type erase_and_dispose(const key_type &, Disposer); template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> - size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); - void clear(); - template<typename Disposer> void clear_and_dispose(Disposer); - size_type count(const key_type &) const; + size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); + void clear(); + template<typename Disposer> void clear_and_dispose(Disposer); + size_type count(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - size_type count(const KeyType &, KeyTypeKeyCompare) const; - iterator lower_bound(const key_type &); + size_type count(const KeyType &, KeyTypeKeyCompare) const; + iterator lower_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator lower_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator lower_bound(const key_type &) const; + iterator lower_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator lower_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator upper_bound(const key_type &); + const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator upper_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator upper_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator upper_bound(const key_type &) const; + iterator upper_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator upper_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator find(const key_type &); + const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator find(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator find(const KeyType &, KeyTypeKeyCompare); - const_iterator find(const key_type &) const; + iterator find(const KeyType &, KeyTypeKeyCompare); + const_iterator find(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator find(const KeyType &, KeyTypeKeyCompare) const; - std::pair< iterator, iterator > equal_range(const key_type &); + const_iterator find(const KeyType &, KeyTypeKeyCompare) const; + std::pair< iterator, iterator > equal_range(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - equal_range(const KeyType &, KeyTypeKeyCompare); + equal_range(const KeyType &, KeyTypeKeyCompare); std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; + equal_range(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - equal_range(const KeyType &, KeyTypeKeyCompare) const; + equal_range(const KeyType &, KeyTypeKeyCompare) const; std::pair< iterator, iterator > - bounded_range(const key_type &, const key_type &, bool, bool); + bounded_range(const key_type &, const key_type &, bool, bool); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool); std::pair< const_iterator, const_iterator > - bounded_range(const key_type &, const key_type &, bool, bool) const; + bounded_range(const key_type &, const key_type &, bool, bool) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool) const; - iterator iterator_to(reference); - const_iterator iterator_to(const_reference) const; - pointer unlink_leftmost_without_rebalance(); - void replace_node(iterator, reference); - void remove_node(reference); + iterator iterator_to(reference); + const_iterator iterator_to(const_reference) const; + pointer unlink_leftmost_without_rebalance(); + void replace_node(iterator, reference); + void remove_node(reference); - // public static functions - static treap_multiset & container_from_end_iterator(iterator); - static const treap_multiset & container_from_end_iterator(const_iterator); - static treap_multiset & container_from_iterator(iterator); - static const treap_multiset & container_from_iterator(const_iterator); - static iterator s_iterator_to(reference); - static const_iterator s_iterator_to(const_reference); - static void init_node(reference); + // public static functions + static treap_multiset & container_from_end_iterator(iterator); + static const treap_multiset & container_from_end_iterator(const_iterator); + static treap_multiset & container_from_iterator(iterator); + static const treap_multiset & container_from_iterator(const_iterator); + static iterator s_iterator_to(reference); + static const_iterator s_iterator_to(const_reference); + static void init_node(reference); // public data members static const bool constant_time_size; };
    -

    Description

    +

    Description

    The class template treap_multiset is an intrusive container, that mimics most of the interface of std::treap_multiset as described in the C++ standard.

    The template parameter T is the type to be managed by the container. The user can specify additional options and if no options are provided default options are used.

    The container supports the following options: base_hook<>/member_hook<>/value_traits<>, constant_time_size<>, size_type<>, compare<> and priority_compare<>

    -

    +

    treap_multiset public construct/copy/destruct

    1. -
      explicit treap_multiset(const key_compare & cmp = key_compare(), 
+
      explicit treap_multiset(const key_compare & cmp = key_compare(), 
                         const priority_compare & pcmp = priority_compare(), 
                         const value_traits & v_traits = value_traits());
      
 
      Effects: Constructs an empty treap_multiset.
      
@@ -203,7 +203,7 @@
 
    2. template<typename Iterator> 
-  treap_multiset(Iterator b, Iterator e, 
+  treap_multiset(Iterator b, Iterator e, 
                  const key_compare & cmp = key_compare(), 
                  const priority_compare & pcmp = priority_compare(), 
                  const value_traits & v_traits = value_traits());
      @@ -213,15 +213,15 @@

      Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor/operator() of the key_compare object throws.

    3. -
      treap_multiset(treap_multiset && x);
      +
      treap_multiset(treap_multiset && x);

      Effects: to-do

    4. -
      treap_multiset & operator=(treap_multiset && x);
      +
      treap_multiset & operator=(treap_multiset && x);

      Effects: to-do

    5. -
      ~treap_multiset();
      +
      ~treap_multiset();

      Effects: Detaches all elements from this. The objects in the set are not deleted (i.e. no destructors are called), but the nodes according to the value_traits template parameter are reinitialized and thus can be reused.

      Complexity: Linear to elements contained in *this.

      Throws: Nothing.

      @@ -229,114 +229,114 @@
    -

    -treap_multiset public member functions

    +

    +treap_multiset public member functions

    1. -
      iterator begin();
      +
      iterator begin();

      Effects: Returns an iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    2. -
      const_iterator begin() const;
      +
      const_iterator begin() const;

      Effects: Returns a const_iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    3. -
      const_iterator cbegin() const;
      +
      const_iterator cbegin() const;

      Effects: Returns a const_iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    4. -
      iterator end();
      +
      iterator end();

      Effects: Returns an iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    5. -
      const_iterator end() const;
      +
      const_iterator end() const;

      Effects: Returns a const_iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    6. -
      const_iterator cend() const;
      +
      const_iterator cend() const;

      Effects: Returns a const_iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    7. -
      reverse_iterator rbegin();
      +
      reverse_iterator rbegin();

      Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    8. -
      const_reverse_iterator rbegin() const;
      +
      const_reverse_iterator rbegin() const;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    9. -
      const_reverse_iterator crbegin() const;
      +
      const_reverse_iterator crbegin() const;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    10. -
      reverse_iterator rend();
      +
      reverse_iterator rend();

      Effects: Returns a reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    11. -
      const_reverse_iterator rend() const;
      +
      const_reverse_iterator rend() const;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    12. -
      const_reverse_iterator crend() const;
      +
      const_reverse_iterator crend() const;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    13. -
      key_compare key_comp() const;
      +
      key_compare key_comp() const;

      Effects: Returns the key_compare object used by the container.

      Complexity: Constant.

      Throws: If key_compare copy-constructor throws.

    14. -
      value_compare value_comp() const;
      +
      value_compare value_comp() const;

      Effects: Returns the value_compare object used by the container.

      Complexity: Constant.

      Throws: If value_compare copy-constructor throws.

    15. -
      bool empty() const;
      +
      bool empty() const;

      Effects: Returns true if the container is empty.

      Complexity: Constant.

      Throws: Nothing.

    16. -
      size_type size() const;
      +
      size_type size() const;

      Effects: Returns the number of elements stored in the container.

      Complexity: Linear to elements contained in *this if constant-time size option is disabled. Constant time otherwise.

      Throws: Nothing.

    17. -
      void swap(treap_multiset & other);
      +
      void swap(treap_multiset & other);

      Effects: Swaps the contents of two treaps.

      Complexity: Constant.

      Throws: If the comparison functor's swap call throws. 

    18. template<typename Cloner, typename Disposer> 
-  void clone_from(const treap_multiset & src, Cloner cloner, 
+  void clone_from(const treap_multiset & src, Cloner cloner, 
                   Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

      Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(const_reference ) and inserts them on *this. Copies the predicate from the source container.

      @@ -346,7 +346,7 @@ 
    19. template<typename Cloner, typename Disposer> 
-  void clone_from(treap_multiset && src, Cloner cloner, Disposer disposer);
      + void clone_from(treap_multiset && src, Cloner cloner, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

      Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(reference) and inserts them on *this. Copies the predicate from the source container.

      If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

      @@ -354,49 +354,49 @@

      Throws: If cloner throws or predicate copy assignment throws. Basic guarantee.

    20. -
      iterator top();
      +
      iterator top();

      Effects: Returns an iterator pointing to the highest priority object of the treap.

      Complexity: Constant.

      Throws: Nothing.

    21. -
      const_iterator top() const;
      +
      const_iterator top() const;

      Effects: Returns a const_iterator pointing to the highest priority object of the treap..

      Complexity: Constant.

      Throws: Nothing.

    22. -
      const_iterator ctop() const;
      +
      const_iterator ctop() const;

      Effects: Returns a const_iterator pointing to the highest priority object of the treap..

      Complexity: Constant.

      Throws: Nothing.

    23. -
      reverse_iterator rtop();
      +
      reverse_iterator rtop();

      Effects: Returns a reverse_iterator pointing to the highest priority object of the reversed treap.

      Complexity: Constant.

      Throws: Nothing.

    24. -
      const_reverse_iterator rtop() const;
      +
      const_reverse_iterator rtop() const;

      Effects: Returns a const_reverse_iterator pointing to the highest priority objec of the reversed treap.

      Complexity: Constant.

      Throws: Nothing.

    25. -
      const_reverse_iterator crtop() const;
      +
      const_reverse_iterator crtop() const;

      Effects: Returns a const_reverse_iterator pointing to the highest priority object of the reversed treap.

      Complexity: Constant.

      Throws: Nothing.

    26. -
      priority_compare priority_comp() const;
      +
      priority_compare priority_comp() const;

      Effects: Returns a const_reverse_iterator pointing to the highest priority object of the reversed treap.

      Complexity: Constant.

      Throws: Nothing.

    27. -
      iterator insert(reference value);
      +
      iterator insert(reference value);

      Requires: value must be an lvalue

      Effects: Inserts value into the container before the upper bound.

      Complexity: Average complexity for insert element is at most logarithmic.

      @@ -404,7 +404,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    28. -
      iterator insert(const_iterator hint, reference value);
      +
      iterator insert(const_iterator hint, reference value);

      Requires: value must be an lvalue, and "hint" must be a valid iterator.

      Effects: Inserts x into the container, using "hint" as a hint to where it will be inserted. If "hint" is the upper_bound the insertion takes constant time (two comparisons in the worst case)

      Complexity: Logarithmic in general, but it is amortized constant time if t is inserted immediately before hint.

      @@ -412,7 +412,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    29. -
      template<typename Iterator> void insert(Iterator b, Iterator e);
      +
      template<typename Iterator> void insert(Iterator b, Iterator e);

      Requires: Dereferencing iterator must yield an lvalue of type value_type.

      Effects: Inserts a each element of a range into the container before the upper bound of the key of each element.

      Complexity: Insert range is in general O(N * log(N)), where N is the size of the range. However, it is linear in N if the range is already sorted by key_comp().

      @@ -420,7 +420,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    30. -
      iterator insert_before(const_iterator pos, reference value);
      +
      iterator insert_before(const_iterator pos, reference value);

      Requires: value must be an lvalue, "pos" must be a valid iterator (or end) and must be the succesor of value once inserted according to the predicate

      Effects: Inserts x into the container before "pos".

      Complexity: Constant time.

      @@ -428,7 +428,7 @@

      Note: This function does not check preconditions so if "pos" is not the successor of "value" container ordering invariant will be broken. This is a low-level function to be used only for performance reasons by advanced users.

    31. -
      void push_back(reference value);
      +
      void push_back(reference value);

      Requires: value must be an lvalue, and it must be no less than the greatest inserted key

      Effects: Inserts x into the container in the last position.

      Complexity: Constant time.

      @@ -436,7 +436,7 @@

      Note: This function does not check preconditions so if value is less than the greatest inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

    32. -
      void push_front(reference value);
      +
      void push_front(reference value);

      Requires: value must be an lvalue, and it must be no greater than the minimum inserted key

      Effects: Inserts x into the container in the first position.

      Complexity: Constant time.

      @@ -444,21 +444,21 @@

      Note: This function does not check preconditions so if value is greater than the minimum inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

    33. -
      iterator erase(const_iterator i);
      +
      iterator erase(const_iterator i);

      Effects: Erases the element pointed to by i.

      Complexity: Average complexity for erase element is constant time.

      Throws: if the internal priority_compare function throws. Strong guarantee.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    34. -
      iterator erase(const_iterator b, const_iterator e);
      +
      iterator erase(const_iterator b, const_iterator e);

      Effects: Erases the range pointed to by b end e.

      Complexity: Average complexity for erase range is at most O(log(size() + N)), where N is the number of elements in the range.

      Throws: if the internal priority_compare function throws. Strong guarantee.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    35. -
      size_type erase(const key_type & key);
      +
      size_type erase(const key_type & key);

      Effects: Erases all the elements with the given value.

      Returns: The number of erased elements.

      Complexity: O(log(size() + N).

      @@ -467,7 +467,7 @@ 
    36. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type erase(const KeyType & key, KeyTypeKeyCompare comp);
      + size_type erase(const KeyType & key, KeyTypeKeyCompare comp);

      Effects: Erases all the elements with the given key. according to the comparison functor "comp".

      Returns: The number of erased elements.

      Complexity: O(log(size() + N).

      @@ -476,7 +476,7 @@ 
    37. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator i, Disposer disposer);
      + iterator erase_and_dispose(const_iterator i, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases the element pointed to by i. Disposer::operator()(pointer) is called for the removed element.

      Complexity: Average complexity for erase element is constant time.

      @@ -485,7 +485,7 @@ 
    38. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator b, const_iterator e, 
+  iterator erase_and_dispose(const_iterator b, const_iterator e, 
                              Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases the range pointed to by b end e. Disposer::operator()(pointer) is called for the removed elements.

      @@ -495,7 +495,7 @@ 
    39. template<typename Disposer> 
-  size_type erase_and_dispose(const key_type & key, Disposer disposer);
      + size_type erase_and_dispose(const key_type & key, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases all the elements with the given value. Disposer::operator()(pointer) is called for the removed elements.

      Returns: The number of erased elements.

      @@ -505,7 +505,7 @@ 
    40. template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> 
-  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
+  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
                               Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases all the elements with the given key. according to the comparison functor "comp". Disposer::operator()(pointer) is called for the removed elements.

      @@ -515,46 +515,47 @@

      Note: Invalidates the iterators to the erased elements.

    41. -
      void clear();
      +
      void clear();

      Effects: Erases all of the elements.

      Complexity: Linear to the number of elements on the container. if it's a safe-mode or auto-unlink value_type. Constant time otherwise.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    42. -
      template<typename Disposer> void clear_and_dispose(Disposer disposer);
      +
      template<typename Disposer> void clear_and_dispose(Disposer disposer);

      Effects: Erases all of the elements calling disposer(p) for each node to be erased. Complexity: Average complexity for is at most O(log(size() + N)), where N is the number of elements in the container.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. Calls N times to disposer functor.

    43. -
      size_type count(const key_type & key) const;
      +
      size_type count(const key_type & key) const;

      Effects: Returns the number of contained elements with the given value

      Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given value.

      Throws: If key_compare throws. 

    44. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;
      + size_type count(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      Effects: Returns the number of contained elements with the given key

      Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given key.

      Throws: If comp throws.

    45. -
      iterator lower_bound(const key_type & key);
      +
      iterator lower_bound(const key_type & key);

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    46. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      -

      Throws: If comp throws.

      +

      Throws: If key_compare throws.

    47. -
      const_iterator lower_bound(const key_type & key) const;
      +
      const_iterator lower_bound(const key_type & key) const;

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -562,26 +563,27 @@ 
    48. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
      -

      Effects: Returns a const iterator to the first element whose key is not less than k or end() if that element does not exist.

      + lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      -

      Throws: If comp throws.

      +

      Throws: If key_compare throws.

    49. -
      iterator upper_bound(const key_type & key);
      +
      iterator upper_bound(const key_type & key);

      Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    50. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    51. -
      const_iterator upper_bound(const key_type & key) const;
      +
      const_iterator upper_bound(const key_type & key) const;

      Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -589,39 +591,42 @@ 
    52. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
      + upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    53. -
      iterator find(const key_type & key);
      +
      iterator find(const key_type & key);

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    54. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator find(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator find(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    55. -
      const_iterator find(const key_type & key) const;
      -

      Effects: Finds a const_iterator to the first element whose key is k or end() if that element does not exist.

      +
      const_iterator find(const key_type & key) const;
      +

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    56. template<typename KeyType, typename KeyTypeKeyCompare> 
-  const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;
      -

      Effects: Finds a const_iterator to the first element whose key is k or end() if that element does not exist.

      + const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      +

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    57. -
      std::pair< iterator, iterator > equal_range(const key_type & key);
      +
      std::pair< iterator, iterator > equal_range(const key_type & key);

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -629,14 +634,15 @@ 
    58. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp);
      + equal_range(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If comp throws. 

    59. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & key) const;
      +equal_range(const key_type & key) const;

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -644,16 +650,18 @@ 
    60. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;
      + equal_range(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If comp throws. 

    61. std::pair< iterator, iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed);
      -

      Requires: 'lower_key' must not be greater than 'upper_key'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key) if left_closed, upper_bound(lower_key) otherwise

      second = upper_bound(upper_key) if right_closed, lower_bound(upper_key) otherwise

      @@ -665,9 +673,12 @@ 
    62. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed);
      -

      Requires: KeyTypeKeyCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the container. 'lower_key' must not be greater than 'upper_key' according to 'comp'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

      +

      upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

      +

      upper_key shall not precede lower_key according to comp [comp(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!comp(upper_key, lower_key) && !comp(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key, comp) if left_closed, upper_bound(lower_key, comp) otherwise

      second = upper_bound(upper_key, comp) if right_closed, lower_bound(upper_key, comp) otherwise

      @@ -678,9 +689,10 @@ 
    63. std::pair< const_iterator, const_iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed) const;
      -

      Requires: 'lower_key' must not be greater than 'upper_key'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key) if left_closed, upper_bound(lower_key) otherwise

      second = upper_bound(upper_key) if right_closed, lower_bound(upper_key) otherwise

      @@ -692,9 +704,12 @@ 
    64. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed) const;
      -

      Requires: KeyTypeKeyCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the container. 'lower_key' must not be greater than 'upper_key' according to 'comp'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

      +

      upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

      +

      upper_key shall not precede lower_key according to comp [comp(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!comp(upper_key, lower_key) && !comp(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key, comp) if left_closed, upper_bound(lower_key, comp) otherwise

      second = upper_bound(upper_key, comp) if right_closed, lower_bound(upper_key, comp) otherwise

      @@ -704,28 +719,28 @@

      Note: Experimental function, the interface might change in future releases.

    65. -
      iterator iterator_to(reference value);
      +
      iterator iterator_to(reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      Throws: Nothing.

    66. -
      const_iterator iterator_to(const_reference value) const;
      +
      const_iterator iterator_to(const_reference value) const;

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid const_iterator i belonging to the set that points to the value

      Complexity: Constant.

      Throws: Nothing.

    67. -
      pointer unlink_leftmost_without_rebalance();
      +
      pointer unlink_leftmost_without_rebalance();

      Effects: Unlinks the leftmost node from the container.

      Complexity: Average complexity is constant time.

      Throws: Nothing.

      Notes: This function breaks the container and the container can only be used for more unlink_leftmost_without_rebalance calls. This function is normally used to achieve a step by step controlled destruction of the container.

    68. -
      void replace_node(iterator replace_this, reference with_this);
      +
      void replace_node(iterator replace_this, reference with_this);

      Requires: replace_this must be a valid iterator of *this and with_this must not be inserted in any container.

      Effects: Replaces replace_this in its position in the container with with_this. The container does not need to be rebalanced.

      Complexity: Constant.

      @@ -733,7 +748,7 @@

      Note: This function will break container ordering invariants if with_this is not equivalent to *replace_this according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing or comparison is needed.

    69. -
      void remove_node(reference value);
      +
      void remove_node(reference value);

      Effects: removes "value" from the container.

      Throws: Nothing.

      Complexity: Logarithmic time.

      @@ -743,11 +758,11 @@
    -

    -treap_multiset public static functions

    +

    +treap_multiset public static functions

    1. -
      static treap_multiset & container_from_end_iterator(iterator end_iterator);
      +
      static treap_multiset & container_from_end_iterator(iterator end_iterator);

      Precondition: end_iterator must be a valid end iterator of the container.

      Effects: Returns a const reference to the container associated to the end iterator

      Throws: Nothing.

      @@ -755,28 +770,28 @@ 
    2. static const treap_multiset & 
-container_from_end_iterator(const_iterator end_iterator);
      +container_from_end_iterator(const_iterator end_iterator);

      Precondition: end_iterator must be a valid end iterator of the container.

      Effects: Returns a const reference to the container associated to the end iterator

      Throws: Nothing.

      Complexity: Constant.

    3. -
      static treap_multiset & container_from_iterator(iterator it);
      +
      static treap_multiset & container_from_iterator(iterator it);

      Precondition: it must be a valid iterator of the container.

      Effects: Returns a const reference to the container associated to the iterator

      Throws: Nothing.

      Complexity: Logarithmic.

    4. -
      static const treap_multiset & container_from_iterator(const_iterator it);
      +
      static const treap_multiset & container_from_iterator(const_iterator it);

      Precondition: it must be a valid iterator of the container.

      Effects: Returns a const reference to the container associated to the iterator

      Throws: Nothing.

      Complexity: Logarithmic.

    5. -
      static iterator s_iterator_to(reference value);
      +
      static iterator s_iterator_to(reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      @@ -784,7 +799,7 @@

      Note: This static function is available only if the value traits is stateless.

    6. -
      static const_iterator s_iterator_to(const_reference value);
      +
      static const_iterator s_iterator_to(const_reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      @@ -792,7 +807,7 @@

      Note: This static function is available only if the value traits is stateless.

    7. -
      static void init_node(reference value);
      +
      static void init_node(reference value);

      Requires: value shall not be in a container.

      Effects: init_node puts the hook of a value in a well-known default state.

      Throws: Nothing.

      diff --git a/doc/html/boost/intrusive/treap_set.html b/doc/html/boost/intrusive/treap_set.html index c4b3b58520..688305166b 100644 --- a/doc/html/boost/intrusive/treap_set.html +++ b/doc/html/boost/intrusive/treap_set.html @@ -61,151 +61,151 @@ typedef implementation_defined::node_algorithms node_algorithms; // construct/copy/destruct - explicit treap_set(const key_compare & = key_compare(), + explicit treap_set(const key_compare & = key_compare(), const priority_compare & = priority_compare(), const value_traits & = value_traits()); template<typename Iterator> - treap_set(Iterator, Iterator, const key_compare & = key_compare(), + treap_set(Iterator, Iterator, const key_compare & = key_compare(), const priority_compare & = priority_compare(), const value_traits & = value_traits()); - treap_set(treap_set &&); - treap_set & operator=(treap_set &&); - ~treap_set(); + treap_set(treap_set &&); + treap_set & operator=(treap_set &&); + ~treap_set(); - // public member functions - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end(); - const_iterator end() const; - const_iterator cend() const; - reverse_iterator rbegin(); - const_reverse_iterator rbegin() const; - const_reverse_iterator crbegin() const; - reverse_iterator rend(); - const_reverse_iterator rend() const; - const_reverse_iterator crend() const; - key_compare key_comp() const; - value_compare value_comp() const; - bool empty() const; - size_type size() const; - void swap(treap_set &); + // public member functions + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end(); + const_iterator end() const; + const_iterator cend() const; + reverse_iterator rbegin(); + const_reverse_iterator rbegin() const; + const_reverse_iterator crbegin() const; + reverse_iterator rend(); + const_reverse_iterator rend() const; + const_reverse_iterator crend() const; + key_compare key_comp() const; + value_compare value_comp() const; + bool empty() const; + size_type size() const; + void swap(treap_set &); template<typename Cloner, typename Disposer> - void clone_from(const treap_set &, Cloner, Disposer); + void clone_from(const treap_set &, Cloner, Disposer); template<typename Cloner, typename Disposer> - void clone_from(treap_set &&, Cloner, Disposer); - iterator top(); - const_iterator top() const; - const_iterator ctop() const; - reverse_iterator rtop(); - const_reverse_iterator rtop() const; - const_reverse_iterator crtop() const; - priority_compare priority_comp() const; - std::pair< iterator, bool > insert(reference); - iterator insert(const_iterator, reference); + void clone_from(treap_set &&, Cloner, Disposer); + iterator top(); + const_iterator top() const; + const_iterator ctop() const; + reverse_iterator rtop(); + const_reverse_iterator rtop() const; + const_reverse_iterator crtop() const; + priority_compare priority_comp() const; + std::pair< iterator, bool > insert(reference); + iterator insert(const_iterator, reference); template<typename KeyType, typename KeyTypeKeyCompare, typename KeyValuePrioCompare> std::pair< iterator, bool > - insert_check(const KeyType &, KeyTypeKeyCompare, KeyValuePrioCompare, + insert_check(const KeyType &, KeyTypeKeyCompare, KeyValuePrioCompare, insert_commit_data &); template<typename KeyType, typename KeyTypeKeyCompare, typename KeyValuePrioCompare> std::pair< iterator, bool > - insert_check(const_iterator, const KeyType &, KeyTypeKeyCompare, + insert_check(const_iterator, const KeyType &, KeyTypeKeyCompare, KeyValuePrioCompare, insert_commit_data &); - template<typename Iterator> void insert(Iterator, Iterator); - iterator insert_commit(reference, const insert_commit_data &); - iterator insert_before(const_iterator, reference); - void push_back(reference); - void push_front(reference); - iterator erase(const_iterator); - iterator erase(const_iterator, const_iterator); - size_type erase(const key_type &); + template<typename Iterator> void insert(Iterator, Iterator); + iterator insert_commit(reference, const insert_commit_data &); + iterator insert_before(const_iterator, reference); + void push_back(reference); + void push_front(reference); + iterator erase(const_iterator); + iterator erase(const_iterator, const_iterator); + size_type erase(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - size_type erase(const KeyType &, KeyTypeKeyCompare); + size_type erase(const KeyType &, KeyTypeKeyCompare); template<typename Disposer> - iterator erase_and_dispose(const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, Disposer); template<typename Disposer> - iterator erase_and_dispose(const_iterator, const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, const_iterator, Disposer); template<typename Disposer> - size_type erase_and_dispose(const key_type &, Disposer); + size_type erase_and_dispose(const key_type &, Disposer); template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> - size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); - void clear(); - template<typename Disposer> void clear_and_dispose(Disposer); - size_type count(const key_type &) const; + size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); + void clear(); + template<typename Disposer> void clear_and_dispose(Disposer); + size_type count(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - size_type count(const KeyType &, KeyTypeKeyCompare) const; - iterator lower_bound(const key_type &); + size_type count(const KeyType &, KeyTypeKeyCompare) const; + iterator lower_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator lower_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator lower_bound(const key_type &) const; + iterator lower_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator lower_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator upper_bound(const key_type &); + const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator upper_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator upper_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator upper_bound(const key_type &) const; + iterator upper_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator upper_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator find(const key_type &); + const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator find(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator find(const KeyType &, KeyTypeKeyCompare); - const_iterator find(const key_type &) const; + iterator find(const KeyType &, KeyTypeKeyCompare); + const_iterator find(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator find(const KeyType &, KeyTypeKeyCompare) const; - std::pair< iterator, iterator > equal_range(const key_type &); + const_iterator find(const KeyType &, KeyTypeKeyCompare) const; + std::pair< iterator, iterator > equal_range(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - equal_range(const KeyType &, KeyTypeKeyCompare); + equal_range(const KeyType &, KeyTypeKeyCompare); std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; + equal_range(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - equal_range(const KeyType &, KeyTypeKeyCompare) const; + equal_range(const KeyType &, KeyTypeKeyCompare) const; std::pair< iterator, iterator > - bounded_range(const key_type &, const key_type &, bool, bool); + bounded_range(const key_type &, const key_type &, bool, bool); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool); std::pair< const_iterator, const_iterator > - bounded_range(const key_type &, const key_type &, bool, bool) const; + bounded_range(const key_type &, const key_type &, bool, bool) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool) const; - iterator iterator_to(reference); - const_iterator iterator_to(const_reference) const; - pointer unlink_leftmost_without_rebalance(); - void replace_node(iterator, reference); - void remove_node(reference); + iterator iterator_to(reference); + const_iterator iterator_to(const_reference) const; + pointer unlink_leftmost_without_rebalance(); + void replace_node(iterator, reference); + void remove_node(reference); - // public static functions - static treap_set & container_from_end_iterator(iterator); - static const treap_set & container_from_end_iterator(const_iterator); - static treap_set & container_from_iterator(iterator); - static const treap_set & container_from_iterator(const_iterator); - static iterator s_iterator_to(reference); - static const_iterator s_iterator_to(const_reference); - static void init_node(reference); + // public static functions + static treap_set & container_from_end_iterator(iterator); + static const treap_set & container_from_end_iterator(const_iterator); + static treap_set & container_from_iterator(iterator); + static const treap_set & container_from_iterator(const_iterator); + static iterator s_iterator_to(reference); + static const_iterator s_iterator_to(const_reference); + static void init_node(reference); // public data members static const bool constant_time_size; };
    -

    Description

    +

    Description

    The class template treap_set is an intrusive container, that mimics most of the interface of std::set as described in the C++ standard.

    The template parameter T is the type to be managed by the container. The user can specify additional options and if no options are provided default options are used.

    The container supports the following options: base_hook<>/member_hook<>/value_traits<>, constant_time_size<>, size_type<>, compare<> and priority_compare<>

    -

    +

    treap_set public construct/copy/destruct

    1. -
      explicit treap_set(const key_compare & cmp = key_compare(), 
+
      explicit treap_set(const key_compare & cmp = key_compare(), 
                    const priority_compare & pcmp = priority_compare(), 
                    const value_traits & v_traits = value_traits());
      
 
      Effects: Constructs an empty treap_set.
      
@@ -214,7 +214,7 @@
 
    2. template<typename Iterator> 
-  treap_set(Iterator b, Iterator e, const key_compare & cmp = key_compare(), 
+  treap_set(Iterator b, Iterator e, const key_compare & cmp = key_compare(), 
             const priority_compare & pcmp = priority_compare(), 
             const value_traits & v_traits = value_traits());

      Requires: Dereferencing iterator must yield an lvalue of type value_type. cmp must be a comparison function that induces a strict weak ordering.

      @@ -223,15 +223,15 @@

      Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor/operator() of the key_compare object throws.

    3. -
      treap_set(treap_set && x);
      +
      treap_set(treap_set && x);

      Effects: to-do

    4. -
      treap_set & operator=(treap_set && x);
      +
      treap_set & operator=(treap_set && x);

      Effects: to-do

    5. -
      ~treap_set();
      +
      ~treap_set();

      Effects: Detaches all elements from this. The objects in the set are not deleted (i.e. no destructors are called), but the nodes according to the value_traits template parameter are reinitialized and thus can be reused.

      Complexity: Linear to elements contained in *this.

      Throws: Nothing.

      @@ -239,114 +239,114 @@
    -

    -treap_set public member functions

    +

    +treap_set public member functions

    1. -
      iterator begin();
      +
      iterator begin();

      Effects: Returns an iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    2. -
      const_iterator begin() const;
      +
      const_iterator begin() const;

      Effects: Returns a const_iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    3. -
      const_iterator cbegin() const;
      +
      const_iterator cbegin() const;

      Effects: Returns a const_iterator pointing to the beginning of the container.

      Complexity: Constant.

      Throws: Nothing.

    4. -
      iterator end();
      +
      iterator end();

      Effects: Returns an iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    5. -
      const_iterator end() const;
      +
      const_iterator end() const;

      Effects: Returns a const_iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    6. -
      const_iterator cend() const;
      +
      const_iterator cend() const;

      Effects: Returns a const_iterator pointing to the end of the container.

      Complexity: Constant.

      Throws: Nothing.

    7. -
      reverse_iterator rbegin();
      +
      reverse_iterator rbegin();

      Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    8. -
      const_reverse_iterator rbegin() const;
      +
      const_reverse_iterator rbegin() const;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    9. -
      const_reverse_iterator crbegin() const;
      +
      const_reverse_iterator crbegin() const;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    10. -
      reverse_iterator rend();
      +
      reverse_iterator rend();

      Effects: Returns a reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    11. -
      const_reverse_iterator rend() const;
      +
      const_reverse_iterator rend() const;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    12. -
      const_reverse_iterator crend() const;
      +
      const_reverse_iterator crend() const;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Complexity: Constant.

      Throws: Nothing.

    13. -
      key_compare key_comp() const;
      +
      key_compare key_comp() const;

      Effects: Returns the key_compare object used by the container.

      Complexity: Constant.

      Throws: If key_compare copy-constructor throws.

    14. -
      value_compare value_comp() const;
      +
      value_compare value_comp() const;

      Effects: Returns the value_compare object used by the container.

      Complexity: Constant.

      Throws: If value_compare copy-constructor throws.

    15. -
      bool empty() const;
      +
      bool empty() const;

      Effects: Returns true if the container is empty.

      Complexity: Constant.

      Throws: Nothing.

    16. -
      size_type size() const;
      +
      size_type size() const;

      Effects: Returns the number of elements stored in the container.

      Complexity: Linear to elements contained in *this if constant-time size option is disabled. Constant time otherwise.

      Throws: Nothing.

    17. -
      void swap(treap_set & other);
      +
      void swap(treap_set & other);

      Effects: Swaps the contents of two treaps.

      Complexity: Constant.

      Throws: If the comparison functor's swap call throws. 

    18. template<typename Cloner, typename Disposer> 
-  void clone_from(const treap_set & src, Cloner cloner, Disposer disposer);
      + void clone_from(const treap_set & src, Cloner cloner, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

      Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(const_reference ) and inserts them on *this. Copies the predicate from the source container.

      If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

      @@ -355,7 +355,7 @@ 
    19. template<typename Cloner, typename Disposer> 
-  void clone_from(treap_set && src, Cloner cloner, Disposer disposer);
      + void clone_from(treap_set && src, Cloner cloner, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

      Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(reference) and inserts them on *this. Copies the predicate from the source container.

      If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

      @@ -363,49 +363,49 @@

      Throws: If cloner throws or predicate copy assignment throws. Basic guarantee.

    20. -
      iterator top();
      +
      iterator top();

      Effects: Returns an iterator pointing to the highest priority object of the treap.

      Complexity: Constant.

      Throws: Nothing.

    21. -
      const_iterator top() const;
      +
      const_iterator top() const;

      Effects: Returns a const_iterator pointing to the highest priority object of the treap..

      Complexity: Constant.

      Throws: Nothing.

    22. -
      const_iterator ctop() const;
      +
      const_iterator ctop() const;

      Effects: Returns a const_iterator pointing to the highest priority object of the treap..

      Complexity: Constant.

      Throws: Nothing.

    23. -
      reverse_iterator rtop();
      +
      reverse_iterator rtop();

      Effects: Returns a reverse_iterator pointing to the highest priority object of the reversed treap.

      Complexity: Constant.

      Throws: Nothing.

    24. -
      const_reverse_iterator rtop() const;
      +
      const_reverse_iterator rtop() const;

      Effects: Returns a const_reverse_iterator pointing to the highest priority objec of the reversed treap.

      Complexity: Constant.

      Throws: Nothing.

    25. -
      const_reverse_iterator crtop() const;
      +
      const_reverse_iterator crtop() const;

      Effects: Returns a const_reverse_iterator pointing to the highest priority object of the reversed treap.

      Complexity: Constant.

      Throws: Nothing.

    26. -
      priority_compare priority_comp() const;
      +
      priority_compare priority_comp() const;

      Effects: Returns a const_reverse_iterator pointing to the highest priority object of the reversed treap.

      Complexity: Constant.

      Throws: Nothing.

    27. -
      std::pair< iterator, bool > insert(reference value);
      +
      std::pair< iterator, bool > insert(reference value);

      Requires: value must be an lvalue

      Effects: Inserts value into the container if the value is not already present.

      Complexity: Average complexity for insert element is at most logarithmic.

      @@ -413,7 +413,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    28. -
      iterator insert(const_iterator hint, reference value);
      +
      iterator insert(const_iterator hint, reference value);

      Requires: value must be an lvalue, and "hint" must be a valid iterator

      Effects: Tries to insert x into the container, using "hint" as a hint to where it will be inserted.

      Complexity: Logarithmic in general, but it is amortized constant time (two comparisons in the worst case) if t is inserted immediately before hint.

      @@ -424,7 +424,7 @@ 
      template<typename KeyType, typename KeyTypeKeyCompare, 
          typename KeyValuePrioCompare> 
   std::pair< iterator, bool > 
-  insert_check(const KeyType & key, KeyTypeKeyCompare comp, 
+  insert_check(const KeyType & key, KeyTypeKeyCompare comp, 
                KeyValuePrioCompare key_value_pcomp, 
                insert_commit_data & commit_data);

      Requires: comp must be a comparison function that induces the same strict weak ordering as key_compare. key_value_pcomp must be a comparison function that induces the same strict weak ordering as priority_compare. The difference is that key_value_pcomp and comp compare an arbitrary key with the contained values.

      @@ -440,7 +440,7 @@ 
      template<typename KeyType, typename KeyTypeKeyCompare, 
          typename KeyValuePrioCompare> 
   std::pair< iterator, bool > 
-  insert_check(const_iterator hint, const KeyType & key, 
+  insert_check(const_iterator hint, const KeyType & key, 
                KeyTypeKeyCompare comp, KeyValuePrioCompare key_value_pcomp, 
                insert_commit_data & commit_data);

      Requires: comp must be a comparison function that induces the same strict weak ordering as key_compare. key_value_pcomp must be a comparison function that induces the same strict weak ordering as priority_compare. The difference is that key_value_pcomp and comp compare an arbitrary key with the contained values.

      @@ -453,7 +453,7 @@

      "commit_data" remains valid for a subsequent "insert_commit" only if no more objects are inserted or erased from the container.

    29. -
      template<typename Iterator> void insert(Iterator b, Iterator e);
      +
      template<typename Iterator> void insert(Iterator b, Iterator e);

      Requires: Dereferencing iterator must yield an lvalue of type value_type.

      Effects: Tries to insert each element of a range into the container.

      Complexity: Insert range is in general O(N * log(N)), where N is the size of the range. However, it is linear in N if the range is already sorted by key_comp().

      @@ -461,7 +461,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    30. -
      iterator insert_commit(reference value, 
+
      iterator insert_commit(reference value, 
                        const insert_commit_data & commit_data);
      
 
      Requires: value must be an lvalue of type value_type. commit_data must have been obtained from a previous call to "insert_check". No objects should have been inserted or erased from the container between the "insert_check" that filled "commit_data" and the call to "insert_commit".
      
 
      Effects: Inserts the value in the avl_set using the information obtained from the "commit_data" that a previous "insert_check" filled.
      
@@ -471,7 +471,7 @@
 
      Notes: This function has only sense if a "insert_check" has been previously executed to fill "commit_data". No value should be inserted or erased between the "insert_check" and "insert_commit" calls.
    31. -
      iterator insert_before(const_iterator pos, reference value);
      +
      iterator insert_before(const_iterator pos, reference value);

      Requires: value must be an lvalue, "pos" must be a valid iterator (or end) and must be the succesor of value once inserted according to the predicate

      Effects: Inserts x into the container before "pos".

      Complexity: Constant time.

      @@ -479,7 +479,7 @@

      Note: This function does not check preconditions so if "pos" is not the successor of "value" container ordering invariant will be broken. This is a low-level function to be used only for performance reasons by advanced users.

    32. -
      void push_back(reference value);
      +
      void push_back(reference value);

      Requires: value must be an lvalue, and it must be no less than the greatest inserted key

      Effects: Inserts x into the container in the last position.

      Complexity: Constant time.

      @@ -487,7 +487,7 @@

      Note: This function does not check preconditions so if value is less than the greatest inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

    33. -
      void push_front(reference value);
      +
      void push_front(reference value);

      Requires: value must be an lvalue, and it must be no greater than the minimum inserted key

      Effects: Inserts x into the container in the first position.

      Complexity: Constant time.

      @@ -495,21 +495,21 @@

      Note: This function does not check preconditions so if value is greater than the minimum inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

    34. -
      iterator erase(const_iterator i);
      +
      iterator erase(const_iterator i);

      Effects: Erases the element pointed to by i.

      Complexity: Average complexity for erase element is constant time.

      Throws: if the internal priority_compare function throws. Strong guarantee.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    35. -
      iterator erase(const_iterator b, const_iterator e);
      +
      iterator erase(const_iterator b, const_iterator e);

      Effects: Erases the range pointed to by b end e.

      Complexity: Average complexity for erase range is at most O(log(size() + N)), where N is the number of elements in the range.

      Throws: if the internal priority_compare function throws. Strong guarantee.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    36. -
      size_type erase(const key_type & key);
      +
      size_type erase(const key_type & key);

      Effects: Erases all the elements with the given value.

      Returns: The number of erased elements.

      Complexity: O(log(size() + N).

      @@ -518,7 +518,7 @@ 
    37. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type erase(const KeyType & key, KeyTypeKeyCompare comp);
      + size_type erase(const KeyType & key, KeyTypeKeyCompare comp);

      Effects: Erases all the elements with the given key. according to the comparison functor "comp".

      Returns: The number of erased elements.

      Complexity: O(log(size() + N).

      @@ -527,7 +527,7 @@ 
    38. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator i, Disposer disposer);
      + iterator erase_and_dispose(const_iterator i, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases the element pointed to by i. Disposer::operator()(pointer) is called for the removed element.

      Complexity: Average complexity for erase element is constant time.

      @@ -536,7 +536,7 @@ 
    39. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator b, const_iterator e, 
+  iterator erase_and_dispose(const_iterator b, const_iterator e, 
                              Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases the range pointed to by b end e. Disposer::operator()(pointer) is called for the removed elements.

      @@ -546,7 +546,7 @@ 
    40. template<typename Disposer> 
-  size_type erase_and_dispose(const key_type & key, Disposer disposer);
      + size_type erase_and_dispose(const key_type & key, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases all the elements with the given value. Disposer::operator()(pointer) is called for the removed elements.

      Returns: The number of erased elements.

      @@ -556,7 +556,7 @@ 
    41. template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> 
-  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
+  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
                               Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases all the elements with the given key. according to the comparison functor "comp". Disposer::operator()(pointer) is called for the removed elements.

      @@ -566,46 +566,47 @@

      Note: Invalidates the iterators to the erased elements.

    42. -
      void clear();
      +
      void clear();

      Effects: Erases all of the elements.

      Complexity: Linear to the number of elements on the container. if it's a safe-mode or auto-unlink value_type. Constant time otherwise.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    43. -
      template<typename Disposer> void clear_and_dispose(Disposer disposer);
      +
      template<typename Disposer> void clear_and_dispose(Disposer disposer);

      Effects: Erases all of the elements calling disposer(p) for each node to be erased. Complexity: Average complexity for is at most O(log(size() + N)), where N is the number of elements in the container.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. Calls N times to disposer functor.

    44. -
      size_type count(const key_type & key) const;
      +
      size_type count(const key_type & key) const;

      Effects: Returns the number of contained elements with the given value

      Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given value.

      Throws: If key_compare throws. 

    45. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;
      + size_type count(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      Effects: Returns the number of contained elements with the given key

      Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given key.

      Throws: If comp throws.

    46. -
      iterator lower_bound(const key_type & key);
      +
      iterator lower_bound(const key_type & key);

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    47. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      -

      Throws: If comp throws.

      +

      Throws: If key_compare throws.

    48. -
      const_iterator lower_bound(const key_type & key) const;
      +
      const_iterator lower_bound(const key_type & key) const;

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -613,26 +614,27 @@ 
    49. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
      -

      Effects: Returns a const iterator to the first element whose key is not less than k or end() if that element does not exist.

      + lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

      Complexity: Logarithmic.

      -

      Throws: If comp throws.

      +

      Throws: If key_compare throws.

    50. -
      iterator upper_bound(const key_type & key);
      +
      iterator upper_bound(const key_type & key);

      Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    51. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    52. -
      const_iterator upper_bound(const key_type & key) const;
      +
      const_iterator upper_bound(const key_type & key) const;

      Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -640,39 +642,42 @@ 
    53. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
      + upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    54. -
      iterator find(const key_type & key);
      +
      iterator find(const key_type & key);

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    55. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator find(const KeyType & key, KeyTypeKeyCompare comp);
      + iterator find(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    56. -
      const_iterator find(const key_type & key) const;
      -

      Effects: Finds a const_iterator to the first element whose key is k or end() if that element does not exist.

      +
      const_iterator find(const key_type & key) const;
      +

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If key_compare throws. 

    57. template<typename KeyType, typename KeyTypeKeyCompare> 
-  const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;
      -

      Effects: Finds a const_iterator to the first element whose key is k or end() if that element does not exist.

      + const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

      +

      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

      Complexity: Logarithmic.

      Throws: If comp throws.

    58. -
      std::pair< iterator, iterator > equal_range(const key_type & key);
      +
      std::pair< iterator, iterator > equal_range(const key_type & key);

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -680,14 +685,15 @@ 
    59. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp);
      + equal_range(const KeyType & key, KeyTypeKeyCompare comp); +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If comp throws. 

    60. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & key) const;
      +equal_range(const key_type & key) const;

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If key_compare throws.

      @@ -695,16 +701,18 @@ 
    61. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;
      + equal_range(const KeyType & key, KeyTypeKeyCompare comp) const; +

      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

      Complexity: Logarithmic.

      Throws: If comp throws. 

    62. std::pair< iterator, iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed);
      -

      Requires: 'lower_key' must not be greater than 'upper_key'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key) if left_closed, upper_bound(lower_key) otherwise

      second = upper_bound(upper_key) if right_closed, lower_bound(upper_key) otherwise

      @@ -716,9 +724,12 @@ 
    63. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed);
      -

      Requires: KeyTypeKeyCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the container. 'lower_key' must not be greater than 'upper_key' according to 'comp'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

      +

      upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

      +

      upper_key shall not precede lower_key according to comp [comp(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!comp(upper_key, lower_key) && !comp(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key, comp) if left_closed, upper_bound(lower_key, comp) otherwise

      second = upper_bound(upper_key, comp) if right_closed, lower_bound(upper_key, comp) otherwise

      @@ -729,9 +740,10 @@ 
    64. std::pair< const_iterator, const_iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed) const;
      -

      Requires: 'lower_key' must not be greater than 'upper_key'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key) if left_closed, upper_bound(lower_key) otherwise

      second = upper_bound(upper_key) if right_closed, lower_bound(upper_key) otherwise

      @@ -743,9 +755,12 @@ 
    65. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed) const;
      -

      Requires: KeyTypeKeyCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the container. 'lower_key' must not be greater than 'upper_key' according to 'comp'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false.

      +

      Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

      +

      upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

      +

      upper_key shall not precede lower_key according to comp [comp(upper_key, lower_key) shall be false]

      +

      If lower_key is equivalent to upper_key [!comp(upper_key, lower_key) && !comp(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

      Effects: Returns an a pair with the following criteria:

      first = lower_bound(lower_key, comp) if left_closed, upper_bound(lower_key, comp) otherwise

      second = upper_bound(upper_key, comp) if right_closed, lower_bound(upper_key, comp) otherwise

      @@ -755,28 +770,28 @@

      Note: Experimental function, the interface might change in future releases.

    66. -
      iterator iterator_to(reference value);
      +
      iterator iterator_to(reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      Throws: Nothing.

    67. -
      const_iterator iterator_to(const_reference value) const;
      +
      const_iterator iterator_to(const_reference value) const;

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid const_iterator i belonging to the set that points to the value

      Complexity: Constant.

      Throws: Nothing.

    68. -
      pointer unlink_leftmost_without_rebalance();
      +
      pointer unlink_leftmost_without_rebalance();

      Effects: Unlinks the leftmost node from the container.

      Complexity: Average complexity is constant time.

      Throws: Nothing.

      Notes: This function breaks the container and the container can only be used for more unlink_leftmost_without_rebalance calls. This function is normally used to achieve a step by step controlled destruction of the container.

    69. -
      void replace_node(iterator replace_this, reference with_this);
      +
      void replace_node(iterator replace_this, reference with_this);

      Requires: replace_this must be a valid iterator of *this and with_this must not be inserted in any container.

      Effects: Replaces replace_this in its position in the container with with_this. The container does not need to be rebalanced.

      Complexity: Constant.

      @@ -784,7 +799,7 @@

      Note: This function will break container ordering invariants if with_this is not equivalent to *replace_this according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing or comparison is needed.

    70. -
      void remove_node(reference value);
      +
      void remove_node(reference value);

      Effects: removes "value" from the container.

      Throws: Nothing.

      Complexity: Logarithmic time.

      @@ -794,11 +809,11 @@
    -

    -treap_set public static functions

    +

    +treap_set public static functions

    1. -
      static treap_set & container_from_end_iterator(iterator end_iterator);
      +
      static treap_set & container_from_end_iterator(iterator end_iterator);

      Precondition: end_iterator must be a valid end iterator of the container.

      Effects: Returns a const reference to the container associated to the end iterator

      Throws: Nothing.

      @@ -806,28 +821,28 @@ 
    2. static const treap_set & 
-container_from_end_iterator(const_iterator end_iterator);
      +container_from_end_iterator(const_iterator end_iterator);

      Precondition: end_iterator must be a valid end iterator of the container.

      Effects: Returns a const reference to the container associated to the end iterator

      Throws: Nothing.

      Complexity: Constant.

    3. -
      static treap_set & container_from_iterator(iterator it);
      +
      static treap_set & container_from_iterator(iterator it);

      Precondition: it must be a valid iterator of the container.

      Effects: Returns a const reference to the container associated to the iterator

      Throws: Nothing.

      Complexity: Logarithmic.

    4. -
      static const treap_set & container_from_iterator(const_iterator it);
      +
      static const treap_set & container_from_iterator(const_iterator it);

      Precondition: it must be a valid iterator of the container.

      Effects: Returns a const reference to the container associated to the iterator

      Throws: Nothing.

      Complexity: Logarithmic.

    5. -
      static iterator s_iterator_to(reference value);
      +
      static iterator s_iterator_to(reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      @@ -835,7 +850,7 @@

      Note: This static function is available only if the value traits is stateless.

    6. -
      static const_iterator s_iterator_to(const_reference value);
      +
      static const_iterator s_iterator_to(const_reference value);

      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator i belonging to the set that points to the value

      Complexity: Constant.

      @@ -843,7 +858,7 @@

      Note: This static function is available only if the value traits is stateless.

    7. -
      static void init_node(reference value);
      +
      static void init_node(reference value);

      Requires: value shall not be in a container.

      Effects: init_node puts the hook of a value in a well-known default state.

      Throws: Nothing.

      diff --git a/doc/html/boost/intrusive/trivial_value_traits.html b/doc/html/boost/intrusive/trivial_value_traits.html index 7a65da3270..0df50afbde 100644 --- a/doc/html/boost/intrusive/trivial_value_traits.html +++ b/doc/html/boost/intrusive/trivial_value_traits.html @@ -42,26 +42,26 @@ typedef node_ptr pointer; typedef const_node_ptr const_pointer; - // public static functions - static node_ptr to_node_ptr(value_type &); - static const_node_ptr to_node_ptr(const value_type &); - static const pointer & to_value_ptr(const node_ptr &); - static const const_pointer & to_value_ptr(const const_node_ptr &); + // public static functions + static node_ptr to_node_ptr(value_type &); + static const_node_ptr to_node_ptr(const value_type &); + static const pointer & to_value_ptr(const node_ptr &); + static const const_pointer & to_value_ptr(const const_node_ptr &); // public data members static const link_mode_type link_mode; };
    -

    Description

    +

    Description

    This value traits template is used to create value traits from user defined node traits where value_traits::value_type and node_traits::node should be equal

    -

    -trivial_value_traits public static functions

    +

    +trivial_value_traits public static functions

      -
    1. static node_ptr to_node_ptr(value_type & value);
      2. -
    2. static const_node_ptr to_node_ptr(const value_type & value);
      3. -
    3. static const pointer & to_value_ptr(const node_ptr & n);
      4. -
    4. static const const_pointer & to_value_ptr(const const_node_ptr & n);
      5. +
    5. static node_ptr to_node_ptr(value_type & value);
      6. +
    6. static const_node_ptr to_node_ptr(const value_type & value);
      7. +
    7. static const pointer & to_value_ptr(const node_ptr & n);
      8. +
    8. static const const_pointer & to_value_ptr(const const_node_ptr & n);
    diff --git a/doc/html/boost/intrusive/unordered_multiset.html b/doc/html/boost/intrusive/unordered_multiset.html index 9d6bf97e77..65ac4dc9d9 100644 --- a/doc/html/boost/intrusive/unordered_multiset.html +++ b/doc/html/boost/intrusive/unordered_multiset.html @@ -63,100 +63,100 @@ typedef implementation_defined::node_algorithms node_algorithms; // construct/copy/destruct - explicit unordered_multiset(const bucket_traits &, + explicit unordered_multiset(const bucket_traits &, const hasher & = hasher(), const key_equal & = key_equal(), const value_traits & = value_traits()); template<typename Iterator> - unordered_multiset(Iterator, Iterator, const bucket_traits &, + unordered_multiset(Iterator, Iterator, const bucket_traits &, const hasher & = hasher(), const key_equal & = key_equal(), const value_traits & = value_traits()); - unordered_multiset(unordered_multiset &&); - unordered_multiset & operator=(unordered_multiset &&); - ~unordered_multiset(); + unordered_multiset(unordered_multiset &&); + unordered_multiset & operator=(unordered_multiset &&); + ~unordered_multiset(); - // public member functions - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end(); - const_iterator end() const; - const_iterator cend() const; - hasher hash_function() const; - key_equal key_eq() const; - bool empty() const; - size_type size() const; - void swap(unordered_multiset &); + // public member functions + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end(); + const_iterator end() const; + const_iterator cend() const; + hasher hash_function() const; + key_equal key_eq() const; + bool empty() const; + size_type size() const; + void swap(unordered_multiset &); template<typename Cloner, typename Disposer> - void clone_from(const unordered_multiset &, Cloner, Disposer); + void clone_from(const unordered_multiset &, Cloner, Disposer); template<typename Cloner, typename Disposer> - void clone_from(unordered_multiset &&, Cloner, Disposer); - iterator insert(reference); - template<typename Iterator> void insert(Iterator, Iterator); - void erase(const_iterator); - void erase(const_iterator, const_iterator); - size_type erase(const key_type &); + void clone_from(unordered_multiset &&, Cloner, Disposer); + iterator insert(reference); + template<typename Iterator> void insert(Iterator, Iterator); + void erase(const_iterator); + void erase(const_iterator, const_iterator); + size_type erase(const key_type &); template<typename KeyType, typename KeyHasher, typename KeyEqual> - size_type erase(const KeyType &, KeyHasher, KeyEqual); - template<typename Disposer> void erase_and_dispose(const_iterator, Disposer); + size_type erase(const KeyType &, KeyHasher, KeyEqual); + template<typename Disposer> void erase_and_dispose(const_iterator, Disposer); template<typename Disposer> - void erase_and_dispose(const_iterator, const_iterator, Disposer); + void erase_and_dispose(const_iterator, const_iterator, Disposer); template<typename Disposer> - size_type erase_and_dispose(const key_type &, Disposer); + size_type erase_and_dispose(const key_type &, Disposer); template<typename KeyType, typename KeyHasher, typename KeyEqual, typename Disposer> - size_type erase_and_dispose(const KeyType &, KeyHasher, KeyEqual, + size_type erase_and_dispose(const KeyType &, KeyHasher, KeyEqual, Disposer); - void clear(); - template<typename Disposer> void clear_and_dispose(Disposer); - size_type count(const key_type &) const; + void clear(); + template<typename Disposer> void clear_and_dispose(Disposer); + size_type count(const key_type &) const; template<typename KeyType, typename KeyHasher, typename KeyEqual> - size_type count(const KeyType &, KeyHasher, KeyEqual) const; - iterator find(const key_type &); + size_type count(const KeyType &, KeyHasher, KeyEqual) const; + iterator find(const key_type &); template<typename KeyType, typename KeyHasher, typename KeyEqual> - iterator find(const KeyType &, KeyHasher, KeyEqual); - const_iterator find(const key_type &) const; + iterator find(const KeyType &, KeyHasher, KeyEqual); + const_iterator find(const key_type &) const; template<typename KeyType, typename KeyHasher, typename KeyEqual> - const_iterator find(const KeyType &, KeyHasher, KeyEqual) const; - std::pair< iterator, iterator > equal_range(const key_type &); + const_iterator find(const KeyType &, KeyHasher, KeyEqual) const; + std::pair< iterator, iterator > equal_range(const key_type &); template<typename KeyType, typename KeyHasher, typename KeyEqual> std::pair< iterator, iterator > - equal_range(const KeyType &, KeyHasher, KeyEqual); + equal_range(const KeyType &, KeyHasher, KeyEqual); std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; + equal_range(const key_type &) const; template<typename KeyType, typename KeyHasher, typename KeyEqual> std::pair< const_iterator, const_iterator > - equal_range(const KeyType &, KeyHasher, KeyEqual) const; - iterator iterator_to(reference); - const_iterator iterator_to(const_reference) const; - local_iterator local_iterator_to(reference); - const_local_iterator local_iterator_to(const_reference) const; - size_type bucket_count() const; - size_type bucket_size(size_type) const; - size_type bucket(const key_type &) const; + equal_range(const KeyType &, KeyHasher, KeyEqual) const; + iterator iterator_to(reference); + const_iterator iterator_to(const_reference) const; + local_iterator local_iterator_to(reference); + const_local_iterator local_iterator_to(const_reference) const; + size_type bucket_count() const; + size_type bucket_size(size_type) const; + size_type bucket(const key_type &) const; template<typename KeyType, typename KeyHasher> - size_type bucket(const KeyType &, KeyHasher) const; - bucket_ptr bucket_pointer() const; - local_iterator begin(size_type); - const_local_iterator begin(size_type) const; - const_local_iterator cbegin(size_type) const; - local_iterator end(size_type); - const_local_iterator end(size_type) const; - const_local_iterator cend(size_type) const; - void rehash(const bucket_traits &); - bool incremental_rehash(bool = true); - bool incremental_rehash(const bucket_traits &); - size_type split_count() const; + size_type bucket(const KeyType &, KeyHasher) const; + bucket_ptr bucket_pointer() const; + local_iterator begin(size_type); + const_local_iterator begin(size_type) const; + const_local_iterator cbegin(size_type) const; + local_iterator end(size_type); + const_local_iterator end(size_type) const; + const_local_iterator cend(size_type) const; + void rehash(const bucket_traits &); + bool incremental_rehash(bool = true); + bool incremental_rehash(const bucket_traits &); + size_type split_count() const; - // public static functions - static local_iterator s_local_iterator_to(reference); - static const_local_iterator s_local_iterator_to(const_reference); - static size_type suggested_upper_bucket_count(size_type); - static size_type suggested_lower_bucket_count(size_type); + // public static functions + static local_iterator s_local_iterator_to(reference); + static const_local_iterator s_local_iterator_to(const_reference); + static size_type suggested_upper_bucket_count(size_type); + static size_type suggested_lower_bucket_count(size_type); };
    -

    Description

    +

    Description

    The class template unordered_multiset is an intrusive container, that mimics most of the interface of std::tr1::unordered_multiset as described in the C++ TR1.

    unordered_multiset is a semi-intrusive container: each object to be stored in the container must contain a proper hook, but the container also needs additional auxiliary memory to work: unordered_multiset needs a pointer to an array of type bucket_type to be passed in the constructor. This bucket array must have at least the same lifetime as the container. This makes the use of unordered_multiset more complicated than purely intrusive containers. bucket_type is default-constructible, copyable and assignable

    The template parameter T is the type to be managed by the container. The user can specify additional options and if no options are provided default options are used.

    @@ -166,13 +166,13 @@

    unordered_multiset, unlike std::unordered_set, does not make automatic rehashings nor offers functions related to a load factor. Rehashing can be explicitly requested and the user must provide a new bucket array that will be used from that moment.

    Since no automatic rehashing is done, iterators are never invalidated when inserting or erasing elements. Iterators are only invalidated when rehasing.

    -

    +

    unordered_multiset public construct/copy/destruct

    1. -
      explicit unordered_multiset(const bucket_traits & b_traits, 
+
      explicit unordered_multiset(const bucket_traits & b_traits, 
                             const hasher & hash_func = hasher(), 
                             const key_equal & equal_func = key_equal(), 
                             const value_traits & v_traits = value_traits());
      
@@ -184,7 +184,7 @@
 
    2. template<typename Iterator> 
-  unordered_multiset(Iterator b, Iterator e, const bucket_traits & b_traits, 
+  unordered_multiset(Iterator b, Iterator e, const bucket_traits & b_traits, 
                      const hasher & hash_func = hasher(), 
                      const key_equal & equal_func = key_equal(), 
                      const value_traits & v_traits = value_traits());
      @@ -195,15 +195,15 @@

      Notes: buckets array must be disposed only after *this is disposed.

    3. -
      unordered_multiset(unordered_multiset && x);
      +
      unordered_multiset(unordered_multiset && x);

      Effects: to-do

    4. -
      unordered_multiset & operator=(unordered_multiset && x);
      +
      unordered_multiset & operator=(unordered_multiset && x);

      Effects: to-do

    5. -
      ~unordered_multiset();
      +
      ~unordered_multiset();

      Effects: Detaches all elements from this. The objects in the unordered_set are not deleted (i.e. no destructors are called).

      Complexity: Linear to the number of elements in the unordered_set, if it's a safe-mode or auto-unlink value. Otherwise constant.

      Throws: Nothing.

      @@ -211,71 +211,71 @@
    -

    -unordered_multiset public member functions

    +

    +unordered_multiset public member functions

    1. -
      iterator begin();
      +
      iterator begin();

      Effects: Returns an iterator pointing to the beginning of the unordered_set.

      Complexity: Amortized constant time. Worst case (empty unordered_set): O(this->bucket_count())

      Throws: Nothing.

    2. -
      const_iterator begin() const;
      +
      const_iterator begin() const;

      Effects: Returns a const_iterator pointing to the beginning of the unordered_set.

      Complexity: Amortized constant time. Worst case (empty unordered_set): O(this->bucket_count())

      Throws: Nothing.

    3. -
      const_iterator cbegin() const;
      +
      const_iterator cbegin() const;

      Effects: Returns a const_iterator pointing to the beginning of the unordered_set.

      Complexity: Amortized constant time. Worst case (empty unordered_set): O(this->bucket_count())

      Throws: Nothing.

    4. -
      iterator end();
      +
      iterator end();

      Effects: Returns an iterator pointing to the end of the unordered_set.

      Complexity: Constant.

      Throws: Nothing.

    5. -
      const_iterator end() const;
      +
      const_iterator end() const;

      Effects: Returns a const_iterator pointing to the end of the unordered_set.

      Complexity: Constant.

      Throws: Nothing.

    6. -
      const_iterator cend() const;
      +
      const_iterator cend() const;

      Effects: Returns a const_iterator pointing to the end of the unordered_set.

      Complexity: Constant.

      Throws: Nothing.

    7. -
      hasher hash_function() const;
      +
      hasher hash_function() const;

      Effects: Returns the hasher object used by the unordered_set.

      Complexity: Constant.

      Throws: If hasher copy-constructor throws.

    8. -
      key_equal key_eq() const;
      +
      key_equal key_eq() const;

      Effects: Returns the key_equal object used by the unordered_set.

      Complexity: Constant.

      Throws: If key_equal copy-constructor throws.

    9. -
      bool empty() const;
      +
      bool empty() const;

      Effects: Returns true if the container is empty.

      Complexity: if constant-time size and cache_begin options are disabled, average constant time (worst case, with empty() == true: O(this->bucket_count()). Otherwise constant.

      Throws: Nothing.

    10. -
      size_type size() const;
      +
      size_type size() const;

      Effects: Returns the number of elements stored in the unordered_set.

      Complexity: Linear to elements contained in *this if constant_time_size is false. Constant-time otherwise.

      Throws: Nothing.

    11. -
      void swap(unordered_multiset & other);
      +
      void swap(unordered_multiset & other);

      Requires: buckets must not be being used by any other resource.

      Effects: Constructs an empty unordered_set, storing a reference to the bucket array and copies of the key_hasher and equal_func functors.

      Complexity: Constant.

      @@ -284,7 +284,7 @@ 
    12. template<typename Cloner, typename Disposer> 
-  void clone_from(const unordered_multiset & src, Cloner cloner, 
+  void clone_from(const unordered_multiset & src, Cloner cloner, 
                   Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw Cloner should yield to nodes that compare equal and produce the same hash than the original node.

      Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(const_reference ) and inserts them on *this. The hash function and the equality predicate are copied from the source.

      @@ -295,7 +295,7 @@ 
    13. template<typename Cloner, typename Disposer> 
-  void clone_from(unordered_multiset && src, Cloner cloner, Disposer disposer);
      + void clone_from(unordered_multiset && src, Cloner cloner, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw Cloner should yield to nodes that compare equal and produce the same hash than the original node.

      Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(reference) and inserts them on *this. The hash function and the equality predicate are copied from the source.

      If store_hash option is true, this method does not use the hash function.

      @@ -304,7 +304,7 @@

      Throws: If cloner or hasher throw or hash or equality predicate copying throws. Basic guarantee.

    14. -
      iterator insert(reference value);
      +
      iterator insert(reference value);

      Requires: value must be an lvalue

      Effects: Inserts the value into the unordered_set.

      Returns: An iterator to the inserted value.

      @@ -313,7 +313,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    15. -
      template<typename Iterator> void insert(Iterator b, Iterator e);
      +
      template<typename Iterator> void insert(Iterator b, Iterator e);

      Requires: Dereferencing iterator must yield an lvalue of type value_type.

      Effects: Equivalent to this->insert_equal(t) for each element in [b, e).

      Complexity: Average case O(N), where N is distance(b, e). Worst case O(N*this->size()).

      @@ -321,21 +321,21 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    16. -
      void erase(const_iterator i);
      +
      void erase(const_iterator i);

      Effects: Erases the element pointed to by i.

      Complexity: Average case O(1), worst case O(this->size()).

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased element. No destructors are called.

    17. -
      void erase(const_iterator b, const_iterator e);
      +
      void erase(const_iterator b, const_iterator e);

      Effects: Erases the range pointed to by b end e.

      Complexity: Average case O(distance(b, e)), worst case O(this->size()).

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    18. -
      size_type erase(const key_type & key);
      +
      size_type erase(const key_type & key);

      Effects: Erases all the elements with the given value.

      Returns: The number of erased elements.

      Complexity: Average case O(this->count(value)). Worst case O(this->size()).

      @@ -344,7 +344,7 @@ 
    19. template<typename KeyType, typename KeyHasher, typename KeyEqual> 
-  size_type erase(const KeyType & key, KeyHasher hash_func, 
+  size_type erase(const KeyType & key, KeyHasher hash_func, 
                   KeyEqual equal_func);

      Requires: "hash_func" must be a hash function that induces the same hash values as the stored hasher. The difference is that "hash_func" hashes the given key instead of the value_type.

      "equal_func" must be a equality function that induces the same equality as key_equal. The difference is that "equal_func" compares an arbitrary key with the contained values.

      @@ -356,7 +356,7 @@ 
    20. template<typename Disposer> 
-  void erase_and_dispose(const_iterator i, Disposer disposer);
      + void erase_and_dispose(const_iterator i, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases the element pointed to by i. Disposer::operator()(pointer) is called for the removed element.

      Complexity: Average case O(1), worst case O(this->size()).

      @@ -365,7 +365,7 @@ 
    21. template<typename Disposer> 
-  void erase_and_dispose(const_iterator b, const_iterator e, 
+  void erase_and_dispose(const_iterator b, const_iterator e, 
                          Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases the range pointed to by b end e. Disposer::operator()(pointer) is called for the removed elements.

      @@ -375,7 +375,7 @@ 
    22. template<typename Disposer> 
-  size_type erase_and_dispose(const key_type & key, Disposer disposer);
      + size_type erase_and_dispose(const key_type & key, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases all the elements with the given value. Disposer::operator()(pointer) is called for the removed elements.

      Returns: The number of erased elements.

      @@ -386,7 +386,7 @@ 
    23. template<typename KeyType, typename KeyHasher, typename KeyEqual, 
          typename Disposer> 
-  size_type erase_and_dispose(const KeyType & key, KeyHasher hash_func, 
+  size_type erase_and_dispose(const KeyType & key, KeyHasher hash_func, 
                               KeyEqual equal_func, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases all the elements with the given key. according to the comparison functor "equal_func". Disposer::operator()(pointer) is called for the removed elements.

      @@ -396,14 +396,14 @@

      Note: Invalidates the iterators to the erased elements.

    24. -
      void clear();
      +
      void clear();

      Effects: Erases all of the elements.

      Complexity: Linear to the number of elements on the container. if it's a safe-mode or auto-unlink value_type. Constant time otherwise.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    25. -
      template<typename Disposer> void clear_and_dispose(Disposer disposer);
      +
      template<typename Disposer> void clear_and_dispose(Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases all of the elements.

      Complexity: Linear to the number of elements on the container. Disposer::operator()(pointer) is called for the removed elements.

      @@ -411,14 +411,14 @@

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    26. -
      size_type count(const key_type & key) const;
      +
      size_type count(const key_type & key) const;

      Effects: Returns the number of contained elements with the given value

      Complexity: Average case O(1), worst case O(this->size()).

      Throws: If the internal hasher or the equality functor throws. 

    27. template<typename KeyType, typename KeyHasher, typename KeyEqual> 
-  size_type count(const KeyType & key, KeyHasher hash_func, 
+  size_type count(const KeyType & key, KeyHasher hash_func, 
                   KeyEqual equal_func) const;

      Requires: "hash_func" must be a hash function that induces the same hash values as the stored hasher. The difference is that "hash_func" hashes the given key instead of the value_type.

      "equal_func" must be a equality function that induces the same equality as key_equal. The difference is that "equal_func" compares an arbitrary key with the contained values.

      @@ -427,14 +427,14 @@

      Throws: If hash_func or equal throw.

    28. -
      iterator find(const key_type & key);
      +
      iterator find(const key_type & key);

      Effects: Finds an iterator to the first element is equal to "value" or end() if that element does not exist.

      Complexity: Average case O(1), worst case O(this->size()).

      Throws: If the internal hasher or the equality functor throws. 

    29. template<typename KeyType, typename KeyHasher, typename KeyEqual> 
-  iterator find(const KeyType & key, KeyHasher hash_func, KeyEqual equal_func);
      + iterator find(const KeyType & key, KeyHasher hash_func, KeyEqual equal_func);

      Requires: "hash_func" must be a hash function that induces the same hash values as the stored hasher. The difference is that "hash_func" hashes the given key instead of the value_type.

      "equal_func" must be a equality function that induces the same equality as key_equal. The difference is that "equal_func" compares an arbitrary key with the contained values.

      Effects: Finds an iterator to the first element whose key is "key" according to the given hash and equality functor or end() if that element does not exist.

      @@ -443,7 +443,7 @@

      Note: This function is used when constructing a value_type is expensive and the value_type can be compared with a cheaper key type. Usually this key is part of the value_type.

    30. -
      const_iterator find(const key_type & key) const;
      +
      const_iterator find(const key_type & key) const;

      Effects: Returns the number of contained elements with the given value

      Complexity: Average case O(1), worst case O(this->size()).

      Throws: If the internal hasher or the equality functor throws.

      @@ -451,7 +451,7 @@ 
    31. template<typename KeyType, typename KeyHasher, typename KeyEqual> 
   const_iterator 
-  find(const KeyType & key, KeyHasher hash_func, KeyEqual equal_func) const;
      + find(const KeyType & key, KeyHasher hash_func, KeyEqual equal_func) const;

      Requires: "hash_func" must be a hash function that induces the same hash values as the stored hasher. The difference is that "hash_func" hashes the given key instead of the value_type.

      "equal_func" must be a equality function that induces the same equality as key_equal. The difference is that "equal_func" compares an arbitrary key with the contained values.

      Effects: Finds an iterator to the first element whose key is "key" according to the given hasher and equality functor or end() if that element does not exist.

      @@ -460,7 +460,7 @@

      Note: This function is used when constructing a value_type is expensive and the value_type can be compared with a cheaper key type. Usually this key is part of the value_type.

    32. -
      std::pair< iterator, iterator > equal_range(const key_type & key);
      +
      std::pair< iterator, iterator > equal_range(const key_type & key);

      Effects: Returns a range containing all elements with values equivalent to value. Returns std::make_pair(this->end(), this->end()) if no such elements exist.

      Complexity: Average case O(this->count(value)). Worst case O(this->size()).

      Throws: If the internal hasher or the equality functor throws.

      @@ -468,7 +468,7 @@ 
    33. template<typename KeyType, typename KeyHasher, typename KeyEqual> 
   std::pair< iterator, iterator > 
-  equal_range(const KeyType & key, KeyHasher hash_func, KeyEqual equal_func);
      + equal_range(const KeyType & key, KeyHasher hash_func, KeyEqual equal_func);

      Requires: "hash_func" must be a hash function that induces the same hash values as the stored hasher. The difference is that "hash_func" hashes the given key instead of the value_type.

      "equal_func" must be a equality function that induces the same equality as key_equal. The difference is that "equal_func" compares an arbitrary key with the contained values.

      Effects: Returns a range containing all elements with equivalent keys. Returns std::make_pair(this->end(), this->end()) if no such elements exist.

      @@ -478,7 +478,7 @@ 
    34. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & key) const;
      +equal_range(const key_type & key) const;

      Effects: Returns a range containing all elements with values equivalent to value. Returns std::make_pair(this->end(), this->end()) if no such elements exist.

      Complexity: Average case O(this->count(value)). Worst case O(this->size()).

      Throws: If the internal hasher or the equality functor throws.

      @@ -486,7 +486,7 @@ 
    35. template<typename KeyType, typename KeyHasher, typename KeyEqual> 
   std::pair< const_iterator, const_iterator > 
-  equal_range(const KeyType & key, KeyHasher hash_func, KeyEqual equal_func) const;
      + equal_range(const KeyType & key, KeyHasher hash_func, KeyEqual equal_func) const;

      Requires: "hash_func" must be a hash function that induces the same hash values as the stored hasher. The difference is that "hash_func" hashes the given key instead of the value_type.

      "equal_func" must be a equality function that induces the same equality as key_equal. The difference is that "equal_func" compares an arbitrary key with the contained values.

      Effects: Returns a range containing all elements with equivalent keys. Returns std::make_pair(this->end(), this->end()) if no such elements exist.

      @@ -495,48 +495,48 @@

      Note: This function is used when constructing a value_type is expensive and the value_type can be compared with a cheaper key type. Usually this key is part of the value_type.

    36. -
      iterator iterator_to(reference value);
      +
      iterator iterator_to(reference value);

      Requires: value must be an lvalue and shall be in a unordered_set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator belonging to the unordered_set that points to the value

      Complexity: Constant.

      Throws: If the internal hash function throws.

    37. -
      const_iterator iterator_to(const_reference value) const;
      +
      const_iterator iterator_to(const_reference value) const;

      Requires: value must be an lvalue and shall be in a unordered_set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid const_iterator belonging to the unordered_set that points to the value

      Complexity: Constant.

      Throws: If the internal hash function throws.

    38. -
      local_iterator local_iterator_to(reference value);
      +
      local_iterator local_iterator_to(reference value);

      Requires: value must be an lvalue and shall be in a unordered_set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid local_iterator belonging to the unordered_set that points to the value

      Complexity: Constant.

      Throws: Nothing.

    39. -
      const_local_iterator local_iterator_to(const_reference value) const;
      +
      const_local_iterator local_iterator_to(const_reference value) const;

      Requires: value must be an lvalue and shall be in a unordered_set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid local_iterator belonging to the unordered_set that points to the value

      Complexity: Constant.

      Throws: Nothing.

    40. -
      size_type bucket_count() const;
      +
      size_type bucket_count() const;

      Effects: Returns the number of buckets passed in the constructor or the last rehash function.

      Complexity: Constant.

      Throws: Nothing.

    41. -
      size_type bucket_size(size_type n) const;
      +
      size_type bucket_size(size_type n) const;

      Requires: n is in the range [0, this->bucket_count()).

      Effects: Returns the number of elements in the nth bucket.

      Complexity: Constant.

      Throws: Nothing.

    42. -
      size_type bucket(const key_type & k) const;
      +
      size_type bucket(const key_type & k) const;

      Effects: Returns the index of the bucket in which elements with keys equivalent to k would be found, if any such element existed.

      Complexity: Constant.

      Throws: If the hash functor throws.

      @@ -544,7 +544,7 @@ 
    43. template<typename KeyType, typename KeyHasher> 
-  size_type bucket(const KeyType & k, KeyHasher hash_func) const;
      + size_type bucket(const KeyType & k, KeyHasher hash_func) const;

      Requires: "hash_func" must be a hash function that induces the same hash values as the stored hasher. The difference is that "hash_func" hashes the given key instead of the value_type.

      Effects: Returns the index of the bucket in which elements with keys equivalent to k would be found, if any such element existed.

      Complexity: Constant.

      @@ -552,13 +552,13 @@

      Note: the return value is in the range [0, this->bucket_count()).

    44. -
      bucket_ptr bucket_pointer() const;
      +
      bucket_ptr bucket_pointer() const;

      Effects: Returns the bucket array pointer passed in the constructor or the last rehash function.

      Complexity: Constant.

      Throws: Nothing.

    45. -
      local_iterator begin(size_type n);
      +
      local_iterator begin(size_type n);

      Requires: n is in the range [0, this->bucket_count()).

      Effects: Returns a local_iterator pointing to the beginning of the sequence stored in the bucket n.

      Complexity: Constant.

      @@ -566,7 +566,7 @@

      Note: [this->begin(n), this->end(n)) is a valid range containing all of the elements in the nth bucket.

    46. -
      const_local_iterator begin(size_type n) const;
      +
      const_local_iterator begin(size_type n) const;

      Requires: n is in the range [0, this->bucket_count()).

      Effects: Returns a const_local_iterator pointing to the beginning of the sequence stored in the bucket n.

      Complexity: Constant.

      @@ -574,7 +574,7 @@

      Note: [this->begin(n), this->end(n)) is a valid range containing all of the elements in the nth bucket.

    47. -
      const_local_iterator cbegin(size_type n) const;
      +
      const_local_iterator cbegin(size_type n) const;

      Requires: n is in the range [0, this->bucket_count()).

      Effects: Returns a const_local_iterator pointing to the beginning of the sequence stored in the bucket n.

      Complexity: Constant.

      @@ -582,7 +582,7 @@

      Note: [this->begin(n), this->end(n)) is a valid range containing all of the elements in the nth bucket.

    48. -
      local_iterator end(size_type n);
      +
      local_iterator end(size_type n);

      Requires: n is in the range [0, this->bucket_count()).

      Effects: Returns a local_iterator pointing to the end of the sequence stored in the bucket n.

      Complexity: Constant.

      @@ -590,7 +590,7 @@

      Note: [this->begin(n), this->end(n)) is a valid range containing all of the elements in the nth bucket.

    49. -
      const_local_iterator end(size_type n) const;
      +
      const_local_iterator end(size_type n) const;

      Requires: n is in the range [0, this->bucket_count()).

      Effects: Returns a const_local_iterator pointing to the end of the sequence stored in the bucket n.

      Complexity: Constant.

      @@ -598,7 +598,7 @@

      Note: [this->begin(n), this->end(n)) is a valid range containing all of the elements in the nth bucket.

    50. -
      const_local_iterator cend(size_type n) const;
      +
      const_local_iterator cend(size_type n) const;

      Requires: n is in the range [0, this->bucket_count()).

      Effects: Returns a const_local_iterator pointing to the end of the sequence stored in the bucket n.

      Complexity: Constant.

      @@ -606,7 +606,7 @@

      Note: [this->begin(n), this->end(n)) is a valid range containing all of the elements in the nth bucket.

    51. -
      void rehash(const bucket_traits & new_bucket_traits);
      +
      void rehash(const bucket_traits & new_bucket_traits);

      Requires: new_bucket_traits can hold a pointer to a new bucket array or the same as the old bucket array with a different length. new_size is the length of the the array pointed by new_buckets. If new_bucket_traits.bucket_begin() == this->bucket_pointer() new_bucket_traits.bucket_count() can be bigger or smaller than this->bucket_count(). 'new_bucket_traits' copy constructor should not throw.

      Effects: Updates the internal reference with the new bucket, erases the values from the old bucket and inserts then in the new one. Bucket traits hold by *this is assigned from new_bucket_traits. If the container is configured as incremental<>, the split bucket is set to the new bucket_count().

      If store_hash option is true, this method does not use the hash function.

      @@ -614,7 +614,7 @@

      Throws: If the hasher functor throws. Basic guarantee.

    52. -
      bool incremental_rehash(bool grow = true);
      +
      bool incremental_rehash(bool grow = true);

      Requires:

      Effects:

      Complexity:

      @@ -622,7 +622,7 @@

      Note: this method is only available if incremental<true> option is activated.

    53. -
      bool incremental_rehash(const bucket_traits & new_bucket_traits);
      +
      bool incremental_rehash(const bucket_traits & new_bucket_traits);

      Effects: If new_bucket_traits.bucket_count() is not this->bucket_count()/2 or this->bucket_count()*2, or this->split_bucket() != new_bucket_traits.bucket_count() returns false and does nothing.

      Otherwise, copy assigns new_bucket_traits to the internal bucket_traits and transfers all the objects from old buckets to the new ones.

      Complexity: Linear to size().

      @@ -630,7 +630,7 @@

      Note: this method is only available if incremental<true> option is activated.

    54. -
      size_type split_count() const;
      +
      size_type split_count() const;

      Requires: incremental<> option must be set

      Effects: returns the current split count

      Complexity: Constant

      @@ -639,11 +639,11 @@
    -

    -unordered_multiset public static functions

    +

    +unordered_multiset public static functions

    1. -
      static local_iterator s_local_iterator_to(reference value);
      +
      static local_iterator s_local_iterator_to(reference value);

      Requires: value must be an lvalue and shall be in a unordered_set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid local_iterator belonging to the unordered_set that points to the value

      Complexity: Constant.

      @@ -651,7 +651,7 @@

      Note: This static function is available only if the value traits is stateless.

    2. -
      static const_local_iterator s_local_iterator_to(const_reference value);
      +
      static const_local_iterator s_local_iterator_to(const_reference value);

      Requires: value must be an lvalue and shall be in a unordered_set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid local_iterator belonging to the unordered_set that points to the value

      Complexity: Constant.

      @@ -659,13 +659,13 @@

      Note: This static function is available only if the value traits is stateless.

    3. -
      static size_type suggested_upper_bucket_count(size_type n);
      +
      static size_type suggested_upper_bucket_count(size_type n);

      Effects: Returns the nearest new bucket count optimized for the container that is bigger or equal than n. This suggestion can be used to create bucket arrays with a size that will usually improve container's performance. If such value does not exist, the higher possible value is returned.

      Complexity: Amortized constant time.

      Throws: Nothing.

    4. -
      static size_type suggested_lower_bucket_count(size_type n);
      +
      static size_type suggested_lower_bucket_count(size_type n);

      Effects: Returns the nearest new bucket count optimized for the container that is smaller or equal than n. This suggestion can be used to create bucket arrays with a size that will usually improve container's performance. If such value does not exist, the lowest possible value is returned.

      Complexity: Amortized constant time.

      Throws: Nothing.

      diff --git a/doc/html/boost/intrusive/unordered_set.html b/doc/html/boost/intrusive/unordered_set.html index 73eaa920b1..189917995c 100644 --- a/doc/html/boost/intrusive/unordered_set.html +++ b/doc/html/boost/intrusive/unordered_set.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      @@ -64,102 +64,102 @@ typedef implementation_defined::node_algorithms node_algorithms; // construct/copy/destruct - explicit unordered_set(const bucket_traits &, const hasher & = hasher(), + explicit unordered_set(const bucket_traits &, const hasher & = hasher(), const key_equal & = key_equal(), const value_traits & = value_traits()); template<typename Iterator> - unordered_set(Iterator, Iterator, const bucket_traits &, + unordered_set(Iterator, Iterator, const bucket_traits &, const hasher & = hasher(), const key_equal & = key_equal(), const value_traits & = value_traits()); - unordered_set(unordered_set &&); - unordered_set & operator=(unordered_set &&); - ~unordered_set(); + unordered_set(unordered_set &&); + unordered_set & operator=(unordered_set &&); + ~unordered_set(); - // public member functions - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end(); - const_iterator end() const; - const_iterator cend() const; - hasher hash_function() const; - key_equal key_eq() const; - bool empty() const; - size_type size() const; - void swap(unordered_set &); + // public member functions + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end(); + const_iterator end() const; + const_iterator cend() const; + hasher hash_function() const; + key_equal key_eq() const; + bool empty() const; + size_type size() const; + void swap(unordered_set &); template<typename Cloner, typename Disposer> - void clone_from(const unordered_set &, Cloner, Disposer); + void clone_from(const unordered_set &, Cloner, Disposer); template<typename Cloner, typename Disposer> - void clone_from(unordered_set &&, Cloner, Disposer); - std::pair< iterator, bool > insert(reference); - template<typename Iterator> void insert(Iterator, Iterator); + void clone_from(unordered_set &&, Cloner, Disposer); + std::pair< iterator, bool > insert(reference); + template<typename Iterator> void insert(Iterator, Iterator); template<typename KeyType, typename KeyHasher, typename KeyEqual> std::pair< iterator, bool > - insert_check(const KeyType &, KeyHasher, KeyEqual, insert_commit_data &); - iterator insert_commit(reference, const insert_commit_data &); - void erase(const_iterator); - void erase(const_iterator, const_iterator); - size_type erase(const key_type &); + insert_check(const KeyType &, KeyHasher, KeyEqual, insert_commit_data &); + iterator insert_commit(reference, const insert_commit_data &); + void erase(const_iterator); + void erase(const_iterator, const_iterator); + size_type erase(const key_type &); template<typename KeyType, typename KeyHasher, typename KeyEqual> - size_type erase(const KeyType &, KeyHasher, KeyEqual); - template<typename Disposer> void erase_and_dispose(const_iterator, Disposer); + size_type erase(const KeyType &, KeyHasher, KeyEqual); + template<typename Disposer> void erase_and_dispose(const_iterator, Disposer); template<typename Disposer> - void erase_and_dispose(const_iterator, const_iterator, Disposer); + void erase_and_dispose(const_iterator, const_iterator, Disposer); template<typename Disposer> - size_type erase_and_dispose(const key_type &, Disposer); + size_type erase_and_dispose(const key_type &, Disposer); template<typename KeyType, typename KeyHasher, typename KeyEqual, typename Disposer> - size_type erase_and_dispose(const KeyType &, KeyHasher, KeyEqual, + size_type erase_and_dispose(const KeyType &, KeyHasher, KeyEqual, Disposer); - void clear(); - template<typename Disposer> void clear_and_dispose(Disposer); - size_type count(const key_type &) const; + void clear(); + template<typename Disposer> void clear_and_dispose(Disposer); + size_type count(const key_type &) const; template<typename KeyType, typename KeyHasher, typename KeyEqual> - size_type count(const KeyType &, KeyHasher, KeyEqual) const; - iterator find(const key_type &); + size_type count(const KeyType &, KeyHasher, KeyEqual) const; + iterator find(const key_type &); template<typename KeyType, typename KeyHasher, typename KeyEqual> - iterator find(const KeyType &, KeyHasher, KeyEqual); - const_iterator find(const key_type &) const; + iterator find(const KeyType &, KeyHasher, KeyEqual); + const_iterator find(const key_type &) const; template<typename KeyType, typename KeyHasher, typename KeyEqual> - const_iterator find(const KeyType &, KeyHasher, KeyEqual) const; - std::pair< iterator, iterator > equal_range(const key_type &); + const_iterator find(const KeyType &, KeyHasher, KeyEqual) const; + std::pair< iterator, iterator > equal_range(const key_type &); template<typename KeyType, typename KeyHasher, typename KeyEqual> std::pair< iterator, iterator > - equal_range(const KeyType &, KeyHasher, KeyEqual); + equal_range(const KeyType &, KeyHasher, KeyEqual); std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; + equal_range(const key_type &) const; template<typename KeyType, typename KeyHasher, typename KeyEqual> std::pair< const_iterator, const_iterator > - equal_range(const KeyType &, KeyHasher, KeyEqual) const; - iterator iterator_to(reference); - const_iterator iterator_to(const_reference) const; - local_iterator local_iterator_to(reference); - const_local_iterator local_iterator_to(const_reference) const; - size_type bucket_count() const; - size_type bucket_size(size_type) const; - size_type bucket(const key_type &) const; + equal_range(const KeyType &, KeyHasher, KeyEqual) const; + iterator iterator_to(reference); + const_iterator iterator_to(const_reference) const; + local_iterator local_iterator_to(reference); + const_local_iterator local_iterator_to(const_reference) const; + size_type bucket_count() const; + size_type bucket_size(size_type) const; + size_type bucket(const key_type &) const; template<typename KeyType, typename KeyHasher> - size_type bucket(const KeyType &, KeyHasher) const; - bucket_ptr bucket_pointer() const; - local_iterator begin(size_type); - const_local_iterator begin(size_type) const; - const_local_iterator cbegin(size_type) const; - local_iterator end(size_type); - const_local_iterator end(size_type) const; - const_local_iterator cend(size_type) const; - void rehash(const bucket_traits &); - bool incremental_rehash(bool = true); - bool incremental_rehash(const bucket_traits &); - size_type split_count() const; + size_type bucket(const KeyType &, KeyHasher) const; + bucket_ptr bucket_pointer() const; + local_iterator begin(size_type); + const_local_iterator begin(size_type) const; + const_local_iterator cbegin(size_type) const; + local_iterator end(size_type); + const_local_iterator end(size_type) const; + const_local_iterator cend(size_type) const; + void rehash(const bucket_traits &); + bool incremental_rehash(bool = true); + bool incremental_rehash(const bucket_traits &); + size_type split_count() const; - // public static functions - static local_iterator s_local_iterator_to(reference); - static const_local_iterator s_local_iterator_to(const_reference); - static size_type suggested_upper_bucket_count(size_type); - static size_type suggested_lower_bucket_count(size_type); + // public static functions + static local_iterator s_local_iterator_to(reference); + static const_local_iterator s_local_iterator_to(const_reference); + static size_type suggested_upper_bucket_count(size_type); + static size_type suggested_lower_bucket_count(size_type); };
      -

      Description

      +

      Description

      The class template unordered_set is an intrusive container, that mimics most of the interface of std::tr1::unordered_set as described in the C++ TR1.

      unordered_set is a semi-intrusive container: each object to be stored in the container must contain a proper hook, but the container also needs additional auxiliary memory to work: unordered_set needs a pointer to an array of type bucket_type to be passed in the constructor. This bucket array must have at least the same lifetime as the container. This makes the use of unordered_set more complicated than purely intrusive containers. bucket_type is default-constructible, copyable and assignable

      The template parameter T is the type to be managed by the container. The user can specify additional options and if no options are provided default options are used.

      @@ -169,13 +169,13 @@

      unordered_set, unlike std::unordered_set, does not make automatic rehashings nor offers functions related to a load factor. Rehashing can be explicitly requested and the user must provide a new bucket array that will be used from that moment.

      Since no automatic rehashing is done, iterators are never invalidated when inserting or erasing elements. Iterators are only invalidated when rehasing.

      -

      +

      unordered_set public construct/copy/destruct

      1. -
        explicit unordered_set(const bucket_traits & b_traits, 
+
        explicit unordered_set(const bucket_traits & b_traits, 
                        const hasher & hash_func = hasher(), 
                        const key_equal & equal_func = key_equal(), 
                        const value_traits & v_traits = value_traits());
        
@@ -187,7 +187,7 @@
 
      2. template<typename Iterator> 
-  unordered_set(Iterator b, Iterator e, const bucket_traits & b_traits, 
+  unordered_set(Iterator b, Iterator e, const bucket_traits & b_traits, 
                 const hasher & hash_func = hasher(), 
                 const key_equal & equal_func = key_equal(), 
                 const value_traits & v_traits = value_traits());
        @@ -198,15 +198,15 @@

        Notes: buckets array must be disposed only after *this is disposed.

      3. -
        unordered_set(unordered_set && x);
        +
        unordered_set(unordered_set && x);

        Effects: to-do

      4. -
        unordered_set & operator=(unordered_set && x);
        +
        unordered_set & operator=(unordered_set && x);

        Effects: to-do

      5. -
        ~unordered_set();
        +
        ~unordered_set();

        Effects: Detaches all elements from this. The objects in the unordered_set are not deleted (i.e. no destructors are called).

        Complexity: Linear to the number of elements in the unordered_set, if it's a safe-mode or auto-unlink value. Otherwise constant.

        Throws: Nothing.

        @@ -214,71 +214,71 @@
      -

      -unordered_set public member functions

      +

      +unordered_set public member functions

      1. -
        iterator begin();
        +
        iterator begin();

        Effects: Returns an iterator pointing to the beginning of the unordered_set.

        Complexity: Amortized constant time. Worst case (empty unordered_set): O(this->bucket_count())

        Throws: Nothing.

      2. -
        const_iterator begin() const;
        +
        const_iterator begin() const;

        Effects: Returns a const_iterator pointing to the beginning of the unordered_set.

        Complexity: Amortized constant time. Worst case (empty unordered_set): O(this->bucket_count())

        Throws: Nothing.

      3. -
        const_iterator cbegin() const;
        +
        const_iterator cbegin() const;

        Effects: Returns a const_iterator pointing to the beginning of the unordered_set.

        Complexity: Amortized constant time. Worst case (empty unordered_set): O(this->bucket_count())

        Throws: Nothing.

      4. -
        iterator end();
        +
        iterator end();

        Effects: Returns an iterator pointing to the end of the unordered_set.

        Complexity: Constant.

        Throws: Nothing.

      5. -
        const_iterator end() const;
        +
        const_iterator end() const;

        Effects: Returns a const_iterator pointing to the end of the unordered_set.

        Complexity: Constant.

        Throws: Nothing.

      6. -
        const_iterator cend() const;
        +
        const_iterator cend() const;

        Effects: Returns a const_iterator pointing to the end of the unordered_set.

        Complexity: Constant.

        Throws: Nothing.

      7. -
        hasher hash_function() const;
        +
        hasher hash_function() const;

        Effects: Returns the hasher object used by the unordered_set.

        Complexity: Constant.

        Throws: If hasher copy-constructor throws.

      8. -
        key_equal key_eq() const;
        +
        key_equal key_eq() const;

        Effects: Returns the key_equal object used by the unordered_set.

        Complexity: Constant.

        Throws: If key_equal copy-constructor throws.

      9. -
        bool empty() const;
        +
        bool empty() const;

        Effects: Returns true if the container is empty.

        Complexity: if constant-time size and cache_begin options are disabled, average constant time (worst case, with empty() == true: O(this->bucket_count()). Otherwise constant.

        Throws: Nothing.

      10. -
        size_type size() const;
        +
        size_type size() const;

        Effects: Returns the number of elements stored in the unordered_set.

        Complexity: Linear to elements contained in *this if constant_time_size is false. Constant-time otherwise.

        Throws: Nothing.

      11. -
        void swap(unordered_set & other);
        +
        void swap(unordered_set & other);

        Requires: buckets must not be being used by any other resource.

        Effects: Constructs an empty unordered_set, storing a reference to the bucket array and copies of the key_hasher and equal_func functors.

        Complexity: Constant.

        @@ -287,7 +287,7 @@ 
      12. template<typename Cloner, typename Disposer> 
-  void clone_from(const unordered_set & src, Cloner cloner, Disposer disposer);
        + void clone_from(const unordered_set & src, Cloner cloner, Disposer disposer);

        Requires: Disposer::operator()(pointer) shouldn't throw Cloner should yield to nodes that compare equal and produce the same hash than the original node.

        Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(const_reference ) and inserts them on *this. The hash function and the equality predicate are copied from the source.

        If store_hash option is true, this method does not use the hash function.

        @@ -297,7 +297,7 @@ 
      13. template<typename Cloner, typename Disposer> 
-  void clone_from(unordered_set && src, Cloner cloner, Disposer disposer);
        + void clone_from(unordered_set && src, Cloner cloner, Disposer disposer);

        Requires: Disposer::operator()(pointer) shouldn't throw Cloner should yield to nodes that compare equal and produce the same hash than the original node.

        Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(reference) and inserts them on *this. The hash function and the equality predicate are copied from the source.

        If store_hash option is true, this method does not use the hash function.

        @@ -306,7 +306,7 @@

        Throws: If cloner or hasher throw or hash or equality predicate copying throws. Basic guarantee.

      14. -
        std::pair< iterator, bool > insert(reference value);
        +
        std::pair< iterator, bool > insert(reference value);

        Requires: value must be an lvalue

        Effects: Tries to inserts value into the unordered_set.

        Returns: If the value is not already present inserts it and returns a pair containing the iterator to the new value and true. If there is an equivalent value returns a pair containing an iterator to the already present value and false.

        @@ -315,7 +315,7 @@

        Note: Does not affect the validity of iterators and references. No copy-constructors are called.

      15. -
        template<typename Iterator> void insert(Iterator b, Iterator e);
        +
        template<typename Iterator> void insert(Iterator b, Iterator e);

        Requires: Dereferencing iterator must yield an lvalue of type value_type.

        Effects: Equivalent to this->insert_unique(t) for each element in [b, e).

        Complexity: Average case O(N), where N is distance(b, e). Worst case O(N*this->size()).

        @@ -325,7 +325,7 @@ 
      16. template<typename KeyType, typename KeyHasher, typename KeyEqual> 
   std::pair< iterator, bool > 
-  insert_check(const KeyType & key, KeyHasher hasher, 
+  insert_check(const KeyType & key, KeyHasher hasher, 
                KeyEqual key_value_equal, insert_commit_data & commit_data);

        Requires: "hash_func" must be a hash function that induces the same hash values as the stored hasher. The difference is that "hash_func" hashes the given key instead of the value_type.

        "equal_func" must be a equality function that induces the same equality as key_equal. The difference is that "equal_func" compares an arbitrary key with the contained values.

        @@ -339,7 +339,7 @@

        After a successful rehashing insert_commit_data remains valid.

      17. -
        iterator insert_commit(reference value, 
+
        iterator insert_commit(reference value, 
                        const insert_commit_data & commit_data);
        
 
        Requires: value must be an lvalue of type value_type. commit_data must have been obtained from a previous call to "insert_check". No objects should have been inserted or erased from the unordered_set between the "insert_check" that filled "commit_data" and the call to "insert_commit".
        
 
        Effects: Inserts the value in the unordered_set using the information obtained from the "commit_data" that a previous "insert_check" filled.
        
@@ -350,21 +350,21 @@
 
        After a successful rehashing insert_commit_data remains valid.
      18. -
        void erase(const_iterator i);
        +
        void erase(const_iterator i);

        Effects: Erases the element pointed to by i.

        Complexity: Average case O(1), worst case O(this->size()).

        Throws: Nothing.

        Note: Invalidates the iterators (but not the references) to the erased element. No destructors are called.

      19. -
        void erase(const_iterator b, const_iterator e);
        +
        void erase(const_iterator b, const_iterator e);

        Effects: Erases the range pointed to by b end e.

        Complexity: Average case O(distance(b, e)), worst case O(this->size()).

        Throws: Nothing.

        Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

      20. -
        size_type erase(const key_type & key);
        +
        size_type erase(const key_type & key);

        Effects: Erases all the elements with the given value.

        Returns: The number of erased elements.

        Complexity: Average case O(this->count(value)). Worst case O(this->size()).

        @@ -373,7 +373,7 @@ 
      21. template<typename KeyType, typename KeyHasher, typename KeyEqual> 
-  size_type erase(const KeyType & key, KeyHasher hash_func, 
+  size_type erase(const KeyType & key, KeyHasher hash_func, 
                   KeyEqual equal_func);

        Requires: "hash_func" must be a hash function that induces the same hash values as the stored hasher. The difference is that "hash_func" hashes the given key instead of the value_type.

        "equal_func" must be a equality function that induces the same equality as key_equal. The difference is that "equal_func" compares an arbitrary key with the contained values.

        @@ -385,7 +385,7 @@ 
      22. template<typename Disposer> 
-  void erase_and_dispose(const_iterator i, Disposer disposer);
        + void erase_and_dispose(const_iterator i, Disposer disposer);

        Requires: Disposer::operator()(pointer) shouldn't throw.

        Effects: Erases the element pointed to by i. Disposer::operator()(pointer) is called for the removed element.

        Complexity: Average case O(1), worst case O(this->size()).

        @@ -394,7 +394,7 @@ 
      23. template<typename Disposer> 
-  void erase_and_dispose(const_iterator b, const_iterator e, 
+  void erase_and_dispose(const_iterator b, const_iterator e, 
                          Disposer disposer);

        Requires: Disposer::operator()(pointer) shouldn't throw.

        Effects: Erases the range pointed to by b end e. Disposer::operator()(pointer) is called for the removed elements.

        @@ -404,7 +404,7 @@ 
      24. template<typename Disposer> 
-  size_type erase_and_dispose(const key_type & key, Disposer disposer);
        + size_type erase_and_dispose(const key_type & key, Disposer disposer);

        Requires: Disposer::operator()(pointer) shouldn't throw.

        Effects: Erases all the elements with the given value. Disposer::operator()(pointer) is called for the removed elements.

        Returns: The number of erased elements.

        @@ -415,7 +415,7 @@ 
      25. template<typename KeyType, typename KeyHasher, typename KeyEqual, 
          typename Disposer> 
-  size_type erase_and_dispose(const KeyType & key, KeyHasher hash_func, 
+  size_type erase_and_dispose(const KeyType & key, KeyHasher hash_func, 
                               KeyEqual equal_func, Disposer disposer);

        Requires: Disposer::operator()(pointer) shouldn't throw.

        Effects: Erases all the elements with the given key. according to the comparison functor "equal_func". Disposer::operator()(pointer) is called for the removed elements.

        @@ -425,14 +425,14 @@

        Note: Invalidates the iterators to the erased elements.

      26. -
        void clear();
        +
        void clear();

        Effects: Erases all of the elements.

        Complexity: Linear to the number of elements on the container. if it's a safe-mode or auto-unlink value_type. Constant time otherwise.

        Throws: Nothing.

        Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

      27. -
        template<typename Disposer> void clear_and_dispose(Disposer disposer);
        +
        template<typename Disposer> void clear_and_dispose(Disposer disposer);

        Requires: Disposer::operator()(pointer) shouldn't throw.

        Effects: Erases all of the elements.

        Complexity: Linear to the number of elements on the container. Disposer::operator()(pointer) is called for the removed elements.

        @@ -440,14 +440,14 @@

        Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

      28. -
        size_type count(const key_type & key) const;
        +
        size_type count(const key_type & key) const;

        Effects: Returns the number of contained elements with the given value

        Complexity: Average case O(1), worst case O(this->size()).

        Throws: If the internal hasher or the equality functor throws. 

      29. template<typename KeyType, typename KeyHasher, typename KeyEqual> 
-  size_type count(const KeyType & key, KeyHasher hash_func, 
+  size_type count(const KeyType & key, KeyHasher hash_func, 
                   KeyEqual equal_func) const;

        Requires: "hash_func" must be a hash function that induces the same hash values as the stored hasher. The difference is that "hash_func" hashes the given key instead of the value_type.

        "equal_func" must be a equality function that induces the same equality as key_equal. The difference is that "equal_func" compares an arbitrary key with the contained values.

        @@ -456,14 +456,14 @@

        Throws: If hash_func or equal throw.

      30. -
        iterator find(const key_type & key);
        +
        iterator find(const key_type & key);

        Effects: Finds an iterator to the first element is equal to "value" or end() if that element does not exist.

        Complexity: Average case O(1), worst case O(this->size()).

        Throws: If the internal hasher or the equality functor throws. 

      31. template<typename KeyType, typename KeyHasher, typename KeyEqual> 
-  iterator find(const KeyType & key, KeyHasher hash_func, KeyEqual equal_func);
        + iterator find(const KeyType & key, KeyHasher hash_func, KeyEqual equal_func);

        Requires: "hash_func" must be a hash function that induces the same hash values as the stored hasher. The difference is that "hash_func" hashes the given key instead of the value_type.

        "equal_func" must be a equality function that induces the same equality as key_equal. The difference is that "equal_func" compares an arbitrary key with the contained values.

        Effects: Finds an iterator to the first element whose key is "key" according to the given hash and equality functor or end() if that element does not exist.

        @@ -472,7 +472,7 @@

        Note: This function is used when constructing a value_type is expensive and the value_type can be compared with a cheaper key type. Usually this key is part of the value_type.

      32. -
        const_iterator find(const key_type & key) const;
        +
        const_iterator find(const key_type & key) const;

        Effects: Returns the number of contained elements with the given value

        Complexity: Average case O(1), worst case O(this->size()).

        Throws: If the internal hasher or the equality functor throws.

        @@ -480,7 +480,7 @@ 
      33. template<typename KeyType, typename KeyHasher, typename KeyEqual> 
   const_iterator 
-  find(const KeyType & key, KeyHasher hash_func, KeyEqual equal_func) const;
        + find(const KeyType & key, KeyHasher hash_func, KeyEqual equal_func) const;

        Requires: "hash_func" must be a hash function that induces the same hash values as the stored hasher. The difference is that "hash_func" hashes the given key instead of the value_type.

        "equal_func" must be a equality function that induces the same equality as key_equal. The difference is that "equal_func" compares an arbitrary key with the contained values.

        Effects: Finds an iterator to the first element whose key is "key" according to the given hasher and equality functor or end() if that element does not exist.

        @@ -489,7 +489,7 @@

        Note: This function is used when constructing a value_type is expensive and the value_type can be compared with a cheaper key type. Usually this key is part of the value_type.

      34. -
        std::pair< iterator, iterator > equal_range(const key_type & key);
        +
        std::pair< iterator, iterator > equal_range(const key_type & key);

        Effects: Returns a range containing all elements with values equivalent to value. Returns std::make_pair(this->end(), this->end()) if no such elements exist.

        Complexity: Average case O(this->count(value)). Worst case O(this->size()).

        Throws: If the internal hasher or the equality functor throws.

        @@ -497,7 +497,7 @@ 
      35. template<typename KeyType, typename KeyHasher, typename KeyEqual> 
   std::pair< iterator, iterator > 
-  equal_range(const KeyType & key, KeyHasher hash_func, KeyEqual equal_func);
        + equal_range(const KeyType & key, KeyHasher hash_func, KeyEqual equal_func);

        Requires: "hash_func" must be a hash function that induces the same hash values as the stored hasher. The difference is that "hash_func" hashes the given key instead of the value_type.

        "equal_func" must be a equality function that induces the same equality as key_equal. The difference is that "equal_func" compares an arbitrary key with the contained values.

        Effects: Returns a range containing all elements with equivalent keys. Returns std::make_pair(this->end(), this->end()) if no such elements exist.

        @@ -507,7 +507,7 @@ 
      36. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & key) const;
        +equal_range(const key_type & key) const;

        Effects: Returns a range containing all elements with values equivalent to value. Returns std::make_pair(this->end(), this->end()) if no such elements exist.

        Complexity: Average case O(this->count(value)). Worst case O(this->size()).

        Throws: If the internal hasher or the equality functor throws.

        @@ -515,7 +515,7 @@ 
      37. template<typename KeyType, typename KeyHasher, typename KeyEqual> 
   std::pair< const_iterator, const_iterator > 
-  equal_range(const KeyType & key, KeyHasher hash_func, KeyEqual equal_func) const;
        + equal_range(const KeyType & key, KeyHasher hash_func, KeyEqual equal_func) const;

        Requires: "hash_func" must be a hash function that induces the same hash values as the stored hasher. The difference is that "hash_func" hashes the given key instead of the value_type.

        "equal_func" must be a equality function that induces the same equality as key_equal. The difference is that "equal_func" compares an arbitrary key with the contained values.

        Effects: Returns a range containing all elements with equivalent keys. Returns std::make_pair(this->end(), this->end()) if no such elements exist.

        @@ -524,48 +524,48 @@

        Note: This function is used when constructing a value_type is expensive and the value_type can be compared with a cheaper key type. Usually this key is part of the value_type.

      38. -
        iterator iterator_to(reference value);
        +
        iterator iterator_to(reference value);

        Requires: value must be an lvalue and shall be in a unordered_set of appropriate type. Otherwise the behavior is undefined.

        Effects: Returns: a valid iterator belonging to the unordered_set that points to the value

        Complexity: Constant.

        Throws: If the internal hash function throws.

      39. -
        const_iterator iterator_to(const_reference value) const;
        +
        const_iterator iterator_to(const_reference value) const;

        Requires: value must be an lvalue and shall be in a unordered_set of appropriate type. Otherwise the behavior is undefined.

        Effects: Returns: a valid const_iterator belonging to the unordered_set that points to the value

        Complexity: Constant.

        Throws: If the internal hash function throws.

      40. -
        local_iterator local_iterator_to(reference value);
        +
        local_iterator local_iterator_to(reference value);

        Requires: value must be an lvalue and shall be in a unordered_set of appropriate type. Otherwise the behavior is undefined.

        Effects: Returns: a valid local_iterator belonging to the unordered_set that points to the value

        Complexity: Constant.

        Throws: Nothing.

      41. -
        const_local_iterator local_iterator_to(const_reference value) const;
        +
        const_local_iterator local_iterator_to(const_reference value) const;

        Requires: value must be an lvalue and shall be in a unordered_set of appropriate type. Otherwise the behavior is undefined.

        Effects: Returns: a valid local_iterator belonging to the unordered_set that points to the value

        Complexity: Constant.

        Throws: Nothing.

      42. -
        size_type bucket_count() const;
        +
        size_type bucket_count() const;

        Effects: Returns the number of buckets passed in the constructor or the last rehash function.

        Complexity: Constant.

        Throws: Nothing.

      43. -
        size_type bucket_size(size_type n) const;
        +
        size_type bucket_size(size_type n) const;

        Requires: n is in the range [0, this->bucket_count()).

        Effects: Returns the number of elements in the nth bucket.

        Complexity: Constant.

        Throws: Nothing.

      44. -
        size_type bucket(const key_type & k) const;
        +
        size_type bucket(const key_type & k) const;

        Effects: Returns the index of the bucket in which elements with keys equivalent to k would be found, if any such element existed.

        Complexity: Constant.

        Throws: If the hash functor throws.

        @@ -573,7 +573,7 @@ 
      45. template<typename KeyType, typename KeyHasher> 
-  size_type bucket(const KeyType & k, KeyHasher hash_func) const;
        + size_type bucket(const KeyType & k, KeyHasher hash_func) const;

        Requires: "hash_func" must be a hash function that induces the same hash values as the stored hasher. The difference is that "hash_func" hashes the given key instead of the value_type.

        Effects: Returns the index of the bucket in which elements with keys equivalent to k would be found, if any such element existed.

        Complexity: Constant.

        @@ -581,13 +581,13 @@

        Note: the return value is in the range [0, this->bucket_count()).

      46. -
        bucket_ptr bucket_pointer() const;
        +
        bucket_ptr bucket_pointer() const;

        Effects: Returns the bucket array pointer passed in the constructor or the last rehash function.

        Complexity: Constant.

        Throws: Nothing.

      47. -
        local_iterator begin(size_type n);
        +
        local_iterator begin(size_type n);

        Requires: n is in the range [0, this->bucket_count()).

        Effects: Returns a local_iterator pointing to the beginning of the sequence stored in the bucket n.

        Complexity: Constant.

        @@ -595,7 +595,7 @@

        Note: [this->begin(n), this->end(n)) is a valid range containing all of the elements in the nth bucket.

      48. -
        const_local_iterator begin(size_type n) const;
        +
        const_local_iterator begin(size_type n) const;

        Requires: n is in the range [0, this->bucket_count()).

        Effects: Returns a const_local_iterator pointing to the beginning of the sequence stored in the bucket n.

        Complexity: Constant.

        @@ -603,7 +603,7 @@

        Note: [this->begin(n), this->end(n)) is a valid range containing all of the elements in the nth bucket.

      49. -
        const_local_iterator cbegin(size_type n) const;
        +
        const_local_iterator cbegin(size_type n) const;

        Requires: n is in the range [0, this->bucket_count()).

        Effects: Returns a const_local_iterator pointing to the beginning of the sequence stored in the bucket n.

        Complexity: Constant.

        @@ -611,7 +611,7 @@

        Note: [this->begin(n), this->end(n)) is a valid range containing all of the elements in the nth bucket.

      50. -
        local_iterator end(size_type n);
        +
        local_iterator end(size_type n);

        Requires: n is in the range [0, this->bucket_count()).

        Effects: Returns a local_iterator pointing to the end of the sequence stored in the bucket n.

        Complexity: Constant.

        @@ -619,7 +619,7 @@

        Note: [this->begin(n), this->end(n)) is a valid range containing all of the elements in the nth bucket.

      51. -
        const_local_iterator end(size_type n) const;
        +
        const_local_iterator end(size_type n) const;

        Requires: n is in the range [0, this->bucket_count()).

        Effects: Returns a const_local_iterator pointing to the end of the sequence stored in the bucket n.

        Complexity: Constant.

        @@ -627,7 +627,7 @@

        Note: [this->begin(n), this->end(n)) is a valid range containing all of the elements in the nth bucket.

      52. -
        const_local_iterator cend(size_type n) const;
        +
        const_local_iterator cend(size_type n) const;

        Requires: n is in the range [0, this->bucket_count()).

        Effects: Returns a const_local_iterator pointing to the end of the sequence stored in the bucket n.

        Complexity: Constant.

        @@ -635,7 +635,7 @@

        Note: [this->begin(n), this->end(n)) is a valid range containing all of the elements in the nth bucket.

      53. -
        void rehash(const bucket_traits & new_bucket_traits);
        +
        void rehash(const bucket_traits & new_bucket_traits);

        Requires: new_bucket_traits can hold a pointer to a new bucket array or the same as the old bucket array with a different length. new_size is the length of the the array pointed by new_buckets. If new_bucket_traits.bucket_begin() == this->bucket_pointer() new_bucket_traits.bucket_count() can be bigger or smaller than this->bucket_count(). 'new_bucket_traits' copy constructor should not throw.

        Effects: Updates the internal reference with the new bucket, erases the values from the old bucket and inserts then in the new one. Bucket traits hold by *this is assigned from new_bucket_traits. If the container is configured as incremental<>, the split bucket is set to the new bucket_count().

        If store_hash option is true, this method does not use the hash function.

        @@ -643,7 +643,7 @@

        Throws: If the hasher functor throws. Basic guarantee.

      54. -
        bool incremental_rehash(bool grow = true);
        +
        bool incremental_rehash(bool grow = true);

        Requires:

        Effects:

        Complexity:

        @@ -651,7 +651,7 @@

        Note: this method is only available if incremental<true> option is activated.

      55. -
        bool incremental_rehash(const bucket_traits & new_bucket_traits);
        +
        bool incremental_rehash(const bucket_traits & new_bucket_traits);

        Effects: If new_bucket_traits.bucket_count() is not this->bucket_count()/2 or this->bucket_count()*2, or this->split_bucket() != new_bucket_traits.bucket_count() returns false and does nothing.

        Otherwise, copy assigns new_bucket_traits to the internal bucket_traits and transfers all the objects from old buckets to the new ones.

        Complexity: Linear to size().

        @@ -659,7 +659,7 @@

        Note: this method is only available if incremental<true> option is activated.

      56. -
        size_type split_count() const;
        +
        size_type split_count() const;

        Requires: incremental<> option must be set

        Effects: returns the current split count

        Complexity: Constant

        @@ -668,11 +668,11 @@
      -

      -unordered_set public static functions

      +

      +unordered_set public static functions

      1. -
        static local_iterator s_local_iterator_to(reference value);
        +
        static local_iterator s_local_iterator_to(reference value);

        Requires: value must be an lvalue and shall be in a unordered_set of appropriate type. Otherwise the behavior is undefined.

        Effects: Returns: a valid local_iterator belonging to the unordered_set that points to the value

        Complexity: Constant.

        @@ -680,7 +680,7 @@

        Note: This static function is available only if the value traits is stateless.

      2. -
        static const_local_iterator s_local_iterator_to(const_reference value);
        +
        static const_local_iterator s_local_iterator_to(const_reference value);

        Requires: value must be an lvalue and shall be in a unordered_set of appropriate type. Otherwise the behavior is undefined.

        Effects: Returns: a valid local_iterator belonging to the unordered_set that points to the value

        Complexity: Constant.

        @@ -688,13 +688,13 @@

        Note: This static function is available only if the value traits is stateless.

      3. -
        static size_type suggested_upper_bucket_count(size_type n);
        +
        static size_type suggested_upper_bucket_count(size_type n);

        Effects: Returns the nearest new bucket count optimized for the container that is bigger or equal than n. This suggestion can be used to create bucket arrays with a size that will usually improve container's performance. If such value does not exist, the higher possible value is returned.

        Complexity: Amortized constant time.

        Throws: Nothing.

      4. -
        static size_type suggested_lower_bucket_count(size_type n);
        +
        static size_type suggested_lower_bucket_count(size_type n);

        Effects: Returns the nearest new bucket count optimized for the container that is smaller or equal than n. This suggestion can be used to create bucket arrays with a size that will usually improve container's performance. If such value does not exist, the lowest possible value is returned.

        Complexity: Amortized constant time.

        Throws: Nothing.

        @@ -713,7 +713,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        diff --git a/doc/html/boost/intrusive/unordered_set_base_hook.html b/doc/html/boost/intrusive/unordered_set_base_hook.html index 350a8af70f..de26af8b8d 100644 --- a/doc/html/boost/intrusive/unordered_set_base_hook.html +++ b/doc/html/boost/intrusive/unordered_set_base_hook.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        @@ -38,18 +38,18 @@ { public: // construct/copy/destruct - unordered_set_base_hook(); - unordered_set_base_hook(const unordered_set_base_hook &); - unordered_set_base_hook & operator=(const unordered_set_base_hook &); - ~unordered_set_base_hook(); + unordered_set_base_hook(); + unordered_set_base_hook(const unordered_set_base_hook &); + unordered_set_base_hook & operator=(const unordered_set_base_hook &); + ~unordered_set_base_hook(); - // public member functions - void swap_nodes(unordered_set_base_hook &); - bool is_linked() const; - void unlink(); + // public member functions + void swap_nodes(unordered_set_base_hook &); + bool is_linked() const; + void unlink(); };
        -

        Description

        +

        Description

        Derive a class from unordered_set_base_hook in order to store objects in in an unordered_set/unordered_multi_set. unordered_set_base_hook holds the data necessary to maintain the unordered_set/unordered_multi_set and provides an appropriate value_traits class for unordered_set/unordered_multi_set.

        The hook admits the following options: tag<>, void_pointer<>, link_mode<>, store_hash<> and optimize_multikey<>.

        tag<> defines a tag to identify the node. The same tag value can be used in different classes, but if a class is derived from more than one list_base_hook, then each list_base_hook needs its unique tag.

        @@ -58,53 +58,53 @@

        store_hash<> will tell the hook to store the hash of the value to speed up rehashings.

        optimize_multikey<> will tell the hook to store a link to form a group with other value with the same value to speed up searches and insertions in unordered_multisets with a great number of with equivalent keys.

        -

        +

        unordered_set_base_hook public construct/copy/destruct

        1. -
          unordered_set_base_hook();
          +
          unordered_set_base_hook();

          Effects: If link_mode is auto_unlink or safe_link initializes the node to an unlinked state.

          Throws: Nothing.

        2. -
          unordered_set_base_hook(const unordered_set_base_hook &);
          +
          unordered_set_base_hook(const unordered_set_base_hook &);

          Effects: If link_mode is auto_unlink or safe_link initializes the node to an unlinked state. The argument is ignored.

          Throws: Nothing.

          Rationale: Providing a copy-constructor makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

        3. -
          unordered_set_base_hook & operator=(const unordered_set_base_hook &);
          +
          unordered_set_base_hook & operator=(const unordered_set_base_hook &);

          Effects: Empty function. The argument is ignored.

          Throws: Nothing.

          Rationale: Providing an assignment operator makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

        4. -
          ~unordered_set_base_hook();
          +
          ~unordered_set_base_hook();

          Effects: If link_mode is normal_link, the destructor does nothing (ie. no code is generated). If link_mode is safe_link and the object is stored in an unordered_set an assertion is raised. If link_mode is auto_unlink and is_linked() is true, the node is unlinked.

          Throws: Nothing.

        -

        -unordered_set_base_hook public member functions

        +

        +unordered_set_base_hook public member functions

        1. -
          void swap_nodes(unordered_set_base_hook & other);
          +
          void swap_nodes(unordered_set_base_hook & other);

          Effects: Swapping two nodes swaps the position of the elements related to those nodes in one or two containers. That is, if the node this is part of the element e1, the node x is part of the element e2 and both elements are included in the containers s1 and s2, then after the swap-operation e1 is in s2 at the position of e2 and e2 is in s1 at the position of e1. If one element is not in a container, then after the swap-operation the other element is not in a container. Iterators to e1 and e2 related to those nodes are invalidated.

          Complexity: Constant

          Throws: Nothing.

        2. -
          bool is_linked() const;
          +
          bool is_linked() const;

          Precondition: link_mode must be safe_link or auto_unlink.

          Returns: true, if the node belongs to a container, false otherwise. This function can be used to test whether unordered_set::iterator_to will return a valid iterator.

          Complexity: Constant

        3. -
          void unlink();
          +
          void unlink();

          Effects: Removes the node if it's inserted in a container. This function is only allowed if link_mode is auto_unlink.

          Throws: Nothing.

          4. @@ -122,7 +122,7 @@
          -PrevUpHomeNext +PrevUpHomeNext
          diff --git a/doc/html/boost/intrusive/unordered_set_member_hook.html b/doc/html/boost/intrusive/unordered_set_member_hook.html index 9a36515deb..06b5b9a464 100644 --- a/doc/html/boost/intrusive/unordered_set_member_hook.html +++ b/doc/html/boost/intrusive/unordered_set_member_hook.html @@ -38,71 +38,71 @@ { public: // construct/copy/destruct - unordered_set_member_hook(); - unordered_set_member_hook(const unordered_set_member_hook &); - unordered_set_member_hook & operator=(const unordered_set_member_hook &); - ~unordered_set_member_hook(); + unordered_set_member_hook(); + unordered_set_member_hook(const unordered_set_member_hook &); + unordered_set_member_hook & operator=(const unordered_set_member_hook &); + ~unordered_set_member_hook(); - // public member functions - void swap_nodes(unordered_set_member_hook &); - bool is_linked() const; - void unlink(); + // public member functions + void swap_nodes(unordered_set_member_hook &); + bool is_linked() const; + void unlink(); };
        -

        Description

        +

        Description

        Put a public data member unordered_set_member_hook in order to store objects of this class in an unordered_set/unordered_multi_set. unordered_set_member_hook holds the data necessary for maintaining the unordered_set/unordered_multi_set and provides an appropriate value_traits class for unordered_set/unordered_multi_set.

        The hook admits the following options: void_pointer<>, link_mode<> and store_hash<>.

        void_pointer<> is the pointer type that will be used internally in the hook and the container configured to use this hook.

        link_mode<> will specify the linking mode of the hook (normal_link, auto_unlink or safe_link).

        store_hash<> will tell the hook to store the hash of the value to speed up rehashings.

        -

        +

        unordered_set_member_hook public construct/copy/destruct

        1. -
          unordered_set_member_hook();
          +
          unordered_set_member_hook();

          Effects: If link_mode is auto_unlink or safe_link initializes the node to an unlinked state.

          Throws: Nothing.

        2. -
          unordered_set_member_hook(const unordered_set_member_hook &);
          +
          unordered_set_member_hook(const unordered_set_member_hook &);

          Effects: If link_mode is auto_unlink or safe_link initializes the node to an unlinked state. The argument is ignored.

          Throws: Nothing.

          Rationale: Providing a copy-constructor makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

        3. -
          unordered_set_member_hook & operator=(const unordered_set_member_hook &);
          +
          unordered_set_member_hook & operator=(const unordered_set_member_hook &);

          Effects: Empty function. The argument is ignored.

          Throws: Nothing.

          Rationale: Providing an assignment operator makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

        4. -
          ~unordered_set_member_hook();
          +
          ~unordered_set_member_hook();

          Effects: If link_mode is normal_link, the destructor does nothing (ie. no code is generated). If link_mode is safe_link and the object is stored in an unordered_set an assertion is raised. If link_mode is auto_unlink and is_linked() is true, the node is unlinked.

          Throws: Nothing.

        -

        -unordered_set_member_hook public member functions

        +

        +unordered_set_member_hook public member functions

        1. -
          void swap_nodes(unordered_set_member_hook & other);
          +
          void swap_nodes(unordered_set_member_hook & other);

          Effects: Swapping two nodes swaps the position of the elements related to those nodes in one or two containers. That is, if the node this is part of the element e1, the node x is part of the element e2 and both elements are included in the containers s1 and s2, then after the swap-operation e1 is in s2 at the position of e2 and e2 is in s1 at the position of e1. If one element is not in a container, then after the swap-operation the other element is not in a container. Iterators to e1 and e2 related to those nodes are invalidated.

          Complexity: Constant

          Throws: Nothing.

        2. -
          bool is_linked() const;
          +
          bool is_linked() const;

          Precondition: link_mode must be safe_link or auto_unlink.

          Returns: true, if the node belongs to a container, false otherwise. This function can be used to test whether unordered_set::iterator_to will return a valid iterator.

          Complexity: Constant

        3. -
          void unlink();
          +
          void unlink();

          Effects: Removes the node if it's inserted in a container. This function is only allowed if link_mode is auto_unlink.

          Throws: Nothing.

          4. diff --git a/doc/html/boost/intrusive/value_traits.html b/doc/html/boost/intrusive/value_traits.html index dd41a23d6f..e3b9afa85d 100644 --- a/doc/html/boost/intrusive/value_traits.html +++ b/doc/html/boost/intrusive/value_traits.html @@ -36,7 +36,7 @@ struct value_traits { };
        -

        Description

        +

        Description

        This option setter specifies the relationship between the type to be managed by the container (the value type) and the node to be used in the node algorithms. It also specifies the linking policy.

        diff --git a/doc/html/boost/intrusive/void_pointer.html b/doc/html/boost/intrusive/void_pointer.html index acc9471381..5d8f389270 100644 --- a/doc/html/boost/intrusive/void_pointer.html +++ b/doc/html/boost/intrusive/void_pointer.html @@ -36,7 +36,7 @@ struct void_pointer { };
        -

        Description

        +

        Description

        This option setter specifies the type of a void pointer. This will instruct the hook to use this type of pointer instead of the default one

        diff --git a/doc/html/boost/is_recursive_wrapper.html b/doc/html/boost/is_recursive_wrapper.html index 035282991c..541193765b 100644 --- a/doc/html/boost/is_recursive_wrapper.html +++ b/doc/html/boost/is_recursive_wrapper.html @@ -43,7 +43,7 @@ static const bool value = unspecified; };
        -

        Description

        +

        Description

        Value is true iff T is a specialization of recursive_wrapper.

        Note: diff --git a/doc/html/boost/lambda/plain_re_idm45506851725664.html b/doc/html/boost/lambda/plain_re_idm45506851725664.html new file mode 100644 index 0000000000..526d32da31 --- /dev/null +++ b/doc/html/boost/lambda/plain_re_idm45506851725664.html @@ -0,0 +1,59 @@ + + + + +Struct template plain_return_type_2<arithmetic_action< plus_action >, Y, boost::units::absolute< Y >> + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +

        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Struct template plain_return_type_2<arithmetic_action< plus_action >, Y, boost::units::absolute< Y >>

        +

        boost::lambda::plain_return_type_2<arithmetic_action< plus_action >, Y, boost::units::absolute< Y >>

        +
        +

        Synopsis

        +
        // In header: <boost/units/lambda.hpp>
+
+template<typename Y> 
+struct plain_return_type_2<arithmetic_action< plus_action >, Y, boost::units::absolute< Y >> {
+  // types
+  typedef boost::units::absolute< Y > type;
+};
        +
        +

        Description

        +

        Partial specialization of return type trait for action Y + absolute<Y>.

        +
        +
        + + + +
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven + Watanabe

        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/lambda/plain_re_idm45506851731488.html b/doc/html/boost/lambda/plain_re_idm45506851731488.html new file mode 100644 index 0000000000..a4d39fb5bd --- /dev/null +++ b/doc/html/boost/lambda/plain_re_idm45506851731488.html @@ -0,0 +1,59 @@ + + + + +Struct template plain_return_type_2<arithmetic_action< plus_action >, X, boost::units::quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(System), Y >> + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Struct template plain_return_type_2<arithmetic_action< plus_action >, X, boost::units::quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(System), Y >>

        +

        boost::lambda::plain_return_type_2<arithmetic_action< plus_action >, X, boost::units::quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(System), Y >>

        +
        +

        Synopsis

        +
        // In header: <boost/units/lambda.hpp>
+
+template<typename System, typename X, typename Y> 
+struct plain_return_type_2<arithmetic_action< plus_action >, X, boost::units::quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(System), Y >> {
+  // types
+  typedef boost::units::add_typeof_helper< X, boost::units::quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(System), Y > >::type type;
+};
        +
        +

        Description

        +

        Partial specialization of return type trait for action X + quantity<dimensionless, Y>.

        +
        +
        + + + +
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven + Watanabe

        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/lambda/plain_re_idm45506851738592.html b/doc/html/boost/lambda/plain_re_idm45506851738592.html new file mode 100644 index 0000000000..7d4ed44c6f --- /dev/null +++ b/doc/html/boost/lambda/plain_re_idm45506851738592.html @@ -0,0 +1,59 @@ + + + + +Struct template plain_return_type_2<arithmetic_action< plus_action >, boost::units::unit< Dim1, System1 >, boost::units::unit< Dim2, System2 >> + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Struct template plain_return_type_2<arithmetic_action< plus_action >, boost::units::unit< Dim1, System1 >, boost::units::unit< Dim2, System2 >>

        +

        boost::lambda::plain_return_type_2<arithmetic_action< plus_action >, boost::units::unit< Dim1, System1 >, boost::units::unit< Dim2, System2 >>

        +
        +

        Synopsis

        +
        // In header: <boost/units/lambda.hpp>
+
+template<typename Dim1, typename Dim2, typename System1, typename System2> 
+struct plain_return_type_2<arithmetic_action< plus_action >, boost::units::unit< Dim1, System1 >, boost::units::unit< Dim2, System2 >> {
+  // types
+  typedef boost::units::add_typeof_helper< boost::units::unit< Dim1, System1 >, boost::units::unit< Dim2, System2 > >::type type;
+};
        +
        +

        Description

        +

        Partial specialization of return type trait for action unit<Dim1, System1> + unit<Dim2, System2>.

        +
        +
        + + + +
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven + Watanabe

        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/lambda/plain_re_idm45506851745680.html b/doc/html/boost/lambda/plain_re_idm45506851745680.html new file mode 100644 index 0000000000..c610d1c813 --- /dev/null +++ b/doc/html/boost/lambda/plain_re_idm45506851745680.html @@ -0,0 +1,59 @@ + + + + +Struct template plain_return_type_2<arithmetic_action< plus_action >, boost::units::quantity< Unit1, X >, boost::units::quantity< Unit2, Y >> + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Struct template plain_return_type_2<arithmetic_action< plus_action >, boost::units::quantity< Unit1, X >, boost::units::quantity< Unit2, Y >>

        +

        boost::lambda::plain_return_type_2<arithmetic_action< plus_action >, boost::units::quantity< Unit1, X >, boost::units::quantity< Unit2, Y >>

        +
        +

        Synopsis

        +
        // In header: <boost/units/lambda.hpp>
+
+template<typename Unit1, typename X, typename Unit2, typename Y> 
+struct plain_return_type_2<arithmetic_action< plus_action >, boost::units::quantity< Unit1, X >, boost::units::quantity< Unit2, Y >> {
+  // types
+  typedef boost::units::add_typeof_helper< boost::units::quantity< Unit1, X >, boost::units::quantity< Unit2, Y > >::type type;
+};
        +
        +

        Description

        +

        Partial specialization of return type trait for action quantity<Unit1, X> + quantity<Unit2, Y>.

        +
        +
        + + + +
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven + Watanabe

        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/lambda/plain_re_idm45506851751520.html b/doc/html/boost/lambda/plain_re_idm45506851751520.html new file mode 100644 index 0000000000..6d7d4cb543 --- /dev/null +++ b/doc/html/boost/lambda/plain_re_idm45506851751520.html @@ -0,0 +1,59 @@ + + + + +Struct template plain_return_type_2<arithmetic_action< plus_action >, boost::units::quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(System), X >, Y> + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Struct template plain_return_type_2<arithmetic_action< plus_action >, boost::units::quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(System), X >, Y>

        +

        boost::lambda::plain_return_type_2<arithmetic_action< plus_action >, boost::units::quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(System), X >, Y>

        +
        +

        Synopsis

        +
        // In header: <boost/units/lambda.hpp>
+
+template<typename System, typename X, typename Y> 
+struct plain_return_type_2<arithmetic_action< plus_action >, boost::units::quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(System), X >, Y> {
+  // types
+  typedef boost::units::add_typeof_helper< boost::units::quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(System), X >, Y >::type type;
+};
        +
        +

        Description

        +

        Partial specialization of return type trait for action quantity<dimensionless, X> + Y.

        +
        +
        + + + +
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven + Watanabe

        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/lambda/plain_re_idm45506851755408.html b/doc/html/boost/lambda/plain_re_idm45506851755408.html new file mode 100644 index 0000000000..f454e9b38b --- /dev/null +++ b/doc/html/boost/lambda/plain_re_idm45506851755408.html @@ -0,0 +1,59 @@ + + + + +Struct template plain_return_type_2<arithmetic_action< plus_action >, boost::units::absolute< Y >, Y> + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Struct template plain_return_type_2<arithmetic_action< plus_action >, boost::units::absolute< Y >, Y>

        +

        boost::lambda::plain_return_type_2<arithmetic_action< plus_action >, boost::units::absolute< Y >, Y>

        +
        +

        Synopsis

        +
        // In header: <boost/units/lambda.hpp>
+
+template<typename Y> 
+struct plain_return_type_2<arithmetic_action< plus_action >, boost::units::absolute< Y >, Y> {
+  // types
+  typedef boost::units::absolute< Y > type;
+};
        +
        +

        Description

        +

        Partial specialization of return type trait for action absolute<Y> + Y.

        +
        +
        + + + +
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven + Watanabe

        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/lambda/plain_re_idm45506851761152.html b/doc/html/boost/lambda/plain_re_idm45506851761152.html new file mode 100644 index 0000000000..c2bb788e72 --- /dev/null +++ b/doc/html/boost/lambda/plain_re_idm45506851761152.html @@ -0,0 +1,59 @@ + + + + +Struct template plain_return_type_2<arithmetic_action< multiply_action >, Y, boost::units::unit< Dim, System >> + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Struct template plain_return_type_2<arithmetic_action< multiply_action >, Y, boost::units::unit< Dim, System >>

        +

        boost::lambda::plain_return_type_2<arithmetic_action< multiply_action >, Y, boost::units::unit< Dim, System >>

        +
        +

        Synopsis

        +
        // In header: <boost/units/lambda.hpp>
+
+template<typename System, typename Dim, typename Y> 
+struct plain_return_type_2<arithmetic_action< multiply_action >, Y, boost::units::unit< Dim, System >> {
+  // types
+  typedef boost::units::multiply_typeof_helper< Y, boost::units::unit< Dim, System > >::type type;
+};
        +
        +

        Description

        +

        Partial specialization of return type trait for action Y * unit<Dim, System>.

        +
        +
        + + + +
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven + Watanabe

        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/lambda/plain_re_idm45506851766352.html b/doc/html/boost/lambda/plain_re_idm45506851766352.html new file mode 100644 index 0000000000..723ff866db --- /dev/null +++ b/doc/html/boost/lambda/plain_re_idm45506851766352.html @@ -0,0 +1,59 @@ + + + + +Struct template plain_return_type_2<arithmetic_action< multiply_action >, X, boost::units::quantity< Unit, X >> + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Struct template plain_return_type_2<arithmetic_action< multiply_action >, X, boost::units::quantity< Unit, X >>

        +

        boost::lambda::plain_return_type_2<arithmetic_action< multiply_action >, X, boost::units::quantity< Unit, X >>

        +
        +

        Synopsis

        +
        // In header: <boost/units/lambda.hpp>
+
+template<typename Unit, typename X> 
+struct plain_return_type_2<arithmetic_action< multiply_action >, X, boost::units::quantity< Unit, X >> {
+  // types
+  typedef boost::units::multiply_typeof_helper< X, boost::units::quantity< Unit, X > >::type type;
+};
        +
        +

        Description

        +

        Partial specialization of return type trait for action X * quantity<Unit, X>.

        +
        +
        + + + +
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven + Watanabe

        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/lambda/plain_re_idm45506851772560.html b/doc/html/boost/lambda/plain_re_idm45506851772560.html new file mode 100644 index 0000000000..a006f4a365 --- /dev/null +++ b/doc/html/boost/lambda/plain_re_idm45506851772560.html @@ -0,0 +1,59 @@ + + + + +Struct template plain_return_type_2<arithmetic_action< multiply_action >, T, boost::units::absolute< boost::units::unit< D, S > >> + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Struct template plain_return_type_2<arithmetic_action< multiply_action >, T, boost::units::absolute< boost::units::unit< D, S > >>

        +

        boost::lambda::plain_return_type_2<arithmetic_action< multiply_action >, T, boost::units::absolute< boost::units::unit< D, S > >>

        +
        +

        Synopsis

        +
        // In header: <boost/units/lambda.hpp>
+
+template<typename D, typename S, typename T> 
+struct plain_return_type_2<arithmetic_action< multiply_action >, T, boost::units::absolute< boost::units::unit< D, S > >> {
+  // types
+  typedef boost::units::quantity< boost::units::absolute< boost::units::unit< D, S > >, T > type;
+};
        +
        +

        Description

        +

        Partial specialization of return type trait for action T * absolute<unit<D, S> >.

        +
        +
        + + + +
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven + Watanabe

        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/lambda/plain_re_idm45506851779664.html b/doc/html/boost/lambda/plain_re_idm45506851779664.html new file mode 100644 index 0000000000..2005983657 --- /dev/null +++ b/doc/html/boost/lambda/plain_re_idm45506851779664.html @@ -0,0 +1,59 @@ + + + + +Struct template plain_return_type_2<arithmetic_action< multiply_action >, boost::units::unit< Dim1, System1 >, boost::units::unit< Dim2, System2 >> + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Struct template plain_return_type_2<arithmetic_action< multiply_action >, boost::units::unit< Dim1, System1 >, boost::units::unit< Dim2, System2 >>

        +

        boost::lambda::plain_return_type_2<arithmetic_action< multiply_action >, boost::units::unit< Dim1, System1 >, boost::units::unit< Dim2, System2 >>

        +
        +

        Synopsis

        +
        // In header: <boost/units/lambda.hpp>
+
+template<typename Dim1, typename Dim2, typename System1, typename System2> 
+struct plain_return_type_2<arithmetic_action< multiply_action >, boost::units::unit< Dim1, System1 >, boost::units::unit< Dim2, System2 >> {
+  // types
+  typedef boost::units::multiply_typeof_helper< boost::units::unit< Dim1, System1 >, boost::units::unit< Dim2, System2 > >::type type;
+};
        +
        +

        Description

        +

        Partial specialization of return type trait for action unit<Dim1, System1> * unit<Dim2, System2>.

        +
        +
        + + + +
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven + Watanabe

        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/lambda/plain_re_idm45506851786752.html b/doc/html/boost/lambda/plain_re_idm45506851786752.html new file mode 100644 index 0000000000..5162c38d14 --- /dev/null +++ b/doc/html/boost/lambda/plain_re_idm45506851786752.html @@ -0,0 +1,59 @@ + + + + +Struct template plain_return_type_2<arithmetic_action< multiply_action >, boost::units::unit< Dim1, System1 >, boost::units::quantity< Unit2, Y >> + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Struct template plain_return_type_2<arithmetic_action< multiply_action >, boost::units::unit< Dim1, System1 >, boost::units::quantity< Unit2, Y >>

        +

        boost::lambda::plain_return_type_2<arithmetic_action< multiply_action >, boost::units::unit< Dim1, System1 >, boost::units::quantity< Unit2, Y >>

        +
        +

        Synopsis

        +
        // In header: <boost/units/lambda.hpp>
+
+template<typename System1, typename Dim1, typename Unit2, typename Y> 
+struct plain_return_type_2<arithmetic_action< multiply_action >, boost::units::unit< Dim1, System1 >, boost::units::quantity< Unit2, Y >> {
+  // types
+  typedef boost::units::multiply_typeof_helper< boost::units::unit< Dim1, System1 >, boost::units::quantity< Unit2, Y > >::type type;
+};
        +
        +

        Description

        +

        Partial specialization of return type trait for action unit<Dim1, System1> * quantity<Unit2, Y>.

        +
        +
        + + + +
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven + Watanabe

        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/lambda/plain_re_idm45506851792512.html b/doc/html/boost/lambda/plain_re_idm45506851792512.html new file mode 100644 index 0000000000..6efde43502 --- /dev/null +++ b/doc/html/boost/lambda/plain_re_idm45506851792512.html @@ -0,0 +1,59 @@ + + + + +Struct template plain_return_type_2<arithmetic_action< multiply_action >, boost::units::unit< Dim, System >, Y> + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Struct template plain_return_type_2<arithmetic_action< multiply_action >, boost::units::unit< Dim, System >, Y>

        +

        boost::lambda::plain_return_type_2<arithmetic_action< multiply_action >, boost::units::unit< Dim, System >, Y>

        +
        +

        Synopsis

        +
        // In header: <boost/units/lambda.hpp>
+
+template<typename System, typename Dim, typename Y> 
+struct plain_return_type_2<arithmetic_action< multiply_action >, boost::units::unit< Dim, System >, Y> {
+  // types
+  typedef boost::units::multiply_typeof_helper< boost::units::unit< Dim, System >, Y >::type type;
+};
        +
        +

        Description

        +

        Partial specialization of return type trait for action unit<Dim, System> * Y.

        +
        +
        + + + +
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven + Watanabe

        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/lambda/plain_re_idm45506851799616.html b/doc/html/boost/lambda/plain_re_idm45506851799616.html new file mode 100644 index 0000000000..9214751410 --- /dev/null +++ b/doc/html/boost/lambda/plain_re_idm45506851799616.html @@ -0,0 +1,59 @@ + + + + +Struct template plain_return_type_2<arithmetic_action< multiply_action >, boost::units::quantity< Unit1, Y >, boost::units::unit< Dim2, System2 >> + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Struct template plain_return_type_2<arithmetic_action< multiply_action >, boost::units::quantity< Unit1, Y >, boost::units::unit< Dim2, System2 >>

        +

        boost::lambda::plain_return_type_2<arithmetic_action< multiply_action >, boost::units::quantity< Unit1, Y >, boost::units::unit< Dim2, System2 >>

        +
        +

        Synopsis

        +
        // In header: <boost/units/lambda.hpp>
+
+template<typename Unit1, typename Y, typename System2, typename Dim2> 
+struct plain_return_type_2<arithmetic_action< multiply_action >, boost::units::quantity< Unit1, Y >, boost::units::unit< Dim2, System2 >> {
+  // types
+  typedef boost::units::multiply_typeof_helper< boost::units::quantity< Unit1, Y >, boost::units::unit< Dim2, System2 > >::type type;
+};
        +
        +

        Description

        +

        Partial specialization of return type trait for action quantity<Unit1, Y> * unit<Dim2, System2>.

        +
        +
        + + + +
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven + Watanabe

        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/lambda/plain_re_idm45506851806704.html b/doc/html/boost/lambda/plain_re_idm45506851806704.html new file mode 100644 index 0000000000..c8976aa67c --- /dev/null +++ b/doc/html/boost/lambda/plain_re_idm45506851806704.html @@ -0,0 +1,59 @@ + + + + +Struct template plain_return_type_2<arithmetic_action< multiply_action >, boost::units::quantity< Unit1, X >, boost::units::quantity< Unit2, Y >> + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Struct template plain_return_type_2<arithmetic_action< multiply_action >, boost::units::quantity< Unit1, X >, boost::units::quantity< Unit2, Y >>

        +

        boost::lambda::plain_return_type_2<arithmetic_action< multiply_action >, boost::units::quantity< Unit1, X >, boost::units::quantity< Unit2, Y >>

        +
        +

        Synopsis

        +
        // In header: <boost/units/lambda.hpp>
+
+template<typename Unit1, typename X, typename Unit2, typename Y> 
+struct plain_return_type_2<arithmetic_action< multiply_action >, boost::units::quantity< Unit1, X >, boost::units::quantity< Unit2, Y >> {
+  // types
+  typedef boost::units::multiply_typeof_helper< boost::units::quantity< Unit1, X >, boost::units::quantity< Unit2, Y > >::type type;
+};
        +
        +

        Description

        +

        Partial specialization of return type trait for action quantity<Unit1, X> * quantity<Unit2, Y>.

        +
        +
        + + + +
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven + Watanabe

        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/lambda/plain_re_idm45506851811904.html b/doc/html/boost/lambda/plain_re_idm45506851811904.html new file mode 100644 index 0000000000..a04d1fb8ed --- /dev/null +++ b/doc/html/boost/lambda/plain_re_idm45506851811904.html @@ -0,0 +1,59 @@ + + + + +Struct template plain_return_type_2<arithmetic_action< multiply_action >, boost::units::quantity< Unit, X >, X> + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Struct template plain_return_type_2<arithmetic_action< multiply_action >, boost::units::quantity< Unit, X >, X>

        +

        boost::lambda::plain_return_type_2<arithmetic_action< multiply_action >, boost::units::quantity< Unit, X >, X>

        +
        +

        Synopsis

        +
        // In header: <boost/units/lambda.hpp>
+
+template<typename Unit, typename X> 
+struct plain_return_type_2<arithmetic_action< multiply_action >, boost::units::quantity< Unit, X >, X> {
+  // types
+  typedef boost::units::multiply_typeof_helper< boost::units::quantity< Unit, X >, X >::type type;
+};
        +
        +

        Description

        +

        Partial specialization of return type trait for action quantity<Unit, X> * X.

        +
        +
        + + + +
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven + Watanabe

        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/lambda/plain_re_idm45506851818112.html b/doc/html/boost/lambda/plain_re_idm45506851818112.html new file mode 100644 index 0000000000..5b0404964f --- /dev/null +++ b/doc/html/boost/lambda/plain_re_idm45506851818112.html @@ -0,0 +1,59 @@ + + + + +Struct template plain_return_type_2<arithmetic_action< multiply_action >, boost::units::absolute< boost::units::unit< D, S > >, T> + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Struct template plain_return_type_2<arithmetic_action< multiply_action >, boost::units::absolute< boost::units::unit< D, S > >, T>

        +

        boost::lambda::plain_return_type_2<arithmetic_action< multiply_action >, boost::units::absolute< boost::units::unit< D, S > >, T>

        +
        +

        Synopsis

        +
        // In header: <boost/units/lambda.hpp>
+
+template<typename D, typename S, typename T> 
+struct plain_return_type_2<arithmetic_action< multiply_action >, boost::units::absolute< boost::units::unit< D, S > >, T> {
+  // types
+  typedef boost::units::quantity< boost::units::absolute< boost::units::unit< D, S > >, T > type;
+};
        +
        +

        Description

        +

        Partial specialization of return type trait for action absolute<unit<D, S> > * T.

        +
        +
        + + + +
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven + Watanabe

        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/lambda/plain_re_idm45506851823936.html b/doc/html/boost/lambda/plain_re_idm45506851823936.html new file mode 100644 index 0000000000..db46804d35 --- /dev/null +++ b/doc/html/boost/lambda/plain_re_idm45506851823936.html @@ -0,0 +1,59 @@ + + + + +Struct template plain_return_type_2<arithmetic_action< minus_action >, X, boost::units::quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(System), Y >> + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Struct template plain_return_type_2<arithmetic_action< minus_action >, X, boost::units::quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(System), Y >>

        +

        boost::lambda::plain_return_type_2<arithmetic_action< minus_action >, X, boost::units::quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(System), Y >>

        +
        +

        Synopsis

        +
        // In header: <boost/units/lambda.hpp>
+
+template<typename System, typename X, typename Y> 
+struct plain_return_type_2<arithmetic_action< minus_action >, X, boost::units::quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(System), Y >> {
+  // types
+  typedef boost::units::subtract_typeof_helper< X, boost::units::quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(System), Y > >::type type;
+};
        +
        +

        Description

        +

        Partial specialization of return type trait for action X - quantity<dimensionless, Y>.

        +
        +
        + + + +
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven + Watanabe

        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/lambda/plain_re_idm45506851831040.html b/doc/html/boost/lambda/plain_re_idm45506851831040.html new file mode 100644 index 0000000000..21e42b5126 --- /dev/null +++ b/doc/html/boost/lambda/plain_re_idm45506851831040.html @@ -0,0 +1,59 @@ + + + + +Struct template plain_return_type_2<arithmetic_action< minus_action >, boost::units::unit< Dim1, System1 >, boost::units::unit< Dim2, System2 >> + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Struct template plain_return_type_2<arithmetic_action< minus_action >, boost::units::unit< Dim1, System1 >, boost::units::unit< Dim2, System2 >>

        +

        boost::lambda::plain_return_type_2<arithmetic_action< minus_action >, boost::units::unit< Dim1, System1 >, boost::units::unit< Dim2, System2 >>

        +
        +

        Synopsis

        +
        // In header: <boost/units/lambda.hpp>
+
+template<typename Dim1, typename Dim2, typename System1, typename System2> 
+struct plain_return_type_2<arithmetic_action< minus_action >, boost::units::unit< Dim1, System1 >, boost::units::unit< Dim2, System2 >> {
+  // types
+  typedef boost::units::subtract_typeof_helper< boost::units::unit< Dim1, System1 >, boost::units::unit< Dim2, System2 > >::type type;
+};
        +
        +

        Description

        +

        Partial specialization of return type trait for action unit<Dim1, System1> - unit<Dim2, System2>.

        +
        +
        + + + +
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven + Watanabe

        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/lambda/plain_re_idm45506851838128.html b/doc/html/boost/lambda/plain_re_idm45506851838128.html new file mode 100644 index 0000000000..7215c8fd61 --- /dev/null +++ b/doc/html/boost/lambda/plain_re_idm45506851838128.html @@ -0,0 +1,59 @@ + + + + +Struct template plain_return_type_2<arithmetic_action< minus_action >, boost::units::quantity< Unit1, X >, boost::units::quantity< Unit2, Y >> + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Struct template plain_return_type_2<arithmetic_action< minus_action >, boost::units::quantity< Unit1, X >, boost::units::quantity< Unit2, Y >>

        +

        boost::lambda::plain_return_type_2<arithmetic_action< minus_action >, boost::units::quantity< Unit1, X >, boost::units::quantity< Unit2, Y >>

        +
        +

        Synopsis

        +
        // In header: <boost/units/lambda.hpp>
+
+template<typename Unit1, typename X, typename Unit2, typename Y> 
+struct plain_return_type_2<arithmetic_action< minus_action >, boost::units::quantity< Unit1, X >, boost::units::quantity< Unit2, Y >> {
+  // types
+  typedef boost::units::subtract_typeof_helper< boost::units::quantity< Unit1, X >, boost::units::quantity< Unit2, Y > >::type type;
+};
        +
        +

        Description

        +

        Partial specialization of return type trait for action quantity<Unit1, X> - quantity<Unit2, Y>.

        +
        +
        + + + +
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven + Watanabe

        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/lambda/plain_re_idm45506851843968.html b/doc/html/boost/lambda/plain_re_idm45506851843968.html new file mode 100644 index 0000000000..16518b9380 --- /dev/null +++ b/doc/html/boost/lambda/plain_re_idm45506851843968.html @@ -0,0 +1,59 @@ + + + + +Struct template plain_return_type_2<arithmetic_action< minus_action >, boost::units::quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(System), X >, Y> + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Struct template plain_return_type_2<arithmetic_action< minus_action >, boost::units::quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(System), X >, Y>

        +

        boost::lambda::plain_return_type_2<arithmetic_action< minus_action >, boost::units::quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(System), X >, Y>

        +
        +

        Synopsis

        +
        // In header: <boost/units/lambda.hpp>
+
+template<typename System, typename X, typename Y> 
+struct plain_return_type_2<arithmetic_action< minus_action >, boost::units::quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(System), X >, Y> {
+  // types
+  typedef boost::units::subtract_typeof_helper< boost::units::quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(System), X >, Y >::type type;
+};
        +
        +

        Description

        +

        Partial specialization of return type trait for action quantity<dimensionless, X> - Y.

        +
        +
        + + + +
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven + Watanabe

        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/lambda/plain_re_idm45506851847856.html b/doc/html/boost/lambda/plain_re_idm45506851847856.html new file mode 100644 index 0000000000..91a6f32017 --- /dev/null +++ b/doc/html/boost/lambda/plain_re_idm45506851847856.html @@ -0,0 +1,59 @@ + + + + +Struct template plain_return_type_2<arithmetic_action< minus_action >, boost::units::absolute< Y >, Y> + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Struct template plain_return_type_2<arithmetic_action< minus_action >, boost::units::absolute< Y >, Y>

        +

        boost::lambda::plain_return_type_2<arithmetic_action< minus_action >, boost::units::absolute< Y >, Y>

        +
        +

        Synopsis

        +
        // In header: <boost/units/lambda.hpp>
+
+template<typename Y> 
+struct plain_return_type_2<arithmetic_action< minus_action >, boost::units::absolute< Y >, Y> {
+  // types
+  typedef boost::units::absolute< Y > type;
+};
        +
        +

        Description

        +

        Partial specialization of return type trait for action absolute<Y> - Y.

        +
        +
        + + + +
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven + Watanabe

        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/lambda/plain_re_idm45506851851472.html b/doc/html/boost/lambda/plain_re_idm45506851851472.html new file mode 100644 index 0000000000..cfc73f04b3 --- /dev/null +++ b/doc/html/boost/lambda/plain_re_idm45506851851472.html @@ -0,0 +1,59 @@ + + + + +Struct template plain_return_type_2<arithmetic_action< minus_action >, boost::units::absolute< Y >, boost::units::absolute< Y >> + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Struct template plain_return_type_2<arithmetic_action< minus_action >, boost::units::absolute< Y >, boost::units::absolute< Y >>

        +

        boost::lambda::plain_return_type_2<arithmetic_action< minus_action >, boost::units::absolute< Y >, boost::units::absolute< Y >>

        +
        +

        Synopsis

        +
        // In header: <boost/units/lambda.hpp>
+
+template<typename Y> 
+struct plain_return_type_2<arithmetic_action< minus_action >, boost::units::absolute< Y >, boost::units::absolute< Y >> {
+  // types
+  typedef Y type;
+};
        +
        +

        Description

        +

        Partial specialization of return type trait for action absolute<Y> - absolute<Y>.

        +
        +
        + + + +
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven + Watanabe

        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/lambda/plain_re_idm45506851857216.html b/doc/html/boost/lambda/plain_re_idm45506851857216.html new file mode 100644 index 0000000000..c153d1ec93 --- /dev/null +++ b/doc/html/boost/lambda/plain_re_idm45506851857216.html @@ -0,0 +1,59 @@ + + + + +Struct template plain_return_type_2<arithmetic_action< divide_action >, Y, boost::units::unit< Dim, System >> + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Struct template plain_return_type_2<arithmetic_action< divide_action >, Y, boost::units::unit< Dim, System >>

        +

        boost::lambda::plain_return_type_2<arithmetic_action< divide_action >, Y, boost::units::unit< Dim, System >>

        +
        +

        Synopsis

        +
        // In header: <boost/units/lambda.hpp>
+
+template<typename System, typename Dim, typename Y> 
+struct plain_return_type_2<arithmetic_action< divide_action >, Y, boost::units::unit< Dim, System >> {
+  // types
+  typedef boost::units::divide_typeof_helper< Y, boost::units::unit< Dim, System > >::type type;
+};
        +
        +

        Description

        +

        Partial specialization of return type trait for action Y / unit<Dim, System>.

        +
        +
        + + + +
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven + Watanabe

        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/lambda/plain_re_idm45506851862416.html b/doc/html/boost/lambda/plain_re_idm45506851862416.html new file mode 100644 index 0000000000..16dc6eaa31 --- /dev/null +++ b/doc/html/boost/lambda/plain_re_idm45506851862416.html @@ -0,0 +1,59 @@ + + + + +Struct template plain_return_type_2<arithmetic_action< divide_action >, X, boost::units::quantity< Unit, X >> + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Struct template plain_return_type_2<arithmetic_action< divide_action >, X, boost::units::quantity< Unit, X >>

        +

        boost::lambda::plain_return_type_2<arithmetic_action< divide_action >, X, boost::units::quantity< Unit, X >>

        +
        +

        Synopsis

        +
        // In header: <boost/units/lambda.hpp>
+
+template<typename Unit, typename X> 
+struct plain_return_type_2<arithmetic_action< divide_action >, X, boost::units::quantity< Unit, X >> {
+  // types
+  typedef boost::units::divide_typeof_helper< X, boost::units::quantity< Unit, X > >::type type;
+};
        +
        +

        Description

        +

        Partial specialization of return type trait for action X / quantity<Unit, X>.

        +
        +
        + + + +
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven + Watanabe

        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/lambda/plain_re_idm45506851869520.html b/doc/html/boost/lambda/plain_re_idm45506851869520.html new file mode 100644 index 0000000000..d163ad44db --- /dev/null +++ b/doc/html/boost/lambda/plain_re_idm45506851869520.html @@ -0,0 +1,59 @@ + + + + +Struct template plain_return_type_2<arithmetic_action< divide_action >, boost::units::unit< Dim1, System1 >, boost::units::unit< Dim2, System2 >> + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Struct template plain_return_type_2<arithmetic_action< divide_action >, boost::units::unit< Dim1, System1 >, boost::units::unit< Dim2, System2 >>

        +

        boost::lambda::plain_return_type_2<arithmetic_action< divide_action >, boost::units::unit< Dim1, System1 >, boost::units::unit< Dim2, System2 >>

        +
        +

        Synopsis

        +
        // In header: <boost/units/lambda.hpp>
+
+template<typename Dim1, typename Dim2, typename System1, typename System2> 
+struct plain_return_type_2<arithmetic_action< divide_action >, boost::units::unit< Dim1, System1 >, boost::units::unit< Dim2, System2 >> {
+  // types
+  typedef boost::units::divide_typeof_helper< boost::units::unit< Dim1, System1 >, boost::units::unit< Dim2, System2 > >::type type;
+};
        +
        +

        Description

        +

        Partial specialization of return type trait for action unit<Dim1, System1> / unit<Dim2, System2>.

        +
        +
        + + + +
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven + Watanabe

        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/lambda/plain_re_idm45506851876608.html b/doc/html/boost/lambda/plain_re_idm45506851876608.html new file mode 100644 index 0000000000..96c6c3593c --- /dev/null +++ b/doc/html/boost/lambda/plain_re_idm45506851876608.html @@ -0,0 +1,59 @@ + + + + +Struct template plain_return_type_2<arithmetic_action< divide_action >, boost::units::unit< Dim1, System1 >, boost::units::quantity< Unit2, Y >> + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Struct template plain_return_type_2<arithmetic_action< divide_action >, boost::units::unit< Dim1, System1 >, boost::units::quantity< Unit2, Y >>

        +

        boost::lambda::plain_return_type_2<arithmetic_action< divide_action >, boost::units::unit< Dim1, System1 >, boost::units::quantity< Unit2, Y >>

        +
        +

        Synopsis

        +
        // In header: <boost/units/lambda.hpp>
+
+template<typename System1, typename Dim1, typename Unit2, typename Y> 
+struct plain_return_type_2<arithmetic_action< divide_action >, boost::units::unit< Dim1, System1 >, boost::units::quantity< Unit2, Y >> {
+  // types
+  typedef boost::units::divide_typeof_helper< boost::units::unit< Dim1, System1 >, boost::units::quantity< Unit2, Y > >::type type;
+};
        +
        +

        Description

        +

        Partial specialization of return type trait for action unit<Dim1, System1> / quantity<Unit2, Y>.

        +
        +
        + + + +
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven + Watanabe

        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/lambda/plain_re_idm45506851882368.html b/doc/html/boost/lambda/plain_re_idm45506851882368.html new file mode 100644 index 0000000000..5de9e1b9eb --- /dev/null +++ b/doc/html/boost/lambda/plain_re_idm45506851882368.html @@ -0,0 +1,59 @@ + + + + +Struct template plain_return_type_2<arithmetic_action< divide_action >, boost::units::unit< Dim, System >, Y> + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Struct template plain_return_type_2<arithmetic_action< divide_action >, boost::units::unit< Dim, System >, Y>

        +

        boost::lambda::plain_return_type_2<arithmetic_action< divide_action >, boost::units::unit< Dim, System >, Y>

        +
        +

        Synopsis

        +
        // In header: <boost/units/lambda.hpp>
+
+template<typename System, typename Dim, typename Y> 
+struct plain_return_type_2<arithmetic_action< divide_action >, boost::units::unit< Dim, System >, Y> {
+  // types
+  typedef boost::units::divide_typeof_helper< boost::units::unit< Dim, System >, Y >::type type;
+};
        +
        +

        Description

        +

        Partial specialization of return type trait for action unit<Dim, System> / Y.

        +
        +
        + + + +
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven + Watanabe

        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/lambda/plain_re_idm45506851889472.html b/doc/html/boost/lambda/plain_re_idm45506851889472.html new file mode 100644 index 0000000000..9a7b191272 --- /dev/null +++ b/doc/html/boost/lambda/plain_re_idm45506851889472.html @@ -0,0 +1,59 @@ + + + + +Struct template plain_return_type_2<arithmetic_action< divide_action >, boost::units::quantity< Unit1, Y >, boost::units::unit< Dim2, System2 >> + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Struct template plain_return_type_2<arithmetic_action< divide_action >, boost::units::quantity< Unit1, Y >, boost::units::unit< Dim2, System2 >>

        +

        boost::lambda::plain_return_type_2<arithmetic_action< divide_action >, boost::units::quantity< Unit1, Y >, boost::units::unit< Dim2, System2 >>

        +
        +

        Synopsis

        +
        // In header: <boost/units/lambda.hpp>
+
+template<typename Unit1, typename Y, typename System2, typename Dim2> 
+struct plain_return_type_2<arithmetic_action< divide_action >, boost::units::quantity< Unit1, Y >, boost::units::unit< Dim2, System2 >> {
+  // types
+  typedef boost::units::divide_typeof_helper< boost::units::quantity< Unit1, Y >, boost::units::unit< Dim2, System2 > >::type type;
+};
        +
        +

        Description

        +

        Partial specialization of return type trait for action quantity<Unit1, Y> / unit<Dim2, System2>.

        +
        +
        + + + +
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven + Watanabe

        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/lambda/plain_re_idm45506851896560.html b/doc/html/boost/lambda/plain_re_idm45506851896560.html new file mode 100644 index 0000000000..94ec5cf16f --- /dev/null +++ b/doc/html/boost/lambda/plain_re_idm45506851896560.html @@ -0,0 +1,59 @@ + + + + +Struct template plain_return_type_2<arithmetic_action< divide_action >, boost::units::quantity< Unit1, X >, boost::units::quantity< Unit2, Y >> + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Struct template plain_return_type_2<arithmetic_action< divide_action >, boost::units::quantity< Unit1, X >, boost::units::quantity< Unit2, Y >>

        +

        boost::lambda::plain_return_type_2<arithmetic_action< divide_action >, boost::units::quantity< Unit1, X >, boost::units::quantity< Unit2, Y >>

        +
        +

        Synopsis

        +
        // In header: <boost/units/lambda.hpp>
+
+template<typename Unit1, typename X, typename Unit2, typename Y> 
+struct plain_return_type_2<arithmetic_action< divide_action >, boost::units::quantity< Unit1, X >, boost::units::quantity< Unit2, Y >> {
+  // types
+  typedef boost::units::divide_typeof_helper< boost::units::quantity< Unit1, X >, boost::units::quantity< Unit2, Y > >::type type;
+};
        +
        +

        Description

        +

        Partial specialization of return type trait for action quantity<Unit1, X> / quantity<Unit2, Y>.

        +
        +
        + + + +
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven + Watanabe

        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/lambda/plain_re_idm45506851901760.html b/doc/html/boost/lambda/plain_re_idm45506851901760.html new file mode 100644 index 0000000000..cf1d312efc --- /dev/null +++ b/doc/html/boost/lambda/plain_re_idm45506851901760.html @@ -0,0 +1,59 @@ + + + + +Struct template plain_return_type_2<arithmetic_action< divide_action >, boost::units::quantity< Unit, X >, X> + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Struct template plain_return_type_2<arithmetic_action< divide_action >, boost::units::quantity< Unit, X >, X>

        +

        boost::lambda::plain_return_type_2<arithmetic_action< divide_action >, boost::units::quantity< Unit, X >, X>

        +
        +

        Synopsis

        +
        // In header: <boost/units/lambda.hpp>
+
+template<typename Unit, typename X> 
+struct plain_return_type_2<arithmetic_action< divide_action >, boost::units::quantity< Unit, X >, X> {
+  // types
+  typedef boost::units::divide_typeof_helper< boost::units::quantity< Unit, X >, X >::type type;
+};
        +
        +

        Description

        +

        Partial specialization of return type trait for action quantity<Unit, X> / X.

        +
        +
        + + + +
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven + Watanabe

        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/lambda/plain_re_idm45506851906656.html b/doc/html/boost/lambda/plain_re_idm45506851906656.html new file mode 100644 index 0000000000..dcfd423d26 --- /dev/null +++ b/doc/html/boost/lambda/plain_re_idm45506851906656.html @@ -0,0 +1,59 @@ + + + + +Struct template plain_return_type_1<unary_arithmetic_action< plus_action >, boost::units::unit< Dim, System >> + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Struct template plain_return_type_1<unary_arithmetic_action< plus_action >, boost::units::unit< Dim, System >>

        +

        boost::lambda::plain_return_type_1<unary_arithmetic_action< plus_action >, boost::units::unit< Dim, System >>

        +
        +

        Synopsis

        +
        // In header: <boost/units/lambda.hpp>
+
+template<typename Dim, typename System> 
+struct plain_return_type_1<unary_arithmetic_action< plus_action >, boost::units::unit< Dim, System >> {
+  // types
+  typedef boost::units::unary_plus_typeof_helper< boost::units::unit< Dim, System > >::type type;
+};
        +
        +

        Description

        +

        Partial specialization of return type trait for action +unit<Dim, System>.

        +
        +
        + + + +
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven + Watanabe

        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/lambda/plain_re_idm45506851911568.html b/doc/html/boost/lambda/plain_re_idm45506851911568.html new file mode 100644 index 0000000000..37abcf917b --- /dev/null +++ b/doc/html/boost/lambda/plain_re_idm45506851911568.html @@ -0,0 +1,59 @@ + + + + +Struct template plain_return_type_1<unary_arithmetic_action< plus_action >, boost::units::quantity< Unit, Y >> + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Struct template plain_return_type_1<unary_arithmetic_action< plus_action >, boost::units::quantity< Unit, Y >>

        +

        boost::lambda::plain_return_type_1<unary_arithmetic_action< plus_action >, boost::units::quantity< Unit, Y >>

        +
        +

        Synopsis

        +
        // In header: <boost/units/lambda.hpp>
+
+template<typename Unit, typename Y> 
+struct plain_return_type_1<unary_arithmetic_action< plus_action >, boost::units::quantity< Unit, Y >> {
+  // types
+  typedef boost::units::unary_plus_typeof_helper< boost::units::quantity< Unit, Y > >::type type;
+};
        +
        +

        Description

        +

        Partial specialization of return type trait for action +quantity<Unit, Y>.

        +
        +
        + + + +
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven + Watanabe

        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/lambda/plain_re_idm45506851916464.html b/doc/html/boost/lambda/plain_re_idm45506851916464.html new file mode 100644 index 0000000000..ae0995f84b --- /dev/null +++ b/doc/html/boost/lambda/plain_re_idm45506851916464.html @@ -0,0 +1,59 @@ + + + + +Struct template plain_return_type_1<unary_arithmetic_action< minus_action >, boost::units::unit< Dim, System >> + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Struct template plain_return_type_1<unary_arithmetic_action< minus_action >, boost::units::unit< Dim, System >>

        +

        boost::lambda::plain_return_type_1<unary_arithmetic_action< minus_action >, boost::units::unit< Dim, System >>

        +
        +

        Synopsis

        +
        // In header: <boost/units/lambda.hpp>
+
+template<typename Dim, typename System> 
+struct plain_return_type_1<unary_arithmetic_action< minus_action >, boost::units::unit< Dim, System >> {
+  // types
+  typedef boost::units::unary_minus_typeof_helper< boost::units::unit< Dim, System > >::type type;
+};
        +
        +

        Description

        +

        Partial specialization of return type trait for action -unit<Dim, System>.

        +
        +
        + + + +
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven + Watanabe

        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/lambda/plain_re_idm45506851921376.html b/doc/html/boost/lambda/plain_re_idm45506851921376.html new file mode 100644 index 0000000000..d5ef96998d --- /dev/null +++ b/doc/html/boost/lambda/plain_re_idm45506851921376.html @@ -0,0 +1,59 @@ + + + + +Struct template plain_return_type_1<unary_arithmetic_action< minus_action >, boost::units::quantity< Unit, Y >> + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Struct template plain_return_type_1<unary_arithmetic_action< minus_action >, boost::units::quantity< Unit, Y >>

        +

        boost::lambda::plain_return_type_1<unary_arithmetic_action< minus_action >, boost::units::quantity< Unit, Y >>

        +
        +

        Synopsis

        +
        // In header: <boost/units/lambda.hpp>
+
+template<typename Unit, typename Y> 
+struct plain_return_type_1<unary_arithmetic_action< minus_action >, boost::units::quantity< Unit, Y >> {
+  // types
+  typedef boost::units::unary_minus_typeof_helper< boost::units::quantity< Unit, Y > >::type type;
+};
        +
        +

        Description

        +

        Partial specialization of return type trait for action -quantity<Unit, Y>.

        +
        +
        + + + +
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven + Watanabe

        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/lambda/plain_return__idp347042880.html b/doc/html/boost/lambda/plain_return__idp347042880.html deleted file mode 100644 index 6cf235dcf1..0000000000 --- a/doc/html/boost/lambda/plain_return__idp347042880.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Struct template plain_return_type_1<unary_arithmetic_action< minus_action >, boost::units::quantity< Unit, Y >> - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Struct template plain_return_type_1<unary_arithmetic_action< minus_action >, boost::units::quantity< Unit, Y >>

        -

        boost::lambda::plain_return_type_1<unary_arithmetic_action< minus_action >, boost::units::quantity< Unit, Y >>

        -
        -

        Synopsis

        -
        // In header: <boost/units/lambda.hpp>
-
-template<typename Unit, typename Y> 
-struct plain_return_type_1<unary_arithmetic_action< minus_action >, boost::units::quantity< Unit, Y >> {
-  // types
-  typedef boost::units::unary_minus_typeof_helper< boost::units::quantity< Unit, Y > >::type type;
-};
        -
        -

        Description

        -

        Partial specialization of return type trait for action -quantity<Unit, Y>.

        -
        -
        - - - -
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven - Watanabe

        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/lambda/plain_return__idp347047792.html b/doc/html/boost/lambda/plain_return__idp347047792.html deleted file mode 100644 index d35fb5b133..0000000000 --- a/doc/html/boost/lambda/plain_return__idp347047792.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Struct template plain_return_type_1<unary_arithmetic_action< minus_action >, boost::units::unit< Dim, System >> - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Struct template plain_return_type_1<unary_arithmetic_action< minus_action >, boost::units::unit< Dim, System >>

        -

        boost::lambda::plain_return_type_1<unary_arithmetic_action< minus_action >, boost::units::unit< Dim, System >>

        -
        -

        Synopsis

        -
        // In header: <boost/units/lambda.hpp>
-
-template<typename Dim, typename System> 
-struct plain_return_type_1<unary_arithmetic_action< minus_action >, boost::units::unit< Dim, System >> {
-  // types
-  typedef boost::units::unary_minus_typeof_helper< boost::units::unit< Dim, System > >::type type;
-};
        -
        -

        Description

        -

        Partial specialization of return type trait for action -unit<Dim, System>.

        -
        -
        - - - -
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven - Watanabe

        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/lambda/plain_return__idp347052688.html b/doc/html/boost/lambda/plain_return__idp347052688.html deleted file mode 100644 index f9990bd21e..0000000000 --- a/doc/html/boost/lambda/plain_return__idp347052688.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Struct template plain_return_type_1<unary_arithmetic_action< plus_action >, boost::units::quantity< Unit, Y >> - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Struct template plain_return_type_1<unary_arithmetic_action< plus_action >, boost::units::quantity< Unit, Y >>

        -

        boost::lambda::plain_return_type_1<unary_arithmetic_action< plus_action >, boost::units::quantity< Unit, Y >>

        -
        -

        Synopsis

        -
        // In header: <boost/units/lambda.hpp>
-
-template<typename Unit, typename Y> 
-struct plain_return_type_1<unary_arithmetic_action< plus_action >, boost::units::quantity< Unit, Y >> {
-  // types
-  typedef boost::units::unary_plus_typeof_helper< boost::units::quantity< Unit, Y > >::type type;
-};
        -
        -

        Description

        -

        Partial specialization of return type trait for action +quantity<Unit, Y>.

        -
        -
        - - - -
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven - Watanabe

        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/lambda/plain_return__idp347057600.html b/doc/html/boost/lambda/plain_return__idp347057600.html deleted file mode 100644 index 2bbd0603df..0000000000 --- a/doc/html/boost/lambda/plain_return__idp347057600.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Struct template plain_return_type_1<unary_arithmetic_action< plus_action >, boost::units::unit< Dim, System >> - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Struct template plain_return_type_1<unary_arithmetic_action< plus_action >, boost::units::unit< Dim, System >>

        -

        boost::lambda::plain_return_type_1<unary_arithmetic_action< plus_action >, boost::units::unit< Dim, System >>

        -
        -

        Synopsis

        -
        // In header: <boost/units/lambda.hpp>
-
-template<typename Dim, typename System> 
-struct plain_return_type_1<unary_arithmetic_action< plus_action >, boost::units::unit< Dim, System >> {
-  // types
-  typedef boost::units::unary_plus_typeof_helper< boost::units::unit< Dim, System > >::type type;
-};
        -
        -

        Description

        -

        Partial specialization of return type trait for action +unit<Dim, System>.

        -
        -
        - - - -
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven - Watanabe

        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/lambda/plain_return__idp347062496.html b/doc/html/boost/lambda/plain_return__idp347062496.html deleted file mode 100644 index ef80896f7e..0000000000 --- a/doc/html/boost/lambda/plain_return__idp347062496.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Struct template plain_return_type_2<arithmetic_action< divide_action >, boost::units::quantity< Unit, X >, X> - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Struct template plain_return_type_2<arithmetic_action< divide_action >, boost::units::quantity< Unit, X >, X>

        -

        boost::lambda::plain_return_type_2<arithmetic_action< divide_action >, boost::units::quantity< Unit, X >, X>

        -
        -

        Synopsis

        -
        // In header: <boost/units/lambda.hpp>
-
-template<typename Unit, typename X> 
-struct plain_return_type_2<arithmetic_action< divide_action >, boost::units::quantity< Unit, X >, X> {
-  // types
-  typedef boost::units::divide_typeof_helper< boost::units::quantity< Unit, X >, X >::type type;
-};
        -
        -

        Description

        -

        Partial specialization of return type trait for action quantity<Unit, X> / X.

        -
        -
        - - - -
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven - Watanabe

        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/lambda/plain_return__idp347067696.html b/doc/html/boost/lambda/plain_return__idp347067696.html deleted file mode 100644 index b4205b2d1b..0000000000 --- a/doc/html/boost/lambda/plain_return__idp347067696.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Struct template plain_return_type_2<arithmetic_action< divide_action >, boost::units::quantity< Unit1, X >, boost::units::quantity< Unit2, Y >> - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Struct template plain_return_type_2<arithmetic_action< divide_action >, boost::units::quantity< Unit1, X >, boost::units::quantity< Unit2, Y >>

        -

        boost::lambda::plain_return_type_2<arithmetic_action< divide_action >, boost::units::quantity< Unit1, X >, boost::units::quantity< Unit2, Y >>

        -
        -

        Synopsis

        -
        // In header: <boost/units/lambda.hpp>
-
-template<typename Unit1, typename X, typename Unit2, typename Y> 
-struct plain_return_type_2<arithmetic_action< divide_action >, boost::units::quantity< Unit1, X >, boost::units::quantity< Unit2, Y >> {
-  // types
-  typedef boost::units::divide_typeof_helper< boost::units::quantity< Unit1, X >, boost::units::quantity< Unit2, Y > >::type type;
-};
        -
        -

        Description

        -

        Partial specialization of return type trait for action quantity<Unit1, X> / quantity<Unit2, Y>.

        -
        -
        - - - -
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven - Watanabe

        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/lambda/plain_return__idp347074784.html b/doc/html/boost/lambda/plain_return__idp347074784.html deleted file mode 100644 index 62e3d73dde..0000000000 --- a/doc/html/boost/lambda/plain_return__idp347074784.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Struct template plain_return_type_2<arithmetic_action< divide_action >, boost::units::quantity< Unit1, Y >, boost::units::unit< Dim2, System2 >> - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Struct template plain_return_type_2<arithmetic_action< divide_action >, boost::units::quantity< Unit1, Y >, boost::units::unit< Dim2, System2 >>

        -

        boost::lambda::plain_return_type_2<arithmetic_action< divide_action >, boost::units::quantity< Unit1, Y >, boost::units::unit< Dim2, System2 >>

        -
        -

        Synopsis

        -
        // In header: <boost/units/lambda.hpp>
-
-template<typename Unit1, typename Y, typename System2, typename Dim2> 
-struct plain_return_type_2<arithmetic_action< divide_action >, boost::units::quantity< Unit1, Y >, boost::units::unit< Dim2, System2 >> {
-  // types
-  typedef boost::units::divide_typeof_helper< boost::units::quantity< Unit1, Y >, boost::units::unit< Dim2, System2 > >::type type;
-};
        -
        -

        Description

        -

        Partial specialization of return type trait for action quantity<Unit1, Y> / unit<Dim2, System2>.

        -
        -
        - - - -
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven - Watanabe

        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/lambda/plain_return__idp347081888.html b/doc/html/boost/lambda/plain_return__idp347081888.html deleted file mode 100644 index 9a68f79f2e..0000000000 --- a/doc/html/boost/lambda/plain_return__idp347081888.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Struct template plain_return_type_2<arithmetic_action< divide_action >, boost::units::unit< Dim, System >, Y> - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Struct template plain_return_type_2<arithmetic_action< divide_action >, boost::units::unit< Dim, System >, Y>

        -

        boost::lambda::plain_return_type_2<arithmetic_action< divide_action >, boost::units::unit< Dim, System >, Y>

        -
        -

        Synopsis

        -
        // In header: <boost/units/lambda.hpp>
-
-template<typename System, typename Dim, typename Y> 
-struct plain_return_type_2<arithmetic_action< divide_action >, boost::units::unit< Dim, System >, Y> {
-  // types
-  typedef boost::units::divide_typeof_helper< boost::units::unit< Dim, System >, Y >::type type;
-};
        -
        -

        Description

        -

        Partial specialization of return type trait for action unit<Dim, System> / Y.

        -
        -
        - - - -
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven - Watanabe

        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/lambda/plain_return__idp347087648.html b/doc/html/boost/lambda/plain_return__idp347087648.html deleted file mode 100644 index 22782fdda1..0000000000 --- a/doc/html/boost/lambda/plain_return__idp347087648.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Struct template plain_return_type_2<arithmetic_action< divide_action >, boost::units::unit< Dim1, System1 >, boost::units::quantity< Unit2, Y >> - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Struct template plain_return_type_2<arithmetic_action< divide_action >, boost::units::unit< Dim1, System1 >, boost::units::quantity< Unit2, Y >>

        -

        boost::lambda::plain_return_type_2<arithmetic_action< divide_action >, boost::units::unit< Dim1, System1 >, boost::units::quantity< Unit2, Y >>

        -
        -

        Synopsis

        -
        // In header: <boost/units/lambda.hpp>
-
-template<typename System1, typename Dim1, typename Unit2, typename Y> 
-struct plain_return_type_2<arithmetic_action< divide_action >, boost::units::unit< Dim1, System1 >, boost::units::quantity< Unit2, Y >> {
-  // types
-  typedef boost::units::divide_typeof_helper< boost::units::unit< Dim1, System1 >, boost::units::quantity< Unit2, Y > >::type type;
-};
        -
        -

        Description

        -

        Partial specialization of return type trait for action unit<Dim1, System1> / quantity<Unit2, Y>.

        -
        -
        - - - -
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven - Watanabe

        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/lambda/plain_return__idp347094736.html b/doc/html/boost/lambda/plain_return__idp347094736.html deleted file mode 100644 index f58a461018..0000000000 --- a/doc/html/boost/lambda/plain_return__idp347094736.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Struct template plain_return_type_2<arithmetic_action< divide_action >, boost::units::unit< Dim1, System1 >, boost::units::unit< Dim2, System2 >> - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Struct template plain_return_type_2<arithmetic_action< divide_action >, boost::units::unit< Dim1, System1 >, boost::units::unit< Dim2, System2 >>

        -

        boost::lambda::plain_return_type_2<arithmetic_action< divide_action >, boost::units::unit< Dim1, System1 >, boost::units::unit< Dim2, System2 >>

        -
        -

        Synopsis

        -
        // In header: <boost/units/lambda.hpp>
-
-template<typename Dim1, typename Dim2, typename System1, typename System2> 
-struct plain_return_type_2<arithmetic_action< divide_action >, boost::units::unit< Dim1, System1 >, boost::units::unit< Dim2, System2 >> {
-  // types
-  typedef boost::units::divide_typeof_helper< boost::units::unit< Dim1, System1 >, boost::units::unit< Dim2, System2 > >::type type;
-};
        -
        -

        Description

        -

        Partial specialization of return type trait for action unit<Dim1, System1> / unit<Dim2, System2>.

        -
        -
        - - - -
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven - Watanabe

        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/lambda/plain_return__idp347101840.html b/doc/html/boost/lambda/plain_return__idp347101840.html deleted file mode 100644 index 37d95255bd..0000000000 --- a/doc/html/boost/lambda/plain_return__idp347101840.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Struct template plain_return_type_2<arithmetic_action< divide_action >, X, boost::units::quantity< Unit, X >> - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Struct template plain_return_type_2<arithmetic_action< divide_action >, X, boost::units::quantity< Unit, X >>

        -

        boost::lambda::plain_return_type_2<arithmetic_action< divide_action >, X, boost::units::quantity< Unit, X >>

        -
        -

        Synopsis

        -
        // In header: <boost/units/lambda.hpp>
-
-template<typename Unit, typename X> 
-struct plain_return_type_2<arithmetic_action< divide_action >, X, boost::units::quantity< Unit, X >> {
-  // types
-  typedef boost::units::divide_typeof_helper< X, boost::units::quantity< Unit, X > >::type type;
-};
        -
        -

        Description

        -

        Partial specialization of return type trait for action X / quantity<Unit, X>.

        -
        -
        - - - -
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven - Watanabe

        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/lambda/plain_return__idp347107040.html b/doc/html/boost/lambda/plain_return__idp347107040.html deleted file mode 100644 index 0f165b4ed9..0000000000 --- a/doc/html/boost/lambda/plain_return__idp347107040.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Struct template plain_return_type_2<arithmetic_action< divide_action >, Y, boost::units::unit< Dim, System >> - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Struct template plain_return_type_2<arithmetic_action< divide_action >, Y, boost::units::unit< Dim, System >>

        -

        boost::lambda::plain_return_type_2<arithmetic_action< divide_action >, Y, boost::units::unit< Dim, System >>

        -
        -

        Synopsis

        -
        // In header: <boost/units/lambda.hpp>
-
-template<typename System, typename Dim, typename Y> 
-struct plain_return_type_2<arithmetic_action< divide_action >, Y, boost::units::unit< Dim, System >> {
-  // types
-  typedef boost::units::divide_typeof_helper< Y, boost::units::unit< Dim, System > >::type type;
-};
        -
        -

        Description

        -

        Partial specialization of return type trait for action Y / unit<Dim, System>.

        -
        -
        - - - -
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven - Watanabe

        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/lambda/plain_return__idp347112784.html b/doc/html/boost/lambda/plain_return__idp347112784.html deleted file mode 100644 index 49edb94096..0000000000 --- a/doc/html/boost/lambda/plain_return__idp347112784.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Struct template plain_return_type_2<arithmetic_action< minus_action >, boost::units::absolute< Y >, boost::units::absolute< Y >> - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Struct template plain_return_type_2<arithmetic_action< minus_action >, boost::units::absolute< Y >, boost::units::absolute< Y >>

        -

        boost::lambda::plain_return_type_2<arithmetic_action< minus_action >, boost::units::absolute< Y >, boost::units::absolute< Y >>

        -
        -

        Synopsis

        -
        // In header: <boost/units/lambda.hpp>
-
-template<typename Y> 
-struct plain_return_type_2<arithmetic_action< minus_action >, boost::units::absolute< Y >, boost::units::absolute< Y >> {
-  // types
-  typedef Y type;
-};
        -
        -

        Description

        -

        Partial specialization of return type trait for action absolute<Y> - absolute<Y>.

        -
        -
        - - - -
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven - Watanabe

        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/lambda/plain_return__idp347116400.html b/doc/html/boost/lambda/plain_return__idp347116400.html deleted file mode 100644 index eb5609864c..0000000000 --- a/doc/html/boost/lambda/plain_return__idp347116400.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Struct template plain_return_type_2<arithmetic_action< minus_action >, boost::units::absolute< Y >, Y> - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Struct template plain_return_type_2<arithmetic_action< minus_action >, boost::units::absolute< Y >, Y>

        -

        boost::lambda::plain_return_type_2<arithmetic_action< minus_action >, boost::units::absolute< Y >, Y>

        -
        -

        Synopsis

        -
        // In header: <boost/units/lambda.hpp>
-
-template<typename Y> 
-struct plain_return_type_2<arithmetic_action< minus_action >, boost::units::absolute< Y >, Y> {
-  // types
-  typedef boost::units::absolute< Y > type;
-};
        -
        -

        Description

        -

        Partial specialization of return type trait for action absolute<Y> - Y.

        -
        -
        - - - -
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven - Watanabe

        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/lambda/plain_return__idp347120288.html b/doc/html/boost/lambda/plain_return__idp347120288.html deleted file mode 100644 index f9d548e15d..0000000000 --- a/doc/html/boost/lambda/plain_return__idp347120288.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Struct template plain_return_type_2<arithmetic_action< minus_action >, boost::units::quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(System), X >, Y> - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Struct template plain_return_type_2<arithmetic_action< minus_action >, boost::units::quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(System), X >, Y>

        -

        boost::lambda::plain_return_type_2<arithmetic_action< minus_action >, boost::units::quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(System), X >, Y>

        -
        -

        Synopsis

        -
        // In header: <boost/units/lambda.hpp>
-
-template<typename System, typename X, typename Y> 
-struct plain_return_type_2<arithmetic_action< minus_action >, boost::units::quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(System), X >, Y> {
-  // types
-  typedef boost::units::subtract_typeof_helper< boost::units::quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(System), X >, Y >::type type;
-};
        -
        -

        Description

        -

        Partial specialization of return type trait for action quantity<dimensionless, X> - Y.

        -
        -
        - - - -
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven - Watanabe

        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/lambda/plain_return__idp347126128.html b/doc/html/boost/lambda/plain_return__idp347126128.html deleted file mode 100644 index 3b7b1ce980..0000000000 --- a/doc/html/boost/lambda/plain_return__idp347126128.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Struct template plain_return_type_2<arithmetic_action< minus_action >, boost::units::quantity< Unit1, X >, boost::units::quantity< Unit2, Y >> - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Struct template plain_return_type_2<arithmetic_action< minus_action >, boost::units::quantity< Unit1, X >, boost::units::quantity< Unit2, Y >>

        -

        boost::lambda::plain_return_type_2<arithmetic_action< minus_action >, boost::units::quantity< Unit1, X >, boost::units::quantity< Unit2, Y >>

        -
        -

        Synopsis

        -
        // In header: <boost/units/lambda.hpp>
-
-template<typename Unit1, typename X, typename Unit2, typename Y> 
-struct plain_return_type_2<arithmetic_action< minus_action >, boost::units::quantity< Unit1, X >, boost::units::quantity< Unit2, Y >> {
-  // types
-  typedef boost::units::subtract_typeof_helper< boost::units::quantity< Unit1, X >, boost::units::quantity< Unit2, Y > >::type type;
-};
        -
        -

        Description

        -

        Partial specialization of return type trait for action quantity<Unit1, X> - quantity<Unit2, Y>.

        -
        -
        - - - -
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven - Watanabe

        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/lambda/plain_return__idp347133216.html b/doc/html/boost/lambda/plain_return__idp347133216.html deleted file mode 100644 index 27b30971a0..0000000000 --- a/doc/html/boost/lambda/plain_return__idp347133216.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Struct template plain_return_type_2<arithmetic_action< minus_action >, boost::units::unit< Dim1, System1 >, boost::units::unit< Dim2, System2 >> - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Struct template plain_return_type_2<arithmetic_action< minus_action >, boost::units::unit< Dim1, System1 >, boost::units::unit< Dim2, System2 >>

        -

        boost::lambda::plain_return_type_2<arithmetic_action< minus_action >, boost::units::unit< Dim1, System1 >, boost::units::unit< Dim2, System2 >>

        -
        -

        Synopsis

        -
        // In header: <boost/units/lambda.hpp>
-
-template<typename Dim1, typename Dim2, typename System1, typename System2> 
-struct plain_return_type_2<arithmetic_action< minus_action >, boost::units::unit< Dim1, System1 >, boost::units::unit< Dim2, System2 >> {
-  // types
-  typedef boost::units::subtract_typeof_helper< boost::units::unit< Dim1, System1 >, boost::units::unit< Dim2, System2 > >::type type;
-};
        -
        -

        Description

        -

        Partial specialization of return type trait for action unit<Dim1, System1> - unit<Dim2, System2>.

        -
        -
        - - - -
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven - Watanabe

        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/lambda/plain_return__idp347140320.html b/doc/html/boost/lambda/plain_return__idp347140320.html deleted file mode 100644 index 5c7979b638..0000000000 --- a/doc/html/boost/lambda/plain_return__idp347140320.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Struct template plain_return_type_2<arithmetic_action< minus_action >, X, boost::units::quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(System), Y >> - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Struct template plain_return_type_2<arithmetic_action< minus_action >, X, boost::units::quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(System), Y >>

        -

        boost::lambda::plain_return_type_2<arithmetic_action< minus_action >, X, boost::units::quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(System), Y >>

        -
        -

        Synopsis

        -
        // In header: <boost/units/lambda.hpp>
-
-template<typename System, typename X, typename Y> 
-struct plain_return_type_2<arithmetic_action< minus_action >, X, boost::units::quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(System), Y >> {
-  // types
-  typedef boost::units::subtract_typeof_helper< X, boost::units::quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(System), Y > >::type type;
-};
        -
        -

        Description

        -

        Partial specialization of return type trait for action X - quantity<dimensionless, Y>.

        -
        -
        - - - -
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven - Watanabe

        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/lambda/plain_return__idp347146144.html b/doc/html/boost/lambda/plain_return__idp347146144.html deleted file mode 100644 index ef6504b954..0000000000 --- a/doc/html/boost/lambda/plain_return__idp347146144.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Struct template plain_return_type_2<arithmetic_action< multiply_action >, boost::units::absolute< boost::units::unit< D, S > >, T> - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Struct template plain_return_type_2<arithmetic_action< multiply_action >, boost::units::absolute< boost::units::unit< D, S > >, T>

        -

        boost::lambda::plain_return_type_2<arithmetic_action< multiply_action >, boost::units::absolute< boost::units::unit< D, S > >, T>

        -
        -

        Synopsis

        -
        // In header: <boost/units/lambda.hpp>
-
-template<typename D, typename S, typename T> 
-struct plain_return_type_2<arithmetic_action< multiply_action >, boost::units::absolute< boost::units::unit< D, S > >, T> {
-  // types
-  typedef boost::units::quantity< boost::units::absolute< boost::units::unit< D, S > >, T > type;
-};
        -
        -

        Description

        -

        Partial specialization of return type trait for action absolute<unit<D, S> > * T.

        -
        -
        - - - -
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven - Watanabe

        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/lambda/plain_return__idp347152352.html b/doc/html/boost/lambda/plain_return__idp347152352.html deleted file mode 100644 index d0b8496f6d..0000000000 --- a/doc/html/boost/lambda/plain_return__idp347152352.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Struct template plain_return_type_2<arithmetic_action< multiply_action >, boost::units::quantity< Unit, X >, X> - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Struct template plain_return_type_2<arithmetic_action< multiply_action >, boost::units::quantity< Unit, X >, X>

        -

        boost::lambda::plain_return_type_2<arithmetic_action< multiply_action >, boost::units::quantity< Unit, X >, X>

        -
        -

        Synopsis

        -
        // In header: <boost/units/lambda.hpp>
-
-template<typename Unit, typename X> 
-struct plain_return_type_2<arithmetic_action< multiply_action >, boost::units::quantity< Unit, X >, X> {
-  // types
-  typedef boost::units::multiply_typeof_helper< boost::units::quantity< Unit, X >, X >::type type;
-};
        -
        -

        Description

        -

        Partial specialization of return type trait for action quantity<Unit, X> * X.

        -
        -
        - - - -
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven - Watanabe

        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/lambda/plain_return__idp347157552.html b/doc/html/boost/lambda/plain_return__idp347157552.html deleted file mode 100644 index 7595346cf4..0000000000 --- a/doc/html/boost/lambda/plain_return__idp347157552.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Struct template plain_return_type_2<arithmetic_action< multiply_action >, boost::units::quantity< Unit1, X >, boost::units::quantity< Unit2, Y >> - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Struct template plain_return_type_2<arithmetic_action< multiply_action >, boost::units::quantity< Unit1, X >, boost::units::quantity< Unit2, Y >>

        -

        boost::lambda::plain_return_type_2<arithmetic_action< multiply_action >, boost::units::quantity< Unit1, X >, boost::units::quantity< Unit2, Y >>

        -
        -

        Synopsis

        -
        // In header: <boost/units/lambda.hpp>
-
-template<typename Unit1, typename X, typename Unit2, typename Y> 
-struct plain_return_type_2<arithmetic_action< multiply_action >, boost::units::quantity< Unit1, X >, boost::units::quantity< Unit2, Y >> {
-  // types
-  typedef boost::units::multiply_typeof_helper< boost::units::quantity< Unit1, X >, boost::units::quantity< Unit2, Y > >::type type;
-};
        -
        -

        Description

        -

        Partial specialization of return type trait for action quantity<Unit1, X> * quantity<Unit2, Y>.

        -
        -
        - - - -
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven - Watanabe

        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/lambda/plain_return__idp347164640.html b/doc/html/boost/lambda/plain_return__idp347164640.html deleted file mode 100644 index 7020884759..0000000000 --- a/doc/html/boost/lambda/plain_return__idp347164640.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Struct template plain_return_type_2<arithmetic_action< multiply_action >, boost::units::quantity< Unit1, Y >, boost::units::unit< Dim2, System2 >> - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Struct template plain_return_type_2<arithmetic_action< multiply_action >, boost::units::quantity< Unit1, Y >, boost::units::unit< Dim2, System2 >>

        -

        boost::lambda::plain_return_type_2<arithmetic_action< multiply_action >, boost::units::quantity< Unit1, Y >, boost::units::unit< Dim2, System2 >>

        -
        -

        Synopsis

        -
        // In header: <boost/units/lambda.hpp>
-
-template<typename Unit1, typename Y, typename System2, typename Dim2> 
-struct plain_return_type_2<arithmetic_action< multiply_action >, boost::units::quantity< Unit1, Y >, boost::units::unit< Dim2, System2 >> {
-  // types
-  typedef boost::units::multiply_typeof_helper< boost::units::quantity< Unit1, Y >, boost::units::unit< Dim2, System2 > >::type type;
-};
        -
        -

        Description

        -

        Partial specialization of return type trait for action quantity<Unit1, Y> * unit<Dim2, System2>.

        -
        -
        - - - -
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven - Watanabe

        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/lambda/plain_return__idp347171744.html b/doc/html/boost/lambda/plain_return__idp347171744.html deleted file mode 100644 index f40e058c25..0000000000 --- a/doc/html/boost/lambda/plain_return__idp347171744.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Struct template plain_return_type_2<arithmetic_action< multiply_action >, boost::units::unit< Dim, System >, Y> - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Struct template plain_return_type_2<arithmetic_action< multiply_action >, boost::units::unit< Dim, System >, Y>

        -

        boost::lambda::plain_return_type_2<arithmetic_action< multiply_action >, boost::units::unit< Dim, System >, Y>

        -
        -

        Synopsis

        -
        // In header: <boost/units/lambda.hpp>
-
-template<typename System, typename Dim, typename Y> 
-struct plain_return_type_2<arithmetic_action< multiply_action >, boost::units::unit< Dim, System >, Y> {
-  // types
-  typedef boost::units::multiply_typeof_helper< boost::units::unit< Dim, System >, Y >::type type;
-};
        -
        -

        Description

        -

        Partial specialization of return type trait for action unit<Dim, System> * Y.

        -
        -
        - - - -
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven - Watanabe

        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/lambda/plain_return__idp347177504.html b/doc/html/boost/lambda/plain_return__idp347177504.html deleted file mode 100644 index b98000c725..0000000000 --- a/doc/html/boost/lambda/plain_return__idp347177504.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Struct template plain_return_type_2<arithmetic_action< multiply_action >, boost::units::unit< Dim1, System1 >, boost::units::quantity< Unit2, Y >> - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Struct template plain_return_type_2<arithmetic_action< multiply_action >, boost::units::unit< Dim1, System1 >, boost::units::quantity< Unit2, Y >>

        -

        boost::lambda::plain_return_type_2<arithmetic_action< multiply_action >, boost::units::unit< Dim1, System1 >, boost::units::quantity< Unit2, Y >>

        -
        -

        Synopsis

        -
        // In header: <boost/units/lambda.hpp>
-
-template<typename System1, typename Dim1, typename Unit2, typename Y> 
-struct plain_return_type_2<arithmetic_action< multiply_action >, boost::units::unit< Dim1, System1 >, boost::units::quantity< Unit2, Y >> {
-  // types
-  typedef boost::units::multiply_typeof_helper< boost::units::unit< Dim1, System1 >, boost::units::quantity< Unit2, Y > >::type type;
-};
        -
        -

        Description

        -

        Partial specialization of return type trait for action unit<Dim1, System1> * quantity<Unit2, Y>.

        -
        -
        - - - -
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven - Watanabe

        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/lambda/plain_return__idp347184592.html b/doc/html/boost/lambda/plain_return__idp347184592.html deleted file mode 100644 index 10bdd73fc9..0000000000 --- a/doc/html/boost/lambda/plain_return__idp347184592.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Struct template plain_return_type_2<arithmetic_action< multiply_action >, boost::units::unit< Dim1, System1 >, boost::units::unit< Dim2, System2 >> - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Struct template plain_return_type_2<arithmetic_action< multiply_action >, boost::units::unit< Dim1, System1 >, boost::units::unit< Dim2, System2 >>

        -

        boost::lambda::plain_return_type_2<arithmetic_action< multiply_action >, boost::units::unit< Dim1, System1 >, boost::units::unit< Dim2, System2 >>

        -
        -

        Synopsis

        -
        // In header: <boost/units/lambda.hpp>
-
-template<typename Dim1, typename Dim2, typename System1, typename System2> 
-struct plain_return_type_2<arithmetic_action< multiply_action >, boost::units::unit< Dim1, System1 >, boost::units::unit< Dim2, System2 >> {
-  // types
-  typedef boost::units::multiply_typeof_helper< boost::units::unit< Dim1, System1 >, boost::units::unit< Dim2, System2 > >::type type;
-};
        -
        -

        Description

        -

        Partial specialization of return type trait for action unit<Dim1, System1> * unit<Dim2, System2>.

        -
        -
        - - - -
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven - Watanabe

        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/lambda/plain_return__idp347191696.html b/doc/html/boost/lambda/plain_return__idp347191696.html deleted file mode 100644 index 69b2b06d1e..0000000000 --- a/doc/html/boost/lambda/plain_return__idp347191696.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Struct template plain_return_type_2<arithmetic_action< multiply_action >, T, boost::units::absolute< boost::units::unit< D, S > >> - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Struct template plain_return_type_2<arithmetic_action< multiply_action >, T, boost::units::absolute< boost::units::unit< D, S > >>

        -

        boost::lambda::plain_return_type_2<arithmetic_action< multiply_action >, T, boost::units::absolute< boost::units::unit< D, S > >>

        -
        -

        Synopsis

        -
        // In header: <boost/units/lambda.hpp>
-
-template<typename D, typename S, typename T> 
-struct plain_return_type_2<arithmetic_action< multiply_action >, T, boost::units::absolute< boost::units::unit< D, S > >> {
-  // types
-  typedef boost::units::quantity< boost::units::absolute< boost::units::unit< D, S > >, T > type;
-};
        -
        -

        Description

        -

        Partial specialization of return type trait for action T * absolute<unit<D, S> >.

        -
        -
        - - - -
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven - Watanabe

        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/lambda/plain_return__idp347197904.html b/doc/html/boost/lambda/plain_return__idp347197904.html deleted file mode 100644 index 8d17b9dfc7..0000000000 --- a/doc/html/boost/lambda/plain_return__idp347197904.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Struct template plain_return_type_2<arithmetic_action< multiply_action >, X, boost::units::quantity< Unit, X >> - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Struct template plain_return_type_2<arithmetic_action< multiply_action >, X, boost::units::quantity< Unit, X >>

        -

        boost::lambda::plain_return_type_2<arithmetic_action< multiply_action >, X, boost::units::quantity< Unit, X >>

        -
        -

        Synopsis

        -
        // In header: <boost/units/lambda.hpp>
-
-template<typename Unit, typename X> 
-struct plain_return_type_2<arithmetic_action< multiply_action >, X, boost::units::quantity< Unit, X >> {
-  // types
-  typedef boost::units::multiply_typeof_helper< X, boost::units::quantity< Unit, X > >::type type;
-};
        -
        -

        Description

        -

        Partial specialization of return type trait for action X * quantity<Unit, X>.

        -
        -
        - - - -
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven - Watanabe

        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/lambda/plain_return__idp347203104.html b/doc/html/boost/lambda/plain_return__idp347203104.html deleted file mode 100644 index 0b9e3df365..0000000000 --- a/doc/html/boost/lambda/plain_return__idp347203104.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Struct template plain_return_type_2<arithmetic_action< multiply_action >, Y, boost::units::unit< Dim, System >> - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Struct template plain_return_type_2<arithmetic_action< multiply_action >, Y, boost::units::unit< Dim, System >>

        -

        boost::lambda::plain_return_type_2<arithmetic_action< multiply_action >, Y, boost::units::unit< Dim, System >>

        -
        -

        Synopsis

        -
        // In header: <boost/units/lambda.hpp>
-
-template<typename System, typename Dim, typename Y> 
-struct plain_return_type_2<arithmetic_action< multiply_action >, Y, boost::units::unit< Dim, System >> {
-  // types
-  typedef boost::units::multiply_typeof_helper< Y, boost::units::unit< Dim, System > >::type type;
-};
        -
        -

        Description

        -

        Partial specialization of return type trait for action Y * unit<Dim, System>.

        -
        -
        - - - -
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven - Watanabe

        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/lambda/plain_return__idp347208848.html b/doc/html/boost/lambda/plain_return__idp347208848.html deleted file mode 100644 index 60e75a4bc4..0000000000 --- a/doc/html/boost/lambda/plain_return__idp347208848.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Struct template plain_return_type_2<arithmetic_action< plus_action >, boost::units::absolute< Y >, Y> - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Struct template plain_return_type_2<arithmetic_action< plus_action >, boost::units::absolute< Y >, Y>

        -

        boost::lambda::plain_return_type_2<arithmetic_action< plus_action >, boost::units::absolute< Y >, Y>

        -
        -

        Synopsis

        -
        // In header: <boost/units/lambda.hpp>
-
-template<typename Y> 
-struct plain_return_type_2<arithmetic_action< plus_action >, boost::units::absolute< Y >, Y> {
-  // types
-  typedef boost::units::absolute< Y > type;
-};
        -
        -

        Description

        -

        Partial specialization of return type trait for action absolute<Y> + Y.

        -
        -
        - - - -
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven - Watanabe

        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/lambda/plain_return__idp347212736.html b/doc/html/boost/lambda/plain_return__idp347212736.html deleted file mode 100644 index 6d91b9df53..0000000000 --- a/doc/html/boost/lambda/plain_return__idp347212736.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Struct template plain_return_type_2<arithmetic_action< plus_action >, boost::units::quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(System), X >, Y> - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Struct template plain_return_type_2<arithmetic_action< plus_action >, boost::units::quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(System), X >, Y>

        -

        boost::lambda::plain_return_type_2<arithmetic_action< plus_action >, boost::units::quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(System), X >, Y>

        -
        -

        Synopsis

        -
        // In header: <boost/units/lambda.hpp>
-
-template<typename System, typename X, typename Y> 
-struct plain_return_type_2<arithmetic_action< plus_action >, boost::units::quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(System), X >, Y> {
-  // types
-  typedef boost::units::add_typeof_helper< boost::units::quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(System), X >, Y >::type type;
-};
        -
        -

        Description

        -

        Partial specialization of return type trait for action quantity<dimensionless, X> + Y.

        -
        -
        - - - -
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven - Watanabe

        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/lambda/plain_return__idp347218576.html b/doc/html/boost/lambda/plain_return__idp347218576.html deleted file mode 100644 index cb85465ac2..0000000000 --- a/doc/html/boost/lambda/plain_return__idp347218576.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Struct template plain_return_type_2<arithmetic_action< plus_action >, boost::units::quantity< Unit1, X >, boost::units::quantity< Unit2, Y >> - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Struct template plain_return_type_2<arithmetic_action< plus_action >, boost::units::quantity< Unit1, X >, boost::units::quantity< Unit2, Y >>

        -

        boost::lambda::plain_return_type_2<arithmetic_action< plus_action >, boost::units::quantity< Unit1, X >, boost::units::quantity< Unit2, Y >>

        -
        -

        Synopsis

        -
        // In header: <boost/units/lambda.hpp>
-
-template<typename Unit1, typename X, typename Unit2, typename Y> 
-struct plain_return_type_2<arithmetic_action< plus_action >, boost::units::quantity< Unit1, X >, boost::units::quantity< Unit2, Y >> {
-  // types
-  typedef boost::units::add_typeof_helper< boost::units::quantity< Unit1, X >, boost::units::quantity< Unit2, Y > >::type type;
-};
        -
        -

        Description

        -

        Partial specialization of return type trait for action quantity<Unit1, X> + quantity<Unit2, Y>.

        -
        -
        - - - -
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven - Watanabe

        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/lambda/plain_return__idp347225664.html b/doc/html/boost/lambda/plain_return__idp347225664.html deleted file mode 100644 index d3410b3779..0000000000 --- a/doc/html/boost/lambda/plain_return__idp347225664.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Struct template plain_return_type_2<arithmetic_action< plus_action >, boost::units::unit< Dim1, System1 >, boost::units::unit< Dim2, System2 >> - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Struct template plain_return_type_2<arithmetic_action< plus_action >, boost::units::unit< Dim1, System1 >, boost::units::unit< Dim2, System2 >>

        -

        boost::lambda::plain_return_type_2<arithmetic_action< plus_action >, boost::units::unit< Dim1, System1 >, boost::units::unit< Dim2, System2 >>

        -
        -

        Synopsis

        -
        // In header: <boost/units/lambda.hpp>
-
-template<typename Dim1, typename Dim2, typename System1, typename System2> 
-struct plain_return_type_2<arithmetic_action< plus_action >, boost::units::unit< Dim1, System1 >, boost::units::unit< Dim2, System2 >> {
-  // types
-  typedef boost::units::add_typeof_helper< boost::units::unit< Dim1, System1 >, boost::units::unit< Dim2, System2 > >::type type;
-};
        -
        -

        Description

        -

        Partial specialization of return type trait for action unit<Dim1, System1> + unit<Dim2, System2>.

        -
        -
        - - - -
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven - Watanabe

        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/lambda/plain_return__idp347232768.html b/doc/html/boost/lambda/plain_return__idp347232768.html deleted file mode 100644 index 38f1edc735..0000000000 --- a/doc/html/boost/lambda/plain_return__idp347232768.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Struct template plain_return_type_2<arithmetic_action< plus_action >, X, boost::units::quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(System), Y >> - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Struct template plain_return_type_2<arithmetic_action< plus_action >, X, boost::units::quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(System), Y >>

        -

        boost::lambda::plain_return_type_2<arithmetic_action< plus_action >, X, boost::units::quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(System), Y >>

        -
        -

        Synopsis

        -
        // In header: <boost/units/lambda.hpp>
-
-template<typename System, typename X, typename Y> 
-struct plain_return_type_2<arithmetic_action< plus_action >, X, boost::units::quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(System), Y >> {
-  // types
-  typedef boost::units::add_typeof_helper< X, boost::units::quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(System), Y > >::type type;
-};
        -
        -

        Description

        -

        Partial specialization of return type trait for action X + quantity<dimensionless, Y>.

        -
        -
        - - - -
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven - Watanabe

        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/lambda/plain_return__idp347238592.html b/doc/html/boost/lambda/plain_return__idp347238592.html deleted file mode 100644 index bd3d396268..0000000000 --- a/doc/html/boost/lambda/plain_return__idp347238592.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Struct template plain_return_type_2<arithmetic_action< plus_action >, Y, boost::units::absolute< Y >> - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Struct template plain_return_type_2<arithmetic_action< plus_action >, Y, boost::units::absolute< Y >>

        -

        boost::lambda::plain_return_type_2<arithmetic_action< plus_action >, Y, boost::units::absolute< Y >>

        -
        -

        Synopsis

        -
        // In header: <boost/units/lambda.hpp>
-
-template<typename Y> 
-struct plain_return_type_2<arithmetic_action< plus_action >, Y, boost::units::absolute< Y >> {
-  // types
-  typedef boost::units::absolute< Y > type;
-};
        -
        -

        Description

        -

        Partial specialization of return type trait for action Y + absolute<Y>.

        -
        -
        - - - -
        Copyright © 2003-2008 Matthias Christian Schabel
        Copyright © 2007-2010 Steven - Watanabe

        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/last_val_idm45507100097776.html b/doc/html/boost/last_val_idm45507100097776.html new file mode 100644 index 0000000000..1daa16b9c1 --- /dev/null +++ b/doc/html/boost/last_val_idm45507100097776.html @@ -0,0 +1,79 @@ + + + + +Class last_value<void> + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Class last_value<void>

        +

        boost::last_value<void> — Evaluate an InputIterator sequence.

        +
        +

        Synopsis

        +
        // In header: <boost/last_value.hpp>
+
+
+class last_value<void> {
+public:
+  // types
+  typedef unspecified result_type;
+
+  // invocation
+  template<typename InputIterator> 
+    result_type operator()(InputIterator, InputIterator) const;
+};
        +
        +

        Description

        +
        +

        +last_value invocation

        +
        1. +
          template<typename InputIterator> 
+  result_type operator()(InputIterator first, InputIterator last) const;
          +
          ++++ + + + + +

          Effects:

          Dereferences every iterator in the sequence [first, last).

          +
        +
        +
        +
        + + + +
        Copyright © 2001-2004 Douglas Gregor

        Use, modification and distribution is subject to the Boost + Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/last_value.html b/doc/html/boost/last_value.html index 499c0fdf9f..0a77770de5 100644 --- a/doc/html/boost/last_value.html +++ b/doc/html/boost/last_value.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        @@ -39,18 +39,18 @@ // types typedef T result_type; - // invocation + // invocation template<typename InputIterator> - result_type operator()(InputIterator, InputIterator) const; + result_type operator()(InputIterator, InputIterator) const; };
        -

        Description

        +

        Description

        -

        -last_value invocation

        +

        +last_value invocation

        1. template<typename InputIterator> 
-  result_type operator()(InputIterator first, InputIterator last) const;
          + result_type operator()(InputIterator first, InputIterator last) const;
          @@ -74,8 +74,8 @@
          -

          Specializations

          -
          +

          Specializations

          +
          @@ -88,7 +88,7 @@
          -PrevUpHomeNext +PrevUpHomeNext
          diff --git a/doc/html/boost/last_value_vo_idp110570544.html b/doc/html/boost/last_value_vo_idp110570544.html deleted file mode 100644 index 2545b06c90..0000000000 --- a/doc/html/boost/last_value_vo_idp110570544.html +++ /dev/null @@ -1,79 +0,0 @@ - - - - -Class last_value<void> - - - - - - - - - - - - - - - -
          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
          -
          -
          -PrevUpHomeNext -
          -
          -
          -
          -

          Class last_value<void>

          -

          boost::last_value<void> — Evaluate an InputIterator sequence.

          -
          -

          Synopsis

          -
          // In header: <boost/last_value.hpp>
-
-
-class last_value<void> {
-public:
-  // types
-  typedef unspecified result_type;
-
-  // invocation
-  template<typename InputIterator> 
-    result_type operator()(InputIterator, InputIterator) const;
-};
          -
          -

          Description

          -
          -

          -last_value invocation

          -
          1. -
            template<typename InputIterator> 
-  result_type operator()(InputIterator first, InputIterator last) const;
            -
            ---- - - - - -

            Effects:

            Dereferences every iterator in the sequence [first, last).

            -
          -
          -
          -
          - - - -
          Copyright © 2001-2004 Douglas Gregor

          Use, modification and distribution is subject to the Boost - Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

          -
          -
          -
          -PrevUpHomeNext -
          - - diff --git a/doc/html/boost/local_time/ambiguous_result.html b/doc/html/boost/local_time/ambiguous_result.html index 6d05da6895..13e4ee413a 100644 --- a/doc/html/boost/local_time/ambiguous_result.html +++ b/doc/html/boost/local_time/ambiguous_result.html @@ -35,16 +35,16 @@ struct ambiguous_result : public logic_error { // construct/copy/destruct - ambiguous_result(std::string const & = std::string()); + ambiguous_result(std::string const & = std::string()); };
          -

          Description

          +

          Description

          -

          +

          ambiguous_result public construct/copy/destruct

          -
          1. ambiguous_result(std::string const & msg = std::string());
          +
          1. ambiguous_result(std::string const & msg = std::string());
        diff --git a/doc/html/boost/local_time/bad_adjustment.html b/doc/html/boost/local_time/bad_adjustment.html index 501b0baad3..c805e6f236 100644 --- a/doc/html/boost/local_time/bad_adjustment.html +++ b/doc/html/boost/local_time/bad_adjustment.html @@ -35,16 +35,16 @@ struct bad_adjustment : public out_of_range { // construct/copy/destruct - bad_adjustment(std::string const & = std::string()); + bad_adjustment(std::string const & = std::string()); };
        -

        Description

        +

        Description

        -

        +

        bad_adjustment public construct/copy/destruct

        -
        1. bad_adjustment(std::string const & msg = std::string());
        +
        1. bad_adjustment(std::string const & msg = std::string());
        diff --git a/doc/html/boost/local_time/bad_offset.html b/doc/html/boost/local_time/bad_offset.html index aa5bee5e1a..d75aca31fb 100644 --- a/doc/html/boost/local_time/bad_offset.html +++ b/doc/html/boost/local_time/bad_offset.html @@ -35,16 +35,16 @@ struct bad_offset : public out_of_range { // construct/copy/destruct - bad_offset(std::string const & = std::string()); + bad_offset(std::string const & = std::string()); };
        -

        Description

        +

        Description

        -

        +

        bad_offset public construct/copy/destruct

        -
        1. bad_offset(std::string const & msg = std::string());
        +
        1. bad_offset(std::string const & msg = std::string());
      diff --git a/doc/html/boost/local_time/custom_time_zone_base.html b/doc/html/boost/local_time/custom_time_zone_base.html index 2775426f8b..f7e911c18a 100644 --- a/doc/html/boost/local_time/custom_time_zone_base.html +++ b/doc/html/boost/local_time/custom_time_zone_base.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      @@ -46,58 +46,58 @@ typedef CharT char_type; // construct/copy/destruct - custom_time_zone_base(const time_zone_names &, const time_duration_type &, + custom_time_zone_base(const time_zone_names &, const time_duration_type &, const dst_adjustment_offsets &, boost::shared_ptr< dst_calc_rule >); - ~custom_time_zone_base(); + ~custom_time_zone_base(); - // public member functions - virtual string_type dst_zone_abbrev() const; - virtual string_type std_zone_abbrev() const; - virtual string_type dst_zone_name() const; - virtual string_type std_zone_name() const; - virtual bool has_dst() const; - virtual posix_time::ptime dst_local_start_time(gregorian::greg_year) const; - virtual posix_time::ptime dst_local_end_time(gregorian::greg_year) const; - virtual time_duration_type base_utc_offset() const; - virtual time_duration_type dst_offset() const; - virtual string_type to_posix_string() const; + // public member functions + virtual string_type dst_zone_abbrev() const; + virtual string_type std_zone_abbrev() const; + virtual string_type dst_zone_name() const; + virtual string_type std_zone_name() const; + virtual bool has_dst() const; + virtual posix_time::ptime dst_local_start_time(gregorian::greg_year) const; + virtual posix_time::ptime dst_local_end_time(gregorian::greg_year) const; + virtual time_duration_type base_utc_offset() const; + virtual time_duration_type dst_offset() const; + virtual string_type to_posix_string() const; };
      -

      Description

      +

      Description

      -

      +

      custom_time_zone_base public construct/copy/destruct

        -
      1. custom_time_zone_base(const time_zone_names & zone_names, 
+
      2. custom_time_zone_base(const time_zone_names & zone_names, 
                       const time_duration_type & utc_offset, 
                       const dst_adjustment_offsets & dst_shift, 
                       boost::shared_ptr< dst_calc_rule > calc_rule);
        3. 
-
      3. ~custom_time_zone_base();
        4. 
+
      4. ~custom_time_zone_base();
        5.
      -

      -custom_time_zone_base public member functions

      +

      +custom_time_zone_base public member functions

        -
      1. virtual string_type dst_zone_abbrev() const;
        2. -
      2. virtual string_type std_zone_abbrev() const;
        3. -
      3. virtual string_type dst_zone_name() const;
        4. -
      4. virtual string_type std_zone_name() const;
        5. +
      5. virtual string_type dst_zone_abbrev() const;
        6. +
      6. virtual string_type std_zone_abbrev() const;
        7. +
      7. virtual string_type dst_zone_name() const;
        8. +
      8. virtual string_type std_zone_name() const;
      9. -
        virtual bool has_dst() const;
        True if zone uses daylight savings adjustments.
        10. +
        virtual bool has_dst() const;
        True if zone uses daylight savings adjustments.
      10. -
        virtual posix_time::ptime dst_local_start_time(gregorian::greg_year y) const;
        Local time that DST starts <ndash></ndash> NADT if has_dst is false.
        11. +
        virtual posix_time::ptime dst_local_start_time(gregorian::greg_year y) const;
        Local time that DST starts <ndash></ndash> NADT if has_dst is false.
      11. -
        virtual posix_time::ptime dst_local_end_time(gregorian::greg_year y) const;
        Local time that DST ends <ndash></ndash> NADT if has_dst is false.
        12. +
        virtual posix_time::ptime dst_local_end_time(gregorian::greg_year y) const;
        Local time that DST ends <ndash></ndash> NADT if has_dst is false.
      12. -
        virtual time_duration_type base_utc_offset() const;
        Base offset from UTC for zone (eg: -07:30:00)
        13. +
        virtual time_duration_type base_utc_offset() const;
        Base offset from UTC for zone (eg: -07:30:00)
      13. -
        virtual time_duration_type dst_offset() const;
        Adjustment forward or back made while DST is in effect.
        14. +
        virtual time_duration_type dst_offset() const;
        Adjustment forward or back made while DST is in effect.
      14. -
        virtual string_type to_posix_string() const;
        Returns a POSIX time_zone string for this object.
        15. +
        virtual string_type to_posix_string() const;
        Returns a POSIX time_zone string for this object.
      @@ -110,7 +110,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/local_time/dst_not_valid.html b/doc/html/boost/local_time/dst_not_valid.html index 36a3c06c3a..266513f206 100644 --- a/doc/html/boost/local_time/dst_not_valid.html +++ b/doc/html/boost/local_time/dst_not_valid.html @@ -35,16 +35,16 @@ struct dst_not_valid : public logic_error { // construct/copy/destruct - dst_not_valid(std::string const & = std::string()); + dst_not_valid(std::string const & = std::string()); };
      -

      Description

      +

      Description

      -

      +

      dst_not_valid public construct/copy/destruct

      -
      1. dst_not_valid(std::string const & msg = std::string());
      +
      1. dst_not_valid(std::string const & msg = std::string());
      diff --git a/doc/html/boost/local_time/first_last_rule_spec.html b/doc/html/boost/local_time/first_last_rule_spec.html index d84205f6ff..0fdd31bf21 100644 --- a/doc/html/boost/local_time/first_last_rule_spec.html +++ b/doc/html/boost/local_time/first_last_rule_spec.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      @@ -48,7 +48,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/local_time/local_date_time_base.html b/doc/html/boost/local_time/local_date_time_base.html index 3a7c9bdf83..65faa9de18 100644 --- a/doc/html/boost/local_time/local_date_time_base.html +++ b/doc/html/boost/local_time/local_date_time_base.html @@ -47,64 +47,64 @@ enum DST_CALC_OPTIONS { EXCEPTION_ON_ERROR, NOT_DATE_TIME_ON_ERROR }; // construct/copy/destruct - local_date_time_base(utc_time_type, boost::shared_ptr< tz_type >); - local_date_time_base(date_type, time_duration_type, + local_date_time_base(utc_time_type, boost::shared_ptr< tz_type >); + local_date_time_base(date_type, time_duration_type, boost::shared_ptr< tz_type >, bool); - local_date_time_base(date_type, time_duration_type, + local_date_time_base(date_type, time_duration_type, boost::shared_ptr< tz_type >, DST_CALC_OPTIONS); - local_date_time_base(const local_date_time_base &); - explicit local_date_time_base(const boost::date_time::special_values, + local_date_time_base(const local_date_time_base &); + explicit local_date_time_base(const boost::date_time::special_values, boost::shared_ptr< tz_type > = boost::shared_ptr< tz_type >()); - ~local_date_time_base(); + ~local_date_time_base(); - // public member functions - boost::shared_ptr< tz_type > zone() const; - bool is_dst() const; - utc_time_type utc_time() const; - utc_time_type local_time() const; - std::string to_string() const; + // public member functions + boost::shared_ptr< tz_type > zone() const; + bool is_dst() const; + utc_time_type utc_time() const; + utc_time_type local_time() const; + std::string to_string() const; local_date_time_base - local_time_in(boost::shared_ptr< tz_type >, + local_time_in(boost::shared_ptr< tz_type >, time_duration_type = time_duration_type(0, 0, 0)) const; - std::string zone_name(bool = false) const; - std::string zone_abbrev(bool = false) const; - std::string zone_as_posix_string() const; - bool operator==(const local_date_time_base &) const; - bool operator!=(const local_date_time_base &) const; - bool operator<(const local_date_time_base &) const; - bool operator<=(const local_date_time_base &) const; - bool operator>(const local_date_time_base &) const; - bool operator>=(const local_date_time_base &) const; - local_date_time_base operator+(const date_duration_type &) const; - local_date_time_base operator+=(const date_duration_type &); - local_date_time_base operator-(const date_duration_type &) const; - local_date_time_base operator-=(const date_duration_type &); - local_date_time_base operator+(const time_duration_type &) const; - local_date_time_base operator+=(const time_duration_type &); - local_date_time_base operator-(const time_duration_type &) const; - local_date_time_base operator-=(const time_duration_type &); - time_duration_type operator-(const local_date_time_base &) const; + std::string zone_name(bool = false) const; + std::string zone_abbrev(bool = false) const; + std::string zone_as_posix_string() const; + bool operator==(const local_date_time_base &) const; + bool operator!=(const local_date_time_base &) const; + bool operator<(const local_date_time_base &) const; + bool operator<=(const local_date_time_base &) const; + bool operator>(const local_date_time_base &) const; + bool operator>=(const local_date_time_base &) const; + local_date_time_base operator+(const date_duration_type &) const; + local_date_time_base operator+=(const date_duration_type &); + local_date_time_base operator-(const date_duration_type &) const; + local_date_time_base operator-=(const date_duration_type &); + local_date_time_base operator+(const time_duration_type &) const; + local_date_time_base operator+=(const time_duration_type &); + local_date_time_base operator-(const time_duration_type &) const; + local_date_time_base operator-=(const time_duration_type &); + time_duration_type operator-(const local_date_time_base &) const; - // public static functions + // public static functions static time_is_dst_result - check_dst(date_type, time_duration_type, boost::shared_ptr< tz_type >); + check_dst(date_type, time_duration_type, boost::shared_ptr< tz_type >); - // private member functions + // private member functions utc_time_type - construction_adjustment(utc_time_type, boost::shared_ptr< tz_type >, bool); - std::string zone_as_offset(const time_duration_type &, const std::string &) const; + construction_adjustment(utc_time_type, boost::shared_ptr< tz_type >, bool); + std::string zone_as_offset(const time_duration_type &, const std::string &) const; };
      -

      Description

      +

      Description

      Representation of "wall-clock" time in a particular time zone Local_date_time_base holds a time value (date and time offset from 00:00) along with a time zone. The time value is stored as UTC and conversions to wall clock time are made as needed. This approach allows for operations between wall-clock times in different time zones, and daylight savings time considerations, to be made. Time zones are required to be in the form of a boost::shared_ptr<time_zone_base>.

      -

      +

      local_date_time_base public construct/copy/destruct

      1. -
        local_date_time_base(utc_time_type t, boost::shared_ptr< tz_type > tz);
        +
        local_date_time_base(utc_time_type t, boost::shared_ptr< tz_type > tz);

        This constructor interprets the passed time as a UTC time. So, for example, if the passed timezone is UTC-5 then the time will be adjusted back 5 hours. The time zone allows for automatic calculation of whether the particular time is adjusted for daylight savings, etc. If the time zone shared pointer is null then time stays unadjusted.

        @@ -134,7 +134,7 @@
      2. -
        local_date_time_base(date_type d, time_duration_type td, 
+
        local_date_time_base(date_type d, time_duration_type td, 
                      boost::shared_ptr< tz_type > tz, bool dst_flag);
        
 
        This constructs a local time <ndash></ndash> the passed time information understood to be in the passed tz. The DST flag must be passed to indicate whether the time is in daylight savings or not. 
 
        
@@ -150,102 +150,102 @@
    5. -
      local_date_time_base(date_type d, time_duration_type td, 
+
      local_date_time_base(date_type d, time_duration_type td, 
                      boost::shared_ptr< tz_type > tz, 
                      DST_CALC_OPTIONS calc_option);
      
 
      This constructs a local time <ndash></ndash> the passed time information understood to be in the passed tz. The DST flag is calculated according to the specified rule.
    6. -
      local_date_time_base(const local_date_time_base & rhs);
      Copy constructor.
      7. +
      local_date_time_base(const local_date_time_base & rhs);
      Copy constructor.
    7. -
      explicit local_date_time_base(const boost::date_time::special_values sv, 
+
      explicit local_date_time_base(const boost::date_time::special_values sv, 
                               boost::shared_ptr< tz_type > tz = boost::shared_ptr< tz_type >());
      Special values constructor.
    8. -
      ~local_date_time_base();
      Simple destructor, releases time zone if last referrer.
      9. +
      ~local_date_time_base();
      Simple destructor, releases time zone if last referrer.
    -

    -local_date_time_base public member functions

    +

    +local_date_time_base public member functions

    1. -
      boost::shared_ptr< tz_type > zone() const;
      returns time zone associated with calling instance
      2. +
      boost::shared_ptr< tz_type > zone() const;
      returns time zone associated with calling instance
    2. -
      bool is_dst() const;
      returns false is time_zone is NULL and if time value is a special_value
      3. +
      bool is_dst() const;
      returns false is time_zone is NULL and if time value is a special_value
    3. -
      utc_time_type utc_time() const;
      Returns object's time value as a utc representation.
      4. +
      utc_time_type utc_time() const;
      Returns object's time value as a utc representation.
    4. -
      utc_time_type local_time() const;
      Returns object's time value as a local representation.
      5. +
      utc_time_type local_time() const;
      Returns object's time value as a local representation.
    5. -
      std::string to_string() const;
      Returns string in the form "2003-Aug-20 05:00:00 EDT".

      Returns string in the form "2003-Aug-20 05:00:00 EDT". If time_zone is NULL the time zone abbreviation will be "UTC". The time zone abbrev will not be included if calling object is a special_value

      +
      std::string to_string() const;
      Returns string in the form "2003-Aug-20 05:00:00 EDT".

      Returns string in the form "2003-Aug-20 05:00:00 EDT". If time_zone is NULL the time zone abbreviation will be "UTC". The time zone abbrev will not be included if calling object is a special_value 

    6. local_date_time_base 
-local_time_in(boost::shared_ptr< tz_type > new_tz, 
+local_time_in(boost::shared_ptr< tz_type > new_tz, 
               time_duration_type td = time_duration_type(0, 0, 0)) const;

      returns a local_date_time_base in the given time zone with the optional time_duration added.

    7. -
      std::string zone_name(bool as_offset = false) const;
      Returns name of associated time zone or "Coordinated Universal Time".

      Optional bool parameter will return time zone as an offset (ie "+07:00" extended iso format). Empty string is returned for classes that do not use a time_zone

      +
      std::string zone_name(bool as_offset = false) const;
      Returns name of associated time zone or "Coordinated Universal Time".

      Optional bool parameter will return time zone as an offset (ie "+07:00" extended iso format). Empty string is returned for classes that do not use a time_zone

    8. -
      std::string zone_abbrev(bool as_offset = false) const;
      Returns abbreviation of associated time zone or "UTC".

      Optional bool parameter will return time zone as an offset (ie "+0700" iso format). Empty string is returned for classes that do not use a time_zone

      +
      std::string zone_abbrev(bool as_offset = false) const;
      Returns abbreviation of associated time zone or "UTC".

      Optional bool parameter will return time zone as an offset (ie "+0700" iso format). Empty string is returned for classes that do not use a time_zone

    9. -
      std::string zone_as_posix_string() const;
      returns a posix_time_zone string for the associated time_zone. If no time_zone, "UTC+00" is returned.
      10. +
      std::string zone_as_posix_string() const;
      returns a posix_time_zone string for the associated time_zone. If no time_zone, "UTC+00" is returned.
    10. -
      bool operator==(const local_date_time_base & rhs) const;
      Equality comparison operator.

      Equality comparison operator

      +
      bool operator==(const local_date_time_base & rhs) const;
      Equality comparison operator.

      Equality comparison operator

    11. -
      bool operator!=(const local_date_time_base & rhs) const;
      Non-Equality comparison operator.
      12. +
      bool operator!=(const local_date_time_base & rhs) const;
      Non-Equality comparison operator.
    12. -
      bool operator<(const local_date_time_base & rhs) const;
      Less than comparison operator.
      13. +
      bool operator<(const local_date_time_base & rhs) const;
      Less than comparison operator.
    13. -
      bool operator<=(const local_date_time_base & rhs) const;
      Less than or equal to comparison operator.
      14. +
      bool operator<=(const local_date_time_base & rhs) const;
      Less than or equal to comparison operator.
    14. -
      bool operator>(const local_date_time_base & rhs) const;
      Greater than comparison operator.
      15. +
      bool operator>(const local_date_time_base & rhs) const;
      Greater than comparison operator.
    15. -
      bool operator>=(const local_date_time_base & rhs) const;
      Greater than or equal to comparison operator.
      16. +
      bool operator>=(const local_date_time_base & rhs) const;
      Greater than or equal to comparison operator.
    16. -
      local_date_time_base operator+(const date_duration_type & dd) const;
      Local_date_time + date_duration.
      17. +
      local_date_time_base operator+(const date_duration_type & dd) const;
      Local_date_time + date_duration.
    17. -
      local_date_time_base operator+=(const date_duration_type & dd);
      Local_date_time += date_duration.
      18. +
      local_date_time_base operator+=(const date_duration_type & dd);
      Local_date_time += date_duration.
    18. -
      local_date_time_base operator-(const date_duration_type & dd) const;
      Local_date_time - date_duration.
      19. +
      local_date_time_base operator-(const date_duration_type & dd) const;
      Local_date_time - date_duration.
    19. -
      local_date_time_base operator-=(const date_duration_type & dd);
      Local_date_time -= date_duration.
      20. +
      local_date_time_base operator-=(const date_duration_type & dd);
      Local_date_time -= date_duration.
    20. -
      local_date_time_base operator+(const time_duration_type & td) const;
      Local_date_time + time_duration.
      21. +
      local_date_time_base operator+(const time_duration_type & td) const;
      Local_date_time + time_duration.
    21. -
      local_date_time_base operator+=(const time_duration_type & td);
      Local_date_time += time_duration.
      22. +
      local_date_time_base operator+=(const time_duration_type & td);
      Local_date_time += time_duration.
    22. -
      local_date_time_base operator-(const time_duration_type & td) const;
      Local_date_time - time_duration.
      23. +
      local_date_time_base operator-(const time_duration_type & td) const;
      Local_date_time - time_duration.
    23. -
      local_date_time_base operator-=(const time_duration_type & td);
      Local_date_time -= time_duration.
      24. +
      local_date_time_base operator-=(const time_duration_type & td);
      Local_date_time -= time_duration.
    24. -
      time_duration_type operator-(const local_date_time_base & rhs) const;
      local_date_time -= local_date_time <ndash></ndash>> time_duration_type
      25. +
      time_duration_type operator-(const local_date_time_base & rhs) const;
      local_date_time -= local_date_time <ndash></ndash>> time_duration_type
    -

    -local_date_time_base public static functions

    +

    +local_date_time_base public static functions

    1. static time_is_dst_result 
-check_dst(date_type d, time_duration_type td, boost::shared_ptr< tz_type > tz);
      Determines if given time label is in daylight savings for given zone.

      Determines if given time label is in daylight savings for given zone. Takes a date and time_duration representing a local time, along with time zone, and returns a time_is_dst_result object as result.

      +check_dst(date_type d, time_duration_type td, boost::shared_ptr< tz_type > tz);Determines if given time label is in daylight savings for given zone.

      Determines if given time label is in daylight savings for given zone. Takes a date and time_duration representing a local time, along with time zone, and returns a time_is_dst_result object as result.

    -

    -local_date_time_base private member functions

    +

    +local_date_time_base private member functions

    1. utc_time_type 
-construction_adjustment(utc_time_type t, boost::shared_ptr< tz_type > z, 
+construction_adjustment(utc_time_type t, boost::shared_ptr< tz_type > z, 
                         bool dst_flag);

      Adjust the passed in time to UTC?

    2. -
      std::string zone_as_offset(const time_duration_type & td, 
+
      std::string zone_as_offset(const time_duration_type & td, 
                            const std::string & separator) const;
      
 
      Simple formatting code <ndash></ndash> todo remove this?
      3. diff --git a/doc/html/boost/local_time/operator-__idp112002944.html b/doc/html/boost/local_time/operator-__idp112002944.html deleted file mode 100644 index 008947c6ec..0000000000 --- a/doc/html/boost/local_time/operator-__idp112002944.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Function operator-= - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Function operator-=

      -

      boost::local_time::operator-=

      -
      -

      Synopsis

      -
      // In header: <boost/date_time/local_time/date_duration_operators.hpp>
-
-
-local_date_time 
-operator-=(local_date_time & t, const boost::gregorian::months & m);
      -
      -

      Description

      -

      Subtracts a months object from a local_date_time. Result will be same day-of-month as local_date_time unless original day was the last day of month. see date_time::months_duration for more details

      -
      -
      - - - -
      Copyright © 2001-2005 CrystalClear Software, Inc

      Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/local_time/operator-__idp112016272.html b/doc/html/boost/local_time/operator-__idp112016272.html deleted file mode 100644 index 8ec0fa2a2f..0000000000 --- a/doc/html/boost/local_time/operator-__idp112016272.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Function operator-= - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Function operator-=

      -

      boost::local_time::operator-=

      -
      -

      Synopsis

      -
      // In header: <boost/date_time/local_time/date_duration_operators.hpp>
-
-
-local_date_time 
-operator-=(local_date_time & t, const boost::gregorian::years & y);
      -
      -

      Description

      -

      Subtracts a years object from a local_date_time. Result will be same month and day-of-month as local_date_time unless original day was the last day of month. see date_time::years_duration for more details

      -
      -
      - - - -
      Copyright © 2001-2005 CrystalClear Software, Inc

      Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/local_time/operator-_idp112012848.html b/doc/html/boost/local_time/operator-_idp112012848.html deleted file mode 100644 index b2acecfd0f..0000000000 --- a/doc/html/boost/local_time/operator-_idp112012848.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Function operator- - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Function operator-

      -

      boost::local_time::operator-

      -
      -

      Synopsis

      -
      // In header: <boost/date_time/local_time/date_duration_operators.hpp>
-
-
-local_date_time 
-operator-(const local_date_time & t, const boost::gregorian::years & y);
      -
      -

      Description

      -

      Subtracts a years object and a local_date_time. Result will be same month and day-of-month as local_date_time unless original day was the last day of month. see date_time::years_duration for more details

      -
      -
      - - - -
      Copyright © 2001-2005 CrystalClear Software, Inc

      Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/local_time/operator-_idp38322288.html b/doc/html/boost/local_time/operator-_idp38322288.html deleted file mode 100644 index bcc826c486..0000000000 --- a/doc/html/boost/local_time/operator-_idp38322288.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Function operator- - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Function operator-

      -

      boost::local_time::operator-

      -
      -

      Synopsis

      -
      // In header: <boost/date_time/local_time/date_duration_operators.hpp>
-
-
-local_date_time 
-operator-(const local_date_time & t, const boost::gregorian::months & m);
      -
      -

      Description

      -

      Subtracts a months object and a local_date_time. Result will be same day-of-month as local_date_time unless original day was the last day of month. see date_time::months_duration for more details

      -
      -
      - - - -
      Copyright © 2001-2005 CrystalClear Software, Inc

      Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/local_time/operator___idp112009600.html b/doc/html/boost/local_time/operator___idp112009600.html deleted file mode 100644 index a535e98d16..0000000000 --- a/doc/html/boost/local_time/operator___idp112009600.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Function operator+= - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Function operator+=

      -

      boost::local_time::operator+=

      -
      -

      Synopsis

      -
      // In header: <boost/date_time/local_time/date_duration_operators.hpp>
-
-
-local_date_time 
-operator+=(local_date_time & t, const boost::gregorian::years & y);
      -
      -

      Description

      -

      Adds a years object to a local_date_time. Result will be same month and day-of-month as local_date_time unless original day was the last day of month. see date_time::years_duration for more details

      -
      -
      - - - -
      Copyright © 2001-2005 CrystalClear Software, Inc

      Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/local_time/operator___idp38319040.html b/doc/html/boost/local_time/operator___idp38319040.html deleted file mode 100644 index 54a7c8cca0..0000000000 --- a/doc/html/boost/local_time/operator___idp38319040.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Function operator+= - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Function operator+=

      -

      boost::local_time::operator+=

      -
      -

      Synopsis

      -
      // In header: <boost/date_time/local_time/date_duration_operators.hpp>
-
-
-local_date_time 
-operator+=(local_date_time & t, const boost::gregorian::months & m);
      -
      -

      Description

      -

      Adds a months object to a local_date_time. Result will be same day-of-month as local_date_time unless original day was the last day of month. see date_time::months_duration for more details

      -
      -
      - - - -
      Copyright © 2001-2005 CrystalClear Software, Inc

      Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/local_time/operator__idp112006192.html b/doc/html/boost/local_time/operator__idp112006192.html deleted file mode 100644 index 30189ed366..0000000000 --- a/doc/html/boost/local_time/operator__idp112006192.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Function operator+ - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Function operator+

      -

      boost::local_time::operator+

      -
      -

      Synopsis

      -
      // In header: <boost/date_time/local_time/date_duration_operators.hpp>
-
-
-local_date_time 
-operator+(const local_date_time & t, const boost::gregorian::years & y);
      -
      -

      Description

      -

      Adds a years object and a local_date_time. Result will be same month and day-of-month as local_date_time unless original day was the last day of month. see date_time::years_duration for more details

      -
      -
      - - - -
      Copyright © 2001-2005 CrystalClear Software, Inc

      Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/local_time/operator__idp38315632.html b/doc/html/boost/local_time/operator__idp38315632.html deleted file mode 100644 index 1962749204..0000000000 --- a/doc/html/boost/local_time/operator__idp38315632.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Function operator+ - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Function operator+

      -

      boost::local_time::operator+

      -
      -

      Synopsis

      -
      // In header: <boost/date_time/local_time/date_duration_operators.hpp>
-
-
-local_date_time 
-operator+(const local_date_time & t, const boost::gregorian::months & m);
      -
      -

      Description

      -

      Adds a months object and a local_date_time. Result will be same day-of-month as local_date_time unless original day was the last day of month. see date_time::months_duration for more details

      -
      -
      - - - -
      Copyright © 2001-2005 CrystalClear Software, Inc

      Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/local_time/operator_idm45507089108976.html b/doc/html/boost/local_time/operator_idm45507089108976.html new file mode 100644 index 0000000000..6d31ecb0e3 --- /dev/null +++ b/doc/html/boost/local_time/operator_idm45507089108976.html @@ -0,0 +1,54 @@ + + + + +Function operator+ + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Function operator+

      +

      boost::local_time::operator+

      +
      +

      Synopsis

      +
      // In header: <boost/date_time/local_time/date_duration_operators.hpp>
+
+
+local_date_time 
+operator+(const local_date_time & t, const boost::gregorian::years & y);
      +
      +

      Description

      +

      Adds a years object and a local_date_time. Result will be same month and day-of-month as local_date_time unless original day was the last day of month. see date_time::years_duration for more details

      +
      +
      + + + +
      Copyright © 2001-2005 CrystalClear Software, Inc

      Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/local_time/operator_idm45507089112224.html b/doc/html/boost/local_time/operator_idm45507089112224.html new file mode 100644 index 0000000000..3666e742d4 --- /dev/null +++ b/doc/html/boost/local_time/operator_idm45507089112224.html @@ -0,0 +1,54 @@ + + + + +Function operator-= + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Function operator-=

      +

      boost::local_time::operator-=

      +
      +

      Synopsis

      +
      // In header: <boost/date_time/local_time/date_duration_operators.hpp>
+
+
+local_date_time 
+operator-=(local_date_time & t, const boost::gregorian::months & m);
      +
      +

      Description

      +

      Subtracts a months object from a local_date_time. Result will be same day-of-month as local_date_time unless original day was the last day of month. see date_time::months_duration for more details

      +
      +
      + + + +
      Copyright © 2001-2005 CrystalClear Software, Inc

      Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/local_time/operator_idm45507089115632.html b/doc/html/boost/local_time/operator_idm45507089115632.html new file mode 100644 index 0000000000..5141a908e5 --- /dev/null +++ b/doc/html/boost/local_time/operator_idm45507089115632.html @@ -0,0 +1,54 @@ + + + + +Function operator- + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Function operator-

      +

      boost::local_time::operator-

      +
      +

      Synopsis

      +
      // In header: <boost/date_time/local_time/date_duration_operators.hpp>
+
+
+local_date_time 
+operator-(const local_date_time & t, const boost::gregorian::months & m);
      +
      +

      Description

      +

      Subtracts a months object and a local_date_time. Result will be same day-of-month as local_date_time unless original day was the last day of month. see date_time::months_duration for more details

      +
      +
      + + + +
      Copyright © 2001-2005 CrystalClear Software, Inc

      Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/local_time/operator_idm45507089118880.html b/doc/html/boost/local_time/operator_idm45507089118880.html new file mode 100644 index 0000000000..aa1e28b4e9 --- /dev/null +++ b/doc/html/boost/local_time/operator_idm45507089118880.html @@ -0,0 +1,54 @@ + + + + +Function operator+= + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Function operator+=

      +

      boost::local_time::operator+=

      +
      +

      Synopsis

      +
      // In header: <boost/date_time/local_time/date_duration_operators.hpp>
+
+
+local_date_time 
+operator+=(local_date_time & t, const boost::gregorian::months & m);
      +
      +

      Description

      +

      Adds a months object to a local_date_time. Result will be same day-of-month as local_date_time unless original day was the last day of month. see date_time::months_duration for more details

      +
      +
      + + + +
      Copyright © 2001-2005 CrystalClear Software, Inc

      Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/local_time/operator_idm45507089122288.html b/doc/html/boost/local_time/operator_idm45507089122288.html new file mode 100644 index 0000000000..64c5ed18e2 --- /dev/null +++ b/doc/html/boost/local_time/operator_idm45507089122288.html @@ -0,0 +1,54 @@ + + + + +Function operator+ + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Function operator+

      +

      boost::local_time::operator+

      +
      +

      Synopsis

      +
      // In header: <boost/date_time/local_time/date_duration_operators.hpp>
+
+
+local_date_time 
+operator+(const local_date_time & t, const boost::gregorian::months & m);
      +
      +

      Description

      +

      Adds a months object and a local_date_time. Result will be same day-of-month as local_date_time unless original day was the last day of month. see date_time::months_duration for more details

      +
      +
      + + + +
      Copyright © 2001-2005 CrystalClear Software, Inc

      Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/local_time/operator_idm45507092037088.html b/doc/html/boost/local_time/operator_idm45507092037088.html new file mode 100644 index 0000000000..8d3d4d38f8 --- /dev/null +++ b/doc/html/boost/local_time/operator_idm45507092037088.html @@ -0,0 +1,54 @@ + + + + +Function operator-= + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Function operator-=

      +

      boost::local_time::operator-=

      +
      +

      Synopsis

      +
      // In header: <boost/date_time/local_time/date_duration_operators.hpp>
+
+
+local_date_time 
+operator-=(local_date_time & t, const boost::gregorian::years & y);
      +
      +

      Description

      +

      Subtracts a years object from a local_date_time. Result will be same month and day-of-month as local_date_time unless original day was the last day of month. see date_time::years_duration for more details

      +
      +
      + + + +
      Copyright © 2001-2005 CrystalClear Software, Inc

      Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/local_time/operator_idm45507092040512.html b/doc/html/boost/local_time/operator_idm45507092040512.html new file mode 100644 index 0000000000..e7668f5879 --- /dev/null +++ b/doc/html/boost/local_time/operator_idm45507092040512.html @@ -0,0 +1,54 @@ + + + + +Function operator- + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Function operator-

      +

      boost::local_time::operator-

      +
      +

      Synopsis

      +
      // In header: <boost/date_time/local_time/date_duration_operators.hpp>
+
+
+local_date_time 
+operator-(const local_date_time & t, const boost::gregorian::years & y);
      +
      +

      Description

      +

      Subtracts a years object and a local_date_time. Result will be same month and day-of-month as local_date_time unless original day was the last day of month. see date_time::years_duration for more details

      +
      +
      + + + +
      Copyright © 2001-2005 CrystalClear Software, Inc

      Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/local_time/operator_idm45507092043760.html b/doc/html/boost/local_time/operator_idm45507092043760.html new file mode 100644 index 0000000000..7d4975023f --- /dev/null +++ b/doc/html/boost/local_time/operator_idm45507092043760.html @@ -0,0 +1,54 @@ + + + + +Function operator+= + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Function operator+=

      +

      boost::local_time::operator+=

      +
      +

      Synopsis

      +
      // In header: <boost/date_time/local_time/date_duration_operators.hpp>
+
+
+local_date_time 
+operator+=(local_date_time & t, const boost::gregorian::years & y);
      +
      +

      Description

      +

      Adds a years object to a local_date_time. Result will be same month and day-of-month as local_date_time unless original day was the last day of month. see date_time::years_duration for more details

      +
      +
      + + + +
      Copyright © 2001-2005 CrystalClear Software, Inc

      Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/local_time/posix_time_zone_base.html b/doc/html/boost/local_time/posix_time_zone_base.html index 8ab5993660..732842cb13 100644 --- a/doc/html/boost/local_time/posix_time_zone_base.html +++ b/doc/html/boost/local_time/posix_time_zone_base.html @@ -49,33 +49,33 @@ typedef tokenizer_type::iterator tokenizer_iterator_type; // construct/copy/destruct - posix_time_zone_base(const string_type &); - ~posix_time_zone_base(); + posix_time_zone_base(const string_type &); + ~posix_time_zone_base(); - // public member functions - virtual string_type std_zone_abbrev() const; - virtual string_type dst_zone_abbrev() const; - virtual string_type std_zone_name() const; - virtual string_type dst_zone_name() const; - virtual bool has_dst() const; - virtual posix_time::ptime dst_local_start_time(gregorian::greg_year) const; - virtual posix_time::ptime dst_local_end_time(gregorian::greg_year) const; - virtual time_duration_type base_utc_offset() const; - virtual time_duration_type dst_offset() const; - virtual string_type to_posix_string() const; + // public member functions + virtual string_type std_zone_abbrev() const; + virtual string_type dst_zone_abbrev() const; + virtual string_type std_zone_name() const; + virtual string_type dst_zone_name() const; + virtual bool has_dst() const; + virtual posix_time::ptime dst_local_start_time(gregorian::greg_year) const; + virtual posix_time::ptime dst_local_end_time(gregorian::greg_year) const; + virtual time_duration_type base_utc_offset() const; + virtual time_duration_type dst_offset() const; + virtual string_type to_posix_string() const; - // private member functions - void calc_zone(const string_type &); - void calc_rules(const string_type &, const string_type &); - void M_func(const string_type &, const string_type &); - void julian_no_leap(const string_type &, const string_type &); - void julian_day(const string_type &, const string_type &); + // private member functions + void calc_zone(const string_type &); + void calc_rules(const string_type &, const string_type &); + void M_func(const string_type &, const string_type &); + void julian_no_leap(const string_type &, const string_type &); + void julian_day(const string_type &, const string_type &); - // private static functions - static std::string td_as_string(const time_duration_type &); + // private static functions + static std::string td_as_string(const time_duration_type &); };
    -

    Description

    +

    Description

    A POSIX time zone string takes the form of:
    "std offset dst [offset],start[/time],end[/time]" (w/no spaces) 'std' specifies the abbrev of the time zone.
    'offset' is the offset from UTC.
    @@ -99,66 +99,66 @@

    Note that UTC zone offsets can be greater than +12: http://www.worldtimezone.com/utc/utc+1200.html

    -

    +

    posix_time_zone_base public construct/copy/destruct

    1. -
      posix_time_zone_base(const string_type & s);
      Construct from a POSIX time zone string.
      2. -
    2. ~posix_time_zone_base();
      3. +
      posix_time_zone_base(const string_type & s);
      Construct from a POSIX time zone string. +
    3. ~posix_time_zone_base();
    -

    -posix_time_zone_base public member functions

    +

    +posix_time_zone_base public member functions

    1. -
      virtual string_type std_zone_abbrev() const;
      String for the zone when not in daylight savings (eg: EST)
      2. +
      virtual string_type std_zone_abbrev() const;
      String for the zone when not in daylight savings (eg: EST)
    2. -
      virtual string_type dst_zone_abbrev() const;
      String for the timezone when in daylight savings (eg: EDT)

      For those time zones that have no DST, an empty string is used

      +
      virtual string_type dst_zone_abbrev() const;
      String for the timezone when in daylight savings (eg: EDT)

      For those time zones that have no DST, an empty string is used

    3. -
      virtual string_type std_zone_name() const;
      String for the zone when not in daylight savings (eg: Eastern Standard Time)

      The full STD name is not extracted from the posix time zone string. Therefore, the STD abbreviation is used in it's place

      +
      virtual string_type std_zone_name() const;
      String for the zone when not in daylight savings (eg: Eastern Standard Time)

      The full STD name is not extracted from the posix time zone string. Therefore, the STD abbreviation is used in it's place

    4. -
      virtual string_type dst_zone_name() const;
      String for the timezone when in daylight savings (eg: Eastern Daylight Time)

      The full DST name is not extracted from the posix time zone string. Therefore, the STD abbreviation is used in it's place. For time zones that have no DST, an empty string is used

      +
      virtual string_type dst_zone_name() const;
      String for the timezone when in daylight savings (eg: Eastern Daylight Time)

      The full DST name is not extracted from the posix time zone string. Therefore, the STD abbreviation is used in it's place. For time zones that have no DST, an empty string is used

    5. -
      virtual bool has_dst() const;
      True if zone uses daylight savings adjustments otherwise false.
      6. +
      virtual bool has_dst() const;
      True if zone uses daylight savings adjustments otherwise false.
    6. -
      virtual posix_time::ptime dst_local_start_time(gregorian::greg_year y) const;
      Local time that DST starts <ndash></ndash> NADT if has_dst is false.
      7. +
      virtual posix_time::ptime dst_local_start_time(gregorian::greg_year y) const;
      Local time that DST starts <ndash></ndash> NADT if has_dst is false.
    7. -
      virtual posix_time::ptime dst_local_end_time(gregorian::greg_year y) const;
      Local time that DST ends <ndash></ndash> NADT if has_dst is false.
      8. +
      virtual posix_time::ptime dst_local_end_time(gregorian::greg_year y) const;
      Local time that DST ends <ndash></ndash> NADT if has_dst is false.
    8. -
      virtual time_duration_type base_utc_offset() const;
      Base offset from UTC for zone (eg: -07:30:00)
      9. +
      virtual time_duration_type base_utc_offset() const;
      Base offset from UTC for zone (eg: -07:30:00)
    9. -
      virtual time_duration_type dst_offset() const;
      Adjustment forward or back made while DST is in effect.
      10. +
      virtual time_duration_type dst_offset() const;
      Adjustment forward or back made while DST is in effect.
    10. -
      virtual string_type to_posix_string() const;
      Returns a POSIX time_zone string for this object.
      11. +
      virtual string_type to_posix_string() const;
      Returns a POSIX time_zone string for this object.
    -

    -posix_time_zone_base private member functions

    +

    +posix_time_zone_base private member functions

    1. -
      void calc_zone(const string_type & obj);
      +
      void calc_zone(const string_type & obj);

      Extract time zone abbreviations for STD & DST as well as the offsets for the time shift that occurs and how much of a shift. At this time full time zone names are NOT extracted so the abbreviations are used in their place

      2. -
    2. void calc_rules(const string_type & start, const string_type & end);
      3. -
    3. void M_func(const string_type & s, const string_type & e);
      4. +
    4. void calc_rules(const string_type & start, const string_type & end);
      5. +
    5. void M_func(const string_type & s, const string_type & e);
    6. -
      void julian_no_leap(const string_type & s, const string_type & e);
      Julian day. Feb29 is never counted, even in leap years.
      7. +
      void julian_no_leap(const string_type & s, const string_type & e);
      Julian day. Feb29 is never counted, even in leap years.
    7. -
      void julian_day(const string_type & s, const string_type & e);
      Julian day. Feb29 is always counted, but exception thrown in non-leap years.
      8. +
      void julian_day(const string_type & s, const string_type & e);
      Julian day. Feb29 is always counted, but exception thrown in non-leap years.
    -

    -posix_time_zone_base private static functions

    +

    +posix_time_zone_base private static functions

    1. -
      static std::string td_as_string(const time_duration_type & td);
      helper function used when throwing exceptions
    +
    static std::string td_as_string(const time_duration_type & td);
    helper function used when throwing exceptions
    diff --git a/doc/html/boost/local_time/time_label_invalid.html b/doc/html/boost/local_time/time_label_invalid.html index a227707bea..aae83c9f6e 100644 --- a/doc/html/boost/local_time/time_label_invalid.html +++ b/doc/html/boost/local_time/time_label_invalid.html @@ -35,16 +35,16 @@ struct time_label_invalid : public logic_error { // construct/copy/destruct - time_label_invalid(std::string const & = std::string()); + time_label_invalid(std::string const & = std::string()); };
    -

    Description

    +

    Description

    -

    +

    time_label_invalid public construct/copy/destruct

    -
    1. time_label_invalid(std::string const & msg = std::string());
    +
    1. time_label_invalid(std::string const & msg = std::string());
    diff --git a/doc/html/boost/local_time/tz_database.html b/doc/html/boost/local_time/tz_database.html index d14c547793..44494933d9 100644 --- a/doc/html/boost/local_time/tz_database.html +++ b/doc/html/boost/local_time/tz_database.html @@ -35,7 +35,7 @@ typedef date_time::tz_db_base< custom_time_zone, nth_kday_dst_rule > tz_database;
    -

    Description

    +

    Description

    Object populated with boost::shared_ptr<time_zone_base> objects Database is populated from specs stored in external csv file. See date_time::tz_db_base for greater detail

    diff --git a/doc/html/boost/lockfree/allocator.html b/doc/html/boost/lockfree/allocator.html index 72c44329c4..b3722016d2 100644 --- a/doc/html/boost/lockfree/allocator.html +++ b/doc/html/boost/lockfree/allocator.html @@ -38,7 +38,7 @@ { };
    -

    Description

    +

    Description

    Defines the allocator type of a data structure.

    diff --git a/doc/html/boost/lockfree/capacity.html b/doc/html/boost/lockfree/capacity.html index 07bb0c3f80..c0a4355c51 100644 --- a/doc/html/boost/lockfree/capacity.html +++ b/doc/html/boost/lockfree/capacity.html @@ -37,7 +37,7 @@ { };
    -

    Description

    +

    Description

    Sets the capacity of a data structure at compile-time.

    This implies that a data structure is bounded and fixed-sized.

    diff --git a/doc/html/boost/lockfree/fixed_sized.html b/doc/html/boost/lockfree/fixed_sized.html index 4162d454cd..ba740a1027 100644 --- a/doc/html/boost/lockfree/fixed_sized.html +++ b/doc/html/boost/lockfree/fixed_sized.html @@ -37,7 +37,7 @@ { };
    -

    Description

    +

    Description

    Configures a data structure as fixed-sized.

    The internal nodes are stored inside an array and they are addressed by array indexing. This limits the possible size of the queue to the number of elements that can be addressed by the index type (usually 2**16-2), but on platforms that lack double-width compare-and-exchange instructions, this is the best way to achieve lock-freedom. This implies that a data structure is bounded.

    diff --git a/doc/html/boost/lockfree/queue.html b/doc/html/boost/lockfree/queue.html index ff85a8b577..be69e3f046 100644 --- a/doc/html/boost/lockfree/queue.html +++ b/doc/html/boost/lockfree/queue.html @@ -41,35 +41,35 @@ typedef implementation_defined::size_type size_type; // construct/copy/destruct - queue(void); + queue(void); template<typename U> - explicit queue(typename node_allocator::template rebind< U >::other const &); - explicit queue(allocator const &); - explicit queue(size_type); + explicit queue(typename node_allocator::template rebind< U >::other const &); + explicit queue(allocator const &); + explicit queue(size_type); template<typename U> - queue(size_type, + queue(size_type, typename node_allocator::template rebind< U >::other const &); - ~queue(void); + ~queue(void); - // public member functions - bool is_lock_free(void) const; - void reserve(size_type); - void reserve_unsafe(size_type); - bool empty(void) const; - bool push(T const &); - bool bounded_push(T const &); - bool unsynchronized_push(T const &); - bool pop(T &); - template<typename U> bool pop(U &); - bool unsynchronized_pop(T &); - template<typename U> bool unsynchronized_pop(U &); - template<typename Functor> bool consume_one(Functor &); - template<typename Functor> bool consume_one(Functor const &); - template<typename Functor> size_t consume_all(Functor &); - template<typename Functor> size_t consume_all(Functor const &); + // public member functions + bool is_lock_free(void) const; + void reserve(size_type); + void reserve_unsafe(size_type); + bool empty(void) const; + bool push(T const &); + bool bounded_push(T const &); + bool unsynchronized_push(T const &); + bool pop(T &); + template<typename U> bool pop(U &); + bool unsynchronized_pop(T &); + template<typename U> bool unsynchronized_pop(U &); + template<typename Functor> bool consume_one(Functor &); + template<typename Functor> bool consume_one(Functor const &); + template<typename Functor> size_t consume_all(Functor &); + template<typename Functor> size_t consume_all(Functor const &); };
    -

    Description

    +

    Description

    The queue class provides a multi-writer/multi-reader queue, pushing and popping is lock-free, construction/destruction has to be synchronized. It uses a freelist for memory management, freed nodes are pushed to the freelist and not returned to the OS before the queue is destroyed.

    Policies:

      @@ -93,33 +93,33 @@

      -

      +

      queue public construct/copy/destruct

      1. -
        queue(void);
        Construct queue.
        2. +
        queue(void);
        Construct queue. 
      2. template<typename U> 
-  explicit queue(typename node_allocator::template rebind< U >::other const & alloc);
        3. -
      3. explicit queue(allocator const & alloc);
        4. + explicit queue(typename node_allocator::template rebind< U >::other const & alloc); +
      4. explicit queue(allocator const & alloc);
      5. -
        explicit queue(size_type n);
        Construct queue, allocate n nodes for the freelist.
        6. +
        explicit queue(size_type n);
        Construct queue, allocate n nodes for the freelist. 
      6. template<typename U> 
-  queue(size_type n, 
+  queue(size_type n, 
         typename node_allocator::template rebind< U >::other const & alloc);
      7. -
        ~queue(void);
        +
        ~queue(void);

        Destroys queue, free all nodes from freelist.

      -

      -queue public member functions

      +

      +queue public member functions

      1. -
        bool is_lock_free(void) const;
        +
        bool is_lock_free(void) const;

        @@ -142,10 +142,10 @@
        2. -
      2. void reserve(size_type n);
        3. -
      3. void reserve_unsafe(size_type n);
        4. +
      4. void reserve(size_type n);
        5. +
      5. void reserve_unsafe(size_type n);
      6. -
        bool empty(void) const;
        +
        bool empty(void) const;

        Check if the queue is empty

        @@ -170,7 +170,7 @@
    • -
      bool push(T const & t);
      +
      bool push(T const & t);

      Pushes object t to the queue.

      @@ -202,7 +202,7 @@

    • -
      bool bounded_push(T const & t);
      +
      bool bounded_push(T const & t);

      Pushes object t to the queue.

      @@ -239,7 +239,7 @@

  • -
    bool unsynchronized_push(T const & t);
    +
    bool unsynchronized_push(T const & t);

    Pushes object t to the queue.

    @@ -276,7 +276,7 @@

  • -
    bool pop(T & ret);
    +
    bool pop(T & ret);

    Pops object from queue.

    @@ -308,7 +308,7 @@

  • -
    template<typename U> bool pop(U & ret);
    +
    template<typename U> bool pop(U & ret);

    Pops object from queue.

    @@ -345,7 +345,7 @@

  • -
    bool unsynchronized_pop(T & ret);
    +
    bool unsynchronized_pop(T & ret);

    Pops object from queue.

    @@ -377,7 +377,7 @@

  • -
    template<typename U> bool unsynchronized_pop(U & ret);
    +
    template<typename U> bool unsynchronized_pop(U & ret);

    Pops object from queue.

    @@ -414,7 +414,7 @@

  • -
    template<typename Functor> bool consume_one(Functor & f);
    +
    template<typename Functor> bool consume_one(Functor & f);

    consumes one element via a functor

    pops one element from the queue and applies the functor on this object

    @@ -440,7 +440,7 @@

  • -
    template<typename Functor> bool consume_one(Functor const & f);
    +
    template<typename Functor> bool consume_one(Functor const & f);

    consumes one element via a functor

    pops one element from the queue and applies the functor on this object

    @@ -466,7 +466,7 @@

  • -
    template<typename Functor> size_t consume_all(Functor & f);
    +
    template<typename Functor> size_t consume_all(Functor & f);

    consumes all elements via a functor

    sequentially pops all elements from the queue and applies the functor on each object

    @@ -492,7 +492,7 @@

  • -
    template<typename Functor> size_t consume_all(Functor const & f);
    +
    template<typename Functor> size_t consume_all(Functor const & f);

    consumes all elements via a functor

    sequentially pops all elements from the queue and applies the functor on each object

    diff --git a/doc/html/boost/lockfree/spsc_queue.html b/doc/html/boost/lockfree/spsc_queue.html index acf0af9b0c..bdb4eea933 100644 --- a/doc/html/boost/lockfree/spsc_queue.html +++ b/doc/html/boost/lockfree/spsc_queue.html @@ -41,43 +41,43 @@ typedef implementation_defined::size_type size_type; // construct/copy/destruct - spsc_queue(void); + spsc_queue(void); template<typename U> - explicit spsc_queue(typename allocator::template rebind< U >::other const &); - explicit spsc_queue(allocator const &); - explicit spsc_queue(size_type); + explicit spsc_queue(typename allocator::template rebind< U >::other const &); + explicit spsc_queue(allocator const &); + explicit spsc_queue(size_type); template<typename U> - spsc_queue(size_type, + spsc_queue(size_type, typename allocator::template rebind< U >::other const &); - spsc_queue(size_type, allocator_arg const &); + spsc_queue(size_type, allocator_arg const &); - // public member functions - bool push(T const &); - bool pop(); + // public member functions + bool push(T const &); + bool pop(); template<typename U> boost::enable_if< typename is_convertible< T, U >::type, bool >::type - pop(U &); - size_type push(T const *, size_type); - template<size_type size> size_type push(T const (&)); + pop(U &); + size_type push(T const *, size_type); + template<size_type size> size_type push(T const (&)); template<typename ConstIterator> - ConstIterator push(ConstIterator, ConstIterator); - size_type pop(T *, size_type); - template<size_type size> size_type pop(T(&)); + ConstIterator push(ConstIterator, ConstIterator); + size_type pop(T *, size_type); + template<size_type size> size_type pop(T(&)); template<typename OutputIterator> boost::disable_if< typename is_convertible< T, OutputIterator >::type, size_type >::type - pop(OutputIterator); - template<typename Functor> bool consume_one(Functor &); - template<typename Functor> bool consume_one(Functor const &); - template<typename Functor> size_type consume_all(Functor &); - template<typename Functor> size_type consume_all(Functor const &); - size_type read_available() const; - size_type write_available() const; - const T & front() const; - T & front(); - void reset(void); + pop(OutputIterator); + template<typename Functor> bool consume_one(Functor &); + template<typename Functor> bool consume_one(Functor const &); + template<typename Functor> size_type consume_all(Functor &); + template<typename Functor> size_type consume_all(Functor const &); + size_type read_available() const; + size_type write_available() const; + const T & front() const; + T & front(); + void reset(void); };

    • -

    Description

    +

    Description

    The spsc_queue class provides a single-writer/single-reader fifo queue, pushing and popping is wait-free.

    Policies:

      @@ -96,13 +96,13 @@

      -

      +

      spsc_queue public construct/copy/destruct

      1. -
        spsc_queue(void);
        +
        spsc_queue(void);

        Constructs a spsc_queue

        @@ -118,10 +118,10 @@ 
    • template<typename U> 
-  explicit spsc_queue(typename allocator::template rebind< U >::other const & alloc);
      • -
    • explicit spsc_queue(allocator const & alloc);
      • + explicit spsc_queue(typename allocator::template rebind< U >::other const &); +
    • explicit spsc_queue(allocator const &);
    • -
      explicit spsc_queue(size_type element_count);
      +
      explicit spsc_queue(size_type element_count);

      Constructs a spsc_queue for element_count elements

      @@ -137,17 +137,17 @@ 
    • template<typename U> 
-  spsc_queue(size_type element_count, 
+  spsc_queue(size_type element_count, 
              typename allocator::template rebind< U >::other const & alloc);
      • -
    • spsc_queue(size_type element_count, allocator_arg const & alloc);
      • +
    • spsc_queue(size_type element_count, allocator_arg const & alloc);
    -

    -spsc_queue public member functions

    +

    +spsc_queue public member functions

    1. -
      bool push(T const & t);
      +
      bool push(T const & t);

      Pushes object t to the ringbuffer.

      @@ -184,7 +184,7 @@

  • -
    bool pop();
    +
    bool pop();

    Pops one object from ringbuffer.

    @@ -223,7 +223,7 @@ 

  • template<typename U> 
   boost::enable_if< typename is_convertible< T, U >::type, bool >::type 
-  pop(U & ret);
    + pop(U & ret);

    Pops one object from ringbuffer.

    @@ -260,7 +260,7 @@

  • -
    size_type push(T const * t, size_type size);
    +
    size_type push(T const * t, size_type size);

    Pushes as many objects from the array t as there is space.

    @@ -292,7 +292,7 @@

  • -
    template<size_type size> size_type push(T const (&) t);
    +
    template<size_type size> size_type push(T const (&) t);

    Pushes as many objects from the array t as there is space available.

    @@ -325,7 +325,7 @@ 

  • template<typename ConstIterator> 
-  ConstIterator push(ConstIterator begin, ConstIterator end);
    + ConstIterator push(ConstIterator begin, ConstIterator end);

    Pushes as many objects from the range [begin, end) as there is space .

    @@ -357,7 +357,7 @@

  • -
    size_type pop(T * ret, size_type size);
    +
    size_type pop(T * ret, size_type size);

    Pops a maximum of size objects from ringbuffer.

    @@ -389,7 +389,7 @@

  • -
    template<size_type size> size_type pop(T(&) ret);
    +
    template<size_type size> size_type pop(T(&) ret);

    Pops a maximum of size objects from spsc_queue.

    @@ -423,7 +423,7 @@ 

  • template<typename OutputIterator> 
   boost::disable_if< typename is_convertible< T, OutputIterator >::type, size_type >::type 
-  pop(OutputIterator it);
    + pop(OutputIterator it);

    Pops objects to the output iterator it

    @@ -455,7 +455,7 @@

  • -
    template<typename Functor> bool consume_one(Functor & f);
    +
    template<typename Functor> bool consume_one(Functor & f);

    consumes one element via a functor

    pops one element from the queue and applies the functor on this object

    @@ -481,7 +481,7 @@

  • -
    template<typename Functor> bool consume_one(Functor const & f);
    +
    template<typename Functor> bool consume_one(Functor const & f);

    consumes one element via a functor

    pops one element from the queue and applies the functor on this object

    @@ -507,7 +507,7 @@

  • -
    template<typename Functor> size_type consume_all(Functor & f);
    +
    template<typename Functor> size_type consume_all(Functor & f);

    consumes all elements via a functor

    sequentially pops all elements from the queue and applies the functor on each object

    @@ -533,7 +533,7 @@

  • -
    template<typename Functor> size_type consume_all(Functor const & f);
    +
    template<typename Functor> size_type consume_all(Functor const & f);

    consumes all elements via a functor

    sequentially pops all elements from the queue and applies the functor on each object

    @@ -559,7 +559,7 @@

  • -
    size_type read_available() const;
    +
    size_type read_available() const;

    get number of elements that are available for read

    @@ -584,7 +584,7 @@
  • -
    size_type write_available() const;
    +
    size_type write_available() const;

    get write space to write elements

    @@ -609,7 +609,7 @@
  • -
    const T & front() const;
    +
    const T & front() const;

    get reference to element in the front of the queue

    Availability of front element can be checked using read_available().

    @@ -647,7 +647,7 @@

  • -
    T & front();
    +
    T & front();

    get reference to element in the front of the queue

    Availability of front element can be checked using read_available().

    @@ -685,7 +685,7 @@

  • -
    void reset(void);
    +
    void reset(void);

    reset the ringbuffer

    diff --git a/doc/html/boost/lockfree/stack.html b/doc/html/boost/lockfree/stack.html index 908a98c381..f90779e43e 100644 --- a/doc/html/boost/lockfree/stack.html +++ b/doc/html/boost/lockfree/stack.html @@ -50,63 +50,63 @@ typedefunspecifiedhandle_t;// construct/copy/destruct - node(Tconst&); + node(Tconst&);// public data membershandle_tnext;constTv;};// construct/copy/destruct - stack(void); + stack(void);template<typename U> - explicitstack(typenamenode_allocator::templaterebind<U>::otherconst&); - explicitstack(allocatorconst&); - explicitstack(size_type); + explicitstack(typenamenode_allocator::templaterebind<U>::otherconst&); + explicitstack(allocatorconst&); + explicitstack(size_type);template<typename U> - stack(size_type, + stack(size_type,typenamenode_allocator::templaterebind<U>::otherconst&); - ~stack(void); + ~stack(void); - // private member functions - BOOST_STATIC_ASSERT(boost::has_trivial_assign<T>::value); - BOOST_STATIC_ASSERT(boost::has_trivial_destructor<T>::value); - BOOST_STATIC_ASSERT((mpl::if_c<has_capacity,mpl::bool_<capacity-1<boost::integer_traits<boost::uint16_t>::const_max>,mpl::true_>::type::value)); - BOOST_DELETED_FUNCTION(stack(stackconst&)); - boolis_lock_free(void)const; - voidreserve(size_type); - voidreserve_unsafe(size_type); - voidinitialize(void); - voidlink_nodes_atomic(node*,node*); - voidlink_nodes_unsafe(node*,node*); + // private member functions + BOOST_STATIC_ASSERT(boost::has_trivial_assign<T>::value); + BOOST_STATIC_ASSERT(boost::has_trivial_destructor<T>::value); + BOOST_STATIC_ASSERT((mpl::if_c<has_capacity,mpl::bool_<capacity-1<boost::integer_traits<boost::uint16_t>::const_max>,mpl::true_>::type::value)); + BOOST_DELETED_FUNCTION(stack(stackconst&)); + boolis_lock_free(void)const; + voidreserve(size_type); + voidreserve_unsafe(size_type); + voidinitialize(void); + voidlink_nodes_atomic(node*,node*); + voidlink_nodes_unsafe(node*,node*);template<bool Threadsafe,bool Bounded,typename ConstIterator>tuple<node*,node*> - prepare_node_list(ConstIterator,ConstIterator,ConstIterator&); - template<bool Bounded>booldo_push(Tconst&); + prepare_node_list(ConstIterator,ConstIterator,ConstIterator&); + template<bool Bounded>booldo_push(Tconst&);template<bool Bounded,typename ConstIterator> - ConstIteratordo_push(ConstIterator,ConstIterator); + ConstIteratordo_push(ConstIterator,ConstIterator); - // public member functions - boolpush(Tconst&); - boolbounded_push(Tconst&); + // public member functions + boolpush(Tconst&); + boolbounded_push(Tconst&);template<typename ConstIterator> - ConstIteratorpush(ConstIterator,ConstIterator); + ConstIteratorpush(ConstIterator,ConstIterator);template<typename ConstIterator> - ConstIteratorbounded_push(ConstIterator,ConstIterator); - boolunsynchronized_push(Tconst&); + ConstIteratorbounded_push(ConstIterator,ConstIterator); + boolunsynchronized_push(Tconst&);template<typename ConstIterator> - ConstIteratorunsynchronized_push(ConstIterator,ConstIterator); - boolpop(T&); - template<typename U>boolpop(U&); - boolunsynchronized_pop(T&); - template<typename U>boolunsynchronized_pop(U&); - template<typename Functor>boolconsume_one(Functor&); - template<typename Functor>boolconsume_one(Functorconst&); - template<typename Functor>size_tconsume_all(Functor&); - template<typename Functor>size_tconsume_all(Functorconst&); - boolempty(void)const; + ConstIteratorunsynchronized_push(ConstIterator,ConstIterator); + boolpop(T&); + template<typename U>boolpop(U&); + boolunsynchronized_pop(T&); + template<typename U>boolunsynchronized_pop(U&); + template<typename Functor>boolconsume_one(Functor&); + template<typename Functor>boolconsume_one(Functorconst&); + template<typename Functor>size_tconsume_all(Functor&); + template<typename Functor>size_tconsume_all(Functorconst&); + boolempty(void)const;};
    -

    Description

    +

    Description

    The stack class provides a multi-writer/multi-reader stack, pushing and popping is lock-free, construction/destruction has to be synchronized. It uses a freelist for memory management, freed nodes are pushed to the freelist and not returned to the OS before the stack is destroyed.

    Policies:

      @@ -126,23 +126,23 @@

      -

      +

      stack public construct/copy/destruct

      1. -
        stack(void);
        Construct stack.
        2. +
        stack(void);
        Construct stack. 
      2. template<typename U> 
-  explicit stack(typename node_allocator::template rebind< U >::other const & alloc);
        3. -
      3. explicit stack(allocator const & alloc);
        4. + explicit stack(typename node_allocator::template rebind< U >::other const & alloc); +
      4. explicit stack(allocator const & alloc);
      5. -
        explicit stack(size_type n);
        Construct stack, allocate n nodes for the freelist.
        6. +
        explicit stack(size_type n);
        Construct stack, allocate n nodes for the freelist. 
      6. template<typename U> 
-  stack(size_type n, 
+  stack(size_type n, 
         typename node_allocator::template rebind< U >::other const & alloc);
      7. -
        ~stack(void);
        +
        ~stack(void);

        Destroys stack, free all nodes from freelist.

    @@ -157,15 +157,15 @@
    -

    -stack private member functions

    +

    +stack private member functions

      -
    1.  BOOST_STATIC_ASSERT(boost::has_trivial_assign< T >::value);
      2. -
    2.  BOOST_STATIC_ASSERT(boost::has_trivial_destructor< T >::value);
      3. -
    3.  BOOST_STATIC_ASSERT((mpl::if_c< has_capacity, mpl::bool_< capacity-1< boost::integer_traits< boost::uint16_t >::const_max >, mpl::true_ >::type::value));
      4. -
    4.  BOOST_DELETED_FUNCTION(stack(stack const &));
      5. +
    5.  BOOST_STATIC_ASSERT(boost::has_trivial_assign< T >::value);
      6. +
    6.  BOOST_STATIC_ASSERT(boost::has_trivial_destructor< T >::value);
      7. +
    7.  BOOST_STATIC_ASSERT((mpl::if_c< has_capacity, mpl::bool_< capacity-1< boost::integer_traits< boost::uint16_t >::const_max >, mpl::true_ >::type::value));
      8. +
    8.  BOOST_DELETED_FUNCTION(stack(stack const &));
    9. -
      bool is_lock_free(void) const;
      +
      bool is_lock_free(void) const;

    @@ -189,7 +189,7 @@
  • -
    void reserve(size_type n);
    +
    void reserve(size_type n);

    Allocate n nodes for freelist

    @@ -214,7 +214,7 @@
  • -
    void reserve_unsafe(size_type n);
    +
    void reserve_unsafe(size_type n);

    Allocate n nodes for freelist

    @@ -238,24 +238,24 @@
    • -
  • void initialize(void);
    • -
  • void link_nodes_atomic(node * new_top_node, node * end_node);
    • -
  • void link_nodes_unsafe(node * new_top_node, node * end_node);
    • +
  • void initialize(void);
    • +
  • void link_nodes_atomic(node * new_top_node, node * end_node);
    • +
  • void link_nodes_unsafe(node * new_top_node, node * end_node);
  • template<bool Threadsafe, bool Bounded, typename ConstIterator> 
   tuple< node *, node * > 
-  prepare_node_list(ConstIterator begin, ConstIterator end, 
+  prepare_node_list(ConstIterator begin, ConstIterator end, 
                     ConstIterator & ret);
    • -
  • template<bool Bounded> bool do_push(T const & v);
    • +
  • template<bool Bounded> bool do_push(T const & v);
  • template<bool Bounded, typename ConstIterator> 
-  ConstIterator do_push(ConstIterator begin, ConstIterator end);
    • + ConstIterator do_push(ConstIterator begin, ConstIterator end);
    -

    -stack public member functions

    +

    +stack public member functions

    1. -
      bool push(T const & v);
      +
      bool push(T const & v);

      Pushes object t to the stack.

      @@ -292,7 +292,7 @@

  • -
    bool bounded_push(T const & v);
    +
    bool bounded_push(T const & v);

    Pushes object t to the stack.

    @@ -325,7 +325,7 @@ 

  • template<typename ConstIterator> 
-  ConstIterator push(ConstIterator begin, ConstIterator end);
    + ConstIterator push(ConstIterator begin, ConstIterator end);

    Pushes as many objects from the range [begin, end) as freelist node can be allocated.

    @@ -367,7 +367,7 @@ 
  • template<typename ConstIterator> 
-  ConstIterator bounded_push(ConstIterator begin, ConstIterator end);
    + ConstIterator bounded_push(ConstIterator begin, ConstIterator end);

    Pushes as many objects from the range [begin, end) as freelist node can be allocated.

    @@ -408,7 +408,7 @@
  • -
    bool unsynchronized_push(T const & v);
    +
    bool unsynchronized_push(T const & v);

    Pushes object t to the stack.

    @@ -446,7 +446,7 @@ 

  • template<typename ConstIterator> 
-  ConstIterator unsynchronized_push(ConstIterator begin, ConstIterator end);
    + ConstIterator unsynchronized_push(ConstIterator begin, ConstIterator end);

    Pushes as many objects from the range [begin, end) as freelist node can be allocated.

    @@ -478,7 +478,7 @@
  • -
    bool pop(T & ret);
    +
    bool pop(T & ret);

    Pops object from stack.

    @@ -510,7 +510,7 @@

  • -
    template<typename U> bool pop(U & ret);
    +
    template<typename U> bool pop(U & ret);

    Pops object from stack.

    @@ -547,7 +547,7 @@

  • -
    bool unsynchronized_pop(T & ret);
    +
    bool unsynchronized_pop(T & ret);

    Pops object from stack.

    @@ -579,7 +579,7 @@

  • -
    template<typename U> bool unsynchronized_pop(U & ret);
    +
    template<typename U> bool unsynchronized_pop(U & ret);

    Pops object from stack.

    @@ -616,7 +616,7 @@

  • -
    template<typename Functor> bool consume_one(Functor & f);
    +
    template<typename Functor> bool consume_one(Functor & f);

    consumes one element via a functor

    pops one element from the stack and applies the functor on this object

    @@ -642,7 +642,7 @@

  • -
    template<typename Functor> bool consume_one(Functor const & f);
    +
    template<typename Functor> bool consume_one(Functor const & f);

    consumes one element via a functor

    pops one element from the stack and applies the functor on this object

    @@ -668,7 +668,7 @@

  • -
    template<typename Functor> size_t consume_all(Functor & f);
    +
    template<typename Functor> size_t consume_all(Functor & f);

    consumes all elements via a functor

    sequentially pops all elements from the stack and applies the functor on each object

    @@ -694,7 +694,7 @@

  • -
    template<typename Functor> size_t consume_all(Functor const & f);
    +
    template<typename Functor> size_t consume_all(Functor const & f);

    consumes all elements via a functor

    sequentially pops all elements from the stack and applies the functor on each object

    @@ -720,7 +720,7 @@

  • -
    bool empty(void) const;
    +
    bool empty(void) const;

    diff --git a/doc/html/boost/lockfree/stack/implementation_defined.html b/doc/html/boost/lockfree/stack/implementation_defined.html index 4d14afca15..f7ac0b407a 100644 --- a/doc/html/boost/lockfree/stack/implementation_defined.html +++ b/doc/html/boost/lockfree/stack/implementation_defined.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -51,7 +51,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/lockfree/stack/node.html b/doc/html/boost/lockfree/stack/node.html index 0eaa472848..b0d4ab4077 100644 --- a/doc/html/boost/lockfree/stack/node.html +++ b/doc/html/boost/lockfree/stack/node.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -39,20 +39,20 @@ typedef unspecified handle_t; // construct/copy/destruct - node(T const &); + node(T const &); // public data members handle_t next; const T v; };
    -

    Description

    +

    Description

    -

    +

    node public construct/copy/destruct

    -
    1. node(T const & val);
    +
    1. node(T const & val);
    @@ -67,7 +67,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/logic/get_defa_idm45507104701424.html b/doc/html/boost/logic/get_defa_idm45507104701424.html new file mode 100644 index 0000000000..d03d1ea040 --- /dev/null +++ b/doc/html/boost/logic/get_defa_idm45507104701424.html @@ -0,0 +1,54 @@ + + + + +Function template get_default_indeterminate_name + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template get_default_indeterminate_name

    +

    boost::logic::get_default_indeterminate_name — Returns a string containing the default name for the indeterminate value of a tribool with the given character type T.

    +
    +

    Synopsis

    +
    // In header: <boost/logic/tribool_io.hpp>
+
+
+template<typename T> std::basic_string< T > get_default_indeterminate_name();
    +
    +

    Description

    +

    This routine is used by the input and output streaming operators for tribool when there is no locale support or the stream's locale does not contain the indeterminate_name facet.

    +
    +
    + + + +
    Copyright © 2002-2004 Douglas Gregor

    Use, modification and distribution is subject to the Boost + Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/logic/get_default_i_idp154719632.html b/doc/html/boost/logic/get_default_i_idp154719632.html deleted file mode 100644 index dc236a844c..0000000000 --- a/doc/html/boost/logic/get_default_i_idp154719632.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Function template get_default_indeterminate_name - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template get_default_indeterminate_name

    -

    boost::logic::get_default_indeterminate_name — Returns a string containing the default name for the indeterminate value of a tribool with the given character type T.

    -
    -

    Synopsis

    -
    // In header: <boost/logic/tribool_io.hpp>
-
-
-template<typename T> std::basic_string< T > get_default_indeterminate_name();
    -
    -

    Description

    -

    This routine is used by the input and output streaming operators for tribool when there is no locale support or the stream's locale does not contain the indeterminate_name facet.

    -
    -
    - - - -
    Copyright © 2002-2004 Douglas Gregor

    Use, modification and distribution is subject to the Boost - Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/logic/indeterminate.html b/doc/html/boost/logic/indeterminate.html index 735ef9a842..948015a9ee 100644 --- a/doc/html/boost/logic/indeterminate.html +++ b/doc/html/boost/logic/indeterminate.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -35,7 +35,7 @@ BOOST_CONSTEXPR bool indeterminate(tribool x, unspecified dummy = unspecified);
    -

    Description

    +

    Description

    The indeterminate function has a dual role. It's first role is as a unary function that tells whether the tribool value is in the "indeterminate" state. It's second role is as a keyword representing the indeterminate (just like "true" and "false" represent the true and false states). If you do not like the name "indeterminate", and would prefer to use a different name, see the macro BOOST_TRIBOOL_THIRD_STATE.

    @@ -67,7 +67,7 @@

    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/logic/indeterminate_name.html b/doc/html/boost/logic/indeterminate_name.html index 1aebc243bc..a18ae4b880 100644 --- a/doc/html/boost/logic/indeterminate_name.html +++ b/doc/html/boost/logic/indeterminate_name.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -40,35 +40,35 @@ typedef std::basic_string< CharT > string_type; // construct/copy/destruct - indeterminate_name(); - explicit indeterminate_name(const string_type &); + indeterminate_name(); + explicit indeterminate_name(const string_type &); - // public member functions - string_type name() const; + // public member functions + string_type name() const; // public data members static std::locale::id id; // Uniquily identifies this facet with the locale. };
    -

    Description

    +

    Description

    The facet is used to perform I/O on tribool values when std::boolalpha has been specified. This class template is only available if the C++ standard library implementation supports locales.

    -

    +

    indeterminate_name public construct/copy/destruct

    1. -
      indeterminate_name();
      Construct the facet with the default name.
      2. +
      indeterminate_name();
      Construct the facet with the default name.
    2. -
      explicit indeterminate_name(const string_type & initial_name);
      Construct the facet with the given name for the indeterminate value.
      3. +
      explicit indeterminate_name(const string_type & initial_name);
      Construct the facet with the given name for the indeterminate value.
    -

    -indeterminate_name public member functions

    +

    +indeterminate_name public member functions

    1. -
      string_type name() const;
      Returns the name for the indeterminate value.
    +
    string_type name() const;
    Returns the name for the indeterminate value.
    • @@ -81,7 +81,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/logic/operator___idp38768448.html b/doc/html/boost/logic/operator___idp38768448.html deleted file mode 100644 index daa34d0b9a..0000000000 --- a/doc/html/boost/logic/operator___idp38768448.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - -Function operator!= - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function operator!=

    -

    boost::logic::operator!= — Compare tribools for inequality.

    -
    -

    Synopsis

    -
    // In header: <boost/logic/tribool.hpp>
-
-
-BOOST_CONSTEXPR tribool operator!=(tribool x, tribool y);
-BOOST_CONSTEXPR tribool operator!=(tribool x, bool y);
-BOOST_CONSTEXPR tribool operator!=(bool x, tribool y);
-BOOST_CONSTEXPR tribool operator!=(indeterminate_keyword_t, tribool x);
-BOOST_CONSTEXPR tribool operator!=(tribool x, indeterminate_keyword_t);
    -
    -

    Description

    -

    - -

    -
    ---- - - - - - - - - - - -

    Returns:

    		 -

    the result of comparing two tribool values for inequality, according to the following table:

    -
    ------ - - - - - - - - - - - - - - - - - - - - - - - - - - -
    !=falsetrueindeterminate
    falsefalsetrueindeterminate
    truetruefalseindeterminate
    indeterminateindeterminateindeterminateindeterminate
    -

    -

    -

    Throws:

    		Will not throw.
    -
    -
    - - - -
    Copyright © 2002-2004 Douglas Gregor

    Use, modification and distribution is subject to the Boost - Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/logic/operator___idp51294368.html b/doc/html/boost/logic/operator___idp51294368.html deleted file mode 100644 index 032b0bdfe3..0000000000 --- a/doc/html/boost/logic/operator___idp51294368.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - -Function operator&& - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function operator&&

    -

    boost::logic::operator&& — Computes the logical conjuction of two tribools.

    -
    -

    Synopsis

    -
    // In header: <boost/logic/tribool.hpp>
-
-
-BOOST_CONSTEXPR tribool operator&&(tribool x, tribool y);
-BOOST_CONSTEXPR tribool operator&&(tribool x, bool y);
-BOOST_CONSTEXPR tribool operator&&(bool x, tribool y);
-BOOST_CONSTEXPR tribool operator&&(indeterminate_keyword_t, tribool x);
-BOOST_CONSTEXPR tribool operator&&(tribool x, indeterminate_keyword_t);
    -
    -

    Description

    -

    - -

    -
    ---- - - - - - - - - - - -

    Returns:

    		 -

    the result of logically ANDing the two tribool values, according to the following table:

    -
    ------ - - - - - - - - - - - - - - - - - - - - - - - - - - -
    &&falsetrueindeterminate
    falsefalsefalsefalse
    truefalsetrueindeterminate
    indeterminatefalseindeterminateindeterminate
    -

    -

    -

    Throws:

    		Will not throw.
    -
    -
    - - - -
    Copyright © 2002-2004 Douglas Gregor

    Use, modification and distribution is subject to the Boost - Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/logic/operator___idp96741552.html b/doc/html/boost/logic/operator___idp96741552.html deleted file mode 100644 index 947180269e..0000000000 --- a/doc/html/boost/logic/operator___idp96741552.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - -Function operator== - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function operator==

    -

    boost::logic::operator== — Compare tribools for equality.

    -
    -

    Synopsis

    -
    // In header: <boost/logic/tribool.hpp>
-
-
-BOOST_CONSTEXPR tribool operator==(tribool x, tribool y);
-BOOST_CONSTEXPR tribool operator==(tribool x, bool y);
-BOOST_CONSTEXPR tribool operator==(bool x, tribool y);
-BOOST_CONSTEXPR tribool operator==(indeterminate_keyword_t, tribool x);
-BOOST_CONSTEXPR tribool operator==(tribool x, indeterminate_keyword_t);
    -
    -

    Description

    -

    - -

    -
    ---- - - - - - - - - - - -

    Returns:

    		 -

    the result of comparing two tribool values, according to the following table:

    -
    ------ - - - - - - - - - - - - - - - - - - - - - - - - - - -
    ==falsetrueindeterminate
    falsetruefalseindeterminate
    truefalsetrueindeterminate
    indeterminateindeterminateindeterminateindeterminate
    -

    -

    -

    Throws:

    		Will not throw.
    -
    -
    - - - -
    Copyright © 2002-2004 Douglas Gregor

    Use, modification and distribution is subject to the Boost - Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/logic/operator__idp45706720.html b/doc/html/boost/logic/operator__idp45706720.html deleted file mode 100644 index fda5672731..0000000000 --- a/doc/html/boost/logic/operator__idp45706720.html +++ /dev/null @@ -1,100 +0,0 @@ - - - - -Function operator! - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function operator!

    -

    boost::logic::operator! — Computes the logical negation of a tribool.

    -
    -

    Synopsis

    -
    // In header: <boost/logic/tribool.hpp>
-
-
-BOOST_CONSTEXPR tribool operator!(tribool x);
    -
    -

    Description

    -

    - -

    -
    ---- - - - - - - - - - - -

    Returns:

    		 -

    the logical negation of the tribool, according to the table:

    -
    ---- - - - - - - - - - - - - - - - - - - -
    !
    falsetrue
    truefalse
    indeterminateindeterminate
    -

    -

    -

    Throws:

    		Will not throw.
    -
    -
    - - - -
    Copyright © 2002-2004 Douglas Gregor

    Use, modification and distribution is subject to the Boost - Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/logic/operator_idm45506983089584.html b/doc/html/boost/logic/operator_idm45506983089584.html new file mode 100644 index 0000000000..487c603e35 --- /dev/null +++ b/doc/html/boost/logic/operator_idm45506983089584.html @@ -0,0 +1,69 @@ + + + + +Function template operator>> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator>>

    +

    boost::logic::operator>> — Reads a tribool value from a stream.

    +
    +

    Synopsis

    +
    // In header: <boost/logic/tribool_io.hpp>
+
+
+template<typename CharT, typename Traits> 
+  std::basic_istream< CharT, Traits > & 
+  operator>>(std::basic_istream< CharT, Traits > & in, tribool & x);
    +
    +

    Description

    +

    When (out.flags() & std::ios_base::boolalpha) == 0, this function reads a long value from the input stream in and converts that value to a tribool. If that value is 0, x becomes false; if it is 1, x becomes true; if it is 2, becomes indetermine; otherwise, the operation fails (and the fail bit is set on the input stream in).

    +

    When (out.flags() & std::ios_base::boolalpha) != 0, this function first determines the names of the false, true, and indeterminate values. The false and true names are extracted from the std::numpunct facet of the input stream's locale (if the C++ standard library implementation supports locales), or from the default_false_name and default_true_name functions (if there is no locale support). The indeterminate name is extracted from the appropriate indeterminate_name facet (if it is available in the input stream's locale), or from the get_default_indeterminate_name function (if the C++ standard library implementation does not support locales, or the indeterminate_name facet is not specified for this locale object). The input is then matched to each of these names, and the tribool x is assigned the value corresponding to the longest name that matched. If no name is matched or all names are empty, the operation fails (and the fail bit is set on the input stream in).

    +

    +

    +
    ++++ + + + + +

    Returns:

    in

    +
    +
    + + + +
    Copyright © 2002-2004 Douglas Gregor

    Use, modification and distribution is subject to the Boost + Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/logic/operator_idm45506993963376.html b/doc/html/boost/logic/operator_idm45506993963376.html new file mode 100644 index 0000000000..527497b4b0 --- /dev/null +++ b/doc/html/boost/logic/operator_idm45506993963376.html @@ -0,0 +1,114 @@ + + + + +Function operator|| + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function operator||

    +

    boost::logic::operator|| — Computes the logical disjunction of two tribools.

    +
    +

    Synopsis

    +
    // In header: <boost/logic/tribool.hpp>
+
+
+BOOST_CONSTEXPR tribool operator||(tribool x, tribool y);
+BOOST_CONSTEXPR tribool operator||(tribool x, bool y);
+BOOST_CONSTEXPR tribool operator||(bool x, tribool y);
+BOOST_CONSTEXPR tribool operator||(indeterminate_keyword_t, tribool x);
+BOOST_CONSTEXPR tribool operator||(tribool x, indeterminate_keyword_t);
    +
    +

    Description

    +

    + +

    +
    ++++ + + + + + + + + + + +

    Returns:

    		 +

    the result of logically ORing the two tribool values, according to the following table:

    +
    ++++++ + + + + + + + + + + + + + + + + + + + + + + + + + + +
    ||falsetrueindeterminate
    falsefalsetrueindeterminate
    truetruetruetrue
    indeterminateindeterminatetrueindeterminate
    +

    +

    +

    Throws:

    		Will not throw.
    +
    +
    + + + +
    Copyright © 2002-2004 Douglas Gregor

    Use, modification and distribution is subject to the Boost + Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/logic/operator_idm45507041012704.html b/doc/html/boost/logic/operator_idm45507041012704.html new file mode 100644 index 0000000000..b605c48122 --- /dev/null +++ b/doc/html/boost/logic/operator_idm45507041012704.html @@ -0,0 +1,71 @@ + + + + +Function template operator<< + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator<<

    +

    boost::logic::operator<< — Writes the value of a tribool to a stream.

    +
    +

    Synopsis

    +
    // In header: <boost/logic/tribool_io.hpp>
+
+
+template<typename CharT, typename Traits> 
+  std::basic_ostream< CharT, Traits > & 
+  operator<<(std::basic_ostream< CharT, Traits > & out, tribool x);
    +
    +

    Description

    +

    When the value of x is either true or false, this routine is semantically equivalent to:

    +
    out << static_cast<bool>(x); 
+
    +

    When x has an indeterminate value, it outputs either the integer value 2 (if (out.flags() & std::ios_base::boolalpha) == 0) or the name of the indeterminate value. The name of the indeterminate value comes from the indeterminate_name facet (if it is defined in the output stream's locale), or from the get_default_indeterminate_name function (if it is not defined in the locale or if the C++ standard library implementation does not support locales).

    +

    +

    +
    ++++ + + + + +

    Returns:

    out

    +
    +
    + + + +
    Copyright © 2002-2004 Douglas Gregor

    Use, modification and distribution is subject to the Boost + Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/logic/operator_idm45507048922256.html b/doc/html/boost/logic/operator_idm45507048922256.html new file mode 100644 index 0000000000..ca30d457cd --- /dev/null +++ b/doc/html/boost/logic/operator_idm45507048922256.html @@ -0,0 +1,68 @@ + + + + +Function template operator<< + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator<<

    +

    boost::logic::operator<< — Writes the indeterminate tribool value to a stream.

    +
    +

    Synopsis

    +
    // In header: <boost/logic/tribool_io.hpp>
+
+
+template<typename CharT, typename Traits> 
+  std::basic_ostream< CharT, Traits > & 
+  operator<<(std::basic_ostream< CharT, Traits > & out, unspecified);
    +
    +

    Description

    +

    This routine outputs either the integer value 2 (if (out.flags() & std::ios_base::boolalpha) == 0) or the name of the indeterminate value. The name of the indeterminate value comes from the indeterminate_name facet (if it is defined in the output stream's locale), or from the get_default_indeterminate_name function (if it is not defined in the locale or if the C++ standard library implementation does not support locales).

    +

    +

    +
    ++++ + + + + +

    Returns:

    out

    +
    +
    + + + +
    Copyright © 2002-2004 Douglas Gregor

    Use, modification and distribution is subject to the Boost + Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/logic/operator_idm45507093800208.html b/doc/html/boost/logic/operator_idm45507093800208.html new file mode 100644 index 0000000000..57d1fedf01 --- /dev/null +++ b/doc/html/boost/logic/operator_idm45507093800208.html @@ -0,0 +1,114 @@ + + + + +Function operator!= + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function operator!=

    +

    boost::logic::operator!= — Compare tribools for inequality.

    +
    +

    Synopsis

    +
    // In header: <boost/logic/tribool.hpp>
+
+
+BOOST_CONSTEXPR tribool operator!=(tribool x, tribool y);
+BOOST_CONSTEXPR tribool operator!=(tribool x, bool y);
+BOOST_CONSTEXPR tribool operator!=(bool x, tribool y);
+BOOST_CONSTEXPR tribool operator!=(indeterminate_keyword_t, tribool x);
+BOOST_CONSTEXPR tribool operator!=(tribool x, indeterminate_keyword_t);
    +
    +

    Description

    +

    + +

    +
    ++++ + + + + + + + + + + +

    Returns:

    		 +

    the result of comparing two tribool values for inequality, according to the following table:

    +
    ++++++ + + + + + + + + + + + + + + + + + + + + + + + + + + +
    !=falsetrueindeterminate
    falsefalsetrueindeterminate
    truetruefalseindeterminate
    indeterminateindeterminateindeterminateindeterminate
    +

    +

    +

    Throws:

    		Will not throw.
    +
    +
    + + + +
    Copyright © 2002-2004 Douglas Gregor

    Use, modification and distribution is subject to the Boost + Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/logic/operator_idm45507093816016.html b/doc/html/boost/logic/operator_idm45507093816016.html new file mode 100644 index 0000000000..257896e91d --- /dev/null +++ b/doc/html/boost/logic/operator_idm45507093816016.html @@ -0,0 +1,114 @@ + + + + +Function operator== + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function operator==

    +

    boost::logic::operator== — Compare tribools for equality.

    +
    +

    Synopsis

    +
    // In header: <boost/logic/tribool.hpp>
+
+
+BOOST_CONSTEXPR tribool operator==(tribool x, tribool y);
+BOOST_CONSTEXPR tribool operator==(tribool x, bool y);
+BOOST_CONSTEXPR tribool operator==(bool x, tribool y);
+BOOST_CONSTEXPR tribool operator==(indeterminate_keyword_t, tribool x);
+BOOST_CONSTEXPR tribool operator==(tribool x, indeterminate_keyword_t);
    +
    +

    Description

    +

    + +

    +
    ++++ + + + + + + + + + + +

    Returns:

    		 +

    the result of comparing two tribool values, according to the following table:

    +
    ++++++ + + + + + + + + + + + + + + + + + + + + + + + + + + +
    ==falsetrueindeterminate
    falsetruefalseindeterminate
    truefalsetrueindeterminate
    indeterminateindeterminateindeterminateindeterminate
    +

    +

    +

    Throws:

    		Will not throw.
    +
    +
    + + + +
    Copyright © 2002-2004 Douglas Gregor

    Use, modification and distribution is subject to the Boost + Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/logic/operator_idm45507099076384.html b/doc/html/boost/logic/operator_idm45507099076384.html new file mode 100644 index 0000000000..4e4cd2407c --- /dev/null +++ b/doc/html/boost/logic/operator_idm45507099076384.html @@ -0,0 +1,100 @@ + + + + +Function operator! + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function operator!

    +

    boost::logic::operator! — Computes the logical negation of a tribool.

    +
    +

    Synopsis

    +
    // In header: <boost/logic/tribool.hpp>
+
+
+BOOST_CONSTEXPR tribool operator!(tribool x);
    +
    +

    Description

    +

    + +

    +
    ++++ + + + + + + + + + + +

    Returns:

    		 +

    the logical negation of the tribool, according to the table:

    +
    ++++ + + + + + + + + + + + + + + + + + + +
    !
    falsetrue
    truefalse
    indeterminateindeterminate
    +

    +

    +

    Throws:

    		Will not throw.
    +
    +
    + + + +
    Copyright © 2002-2004 Douglas Gregor

    Use, modification and distribution is subject to the Boost + Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/logic/operator_idm45507104075136.html b/doc/html/boost/logic/operator_idm45507104075136.html new file mode 100644 index 0000000000..b5e0454e3f --- /dev/null +++ b/doc/html/boost/logic/operator_idm45507104075136.html @@ -0,0 +1,114 @@ + + + + +Function operator&& + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function operator&&

    +

    boost::logic::operator&& — Computes the logical conjuction of two tribools.

    +
    +

    Synopsis

    +
    // In header: <boost/logic/tribool.hpp>
+
+
+BOOST_CONSTEXPR tribool operator&&(tribool x, tribool y);
+BOOST_CONSTEXPR tribool operator&&(tribool x, bool y);
+BOOST_CONSTEXPR tribool operator&&(bool x, tribool y);
+BOOST_CONSTEXPR tribool operator&&(indeterminate_keyword_t, tribool x);
+BOOST_CONSTEXPR tribool operator&&(tribool x, indeterminate_keyword_t);
    +
    +

    Description

    +

    + +

    +
    ++++ + + + + + + + + + + +

    Returns:

    		 +

    the result of logically ANDing the two tribool values, according to the following table:

    +
    ++++++ + + + + + + + + + + + + + + + + + + + + + + + + + + +
    &&falsetrueindeterminate
    falsefalsefalsefalse
    truefalsetrueindeterminate
    indeterminatefalseindeterminateindeterminate
    +

    +

    +

    Throws:

    		Will not throw.
    +
    +
    + + + +
    Copyright © 2002-2004 Douglas Gregor

    Use, modification and distribution is subject to the Boost + Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/logic/operator_idp104323600.html b/doc/html/boost/logic/operator_idp104323600.html deleted file mode 100644 index cf4146f6f7..0000000000 --- a/doc/html/boost/logic/operator_idp104323600.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - -Function operator|| - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function operator||

    -

    boost::logic::operator|| — Computes the logical disjunction of two tribools.

    -
    -

    Synopsis

    -
    // In header: <boost/logic/tribool.hpp>
-
-
-BOOST_CONSTEXPR tribool operator||(tribool x, tribool y);
-BOOST_CONSTEXPR tribool operator||(tribool x, bool y);
-BOOST_CONSTEXPR tribool operator||(bool x, tribool y);
-BOOST_CONSTEXPR tribool operator||(indeterminate_keyword_t, tribool x);
-BOOST_CONSTEXPR tribool operator||(tribool x, indeterminate_keyword_t);
    -
    -

    Description

    -

    - -

    -
    ---- - - - - - - - - - - -

    Returns:

    		 -

    the result of logically ORing the two tribool values, according to the following table:

    -
    ------ - - - - - - - - - - - - - - - - - - - - - - - - - - -
    ||falsetrueindeterminate
    falsefalsetrueindeterminate
    truetruetruetrue
    indeterminateindeterminatetrueindeterminate
    -

    -

    -

    Throws:

    		Will not throw.
    -
    -
    - - - -
    Copyright © 2002-2004 Douglas Gregor

    Use, modification and distribution is subject to the Boost - Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/logic/operator_idp154599264.html b/doc/html/boost/logic/operator_idp154599264.html deleted file mode 100644 index 85a022c497..0000000000 --- a/doc/html/boost/logic/operator_idp154599264.html +++ /dev/null @@ -1,71 +0,0 @@ - - - - -Function template operator<< - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator<<

    -

    boost::logic::operator<< — Writes the value of a tribool to a stream.

    -
    -

    Synopsis

    -
    // In header: <boost/logic/tribool_io.hpp>
-
-
-template<typename CharT, typename Traits> 
-  std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & out, tribool x);
    -
    -

    Description

    -

    When the value of x is either true or false, this routine is semantically equivalent to:

    -
    out << static_cast<bool>(x); 
-
    -

    When x has an indeterminate value, it outputs either the integer value 2 (if (out.flags() & std::ios_base::boolalpha) == 0) or the name of the indeterminate value. The name of the indeterminate value comes from the indeterminate_name facet (if it is defined in the output stream's locale), or from the get_default_indeterminate_name function (if it is not defined in the locale or if the C++ standard library implementation does not support locales).

    -

    -

    -
    ---- - - - - -

    Returns:

    out

    -
    -
    - - - -
    Copyright © 2002-2004 Douglas Gregor

    Use, modification and distribution is subject to the Boost - Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/logic/operator_idp158797600.html b/doc/html/boost/logic/operator_idp158797600.html deleted file mode 100644 index ded2704e24..0000000000 --- a/doc/html/boost/logic/operator_idp158797600.html +++ /dev/null @@ -1,69 +0,0 @@ - - - - -Function template operator>> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator>>

    -

    boost::logic::operator>> — Reads a tribool value from a stream.

    -
    -

    Synopsis

    -
    // In header: <boost/logic/tribool_io.hpp>
-
-
-template<typename CharT, typename Traits> 
-  std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & in, tribool & x);
    -
    -

    Description

    -

    When (out.flags() & std::ios_base::boolalpha) == 0, this function reads a long value from the input stream in and converts that value to a tribool. If that value is 0, x becomes false; if it is 1, x becomes true; if it is 2, becomes indetermine; otherwise, the operation fails (and the fail bit is set on the input stream in).

    -

    When (out.flags() & std::ios_base::boolalpha) != 0, this function first determines the names of the false, true, and indeterminate values. The false and true names are extracted from the std::numpunct facet of the input stream's locale (if the C++ standard library implementation supports locales), or from the default_false_name and default_true_name functions (if there is no locale support). The indeterminate name is extracted from the appropriate indeterminate_name facet (if it is available in the input stream's locale), or from the get_default_indeterminate_name function (if the C++ standard library implementation does not support locales, or the indeterminate_name facet is not specified for this locale object). The input is then matched to each of these names, and the tribool x is assigned the value corresponding to the longest name that matched. If no name is matched or all names are empty, the operation fails (and the fail bit is set on the input stream in).

    -

    -

    -
    ---- - - - - -

    Returns:

    in

    -
    -
    - - - -
    Copyright © 2002-2004 Douglas Gregor

    Use, modification and distribution is subject to the Boost - Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/logic/operator_idp48877552.html b/doc/html/boost/logic/operator_idp48877552.html deleted file mode 100644 index 01f15f440b..0000000000 --- a/doc/html/boost/logic/operator_idp48877552.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Function template operator<< - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator<<

    -

    boost::logic::operator<< — Writes the indeterminate tribool value to a stream.

    -
    -

    Synopsis

    -
    // In header: <boost/logic/tribool_io.hpp>
-
-
-template<typename CharT, typename Traits> 
-  std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & out, unspecified);
    -
    -

    Description

    -

    This routine outputs either the integer value 2 (if (out.flags() & std::ios_base::boolalpha) == 0) or the name of the indeterminate value. The name of the indeterminate value comes from the indeterminate_name facet (if it is defined in the output stream's locale), or from the get_default_indeterminate_name function (if it is not defined in the locale or if the C++ standard library implementation does not support locales).

    -

    -

    -
    ---- - - - - -

    Returns:

    out

    -
    -
    - - - -
    Copyright © 2002-2004 Douglas Gregor

    Use, modification and distribution is subject to the Boost - Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/logic/tribool.html b/doc/html/boost/logic/tribool.html index b22acb071b..8e32993141 100644 --- a/doc/html/boost/logic/tribool.html +++ b/doc/html/boost/logic/tribool.html @@ -37,27 +37,27 @@ public: enum value_t; // construct/copy/destruct - tribool() noexcept; - tribool(bool) noexcept; - tribool(indeterminate_keyword_t) noexcept; + tribool() noexcept; + tribool(bool) noexcept; + tribool(indeterminate_keyword_t) noexcept; - // public member functions - BOOST_CONSTEXPR operator safe_bool() const noexcept; + // public member functions + BOOST_CONSTEXPR operator safe_bool() const noexcept; // public data members enum boost::logic::tribool::value_t value; };
    -

    Description

    +

    Description

    3-state boolean values are either true, false, or indeterminate.

    -

    +

    tribool public construct/copy/destruct

    1. -
      tribool() noexcept;
      +
      tribool() noexcept;

      Construct a new 3-state boolean value with the value 'false'.

      @@ -73,7 +73,7 @@
  • -
    tribool(bool initial_value) noexcept;
    +
    tribool(bool initial_value) noexcept;

    Construct a new 3-state boolean value with the given boolean value, which may be true or false.

    @@ -89,7 +89,7 @@
  • -
    tribool(indeterminate_keyword_t) noexcept;
    +
    tribool(indeterminate_keyword_t) noexcept;

    Construct a new 3-state boolean value with an indeterminate value.

    @@ -107,10 +107,10 @@
    • -

    -tribool public member functions

    +

    +tribool public member functions

    1. -
      BOOST_CONSTEXPR operator safe_bool() const noexcept;
      +
      BOOST_CONSTEXPR operator safe_bool() const noexcept;

      Use a 3-state boolean in a boolean context. Will evaluate true in a boolean context only when the 3-state boolean is definitely true.

      diff --git a/doc/html/boost/logic/tribool/value_t.html b/doc/html/boost/logic/tribool/value_t.html index 2b9fef75ca..2f0ae3c5d4 100644 --- a/doc/html/boost/logic/tribool/value_t.html +++ b/doc/html/boost/logic/tribool/value_t.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@

      -PrevUpHomeNext +PrevUpHomeNext
      @@ -35,7 +35,7 @@ enum value_t { false_value, true_value, indeterminate_value };
      -

      Description

      +

      Description

      The actual stored value in this 3-state boolean, which may be false, true, or indeterminate.

    @@ -48,7 +48,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/make_move_iterator.html b/doc/html/boost/make_move_iterator.html index f0ffb6c9aa..57ee7f1465 100644 --- a/doc/html/boost/make_move_iterator.html +++ b/doc/html/boost/make_move_iterator.html @@ -35,7 +35,7 @@ template<typename It> move_iterator< It > make_move_iterator(const It & it);
    -

    Description

    +

    Description

    Returns: move_iterator<It>(i).

    diff --git a/doc/html/boost/make_rec_idm45507101497936.html b/doc/html/boost/make_rec_idm45507101497936.html new file mode 100644 index 0000000000..7bc63faf2a --- /dev/null +++ b/doc/html/boost/make_rec_idm45507101497936.html @@ -0,0 +1,76 @@ + + + + +Class template make_recursive_variant_over + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Class template make_recursive_variant_over

    +

    boost::make_recursive_variant_over — Exposes a recursive variant whose bounded types + are the elements of the given type sequence.

    +
    +

    Synopsis

    +
    // In header: <boost/variant/recursive_variant.hpp>
+
+template<typename Sequence> 
+class make_recursive_variant_over {
+public:
+  // types
+  typedef variant< unspecified > type;
+};
    +
    +

    Description

    +

    type has behavior equivalent in every respect to + make_recursive_variant< Sequence[0], Sequence[1], ... >::type + (where Sequence[i] denotes the + i-th element of Sequence), except + that no upper limit is imposed on the number of types.

    +

    Notes:

    +
      +
    • +Sequence must meet the requirements of + MPL's Sequence + concept.
      • +
    • Due to standard conformance problems in several compilers, + make_recursive_variant_over may not be supported on + your compiler. See + BOOST_VARIANT_NO_TYPE_SEQUENCE_SUPPORT + for more information.
      • +
    +
    +
    + + + +
    Copyright © 2002, 2003 Eric Friedman, Itay Maman

    Distributed under the Boost Software License, Version 1.0. + (See accompanying file LICENSE_1_0.txt or copy at + http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/make_recursiv_idp352653296.html b/doc/html/boost/make_recursiv_idp352653296.html deleted file mode 100644 index 82e0a155b2..0000000000 --- a/doc/html/boost/make_recursiv_idp352653296.html +++ /dev/null @@ -1,76 +0,0 @@ - - - - -Class template make_recursive_variant_over - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Class template make_recursive_variant_over

    -

    boost::make_recursive_variant_over — Exposes a recursive variant whose bounded types - are the elements of the given type sequence.

    -
    -

    Synopsis

    -
    // In header: <boost/variant/recursive_variant.hpp>
-
-template<typename Sequence> 
-class make_recursive_variant_over {
-public:
-  // types
-  typedef variant< unspecified > type;
-};
    -
    -

    Description

    -

    type has behavior equivalent in every respect to - make_recursive_variant< Sequence[0], Sequence[1], ... >::type - (where Sequence[i] denotes the - i-th element of Sequence), except - that no upper limit is imposed on the number of types.

    -

    Notes:

    -
      -
    • -Sequence must meet the requirements of - MPL's Sequence - concept.
      • -
    • Due to standard conformance problems in several compilers, - make_recursive_variant_over may not be supported on - your compiler. See - BOOST_VARIANT_NO_TYPE_SEQUENCE_SUPPORT - for more information.
      • -
    -
    -
    - - - -
    Copyright © 2002, 2003 Eric Friedman, Itay Maman

    Distributed under the Boost Software License, Version 1.0. - (See accompanying file LICENSE_1_0.txt or copy at - http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/make_recursive_variant.html b/doc/html/boost/make_recursive_variant.html index 5ffa45428a..f86598cefa 100644 --- a/doc/html/boost/make_recursive_variant.html +++ b/doc/html/boost/make_recursive_variant.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -40,7 +40,7 @@ typedef boost::variant< unspecified > type; };
    -

    Description

    +

    Description

    type has behavior equivalent in every respect to some variant< U1, U2, ..., UN >, where each type Ui is the result of the @@ -93,7 +93,7 @@

    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/make_variant_over.html b/doc/html/boost/make_variant_over.html index 8006ff6b99..f17215fa8e 100644 --- a/doc/html/boost/make_variant_over.html +++ b/doc/html/boost/make_variant_over.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -40,7 +40,7 @@ typedef variant< unspecified > type; };
    -

    Description

    +

    Description

    type has behavior equivalent in every respect to variant< Sequence[0], Sequence[1], ... > (where Sequence[i] denotes the @@ -70,7 +70,7 @@

    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/move_backward.html b/doc/html/boost/move_backward.html index 9f5508d4b4..de3a3e8981 100644 --- a/doc/html/boost/move_backward.html +++ b/doc/html/boost/move_backward.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -35,7 +35,7 @@ template<typename I, typename O> O move_backward(I f, I l, O result);
    -

    Description

    +

    Description

    Effects: Moves elements in the range [first,last) into the range [result - (last-first),result) starting from last - 1 and proceeding to first. For each positive integer n <= (last - first), performs *(result - n) = boost::move(*(last - n)).

    Requires: result shall not be in the range [first,last).

    Returns: result - (last - first).

    @@ -52,7 +52,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/move_idm45507105093488.html b/doc/html/boost/move_idm45507105093488.html new file mode 100644 index 0000000000..94753769d6 --- /dev/null +++ b/doc/html/boost/move_idm45507105093488.html @@ -0,0 +1,55 @@ + + + + +Function template move + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template move

    +

    boost::move

    +
    +

    Synopsis

    +
    // In header: <boost/move/utility_core.hpp>
+
+
+template<typename T> rvalue_reference move(input_reference);
    +
    +

    Description

    +

    This function provides a way to convert a reference into a rvalue reference in compilers with rvalue references. For other compilers if T is Boost.Move enabled type then it converts T& into ::boost::rv<T> & so that move emulation is activated, else it returns T &.

    +
    +
    + + + +
    Copyright © 2008-2014 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/move_idm45507111136736.html b/doc/html/boost/move_idm45507111136736.html new file mode 100644 index 0000000000..7cafa87897 --- /dev/null +++ b/doc/html/boost/move_idm45507111136736.html @@ -0,0 +1,58 @@ + + + + +Function template move + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template move

    +

    boost::move

    +
    +

    Synopsis

    +
    // In header: <boost/move/algorithm.hpp>
+
+
+template<typename I, typename O> O move(I f, I l, O result);
    +
    +

    Description

    +

    Effects: Moves elements in the range [first,last) into the range [result,result + (last - first)) starting from first and proceeding to last. For each non-negative integer n < (last-first), performs *(result + n) = boost::move (*(first + n)).

    +

    Effects: result + (last - first).

    +

    Requires: result shall not be in the range [first,last).

    +

    Complexity: Exactly last - first move assignments.

    +
    +
    + + + +
    Copyright © 2008-2014 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/move_idp106413712.html b/doc/html/boost/move_idp106413712.html deleted file mode 100644 index eabbb7729e..0000000000 --- a/doc/html/boost/move_idp106413712.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Function template move - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template move

    -

    boost::move

    -
    -

    Synopsis

    -
    // In header: <boost/move/utility_core.hpp>
-
-
-template<typename T> rvalue_reference move(input_reference);
    -
    -

    Description

    -

    This function provides a way to convert a reference into a rvalue reference in compilers with rvalue references. For other compilers if T is Boost.Move enabled type then it converts T& into ::boost::rv<T> & so that move emulation is activated, else it returns T &.

    -
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/move_idp207498784.html b/doc/html/boost/move_idp207498784.html deleted file mode 100644 index 5cc84e0937..0000000000 --- a/doc/html/boost/move_idp207498784.html +++ /dev/null @@ -1,58 +0,0 @@ - - - - -Function template move - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template move

    -

    boost::move

    -
    -

    Synopsis

    -
    // In header: <boost/move/algorithm.hpp>
-
-
-template<typename I, typename O> O move(I f, I l, O result);
    -
    -

    Description

    -

    Effects: Moves elements in the range [first,last) into the range [result,result + (last - first)) starting from first and proceeding to last. For each non-negative integer n < (last-first), performs *(result + n) = boost::move (*(first + n)).

    -

    Effects: result + (last - first).

    -

    Requires: result shall not be in the range [first,last).

    -

    Complexity: Exactly last - first move assignments.

    -
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/move_if__idm45507039180160.html b/doc/html/boost/move_if__idm45507039180160.html new file mode 100644 index 0000000000..4b8e2a33fb --- /dev/null +++ b/doc/html/boost/move_if__idm45507039180160.html @@ -0,0 +1,56 @@ + + + + +Function template move_if_not_lvalue_reference + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template move_if_not_lvalue_reference

    +

    boost::move_if_not_lvalue_reference

    +
    +

    Synopsis

    +
    // In header: <boost/move/utility_core.hpp>
+
+
+template<typename T> 
+  output_reference move_if_not_lvalue_reference(input_reference);
    +
    +

    Description

    +

    Effects: Calls boost::move if input_reference is not a lvalue reference. Otherwise returns the reference

    +
    +
    + + + +
    Copyright © 2008-2014 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/move_if_noexcept.html b/doc/html/boost/move_if_noexcept.html index b7db24d112..1999b0392a 100644 --- a/doc/html/boost/move_if_noexcept.html +++ b/doc/html/boost/move_if_noexcept.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -36,7 +36,7 @@ template<typename T> rvalue_reference_or_const_lvalue_reference move_if_noexcept(input_reference);
    -

    Description

    +

    Description

    This function provides a way to convert a reference into a rvalue reference in compilers with rvalue references. For other compilers converts T & into ::boost::rv<T> & so that move emulation is activated. Reference would be converted to rvalue reference only if input type is nothrow move constructible or if it has no copy constructor. In all other cases const reference would be returned

    @@ -50,7 +50,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/move_insert_iterator.html b/doc/html/boost/move_insert_iterator.html index f56c46e293..2314262a12 100644 --- a/doc/html/boost/move_insert_iterator.html +++ b/doc/html/boost/move_insert_iterator.html @@ -44,35 +44,35 @@ typedef std::output_iterator_tag iterator_category; // construct/copy/destruct - explicit move_insert_iterator(C &, typename C::iterator); - move_insert_iterator & operator=(reference); - move_insert_iterator & operator=(value_type &&); + explicit move_insert_iterator(C &, typename C::iterator); + move_insert_iterator & operator=(reference); + move_insert_iterator & operator=(value_type &&); - // public member functions - move_insert_iterator & operator*(); - move_insert_iterator & operator++(); - move_insert_iterator & operator++(int); + // public member functions + move_insert_iterator & operator*(); + move_insert_iterator & operator++(); + move_insert_iterator & operator++(int); };
    -

    Description

    +

    Description

    -

    +

    move_insert_iterator public construct/copy/destruct

      -
    1. explicit move_insert_iterator(C & x, typename C::iterator pos);
      2. -
    2. move_insert_iterator & operator=(reference x);
      3. -
    3. move_insert_iterator & operator=(value_type && x);
      4. +
    4. explicit move_insert_iterator(C & x, typename C::iterator pos);
      5. +
    5. move_insert_iterator & operator=(reference x);
      6. +
    6. move_insert_iterator & operator=(value_type && x);
    -

    -move_insert_iterator public member functions

    +

    +move_insert_iterator public member functions

      -
    1. move_insert_iterator & operator*();
      2. -
    2. move_insert_iterator & operator++();
      3. -
    3. move_insert_iterator & operator++(int);
      4. +
    4. move_insert_iterator & operator*();
      5. +
    5. move_insert_iterator & operator++();
      6. +
    6. move_insert_iterator & operator++(int);
    diff --git a/doc/html/boost/move_inserter.html b/doc/html/boost/move_inserter.html index 1cecb34e07..897f452ccf 100644 --- a/doc/html/boost/move_inserter.html +++ b/doc/html/boost/move_inserter.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -36,7 +36,7 @@ template<typename C> move_insert_iterator< C > move_inserter(C & x, typename C::iterator it);
    -

    Description

    +

    Description

    Returns: move_insert_iterator<C>(x, it).

    @@ -50,7 +50,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/move_iterator.html b/doc/html/boost/move_iterator.html index 34bb38c223..450a445529 100644 --- a/doc/html/boost/move_iterator.html +++ b/doc/html/boost/move_iterator.html @@ -44,54 +44,54 @@ typedef boost::movelib::iterator_traits< iterator_type >::iterator_category iterator_category; // construct/copy/destruct - move_iterator(); - explicit move_iterator(It); - template<typename U> move_iterator(const move_iterator< U > &); + move_iterator(); + explicit move_iterator(It); + template<typename U> move_iterator(const move_iterator< U > &); - // public member functions - iterator_type base() const; - reference operator*() const; - pointer operator->() const; - move_iterator & operator++(); - move_iterator< iterator_type > operator++(int); - move_iterator & operator--(); - move_iterator< iterator_type > operator--(int); - move_iterator< iterator_type > operator+(difference_type) const; - move_iterator & operator+=(difference_type); - move_iterator< iterator_type > operator-(difference_type) const; - move_iterator & operator-=(difference_type); - reference operator[](difference_type) const; + // public member functions + iterator_type base() const; + reference operator*() const; + pointer operator->() const; + move_iterator & operator++(); + move_iterator< iterator_type > operator++(int); + move_iterator & operator--(); + move_iterator< iterator_type > operator--(int); + move_iterator< iterator_type > operator+(difference_type) const; + move_iterator & operator+=(difference_type); + move_iterator< iterator_type > operator-(difference_type) const; + move_iterator & operator-=(difference_type); + reference operator[](difference_type) const; };
    -

    Description

    +

    Description

    Class template move_iterator is an iterator adaptor with the same behavior as the underlying iterator except that its dereference operator implicitly converts the value returned by the underlying iterator's dereference operator to an rvalue reference. Some generic algorithms can be called with move iterators to replace copying with moving.

    -

    +

    move_iterator public construct/copy/destruct

      -
    1. move_iterator();
      2. -
    2. explicit move_iterator(It i);
      3. -
    3. template<typename U> move_iterator(const move_iterator< U > & u);
      4. +
    4. move_iterator();
      5. +
    5. explicit move_iterator(It i);
      6. +
    6. template<typename U> move_iterator(const move_iterator< U > & u);
    -

    -move_iterator public member functions

    +

    +move_iterator public member functions

      -
    1. iterator_type base() const;
      2. -
    2. reference operator*() const;
      3. -
    3. pointer operator->() const;
      4. -
    4. move_iterator & operator++();
      5. -
    5. move_iterator< iterator_type > operator++(int);
      6. -
    6. move_iterator & operator--();
      7. -
    7. move_iterator< iterator_type > operator--(int);
      8. -
    8. move_iterator< iterator_type > operator+(difference_type n) const;
      9. -
    9. move_iterator & operator+=(difference_type n);
      10. -
    10. move_iterator< iterator_type > operator-(difference_type n) const;
      11. -
    11. move_iterator & operator-=(difference_type n);
      12. -
    12. reference operator[](difference_type n) const;
      13. +
    13. iterator_type base() const;
      14. +
    14. reference operator*() const;
      15. +
    15. pointer operator->() const;
      16. +
    16. move_iterator & operator++();
      17. +
    17. move_iterator< iterator_type > operator++(int);
      18. +
    18. move_iterator & operator--();
      19. +
    19. move_iterator< iterator_type > operator--(int);
      20. +
    20. move_iterator< iterator_type > operator+(difference_type n) const;
      21. +
    21. move_iterator & operator+=(difference_type n);
      22. +
    22. move_iterator< iterator_type > operator-(difference_type n) const;
      23. +
    23. move_iterator & operator-=(difference_type n);
      24. +
    24. reference operator[](difference_type n) const;
    diff --git a/doc/html/boost/move_upd/bool_conversion.html b/doc/html/boost/move_upd/bool_conversion.html deleted file mode 100644 index d957ca655c..0000000000 --- a/doc/html/boost/move_upd/bool_conversion.html +++ /dev/null @@ -1,66 +0,0 @@ - - - - -Struct bool_conversion - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct bool_conversion

    -

    boost::move_upd::bool_conversion

    -
    -

    Synopsis

    -
    // In header: <boost/move/default_delete.hpp>
-
-
-struct bool_conversion {
-
-  // public member functions
-  int for_arg();
-
-  // public data members
-  int for_bool;
-};
    -
    -

    Description

    -
    -

    -bool_conversion public member functions

    -
    1. int for_arg();
    -
    -
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/move_upd/def_del_compatible_cond.html b/doc/html/boost/move_upd/def_del_compatible_cond.html deleted file mode 100644 index de7999f9cd..0000000000 --- a/doc/html/boost/move_upd/def_del_compatible_cond.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template def_del_compatible_cond - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template def_del_compatible_cond

    -

    boost::move_upd::def_del_compatible_cond

    -
    -

    Synopsis

    -
    // In header: <boost/move/default_delete.hpp>
-
-template<typename U, typename T> 
-struct def_del_compatible_cond :
-  public boost::move_upmu::is_convertible< U *, T * >
-{
-};
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/move_upd/deleter_types.html b/doc/html/boost/move_upd/deleter_types.html deleted file mode 100644 index d650e1d15d..0000000000 --- a/doc/html/boost/move_upd/deleter_types.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Struct template deleter_types - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template deleter_types

    -

    boost::move_upd::deleter_types

    -
    -

    Synopsis

    -
    // In header: <boost/move/unique_ptr.hpp>
-
-template<typename D> 
-struct deleter_types {
-  // types
-  typedef bmupmu::add_lvalue_reference< D >::type                                    del_ref;          
-  typedef bmupmu::add_const_lvalue_reference< D >::type                              del_cref;         
-  typedef bmupmu::if_c< bmupmu::is_lvalue_reference< D >::value, D, del_cref >::type deleter_arg_type1;
-  typedef bmupmu::remove_reference< D >::type &&                                     deleter_arg_type2;
-};
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/move_upd/enable_def_del.html b/doc/html/boost/move_upd/enable_def_del.html deleted file mode 100644 index fa71e06015..0000000000 --- a/doc/html/boost/move_upd/enable_def_del.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template enable_def_del - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template enable_def_del

    -

    boost::move_upd::enable_def_del

    -
    -

    Synopsis

    -
    // In header: <boost/move/default_delete.hpp>
-
-template<typename U, typename T, typename Type = bmupmu::nat> 
-struct enable_def_del : public boost::move_upmu::enable_if_c< def_del_compatible_cond< U, T >::value, Type >
-{
-};
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/move_upd/enable_defdel_call.html b/doc/html/boost/move_upd/enable_defdel_call.html deleted file mode 100644 index 548059d897..0000000000 --- a/doc/html/boost/move_upd/enable_defdel_call.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template enable_defdel_call - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template enable_defdel_call

    -

    boost::move_upd::enable_defdel_call

    -
    -

    Synopsis

    -
    // In header: <boost/move/default_delete.hpp>
-
-template<typename U, typename T, typename Type = bmupmu::nat> 
-struct enable_defdel_call :
-  public boost::move_upd::enable_def_del< U, T, Type >
-{
-};
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/move_upd/enable_up_moveconv_assign.html b/doc/html/boost/move_upd/enable_up_moveconv_assign.html deleted file mode 100644 index 600da4cfe0..0000000000 --- a/doc/html/boost/move_upd/enable_up_moveconv_assign.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template enable_up_moveconv_assign - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template enable_up_moveconv_assign

    -

    boost::move_upd::enable_up_moveconv_assign

    -
    -

    Synopsis

    -
    // In header: <boost/move/unique_ptr.hpp>
-
-template<typename T, typename D, typename U, typename E, 
-         typename Type = bmupmu::nat> 
-struct enable_up_moveconv_assign : public boost::move_upmu::enable_if_c< unique_moveconvert_assignable< T, D, U, E >::value, Type >
-{
-};
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/move_upd/enable_up_moveconv_constr.html b/doc/html/boost/move_upd/enable_up_moveconv_constr.html deleted file mode 100644 index 118c153f42..0000000000 --- a/doc/html/boost/move_upd/enable_up_moveconv_constr.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template enable_up_moveconv_constr - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template enable_up_moveconv_constr

    -

    boost::move_upd::enable_up_moveconv_constr

    -
    -

    Synopsis

    -
    // In header: <boost/move/unique_ptr.hpp>
-
-template<typename T, typename D, typename U, typename E, 
-         typename Type = bmupmu::nat> 
-struct enable_up_moveconv_constr : public boost::move_upmu::enable_if_c< unique_moveconvert_assignable< T, D, U, E >::value &&unique_deleter_is_initializable< D, E >::value, Type >
-{
-};
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/move_upd/enable_up_ptr.html b/doc/html/boost/move_upd/enable_up_ptr.html deleted file mode 100644 index 183585b399..0000000000 --- a/doc/html/boost/move_upd/enable_up_ptr.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template enable_up_ptr - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template enable_up_ptr

    -

    boost::move_upd::enable_up_ptr

    -
    -

    Synopsis

    -
    // In header: <boost/move/unique_ptr.hpp>
-
-template<typename T, typename FromPointer, typename ThisPointer, 
-         typename Type = bmupmu::nat> 
-struct enable_up_ptr : public boost::move_upmu::enable_if_c< is_unique_ptr_convertible< bmupmu::is_array< T >::value, FromPointer, ThisPointer >::value, Type >
-{
-};
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/move_upd/get_cvelement.html b/doc/html/boost/move_upd/get_cvelement.html deleted file mode 100644 index 568074dcc8..0000000000 --- a/doc/html/boost/move_upd/get_cvelement.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template get_cvelement - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template get_cvelement

    -

    boost::move_upd::get_cvelement

    -
    -

    Synopsis

    -
    // In header: <boost/move/unique_ptr.hpp>
-
-template<typename T> 
-struct get_cvelement :
-  public boost::move_upmu::remove_cv< get_element_type< T >::type >
-{
-};
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/move_upd/get_element_t_idp214518816.html b/doc/html/boost/move_upd/get_element_t_idp214518816.html deleted file mode 100644 index 184ee2c90e..0000000000 --- a/doc/html/boost/move_upd/get_element_t_idp214518816.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template get_element_type<T *> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template get_element_type<T *>

    -

    boost::move_upd::get_element_type<T *>

    -
    -

    Synopsis

    -
    // In header: <boost/move/unique_ptr.hpp>
-
-template<typename T> 
-struct get_element_type<T *> {
-  // types
-  typedef T type;
-};
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/move_upd/get_element_type.html b/doc/html/boost/move_upd/get_element_type.html deleted file mode 100644 index ddcb7a963e..0000000000 --- a/doc/html/boost/move_upd/get_element_type.html +++ /dev/null @@ -1,79 +0,0 @@ - - - - -Struct template get_element_type - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template get_element_type

    -

    boost::move_upd::get_element_type

    -
    -

    Synopsis

    -
    // In header: <boost/move/unique_ptr.hpp>
-
-template<typename T> 
-struct get_element_type {
-  // types
-  typedef bmupmu::if_c< value, T, DefaultWrap >::type::element_type type;
-
-  // member classes/structs/unions
-
-  struct DefaultWrap {
-    // types
-    typedef bmupmu::natify< T > element_type;
-  };
-
-  // public static functions
-  template<typename X> static char test(int, typename X::element_type *);
-  template<typename X> static int test(...);
-
-  // public data members
-  static const bool value;
-};
    -
    -

    Description

    -
    -

    -get_element_type public static functions

    -
      -
    1. template<typename X> static char test(int, typename X::element_type *);
      2. -
    2. template<typename X> static int test(...);
      3. -
    -
    -
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/move_upd/get_element_type/DefaultWrap.html b/doc/html/boost/move_upd/get_element_type/DefaultWrap.html deleted file mode 100644 index 54aa8c21fc..0000000000 --- a/doc/html/boost/move_upd/get_element_type/DefaultWrap.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct DefaultWrap - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct DefaultWrap

    -

    boost::move_upd::get_element_type::DefaultWrap

    -
    -

    Synopsis

    -
    // In header: <boost/move/unique_ptr.hpp>
-
-
-
-struct DefaultWrap {
-  // types
-  typedef bmupmu::natify< T > element_type;
-};
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/move_upd/is_rvalue_convertible.html b/doc/html/boost/move_upd/is_rvalue_convertible.html deleted file mode 100644 index 3f4aae1b5e..0000000000 --- a/doc/html/boost/move_upd/is_rvalue_convertible.html +++ /dev/null @@ -1,77 +0,0 @@ - - - - -Class template is_rvalue_convertible - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Class template is_rvalue_convertible

    -

    boost::move_upd::is_rvalue_convertible

    -
    -

    Synopsis

    -
    // In header: <boost/move/unique_ptr.hpp>
-
-template<typename T, typename U> 
-class is_rvalue_convertible {
-public:
-  // member classes/structs/unions
-
-  class false_t {
-  };
-
-  // private static functions
-  static false_t dispatch(...);
-  static true_t dispatch(U);
-  static t_from trigger();
-
-  // public data members
-  static const bool value;
-};
    -
    -

    Description

    -
    -

    -is_rvalue_convertible private static functions

    -
      -
    1. static false_t dispatch(...);
      2. -
    2. static true_t dispatch(U);
      3. -
    3. static t_from trigger();
      4. -
    -
    -
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/move_upd/is_rvalue_convertible/false_t.html b/doc/html/boost/move_upd/is_rvalue_convertible/false_t.html deleted file mode 100644 index 77bc89e71c..0000000000 --- a/doc/html/boost/move_upd/is_rvalue_convertible/false_t.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Class false_t - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Class false_t

    -

    boost::move_upd::is_rvalue_convertible::false_t

    -
    -

    Synopsis

    -
    // In header: <boost/move/unique_ptr.hpp>
-
-
-
-class false_t {
-};
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/move_upd/is_same_cvele_idp214489504.html b/doc/html/boost/move_upd/is_same_cvele_idp214489504.html deleted file mode 100644 index 5fb8f5ea88..0000000000 --- a/doc/html/boost/move_upd/is_same_cvele_idp214489504.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Struct template is_same_cvelement_and_convertible - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template is_same_cvelement_and_convertible

    -

    boost::move_upd::is_same_cvelement_and_convertible

    -
    -

    Synopsis

    -
    // In header: <boost/move/unique_ptr.hpp>
-
-template<typename P1, typename P2> 
-struct is_same_cvelement_and_convertible {
-  // types
-  typedef bmupmu::remove_reference< P1 >::type arg1;
-  typedef bmupmu::remove_reference< P2 >::type arg2;
-
-  // public data members
-  static const bool same_cvless;
-  static const bool value;
-};
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/move_upd/is_unique_ptr_convertible.html b/doc/html/boost/move_upd/is_unique_ptr_convertible.html deleted file mode 100644 index 572932fa14..0000000000 --- a/doc/html/boost/move_upd/is_unique_ptr_convertible.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template is_unique_ptr_convertible - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template is_unique_ptr_convertible

    -

    boost::move_upd::is_unique_ptr_convertible

    -
    -

    Synopsis

    -
    // In header: <boost/move/unique_ptr.hpp>
-
-template<bool IsArray, typename FromPointer, typename ThisPointer> 
-struct is_unique_ptr_convertible : public boost::move_upd::is_same_cvelement_and_convertible< FromPointer, ThisPointer >
-{
-};
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/move_upd/is_unique_ptr_idp207464816.html b/doc/html/boost/move_upd/is_unique_ptr_idp207464816.html deleted file mode 100644 index d779700510..0000000000 --- a/doc/html/boost/move_upd/is_unique_ptr_idp207464816.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template is_unique_ptr_convertible<false, FromPointer, ThisPointer> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template is_unique_ptr_convertible<false, FromPointer, ThisPointer>

    -

    boost::move_upd::is_unique_ptr_convertible<false, FromPointer, ThisPointer>

    -
    -

    Synopsis

    -
    // In header: <boost/move/unique_ptr.hpp>
-
-template<typename FromPointer, typename ThisPointer> 
-struct is_unique_ptr_convertible<false, FromPointer, ThisPointer> :
-  public boost::move_upmu::is_convertible< FromPointer, ThisPointer >
-{
-};
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/move_upd/nullptr_type.html b/doc/html/boost/move_upd/nullptr_type.html deleted file mode 100644 index 4ef74b6d83..0000000000 --- a/doc/html/boost/move_upd/nullptr_type.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Global nullptr_type - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Global nullptr_type

    -

    boost::move_upd::nullptr_type

    -
    -

    Synopsis

    -
    // In header: <boost/move/default_delete.hpp>
-
-decltype(nullptr) typedef nullptr_type;
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/move_upd/unique_delete_idp207431200.html b/doc/html/boost/move_upd/unique_delete_idp207431200.html deleted file mode 100644 index 9e3aa94bdc..0000000000 --- a/doc/html/boost/move_upd/unique_delete_idp207431200.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template unique_deleter_is_initializable<D, E, false> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template unique_deleter_is_initializable<D, E, false>

    -

    boost::move_upd::unique_deleter_is_initializable<D, E, false>

    -
    -

    Synopsis

    -
    // In header: <boost/move/unique_ptr.hpp>
-
-template<typename D, typename E> 
-struct unique_deleter_is_initializable<D, E, false> {
-
-  // public data members
-  static const bool value;
-};
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/move_upd/unique_delete_idp207468160.html b/doc/html/boost/move_upd/unique_delete_idp207468160.html deleted file mode 100644 index 741bf26022..0000000000 --- a/doc/html/boost/move_upd/unique_delete_idp207468160.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template unique_deleter_is_initializable - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template unique_deleter_is_initializable

    -

    boost::move_upd::unique_deleter_is_initializable

    -
    -

    Synopsis

    -
    // In header: <boost/move/unique_ptr.hpp>
-
-template<typename D, typename E, 
-         bool IsReference = bmupmu::is_reference<D>::value> 
-struct unique_deleter_is_initializable :
-  public boost::move_upmu::is_same< D, E >
-{
-};
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/move_upd/unique_moveco_idp207435136.html b/doc/html/boost/move_upd/unique_moveco_idp207435136.html deleted file mode 100644 index 64697311f9..0000000000 --- a/doc/html/boost/move_upd/unique_moveco_idp207435136.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Struct template unique_moveconvert_assignable - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template unique_moveconvert_assignable

    -

    boost::move_upd::unique_moveconvert_assignable

    -
    -

    Synopsis

    -
    // In header: <boost/move/unique_ptr.hpp>
-
-template<typename T, typename D, typename U, typename E> 
-struct unique_moveconvert_assignable {
-
-  // public data members
-  static const bool t_is_array;
-  static const bool value;
-};
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/move_upd/unique_ptr_da_idp203566208.html b/doc/html/boost/move_upd/unique_ptr_da_idp203566208.html deleted file mode 100644 index 4c8d96b202..0000000000 --- a/doc/html/boost/move_upd/unique_ptr_da_idp203566208.html +++ /dev/null @@ -1,96 +0,0 @@ - - - - -Struct template unique_ptr_data<P, D, false> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template unique_ptr_data<P, D, false>

    -

    boost::move_upd::unique_ptr_data<P, D, false>

    -
    -

    Synopsis

    -
    // In header: <boost/move/unique_ptr.hpp>
-
-template<typename P, typename D> 
-struct unique_ptr_data<P, D, false> : private D {
-  // types
-  typedef deleter_types< D >::deleter_arg_type1 deleter_arg_type1;
-  typedef deleter_types< D >::del_ref           del_ref;          
-  typedef deleter_types< D >::del_cref          del_cref;         
-
-  // construct/copy/destruct
-  unique_ptr_data() noexcept;
-  explicit unique_ptr_data(P) noexcept;
-  unique_ptr_data(P, deleter_arg_type1) noexcept;
-  template<typename U> unique_ptr_data(P, U &&) noexcept;
-  unique_ptr_data(const unique_ptr_data &);
-  unique_ptr_data & operator=(const unique_ptr_data &);
-
-  // public member functions
-  del_ref deleter() noexcept;
-  del_cref deleter() const noexcept;
-
-  // public data members
-  P m_p;
-};
    -
    -

    Description

    -
    -

    -unique_ptr_data - public - construct/copy/destruct

    -
      -
    1. unique_ptr_data() noexcept;
      2. -
    2. explicit unique_ptr_data(P p) noexcept;
      3. -
    3. unique_ptr_data(P p, deleter_arg_type1 d1) noexcept;
      4. -
    4. template<typename U> unique_ptr_data(P p, U && d) noexcept;
      5. -
    5. unique_ptr_data(const unique_ptr_data &);
      6. -
    6. unique_ptr_data & operator=(const unique_ptr_data &);
      7. -
    -
    -
    -

    -unique_ptr_data public member functions

    -
      -
    1. del_ref deleter() noexcept;
      2. -
    2. del_cref deleter() const noexcept;
      3. -
    -
    -
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/move_upd/unique_ptr_data.html b/doc/html/boost/move_upd/unique_ptr_data.html deleted file mode 100644 index c9d6234ec2..0000000000 --- a/doc/html/boost/move_upd/unique_ptr_data.html +++ /dev/null @@ -1,98 +0,0 @@ - - - - -Struct template unique_ptr_data - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template unique_ptr_data

    -

    boost::move_upd::unique_ptr_data

    -
    -

    Synopsis

    -
    // In header: <boost/move/unique_ptr.hpp>
-
-template<typename P, typename D, 
-         bool  = bmupmu::is_unary_function<D>::value || bmupmu::is_reference<D>::value> 
-struct unique_ptr_data {
-  // types
-  typedef deleter_types< D >::deleter_arg_type1 deleter_arg_type1;
-  typedef deleter_types< D >::del_ref           del_ref;          
-  typedef deleter_types< D >::del_cref          del_cref;         
-
-  // construct/copy/destruct
-  unique_ptr_data() noexcept;
-  explicit unique_ptr_data(P) noexcept;
-  unique_ptr_data(P, deleter_arg_type1) noexcept;
-  template<typename U> unique_ptr_data(P, U &&) noexcept;
-  unique_ptr_data(const unique_ptr_data &);
-  unique_ptr_data & operator=(const unique_ptr_data &);
-
-  // public member functions
-  del_ref deleter();
-  del_cref deleter() const;
-
-  // public data members
-  P m_p;
-  D d;
-};
    -
    -

    Description

    -
    -

    -unique_ptr_data - public - construct/copy/destruct

    -
      -
    1. unique_ptr_data() noexcept;
      2. -
    2. explicit unique_ptr_data(P p) noexcept;
      3. -
    3. unique_ptr_data(P p, deleter_arg_type1 d1) noexcept;
      4. -
    4. template<typename U> unique_ptr_data(P p, U && d1) noexcept;
      5. -
    5. unique_ptr_data(const unique_ptr_data &);
      6. -
    6. unique_ptr_data & operator=(const unique_ptr_data &);
      7. -
    -
    -
    -

    -unique_ptr_data public member functions

    -
      -
    1. del_ref deleter();
      2. -
    2. del_cref deleter() const;
      3. -
    -
    -
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/movelib/default_delete.html b/doc/html/boost/movelib/default_delete.html index 52f7d733a9..e2e5516b60 100644 --- a/doc/html/boost/movelib/default_delete.html +++ b/doc/html/boost/movelib/default_delete.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -35,42 +35,45 @@ template<typename T> struct default_delete { // construct/copy/destruct - default_delete(); - default_delete(const default_delete &); - template<typename U> default_delete(const default_delete< U > &) noexcept; - default_delete & operator=(const default_delete &); + default_delete(); + default_delete(const default_delete &); + template<typename U> default_delete(const default_delete< U > &) noexcept; + default_delete & operator=(const default_delete &); template<typename U> - default_delete & operator=(const default_delete< U > &) noexcept; + default_delete & operator=(const default_delete< U > &) noexcept; - // public member functions - template<typename U> void operator()(U *) const noexcept; - void operator()(std::nullptr_t) const noexcept; + // public member functions + template<typename U> void operator()(U *) const noexcept; + void operator()(std::nullptr_t) const noexcept; };
    -

    Description

    +

    Description

    The class template default_delete serves as the default deleter (destruction policy) for the class template unique_ptr.

    -

    Template Parameters

    +

    Template Parameters

    1. typename T

      The type to be deleted. It may be an incomplete type

    -

    +

    default_delete public construct/copy/destruct

    1. -
      default_delete();
      +
      default_delete();

      Default constructor.

      2. -
    2. default_delete(const default_delete &);
    3. -
      template<typename U> default_delete(const default_delete< U > &) noexcept;
      +
      default_delete(const default_delete &);
      +

      Trivial copy constructor

      +
      4. +
    4. +
      template<typename U> default_delete(const default_delete< U > &) noexcept;

      Effects: Constructs a default_delete object from another default_delete<U> object.

      Remarks: This constructor shall not participate in overload resolution unless:

    -

    -default_delete public member functions

    +

    +default_delete public member functions

    1. -
      template<typename U> void operator()(U * ptr) const noexcept;
      +
      template<typename U> void operator()(U * ptr) const noexcept;

      Effects: if T is not an array type, calls delete on static_cast<T*>(ptr), otherwise calls delete[] on static_cast<remove_extent<T>::type*>(ptr).

      Remarks: If U is an incomplete type, the program is ill-formed. This operator shall not participate in overload resolution unless:

        @@ -111,7 +117,7 @@

      • -
        void operator()(std::nullptr_t) const noexcept;
        +
        void operator()(std::nullptr_t) const noexcept;

        Effects: Same as (this)(static_cast<element_type>(nullptr)).

    @@ -128,7 +134,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/movelib/make_uni_idm45507091094560.html b/doc/html/boost/movelib/make_uni_idm45507091094560.html new file mode 100644 index 0000000000..d8e9832972 --- /dev/null +++ b/doc/html/boost/movelib/make_uni_idm45507091094560.html @@ -0,0 +1,56 @@ + + + + +Function template make_unique_definit + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template make_unique_definit

    +

    boost::movelib::make_unique_definit

    +
    +

    Synopsis

    +
    // In header: <boost/move/make_unique.hpp>
+
+
+template<typename T> unique_ptr< T > make_unique_definit(std::size_t n);
    +
    +

    Description

    +

    Remarks: This function shall not participate in overload resolution unless T is an array of unknown bound.

    +

    Returns: unique_ptr<T>(new remove_extent_t<T>[n]) (default initialization)

    +
    +
    + + + +
    Copyright © 2008-2014 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/movelib/make_uni_idm45507091099536.html b/doc/html/boost/movelib/make_uni_idm45507091099536.html new file mode 100644 index 0000000000..9cc66eb831 --- /dev/null +++ b/doc/html/boost/movelib/make_uni_idm45507091099536.html @@ -0,0 +1,56 @@ + + + + +Function template make_unique_nothrow + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template make_unique_nothrow

    +

    boost::movelib::make_unique_nothrow

    +
    +

    Synopsis

    +
    // In header: <boost/move/make_unique.hpp>
+
+
+template<typename T> unique_ptr< T > make_unique_nothrow(std::size_t n);
    +
    +

    Description

    +

    Remarks: This function shall not participate in overload resolution unless T is an array of unknown bound.

    +

    Returns: unique_ptr<T>(new (std::nothrow)remove_extent_t<T>[n]()) (value initialization)

    +
    +
    + + + +
    Copyright © 2008-2014 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/movelib/make_uni_idm45507091739024.html b/doc/html/boost/movelib/make_uni_idm45507091739024.html new file mode 100644 index 0000000000..2fce111991 --- /dev/null +++ b/doc/html/boost/movelib/make_uni_idm45507091739024.html @@ -0,0 +1,56 @@ + + + + +Function template make_unique_nothrow_definit + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template make_unique_nothrow_definit

    +

    boost::movelib::make_unique_nothrow_definit

    +
    +

    Synopsis

    +
    // In header: <boost/move/make_unique.hpp>
+
+
+template<typename T> unique_ptr< T > make_unique_nothrow_definit();
    +
    +

    Description

    +

    Remarks: This function shall not participate in overload resolution unless T is not an array.

    +

    Returns: unique_ptr<T>(new T(std::nothrow) (default initialization)

    +
    +
    + + + +
    Copyright © 2008-2014 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/movelib/make_uni_idm45507091743264.html b/doc/html/boost/movelib/make_uni_idm45507091743264.html new file mode 100644 index 0000000000..c09631a7b6 --- /dev/null +++ b/doc/html/boost/movelib/make_uni_idm45507091743264.html @@ -0,0 +1,56 @@ + + + + +Function template make_unique_definit + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template make_unique_definit

    +

    boost::movelib::make_unique_definit

    +
    +

    Synopsis

    +
    // In header: <boost/move/make_unique.hpp>
+
+
+template<typename T> unique_ptr< T > make_unique_definit();
    +
    +

    Description

    +

    Remarks: This function shall not participate in overload resolution unless T is not an array.

    +

    Returns: unique_ptr<T>(new T) (default initialization)

    +
    +
    + + + +
    Copyright © 2008-2014 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/movelib/make_uni_idm45507097741232.html b/doc/html/boost/movelib/make_uni_idm45507097741232.html new file mode 100644 index 0000000000..9b024775d6 --- /dev/null +++ b/doc/html/boost/movelib/make_uni_idm45507097741232.html @@ -0,0 +1,56 @@ + + + + +Function template make_unique + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template make_unique

    +

    boost::movelib::make_unique

    +
    +

    Synopsis

    +
    // In header: <boost/move/make_unique.hpp>
+
+
+template<typename T> unique_ptr< T > make_unique(std::size_t n);
    +
    +

    Description

    +

    Remarks: This function shall not participate in overload resolution unless T is an array of unknown bound.

    +

    Returns: unique_ptr<T>(new remove_extent_t<T>[n]()) (value initialization)

    +
    +
    + + + +
    Copyright © 2008-2014 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/movelib/make_uni_idm45507098189296.html b/doc/html/boost/movelib/make_uni_idm45507098189296.html new file mode 100644 index 0000000000..ea28cb2693 --- /dev/null +++ b/doc/html/boost/movelib/make_uni_idm45507098189296.html @@ -0,0 +1,57 @@ + + + + +Function template make_unique_nothrow_definit + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template make_unique_nothrow_definit

    +

    boost::movelib::make_unique_nothrow_definit

    +
    +

    Synopsis

    +
    // In header: <boost/move/make_unique.hpp>
+
+
+template<typename T> 
+  unique_ptr< T > make_unique_nothrow_definit(std::size_t n);
    +
    +

    Description

    +

    Remarks: This function shall not participate in overload resolution unless T is an array of unknown bound.

    +

    Returns: unique_ptr<T>(new (std::nothrow)remove_extent_t<T>[n]) (default initialization)

    +
    +
    + + + +
    Copyright © 2008-2014 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/movelib/make_uni_idm45507102529152.html b/doc/html/boost/movelib/make_uni_idm45507102529152.html new file mode 100644 index 0000000000..e433e66c9a --- /dev/null +++ b/doc/html/boost/movelib/make_uni_idm45507102529152.html @@ -0,0 +1,57 @@ + + + + +Function template make_unique + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template make_unique

    +

    boost::movelib::make_unique

    +
    +

    Synopsis

    +
    // In header: <boost/move/make_unique.hpp>
+
+
+template<typename T, class... Args> 
+  unique_ptr< T > make_unique(Args &&... args);
    +
    +

    Description

    +

    Remarks: This function shall not participate in overload resolution unless T is not an array.

    +

    Returns: unique_ptr<T>(new T(std::forward<Args>(args)...)).

    +
    +
    + + + +
    Copyright © 2008-2014 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/movelib/make_uni_idm45507103445360.html b/doc/html/boost/movelib/make_uni_idm45507103445360.html new file mode 100644 index 0000000000..a105da3e27 --- /dev/null +++ b/doc/html/boost/movelib/make_uni_idm45507103445360.html @@ -0,0 +1,56 @@ + + + + +Function template make_unique_definit + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template make_unique_definit

    +

    boost::movelib::make_unique_definit

    +
    +

    Synopsis

    +
    // In header: <boost/move/make_unique.hpp>
+
+
+template<typename T, class... Args> 
+  unspecified make_unique_definit(Args && ...);
    +
    +

    Description

    +

    Remarks: This function shall not participate in overload resolution unless T is an array of known bound.

    +
    +
    + + + +
    Copyright © 2008-2014 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/movelib/make_uni_idm45507103449648.html b/doc/html/boost/movelib/make_uni_idm45507103449648.html new file mode 100644 index 0000000000..6caccb3d73 --- /dev/null +++ b/doc/html/boost/movelib/make_uni_idm45507103449648.html @@ -0,0 +1,55 @@ + + + + +Function template make_unique + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template make_unique

    +

    boost::movelib::make_unique

    +
    +

    Synopsis

    +
    // In header: <boost/move/make_unique.hpp>
+
+
+template<typename T, class... Args> unspecified make_unique(Args && ...);
    +
    +

    Description

    +

    Remarks: This function shall not participate in overload resolution unless T is an array of known bound.

    +
    +
    + + + +
    Copyright © 2008-2014 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/movelib/make_uni_idm45507104315232.html b/doc/html/boost/movelib/make_uni_idm45507104315232.html new file mode 100644 index 0000000000..bf67f2c17b --- /dev/null +++ b/doc/html/boost/movelib/make_uni_idm45507104315232.html @@ -0,0 +1,57 @@ + + + + +Function template make_unique_nothrow + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template make_unique_nothrow

    +

    boost::movelib::make_unique_nothrow

    +
    +

    Synopsis

    +
    // In header: <boost/move/make_unique.hpp>
+
+
+template<typename T, class... Args> 
+  unique_ptr< T > make_unique_nothrow(Args &&... args);
    +
    +

    Description

    +

    Remarks: This function shall not participate in overload resolution unless T is not an array.

    +

    Returns: unique_ptr<T>(new T(std::nothrow)(std::forward<Args>(args)...)).

    +
    +
    + + + +
    Copyright © 2008-2014 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/movelib/make_uni_idm45507110937472.html b/doc/html/boost/movelib/make_uni_idm45507110937472.html new file mode 100644 index 0000000000..09ad1e8e91 --- /dev/null +++ b/doc/html/boost/movelib/make_uni_idm45507110937472.html @@ -0,0 +1,56 @@ + + + + +Function template make_unique_nothrow_definit + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template make_unique_nothrow_definit

    +

    boost::movelib::make_unique_nothrow_definit

    +
    +

    Synopsis

    +
    // In header: <boost/move/make_unique.hpp>
+
+
+template<typename T, class... Args> 
+  unspecified make_unique_nothrow_definit(Args && ...);
    +
    +

    Description

    +

    Remarks: This function shall not participate in overload resolution unless T is an array of known bound.

    +
    +
    + + + +
    Copyright © 2008-2014 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/movelib/make_uni_idm45507110955264.html b/doc/html/boost/movelib/make_uni_idm45507110955264.html new file mode 100644 index 0000000000..989eb056a7 --- /dev/null +++ b/doc/html/boost/movelib/make_uni_idm45507110955264.html @@ -0,0 +1,56 @@ + + + + +Function template make_unique_nothrow + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template make_unique_nothrow

    +

    boost::movelib::make_unique_nothrow

    +
    +

    Synopsis

    +
    // In header: <boost/move/make_unique.hpp>
+
+
+template<typename T, class... Args> 
+  unspecified make_unique_nothrow(Args && ...);
    +
    +

    Description

    +

    Remarks: This function shall not participate in overload resolution unless T is an array of known bound.

    +
    +
    + + + +
    Copyright © 2008-2014 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/movelib/make_unique_d_idp101273888.html b/doc/html/boost/movelib/make_unique_d_idp101273888.html deleted file mode 100644 index 08bcdf527f..0000000000 --- a/doc/html/boost/movelib/make_unique_d_idp101273888.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Function template make_unique_definit - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template make_unique_definit

    -

    boost::movelib::make_unique_definit

    -
    -

    Synopsis

    -
    // In header: <boost/move/make_unique.hpp>
-
-
-template<typename T> unique_ptr< T > make_unique_definit();
    -
    -

    Description

    -

    Remarks: This function shall not participate in overload resolution unless T is not an array.

    -

    Returns: unique_ptr<T>(new T) (default initialization)

    -
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/movelib/make_unique_d_idp224536720.html b/doc/html/boost/movelib/make_unique_d_idp224536720.html deleted file mode 100644 index 0156da5bed..0000000000 --- a/doc/html/boost/movelib/make_unique_d_idp224536720.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Function template make_unique_definit - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template make_unique_definit

    -

    boost::movelib::make_unique_definit

    -
    -

    Synopsis

    -
    // In header: <boost/move/make_unique.hpp>
-
-
-template<typename T, class... Args> 
-  unspecified make_unique_definit(Args && ...);
    -
    -

    Description

    -

    Remarks: This function shall not participate in overload resolution unless T is an array of known bound.

    -
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/movelib/make_unique_d_idp226298144.html b/doc/html/boost/movelib/make_unique_d_idp226298144.html deleted file mode 100644 index 088caf9dd9..0000000000 --- a/doc/html/boost/movelib/make_unique_d_idp226298144.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Function template make_unique_definit - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template make_unique_definit

    -

    boost::movelib::make_unique_definit

    -
    -

    Synopsis

    -
    // In header: <boost/move/make_unique.hpp>
-
-
-template<typename T> unique_ptr< T > make_unique_definit(std::size_t n);
    -
    -

    Description

    -

    Remarks: This function shall not participate in overload resolution unless T is an array of unknown bound.

    -

    Returns: unique_ptr<T>(new remove_extent_t<T>[n]) (default initialization)

    -
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/movelib/make_unique_idp151938176.html b/doc/html/boost/movelib/make_unique_idp151938176.html deleted file mode 100644 index 9425cd8832..0000000000 --- a/doc/html/boost/movelib/make_unique_idp151938176.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Function template make_unique - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template make_unique

    -

    boost::movelib::make_unique

    -
    -

    Synopsis

    -
    // In header: <boost/move/make_unique.hpp>
-
-
-template<typename T> unique_ptr< T > make_unique(std::size_t n);
    -
    -

    Description

    -

    Remarks: This function shall not participate in overload resolution unless T is an array of unknown bound.

    -

    Returns: unique_ptr<T>(new remove_extent_t<T>[n]()) (value initialization)

    -
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/movelib/make_unique_idp201646016.html b/doc/html/boost/movelib/make_unique_idp201646016.html deleted file mode 100644 index 4985e1cba8..0000000000 --- a/doc/html/boost/movelib/make_unique_idp201646016.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function template make_unique - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template make_unique

    -

    boost::movelib::make_unique

    -
    -

    Synopsis

    -
    // In header: <boost/move/make_unique.hpp>
-
-
-template<typename T, class... Args> 
-  unique_ptr< T > make_unique(Args &&... args);
    -
    -

    Description

    -

    Remarks: This function shall not participate in overload resolution unless T is not an array.

    -

    Returns: unique_ptr<T>(new T(std::forward<Args>(args)...)).

    -
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/movelib/make_unique_idp224573072.html b/doc/html/boost/movelib/make_unique_idp224573072.html deleted file mode 100644 index 33da88f1b0..0000000000 --- a/doc/html/boost/movelib/make_unique_idp224573072.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Function template make_unique - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template make_unique

    -

    boost::movelib::make_unique

    -
    -

    Synopsis

    -
    // In header: <boost/move/make_unique.hpp>
-
-
-template<typename T, class... Args> unspecified make_unique(Args && ...);
    -
    -

    Description

    -

    Remarks: This function shall not participate in overload resolution unless T is an array of known bound.

    -
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/movelib/make_unique_n_idp101278080.html b/doc/html/boost/movelib/make_unique_n_idp101278080.html deleted file mode 100644 index 2da8729698..0000000000 --- a/doc/html/boost/movelib/make_unique_n_idp101278080.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Function template make_unique_nothrow_definit - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template make_unique_nothrow_definit

    -

    boost::movelib::make_unique_nothrow_definit

    -
    -

    Synopsis

    -
    // In header: <boost/move/make_unique.hpp>
-
-
-template<typename T> unique_ptr< T > make_unique_nothrow_definit();
    -
    -

    Description

    -

    Remarks: This function shall not participate in overload resolution unless T is not an array.

    -

    Returns: unique_ptr<T>(new T(std::nothrow) (default initialization)

    -
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/movelib/make_unique_n_idp154420480.html b/doc/html/boost/movelib/make_unique_n_idp154420480.html deleted file mode 100644 index 457e74d999..0000000000 --- a/doc/html/boost/movelib/make_unique_n_idp154420480.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function template make_unique_nothrow - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template make_unique_nothrow

    -

    boost::movelib::make_unique_nothrow

    -
    -

    Synopsis

    -
    // In header: <boost/move/make_unique.hpp>
-
-
-template<typename T, class... Args> 
-  unique_ptr< T > make_unique_nothrow(Args &&... args);
    -
    -

    Description

    -

    Remarks: This function shall not participate in overload resolution unless T is not an array.

    -

    Returns: unique_ptr<T>(new T(std::nothrow)(std::forward<Args>(args)...)).

    -
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/movelib/make_unique_n_idp224504784.html b/doc/html/boost/movelib/make_unique_n_idp224504784.html deleted file mode 100644 index 49dda73fa5..0000000000 --- a/doc/html/boost/movelib/make_unique_n_idp224504784.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Function template make_unique_nothrow_definit - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template make_unique_nothrow_definit

    -

    boost::movelib::make_unique_nothrow_definit

    -
    -

    Synopsis

    -
    // In header: <boost/move/make_unique.hpp>
-
-
-template<typename T, class... Args> 
-  unspecified make_unique_nothrow_definit(Args && ...);
    -
    -

    Description

    -

    Remarks: This function shall not participate in overload resolution unless T is an array of known bound.

    -
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/movelib/make_unique_n_idp224541008.html b/doc/html/boost/movelib/make_unique_n_idp224541008.html deleted file mode 100644 index 898d47fadc..0000000000 --- a/doc/html/boost/movelib/make_unique_n_idp224541008.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Function template make_unique_nothrow - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template make_unique_nothrow

    -

    boost::movelib::make_unique_nothrow

    -
    -

    Synopsis

    -
    // In header: <boost/move/make_unique.hpp>
-
-
-template<typename T, class... Args> 
-  unspecified make_unique_nothrow(Args && ...);
    -
    -

    Description

    -

    Remarks: This function shall not participate in overload resolution unless T is an array of known bound.

    -
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/movelib/make_unique_n_idp226228752.html b/doc/html/boost/movelib/make_unique_n_idp226228752.html deleted file mode 100644 index c02befe4e4..0000000000 --- a/doc/html/boost/movelib/make_unique_n_idp226228752.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function template make_unique_nothrow_definit - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template make_unique_nothrow_definit

    -

    boost::movelib::make_unique_nothrow_definit

    -
    -

    Synopsis

    -
    // In header: <boost/move/make_unique.hpp>
-
-
-template<typename T> 
-  unique_ptr< T > make_unique_nothrow_definit(std::size_t n);
    -
    -

    Description

    -

    Remarks: This function shall not participate in overload resolution unless T is an array of unknown bound.

    -

    Returns: unique_ptr<T>(new (std::nothrow)remove_extent_t<T>[n]) (default initialization)

    -
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/movelib/make_unique_n_idp226293136.html b/doc/html/boost/movelib/make_unique_n_idp226293136.html deleted file mode 100644 index 470ce3e68e..0000000000 --- a/doc/html/boost/movelib/make_unique_n_idp226293136.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Function template make_unique_nothrow - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template make_unique_nothrow

    -

    boost::movelib::make_unique_nothrow

    -
    -

    Synopsis

    -
    // In header: <boost/move/make_unique.hpp>
-
-
-template<typename T> unique_ptr< T > make_unique_nothrow(std::size_t n);
    -
    -

    Description

    -

    Remarks: This function shall not participate in overload resolution unless T is an array of unknown bound.

    -

    Returns: unique_ptr<T>(new (std::nothrow)remove_extent_t<T>[n]()) (value initialization)

    -
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/movelib/operator___idp102237008.html b/doc/html/boost/movelib/operator___idp102237008.html deleted file mode 100644 index 7d04a0bb1e..0000000000 --- a/doc/html/boost/movelib/operator___idp102237008.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Function template operator== - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator==

    -

    boost::movelib::operator==

    -
    -

    Synopsis

    -
    // In header: <boost/move/unique_ptr.hpp>
-
-
-template<typename T, typename D> 
-  bool operator==(const unique_ptr< T, D > & x, std::nullptr_t);
    -
    -

    Description

    -

    Returns:!x.

    -
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/movelib/operator___idp102242064.html b/doc/html/boost/movelib/operator___idp102242064.html deleted file mode 100644 index a9a8db4df9..0000000000 --- a/doc/html/boost/movelib/operator___idp102242064.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Function template operator== - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator==

    -

    boost::movelib::operator==

    -
    -

    Synopsis

    -
    // In header: <boost/move/unique_ptr.hpp>
-
-
-template<typename T, typename D> 
-  bool operator==(std::nullptr_t, const unique_ptr< T, D > & x);
    -
    -

    Description

    -

    Returns:!x.

    -
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/movelib/operator___idp108149184.html b/doc/html/boost/movelib/operator___idp108149184.html deleted file mode 100644 index f5736138f3..0000000000 --- a/doc/html/boost/movelib/operator___idp108149184.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Function template operator<= - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator<=

    -

    boost::movelib::operator<=

    -
    -

    Synopsis

    -
    // In header: <boost/move/unique_ptr.hpp>
-
-
-template<typename T, typename D> 
-  bool operator<=(const unique_ptr< T, D > & x, std::nullptr_t);
    -
    -

    Description

    -

    Returns: !(nullptr < x).

    -
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/movelib/operator___idp111132784.html b/doc/html/boost/movelib/operator___idp111132784.html deleted file mode 100644 index 151604f85e..0000000000 --- a/doc/html/boost/movelib/operator___idp111132784.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function template operator>= - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator>=

    -

    boost::movelib::operator>=

    -
    -

    Synopsis

    -
    // In header: <boost/move/unique_ptr.hpp>
-
-
-template<typename T1, typename D1, typename T2, typename D2> 
-  bool operator>=(const unique_ptr< T1, D1 > & x, 
-                  const unique_ptr< T2, D2 > & y);
    -
    -

    Description

    -

    Returns:!(x < y).

    -
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/movelib/operator___idp114161104.html b/doc/html/boost/movelib/operator___idp114161104.html deleted file mode 100644 index a7ecb0ac16..0000000000 --- a/doc/html/boost/movelib/operator___idp114161104.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Function template operator!= - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator!=

    -

    boost::movelib::operator!=

    -
    -

    Synopsis

    -
    // In header: <boost/move/unique_ptr.hpp>
-
-
-template<typename T, typename D> 
-  bool operator!=(const unique_ptr< T, D > & x, std::nullptr_t);
    -
    -

    Description

    -

    Returns: (bool)x.

    -
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/movelib/operator___idp154397872.html b/doc/html/boost/movelib/operator___idp154397872.html deleted file mode 100644 index e8905e5752..0000000000 --- a/doc/html/boost/movelib/operator___idp154397872.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function template operator!= - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator!=

    -

    boost::movelib::operator!=

    -
    -

    Synopsis

    -
    // In header: <boost/move/unique_ptr.hpp>
-
-
-template<typename T1, typename D1, typename T2, typename D2> 
-  bool operator!=(const unique_ptr< T1, D1 > & x, 
-                  const unique_ptr< T2, D2 > & y);
    -
    -

    Description

    -

    Returns: x.get() != y.get().

    -
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/movelib/operator___idp154412416.html b/doc/html/boost/movelib/operator___idp154412416.html deleted file mode 100644 index da35b90fb6..0000000000 --- a/doc/html/boost/movelib/operator___idp154412416.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function template operator<= - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator<=

    -

    boost::movelib::operator<=

    -
    -

    Synopsis

    -
    // In header: <boost/move/unique_ptr.hpp>
-
-
-template<typename T1, typename D1, typename T2, typename D2> 
-  bool operator<=(const unique_ptr< T1, D1 > & x, 
-                  const unique_ptr< T2, D2 > & y);
    -
    -

    Description

    -

    Returns: !(y < x).

    -
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/movelib/operator___idp68030480.html b/doc/html/boost/movelib/operator___idp68030480.html deleted file mode 100644 index 0c21788da7..0000000000 --- a/doc/html/boost/movelib/operator___idp68030480.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Function template operator>= - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator>=

    -

    boost::movelib::operator>=

    -
    -

    Synopsis

    -
    // In header: <boost/move/unique_ptr.hpp>
-
-
-template<typename T, typename D> 
-  bool operator>=(const unique_ptr< T, D > & x, std::nullptr_t);
    -
    -

    Description

    -

    Returns: !(x < nullptr).

    -
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/movelib/operator___idp68035984.html b/doc/html/boost/movelib/operator___idp68035984.html deleted file mode 100644 index d94f2e544d..0000000000 --- a/doc/html/boost/movelib/operator___idp68035984.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Function template operator>= - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator>=

    -

    boost::movelib::operator>=

    -
    -

    Synopsis

    -
    // In header: <boost/move/unique_ptr.hpp>
-
-
-template<typename T, typename D> 
-  bool operator>=(std::nullptr_t, const unique_ptr< T, D > & x);
    -
    -

    Description

    -

    Returns: !(nullptr < x).

    -
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/movelib/operator___idp92661952.html b/doc/html/boost/movelib/operator___idp92661952.html deleted file mode 100644 index b5ac2a121c..0000000000 --- a/doc/html/boost/movelib/operator___idp92661952.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Function template operator!= - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator!=

    -

    boost::movelib::operator!=

    -
    -

    Synopsis

    -
    // In header: <boost/move/unique_ptr.hpp>
-
-
-template<typename T, typename D> 
-  bool operator!=(std::nullptr_t, const unique_ptr< T, D > & x);
    -
    -

    Description

    -

    Returns: (bool)x.

    -
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/movelib/operator___idp93814816.html b/doc/html/boost/movelib/operator___idp93814816.html deleted file mode 100644 index d7db48066d..0000000000 --- a/doc/html/boost/movelib/operator___idp93814816.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Function template operator<= - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator<=

    -

    boost::movelib::operator<=

    -
    -

    Synopsis

    -
    // In header: <boost/move/unique_ptr.hpp>
-
-
-template<typename T, typename D> 
-  bool operator<=(std::nullptr_t, const unique_ptr< T, D > & x);
    -
    -

    Description

    -

    Returns: !(x < nullptr).

    -
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/movelib/operator___idp95378464.html b/doc/html/boost/movelib/operator___idp95378464.html deleted file mode 100644 index 506708f435..0000000000 --- a/doc/html/boost/movelib/operator___idp95378464.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function template operator== - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator==

    -

    boost::movelib::operator==

    -
    -

    Synopsis

    -
    // In header: <boost/move/unique_ptr.hpp>
-
-
-template<typename T1, typename D1, typename T2, typename D2> 
-  bool operator==(const unique_ptr< T1, D1 > & x, 
-                  const unique_ptr< T2, D2 > & y);
    -
    -

    Description

    -

    Returns: x.get() == y.get().

    -
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/movelib/operator_idm45507039736960.html b/doc/html/boost/movelib/operator_idm45507039736960.html new file mode 100644 index 0000000000..8e245373ac --- /dev/null +++ b/doc/html/boost/movelib/operator_idm45507039736960.html @@ -0,0 +1,58 @@ + + + + +Function template operator< + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator<

    +

    boost::movelib::operator<

    +
    +

    Synopsis

    +
    // In header: <boost/move/unique_ptr.hpp>
+
+
+template<typename T1, typename D1, typename T2, typename D2> 
+  bool operator<(const unique_ptr< T1, D1 > & x, 
+                 const unique_ptr< T2, D2 > & y);
    +
    +

    Description

    +

    Returns: x.get() < y.get().

    +

    Remarks: This comparison shall induce a strict weak ordering betwen pointers.

    +
    +
    + + + +
    Copyright © 2008-2014 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/movelib/operator_idm45507043441072.html b/doc/html/boost/movelib/operator_idm45507043441072.html new file mode 100644 index 0000000000..bc36164947 --- /dev/null +++ b/doc/html/boost/movelib/operator_idm45507043441072.html @@ -0,0 +1,56 @@ + + + + +Function template operator!= + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator!=

    +

    boost::movelib::operator!=

    +
    +

    Synopsis

    +
    // In header: <boost/move/unique_ptr.hpp>
+
+
+template<typename T, typename D> 
+  bool operator!=(std::nullptr_t, const unique_ptr< T, D > & x);
    +
    +

    Description

    +

    Returns: (bool)x.

    +
    +
    + + + +
    Copyright © 2008-2014 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/movelib/operator_idm45507043992192.html b/doc/html/boost/movelib/operator_idm45507043992192.html new file mode 100644 index 0000000000..69220ae959 --- /dev/null +++ b/doc/html/boost/movelib/operator_idm45507043992192.html @@ -0,0 +1,57 @@ + + + + +Function template operator< + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator<

    +

    boost::movelib::operator<

    +
    +

    Synopsis

    +
    // In header: <boost/move/unique_ptr.hpp>
+
+
+template<typename T, typename D> 
+  bool operator<(const unique_ptr< T, D > & x, std::nullptr_t);
    +
    +

    Description

    +

    Requires: operator shall induce a strict weak ordering on unique_ptr<T, D>::pointer values.

    +

    Returns: Returns x.get() < pointer().

    +
    +
    + + + +
    Copyright © 2008-2014 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/movelib/operator_idm45507045351216.html b/doc/html/boost/movelib/operator_idm45507045351216.html new file mode 100644 index 0000000000..73b2510460 --- /dev/null +++ b/doc/html/boost/movelib/operator_idm45507045351216.html @@ -0,0 +1,57 @@ + + + + +Function template operator!= + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator!=

    +

    boost::movelib::operator!=

    +
    +

    Synopsis

    +
    // In header: <boost/move/unique_ptr.hpp>
+
+
+template<typename T1, typename D1, typename T2, typename D2> 
+  bool operator!=(const unique_ptr< T1, D1 > & x, 
+                  const unique_ptr< T2, D2 > & y);
    +
    +

    Description

    +

    Returns: x.get() != y.get().

    +
    +
    + + + +
    Copyright © 2008-2014 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/movelib/operator_idm45507048472480.html b/doc/html/boost/movelib/operator_idm45507048472480.html new file mode 100644 index 0000000000..cb0967f964 --- /dev/null +++ b/doc/html/boost/movelib/operator_idm45507048472480.html @@ -0,0 +1,56 @@ + + + + +Function template operator!= + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator!=

    +

    boost::movelib::operator!=

    +
    +

    Synopsis

    +
    // In header: <boost/move/unique_ptr.hpp>
+
+
+template<typename T, typename D> 
+  bool operator!=(const unique_ptr< T, D > & x, std::nullptr_t);
    +
    +

    Description

    +

    Returns: (bool)x.

    +
    +
    + + + +
    Copyright © 2008-2014 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/movelib/operator_idm45507048477536.html b/doc/html/boost/movelib/operator_idm45507048477536.html new file mode 100644 index 0000000000..fb60b907d7 --- /dev/null +++ b/doc/html/boost/movelib/operator_idm45507048477536.html @@ -0,0 +1,56 @@ + + + + +Function template operator== + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator==

    +

    boost::movelib::operator==

    +
    +

    Synopsis

    +
    // In header: <boost/move/unique_ptr.hpp>
+
+
+template<typename T, typename D> 
+  bool operator==(std::nullptr_t, const unique_ptr< T, D > & x);
    +
    +

    Description

    +

    Returns:!x.

    +
    +
    + + + +
    Copyright © 2008-2014 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/movelib/operator_idm45507088427888.html b/doc/html/boost/movelib/operator_idm45507088427888.html new file mode 100644 index 0000000000..cc7504ddbd --- /dev/null +++ b/doc/html/boost/movelib/operator_idm45507088427888.html @@ -0,0 +1,57 @@ + + + + +Function template operator> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator>

    +

    boost::movelib::operator>

    +
    +

    Synopsis

    +
    // In header: <boost/move/unique_ptr.hpp>
+
+
+template<typename T1, typename D1, typename T2, typename D2> 
+  bool operator>(const unique_ptr< T1, D1 > & x, 
+                 const unique_ptr< T2, D2 > & y);
    +
    +

    Description

    +

    Returns: y < x.

    +
    +
    + + + +
    Copyright © 2008-2014 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/movelib/operator_idm45507094562544.html b/doc/html/boost/movelib/operator_idm45507094562544.html new file mode 100644 index 0000000000..fb837886b0 --- /dev/null +++ b/doc/html/boost/movelib/operator_idm45507094562544.html @@ -0,0 +1,57 @@ + + + + +Function template operator<= + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator<=

    +

    boost::movelib::operator<=

    +
    +

    Synopsis

    +
    // In header: <boost/move/unique_ptr.hpp>
+
+
+template<typename T1, typename D1, typename T2, typename D2> 
+  bool operator<=(const unique_ptr< T1, D1 > & x, 
+                  const unique_ptr< T2, D2 > & y);
    +
    +

    Description

    +

    Returns: !(y < x).

    +
    +
    + + + +
    Copyright © 2008-2014 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/movelib/operator_idm45507094681568.html b/doc/html/boost/movelib/operator_idm45507094681568.html new file mode 100644 index 0000000000..efede0f6bb --- /dev/null +++ b/doc/html/boost/movelib/operator_idm45507094681568.html @@ -0,0 +1,57 @@ + + + + +Function template operator== + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator==

    +

    boost::movelib::operator==

    +
    +

    Synopsis

    +
    // In header: <boost/move/unique_ptr.hpp>
+
+
+template<typename T1, typename D1, typename T2, typename D2> 
+  bool operator==(const unique_ptr< T1, D1 > & x, 
+                  const unique_ptr< T2, D2 > & y);
    +
    +

    Description

    +

    Returns: x.get() == y.get().

    +
    +
    + + + +
    Copyright © 2008-2014 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/movelib/operator_idm45507096735552.html b/doc/html/boost/movelib/operator_idm45507096735552.html new file mode 100644 index 0000000000..eac29e67c3 --- /dev/null +++ b/doc/html/boost/movelib/operator_idm45507096735552.html @@ -0,0 +1,56 @@ + + + + +Function template operator> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator>

    +

    boost::movelib::operator>

    +
    +

    Synopsis

    +
    // In header: <boost/move/unique_ptr.hpp>
+
+
+template<typename T, typename D> 
+  bool operator>(std::nullptr_t, const unique_ptr< T, D > & x);
    +
    +

    Description

    +

    Returns: x < nullptr.

    +
    +
    + + + +
    Copyright © 2008-2014 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/movelib/operator_idm45507096741056.html b/doc/html/boost/movelib/operator_idm45507096741056.html new file mode 100644 index 0000000000..0ce48e1322 --- /dev/null +++ b/doc/html/boost/movelib/operator_idm45507096741056.html @@ -0,0 +1,56 @@ + + + + +Function template operator> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator>

    +

    boost::movelib::operator>

    +
    +

    Synopsis

    +
    // In header: <boost/move/unique_ptr.hpp>
+
+
+template<typename T, typename D> 
+  bool operator>(const unique_ptr< T, D > & x, std::nullptr_t);
    +
    +

    Description

    +

    Returns: nullptr < x.

    +
    +
    + + + +
    Copyright © 2008-2014 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/movelib/operator_idm45507098051056.html b/doc/html/boost/movelib/operator_idm45507098051056.html new file mode 100644 index 0000000000..e97e7376f7 --- /dev/null +++ b/doc/html/boost/movelib/operator_idm45507098051056.html @@ -0,0 +1,56 @@ + + + + +Function template operator<= + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator<=

    +

    boost::movelib::operator<=

    +
    +

    Synopsis

    +
    // In header: <boost/move/unique_ptr.hpp>
+
+
+template<typename T, typename D> 
+  bool operator<=(const unique_ptr< T, D > & x, std::nullptr_t);
    +
    +

    Description

    +

    Returns: !(nullptr < x).

    +
    +
    + + + +
    Copyright © 2008-2014 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/movelib/operator_idm45507101134656.html b/doc/html/boost/movelib/operator_idm45507101134656.html new file mode 100644 index 0000000000..c5c59bf5b1 --- /dev/null +++ b/doc/html/boost/movelib/operator_idm45507101134656.html @@ -0,0 +1,56 @@ + + + + +Function template operator<= + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator<=

    +

    boost::movelib::operator<=

    +
    +

    Synopsis

    +
    // In header: <boost/move/unique_ptr.hpp>
+
+
+template<typename T, typename D> 
+  bool operator<=(std::nullptr_t, const unique_ptr< T, D > & x);
    +
    +

    Description

    +

    Returns: !(x < nullptr).

    +
    +
    + + + +
    Copyright © 2008-2014 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/movelib/operator_idm45507104752784.html b/doc/html/boost/movelib/operator_idm45507104752784.html new file mode 100644 index 0000000000..543ee97063 --- /dev/null +++ b/doc/html/boost/movelib/operator_idm45507104752784.html @@ -0,0 +1,57 @@ + + + + +Function template operator< + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator<

    +

    boost::movelib::operator<

    +
    +

    Synopsis

    +
    // In header: <boost/move/unique_ptr.hpp>
+
+
+template<typename T, typename D> 
+  bool operator<(std::nullptr_t, const unique_ptr< T, D > & x);
    +
    +

    Description

    +

    Requires: operator shall induce a strict weak ordering on unique_ptr<T, D>::pointer values.

    +

    Returns: Returns pointer() < x.get().

    +
    +
    + + + +
    Copyright © 2008-2014 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/movelib/operator_idm45507107568208.html b/doc/html/boost/movelib/operator_idm45507107568208.html new file mode 100644 index 0000000000..1245e1bd8d --- /dev/null +++ b/doc/html/boost/movelib/operator_idm45507107568208.html @@ -0,0 +1,56 @@ + + + + +Function template operator== + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator==

    +

    boost::movelib::operator==

    +
    +

    Synopsis

    +
    // In header: <boost/move/unique_ptr.hpp>
+
+
+template<typename T, typename D> 
+  bool operator==(const unique_ptr< T, D > & x, std::nullptr_t);
    +
    +

    Description

    +

    Returns:!x.

    +
    +
    + + + +
    Copyright © 2008-2014 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/movelib/operator_idm45507109686992.html b/doc/html/boost/movelib/operator_idm45507109686992.html new file mode 100644 index 0000000000..57cbddb0ae --- /dev/null +++ b/doc/html/boost/movelib/operator_idm45507109686992.html @@ -0,0 +1,56 @@ + + + + +Function template operator>= + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator>=

    +

    boost::movelib::operator>=

    +
    +

    Synopsis

    +
    // In header: <boost/move/unique_ptr.hpp>
+
+
+template<typename T, typename D> 
+  bool operator>=(std::nullptr_t, const unique_ptr< T, D > & x);
    +
    +

    Description

    +

    Returns: !(nullptr < x).

    +
    +
    + + + +
    Copyright © 2008-2014 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/movelib/operator_idm45507109692496.html b/doc/html/boost/movelib/operator_idm45507109692496.html new file mode 100644 index 0000000000..1b2d14fd89 --- /dev/null +++ b/doc/html/boost/movelib/operator_idm45507109692496.html @@ -0,0 +1,56 @@ + + + + +Function template operator>= + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator>=

    +

    boost::movelib::operator>=

    +
    +

    Synopsis

    +
    // In header: <boost/move/unique_ptr.hpp>
+
+
+template<typename T, typename D> 
+  bool operator>=(const unique_ptr< T, D > & x, std::nullptr_t);
    +
    +

    Description

    +

    Returns: !(x < nullptr).

    +
    +
    + + + +
    Copyright © 2008-2014 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/movelib/operator_idm45507163238016.html b/doc/html/boost/movelib/operator_idm45507163238016.html new file mode 100644 index 0000000000..619ccfcb69 --- /dev/null +++ b/doc/html/boost/movelib/operator_idm45507163238016.html @@ -0,0 +1,57 @@ + + + + +Function template operator>= + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator>=

    +

    boost::movelib::operator>=

    +
    +

    Synopsis

    +
    // In header: <boost/move/unique_ptr.hpp>
+
+
+template<typename T1, typename D1, typename T2, typename D2> 
+  bool operator>=(const unique_ptr< T1, D1 > & x, 
+                  const unique_ptr< T2, D2 > & y);
    +
    +

    Description

    +

    Returns:!(x < y).

    +
    +
    + + + +
    Copyright © 2008-2014 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/movelib/operator_idp101104320.html b/doc/html/boost/movelib/operator_idp101104320.html deleted file mode 100644 index a09462cd50..0000000000 --- a/doc/html/boost/movelib/operator_idp101104320.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function template operator> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator>

    -

    boost::movelib::operator>

    -
    -

    Synopsis

    -
    // In header: <boost/move/unique_ptr.hpp>
-
-
-template<typename T1, typename D1, typename T2, typename D2> 
-  bool operator>(const unique_ptr< T1, D1 > & x, 
-                 const unique_ptr< T2, D2 > & y);
    -
    -

    Description

    -

    Returns: y < x.

    -
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/movelib/operator_idp105771664.html b/doc/html/boost/movelib/operator_idp105771664.html deleted file mode 100644 index fcb686994b..0000000000 --- a/doc/html/boost/movelib/operator_idp105771664.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Function template operator> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator>

    -

    boost::movelib::operator>

    -
    -

    Synopsis

    -
    // In header: <boost/move/unique_ptr.hpp>
-
-
-template<typename T, typename D> 
-  bool operator>(std::nullptr_t, const unique_ptr< T, D > & x);
    -
    -

    Description

    -

    Returns: x < nullptr.

    -
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/movelib/operator_idp151794496.html b/doc/html/boost/movelib/operator_idp151794496.html deleted file mode 100644 index c284a817ab..0000000000 --- a/doc/html/boost/movelib/operator_idp151794496.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Function template operator> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator>

    -

    boost::movelib::operator>

    -
    -

    Synopsis

    -
    // In header: <boost/move/unique_ptr.hpp>
-
-
-template<typename T, typename D> 
-  bool operator>(const unique_ptr< T, D > & x, std::nullptr_t);
    -
    -

    Description

    -

    Returns: nullptr < x.

    -
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/movelib/operator_idp154404928.html b/doc/html/boost/movelib/operator_idp154404928.html deleted file mode 100644 index 8d5465c55e..0000000000 --- a/doc/html/boost/movelib/operator_idp154404928.html +++ /dev/null @@ -1,58 +0,0 @@ - - - - -Function template operator< - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator<

    -

    boost::movelib::operator<

    -
    -

    Synopsis

    -
    // In header: <boost/move/unique_ptr.hpp>
-
-
-template<typename T1, typename D1, typename T2, typename D2> 
-  bool operator<(const unique_ptr< T1, D1 > & x, 
-                 const unique_ptr< T2, D2 > & y);
    -
    -

    Description

    -

    Returns: x.get() < y.get().

    -

    Remarks: This comparison shall induce a strict weak ordering betwen pointers.

    -
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/movelib/operator_idp92667008.html b/doc/html/boost/movelib/operator_idp92667008.html deleted file mode 100644 index cf1e09e03a..0000000000 --- a/doc/html/boost/movelib/operator_idp92667008.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function template operator< - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator<

    -

    boost::movelib::operator<

    -
    -

    Synopsis

    -
    // In header: <boost/move/unique_ptr.hpp>
-
-
-template<typename T, typename D> 
-  bool operator<(const unique_ptr< T, D > & x, std::nullptr_t);
    -
    -

    Description

    -

    Requires: operator shall induce a strict weak ordering on unique_ptr<T, D>::pointer values.

    -

    Returns: Returns x.get() < pointer().

    -
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/movelib/operator_idp96679536.html b/doc/html/boost/movelib/operator_idp96679536.html deleted file mode 100644 index a6d68a2d41..0000000000 --- a/doc/html/boost/movelib/operator_idp96679536.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function template operator< - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator<

    -

    boost::movelib::operator<

    -
    -

    Synopsis

    -
    // In header: <boost/move/unique_ptr.hpp>
-
-
-template<typename T, typename D> 
-  bool operator<(std::nullptr_t, const unique_ptr< T, D > & x);
    -
    -

    Description

    -

    Requires: operator shall induce a strict weak ordering on unique_ptr<T, D>::pointer values.

    -

    Returns: Returns pointer() < x.get().

    -
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/movelib/swap_idm45507037906240.html b/doc/html/boost/movelib/swap_idm45507037906240.html new file mode 100644 index 0000000000..beb9b3b1ef --- /dev/null +++ b/doc/html/boost/movelib/swap_idm45507037906240.html @@ -0,0 +1,56 @@ + + + + +Function template swap + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template swap

    +

    boost::movelib::swap

    +
    +

    Synopsis

    +
    // In header: <boost/move/unique_ptr.hpp>
+
+
+template<typename T, typename D> 
+  void swap(unique_ptr< T, D > & x, unique_ptr< T, D > & y);
    +
    +

    Description

    +

    Effects: Calls x.swap(y).

    +
    +
    + + + +
    Copyright © 2008-2014 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/movelib/swap_idp95372832.html b/doc/html/boost/movelib/swap_idp95372832.html deleted file mode 100644 index 816ce4fd89..0000000000 --- a/doc/html/boost/movelib/swap_idp95372832.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Function template swap - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template swap

    -

    boost::movelib::swap

    -
    -

    Synopsis

    -
    // In header: <boost/move/unique_ptr.hpp>
-
-
-template<typename T, typename D> 
-  void swap(unique_ptr< T, D > & x, unique_ptr< T, D > & y);
    -
    -

    Description

    -

    Effects: Calls x.swap(y).

    -
    -
    - - - -
    Copyright © 2008-2014 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/movelib/unique_ptr.html b/doc/html/boost/movelib/unique_ptr.html index 0caafe3a4f..0d661eb650 100644 --- a/doc/html/boost/movelib/unique_ptr.html +++ b/doc/html/boost/movelib/unique_ptr.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -41,40 +41,40 @@ typedef D deleter_type; // construct/copy/destruct - unique_ptr(const unique_ptr &) = delete; - unique_ptr() noexcept; - unique_ptr(std::nullptr_t) noexcept; - template<typename Pointer> explicit unique_ptr(Pointer) noexcept; - template<typename Pointer> unique_ptr(Pointer, see_documentation) noexcept; - unique_ptr(std::nullptr_t, see_documentation) noexcept; - template<typename Pointer> unique_ptr(Pointer, see_documentation) noexcept; - unique_ptr(std::nullptr_t, see_documentation) noexcept; - unique_ptr(unique_ptr &&) noexcept; + unique_ptr(const unique_ptr &) = delete; + unique_ptr() noexcept; + unique_ptr(std::nullptr_t) noexcept; + template<typename Pointer> explicit unique_ptr(Pointer) noexcept; + template<typename Pointer> unique_ptr(Pointer, see_documentation) noexcept; + unique_ptr(std::nullptr_t, see_documentation) noexcept; + template<typename Pointer> unique_ptr(Pointer, see_documentation) noexcept; + unique_ptr(std::nullptr_t, see_documentation) noexcept; + unique_ptr(unique_ptr &&) noexcept; template<typename U, typename E> - unique_ptr(BOOST_RV_REF_BEG_IF_CXX11 unique_ptr< U, E > BOOST_RV_REF_END_IF_CXX11) noexcept; - unique_ptr & operator=(const unique_ptr &) = delete; - unique_ptr & operator=(unique_ptr &&) noexcept; + unique_ptr(BOOST_RV_REF_BEG_IF_CXX11 unique_ptr< U, E > BOOST_RV_REF_END_IF_CXX11) noexcept; + unique_ptr & operator=(const unique_ptr &) = delete; + unique_ptr & operator=(unique_ptr &&) noexcept; template<typename U, typename E> - unique_ptr & operator=(unique_ptr< U, E > &&) noexcept; - unique_ptr & operator=(std::nullptr_t) noexcept; - ~unique_ptr(); + unique_ptr & operator=(unique_ptr< U, E > &&) noexcept; + unique_ptr & operator=(std::nullptr_t) noexcept; + ~unique_ptr(); - // public member functions - element_type & operator*() const noexcept; - element_type & operator[](std::size_t) const noexcept; - pointer operator->() const noexcept; - pointer get() const noexcept; - D & get_deleter() noexcept; - const D & get_deleter() const noexcept; - explicit operator bool() const noexcept; - pointer release() noexcept; - template<typename Pointer> void reset(Pointer) noexcept; - void reset() noexcept; - void reset(std::nullptr_t) noexcept; - void swap(unique_ptr &) noexcept; + // public member functions + element_type & operator*() const noexcept; + element_type & operator[](std::size_t) const noexcept; + pointer operator->() const noexcept; + pointer get() const noexcept; + D & get_deleter() noexcept; + const D & get_deleter() const noexcept; + explicit operator bool() const noexcept; + pointer release() noexcept; + template<typename Pointer> void reset(Pointer) noexcept; + void reset() noexcept; + void reset(std::nullptr_t) noexcept; + void swap(unique_ptr &) noexcept; };
    -

    Description

    +

    Description

    A unique pointer is an object that owns another object and manages that other object through a pointer.

    More precisely, a unique pointer is an object u that stores a pointer to a second object p and will dispose of p when u is itself destroyed (e.g., when leaving block scope). In this context, u is said to own p.

    The mechanism by which u disposes of p is known as p's associated deleter, a function object whose correct invocation results in p's appropriate disposition (typically its deletion).

    @@ -101,7 +101,7 @@

    -

    Template Parameters

    +

    Template Parameters

    1. typename T
      @@ -121,7 +121,7 @@
    -

    +

    unique_ptr public types

    @@ -139,25 +139,25 @@
    -

    +

    unique_ptr public construct/copy/destruct

      -
    1. unique_ptr(const unique_ptr &) = delete;
      2. +
    2. unique_ptr(const unique_ptr &) = delete;
    3. -
      unique_ptr() noexcept;
      +
      unique_ptr() noexcept;

      Requires: D shall satisfy the requirements of DefaultConstructible, and that construction shall not throw an exception.

      Effects: Constructs a unique_ptr object that owns nothing, value-initializing the stored pointer and the stored deleter.

      Postconditions: get() == nullptr. get_deleter() returns a reference to the stored deleter.

      Remarks: If this constructor is instantiated with a pointer type or reference type for the template argument D, the program is ill-formed.

    4. -
      unique_ptr(std::nullptr_t) noexcept;
      +
      unique_ptr(std::nullptr_t) noexcept;

      Effects: Same as unique_ptr() (default constructor).

    5. -
      template<typename Pointer> explicit unique_ptr(Pointer p) noexcept;
      +
      template<typename Pointer> explicit unique_ptr(Pointer p) noexcept;

      Requires: D shall satisfy the requirements of DefaultConstructible, and that construction shall not throw an exception.

      Effects: Constructs a unique_ptr which owns p, initializing the stored pointer with p and value initializing the stored deleter.

      Postconditions: get() == p. get_deleter() returns a reference to the stored deleter.

      @@ -171,7 +171,7 @@ 
    6. template<typename Pointer> 
-  unique_ptr(Pointer p, see_documentation d1) noexcept;
      + unique_ptr(Pointer p, see_documentation d1) noexcept;

      The signature of this constructor depends upon whether D is a reference type.

      • If D is non-reference type A, then the signature is unique_ptr(pointer p, const A& d).

        • @@ -198,12 +198,12 @@

      • -
        unique_ptr(std::nullptr_t, see_documentation d1) noexcept;
        +
        unique_ptr(std::nullptr_t, see_documentation d1) noexcept;

        Effects: Same effects as template<class Pointer> unique_ptr(Pointer p, deleter_arg_type1 d1) and additionally get() == nullptr 

      • template<typename Pointer> 
-  unique_ptr(Pointer p, see_documentation d2) noexcept;
        + unique_ptr(Pointer p, see_documentation d2) noexcept;

        The signature of this constructor depends upon whether D is a reference type.

        • If D is non-reference type A, then the signature is unique_ptr(pointer p, A&& d).

          • @@ -230,18 +230,18 @@

        • -
          unique_ptr(std::nullptr_t, see_documentation d2) noexcept;
          +
          unique_ptr(std::nullptr_t, see_documentation d2) noexcept;

          Effects: Same effects as template<class Pointer> unique_ptr(Pointer p, deleter_arg_type2 d2) and additionally get() == nullptr

        • -
          unique_ptr(unique_ptr && u) noexcept;
          +
          unique_ptr(unique_ptr && u) noexcept;

          Requires: If D is not a reference type, D shall satisfy the requirements of MoveConstructible. Construction of the deleter from an rvalue of type D shall not throw an exception.

          Effects: Constructs a unique_ptr by transferring ownership from u to *this. If D is a reference type, this deleter is copy constructed from u's deleter; otherwise, this deleter is move constructed from u's deleter.

          Postconditions: get() yields the value u.get() yielded before the construction. get_deleter() returns a reference to the stored deleter that was constructed from u.get_deleter(). If D is a reference type then get_deleter() and u.get_deleter() both reference the same lvalue deleter. 

        • template<typename U, typename E> 
-  unique_ptr(BOOST_RV_REF_BEG_IF_CXX11 unique_ptr< U, E > BOOST_RV_REF_END_IF_CXX11 u) noexcept;
          + unique_ptr(BOOST_RV_REF_BEG_IF_CXX11 unique_ptr< U, E > BOOST_RV_REF_END_IF_CXX11 u) noexcept;

          Requires: If E is not a reference type, construction of the deleter from an rvalue of type E shall be well formed and shall not throw an exception. Otherwise, E is a reference type and construction of the deleter from an lvalue of type E shall be well formed and shall not throw an exception.

          Remarks: This constructor shall not participate in overload resolution unless:

            @@ -254,16 +254,16 @@

            Effects: Constructs a unique_ptr by transferring ownership from u to *this. If E is a reference type, this deleter is copy constructed from u's deleter; otherwise, this deleter is move constructed from u's deleter.

            Postconditions: get() yields the value u.get() yielded before the construction. get_deleter() returns a reference to the stored deleter that was constructed from u.get_deleter().

            -
          • unique_ptr & operator=(const unique_ptr &) = delete;
            • +
          • unique_ptr & operator=(const unique_ptr &) = delete;
          • -
            unique_ptr & operator=(unique_ptr && u) noexcept;
            +
            unique_ptr & operator=(unique_ptr && u) noexcept;

            Requires: If D is not a reference type, D shall satisfy the requirements of MoveAssignable and assignment of the deleter from an rvalue of type D shall not throw an exception. Otherwise, D is a reference type; remove_reference<D>::type shall satisfy the CopyAssignable requirements and assignment of the deleter from an lvalue of type D shall not throw an exception.

            Effects: Transfers ownership from u to *this as if by calling reset(u.release()) followed by get_deleter() = std::forward<D>(u.get_deleter()).

            Returns: *this. 

          • template<typename U, typename E> 
-  unique_ptr & operator=(unique_ptr< U, E > && u) noexcept;
            + unique_ptr & operator=(unique_ptr< U, E > && u) noexcept;

            Requires: If E is not a reference type, assignment of the deleter from an rvalue of type E shall be well-formed and shall not throw an exception. Otherwise, E is a reference type and assignment of the deleter from an lvalue of type E shall be well-formed and shall not throw an exception.

            Remarks: This operator shall not participate in overload resolution unless:

              @@ -276,13 +276,13 @@

              Returns: *this.

            • -
              unique_ptr & operator=(std::nullptr_t) noexcept;
              +
              unique_ptr & operator=(std::nullptr_t) noexcept;

              Effects: reset().

              Postcondition: get() == nullptr

              Returns: *this.

            • -
              ~unique_ptr();
              +
              ~unique_ptr();

              Requires: The expression get_deleter()(get()) shall be well formed, shall have well-defined behavior, and shall not throw exceptions.

              Effects: If get() == nullpt1r there are no effects. Otherwise get_deleter()(get()).

              Note: The use of default_delete requires T to be a complete type

              @@ -290,51 +290,51 @@
    -

    -unique_ptr public member functions

    +

    +unique_ptr public member functions

    1. -
      element_type & operator*() const noexcept;
      +
      element_type & operator*() const noexcept;

      Requires: get() != nullptr.

      Returns: *get().

      Remarks</b: If T is an array type, the program is ill-formed.

    2. -
      element_type & operator[](std::size_t i) const noexcept;
      +
      element_type & operator[](std::size_t i) const noexcept;

      Requires: i < the number of elements in the array to which the stored pointer points.

      Returns: get()[i].

      Remarks</b: If T is not an array type, the program is ill-formed.

    3. -
      pointer operator->() const noexcept;
      +
      pointer operator->() const noexcept;

      Requires: get() != nullptr.

      Returns: get().

      Note: use typically requires that T be a complete type.

      Remarks</b: If T is an array type, the program is ill-formed.

    4. -
      pointer get() const noexcept;
      +
      pointer get() const noexcept;

      Returns: The stored pointer.

    5. -
      D & get_deleter() noexcept;
      +
      D & get_deleter() noexcept;

      Returns: A reference to the stored deleter.

    6. -
      const D & get_deleter() const noexcept;
      +
      const D & get_deleter() const noexcept;

      Returns: A reference to the stored deleter.

    7. -
      explicit operator bool() const noexcept;
      +
      explicit operator bool() const noexcept;

      Returns: Returns: get() != nullptr.

    8. -
      pointer release() noexcept;
      +
      pointer release() noexcept;

      Postcondition: get() == nullptr.

      Returns: The value get() had at the start of the call to release.

    9. -
      template<typename Pointer> void reset(Pointer p) noexcept;
      +
      template<typename Pointer> void reset(Pointer p) noexcept;

      Requires: The expression get_deleter()(get()) shall be well formed, shall have well-defined behavior, and shall not throw exceptions.

      Effects: assigns p to the stored pointer, and then if the old value of the stored pointer, old_p, was not equal to nullptr, calls get_deleter()(old_p). Note: The order of these operations is significant because the call to get_deleter() may destroy *this.

      Postconditions: get() == p. Note: The postcondition does not hold if the call to get_deleter() destroys *this since this->get() is no longer a valid expression.

      @@ -347,17 +347,17 @@

    10. -
      void reset() noexcept;
      +
      void reset() noexcept;

      Requires: The expression get_deleter()(get()) shall be well formed, shall have well-defined behavior, and shall not throw exceptions.

      Effects: assigns nullptr to the stored pointer, and then if the old value of the stored pointer, old_p, was not equal to nullptr, calls get_deleter()(old_p). Note: The order of these operations is significant because the call to get_deleter() may destroy *this.

      Postconditions: get() == p. Note: The postcondition does not hold if the call to get_deleter() destroys *this since this->get() is no longer a valid expression.

    11. -
      void reset(std::nullptr_t) noexcept;
      +
      void reset(std::nullptr_t) noexcept;

      Effects: Same as reset()

    12. -
      void swap(unique_ptr & u) noexcept;
      +
      void swap(unique_ptr & u) noexcept;

      Requires: get_deleter() shall be swappable and shall not throw an exception under swap.

      Effects: Invokes swap on the stored pointers and on the stored deleters of *this and u.

      13. @@ -375,7 +375,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/mpi/all_gather.html b/doc/html/boost/mpi/all_gather.html index d2529e63f1..aa35bb108d 100644 --- a/doc/html/boost/mpi/all_gather.html +++ b/doc/html/boost/mpi/all_gather.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      @@ -46,7 +46,7 @@ void all_gather(const communicator & comm, const T * in_values, int n, T * out_values);
      -

      Description

      +

      Description

      all_gather is a collective algorithm that collects the values stored at each process into a vector of values indexed by the process number they came from. The type T of the values may be any type that is serializable or has an associated MPI data type.

      When the type T has an associated MPI data type, this routine invokes MPI_Allgather to gather the values.

      @@ -94,7 +94,7 @@

      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/mpi/all_reduce.html b/doc/html/boost/mpi/all_reduce.html index 702415607b..b27862fae5 100644 --- a/doc/html/boost/mpi/all_reduce.html +++ b/doc/html/boost/mpi/all_reduce.html @@ -47,7 +47,7 @@ template<typename T, typename Op> void all_reduce(const communicator & comm, inplace_t< T > value, Op op);
      -

      Description

      +

      Description

      all_reduce is a collective algorithm that combines the values stored by each process into a single value available to all processes. The values are combined in a user-defined way, specified via a function object. The type T of the values may be any type that is serializable or has an associated MPI data type. One can think of this operation as a all_gather, followed by an std::accumulate() over the gather values and using the operation op.

      When the type T has an associated MPI data type, this routine invokes MPI_Allreduce to perform the reduction. If possible, built-in MPI operations will be used; otherwise, all_reduce() will create a custom MPI_Op for the call to MPI_Allreduce.

      diff --git a/doc/html/boost/mpi/all_to_all.html b/doc/html/boost/mpi/all_to_all.html index 8413931c95..85bbfc30ba 100644 --- a/doc/html/boost/mpi/all_to_all.html +++ b/doc/html/boost/mpi/all_to_all.html @@ -48,7 +48,7 @@ void all_to_all(const communicator & comm, const T * in_values, int n, T * out_values);

      -

      Description

      +

      Description

      all_to_all is a collective algorithm that transmits p values from every process to every other process. On process i, jth value of the in_values vector is sent to process j and placed in the ith position of the out_values vector in process j. The type T of the values may be any type that is serializable or has an associated MPI data type. If n is provided, then arrays of n values will be transferred from one process to another.

      When the type T has an associated MPI data type, this routine invokes MPI_Alltoall to scatter the values.

      diff --git a/doc/html/boost/mpi/allocato_idm45506984689984.html b/doc/html/boost/mpi/allocato_idm45506984689984.html new file mode 100644 index 0000000000..f8783d36e8 --- /dev/null +++ b/doc/html/boost/mpi/allocato_idm45506984689984.html @@ -0,0 +1,70 @@ + + + + +Class allocator<void> + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +

      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Class allocator<void>

      +

      boost::mpi::allocator<void> — Allocator specialization for void value types.

      +
      +

      Synopsis

      +
      // In header: <boost/mpi/allocator.hpp>
+
+
+class allocator<void> {
+public:
+  // types
+  typedef void *       pointer;      
+  typedef const void * const_pointer;
+  typedef void         value_type;   
+
+  // member classes/structs/unions
+  template<typename U> 
+  struct rebind {
+    // types
+    typedef allocator< U > other;
+  };
+};
      +
      +

      Description

      +

      The void specialization of allocator is useful only for rebinding to another, different value type.

      +
      +
      + + + +
      Copyright © 2005-2007 Douglas Gregor, + Matthias Troyer, Trustees of Indiana University

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at + http://www.boost.org/LICENSE_1_0.txt ) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/mpi/allocato_idm45506984689984/rebind.html b/doc/html/boost/mpi/allocato_idm45506984689984/rebind.html new file mode 100644 index 0000000000..8016e2a980 --- /dev/null +++ b/doc/html/boost/mpi/allocato_idm45506984689984/rebind.html @@ -0,0 +1,57 @@ + + + + +Struct template rebind + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Struct template rebind

      +

      boost::mpi::allocator<void>::rebind

      +
      +

      Synopsis

      +
      // In header: <boost/mpi/allocator.hpp>
+
+
+template<typename U> 
+struct rebind {
+  // types
+  typedef allocator< U > other;
+};
      +
      + + + +
      Copyright © 2005-2007 Douglas Gregor, + Matthias Troyer, Trustees of Indiana University

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at + http://www.boost.org/LICENSE_1_0.txt ) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/mpi/allocator.html b/doc/html/boost/mpi/allocator.html index 99c5f3f61f..4d88da6da3 100644 --- a/doc/html/boost/mpi/allocator.html +++ b/doc/html/boost/mpi/allocator.html @@ -55,62 +55,62 @@ }; // construct/copy/destruct - allocator(); - allocator(const allocator &); - template<typename U> allocator(const allocator< U > &); - ~allocator(); + allocator(); + allocator(const allocator &); + template<typename U> allocator(const allocator< U > &); + ~allocator(); - // public member functions - pointer address(reference) const; - const_pointer address(const_reference) const; - pointer allocate(size_type, allocator< void >::const_pointer = 0); - void deallocate(pointer, size_type); - size_type max_size() const; - void construct(pointer, const T &); - void destroy(pointer); + // public member functions + pointer address(reference) const; + const_pointer address(const_reference) const; + pointer allocate(size_type, allocator< void >::const_pointer = 0); + void deallocate(pointer, size_type); + size_type max_size() const; + void construct(pointer, const T &); + void destroy(pointer); };
      -

      Description

      +

      Description

      This allocator provides a standard C++ interface to the MPI_Alloc_mem and MPI_Free_mem routines of MPI-2. It is intended to be used with the containers in the Standard Library (vector, in particular) in cases where the contents of the container will be directly transmitted via MPI. This allocator is also used internally by the library for character buffers that will be used in the transmission of data.

      The allocator class template only provides MPI memory allocation when the underlying MPI implementation is either MPI-2 compliant or is known to provide MPI_Alloc_mem and MPI_Free_mem as extensions. When the MPI memory allocation routines are not available, allocator is brought in directly from namespace std, so that standard allocators are used throughout. The macro BOOST_MPI_HAS_MEMORY_ALLOCATION will be defined when the MPI-2 memory allocation facilities are available.

      -

      +

      allocator public construct/copy/destruct

      1. -
        allocator();
        +
        allocator();

        Default-construct an allocator.

      2. -
        allocator(const allocator &);
        +
        allocator(const allocator &);

        Copy-construct an allocator.

      3. -
        template<typename U> allocator(const allocator< U > &);
        +
        template<typename U> allocator(const allocator< U > &);

        Copy-construct an allocator from another allocator for a different value type.

      4. -
        ~allocator();
        +
        ~allocator();

        Destroy an allocator.

      -

      -allocator public member functions

      +

      +allocator public member functions

      1. -
        pointer address(reference x) const;
        +
        pointer address(reference x) const;

        Returns the address of object x.

      2. -
        const_pointer address(const_reference x) const;
        +
        const_pointer address(const_reference x) const;

        Returns the address of object x.

      3. -
        pointer allocate(size_type n, allocator< void >::const_pointer = 0);
        +
        pointer allocate(size_type n, allocator< void >::const_pointer = 0);

        Allocate enough memory for n elements of type T.

        @@ -142,7 +142,7 @@

    13. -
      void deallocate(pointer p, size_type);
      +
      void deallocate(pointer p, size_type);

      Deallocate memory referred to by the pointer p.

      @@ -167,22 +167,22 @@
    14. -
      size_type max_size() const;
      +
      size_type max_size() const;

      Returns the maximum number of elements that can be allocated with allocate().

    15. -
      void construct(pointer p, const T & val);
      +
      void construct(pointer p, const T & val);

      Construct a copy of val at the location referenced by p.

    16. -
      void destroy(pointer p);
      +
      void destroy(pointer p);

      Destroy the object referenced by p.

    -

    Specializations

    -
    +

    Specializations

    +
    diff --git a/doc/html/boost/mpi/allocator/rebind.html b/doc/html/boost/mpi/allocator/rebind.html index 3b5f8df79c..0b579f82b5 100644 --- a/doc/html/boost/mpi/allocator/rebind.html +++ b/doc/html/boost/mpi/allocator/rebind.html @@ -6,9 +6,9 @@ - + - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -54,7 +54,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/mpi/allocator_voi_idp114760400.html b/doc/html/boost/mpi/allocator_voi_idp114760400.html deleted file mode 100644 index b387c142af..0000000000 --- a/doc/html/boost/mpi/allocator_voi_idp114760400.html +++ /dev/null @@ -1,70 +0,0 @@ - - - - -Class allocator<void> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Class allocator<void>

    -

    boost::mpi::allocator<void> — Allocator specialization for void value types.

    -
    -

    Synopsis

    -
    // In header: <boost/mpi/allocator.hpp>
-
-
-class allocator<void> {
-public:
-  // types
-  typedef void *       pointer;      
-  typedef const void * const_pointer;
-  typedef void         value_type;   
-
-  // member classes/structs/unions
-  template<typename U> 
-  struct rebind {
-    // types
-    typedef allocator< U > other;
-  };
-};
    -
    -

    Description

    -

    The void specialization of allocator is useful only for rebinding to another, different value type.

    -
    -
    - - - -
    Copyright © 2005-2007 Douglas Gregor, - Matthias Troyer, Trustees of Indiana University

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at - http://www.boost.org/LICENSE_1_0.txt ) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/mpi/allocator_voi_idp114760400/rebind.html b/doc/html/boost/mpi/allocator_voi_idp114760400/rebind.html deleted file mode 100644 index 3de227e012..0000000000 --- a/doc/html/boost/mpi/allocator_voi_idp114760400/rebind.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Struct template rebind - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template rebind

    -

    boost::mpi::allocator<void>::rebind

    -
    -

    Synopsis

    -
    // In header: <boost/mpi/allocator.hpp>
-
-
-template<typename U> 
-struct rebind {
-  // types
-  typedef allocator< U > other;
-};
    -
    - - - -
    Copyright © 2005-2007 Douglas Gregor, - Matthias Troyer, Trustees of Indiana University

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at - http://www.boost.org/LICENSE_1_0.txt ) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/mpi/any_source.html b/doc/html/boost/mpi/any_source.html index 28e42d3de0..23427f3a8f 100644 --- a/doc/html/boost/mpi/any_source.html +++ b/doc/html/boost/mpi/any_source.html @@ -34,7 +34,7 @@ const int any_source;
    -

    Description

    +

    Description

    This constant may be used for the source parameter of receive operations to indicate that a message may be received from any source.

    diff --git a/doc/html/boost/mpi/any_tag.html b/doc/html/boost/mpi/any_tag.html index 73406a83f5..e58573f83a 100644 --- a/doc/html/boost/mpi/any_tag.html +++ b/doc/html/boost/mpi/any_tag.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -34,7 +34,7 @@ const int any_tag;
    -

    Description

    +

    Description

    This constant may be used for the tag parameter of receive operations to indicate that a send with any tag will be matched by the receive.

    @@ -50,7 +50,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/mpi/bitwise_and.html b/doc/html/boost/mpi/bitwise_and.html index a195380034..a2d0fabbc4 100644 --- a/doc/html/boost/mpi/bitwise_and.html +++ b/doc/html/boost/mpi/bitwise_and.html @@ -35,17 +35,17 @@ template<typename T> struct bitwise_and : public std::binary_function< T, T, T > { - // public member functions - T operator()(const T &, const T &) const; + // public member functions + T operator()(const T &, const T &) const; };
    -

    Description

    +

    Description

    This binary function object computes the bitwise AND of the two values it is given. When used with MPI and a type T that has an associated, built-in MPI data type, translates to MPI_BAND.

    -

    -bitwise_and public member functions

    +

    +bitwise_and public member functions

    1. -
      T operator()(const T & x, const T & y) const;
      +
      T operator()(const T & x, const T & y) const;

      diff --git a/doc/html/boost/mpi/bitwise_or.html b/doc/html/boost/mpi/bitwise_or.html index 721a8bdf81..724e89a3a4 100644 --- a/doc/html/boost/mpi/bitwise_or.html +++ b/doc/html/boost/mpi/bitwise_or.html @@ -35,17 +35,17 @@ template<typename T>structbitwise_or:publicstd::binary_function<T,T,T>{ - // public member functions - Toperator()(constT&,constT&)const; + // public member functions + Toperator()(constT&,constT&)const;};
      -

      Description

      +

      Description

      This binary function object computes the bitwise OR of the two values it is given. When used with MPI and a type T that has an associated, built-in MPI data type, translates to MPI_BOR.

      -

      -bitwise_or public member functions

      +

      +bitwise_or public member functions

      1. -
        T operator()(const T & x, const T & y) const;
        +
        T operator()(const T & x, const T & y) const;

      diff --git a/doc/html/boost/mpi/bitwise_xor.html b/doc/html/boost/mpi/bitwise_xor.html index 61ec5adcfa..bd913bfb42 100644 --- a/doc/html/boost/mpi/bitwise_xor.html +++ b/doc/html/boost/mpi/bitwise_xor.html @@ -35,17 +35,17 @@ template<typename T>structbitwise_xor:publicstd::binary_function<T,T,T>{ - // public member functions - Toperator()(constT&,constT&)const; + // public member functions + Toperator()(constT&,constT&)const;};
      -

      Description

      +

      Description

      This binary function object computes the bitwise exclusive OR of the two values it is given. When used with MPI and a type T that has an associated, built-in MPI data type, translates to MPI_BXOR.

      -

      -bitwise_xor public member functions

      +

      +bitwise_xor public member functions

      1. -
        T operator()(const T & x, const T & y) const;
        +
        T operator()(const T & x, const T & y) const;

      diff --git a/doc/html/boost/mpi/broadcast.html b/doc/html/boost/mpi/broadcast.html index 7cb498a6b6..f392eb13f1 100644 --- a/doc/html/boost/mpi/broadcast.html +++ b/doc/html/boost/mpi/broadcast.html @@ -44,7 +44,7 @@ voidbroadcast(constcommunicator& comm,constskeleton_proxy<T>& value,int root);
      -

      Description

      +

      Description

      broadcast is a collective algorithm that transfers a value from an arbitrary root process to every other process that is part of the given communicator. The broadcast algorithm can transmit any Serializable value, values that have associated MPI data types, packed archives, skeletons, and the content of skeletons; see the send primitive for communicators for a complete list. The type T shall be the same for all processes that are a part of the communicator comm, unless packed archives are being transferred: with packed archives, the root sends a packed_oarchive or packed_skeleton_oarchive whereas the other processes receive a packed_iarchive or packed_skeleton_iarchve, respectively.

      When the type T has an associated MPI data type, this routine invokes MPI_Bcast to perform the broadcast.

      diff --git a/doc/html/boost/mpi/comm_create_kind.html b/doc/html/boost/mpi/comm_create_kind.html index c1415cb725..3b79403568 100644 --- a/doc/html/boost/mpi/comm_create_kind.html +++ b/doc/html/boost/mpi/comm_create_kind.html @@ -36,7 +36,7 @@ enum comm_create_kind { comm_duplicate, comm_take_ownership, comm_attach };

      -

      Description

      +

      Description

      The values for this enumeration determine how a Boost.MPI communicator will behave when constructed with an MPI communicator. The options are:

      -

      Description

      +

      Description

      The communicator class abstracts a set of communicating processes in MPI. All of the processes that belong to a certain communicator can determine the size of the communicator, their rank within the communicator, and communicate with any other processes in the communicator.

      -

      +

      communicator public construct/copy/destruct

      1. -
        communicator();
        +
        communicator();

        Build a new Boost.MPI communicator for MPI_COMM_WORLD.

        Constructs a Boost.MPI communicator that attaches to MPI_COMM_WORLD. This is the equivalent of constructing with (MPI_COMM_WORLD, comm_attach).

      2. -
        communicator(const MPI_Comm & comm, comm_create_kind kind);
        +
        communicator(const MPI_Comm & comm, comm_create_kind kind);

        Build a new Boost.MPI communicator based on the MPI communicator comm.

        comm may be any valid MPI communicator. If comm is MPI_COMM_NULL, an empty communicator (that cannot be used for communication) is created and the kind parameter is ignored. Otherwise, the kind parameters determines how the Boost.MPI communicator will be related to comm:

          @@ -103,7 +103,7 @@

        • -
          communicator(const communicator & comm, const boost::mpi::group & subgroup);
          +
          communicator(const communicator & comm, const boost::mpi::group & subgroup);

          Build a new Boost.MPI communicator based on a subgroup of another MPI communicator.

          This routine will construct a new communicator containing all of the processes from communicator comm that are listed within the group subgroup. Equivalent to MPI_Comm_create.

          @@ -137,11 +137,11 @@

      -

      -communicator public member functions

      +

      +communicator public member functions

      1. -
        int rank() const;
        Determine the rank of the executing process in a communicator.

        This routine is equivalent to MPI_Comm_rank.

        +
        int rank() const;
        Determine the rank of the executing process in a communicator.

        This routine is equivalent to MPI_Comm_rank.

      @@ -156,7 +156,7 @@
    2. -
      int size() const;
      Determine the number of processes in a communicator.

      This routine is equivalent to MPI_Comm_size.

      +
      int size() const;
      Determine the number of processes in a communicator.

      This routine is equivalent to MPI_Comm_size.

      @@ -171,11 +171,11 @@
    3. -
      boost::mpi::group group() const;
      +
      boost::mpi::group group() const;

      This routine constructs a new group whose members are the processes within this communicator. Equivalent to calling MPI_Comm_group.

    4. -
      template<typename T> void send(int dest, int tag, const T & value) const;
      Send data to another process.

      This routine executes a potentially blocking send with tag tag to the process with rank dest. It can be received by the destination process with a matching recv call.

      +
      template<typename T> void send(int dest, int tag, const T & value) const;
      Send data to another process.

      This routine executes a potentially blocking send with tag tag to the process with rank dest. It can be received by the destination process with a matching recv call.

      The given value must be suitable for transmission over MPI. There are several classes of types that meet these requirements:

      • Types with mappings to MPI data types: If is_mpi_datatype<T> is convertible to mpl::true_, then value will be transmitted using the MPI data type get_mpi_datatype<T>(). All primitive C++ data types that have MPI equivalents, e.g., int, float, char, double, etc., have built-in mappings to MPI data types. You may turn a Serializable type with fixed structure into an MPI data type by specializing is_mpi_datatype for your type.

        • @@ -220,7 +220,7 @@ 
      • template<typename T> 
-  void send(int dest, int tag, const skeleton_proxy< T > & proxy) const;
        Send the skeleton of an object.

        This routine executes a potentially blocking send with tag tag to the process with rank dest. It can be received by the destination process with a matching recv call. This variation on send will be used when a send of a skeleton is explicitly requested via code such as:

        + void send(int dest, int tag, const skeleton_proxy< T > & proxy) const;Send the skeleton of an object.

        This routine executes a potentially blocking send with tag tag to the process with rank dest. It can be received by the destination process with a matching recv call. This variation on send will be used when a send of a skeleton is explicitly requested via code such as:

        comm.send(dest, tag, skeleton(object));

        The semantics of this routine are equivalent to that of sending a packed_skeleton_oarchive storing the skeleton of the object.

        @@ -258,7 +258,7 @@ 
      • template<typename T> 
-  void send(int dest, int tag, const T * values, int n) const;
        Send an array of values to another process.

        This routine executes a potentially blocking send of an array of data with tag tag to the process with rank dest. It can be received by the destination process with a matching array recv call.

        + void send(int dest, int tag, const T * values, int n) const;Send an array of values to another process.

        This routine executes a potentially blocking send of an array of data with tag tag to the process with rank dest. It can be received by the destination process with a matching array recv call.

        If T is an MPI datatype, an invocation of this routine will be mapped to a single call to MPI_Send, using the datatype get_mpi_datatype<T>().

        @@ -297,7 +297,7 @@
    5. -
      void send(int dest, int tag) const;
      Send a message to another process without any data.

      This routine executes a potentially blocking send of a message to another process. The message contains no extra data, and can therefore only be received by a matching call to recv().

      +
      void send(int dest, int tag) const;
      Send a message to another process without any data.

      This routine executes a potentially blocking send of a message to another process. The message contains no extra data, and can therefore only be received by a matching call to recv().

      @@ -327,7 +327,7 @@
    6. -
      template<typename T> status recv(int source, int tag, T & value) const;
      Receive data from a remote process.

      This routine blocks until it receives a message from the process source with the given tag. The type T of the value must be suitable for transmission over MPI, which includes serializable types, types that can be mapped to MPI data types (including most built-in C++ types), packed MPI archives, skeletons, and content associated with skeletons; see the documentation of send for a complete description.

      +
      template<typename T> status recv(int source, int tag, T & value) const;
      Receive data from a remote process.

      This routine blocks until it receives a message from the process source with the given tag. The type T of the value must be suitable for transmission over MPI, which includes serializable types, types that can be mapped to MPI data types (including most built-in C++ types), packed MPI archives, skeletons, and content associated with skeletons; see the documentation of send for a complete description.

      @@ -369,7 +369,7 @@ 
    7. template<typename T> 
-  status recv(int source, int tag, const skeleton_proxy< T > & proxy) const;
      Receive a skeleton from a remote process.

      This routine blocks until it receives a message from the process source with the given tag containing a skeleton.

      + status recv(int source, int tag, const skeleton_proxy< T > & proxy) const;Receive a skeleton from a remote process.

      This routine blocks until it receives a message from the process source with the given tag containing a skeleton.

      @@ -411,7 +411,7 @@ 
    8. template<typename T> 
-  status recv(int source, int tag, skeleton_proxy< T > & proxy) const;
      Receive a skeleton from a remote process.

      This routine blocks until it receives a message from the process source with the given tag containing a skeleton.

      + status recv(int source, int tag, skeleton_proxy< T > & proxy) const;Receive a skeleton from a remote process.

      This routine blocks until it receives a message from the process source with the given tag containing a skeleton.

      @@ -452,7 +452,7 @@
  • -
    template<typename T> status recv(int source, int tag, T * values, int n) const;
    Receive an array of values from a remote process.

    This routine blocks until it receives an array of values from the process source with the given tag. If the type T is

    +
    template<typename T> status recv(int source, int tag, T * values, int n) const;
    Receive an array of values from a remote process.

    This routine blocks until it receives an array of values from the process source with the given tag. If the type T is

    @@ -502,7 +502,7 @@

  • -
    status recv(int source, int tag) const;
    Receive a message from a remote process without any data.

    This routine blocks until it receives a message from the process source with the given tag.

    +
    status recv(int source, int tag) const;
    Receive a message from a remote process without any data.

    This routine blocks until it receives a message from the process source with the given tag.

    @@ -540,10 +540,10 @@ 
  • template<typename T> 
-  status sendrecv(int dest, int stag, const T & sval, int src, int rtag, 
+  status sendrecv(int dest, int stag, const T & sval, int src, int rtag, 
                   T & rval) const;
    Send a message to remote process nd receive another message from another process.
  • -
    template<typename T> request isend(int dest, int tag, const T & value) const;
    Send a message to a remote process without blocking.

    The isend method is functionality identical to the send method and transmits data in the same way, except that isend will not block while waiting for the data to be transmitted. Instead, a request object will be immediately returned, allowing one to query the status of the communication or wait until it has completed.

    +
    template<typename T> request isend(int dest, int tag, const T & value) const;
    Send a message to a remote process without blocking.

    The isend method is functionality identical to the send method and transmits data in the same way, except that isend will not block while waiting for the data to be transmitted. Instead, a request object will be immediately returned, allowing one to query the status of the communication or wait until it has completed.

    @@ -585,7 +585,7 @@ 
  • template<typename T> 
-  request isend(int dest, int tag, const skeleton_proxy< T > & proxy) const;
    Send the skeleton of an object without blocking.

    This routine is functionally identical to the send method for skeleton_proxy objects except that isend will not block while waiting for the data to be transmitted. Instead, a request object will be immediately returned, allowing one to query the status of the communication or wait until it has completed.

    + request isend(int dest, int tag, const skeleton_proxy< T > & proxy) const;Send the skeleton of an object without blocking.

    This routine is functionally identical to the send method for skeleton_proxy objects except that isend will not block while waiting for the data to be transmitted. Instead, a request object will be immediately returned, allowing one to query the status of the communication or wait until it has completed.

    The semantics of this routine are equivalent to a non-blocking send of a packed_skeleton_oarchive storing the skeleton of the object.

    @@ -628,7 +628,7 @@ 

  • template<typename T> 
-  request isend(int dest, int tag, const T * values, int n) const;
    Send an array of values to another process without blocking.

    This routine is functionally identical to the send method for arrays except that isend will not block while waiting for the data to be transmitted. Instead, a request object will be immediately returned, allowing one to query the status of the communication or wait until it has completed.

    + request isend(int dest, int tag, const T * values, int n) const;Send an array of values to another process without blocking.

    This routine is functionally identical to the send method for arrays except that isend will not block while waiting for the data to be transmitted. Instead, a request object will be immediately returned, allowing one to query the status of the communication or wait until it has completed.

    @@ -673,7 +673,7 @@
  • -
    request isend(int dest, int tag) const;
    Send a message to another process without any data without blocking.

    This routine is functionally identical to the send method for sends with no data, except that isend will not block while waiting for the message to be transmitted. Instead, a request object will be immediately returned, allowing one to query the status of the communication or wait until it has completed.

    +
    request isend(int dest, int tag) const;
    Send a message to another process without any data without blocking.

    This routine is functionally identical to the send method for sends with no data, except that isend will not block while waiting for the message to be transmitted. Instead, a request object will be immediately returned, allowing one to query the status of the communication or wait until it has completed.

    @@ -710,7 +710,7 @@
  • -
    template<typename T> request irecv(int source, int tag, T & value) const;
    Prepare to receive a message from a remote process.

    The irecv method is functionally identical to the recv method and receive data in the same way, except that irecv will not block while waiting for data to be transmitted. Instead, it immediately returns a request object that allows one to query the status of the receive or wait until it has completed.

    +
    template<typename T> request irecv(int source, int tag, T & value) const;
    Prepare to receive a message from a remote process.

    The irecv method is functionally identical to the recv method and receive data in the same way, except that irecv will not block while waiting for data to be transmitted. Instead, it immediately returns a request object that allows one to query the status of the receive or wait until it has completed.

    @@ -752,7 +752,7 @@ 
  • template<typename T> 
-  request irecv(int source, int tag, T * values, int n) const;
    Initiate receipt of an array of values from a remote process.

    This routine initiates a receive operation for an array of values transmitted by process source with the given tag.

    + request irecv(int source, int tag, T * values, int n) const;Initiate receipt of an array of values from a remote process.

    This routine initiates a receive operation for an array of values transmitted by process source with the given tag.

    @@ -797,7 +797,7 @@
  • -
    request irecv(int source, int tag) const;
    Initiate receipt of a message from a remote process that carries no data.

    This routine initiates a receive operation for a message from process source with the given tag that carries no data.

    +
    request irecv(int source, int tag) const;
    Initiate receipt of a message from a remote process that carries no data.

    This routine initiates a receive operation for a message from process source with the given tag that carries no data.

    @@ -834,7 +834,7 @@
  • -
    status probe(int source = any_source, int tag = any_tag) const;
    Waits until a message is available to be received.

    This operation waits until a message matching (source, tag) is available to be received. It then returns information about that message. The functionality is equivalent to MPI_Probe. To check if a message is available without blocking, use iprobe.

    +
    status probe(int source = any_source, int tag = any_tag) const;
    Waits until a message is available to be received.

    This operation waits until a message matching (source, tag) is available to be received. It then returns information about that message. The functionality is equivalent to MPI_Probe. To check if a message is available without blocking, use iprobe.

    @@ -871,7 +871,7 @@
  • -
    optional< status > iprobe(int source = any_source, int tag = any_tag) const;
    Determine if a message is available to be received.

    This operation determines if a message matching (source, tag) is available to be received. If so, it returns information about that message; otherwise, it returns immediately with an empty optional. The functionality is equivalent to MPI_Iprobe. To wait until a message is available, use wait.

    +
    optional< status > iprobe(int source = any_source, int tag = any_tag) const;
    Determine if a message is available to be received.

    This operation determines if a message matching (source, tag) is available to be received. If so, it returns information about that message; otherwise, it returns immediately with an empty optional. The functionality is equivalent to MPI_Iprobe. To wait until a message is available, use wait.

    @@ -908,13 +908,13 @@
  • -
    void barrier() const;
    Wait for all processes within a communicator to reach the barrier.

    This routine is a collective operation that blocks each process until all processes have entered it, then releases all of the processes "simultaneously". It is equivalent to MPI_Barrier.

    +
    void barrier() const;
    Wait for all processes within a communicator to reach the barrier.

    This routine is a collective operation that blocks each process until all processes have entered it, then releases all of the processes "simultaneously". It is equivalent to MPI_Barrier.

  • -
    operator bool() const;
    Determine if this communicator is valid for communication.

    Evaluates true in a boolean context if this communicator is valid for communication, i.e., does not represent MPI_COMM_NULL. Otherwise, evaluates false.

    +
    operator bool() const;
    Determine if this communicator is valid for communication.

    Evaluates true in a boolean context if this communicator is valid for communication, i.e., does not represent MPI_COMM_NULL. Otherwise, evaluates false.

  • -
    operator MPI_Comm() const;
    Access the MPI communicator associated with a Boost.MPI communicator.

    This routine permits the implicit conversion from a Boost.MPI communicator to an MPI communicator.

    +
    operator MPI_Comm() const;
    Access the MPI communicator associated with a Boost.MPI communicator.

    This routine permits the implicit conversion from a Boost.MPI communicator to an MPI communicator.

    @@ -929,7 +929,7 @@
  • -
    communicator split(int color) const;
    +
    communicator split(int color) const;

    Split the communicator into multiple, disjoint communicators each of which is based on a particular color. This is a collective operation that returns a new communicator that is a subgroup of this. This routine is functionally equivalent to MPI_Comm_split.

    @@ -961,7 +961,7 @@

  • -
    communicator split(int color, int key) const;
    +
    communicator split(int color, int key) const;

    Split the communicator into multiple, disjoint communicators each of which is based on a particular color. This is a collective operation that returns a new communicator that is a subgroup of this. This routine is functionally equivalent to MPI_Comm_split.

    @@ -999,7 +999,7 @@

  • -
    optional< intercommunicator > as_intercommunicator() const;
    +
    optional< intercommunicator > as_intercommunicator() const;

    Determine if the communicator is in fact an intercommunicator and, if so, return that intercommunicator.

    @@ -1015,7 +1015,7 @@
  • -
    optional< graph_communicator > as_graph_communicator() const;
    +
    optional< graph_communicator > as_graph_communicator() const;

    Determine if the communicator has a graph topology and, if so, return that graph_communicator. Even though the communicators have different types, they refer to the same underlying communication space and can be used interchangeably for communication.

    @@ -1031,11 +1031,11 @@
  • -
    bool has_cartesian_topology() const;
    +
    bool has_cartesian_topology() const;

    Determines whether this communicator has a Cartesian topology.

  • -
    void abort(int errcode) const;
    +
    void abort(int errcode) const;

    Abort all tasks in the group of this communicator.

    Makes a "best attempt" to abort all of the tasks in the group of this communicator. Depending on the underlying MPI implementation, this may either abort the entire program (and possibly return errcode to the environment) or only abort some processes, allowing the others to continue. Consult the documentation for your MPI implementation. This is equivalent to a call to MPI_Abort

    diff --git a/doc/html/boost/mpi/content.html b/doc/html/boost/mpi/content.html index 9a671eb8ea..52be8518f5 100644 --- a/doc/html/boost/mpi/content.html +++ b/doc/html/boost/mpi/content.html @@ -36,30 +36,30 @@ class content { public: // construct/copy/destruct - content(); - content(MPI_Datatype, bool = true); - const content & operator=(MPI_Datatype); + content(); + content(MPI_Datatype, bool = true); + const content & operator=(MPI_Datatype); - // public member functions - MPI_Datatype get_mpi_datatype() const; - void commit(); + // public member functions + MPI_Datatype get_mpi_datatype() const; + void commit(); };

    -

    Description

    +

    Description

    The content class indicates that Boost.MPI should transmit or receive the content of an object, but without any information about the structure of the object. It is only meaningful to transmit the content of an object after the receiver has already received the skeleton for the same object.

    Most users will not use content objects directly. Rather, they will invoke send, recv, or broadcast operations using get_content().

    -

    +

    content public construct/copy/destruct

    1. -
      content();
      +
      content();

      Constructs an empty content object. This object will not be useful for any Boost.MPI operations until it is reassigned.

    2. -
      content(MPI_Datatype d, bool committed = true);
      +
      content(MPI_Datatype d, bool committed = true);

      This routine initializes the content object with an MPI data type that refers to the content of an object without its structure.

      @@ -90,7 +90,7 @@
  • -
    const content & operator=(MPI_Datatype d);
    +
    const content & operator=(MPI_Datatype d);

    Replace the MPI data type referencing the content of an object.

    @@ -124,11 +124,11 @@

    -

    -content public member functions

    +

    +content public member functions

    1. -
      MPI_Datatype get_mpi_datatype() const;
      +
      MPI_Datatype get_mpi_datatype() const;

      Retrieve the MPI data type that refers to the content of the object.

      @@ -144,7 +144,7 @@
  • -
    void commit();
    +
    void commit();

    Commit the MPI data type referring to the content of the object.

    • diff --git a/doc/html/boost/mpi/environment.html b/doc/html/boost/mpi/environment.html index c483a13ae6..cc2115d93d 100644 --- a/doc/html/boost/mpi/environment.html +++ b/doc/html/boost/mpi/environment.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -36,26 +36,26 @@ class environment : private noncopyable { public: // construct/copy/destruct - explicit environment(bool = true); - explicit environment(threading::level, bool = true); - environment(int &, char **&, bool = true); - environment(int &, char **&, threading::level, bool = true); - ~environment(); + explicit environment(bool = true); + explicit environment(threading::level, bool = true); + environment(int &, char **&, bool = true); + environment(int &, char **&, threading::level, bool = true); + ~environment(); - // public static functions - static void abort(int); - static bool initialized(); - static bool finalized(); - static int max_tag(); - static int collectives_tag(); - static optional< int > host_rank(); - static optional< int > io_rank(); - static std::string processor_name(); - static threading::level thread_level(); - static bool is_main_thread(); + // public static functions + static void abort(int); + static bool initialized(); + static bool finalized(); + static int max_tag(); + static int collectives_tag(); + static optional< int > host_rank(); + static optional< int > io_rank(); + static std::string processor_name(); + static threading::level thread_level(); + static bool is_main_thread(); };
    -

    Description

    +

    Description

    The environment class is used to initialize, finalize, and query the MPI environment. It will typically be used in the main() function of a program, which will create a single instance of environment initialized with the arguments passed to the program:

    int main(int argc, char* argv[])
 {
@@ -65,13 +65,13 @@
 
    The instance of environment will initialize MPI (by calling MPI_Init) in its constructor and finalize MPI (by calling MPI_Finalize for normal termination or MPI_Abort for an uncaught exception) in its destructor.
    
 
    The use of environment is not mandatory. Users may choose to invoke MPI_Init and MPI_Finalize manually. In this case, no environment object is needed. If one is created, however, it will do nothing on either construction or destruction. 
    
 
    
-
    
+
    
 environment 
         public
        construct/copy/destruct
    
 
      
 
    1. 
-
      explicit environment(bool abort_on_exception = true);
      
+
      explicit environment(bool abort_on_exception = true);
      
 
      Initialize the MPI environment.
      
 
      If the MPI environment has not already been initialized, initializes MPI with a call to MPI_Init. Since this constructor does not take command-line arguments (argc and argv), it is only available when the underlying MPI implementation supports calling MPI_Init with NULL arguments, indicated by the macro BOOST_MPI_HAS_NOARG_INITIALIZATION.
      
 
      
@@ -97,7 +97,7 @@
 
    
 
 
  • 
-
    explicit environment(threading::level mt_level, 
+
    explicit environment(threading::level mt_level, 
                      bool abort_on_exception = true);
    
 
    Initialize the MPI environment.
    
 
    If the MPI environment has not already been initialized, initializes MPI with a call to MPI_Init_thread. Since this constructor does not take command-line arguments (argc and argv), it is only available when the underlying MPI implementation supports calling MPI_Init with NULL arguments, indicated by the macro BOOST_MPI_HAS_NOARG_INITIALIZATION.
    
@@ -130,7 +130,7 @@
 
    • 
 
 
  • 
-
    environment(int & argc, char **& argv, bool abort_on_exception = true);
    
+
    environment(int & argc, char **& argv, bool abort_on_exception = true);
    
 
    Initialize the MPI environment.
    
 
    If the MPI environment has not already been initialized, initializes MPI with a call to MPI_Init.
    
 
    
@@ -166,7 +166,7 @@
  • -
    environment(int & argc, char **& argv, threading::level mt_level, 
+
    environment(int & argc, char **& argv, threading::level mt_level, 
             bool abort_on_exception = true);
    
 
    Initialize the MPI environment.
    
 
    If the MPI environment has not already been initialized, initializes MPI with a call to MPI_Init_thread.
    
@@ -207,18 +207,18 @@
  • -
    ~environment();
    +
    ~environment();

    Shuts down the MPI environment.

    If this environment object was used to initialize the MPI environment, and the MPI environment has not already been shut down (finalized), this destructor will shut down the MPI environment. Under normal circumstances, this only involves invoking MPI_Finalize. However, if destruction is the result of an uncaught exception and the abort_on_exception parameter of the constructor had the value true, this destructor will invoke MPI_Abort with MPI_COMM_WORLD to abort the entire MPI program with a result code of -1.

    • -

    -environment public static functions

    +

    +environment public static functions

    1. -
      static void abort(int errcode);
      +
      static void abort(int errcode);

      Abort all MPI processes.

      Aborts all MPI processes and returns to the environment. The precise behavior will be defined by the underlying MPI implementation. This is equivalent to a call to MPI_Abort with MPI_COMM_WORLD.

      @@ -251,7 +251,7 @@

  • -
    static bool initialized();
    +
    static bool initialized();

    Determine if the MPI environment has already been initialized.

    This routine is equivalent to a call to MPI_Initialized.

    @@ -268,7 +268,7 @@

  • -
    static bool finalized();
    +
    static bool finalized();

    Determine if the MPI environment has already been finalized.

    The routine is equivalent to a call to MPI_Finalized.

    @@ -285,7 +285,7 @@

  • -
    static int max_tag();
    +
    static int max_tag();

    Retrieves the maximum tag value.

    Returns the maximum value that may be used for the tag parameter of send/receive operations. This value will be somewhat smaller than the value of MPI_TAG_UB, because the Boost.MPI implementation reserves some tags for collective operations.

    @@ -302,7 +302,7 @@

  • -
    static int collectives_tag();
    +
    static int collectives_tag();

    The tag value used for collective operations.

    Returns the reserved tag value used by the Boost.MPI implementation for collective operations. Although users are not permitted to use this tag to send or receive messages, it may be useful when monitoring communication patterns.

    @@ -319,7 +319,7 @@

  • -
    static optional< int > host_rank();
    +
    static optional< int > host_rank();

    Retrieves the rank of the host process, if one exists.

    If there is a host process, this routine returns the rank of that process. Otherwise, it returns an empty optional<int>. MPI does not define the meaning of a "host" process: consult the documentation for the MPI implementation. This routine examines the MPI_HOST attribute of MPI_COMM_WORLD.

    @@ -336,7 +336,7 @@

  • -
    static optional< int > io_rank();
    +
    static optional< int > io_rank();

    Retrieves the rank of a process that can perform input/output.

    This routine returns the rank of a process that can perform input/output via the standard C and C++ I/O facilities. If every process can perform I/O using the standard facilities, this routine will return any_source; if no process can perform I/O, this routine will return no value (an empty optional). This routine examines the MPI_IO attribute of MPI_COMM_WORLD.

    @@ -353,7 +353,7 @@

  • -
    static std::string processor_name();
    +
    static std::string processor_name();

    Retrieve the name of this processor.

    This routine returns the name of this processor. The actual form of the name is unspecified, but may be documented by the underlying MPI implementation. This routine is implemented as a call to MPI_Get_processor_name.

    @@ -370,11 +370,11 @@

  • -
    static threading::level thread_level();
    +
    static threading::level thread_level();

    Query the current level of thread support.

  • -
    static bool is_main_thread();
    +
    static bool is_main_thread();

    Are we in the main thread?

    • @@ -393,7 +393,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/mpi/exception.html b/doc/html/boost/mpi/exception.html index 6afd2e0984..8eda941140 100644 --- a/doc/html/boost/mpi/exception.html +++ b/doc/html/boost/mpi/exception.html @@ -36,26 +36,26 @@ class exception : public exception { public: // construct/copy/destruct - exception(const char *, int); - ~exception(); + exception(const char *, int); + ~exception(); - // public member functions - virtual const char * what() const; - const char * routine() const; - int result_code() const; - int error_class() const; + // public member functions + virtual const char * what() const; + const char * routine() const; + int result_code() const; + int error_class() const; };
    -

    Description

    +

    Description

    Instances of this class will be thrown when an MPI error occurs. MPI failures that trigger these exceptions may or may not be recoverable, depending on the underlying MPI implementation. Consult the documentation for your MPI implementation to determine the effect of MPI errors.

    -

    +

    exception public construct/copy/destruct

    1. -
      exception(const char * routine, int result_code);
      +
      exception(const char * routine, int result_code);

      Build a new exception exception.

      @@ -85,25 +85,25 @@
    -
  • ~exception();
    • +
  • ~exception();
    • -

    -exception public member functions

    +

    +exception public member functions

    1. -
      virtual const char * what() const;
      +
      virtual const char * what() const;

      A description of the error that occurred.

    2. -
      const char * routine() const;
      +
      const char * routine() const;

      Retrieve the name of the MPI routine that reported the error.

    3. -
      int result_code() const;
      Retrieve the result code returned from the MPI routine that reported the error.
      4. +
      int result_code() const;
      Retrieve the result code returned from the MPI routine that reported the error.
    4. -
      int error_class() const;
      Returns the MPI error class associated with the error that triggered this exception.
      5. +
      int error_class() const;
      Returns the MPI error class associated with the error that triggered this exception.
    diff --git a/doc/html/boost/mpi/gather.html b/doc/html/boost/mpi/gather.html index b44d9cbfe6..e5c8bd53c7 100644 --- a/doc/html/boost/mpi/gather.html +++ b/doc/html/boost/mpi/gather.html @@ -50,7 +50,7 @@ template<typename T> void gather(const communicator & comm, const T * in_values, int n, int root);
    -

    Description

    +

    Description

    gather is a collective algorithm that collects the values stored at each process into a vector of values at the root process. This vector is indexed by the process number that the value came from. The type T of the values may be any type that is serializable or has an associated MPI data type.

    When the type T has an associated MPI data type, this routine invokes MPI_Gather to gather the values.

    diff --git a/doc/html/boost/mpi/gatherv.html b/doc/html/boost/mpi/gatherv.html index 24d48c3c2d..f60549a42b 100644 --- a/doc/html/boost/mpi/gatherv.html +++ b/doc/html/boost/mpi/gatherv.html @@ -54,7 +54,7 @@ void gatherv(const communicator & comm, const std::vector< T > & in_values, T * out_values, const std::vector< int > & sizes, int root);

    -

    Description

    +

    Description

    diff --git a/doc/html/boost/mpi/get_content.html b/doc/html/boost/mpi/get_content.html index 4c59aaf3a1..4704760ac1 100644 --- a/doc/html/boost/mpi/get_content.html +++ b/doc/html/boost/mpi/get_content.html @@ -35,7 +35,7 @@ template<typename T>constcontentget_content(constT& x);
    -

    Description

    +

    Description

    The function creates an absolute MPI datatype for the object, where all offsets are counted from the address 0 (a.k.a. MPI_BOTTOM) instead of the address &x of the object. This allows the creation of MPI data types for complex data structures containing pointers, such as linked lists or trees.

    The disadvantage, compared to relative MPI data types is that for each object a new MPI data type has to be created.

    The contents of an object can only be transmitted when the receiver already has an object with the same structure or shape as the sender. To accomplish this, first transmit the skeleton of the object using, e.g., skeleton() or skeleton_proxy.

    diff --git a/doc/html/boost/mpi/get_idm45507160469824.html b/doc/html/boost/mpi/get_idm45507160469824.html new file mode 100644 index 0000000000..ab44d37370 --- /dev/null +++ b/doc/html/boost/mpi/get_idm45507160469824.html @@ -0,0 +1,57 @@ + + + + +Function get + + + + + + + + +
    + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function get

    +

    boost::mpi::get — Returns the index of a vertex in the communicator's graph topology.

    +
    +

    Synopsis

    +
    // In header: <boost/mpi/graph_communicator.hpp>
+
+
+int get(vertex_index_t, const graph_communicator &, int vertex);
    +
    +

    Description

    +

    Since the vertices are ranks in the communicator, this is the identity function.

    +
    +
    + + + +
    Copyright © 2005-2007 Douglas Gregor, + Matthias Troyer, Trustees of Indiana University

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at + http://www.boost.org/LICENSE_1_0.txt ) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/mpi/get_idm45507160473392.html b/doc/html/boost/mpi/get_idm45507160473392.html new file mode 100644 index 0000000000..337264b946 --- /dev/null +++ b/doc/html/boost/mpi/get_idm45507160473392.html @@ -0,0 +1,57 @@ + + + + +Function get + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function get

    +

    boost::mpi::get — Returns a property map that maps from vertices in a communicator's graph topology to their index values.

    +
    +

    Synopsis

    +
    // In header: <boost/mpi/graph_communicator.hpp>
+
+
+identity_property_map get(vertex_index_t, const graph_communicator &);
    +
    +

    Description

    +

    Since the vertices are ranks in the communicator, the returned property map is the identity property map.

    +
    +
    + + + +
    Copyright © 2005-2007 Douglas Gregor, + Matthias Troyer, Trustees of Indiana University

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at + http://www.boost.org/LICENSE_1_0.txt ) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/mpi/get_idp110722032.html b/doc/html/boost/mpi/get_idp110722032.html deleted file mode 100644 index 9d0fb98ce7..0000000000 --- a/doc/html/boost/mpi/get_idp110722032.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function get - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function get

    -

    boost::mpi::get — Returns a property map that maps from vertices in a communicator's graph topology to their index values.

    -
    -

    Synopsis

    -
    // In header: <boost/mpi/graph_communicator.hpp>
-
-
-identity_property_map get(vertex_index_t, const graph_communicator &);
    -
    -

    Description

    -

    Since the vertices are ranks in the communicator, the returned property map is the identity property map.

    -
    -
    - - - -
    Copyright © 2005-2007 Douglas Gregor, - Matthias Troyer, Trustees of Indiana University

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at - http://www.boost.org/LICENSE_1_0.txt ) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/mpi/get_idp224410352.html b/doc/html/boost/mpi/get_idp224410352.html deleted file mode 100644 index 04c9cd6ed0..0000000000 --- a/doc/html/boost/mpi/get_idp224410352.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function get - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function get

    -

    boost::mpi::get — Returns the index of a vertex in the communicator's graph topology.

    -
    -

    Synopsis

    -
    // In header: <boost/mpi/graph_communicator.hpp>
-
-
-int get(vertex_index_t, const graph_communicator &, int vertex);
    -
    -

    Description

    -

    Since the vertices are ranks in the communicator, this is the identity function.

    -
    -
    - - - -
    Copyright © 2005-2007 Douglas Gregor, - Matthias Troyer, Trustees of Indiana University

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at - http://www.boost.org/LICENSE_1_0.txt ) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/mpi/get_mpi__idm45507086028144.html b/doc/html/boost/mpi/get_mpi__idm45507086028144.html new file mode 100644 index 0000000000..d029bfd16f --- /dev/null +++ b/doc/html/boost/mpi/get_mpi__idm45507086028144.html @@ -0,0 +1,87 @@ + + + + +Function template get_mpi_datatype + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template get_mpi_datatype

    +

    boost::mpi::get_mpi_datatype — Returns an MPI data type for a C++ type.

    +
    +

    Synopsis

    +
    // In header: <boost/mpi/datatype.hpp>
+
+
+template<typename T> MPI_Datatype get_mpi_datatype(const T & x);
    +
    +

    Description

    +

    The function creates an MPI data type for the given object x. The first time it is called for a class T, the MPI data type is created and cached. Subsequent calls for objects of the same type T return the cached MPI data type. The type T must allow creation of an MPI data type. That is, it must be Serializable and is_mpi_datatype<T> must derive mpl::true_.

    +

    For fundamental MPI types, a copy of the MPI data type of the MPI library is returned.

    +

    Note that since the data types are cached, the caller should never call MPI_Type_free() for the MPI data type returned by this call.

    +

    + +

    +
    ++++ + + + + + + + + + + +

    Parameters:

    ++++ + + + + +

    x

    for an optimized call, a constructed object of the type should be passed; otherwise, an object will be default-constructed.

    Returns:

    The MPI data type corresponding to type T.

    +
    +
    + + + +
    Copyright © 2005-2007 Douglas Gregor, + Matthias Troyer, Trustees of Indiana University

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at + http://www.boost.org/LICENSE_1_0.txt ) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/mpi/get_mpi_datat_idp216170320.html b/doc/html/boost/mpi/get_mpi_datat_idp216170320.html deleted file mode 100644 index 330ce906c4..0000000000 --- a/doc/html/boost/mpi/get_mpi_datat_idp216170320.html +++ /dev/null @@ -1,87 +0,0 @@ - - - - -Function template get_mpi_datatype - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template get_mpi_datatype

    -

    boost::mpi::get_mpi_datatype — Returns an MPI data type for a C++ type.

    -
    -

    Synopsis

    -
    // In header: <boost/mpi/datatype.hpp>
-
-
-template<typename T> MPI_Datatype get_mpi_datatype(const T & x);
    -
    -

    Description

    -

    The function creates an MPI data type for the given object x. The first time it is called for a class T, the MPI data type is created and cached. Subsequent calls for objects of the same type T return the cached MPI data type. The type T must allow creation of an MPI data type. That is, it must be Serializable and is_mpi_datatype<T> must derive mpl::true_.

    -

    For fundamental MPI types, a copy of the MPI data type of the MPI library is returned.

    -

    Note that since the data types are cached, the caller should never call MPI_Type_free() for the MPI data type returned by this call.

    -

    - -

    -
    ---- - - - - - - - - - - -

    Parameters:

    ---- - - - - -

    x

    for an optimized call, a constructed object of the type should be passed; otherwise, an object will be default-constructed.

    Returns:

    The MPI data type corresponding to type T.

    -
    -
    - - - -
    Copyright © 2005-2007 Douglas Gregor, - Matthias Troyer, Trustees of Indiana University

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at - http://www.boost.org/LICENSE_1_0.txt ) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/mpi/graph_communicator.html b/doc/html/boost/mpi/graph_communicator.html index 99018e9b12..eb6fb89c1c 100644 --- a/doc/html/boost/mpi/graph_communicator.html +++ b/doc/html/boost/mpi/graph_communicator.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -36,25 +36,25 @@ class graph_communicator : public boost::mpi::communicator { public: // construct/copy/destruct - graph_communicator(const MPI_Comm &, comm_create_kind); + graph_communicator(const MPI_Comm &, comm_create_kind); template<typename Graph> - explicit graph_communicator(const communicator &, const Graph &, + explicit graph_communicator(const communicator &, const Graph &, bool = false); template<typename Graph, typename RankMap> - explicit graph_communicator(const communicator &, const Graph &, RankMap, + explicit graph_communicator(const communicator &, const Graph &, RankMap, bool = false); };
    -

    Description

    +

    Description

    A graph_communicator is a communicator whose topology is expressed as a graph. Graph communicators have the same functionality as (intra)communicators, but also allow one to query the relationships among processes. Those relationships are expressed via a graph, using the interface defined by the Boost Graph Library. The graph_communicator class meets the requirements of the BGL Graph, Incidence Graph, Adjacency Graph, Vertex List Graph, and Edge List Graph concepts.

    -

    +

    graph_communicator public construct/copy/destruct

    1. -
      graph_communicator(const MPI_Comm & comm, comm_create_kind kind);
      +
      graph_communicator(const MPI_Comm & comm, comm_create_kind kind);

      Build a new Boost.MPI graph communicator based on the MPI communicator comm with graph topology.

      comm may be any valid MPI communicator. If comm is MPI_COMM_NULL, an empty communicator (that cannot be used for communication) is created and the kind parameter is ignored. Otherwise, the kind parameter determines how the Boost.MPI communicator will be related to comm:

        @@ -67,7 +67,7 @@ 
      • template<typename Graph> 
-  explicit graph_communicator(const communicator & comm, const Graph & graph, 
+  explicit graph_communicator(const communicator & comm, const Graph & graph, 
                               bool reorder = false);

        Create a new communicator whose topology is described by the given graph. The indices of the vertices in the graph will be assumed to be the ranks of the processes within the communicator. There may be fewer vertices in the graph than there are processes in the communicator; in this case, the resulting communicator will be a NULL communicator.

        @@ -104,7 +104,7 @@ 

      • template<typename Graph, typename RankMap> 
-  explicit graph_communicator(const communicator & comm, const Graph & graph, 
+  explicit graph_communicator(const communicator & comm, const Graph & graph, 
                               RankMap rank, bool reorder = false);

        Create a new communicator whose topology is described by the given graph. The rank map (rank) gives the mapping from vertices in the graph to ranks within the communicator. There may be fewer vertices in the graph than there are processes in the communicator; in this case, the resulting communicator will be a NULL communicator.

        @@ -159,7 +159,7 @@

        -PrevUpHomeNext +PrevUpHomeNext
        diff --git a/doc/html/boost/mpi/group.html b/doc/html/boost/mpi/group.html index 3db28e860f..cdc601c34b 100644 --- a/doc/html/boost/mpi/group.html +++ b/doc/html/boost/mpi/group.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        @@ -36,34 +36,34 @@ class group { public: // construct/copy/destruct - group(); - group(const MPI_Group &, bool); + group(); + group(const MPI_Group &, bool); - // public member functions - optional< int > rank() const; - int size() const; + // public member functions + optional< int > rank() const; + int size() const; template<typename InputIterator, typename OutputIterator> OutputIterator - translate_ranks(InputIterator, InputIterator, const group &, + translate_ranks(InputIterator, InputIterator, const group &, OutputIterator); - operator bool() const; - operator MPI_Group() const; - template<typename InputIterator> group include(InputIterator, InputIterator); - template<typename InputIterator> group exclude(InputIterator, InputIterator); + operator bool() const; + operator MPI_Group() const; + template<typename InputIterator> group include(InputIterator, InputIterator); + template<typename InputIterator> group exclude(InputIterator, InputIterator); };
        -

        Description

        +

        Description

        The group class allows one to create arbitrary subsets of the processes within a communicator. One can compute the union, intersection, or difference of two groups, or create new groups by specifically including or excluding certain processes. Given a group, one can create a new communicator containing only the processes in that group.

        -

        +

        group public construct/copy/destruct

        1. -
          group();
          Constructs an empty group.
          2. +
          group();
          Constructs an empty group.
        2. -
          group(const MPI_Group & in_group, bool adopt);
          Constructs a group from an MPI_Group.

          This routine allows one to construct a Boost.MPI group from a C MPI_Group. The group object can (optionally) adopt the MPI_Group, after which point the group object becomes responsible for freeing the MPI_Group when the last copy of group disappears.

          +
          group(const MPI_Group & in_group, bool adopt);
          Constructs a group from an MPI_Group.

          This routine allows one to construct a Boost.MPI group from a C MPI_Group. The group object can (optionally) adopt the MPI_Group, after which point the group object becomes responsible for freeing the MPI_Group when the last copy of group disappears.

          @@ -95,11 +95,11 @@
          -

          -group public member functions

          +

          +group public member functions

          1. -
            optional< int > rank() const;
            Determine the rank of the calling process in the group.

            This routine is equivalent to MPI_Group_rank.

            +
            optional< int > rank() const;
            Determine the rank of the calling process in the group.

            This routine is equivalent to MPI_Group_rank.

          @@ -114,7 +114,7 @@
        3. -
          int size() const;
          Determine the number of processes in the group.

          This routine is equivalent to MPI_Group_size.

          +
          int size() const;
          Determine the number of processes in the group.

          This routine is equivalent to MPI_Group_size.

          @@ -131,7 +131,7 @@ 
        4. template<typename InputIterator, typename OutputIterator> 
   OutputIterator 
-  translate_ranks(InputIterator first, InputIterator last, 
+  translate_ranks(InputIterator first, InputIterator last, 
                   const group & to_group, OutputIterator out);
          Translates the ranks from one group into the ranks of the same processes in another group.

          This routine translates each of the integer rank values in the iterator range [first, last) from the current group into rank values of the corresponding processes in to_group. The corresponding rank values are written via the output iterator out. When there is no correspondence between a rank in the current group and a rank in to_group, the value MPI_UNDEFINED is written to the output iterator.

          @@ -177,7 +177,7 @@

        5. -
          operator bool() const;
          Determines whether the group is non-empty.

          +

          operator bool() const;
          Determines whether the group is non-empty.

          @@ -191,7 +191,7 @@
        6. -
          operator MPI_Group() const;
          Retrieves the underlying MPI_Group associated with this group.

          +

          operator MPI_Group() const;
          Retrieves the underlying MPI_Group associated with this group.

          @@ -206,7 +206,7 @@ 
        7. template<typename InputIterator> 
-  group include(InputIterator first, InputIterator last);
          Creates a new group including a subset of the processes in the current group.

          This routine creates a new group which includes only those processes in the current group that are listed in the integer iterator range [first, last). Equivalent to MPI_Group_incl.

          + group include(InputIterator first, InputIterator last);Creates a new group including a subset of the processes in the current group.

          This routine creates a new group which includes only those processes in the current group that are listed in the integer iterator range [first, last). Equivalent to MPI_Group_incl.

          first The beginning of the iterator range of ranks to include.

          last Past the end of the iterator range of ranks to include.

          @@ -224,7 +224,7 @@ 

        8. template<typename InputIterator> 
-  group exclude(InputIterator first, InputIterator last);
          Creates a new group from all of the processes in the current group, exluding a specific subset of the processes.

          This routine creates a new group which includes all of the processes in the current group except those whose ranks are listed in the integer iterator range [first, last). Equivalent to MPI_Group_excl.

          + group exclude(InputIterator first, InputIterator last);Creates a new group from all of the processes in the current group, exluding a specific subset of the processes.

          This routine creates a new group which includes all of the processes in the current group except those whose ranks are listed in the integer iterator range [first, last). Equivalent to MPI_Group_excl.

          first The beginning of the iterator range of ranks to exclude.

          last Past the end of the iterator range of ranks to exclude.

          @@ -256,7 +256,7 @@

          9. -PrevUpHomeNext +PrevUpHomeNext
          diff --git a/doc/html/boost/mpi/inplace.html b/doc/html/boost/mpi/inplace.html index 21bbe3ddca..1db5ae0ec7 100644 --- a/doc/html/boost/mpi/inplace.html +++ b/doc/html/boost/mpi/inplace.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
          -PrevUpHomeNext +PrevUpHomeNext
          @@ -36,7 +36,7 @@ template<typename T> inplace_t< T > inplace(T & inout); template<typename T> inplace_t< T * > inplace(T * inout);
          -

          Description

          +

          Description

          @@ -79,7 +79,7 @@
          -PrevUpHomeNext +PrevUpHomeNext
          diff --git a/doc/html/boost/mpi/inplace__idm45506988730224.html b/doc/html/boost/mpi/inplace__idm45506988730224.html new file mode 100644 index 0000000000..33700c5593 --- /dev/null +++ b/doc/html/boost/mpi/inplace__idm45506988730224.html @@ -0,0 +1,69 @@ + + + + +Struct template inplace_t<T *> + + + + + + + + + + + + + + + +
          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
          +
          +
          +PrevUpHomeNext +
          +
          +
          +
          +

          Struct template inplace_t<T *>

          +

          boost::mpi::inplace_t<T *>

          +
          +

          Synopsis

          +
          // In header: <boost/mpi/inplace.hpp>
+
+template<typename T> 
+struct inplace_t<T *> {
+  // construct/copy/destruct
+  inplace_t(T *);
+
+  // public data members
+  T * buffer;
+};
          +
          +

          Description

          +
          +

          +inplace_t + public + construct/copy/destruct

          +
          1. inplace_t(T * inout);
          +
          +
          +
          + + + +
          Copyright © 2005-2007 Douglas Gregor, + Matthias Troyer, Trustees of Indiana University

          + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at + http://www.boost.org/LICENSE_1_0.txt ) +

          +
          +
          +
          +PrevUpHomeNext +
          + + diff --git a/doc/html/boost/mpi/inplace_t.html b/doc/html/boost/mpi/inplace_t.html index bc7a864c7f..1b5635c064 100644 --- a/doc/html/boost/mpi/inplace_t.html +++ b/doc/html/boost/mpi/inplace_t.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
          -PrevUpHomeNext +PrevUpHomeNext
          @@ -35,19 +35,19 @@ template<typename T> struct inplace_t { // construct/copy/destruct - inplace_t(T &); + inplace_t(T &); // public data members T & buffer; };
          -

          Description

          +

          Description

          -

          +

          inplace_t public construct/copy/destruct

          -
          1. inplace_t(T & inout);
          +
          1. inplace_t(T & inout);
          @@ -63,7 +63,7 @@
          -PrevUpHomeNext +PrevUpHomeNext
          diff --git a/doc/html/boost/mpi/inplace_t_T_idp205769904.html b/doc/html/boost/mpi/inplace_t_T_idp205769904.html deleted file mode 100644 index 5c8c1287a2..0000000000 --- a/doc/html/boost/mpi/inplace_t_T_idp205769904.html +++ /dev/null @@ -1,69 +0,0 @@ - - - - -Struct template inplace_t<T *> - - - - - - - - - - - - - - - -
          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
          -
          -
          -PrevUpHomeNext -
          -
          -
          -
          -

          Struct template inplace_t<T *>

          -

          boost::mpi::inplace_t<T *>

          -
          -

          Synopsis

          -
          // In header: <boost/mpi/inplace.hpp>
-
-template<typename T> 
-struct inplace_t<T *> {
-  // construct/copy/destruct
-  inplace_t(T *);
-
-  // public data members
-  T * buffer;
-};
          -
          -

          Description

          -
          -

          -inplace_t - public - construct/copy/destruct

          -
          1. inplace_t(T * inout);
          -
          -
          -
          - - - -
          Copyright © 2005-2007 Douglas Gregor, - Matthias Troyer, Trustees of Indiana University

          - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at - http://www.boost.org/LICENSE_1_0.txt ) -

          -
          -
          -
          -PrevUpHomeNext -
          - - diff --git a/doc/html/boost/mpi/intercommunicator.html b/doc/html/boost/mpi/intercommunicator.html index 89a8188441..a537d064f7 100644 --- a/doc/html/boost/mpi/intercommunicator.html +++ b/doc/html/boost/mpi/intercommunicator.html @@ -36,29 +36,29 @@ class intercommunicator : public boost::mpi::communicator { public: // construct/copy/destruct - intercommunicator(const MPI_Comm &, comm_create_kind); - intercommunicator(const communicator &, int, const communicator &, int); + intercommunicator(const MPI_Comm &, comm_create_kind); + intercommunicator(const communicator &, int, const communicator &, int); - // public member functions - int local_size() const; - boost::mpi::group local_group() const; - int local_rank() const; - int remote_size() const; - boost::mpi::group remote_group() const; - communicator merge(bool) const; + // public member functions + int local_size() const; + boost::mpi::group local_group() const; + int local_rank() const; + int remote_size() const; + boost::mpi::group remote_group() const; + communicator merge(bool) const; };
          -

          Description

          +

          Description

          The intercommunicator class provides communication facilities among processes from different groups. An intercommunicator is always associated with two process groups: one "local" process group, containing the process that initiates an MPI operation (e.g., the sender in a send operation), and one "remote" process group, containing the process that is the target of the MPI operation.

          While intercommunicators have essentially the same point-to-point operations as intracommunicators (the latter communicate only within a single process group), all communication with intercommunicators occurs between the processes in the local group and the processes in the remote group; communication within a group must use a different (intra-)communicator.

          -

          +

          intercommunicator public construct/copy/destruct

          1. -
            intercommunicator(const MPI_Comm & comm, comm_create_kind kind);
            +
            intercommunicator(const MPI_Comm & comm, comm_create_kind kind);

            Build a new Boost.MPI intercommunicator based on the MPI intercommunicator comm.

            comm may be any valid MPI intercommunicator. If comm is MPI_COMM_NULL, an empty communicator (that cannot be used for communication) is created and the kind parameter is ignored. Otherwise, the kind parameter determines how the Boost.MPI communicator will be related to comm:

              @@ -70,7 +70,7 @@

            • -
              intercommunicator(const communicator & local, int local_leader, 
+
              intercommunicator(const communicator & local, int local_leader, 
                   const communicator & peer, int remote_leader);
              
 
              Constructs a new intercommunicator whose local group is local and whose remote group is peer. The intercommunicator can then be used to communicate between processes in the two groups. This constructor is equivalent to a call to MPI_Intercomm_create.
              
 
              
@@ -112,31 +112,31 @@
          -

          -intercommunicator public member functions

          +

          +intercommunicator public member functions

          1. -
            int local_size() const;
            +
            int local_size() const;

            Returns the size of the local group, i.e., the number of local processes that are part of the group.

          2. -
            boost::mpi::group local_group() const;
            +
            boost::mpi::group local_group() const;

            Returns the local group, containing all of the local processes in this intercommunicator.

          3. -
            int local_rank() const;
            +
            int local_rank() const;

            Returns the rank of this process within the local group.

          4. -
            int remote_size() const;
            +
            int remote_size() const;

            Returns the size of the remote group, i.e., the number of processes that are part of the remote group.

          5. -
            boost::mpi::group remote_group() const;
            +
            boost::mpi::group remote_group() const;

            Returns the remote group, containing all of the remote processes in this intercommunicator.

          6. -
            communicator merge(bool high) const;
            +
            communicator merge(bool high) const;

            Merge the local and remote groups in this intercommunicator into a new intracommunicator containing the union of the processes in both groups. This method is equivalent to MPI_Intercomm_merge.

            diff --git a/doc/html/boost/mpi/is_commutative.html b/doc/html/boost/mpi/is_commutative.html index c1b9014991..885f47ab54 100644 --- a/doc/html/boost/mpi/is_commutative.html +++ b/doc/html/boost/mpi/is_commutative.html @@ -36,7 +36,7 @@ struct is_commutative : public false_ { };

          -

          Description

          +

          Description

          This trait determines if an operation Op is commutative when applied to values of type T. Parallel operations such as reduce and prefix_sum can be implemented more efficiently with commutative operations. To mark an operation as commutative, users should specialize is_commutative and derive from the class mpl::true_.

          diff --git a/doc/html/boost/mpi/is_mpi_builtin_datatype.html b/doc/html/boost/mpi/is_mpi_builtin_datatype.html index 62fb57d143..d8fea97c29 100644 --- a/doc/html/boost/mpi/is_mpi_builtin_datatype.html +++ b/doc/html/boost/mpi/is_mpi_builtin_datatype.html @@ -37,9 +37,9 @@ { };
          -

          Description

          +

          Description

          This type trait determines when there is a direct mapping from a C++ type to an MPI type. For instance, the C++ int type maps directly to the MPI type MPI_INT. When there is a direct mapping from the type T to an MPI type, is_mpi_builtin_datatype will derive from mpl::true_ and the MPI data type will be accessible via get_mpi_datatype.

          -

          In general, users should not need to specialize this trait. However, if you have an additional C++ type that can map directly to only of MPI's built-in types, specialize either this trait or one of the traits corresponding to categories of MPI data types (is_mpi_integer_datatype, is_mpi_floating_point_datatype, is_mpi_logical_datatype, is_mpi_complex_datatype, or is_mpi_builtin_datatype). is_mpi_builtin_datatype derives mpl::true_ if any of the traits corresponding to MPI data type categories derived mpl::true_.

          +

          In general, users should not need to specialize this trait. However, if you have an additional C++ type that can map directly to only of MPI's built-in types, specialize either this trait or one of the traits corresponding to categories of MPI data types (is_mpi_integer_datatype, is_mpi_floating_point_datatype, is_mpi_logical_datatype, is_mpi_complex_datatype, or is_mpi_builtin_datatype). is_mpi_builtin_datatype derives mpl::true_ if any of the traits corresponding to MPI data type categories derived mpl::true_.

        diff --git a/doc/html/boost/mpi/is_mpi_byte_datatype.html b/doc/html/boost/mpi/is_mpi_byte_datatype.html index 574c3c5fce..563ec93cae 100644 --- a/doc/html/boost/mpi/is_mpi_byte_datatype.html +++ b/doc/html/boost/mpi/is_mpi_byte_datatype.html @@ -36,7 +36,7 @@ structis_mpi_byte_datatype:publicfalse_{};
        -

        Description

        +

        Description

        This type trait determines when there is a direct mapping from a C++ type to an MPI data type that is classified as an byte data type. See is_mpi_builtin_datatype for general information about built-in MPI data types.

        diff --git a/doc/html/boost/mpi/is_mpi_complex_datatype.html b/doc/html/boost/mpi/is_mpi_complex_datatype.html index 8d2fcf1913..323f93a7c5 100644 --- a/doc/html/boost/mpi/is_mpi_complex_datatype.html +++ b/doc/html/boost/mpi/is_mpi_complex_datatype.html @@ -36,7 +36,7 @@ structis_mpi_complex_datatype:publicfalse_{};
        -

        Description

        +

        Description

        This type trait determines when there is a direct mapping from a C++ type to an MPI data type that is classified as an complex data type. See is_mpi_builtin_datatype for general information about built-in MPI data types.

        diff --git a/doc/html/boost/mpi/is_mpi_datatype.html b/doc/html/boost/mpi/is_mpi_datatype.html index f4540c0cb3..6bcec322c2 100644 --- a/doc/html/boost/mpi/is_mpi_datatype.html +++ b/doc/html/boost/mpi/is_mpi_datatype.html @@ -8,7 +8,7 @@ - +
        @@ -21,7 +21,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        @@ -36,7 +36,7 @@ struct is_mpi_datatype : public boost::mpi::is_mpi_builtin_datatype< T > { };
        -

        Description

        +

        Description

        This type trait determines if it is possible to build an MPI data type that represents a C++ data type. When this is the case, is_mpi_datatype derives mpl::true_ and the MPI data type will be accessible via get_mpi_datatype.

        For any C++ type that maps to a built-in MPI data type (see is_mpi_builtin_datatype), is_mpi_data_type is trivially true. However, any POD ("Plain Old Data") type containing types that themselves can be represented by MPI data types can itself be represented as an MPI data type. For instance, a point3d class containing three double values can be represented as an MPI data type. To do so, first make the data type Serializable (using the Boost.Serialization library); then, specialize the is_mpi_datatype trait for the point type so that it will derive mpl::true_: 

        namespace boost { namespace mpi {
@@ -59,7 +59,7 @@
 
 
        
 
        
-PrevUpHomeNext
+PrevUpHomeNext
 
        
 
 
diff --git a/doc/html/boost/mpi/is_mpi_f_idm45507104405744.html b/doc/html/boost/mpi/is_mpi_f_idm45507104405744.html
new file mode 100644
index 0000000000..a566b562cf
--- /dev/null
+++ b/doc/html/boost/mpi/is_mpi_f_idm45507104405744.html
@@ -0,0 +1,58 @@
+
+
+
+
+Struct template is_mpi_floating_point_datatype
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        
+
        
+
        
+PrevUpHomeNext
+
        
+
        
+
        
+
        
+
        Struct template is_mpi_floating_point_datatype
        
+
        boost::mpi::is_mpi_floating_point_datatype — Type trait that determines if there exists a built-in floating point MPI data type for a given C++ type. 
        
+
        
+
        Synopsis
        
+
        // In header: <boost/mpi/datatype.hpp>
+
+template<typename T> 
+struct is_mpi_floating_point_datatype : public false_ {
+};
        
+
        
+
        Description
        
+
        This type trait determines when there is a direct mapping from a C++ type to an MPI data type that is classified as a floating point data type. See is_mpi_builtin_datatype for general information about built-in MPI data types. 
        
+
        
+
        
+
+
+
+
        Copyright © 2005-2007 Douglas Gregor,
+      Matthias Troyer, Trustees of Indiana University
        
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at 
+        http://www.boost.org/LICENSE_1_0.txt )
+      
        
+
        
+
        
+
        
+PrevUpHomeNext
+
        
+
+
diff --git a/doc/html/boost/mpi/is_mpi_floati_idp216202464.html b/doc/html/boost/mpi/is_mpi_floati_idp216202464.html
deleted file mode 100644
index 362a36f88e..0000000000
--- a/doc/html/boost/mpi/is_mpi_floati_idp216202464.html
+++ /dev/null
@@ -1,58 +0,0 @@
-
-
-
-
-Struct template is_mpi_floating_point_datatype
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        
-
        
-
        
-PrevUpHomeNext
-
        
-
        
-
        
-
        
-
        Struct template is_mpi_floating_point_datatype
        
-
        boost::mpi::is_mpi_floating_point_datatype — Type trait that determines if there exists a built-in floating point MPI data type for a given C++ type. 
        
-
        
-
        Synopsis
        
-
        // In header: <boost/mpi/datatype.hpp>
-
-template<typename T> 
-struct is_mpi_floating_point_datatype : public false_ {
-};
        
-
        
-
        Description
        
-
        This type trait determines when there is a direct mapping from a C++ type to an MPI data type that is classified as a floating point data type. See is_mpi_builtin_datatype for general information about built-in MPI data types. 
        
-
        
-
        
-
-
-
-
        Copyright © 2005-2007 Douglas Gregor,
-      Matthias Troyer, Trustees of Indiana University
        
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at 
-        http://www.boost.org/LICENSE_1_0.txt )
-      
        
-
        
-
        
-
        
-PrevUpHomeNext
-
        
-
-
diff --git a/doc/html/boost/mpi/is_mpi_integer_datatype.html b/doc/html/boost/mpi/is_mpi_integer_datatype.html
index 8a4838f796..7742b9ce74 100644
--- a/doc/html/boost/mpi/is_mpi_integer_datatype.html
+++ b/doc/html/boost/mpi/is_mpi_integer_datatype.html
@@ -7,7 +7,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
 
        
 
        
-PrevUpHomeNext
+PrevUpHomeNext
 
        
 
        
 
        
@@ -36,7 +36,7 @@
 struct is_mpi_integer_datatype : public false_ {
 };
        -

        Description

        +

        Description

        This type trait determines when there is a direct mapping from a C++ type to an MPI data type that is classified as an integer data type. See is_mpi_builtin_datatype for general information about built-in MPI data types.

        @@ -52,7 +52,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        diff --git a/doc/html/boost/mpi/is_mpi_logical_datatype.html b/doc/html/boost/mpi/is_mpi_logical_datatype.html index 300319dba7..541787bcab 100644 --- a/doc/html/boost/mpi/is_mpi_logical_datatype.html +++ b/doc/html/boost/mpi/is_mpi_logical_datatype.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        @@ -36,7 +36,7 @@ struct is_mpi_logical_datatype : public false_ { };
        -

        Description

        +

        Description

        This type trait determines when there is a direct mapping from a C++ type to an MPI data type that is classified as an logical data type. See is_mpi_builtin_datatype for general information about built-in MPI data types.

        @@ -52,7 +52,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        diff --git a/doc/html/boost/mpi/is_mpi_op.html b/doc/html/boost/mpi/is_mpi_op.html index 0c287321ad..4a09fa9b85 100644 --- a/doc/html/boost/mpi/is_mpi_op.html +++ b/doc/html/boost/mpi/is_mpi_op.html @@ -36,7 +36,7 @@ struct is_mpi_op : public false_ { };
      -

      Description

      +

      Description

      This trait determines if a function object type Op, when used with argument type T, has an associated MPI_Op. If so, is_mpi_op<Op,T> will derive from mpl::false_ and will contain a static member function op that takes no arguments but returns the associated MPI_Op value. For instance, is_mpi_op<std::plus<int>,int>::op() returns MPI_SUM.

      Users may specialize is_mpi_op for any other class templates that map onto operations that have MPI_Op equivalences, such as bitwise OR, logical and, or maximum. However, users are encouraged to use the standard function objects in the functional and boost/mpi/operations.hpp headers whenever possible. For function objects that are class templates with a single template parameter, it may be easier to specialize is_builtin_mpi_op.

      diff --git a/doc/html/boost/mpi/logical_xor.html b/doc/html/boost/mpi/logical_xor.html index 37e889fe0b..42bef600dd 100644 --- a/doc/html/boost/mpi/logical_xor.html +++ b/doc/html/boost/mpi/logical_xor.html @@ -35,17 +35,17 @@ template<typename T> struct logical_xor : public std::binary_function< T, T, T > { - // public member functions - T operator()(const T &, const T &) const; + // public member functions + T operator()(const T &, const T &) const; };
    -

    Description

    +

    Description

    This binary function object computes the logical exclusive of the two values it is given. When used with MPI and a type T that has an associated, built-in MPI data type, translates to MPI_LXOR.

    -

    -logical_xor public member functions

    +

    +logical_xor public member functions

    1. -
      T operator()(const T & x, const T & y) const;
      +
      T operator()(const T & x, const T & y) const;

      diff --git a/doc/html/boost/mpi/maximum.html b/doc/html/boost/mpi/maximum.html index 4fada62df4..fe00946308 100644 --- a/doc/html/boost/mpi/maximum.html +++ b/doc/html/boost/mpi/maximum.html @@ -35,17 +35,17 @@ template<typename T>structmaximum:publicstd::binary_function<T,T,T>{ - // public member functions - constT&operator()(constT&,constT&)const; + // public member functions + constT&operator()(constT&,constT&)const;};
      -

      Description

      +

      Description

      This binary function object computes the maximum of the two values it is given. When used with MPI and a type T that has an associated, built-in MPI data type, translates to MPI_MAX.

      -

      -maximum public member functions

      +

      +maximum public member functions

      1. -
        const T & operator()(const T & x, const T & y) const;
        +
        const T & operator()(const T & x, const T & y) const;

      diff --git a/doc/html/boost/mpi/minimum.html b/doc/html/boost/mpi/minimum.html index 3292a85aaa..92429476f6 100644 --- a/doc/html/boost/mpi/minimum.html +++ b/doc/html/boost/mpi/minimum.html @@ -35,17 +35,17 @@ template<typename T>structminimum:publicstd::binary_function<T,T,T>{ - // public member functions - constT&operator()(constT&,constT&)const; + // public member functions + constT&operator()(constT&,constT&)const;};
      -

      Description

      +

      Description

      This binary function object computes the minimum of the two values it is given. When used with MPI and a type T that has an associated, built-in MPI data type, translates to MPI_MIN.

      -

      -minimum public member functions

      +

      +minimum public member functions

      1. -
        const T & operator()(const T & x, const T & y) const;
        +
        const T & operator()(const T & x, const T & y) const;

      diff --git a/doc/html/boost/mpi/operator-_idp207337216.html b/doc/html/boost/mpi/operator-_idp207337216.html deleted file mode 100644 index 9c8221f5ff..0000000000 --- a/doc/html/boost/mpi/operator-_idp207337216.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function operator- - - - - - - - - -
      - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Function operator-

      -

      boost::mpi::operator- — Computes the difference between two process groups.

      -
      -

      Synopsis

      -
      // In header: <boost/mpi/group.hpp>
-
-
-BOOST_MPI_DECL group operator-(const group & g1, const group & g2);
      -
      -

      Description

      -

      This routine returns a new group that contains all processes that are in group g1 but not in group g2, ordered in the same way as g1. Equivalent to MPI_Group_difference.

      -
      -
      - - - -
      Copyright © 2005-2007 Douglas Gregor, - Matthias Troyer, Trustees of Indiana University

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at - http://www.boost.org/LICENSE_1_0.txt ) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/mpi/operator___idp209197264.html b/doc/html/boost/mpi/operator___idp209197264.html deleted file mode 100644 index e5d7fdabe0..0000000000 --- a/doc/html/boost/mpi/operator___idp209197264.html +++ /dev/null @@ -1,69 +0,0 @@ - - - - -Function operator!= - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Function operator!=

      -

      boost::mpi::operator!= — Determines whether two process groups are not identical.

      -
      -

      Synopsis

      -
      // In header: <boost/mpi/group.hpp>
-
-
-bool operator!=(const group & g1, const group & g2);
      -
      -

      Description

      -

      Equivalent to calling MPI_Group_compare and checking whether the result is not MPI_IDENT.

      -

      -

      -
      ---- - - - - -

      Returns:

      False when the two process groups contain the same processes in the same order.

      -
      -
      - - - -
      Copyright © 2005-2007 Douglas Gregor, - Matthias Troyer, Trustees of Indiana University

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at - http://www.boost.org/LICENSE_1_0.txt ) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/mpi/operator___idp214478720.html b/doc/html/boost/mpi/operator___idp214478720.html deleted file mode 100644 index 9159170730..0000000000 --- a/doc/html/boost/mpi/operator___idp214478720.html +++ /dev/null @@ -1,69 +0,0 @@ - - - - -Function operator== - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Function operator==

      -

      boost::mpi::operator== — Determines whether two process groups are identical.

      -
      -

      Synopsis

      -
      // In header: <boost/mpi/group.hpp>
-
-
-BOOST_MPI_DECL bool operator==(const group & g1, const group & g2);
      -
      -

      Description

      -

      Equivalent to calling MPI_Group_compare and checking whether the result is MPI_IDENT.

      -

      -

      -
      ---- - - - - -

      Returns:

      True when the two process groups contain the same processes in the same order.

      -
      -
      - - - -
      Copyright © 2005-2007 Douglas Gregor, - Matthias Troyer, Trustees of Indiana University

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at - http://www.boost.org/LICENSE_1_0.txt ) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/mpi/operator___idp226217008.html b/doc/html/boost/mpi/operator___idp226217008.html deleted file mode 100644 index 53d008619d..0000000000 --- a/doc/html/boost/mpi/operator___idp226217008.html +++ /dev/null @@ -1,70 +0,0 @@ - - - - -Function operator== - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Function operator==

      -

      boost::mpi::operator== — Determines whether two communicators are identical.

      -
      -

      Synopsis

      -
      // In header: <boost/mpi/communicator.hpp>
-
-
-BOOST_MPI_DECL bool 
-operator==(const communicator & comm1, const communicator & comm2);
      -
      -

      Description

      -

      Equivalent to calling MPI_Comm_compare and checking whether the result is MPI_IDENT.

      -

      -

      -
      ---- - - - - -

      Returns:

      True when the two communicators refer to the same underlying MPI communicator.

      -
      -
      - - - -
      Copyright © 2005-2007 Douglas Gregor, - Matthias Troyer, Trustees of Indiana University

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at - http://www.boost.org/LICENSE_1_0.txt ) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/mpi/operator___idp226222384.html b/doc/html/boost/mpi/operator___idp226222384.html deleted file mode 100644 index 74d2f18907..0000000000 --- a/doc/html/boost/mpi/operator___idp226222384.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Function operator!= - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Function operator!=

      -

      boost::mpi::operator!= — Determines whether two communicators are different.

      -
      -

      Synopsis

      -
      // In header: <boost/mpi/communicator.hpp>
-
-
-bool operator!=(const communicator & comm1, const communicator & comm2);
      -
      -

      Description

      -

      -

      -
      ---- - - - - -

      Returns:

      !(comm1 == comm2)

      -
      -
      - - - -
      Copyright © 2005-2007 Douglas Gregor, - Matthias Troyer, Trustees of Indiana University

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at - http://www.boost.org/LICENSE_1_0.txt ) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/mpi/operator___idp92471168.html b/doc/html/boost/mpi/operator___idp92471168.html deleted file mode 100644 index 425ebcf675..0000000000 --- a/doc/html/boost/mpi/operator___idp92471168.html +++ /dev/null @@ -1,70 +0,0 @@ - - - - -Function template operator== - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Function template operator==

      -

      boost::mpi::operator== — Compare two allocators for equality.

      -
      -

      Synopsis

      -
      // In header: <boost/mpi/allocator.hpp>
-
-
-template<typename T1, typename T2> 
-  bool operator==(const allocator< T1 > &, const allocator< T2 > &);
      -
      -

      Description

      -

      Since MPI allocators have no state, all MPI allocators are equal.

      -

      -

      -
      ---- - - - - -

      Returns:

      true

      -
      -
      - - - -
      Copyright © 2005-2007 Douglas Gregor, - Matthias Troyer, Trustees of Indiana University

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at - http://www.boost.org/LICENSE_1_0.txt ) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/mpi/operator___idp92477408.html b/doc/html/boost/mpi/operator___idp92477408.html deleted file mode 100644 index cb4294eba5..0000000000 --- a/doc/html/boost/mpi/operator___idp92477408.html +++ /dev/null @@ -1,70 +0,0 @@ - - - - -Function template operator!= - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Function template operator!=

      -

      boost::mpi::operator!= — Compare two allocators for inequality.

      -
      -

      Synopsis

      -
      // In header: <boost/mpi/allocator.hpp>
-
-
-template<typename T1, typename T2> 
-  bool operator!=(const allocator< T1 > &, const allocator< T2 > &);
      -
      -

      Description

      -

      Since MPI allocators have no state, all MPI allocators are equal.

      -

      -

      -
      ---- - - - - -

      Returns:

      false

      -
      -
      - - - -
      Copyright © 2005-2007 Douglas Gregor, - Matthias Troyer, Trustees of Indiana University

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at - http://www.boost.org/LICENSE_1_0.txt ) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/mpi/operator__idp207491760.html b/doc/html/boost/mpi/operator__idp207491760.html deleted file mode 100644 index 141965ed77..0000000000 --- a/doc/html/boost/mpi/operator__idp207491760.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function operator& - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Function operator&

      -

      boost::mpi::operator& — Computes the intersection of two process groups.

      -
      -

      Synopsis

      -
      // In header: <boost/mpi/group.hpp>
-
-
-BOOST_MPI_DECL group operator&(const group & g1, const group & g2);
      -
      -

      Description

      -

      This routine returns a new group that contains all processes that are in group g1 and in group g2, ordered in the same way as g1. Equivalent to MPI_Group_intersection.

      -
      -
      - - - -
      Copyright © 2005-2007 Douglas Gregor, - Matthias Troyer, Trustees of Indiana University

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at - http://www.boost.org/LICENSE_1_0.txt ) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/mpi/operator_idm45506986350816.html b/doc/html/boost/mpi/operator_idm45506986350816.html new file mode 100644 index 0000000000..0a5c847a68 --- /dev/null +++ b/doc/html/boost/mpi/operator_idm45506986350816.html @@ -0,0 +1,70 @@ + + + + +Function template operator!= + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Function template operator!=

      +

      boost::mpi::operator!= — Compare two allocators for inequality.

      +
      +

      Synopsis

      +
      // In header: <boost/mpi/allocator.hpp>
+
+
+template<typename T1, typename T2> 
+  bool operator!=(const allocator< T1 > &, const allocator< T2 > &);
      +
      +

      Description

      +

      Since MPI allocators have no state, all MPI allocators are equal.

      +

      +

      +
      ++++ + + + + +

      Returns:

      false

      +
      +
      + + + +
      Copyright © 2005-2007 Douglas Gregor, + Matthias Troyer, Trustees of Indiana University

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at + http://www.boost.org/LICENSE_1_0.txt ) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/mpi/operator_idm45506986357056.html b/doc/html/boost/mpi/operator_idm45506986357056.html new file mode 100644 index 0000000000..1ee5a4d805 --- /dev/null +++ b/doc/html/boost/mpi/operator_idm45506986357056.html @@ -0,0 +1,70 @@ + + + + +Function template operator== + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Function template operator==

      +

      boost::mpi::operator== — Compare two allocators for equality.

      +
      +

      Synopsis

      +
      // In header: <boost/mpi/allocator.hpp>
+
+
+template<typename T1, typename T2> 
+  bool operator==(const allocator< T1 > &, const allocator< T2 > &);
      +
      +

      Description

      +

      Since MPI allocators have no state, all MPI allocators are equal.

      +

      +

      +
      ++++ + + + + +

      Returns:

      true

      +
      +
      + + + +
      Copyright © 2005-2007 Douglas Gregor, + Matthias Troyer, Trustees of Indiana University

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at + http://www.boost.org/LICENSE_1_0.txt ) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/mpi/operator_idm45507038807728.html b/doc/html/boost/mpi/operator_idm45507038807728.html new file mode 100644 index 0000000000..d172fbd1f2 --- /dev/null +++ b/doc/html/boost/mpi/operator_idm45507038807728.html @@ -0,0 +1,69 @@ + + + + +Function operator== + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Function operator==

      +

      boost::mpi::operator== — Determines whether two process groups are identical.

      +
      +

      Synopsis

      +
      // In header: <boost/mpi/group.hpp>
+
+
+BOOST_MPI_DECL bool operator==(const group & g1, const group & g2);
      +
      +

      Description

      +

      Equivalent to calling MPI_Group_compare and checking whether the result is MPI_IDENT.

      +

      +

      +
      ++++ + + + + +

      Returns:

      True when the two process groups contain the same processes in the same order.

      +
      +
      + + + +
      Copyright © 2005-2007 Douglas Gregor, + Matthias Troyer, Trustees of Indiana University

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at + http://www.boost.org/LICENSE_1_0.txt ) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/mpi/operator_idm45507042831024.html b/doc/html/boost/mpi/operator_idm45507042831024.html new file mode 100644 index 0000000000..a0a188fb7d --- /dev/null +++ b/doc/html/boost/mpi/operator_idm45507042831024.html @@ -0,0 +1,68 @@ + + + + +Function operator!= + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Function operator!=

      +

      boost::mpi::operator!= — Determines whether two communicators are different.

      +
      +

      Synopsis

      +
      // In header: <boost/mpi/communicator.hpp>
+
+
+bool operator!=(const communicator & comm1, const communicator & comm2);
      +
      +

      Description

      +

      +

      +
      ++++ + + + + +

      Returns:

      !(comm1 == comm2)

      +
      +
      + + + +
      Copyright © 2005-2007 Douglas Gregor, + Matthias Troyer, Trustees of Indiana University

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at + http://www.boost.org/LICENSE_1_0.txt ) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/mpi/operator_idm45507042836400.html b/doc/html/boost/mpi/operator_idm45507042836400.html new file mode 100644 index 0000000000..7d2e46bb32 --- /dev/null +++ b/doc/html/boost/mpi/operator_idm45507042836400.html @@ -0,0 +1,70 @@ + + + + +Function operator== + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Function operator==

      +

      boost::mpi::operator== — Determines whether two communicators are identical.

      +
      +

      Synopsis

      +
      // In header: <boost/mpi/communicator.hpp>
+
+
+BOOST_MPI_DECL bool 
+operator==(const communicator & comm1, const communicator & comm2);
      +
      +

      Description

      +

      Equivalent to calling MPI_Comm_compare and checking whether the result is MPI_IDENT.

      +

      +

      +
      ++++ + + + + +

      Returns:

      True when the two communicators refer to the same underlying MPI communicator.

      +
      +
      + + + +
      Copyright © 2005-2007 Douglas Gregor, + Matthias Troyer, Trustees of Indiana University

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at + http://www.boost.org/LICENSE_1_0.txt ) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/mpi/operator_idm45507094512656.html b/doc/html/boost/mpi/operator_idm45507094512656.html new file mode 100644 index 0000000000..9c94be9d60 --- /dev/null +++ b/doc/html/boost/mpi/operator_idm45507094512656.html @@ -0,0 +1,57 @@ + + + + +Function operator| + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Function operator|

      +

      boost::mpi::operator| — Computes the union of two process groups.

      +
      +

      Synopsis

      +
      // In header: <boost/mpi/group.hpp>
+
+
+BOOST_MPI_DECL group operator|(const group & g1, const group & g2);
      +
      +

      Description

      +

      This routine returns a new group that contains all processes that are either in group g1 or in group g2 (or both). The processes that are in g1 will be first in the resulting group, followed by the processes from g2 (but not also in g1). Equivalent to MPI_Group_union.

      +
      +
      + + + +
      Copyright © 2005-2007 Douglas Gregor, + Matthias Troyer, Trustees of Indiana University

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at + http://www.boost.org/LICENSE_1_0.txt ) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/mpi/operator_idm45507094518064.html b/doc/html/boost/mpi/operator_idm45507094518064.html new file mode 100644 index 0000000000..3dd0a4826f --- /dev/null +++ b/doc/html/boost/mpi/operator_idm45507094518064.html @@ -0,0 +1,69 @@ + + + + +Function operator!= + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Function operator!=

      +

      boost::mpi::operator!= — Determines whether two process groups are not identical.

      +
      +

      Synopsis

      +
      // In header: <boost/mpi/group.hpp>
+
+
+bool operator!=(const group & g1, const group & g2);
      +
      +

      Description

      +

      Equivalent to calling MPI_Group_compare and checking whether the result is not MPI_IDENT.

      +

      +

      +
      ++++ + + + + +

      Returns:

      False when the two process groups contain the same processes in the same order.

      +
      +
      + + + +
      Copyright © 2005-2007 Douglas Gregor, + Matthias Troyer, Trustees of Indiana University

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at + http://www.boost.org/LICENSE_1_0.txt ) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/mpi/operator_idm45507102919600.html b/doc/html/boost/mpi/operator_idm45507102919600.html new file mode 100644 index 0000000000..938f06c482 --- /dev/null +++ b/doc/html/boost/mpi/operator_idm45507102919600.html @@ -0,0 +1,57 @@ + + + + +Function operator- + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Function operator-

      +

      boost::mpi::operator- — Computes the difference between two process groups.

      +
      +

      Synopsis

      +
      // In header: <boost/mpi/group.hpp>
+
+
+BOOST_MPI_DECL group operator-(const group & g1, const group & g2);
      +
      +

      Description

      +

      This routine returns a new group that contains all processes that are in group g1 but not in group g2, ordered in the same way as g1. Equivalent to MPI_Group_difference.

      +
      +
      + + + +
      Copyright © 2005-2007 Douglas Gregor, + Matthias Troyer, Trustees of Indiana University

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at + http://www.boost.org/LICENSE_1_0.txt ) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/mpi/operator_idm45507106437360.html b/doc/html/boost/mpi/operator_idm45507106437360.html new file mode 100644 index 0000000000..f16ee60e79 --- /dev/null +++ b/doc/html/boost/mpi/operator_idm45507106437360.html @@ -0,0 +1,57 @@ + + + + +Function operator& + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Function operator&

      +

      boost::mpi::operator& — Computes the intersection of two process groups.

      +
      +

      Synopsis

      +
      // In header: <boost/mpi/group.hpp>
+
+
+BOOST_MPI_DECL group operator&(const group & g1, const group & g2);
      +
      +

      Description

      +

      This routine returns a new group that contains all processes that are in group g1 and in group g2, ordered in the same way as g1. Equivalent to MPI_Group_intersection.

      +
      +
      + + + +
      Copyright © 2005-2007 Douglas Gregor, + Matthias Troyer, Trustees of Indiana University

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at + http://www.boost.org/LICENSE_1_0.txt ) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/mpi/operator_idp209202672.html b/doc/html/boost/mpi/operator_idp209202672.html deleted file mode 100644 index 263fa9d6c0..0000000000 --- a/doc/html/boost/mpi/operator_idp209202672.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function operator| - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Function operator|

      -

      boost::mpi::operator| — Computes the union of two process groups.

      -
      -

      Synopsis

      -
      // In header: <boost/mpi/group.hpp>
-
-
-BOOST_MPI_DECL group operator|(const group & g1, const group & g2);
      -
      -

      Description

      -

      This routine returns a new group that contains all processes that are either in group g1 or in group g2 (or both). The processes that are in g1 will be first in the resulting group, followed by the processes from g2 (but not also in g1). Equivalent to MPI_Group_union.

      -
      -
      - - - -
      Copyright © 2005-2007 Douglas Gregor, - Matthias Troyer, Trustees of Indiana University

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at - http://www.boost.org/LICENSE_1_0.txt ) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/mpi/packed_iarchive.html b/doc/html/boost/mpi/packed_iarchive.html index 6fd9246dec..786b58fe0d 100644 --- a/doc/html/boost/mpi/packed_iarchive.html +++ b/doc/html/boost/mpi/packed_iarchive.html @@ -36,32 +36,32 @@ class packed_iarchive : public iprimitive { public: // construct/copy/destruct - packed_iarchive(MPI_Comm const &, buffer_type &, + packed_iarchive(MPI_Comm const &, buffer_type &, unsigned int = boost::archive::no_header, int = 0); - packed_iarchive(MPI_Comm const &, std::size_t = 0, + packed_iarchive(MPI_Comm const &, std::size_t = 0, unsigned int = boost::archive::no_header); - // public member functions - template<typename T> void load_override(T &, mpl::false_); - template<typename T> void load_override(T &, mpl::true_); - template<typename T> void load_override(T &); - void load_override(archive::class_id_optional_type &); - void load_override(archive::class_id_type &); - void load_override(archive::version_type &); - void load_override(archive::class_id_reference_type &); - void load_override(archive::class_name_type &); + // public member functions + template<typename T> void load_override(T &, mpl::false_); + template<typename T> void load_override(T &, mpl::true_); + template<typename T> void load_override(T &); + void load_override(archive::class_id_optional_type &); + void load_override(archive::class_id_type &); + void load_override(archive::version_type &); + void load_override(archive::class_id_reference_type &); + void load_override(archive::class_name_type &); };
      -

      Description

      +

      Description

      The packed_oarchive class is an Archiver (as in the Boost.Serialization library) that unpacks binary data from a buffer received via MPI. It can operate on any Serializable data type and will use the MPI_Unpack function of the underlying MPI implementation to perform deserialization.

      -

      +

      packed_iarchive public construct/copy/destruct

      1. -
        packed_iarchive(MPI_Comm const & comm, buffer_type & b, 
+
        packed_iarchive(MPI_Comm const & comm, buffer_type & b, 
                 unsigned int flags = boost::archive::no_header, 
                 int position = 0);
        
 
        Construct a packed_iarchive to receive data over the given MPI communicator and with an initial buffer.
        
@@ -98,7 +98,7 @@
    2. -
      packed_iarchive(MPI_Comm const & comm, std::size_t s = 0, 
+
      packed_iarchive(MPI_Comm const & comm, std::size_t s = 0, 
                 unsigned int flags = boost::archive::no_header);
      
 
      Construct a packed_iarchive to receive data over the given MPI communicator.
      
 
      
@@ -132,17 +132,17 @@
    -

    -packed_iarchive public member functions

    +

    +packed_iarchive public member functions

      -
    1. template<typename T> void load_override(T & x, mpl::false_);
      2. -
    2. template<typename T> void load_override(T & x, mpl::true_);
      3. -
    3. template<typename T> void load_override(T & x);
      4. -
    4. void load_override(archive::class_id_optional_type &);
      5. -
    5. void load_override(archive::class_id_type & t);
      6. -
    6. void load_override(archive::version_type & t);
      7. -
    7. void load_override(archive::class_id_reference_type & t);
      8. -
    8. void load_override(archive::class_name_type & t);
      9. +
    9. template<typename T> void load_override(T & x, mpl::false_);
      10. +
    10. template<typename T> void load_override(T & x, mpl::true_);
      11. +
    11. template<typename T> void load_override(T & x);
      12. +
    12. void load_override(archive::class_id_optional_type &);
      13. +
    13. void load_override(archive::class_id_type & t);
      14. +
    14. void load_override(archive::version_type & t);
      15. +
    15. void load_override(archive::class_id_reference_type & t);
      16. +
    16. void load_override(archive::class_name_type & t);
    diff --git a/doc/html/boost/mpi/packed_oarchive.html b/doc/html/boost/mpi/packed_oarchive.html index 731252f950..4ce0096950 100644 --- a/doc/html/boost/mpi/packed_oarchive.html +++ b/doc/html/boost/mpi/packed_oarchive.html @@ -36,30 +36,30 @@ class packed_oarchive : public oprimitive { public: // construct/copy/destruct - packed_oarchive(MPI_Comm const &, buffer_type &, + packed_oarchive(MPI_Comm const &, buffer_type &, unsigned int = boost::archive::no_header); - packed_oarchive(MPI_Comm const &, unsigned int = boost::archive::no_header); + packed_oarchive(MPI_Comm const &, unsigned int = boost::archive::no_header); - // public member functions - template<typename T> void save_override(T const &, mpl::false_); - template<typename T> void save_override(T const &, mpl::true_); - template<typename T> void save_override(T const &); - void save_override(const archive::class_id_optional_type &); - void save_override(const archive::class_name_type &); - void save_override(const archive::class_id_type &); - void save_override(const archive::version_type &); + // public member functions + template<typename T> void save_override(T const &, mpl::false_); + template<typename T> void save_override(T const &, mpl::true_); + template<typename T> void save_override(T const &); + void save_override(const archive::class_id_optional_type &); + void save_override(const archive::class_name_type &); + void save_override(const archive::class_id_type &); + void save_override(const archive::version_type &); };
    -

    Description

    +

    Description

    The packed_iarchive class is an Archiver (as in the Boost.Serialization library) that packs binary data into a buffer for transmission via MPI. It can operate on any Serializable data type and will use the MPI_Pack function of the underlying MPI implementation to perform serialization.

    -

    +

    packed_oarchive public construct/copy/destruct

    1. -
      packed_oarchive(MPI_Comm const & comm, buffer_type & b, 
+
      packed_oarchive(MPI_Comm const & comm, buffer_type & b, 
                 unsigned int flags = boost::archive::no_header);
      
 
      Construct a packed_oarchive for transmission over the given MPI communicator and with an initial buffer.
      
 
      
@@ -95,7 +95,7 @@
  • -
    packed_oarchive(MPI_Comm const & comm, 
+
    packed_oarchive(MPI_Comm const & comm, 
                 unsigned int flags = boost::archive::no_header);
    
 
    Construct a packed_oarchive for transmission over the given MPI communicator.
    
 
    
@@ -129,16 +129,16 @@
    • -

    -packed_oarchive public member functions

    +

    +packed_oarchive public member functions

      -
    1. template<typename T> void save_override(T const & x, mpl::false_);
      2. -
    2. template<typename T> void save_override(T const & x, mpl::true_);
      3. -
    3. template<typename T> void save_override(T const & x);
      4. -
    4. void save_override(const archive::class_id_optional_type &);
      5. -
    5. void save_override(const archive::class_name_type & t);
      6. -
    6. void save_override(const archive::class_id_type & t);
      7. -
    7. void save_override(const archive::version_type & t);
      8. +
    8. template<typename T> void save_override(T const & x, mpl::false_);
      9. +
    9. template<typename T> void save_override(T const & x, mpl::true_);
      10. +
    10. template<typename T> void save_override(T const & x);
      11. +
    11. void save_override(const archive::class_id_optional_type &);
      12. +
    12. void save_override(const archive::class_name_type & t);
      13. +
    13. void save_override(const archive::class_id_type & t);
      14. +
    14. void save_override(const archive::version_type & t);
    diff --git a/doc/html/boost/mpi/packed_skeleton_iarchive.html b/doc/html/boost/mpi/packed_skeleton_iarchive.html index 13910cd7dd..65ba6a5fd3 100644 --- a/doc/html/boost/mpi/packed_skeleton_iarchive.html +++ b/doc/html/boost/mpi/packed_skeleton_iarchive.html @@ -36,26 +36,26 @@ class packed_skeleton_iarchive : public ignore_iprimitive { public: // construct/copy/destruct - packed_skeleton_iarchive(MPI_Comm const &, + packed_skeleton_iarchive(MPI_Comm const &, unsigned int = boost::archive::no_header); - explicit packed_skeleton_iarchive(packed_iarchive &); + explicit packed_skeleton_iarchive(packed_iarchive &); - // public member functions - const packed_iarchive & get_skeleton() const; - packed_iarchive & get_skeleton(); + // public member functions + const packed_iarchive & get_skeleton() const; + packed_iarchive & get_skeleton(); };
    -

    Description

    +

    Description

    The packed_skeleton_iarchive class is an Archiver (as in the Boost.Serialization library) that can construct the the shape of a data structure based on a binary skeleton stored in a buffer. The packed_skeleton_iarchive is typically used by the receiver of a skeleton, to prepare a data structure that will eventually receive content separately.

    Users will not generally need to use packed_skeleton_iarchive directly. Instead, use skeleton or get_skeleton.

    -

    +

    packed_skeleton_iarchive public construct/copy/destruct

    1. -
      packed_skeleton_iarchive(MPI_Comm const & comm, 
+
      packed_skeleton_iarchive(MPI_Comm const & comm, 
                          unsigned int flags = boost::archive::no_header);
      
 
      Construct a packed_skeleton_iarchive for the given communicator.
      
 
      
@@ -87,7 +87,7 @@
  • -
    explicit packed_skeleton_iarchive(packed_iarchive & archive);
    +
    explicit packed_skeleton_iarchive(packed_iarchive & archive);

    Construct a packed_skeleton_iarchive that unpacks a skeleton from the given archive.

    @@ -114,15 +114,15 @@
    • -

    -packed_skeleton_iarchive public member functions

    +

    +packed_skeleton_iarchive public member functions

    1. -
      const packed_iarchive & get_skeleton() const;
      +
      const packed_iarchive & get_skeleton() const;

      Retrieve the archive corresponding to this skeleton.

    2. -
      packed_iarchive & get_skeleton();
      +
      packed_iarchive & get_skeleton();

      Retrieve the archive corresponding to this skeleton.

    diff --git a/doc/html/boost/mpi/packed_skeleton_oarchive.html b/doc/html/boost/mpi/packed_skeleton_oarchive.html index b140ac0ef0..edea56378d 100644 --- a/doc/html/boost/mpi/packed_skeleton_oarchive.html +++ b/doc/html/boost/mpi/packed_skeleton_oarchive.html @@ -36,25 +36,25 @@ class packed_skeleton_oarchive : public ignore_oprimitive { public: // construct/copy/destruct - packed_skeleton_oarchive(MPI_Comm const &, + packed_skeleton_oarchive(MPI_Comm const &, unsigned int = boost::archive::no_header); - explicit packed_skeleton_oarchive(packed_oarchive &); + explicit packed_skeleton_oarchive(packed_oarchive &); - // public member functions - const packed_oarchive & get_skeleton() const; + // public member functions + const packed_oarchive & get_skeleton() const; };
    -

    Description

    +

    Description

    The packed_skeleton_oarchive class is an Archiver (as in the Boost.Serialization library) that can record the shape of a data structure (called the "skeleton") into a binary representation stored in a buffer. The packed_skeleton_oarchive is typically used by the send of a skeleton, to pack the skeleton of a data structure for transmission separately from the content.

    Users will not generally need to use packed_skeleton_oarchive directly. Instead, use skeleton or get_skeleton.

    -

    +

    packed_skeleton_oarchive public construct/copy/destruct

    1. -
      packed_skeleton_oarchive(MPI_Comm const & comm, 
+
      packed_skeleton_oarchive(MPI_Comm const & comm, 
                          unsigned int flags = boost::archive::no_header);
      
 
      Construct a packed_skeleton_oarchive for the given communicator.
      
 
      
@@ -86,7 +86,7 @@
  • -
    explicit packed_skeleton_oarchive(packed_oarchive & archive);
    +
    explicit packed_skeleton_oarchive(packed_oarchive & archive);

    Construct a packed_skeleton_oarchive that packs a skeleton into the given archive.

    @@ -113,10 +113,10 @@
    • -

    -packed_skeleton_oarchive public member functions

    +

    +packed_skeleton_oarchive public member functions

    1. -
      const packed_oarchive & get_skeleton() const;
      +
      const packed_oarchive & get_skeleton() const;

      Retrieve the archive corresponding to this skeleton.

    diff --git a/doc/html/boost/mpi/python/register_idm45507048514256.html b/doc/html/boost/mpi/python/register_idm45507048514256.html new file mode 100644 index 0000000000..2f822a163a --- /dev/null +++ b/doc/html/boost/mpi/python/register_idm45507048514256.html @@ -0,0 +1,86 @@ + + + + +Function template register_skeleton_and_content + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template register_skeleton_and_content

    +

    boost::mpi::python::register_skeleton_and_content — Registers a type for use with the skeleton/content mechanism in Python.

    +
    +

    Synopsis

    +
    // In header: <boost/mpi/python.hpp>
+
+
+template<typename T> 
+  void register_skeleton_and_content(const T & value = T(), 
+                                     PyTypeObject * type = 0);
    +
    +

    Description

    +

    The skeleton/content mechanism can only be used from Python with C++ types that have previously been registered via a call to this function. Both the sender and the transmitter must register the type. It is permitted to call this function multiple times for the same type T, but only one call per process per type is required. The type T must be Serializable.

    +

    +

    +
    ++++ + + + + +

    Parameters:

    ++++ + + + + + + + + + + +

    type

    The Python type associated with the C++ type T. If not provided, it will be computed from the same value value.

    value

    A sample object of type T that will be used to determine the Python type associated with T, if type is not specified.

    +
    +
    + + + +
    Copyright © 2005-2007 Douglas Gregor, + Matthias Troyer, Trustees of Indiana University

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at + http://www.boost.org/LICENSE_1_0.txt ) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/mpi/python/register_serialized.html b/doc/html/boost/mpi/python/register_serialized.html index 5576334770..8f79007a9e 100644 --- a/doc/html/boost/mpi/python/register_serialized.html +++ b/doc/html/boost/mpi/python/register_serialized.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -36,7 +36,7 @@ template<typename T> void register_serialized(const T & value = T(), PyTypeObject * type = 0);
    -

    Description

    +

    Description

    The register_serialized function registers a C++ type for direct serialization within Boost.MPI. Direct serialization elides the use of the Python pickle package when serializing Python objects that represent C++ values. Direct serialization can be beneficial both to improve serialization performance (Python pickling can be very inefficient) and to permit serialization for Python-wrapped C++ objects that do not support pickling.

    @@ -79,7 +79,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/mpi/python/register_skel_idp114524160.html b/doc/html/boost/mpi/python/register_skel_idp114524160.html deleted file mode 100644 index 7700c2f30d..0000000000 --- a/doc/html/boost/mpi/python/register_skel_idp114524160.html +++ /dev/null @@ -1,86 +0,0 @@ - - - - -Function template register_skeleton_and_content - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template register_skeleton_and_content

    -

    boost::mpi::python::register_skeleton_and_content — Registers a type for use with the skeleton/content mechanism in Python.

    -
    -

    Synopsis

    -
    // In header: <boost/mpi/python.hpp>
-
-
-template<typename T> 
-  void register_skeleton_and_content(const T & value = T(), 
-                                     PyTypeObject * type = 0);
    -
    -

    Description

    -

    The skeleton/content mechanism can only be used from Python with C++ types that have previously been registered via a call to this function. Both the sender and the transmitter must register the type. It is permitted to call this function multiple times for the same type T, but only one call per process per type is required. The type T must be Serializable.

    -

    -

    -
    ---- - - - - -

    Parameters:

    ---- - - - - - - - - - - -

    type

    The Python type associated with the C++ type T. If not provided, it will be computed from the same value value.

    value

    A sample object of type T that will be used to determine the Python type associated with T, if type is not specified.

    -
    -
    - - - -
    Copyright © 2005-2007 Douglas Gregor, - Matthias Troyer, Trustees of Indiana University

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at - http://www.boost.org/LICENSE_1_0.txt ) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/mpi/reduce.html b/doc/html/boost/mpi/reduce.html index b2c628f384..9593e13275 100644 --- a/doc/html/boost/mpi/reduce.html +++ b/doc/html/boost/mpi/reduce.html @@ -45,7 +45,7 @@ void reduce(const communicator & comm, const T * in_values, int n, Op op, int root);
    -

    Description

    +

    Description

    reduce is a collective algorithm that combines the values stored by each process into a single value at the root. The values can be combined arbitrarily, specified via a function object. The type T of the values may be any type that is serializable or has an associated MPI data type. One can think of this operation as a gather to the root, followed by an std::accumulate() over the gathered values and using the operation op.

    When the type T has an associated MPI data type, this routine invokes MPI_Reduce to perform the reduction. If possible, built-in MPI operations will be used; otherwise, reduce() will create a custom MPI_Op for the call to MPI_Reduce.

    diff --git a/doc/html/boost/mpi/request.html b/doc/html/boost/mpi/request.html index 240b4a88fd..603027c44d 100644 --- a/doc/html/boost/mpi/request.html +++ b/doc/html/boost/mpi/request.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@

    -PrevUpHomeNext +PrevUpHomeNext
    @@ -36,40 +36,40 @@ class request { public: // construct/copy/destruct - request(); + request(); - // public member functions - status wait(); - optional< status > test(); - void cancel(); + // public member functions + status wait(); + optional< status > test(); + void cancel(); };
    -

    Description

    +

    Description

    This structure contains information about a non-blocking send or receive and will be returned from isend or irecv, respectively.

    -

    +

    request public construct/copy/destruct

    1. -
      request();
      +
      request();

      Constructs a NULL request.

    -

    -request public member functions

    +

    +request public member functions

    1. -
      status wait();
      +
      status wait();

      Wait until the communication associated with this request has completed, then return a status object describing the communication.

    2. -
      optional< status > test();
      +
      optional< status > test();

      Determine whether the communication associated with this request has completed successfully. If so, returns the status object describing the communication. Otherwise, returns an empty optional<> to indicate that the communication has not completed yet. Note that once test() returns a status object, the request has completed and wait() should not be called.

    3. -
      void cancel();
      +
      void cancel();

      Cancel a pending communication, assuming it has not already been completed.

    @@ -88,7 +88,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/mpi/scan.html b/doc/html/boost/mpi/scan.html index 9d5323b21a..f1daf88e08 100644 --- a/doc/html/boost/mpi/scan.html +++ b/doc/html/boost/mpi/scan.html @@ -42,7 +42,7 @@ void scan(const communicator & comm, const T * in_values, int n, T * out_values, Op op);
    -

    Description

    +

    Description

    scan is a collective algorithm that combines the values stored by each process with the values of all processes with a smaller rank. The values can be arbitrarily combined, specified via a function object op. The type T of the values may be any type that is serializable or has an associated MPI data type. One can think of this operation as a gather to some process, followed by an std::prefix_sum() over the gathered values using the operation op. The ith process returns the ith value emitted by std::prefix_sum().

    When the type T has an associated MPI data type, this routine invokes MPI_Scan to perform the reduction. If possible, built-in MPI operations will be used; otherwise, scan() will create a custom MPI_Op for the call to MPI_Scan.

    diff --git a/doc/html/boost/mpi/scatter.html b/doc/html/boost/mpi/scatter.html index 52c356d0b2..e59802fadd 100644 --- a/doc/html/boost/mpi/scatter.html +++ b/doc/html/boost/mpi/scatter.html @@ -50,7 +50,7 @@ template<typename T> void scatter(const communicator & comm, T * out_values, int n, int root);

    -

    Description

    +

    Description

    scatter is a collective algorithm that scatters the values stored in the root process (inside a vector) to all of the processes in the communicator. The vector out_values (only significant at the root) is indexed by the process number to which the corresponding value will be sent. The type T of the values may be any type that is serializable or has an associated MPI data type.

    When the type T has an associated MPI data type, this routine invokes MPI_Scatter to scatter the values.

    diff --git a/doc/html/boost/mpi/scatterv.html b/doc/html/boost/mpi/scatterv.html index 60eb4475f0..cf750937bd 100644 --- a/doc/html/boost/mpi/scatterv.html +++ b/doc/html/boost/mpi/scatterv.html @@ -53,7 +53,7 @@ void scatterv(const communicator & comm, const std::vector< T > & in_values, const std::vector< int > & sizes, T * out_values, int root);

    -

    Description

    +

    Description

    diff --git a/doc/html/boost/mpi/skeleton.html b/doc/html/boost/mpi/skeleton.html index 60ecfe36b6..267c776bc7 100644 --- a/doc/html/boost/mpi/skeleton.html +++ b/doc/html/boost/mpi/skeleton.html @@ -35,7 +35,7 @@ template<typename T>constskeleton_proxy<T>skeleton(T& x);
    -

    Description

    +

    Description

    This routine creates an instance of the skeleton_proxy class. It will typically be used when calling send, recv, or broadcast, to indicate that only the skeleton (structure) of an object should be transmitted and not its contents.

    diff --git a/doc/html/boost/mpi/skeleton_proxy.html b/doc/html/boost/mpi/skeleton_proxy.html index 5bffceabce..901bff65ad 100644 --- a/doc/html/boost/mpi/skeleton_proxy.html +++ b/doc/html/boost/mpi/skeleton_proxy.html @@ -35,21 +35,21 @@ template<typename T> struct skeleton_proxy { // construct/copy/destruct - skeleton_proxy(T &); + skeleton_proxy(T &); // public data members T & object; };

    -

    Description

    +

    Description

    The skeleton_proxy is a lightweight proxy object used to indicate that the skeleton of an object, not the object itself, should be transmitted. It can be used with the send and recv operations of communicators or the broadcast collective. When a skeleton_proxy is sent, Boost.MPI generates a description containing the structure of the stored object. When that skeleton is received, the receiving object is reshaped to match the structure. Once the skeleton of an object as been transmitted, its content can be transmitted separately (often several times) without changing the structure of the object.

    -

    +

    skeleton_proxy public construct/copy/destruct

    1. -
      skeleton_proxy(T & x);
      +
      skeleton_proxy(T & x);

      Constructs a skeleton_proxy that references object x.

      diff --git a/doc/html/boost/mpi/status.html b/doc/html/boost/mpi/status.html index cdbb82c5a0..08d295b0d4 100644 --- a/doc/html/boost/mpi/status.html +++ b/doc/html/boost/mpi/status.html @@ -36,56 +36,56 @@ class status { public: // construct/copy/destruct - status(); - status(MPI_Status const &); + status(); + status(MPI_Status const &); - // public member functions - int source() const; - int tag() const; - int error() const; - bool cancelled() const; - template<typename T> optional< int > count() const; - operator MPI_Status &(); - operator const MPI_Status &() const; + // public member functions + int source() const; + int tag() const; + int error() const; + bool cancelled() const; + template<typename T> optional< int > count() const; + operator MPI_Status &(); + operator const MPI_Status &() const; // public data members mutable int m_count; };
    -

    Description

    +

    Description

    This structure contains status information about messages that have been received (with communicator::recv) or can be received (returned from communicator::probe or communicator::iprobe). It permits access to the source of the message, message tag, error code (rarely used), or the number of elements that have been transmitted.

    -

    +

    status public construct/copy/destruct

      -
    1. status();
      2. -
    2. status(MPI_Status const & s);
      3. +
    3. status();
      4. +
    4. status(MPI_Status const & s);
    -

    -status public member functions

    +

    +status public member functions

    1. -
      int source() const;
      +
      int source() const;

      Retrieve the source of the message.

    2. -
      int tag() const;
      +
      int tag() const;

      Retrieve the message tag.

    3. -
      int error() const;
      +
      int error() const;

      Retrieve the error code.

    4. -
      bool cancelled() const;
      +
      bool cancelled() const;

      Determine whether the communication associated with this object has been successfully cancelled.

    5. -
      template<typename T> optional< int > count() const;
      +
      template<typename T> optional< int > count() const;

      Determines the number of elements of type T contained in the message. The type T must have an associated data type, i.e., is_mpi_datatype<T> must derive mpl::true_. In cases where the type T does not match the transmitted type, this routine will return an empty optional<int>.

      @@ -101,11 +101,11 @@
  • -
    operator MPI_Status &();
    +
    operator MPI_Status &();

    References the underlying MPI_Status

  • -
    operator const MPI_Status &() const;
    +
    operator const MPI_Status &() const;

    References the underlying MPI_Status

    • diff --git a/doc/html/boost/mpi/test_all.html b/doc/html/boost/mpi/test_all.html index 3494c6de12..2d7261ac9b 100644 --- a/doc/html/boost/mpi/test_all.html +++ b/doc/html/boost/mpi/test_all.html @@ -39,7 +39,7 @@ template<typename ForwardIterator> bool test_all(ForwardIterator first, ForwardIterator last);
    -

    Description

    +

    Description

    This routine takes in a set of requests stored in the iterator range [first,last) and determines whether all of these requests have been completed. However, due to limitations of the underlying MPI implementation, if any of the requests refers to a non-blocking send or receive of a serialized data type, test_all will always return the equivalent of false (i.e., the requests cannot all be finished at this time). This routine performs the same functionality as wait_all, except that this routine will not block. This routine provides functionality equivalent to MPI_Testall.

    diff --git a/doc/html/boost/mpi/test_any.html b/doc/html/boost/mpi/test_any.html index 0054d5f59c..56c1df3a0c 100644 --- a/doc/html/boost/mpi/test_any.html +++ b/doc/html/boost/mpi/test_any.html @@ -37,7 +37,7 @@ optional< std::pair< status, ForwardIterator > > test_any(ForwardIterator first, ForwardIterator last);

    -

    Description

    +

    Description

    This routine takes in a set of requests stored in the iterator range [first,last) and tests whether any of these requests has been completed. This routine is similar to wait_any, but will not block waiting for requests to completed. It provides functionality equivalent to MPI_Testany.

    diff --git a/doc/html/boost/mpi/test_some.html b/doc/html/boost/mpi/test_some.html index 90995f69f3..d7fe96f17b 100644 --- a/doc/html/boost/mpi/test_some.html +++ b/doc/html/boost/mpi/test_some.html @@ -41,7 +41,7 @@ BidirectionalIterator test_some(BidirectionalIterator first, BidirectionalIterator last);

    -

    Description

    +

    Description

    This routine takes in a set of requests stored in the iterator range [first,last) and tests to see if any of the requests has completed. It completes all of the requests it can, partitioning the input sequence into pending requests followed by completed requests. If an output iterator is provided, status objects will be emitted for each of the completed requests. This routine is similar to wait_some, but does not wait until any requests have completed. This routine provides functionality equivalent to MPI_Testsome.

    diff --git a/doc/html/boost/mpi/threading/level.html b/doc/html/boost/mpi/threading/level.html index f0a0bebd6c..c227bb0888 100644 --- a/doc/html/boost/mpi/threading/level.html +++ b/doc/html/boost/mpi/threading/level.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@

    -PrevUpHomeNext +PrevUpHomeNext
    @@ -37,7 +37,7 @@ serialized = = MPI_THREAD_SERIALIZED, multiple = = MPI_THREAD_MULTIPLE };
    -

    Description

    +

    Description

    Based on MPI 2 standard/8.7.3

    single
    @@ -72,7 +72,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/mpi/threading/operator_idm45507037552864.html b/doc/html/boost/mpi/threading/operator_idm45507037552864.html new file mode 100644 index 0000000000..7d95816c23 --- /dev/null +++ b/doc/html/boost/mpi/threading/operator_idm45507037552864.html @@ -0,0 +1,57 @@ + + + + +Function operator<< + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function operator<<

    +

    boost::mpi::threading::operator<<

    +
    +

    Synopsis

    +
    // In header: <boost/mpi/environment.hpp>
+
+
+std::ostream & operator<<(std::ostream & out, level l);
    +
    +

    Description

    +

    Formated output for threading level.

    +
    +
    + + + +
    Copyright © 2005-2007 Douglas Gregor, + Matthias Troyer, Trustees of Indiana University

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at + http://www.boost.org/LICENSE_1_0.txt ) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/mpi/threading/operator_idm45507098853648.html b/doc/html/boost/mpi/threading/operator_idm45507098853648.html new file mode 100644 index 0000000000..1a5bca5a87 --- /dev/null +++ b/doc/html/boost/mpi/threading/operator_idm45507098853648.html @@ -0,0 +1,57 @@ + + + + +Function operator>> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function operator>>

    +

    boost::mpi::threading::operator>>

    +
    +

    Synopsis

    +
    // In header: <boost/mpi/environment.hpp>
+
+
+std::istream & operator>>(std::istream & in, level & l);
    +
    +

    Description

    +

    Formated input for threading level.

    +
    +
    + + + +
    Copyright © 2005-2007 Douglas Gregor, + Matthias Troyer, Trustees of Indiana University

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at + http://www.boost.org/LICENSE_1_0.txt ) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/mpi/threading/operator_idp203436240.html b/doc/html/boost/mpi/threading/operator_idp203436240.html deleted file mode 100644 index aa1c36a07e..0000000000 --- a/doc/html/boost/mpi/threading/operator_idp203436240.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function operator<< - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function operator<<

    -

    boost::mpi::threading::operator<<

    -
    -

    Synopsis

    -
    // In header: <boost/mpi/environment.hpp>
-
-
-std::ostream & operator<<(std::ostream & out, level l);
    -
    -

    Description

    -

    Formated output for threading level.

    -
    -
    - - - -
    Copyright © 2005-2007 Douglas Gregor, - Matthias Troyer, Trustees of Indiana University

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at - http://www.boost.org/LICENSE_1_0.txt ) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/mpi/threading/operator_idp203438896.html b/doc/html/boost/mpi/threading/operator_idp203438896.html deleted file mode 100644 index 9f2a93453f..0000000000 --- a/doc/html/boost/mpi/threading/operator_idp203438896.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function operator>> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function operator>>

    -

    boost::mpi::threading::operator>>

    -
    -

    Synopsis

    -
    // In header: <boost/mpi/environment.hpp>
-
-
-std::istream & operator>>(std::istream & in, level & l);
    -
    -

    Description

    -

    Formated input for threading level.

    -
    -
    - - - -
    Copyright © 2005-2007 Douglas Gregor, - Matthias Troyer, Trustees of Indiana University

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at - http://www.boost.org/LICENSE_1_0.txt ) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/mpi/timer.html b/doc/html/boost/mpi/timer.html index d54dd7fc17..fb6c050159 100644 --- a/doc/html/boost/mpi/timer.html +++ b/doc/html/boost/mpi/timer.html @@ -36,27 +36,27 @@ class timer { public: // construct/copy/destruct - timer(); + timer(); - // public member functions - void restart(); - double elapsed() const; - double elapsed_max() const; - double elapsed_min() const; + // public member functions + void restart(); + double elapsed() const; + double elapsed_max() const; + double elapsed_min() const; - // public static functions - static bool time_is_global(); + // public static functions + static bool time_is_global(); };
    -

    Description

    +

    Description

    The timer class is a simple wrapper around the MPI timing facilities that mimics the interface of the Boost Timer library.

    -

    +

    timer public construct/copy/destruct

    1. -
      timer();
      +
      timer();

      Initializes the timer

      @@ -73,11 +73,11 @@
    -

    -timer public member functions

    +

    +timer public member functions

    1. -
      void restart();
      +
      void restart();

      Restart the timer.

      @@ -93,24 +93,24 @@
  • -
    double elapsed() const;
    +
    double elapsed() const;

    Return the amount of time that has elapsed since the last construction or reset, in seconds.

  • -
    double elapsed_max() const;
    +
    double elapsed_max() const;

    Return an estimate of the maximum possible value of elapsed(). Note that this routine may return too high a value on some systems.

  • -
    double elapsed_min() const;
    +
    double elapsed_min() const;

    Returns the minimum non-zero value that elapsed() may return. This is the resolution of the timer.

    • -

    -timer public static functions

    +

    +timer public static functions

    1. -
      static bool time_is_global();
      +
      static bool time_is_global();

      Determines whether the elapsed time values are global times or local processor times.

    diff --git a/doc/html/boost/mpi/wait_all.html b/doc/html/boost/mpi/wait_all.html index 1ae60331da..00a100b723 100644 --- a/doc/html/boost/mpi/wait_all.html +++ b/doc/html/boost/mpi/wait_all.html @@ -39,7 +39,7 @@ template<typename ForwardIterator> void wait_all(ForwardIterator first, ForwardIterator last);
    -

    Description

    +

    Description

    This routine takes in a set of requests stored in the iterator range [first,last) and waits until all of these requests have been completed. It provides functionality equivalent to MPI_Waitall.

    diff --git a/doc/html/boost/mpi/wait_any.html b/doc/html/boost/mpi/wait_any.html index f8c2f7a40d..c51fb1ef3e 100644 --- a/doc/html/boost/mpi/wait_any.html +++ b/doc/html/boost/mpi/wait_any.html @@ -37,7 +37,7 @@ std::pair< status, ForwardIterator > wait_any(ForwardIterator first, ForwardIterator last);

    -

    Description

    +

    Description

    This routine takes in a set of requests stored in the iterator range [first,last) and waits until any of these requests has been completed. It provides functionality equivalent to MPI_Waitany.

    diff --git a/doc/html/boost/mpi/wait_some.html b/doc/html/boost/mpi/wait_some.html index 28b8326400..263f1fdc24 100644 --- a/doc/html/boost/mpi/wait_some.html +++ b/doc/html/boost/mpi/wait_some.html @@ -41,7 +41,7 @@ BidirectionalIterator wait_some(BidirectionalIterator first, BidirectionalIterator last);

    -

    Description

    +

    Description

    This routine takes in a set of requests stored in the iterator range [first,last) and waits until at least one of the requests has completed. It then completes all of the requests it can, partitioning the input sequence into pending requests followed by completed requests. If an output iterator is provided, status objects will be emitted for each of the completed requests. This routine provides functionality equivalent to MPI_Waitsome.

    diff --git a/doc/html/boost/numeric/default_.html b/doc/html/boost/numeric/default_.html index 2691cfae1b..7b676e7485 100644 --- a/doc/html/boost/numeric/default_.html +++ b/doc/html/boost/numeric/default_.html @@ -38,18 +38,18 @@ typedef default_ type; typedef T value_type; - // public member functions - operator T const &() const; + // public member functions + operator T const &() const; // public data members static T const value; };

    -

    Description

    +

    Description

    -

    -default_ public member functions

    -
    1. operator T const &() const;
    +

    +default_ public member functions

    +
    1. operator T const &() const;
    diff --git a/doc/html/boost/numeric/functional/as_max.html b/doc/html/boost/numeric/functional/as_max.html index bc775a7c24..472ffc95af 100644 --- a/doc/html/boost/numeric/functional/as_max.html +++ b/doc/html/boost/numeric/functional/as_max.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -46,7 +46,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/numeric/functional/as_max_T__std__idp67419120.html b/doc/html/boost/numeric/functional/as_max_T__std__idp67419120.html deleted file mode 100644 index a82484b184..0000000000 --- a/doc/html/boost/numeric/functional/as_max_T__std__idp67419120.html +++ /dev/null @@ -1,63 +0,0 @@ - - - - -Struct template as_max<T, std_valarray_tag> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template as_max<T, std_valarray_tag>

    -

    boost::numeric::functional::as_max<T, std_valarray_tag>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/numeric/functional/valarray.hpp>
-
-template<typename T> 
-struct as_max<T, std_valarray_tag> : public std::unary_function< T, remove_const< T >::type > {
-
-  // public member functions
-  remove_const< T >::type operator()(T &) const;
-};
    -
    -

    Description

    -
    -

    -as_max public member functions

    -
    1. remove_const< T >::type operator()(T & arr) const;
    -
    -
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/numeric/functional/as_max_T__std__idp67495600.html b/doc/html/boost/numeric/functional/as_max_T__std__idp67495600.html deleted file mode 100644 index e936336a22..0000000000 --- a/doc/html/boost/numeric/functional/as_max_T__std__idp67495600.html +++ /dev/null @@ -1,63 +0,0 @@ - - - - -Struct template as_max<T, std_vector_tag> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template as_max<T, std_vector_tag>

    -

    boost::numeric::functional::as_max<T, std_vector_tag>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/numeric/functional/vector.hpp>
-
-template<typename T> 
-struct as_max<T, std_vector_tag> : public std::unary_function< T, remove_const< T >::type > {
-
-  // public member functions
-  remove_const< T >::type operator()(T &) const;
-};
    -
    -

    Description

    -
    -

    -as_max public member functions

    -
    1. remove_const< T >::type operator()(T & arr) const;
    -
    -
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/numeric/functional/as_max_T_idm45507138916016.html b/doc/html/boost/numeric/functional/as_max_T_idm45507138916016.html new file mode 100644 index 0000000000..d187d87bd8 --- /dev/null +++ b/doc/html/boost/numeric/functional/as_max_T_idm45507138916016.html @@ -0,0 +1,63 @@ + + + + +Struct template as_max<T, std_vector_tag> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct template as_max<T, std_vector_tag>

    +

    boost::numeric::functional::as_max<T, std_vector_tag>

    +
    +

    Synopsis

    +
    // In header: <boost/accumulators/numeric/functional/vector.hpp>
+
+template<typename T> 
+struct as_max<T, std_vector_tag> : public std::unary_function< T, remove_const< T >::type > {
+
+  // public member functions
+  remove_const< T >::type operator()(T &) const;
+};
    +
    +

    Description

    +
    +

    +as_max public member functions

    +
    1. remove_const< T >::type operator()(T & arr) const;
    +
    +
    +
    + + + +
    Copyright © 2005, 2006 Eric Niebler

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/numeric/functional/as_max_T_idm45507138992496.html b/doc/html/boost/numeric/functional/as_max_T_idm45507138992496.html new file mode 100644 index 0000000000..2f37fc2361 --- /dev/null +++ b/doc/html/boost/numeric/functional/as_max_T_idm45507138992496.html @@ -0,0 +1,63 @@ + + + + +Struct template as_max<T, std_valarray_tag> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct template as_max<T, std_valarray_tag>

    +

    boost::numeric::functional::as_max<T, std_valarray_tag>

    +
    +

    Synopsis

    +
    // In header: <boost/accumulators/numeric/functional/valarray.hpp>
+
+template<typename T> 
+struct as_max<T, std_valarray_tag> : public std::unary_function< T, remove_const< T >::type > {
+
+  // public member functions
+  remove_const< T >::type operator()(T &) const;
+};
    +
    +

    Description

    +
    +

    +as_max public member functions

    +
    1. remove_const< T >::type operator()(T & arr) const;
    +
    +
    +
    + + + +
    Copyright © 2005, 2006 Eric Niebler

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/numeric/functional/as_max_base.html b/doc/html/boost/numeric/functional/as_max_base.html index 6aa01dc3d4..3b93fbafae 100644 --- a/doc/html/boost/numeric/functional/as_max_base.html +++ b/doc/html/boost/numeric/functional/as_max_base.html @@ -37,18 +37,18 @@ public std::unary_function< Arg, remove_const< Arg >::type > { - // public member functions - BOOST_STATIC_ASSERT(std::numeric_limits< typename remove_const< Arg >::type >::is_specialized); - remove_const< Arg >::type operator()(Arg &) const; + // public member functions + BOOST_STATIC_ASSERT(std::numeric_limits< typename remove_const< Arg >::type >::is_specialized); + remove_const< Arg >::type operator()(Arg &) const; };
    -

    Description

    +

    Description

    -

    -as_max_base public member functions

    +

    +as_max_base public member functions

      -
    1.  BOOST_STATIC_ASSERT(std::numeric_limits< typename remove_const< Arg >::type >::is_specialized);
      2. -
    2. remove_const< Arg >::type operator()(Arg &) const;
      3. +
    3.  BOOST_STATIC_ASSERT(std::numeric_limits< typename remove_const< Arg >::type >::is_specialized);
      4. +
    4. remove_const< Arg >::type operator()(Arg &) const;
    diff --git a/doc/html/boost/numeric/functional/as_min_T__std__idp67424192.html b/doc/html/boost/numeric/functional/as_min_T__std__idp67424192.html deleted file mode 100644 index ce4349cc4e..0000000000 --- a/doc/html/boost/numeric/functional/as_min_T__std__idp67424192.html +++ /dev/null @@ -1,63 +0,0 @@ - - - - -Struct template as_min<T, std_valarray_tag> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template as_min<T, std_valarray_tag>

    -

    boost::numeric::functional::as_min<T, std_valarray_tag>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/numeric/functional/valarray.hpp>
-
-template<typename T> 
-struct as_min<T, std_valarray_tag> : public std::unary_function< T, remove_const< T >::type > {
-
-  // public member functions
-  remove_const< T >::type operator()(T &) const;
-};
    -
    -

    Description

    -
    -

    -as_min public member functions

    -
    1. remove_const< T >::type operator()(T & arr) const;
    -
    -
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/numeric/functional/as_min_T__std__idp67500672.html b/doc/html/boost/numeric/functional/as_min_T__std__idp67500672.html deleted file mode 100644 index 30deae6d87..0000000000 --- a/doc/html/boost/numeric/functional/as_min_T__std__idp67500672.html +++ /dev/null @@ -1,63 +0,0 @@ - - - - -Struct template as_min<T, std_vector_tag> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template as_min<T, std_vector_tag>

    -

    boost::numeric::functional::as_min<T, std_vector_tag>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/numeric/functional/vector.hpp>
-
-template<typename T> 
-struct as_min<T, std_vector_tag> : public std::unary_function< T, remove_const< T >::type > {
-
-  // public member functions
-  remove_const< T >::type operator()(T &) const;
-};
    -
    -

    Description

    -
    -

    -as_min public member functions

    -
    1. remove_const< T >::type operator()(T & arr) const;
    -
    -
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/numeric/functional/as_min_T_idm45507138910944.html b/doc/html/boost/numeric/functional/as_min_T_idm45507138910944.html new file mode 100644 index 0000000000..5a719ff009 --- /dev/null +++ b/doc/html/boost/numeric/functional/as_min_T_idm45507138910944.html @@ -0,0 +1,63 @@ + + + + +Struct template as_min<T, std_vector_tag> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct template as_min<T, std_vector_tag>

    +

    boost::numeric::functional::as_min<T, std_vector_tag>

    +
    +

    Synopsis

    +
    // In header: <boost/accumulators/numeric/functional/vector.hpp>
+
+template<typename T> 
+struct as_min<T, std_vector_tag> : public std::unary_function< T, remove_const< T >::type > {
+
+  // public member functions
+  remove_const< T >::type operator()(T &) const;
+};
    +
    +

    Description

    +
    +

    +as_min public member functions

    +
    1. remove_const< T >::type operator()(T & arr) const;
    +
    +
    +
    + + + +
    Copyright © 2005, 2006 Eric Niebler

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/numeric/functional/as_min_T_idm45507138987424.html b/doc/html/boost/numeric/functional/as_min_T_idm45507138987424.html new file mode 100644 index 0000000000..a99227cae1 --- /dev/null +++ b/doc/html/boost/numeric/functional/as_min_T_idm45507138987424.html @@ -0,0 +1,63 @@ + + + + +Struct template as_min<T, std_valarray_tag> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct template as_min<T, std_valarray_tag>

    +

    boost::numeric::functional::as_min<T, std_valarray_tag>

    +
    +

    Synopsis

    +
    // In header: <boost/accumulators/numeric/functional/valarray.hpp>
+
+template<typename T> 
+struct as_min<T, std_valarray_tag> : public std::unary_function< T, remove_const< T >::type > {
+
+  // public member functions
+  remove_const< T >::type operator()(T &) const;
+};
    +
    +

    Description

    +
    +

    +as_min public member functions

    +
    1. remove_const< T >::type operator()(T & arr) const;
    +
    +
    +
    + + + +
    Copyright © 2005, 2006 Eric Niebler

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/numeric/functional/as_min_b_idm45507139322576.html b/doc/html/boost/numeric/functional/as_min_b_idm45507139322576.html new file mode 100644 index 0000000000..e7be16a744 --- /dev/null +++ b/doc/html/boost/numeric/functional/as_min_b_idm45507139322576.html @@ -0,0 +1,69 @@ + + + + +Struct template as_min_base<Arg, typename enable_if< is_floating_point< Arg > >::type> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct template as_min_base<Arg, typename enable_if< is_floating_point< Arg > >::type>

    +

    boost::numeric::functional::as_min_base<Arg, typename enable_if< is_floating_point< Arg > >::type>

    +
    +

    Synopsis

    +
    // In header: <boost/accumulators/numeric/functional.hpp>
+
+template<typename Arg> 
+struct as_min_base<Arg, typename enable_if< is_floating_point< Arg > >::type> :
+  public std::unary_function< Arg, remove_const< Arg >::type >
+{
+
+  // public member functions
+   BOOST_STATIC_ASSERT(std::numeric_limits< typename remove_const< Arg >::type >::is_specialized);
+  remove_const< Arg >::type operator()(Arg &) const;
+};
    +
    +

    Description

    +
    +

    +as_min_base public member functions

    +
      +
    1.  BOOST_STATIC_ASSERT(std::numeric_limits< typename remove_const< Arg >::type >::is_specialized);
      2. +
    2. remove_const< Arg >::type operator()(Arg &) const;
      3. +
    +
    +
    +
    + + + +
    Copyright © 2005, 2006 Eric Niebler

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/numeric/functional/as_min_base.html b/doc/html/boost/numeric/functional/as_min_base.html index 26776fb689..b179cd6223 100644 --- a/doc/html/boost/numeric/functional/as_min_base.html +++ b/doc/html/boost/numeric/functional/as_min_base.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -37,18 +37,18 @@ public std::unary_function< Arg, remove_const< Arg >::type > { - // public member functions - BOOST_STATIC_ASSERT(std::numeric_limits< typename remove_const< Arg >::type >::is_specialized); - remove_const< Arg >::type operator()(Arg &) const; + // public member functions + BOOST_STATIC_ASSERT(std::numeric_limits< typename remove_const< Arg >::type >::is_specialized); + remove_const< Arg >::type operator()(Arg &) const; };
    -

    Description

    +

    Description

    -

    -as_min_base public member functions

    +

    +as_min_base public member functions

      -
    1.  BOOST_STATIC_ASSERT(std::numeric_limits< typename remove_const< Arg >::type >::is_specialized);
      2. -
    2. remove_const< Arg >::type operator()(Arg &) const;
      3. +
    3.  BOOST_STATIC_ASSERT(std::numeric_limits< typename remove_const< Arg >::type >::is_specialized);
      4. +
    4. remove_const< Arg >::type operator()(Arg &) const;
    @@ -63,7 +63,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/numeric/functional/as_min_base_Ar_idp67089040.html b/doc/html/boost/numeric/functional/as_min_base_Ar_idp67089040.html deleted file mode 100644 index 736ff1e6b3..0000000000 --- a/doc/html/boost/numeric/functional/as_min_base_Ar_idp67089040.html +++ /dev/null @@ -1,69 +0,0 @@ - - - - -Struct template as_min_base<Arg, typename enable_if< is_floating_point< Arg > >::type> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template as_min_base<Arg, typename enable_if< is_floating_point< Arg > >::type>

    -

    boost::numeric::functional::as_min_base<Arg, typename enable_if< is_floating_point< Arg > >::type>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/numeric/functional.hpp>
-
-template<typename Arg> 
-struct as_min_base<Arg, typename enable_if< is_floating_point< Arg > >::type> :
-  public std::unary_function< Arg, remove_const< Arg >::type >
-{
-
-  // public member functions
-   BOOST_STATIC_ASSERT(std::numeric_limits< typename remove_const< Arg >::type >::is_specialized);
-  remove_const< Arg >::type operator()(Arg &) const;
-};
    -
    -

    Description

    -
    -

    -as_min_base public member functions

    -
      -
    1.  BOOST_STATIC_ASSERT(std::numeric_limits< typename remove_const< Arg >::type >::is_specialized);
      2. -
    2. remove_const< Arg >::type operator()(Arg &) const;
      3. -
    -
    -
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/numeric/functional/as_one.html b/doc/html/boost/numeric/functional/as_one.html index 776c6fb288..79477b9dbe 100644 --- a/doc/html/boost/numeric/functional/as_one.html +++ b/doc/html/boost/numeric/functional/as_one.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -46,7 +46,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/numeric/functional/as_one_T__std__idp67429264.html b/doc/html/boost/numeric/functional/as_one_T__std__idp67429264.html deleted file mode 100644 index d65eddecbc..0000000000 --- a/doc/html/boost/numeric/functional/as_one_T__std__idp67429264.html +++ /dev/null @@ -1,63 +0,0 @@ - - - - -Struct template as_one<T, std_valarray_tag> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template as_one<T, std_valarray_tag>

    -

    boost::numeric::functional::as_one<T, std_valarray_tag>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/numeric/functional/valarray.hpp>
-
-template<typename T> 
-struct as_one<T, std_valarray_tag> : public std::unary_function< T, remove_const< T >::type > {
-
-  // public member functions
-  remove_const< T >::type operator()(T &) const;
-};
    -
    -

    Description

    -
    -

    -as_one public member functions

    -
    1. remove_const< T >::type operator()(T & arr) const;
    -
    -
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/numeric/functional/as_one_T__std__idp67505744.html b/doc/html/boost/numeric/functional/as_one_T__std__idp67505744.html deleted file mode 100644 index f83c0ea0fc..0000000000 --- a/doc/html/boost/numeric/functional/as_one_T__std__idp67505744.html +++ /dev/null @@ -1,63 +0,0 @@ - - - - -Struct template as_one<T, std_vector_tag> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template as_one<T, std_vector_tag>

    -

    boost::numeric::functional::as_one<T, std_vector_tag>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/numeric/functional/vector.hpp>
-
-template<typename T> 
-struct as_one<T, std_vector_tag> : public std::unary_function< T, remove_const< T >::type > {
-
-  // public member functions
-  remove_const< T >::type operator()(T &) const;
-};
    -
    -

    Description

    -
    -

    -as_one public member functions

    -
    1. remove_const< T >::type operator()(T & arr) const;
    -
    -
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/numeric/functional/as_one_T_idm45507138905872.html b/doc/html/boost/numeric/functional/as_one_T_idm45507138905872.html new file mode 100644 index 0000000000..ab8b44d189 --- /dev/null +++ b/doc/html/boost/numeric/functional/as_one_T_idm45507138905872.html @@ -0,0 +1,63 @@ + + + + +Struct template as_one<T, std_vector_tag> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct template as_one<T, std_vector_tag>

    +

    boost::numeric::functional::as_one<T, std_vector_tag>

    +
    +

    Synopsis

    +
    // In header: <boost/accumulators/numeric/functional/vector.hpp>
+
+template<typename T> 
+struct as_one<T, std_vector_tag> : public std::unary_function< T, remove_const< T >::type > {
+
+  // public member functions
+  remove_const< T >::type operator()(T &) const;
+};
    +
    +

    Description

    +
    +

    +as_one public member functions

    +
    1. remove_const< T >::type operator()(T & arr) const;
    +
    +
    +
    + + + +
    Copyright © 2005, 2006 Eric Niebler

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/numeric/functional/as_one_T_idm45507138982352.html b/doc/html/boost/numeric/functional/as_one_T_idm45507138982352.html new file mode 100644 index 0000000000..8c8e272d28 --- /dev/null +++ b/doc/html/boost/numeric/functional/as_one_T_idm45507138982352.html @@ -0,0 +1,63 @@ + + + + +Struct template as_one<T, std_valarray_tag> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct template as_one<T, std_valarray_tag>

    +

    boost::numeric::functional::as_one<T, std_valarray_tag>

    +
    +

    Synopsis

    +
    // In header: <boost/accumulators/numeric/functional/valarray.hpp>
+
+template<typename T> 
+struct as_one<T, std_valarray_tag> : public std::unary_function< T, remove_const< T >::type > {
+
+  // public member functions
+  remove_const< T >::type operator()(T &) const;
+};
    +
    +

    Description

    +
    +

    +as_one public member functions

    +
    1. remove_const< T >::type operator()(T & arr) const;
    +
    +
    +
    + + + +
    Copyright © 2005, 2006 Eric Niebler

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/numeric/functional/as_one_base.html b/doc/html/boost/numeric/functional/as_one_base.html index 973649af3e..3a55b8a41e 100644 --- a/doc/html/boost/numeric/functional/as_one_base.html +++ b/doc/html/boost/numeric/functional/as_one_base.html @@ -37,15 +37,15 @@ public std::unary_function< Arg, remove_const< Arg >::type > { - // public member functions - remove_const< Arg >::type operator()(Arg &) const; + // public member functions + remove_const< Arg >::type operator()(Arg &) const; };
    -

    Description

    +

    Description

    -

    -as_one_base public member functions

    -
    1. remove_const< Arg >::type operator()(Arg &) const;
    +

    +as_one_base public member functions

    +
    1. remove_const< Arg >::type operator()(Arg &) const;
    diff --git a/doc/html/boost/numeric/functional/as_zero_T__std_idp67434336.html b/doc/html/boost/numeric/functional/as_zero_T__std_idp67434336.html deleted file mode 100644 index ba02682ff9..0000000000 --- a/doc/html/boost/numeric/functional/as_zero_T__std_idp67434336.html +++ /dev/null @@ -1,63 +0,0 @@ - - - - -Struct template as_zero<T, std_valarray_tag> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template as_zero<T, std_valarray_tag>

    -

    boost::numeric::functional::as_zero<T, std_valarray_tag>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/numeric/functional/valarray.hpp>
-
-template<typename T> 
-struct as_zero<T, std_valarray_tag> : public std::unary_function< T, remove_const< T >::type > {
-
-  // public member functions
-  remove_const< T >::type operator()(T &) const;
-};
    -
    -

    Description

    -
    -

    -as_zero public member functions

    -
    1. remove_const< T >::type operator()(T & arr) const;
    -
    -
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/numeric/functional/as_zero_T__std_idp67510816.html b/doc/html/boost/numeric/functional/as_zero_T__std_idp67510816.html deleted file mode 100644 index 3ec92dfb2e..0000000000 --- a/doc/html/boost/numeric/functional/as_zero_T__std_idp67510816.html +++ /dev/null @@ -1,63 +0,0 @@ - - - - -Struct template as_zero<T, std_vector_tag> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template as_zero<T, std_vector_tag>

    -

    boost::numeric::functional::as_zero<T, std_vector_tag>

    -
    -

    Synopsis

    -
    // In header: <boost/accumulators/numeric/functional/vector.hpp>
-
-template<typename T> 
-struct as_zero<T, std_vector_tag> : public std::unary_function< T, remove_const< T >::type > {
-
-  // public member functions
-  remove_const< T >::type operator()(T &) const;
-};
    -
    -

    Description

    -
    -

    -as_zero public member functions

    -
    1. remove_const< T >::type operator()(T & arr) const;
    -
    -
    -
    - - - -
    Copyright © 2005, 2006 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/numeric/functional/as_zero__idm45507138900800.html b/doc/html/boost/numeric/functional/as_zero__idm45507138900800.html new file mode 100644 index 0000000000..9a050f8476 --- /dev/null +++ b/doc/html/boost/numeric/functional/as_zero__idm45507138900800.html @@ -0,0 +1,63 @@ + + + + +Struct template as_zero<T, std_vector_tag> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct template as_zero<T, std_vector_tag>

    +

    boost::numeric::functional::as_zero<T, std_vector_tag>

    +
    +

    Synopsis

    +
    // In header: <boost/accumulators/numeric/functional/vector.hpp>
+
+template<typename T> 
+struct as_zero<T, std_vector_tag> : public std::unary_function< T, remove_const< T >::type > {
+
+  // public member functions
+  remove_const< T >::type operator()(T &) const;
+};
    +
    +

    Description

    +
    +

    +as_zero public member functions

    +
    1. remove_const< T >::type operator()(T & arr) const;
    +
    +
    +
    + + + +
    Copyright © 2005, 2006 Eric Niebler

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/numeric/functional/as_zero__idm45507138977280.html b/doc/html/boost/numeric/functional/as_zero__idm45507138977280.html new file mode 100644 index 0000000000..5df59eb42d --- /dev/null +++ b/doc/html/boost/numeric/functional/as_zero__idm45507138977280.html @@ -0,0 +1,63 @@ + + + + +Struct template as_zero<T, std_valarray_tag> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct template as_zero<T, std_valarray_tag>

    +

    boost::numeric::functional::as_zero<T, std_valarray_tag>

    +
    +

    Synopsis

    +
    // In header: <boost/accumulators/numeric/functional/valarray.hpp>
+
+template<typename T> 
+struct as_zero<T, std_valarray_tag> : public std::unary_function< T, remove_const< T >::type > {
+
+  // public member functions
+  remove_const< T >::type operator()(T &) const;
+};
    +
    +

    Description

    +
    +

    +as_zero public member functions

    +
    1. remove_const< T >::type operator()(T & arr) const;
    +
    +
    +
    + + + +
    Copyright © 2005, 2006 Eric Niebler

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/numeric/functional/as_zero_base.html b/doc/html/boost/numeric/functional/as_zero_base.html index d56d626937..7c4a6aac3d 100644 --- a/doc/html/boost/numeric/functional/as_zero_base.html +++ b/doc/html/boost/numeric/functional/as_zero_base.html @@ -37,15 +37,15 @@ public std::unary_function< Arg, remove_const< Arg >::type > { - // public member functions - remove_const< Arg >::type operator()(Arg &) const; + // public member functions + remove_const< Arg >::type operator()(Arg &) const; };
    -

    Description

    +

    Description

    -

    -as_zero_base public member functions

    -
    1. remove_const< Arg >::type operator()(Arg &) const;
    +

    +as_zero_base public member functions

    +
    1. remove_const< Arg >::type operator()(Arg &) const;
    diff --git a/doc/html/boost/numeric/functional/assign_base.html b/doc/html/boost/numeric/functional/assign_base.html index b829d5db4a..93f54fb255 100644 --- a/doc/html/boost/numeric/functional/assign_base.html +++ b/doc/html/boost/numeric/functional/assign_base.html @@ -36,16 +36,16 @@ struct assign_base : public std::binary_function< Left, Right, typeof(lvalue< Left >()=lvalue< Right >())> { - // public member functions - result_type operator()(Left &, Right &) const; + // public member functions + result_type operator()(Left &, Right &) const; };
    -

    Description

    +

    Description

    -

    -assign_base public member functions

    +

    +assign_base public member functions

    1. -
      result_type operator()(Left & left, Right & right) const;
      +
      result_type operator()(Left & left, Right & right) const;

      diff --git a/doc/html/boost/numeric/functional/complement_base.html b/doc/html/boost/numeric/functional/complement_base.html index 592858d266..9badbf3a56 100644 --- a/doc/html/boost/numeric/functional/complement_base.html +++ b/doc/html/boost/numeric/functional/complement_base.html @@ -37,16 +37,16 @@ publicstd::unary_function<Arg,typeof(~lvalue<Arg>())>{ - // public member functions - result_typeoperator()(Arg&)const; + // public member functions + result_typeoperator()(Arg&)const;};
      -

      Description

      +

      Description

      -

      -complement_base public member functions

      +

      +complement_base public member functions

      1. -
        result_type operator()(Arg & arg) const;
        +
        result_type operator()(Arg & arg) const;

      diff --git a/doc/html/boost/numeric/functional/divides_assign_base.html b/doc/html/boost/numeric/functional/divides_assign_base.html index 9afcadf734..c4a5cdc110 100644 --- a/doc/html/boost/numeric/functional/divides_assign_base.html +++ b/doc/html/boost/numeric/functional/divides_assign_base.html @@ -36,16 +36,16 @@ structdivides_assign_base:public std::binary_function< Left, Right, typeof(lvalue< Left >()/=lvalue< Right >())> { - // public member functions - result_typeoperator()(Left&,Right&)const; + // public member functions + result_typeoperator()(Left&,Right&)const;};
      -

      Description

      +

      Description

      -

      -divides_assign_base public member functions

      +

      +divides_assign_base public member functions

      1. -
        result_type operator()(Left & left, Right & right) const;
        +
        result_type operator()(Left & left, Right & right) const;

      diff --git a/doc/html/boost/numeric/functional/divides_base.html b/doc/html/boost/numeric/functional/divides_base.html index 368750a78b..ac38d1369d 100644 --- a/doc/html/boost/numeric/functional/divides_base.html +++ b/doc/html/boost/numeric/functional/divides_base.html @@ -36,16 +36,16 @@ structdivides_base:public std::binary_function< Left, Right, typeof(lvalue< Left >()/lvalue< Right >())> { - // public member functions - result_typeoperator()(Left&,Right&)const; + // public member functions + result_typeoperator()(Left&,Right&)const;};
      -

      Description

      +

      Description

      -

      -divides_base public member functions

      +

      +divides_base public member functions

      1. -
        result_type operator()(Left & left, Right & right) const;
        +
        result_type operator()(Left & left, Right & right) const;

      diff --git a/doc/html/boost/numeric/functional/equal_to_base.html b/doc/html/boost/numeric/functional/equal_to_base.html index a3bb5acd1f..56a606f828 100644 --- a/doc/html/boost/numeric/functional/equal_to_base.html +++ b/doc/html/boost/numeric/functional/equal_to_base.html @@ -36,16 +36,16 @@ structequal_to_base:public std::binary_function< Left, Right, typeof(lvalue< Left >()==lvalue< Right >())> { - // public member functions - result_typeoperator()(Left&,Right&)const; + // public member functions + result_typeoperator()(Left&,Right&)const;};
      -

      Description

      +

      Description

      -

      -equal_to_base public member functions

      +

      +equal_to_base public member functions

      1. -
        result_type operator()(Left & left, Right & right) const;
        +
        result_type operator()(Left & left, Right & right) const;

      diff --git a/doc/html/boost/numeric/functional/fdiv_Lef_idm45507138895728.html b/doc/html/boost/numeric/functional/fdiv_Lef_idm45507138895728.html new file mode 100644 index 0000000000..d20ee61e8f --- /dev/null +++ b/doc/html/boost/numeric/functional/fdiv_Lef_idm45507138895728.html @@ -0,0 +1,53 @@ + + + + +Struct template fdiv<Left, Right, std_vector_tag, void> + + + + + + + + +
      + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Struct template fdiv<Left, Right, std_vector_tag, void>

      +

      boost::numeric::functional::fdiv<Left, Right, std_vector_tag, void>

      +
      +

      Synopsis

      +
      // In header: <boost/accumulators/numeric/functional/vector.hpp>
+
+template<typename Left, typename Right> 
+struct fdiv<Left, Right, std_vector_tag, void> : public mpl::if_::type< are_integral< Left::value_type, Right >, divides< Left, double const  >, divides< Left, Right > >
+{
+};
      +
      + + + +
      Copyright © 2005, 2006 Eric Niebler

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/numeric/functional/fdiv_Lef_idm45507138972208.html b/doc/html/boost/numeric/functional/fdiv_Lef_idm45507138972208.html new file mode 100644 index 0000000000..a880891cca --- /dev/null +++ b/doc/html/boost/numeric/functional/fdiv_Lef_idm45507138972208.html @@ -0,0 +1,53 @@ + + + + +Struct template fdiv<Left, Right, std_valarray_tag, RightTag> + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Struct template fdiv<Left, Right, std_valarray_tag, RightTag>

      +

      boost::numeric::functional::fdiv<Left, Right, std_valarray_tag, RightTag>

      +
      +

      Synopsis

      +
      // In header: <boost/accumulators/numeric/functional/valarray.hpp>
+
+template<typename Left, typename Right, typename RightTag> 
+struct fdiv<Left, Right, std_valarray_tag, RightTag> : public mpl::if_::type< are_integral< Left::value_type, Right >, divides< Left, double const  >, divides< Left, Right > >
+{
+};
      +
      + + + +
      Copyright © 2005, 2006 Eric Niebler

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/numeric/functional/fdiv_Left__Rig_idp67439408.html b/doc/html/boost/numeric/functional/fdiv_Left__Rig_idp67439408.html deleted file mode 100644 index 1b0602ae25..0000000000 --- a/doc/html/boost/numeric/functional/fdiv_Left__Rig_idp67439408.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template fdiv<Left, Right, std_valarray_tag, RightTag> - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Struct template fdiv<Left, Right, std_valarray_tag, RightTag>

      -

      boost::numeric::functional::fdiv<Left, Right, std_valarray_tag, RightTag>

      -
      -

      Synopsis

      -
      // In header: <boost/accumulators/numeric/functional/valarray.hpp>
-
-template<typename Left, typename Right, typename RightTag> 
-struct fdiv<Left, Right, std_valarray_tag, RightTag> : public mpl::if_::type< are_integral< Left::value_type, Right >, divides< Left, double const  >, divides< Left, Right > >
-{
-};
      -
      - - - -
      Copyright © 2005, 2006 Eric Niebler

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/numeric/functional/fdiv_Left__Rig_idp67515888.html b/doc/html/boost/numeric/functional/fdiv_Left__Rig_idp67515888.html deleted file mode 100644 index cbdde198f5..0000000000 --- a/doc/html/boost/numeric/functional/fdiv_Left__Rig_idp67515888.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template fdiv<Left, Right, std_vector_tag, void> - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Struct template fdiv<Left, Right, std_vector_tag, void>

      -

      boost::numeric::functional::fdiv<Left, Right, std_vector_tag, void>

      -
      -

      Synopsis

      -
      // In header: <boost/accumulators/numeric/functional/vector.hpp>
-
-template<typename Left, typename Right> 
-struct fdiv<Left, Right, std_vector_tag, void> : public mpl::if_::type< are_integral< Left::value_type, Right >, divides< Left, double const  >, divides< Left, Right > >
-{
-};
      -
      - - - -
      Copyright © 2005, 2006 Eric Niebler

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/numeric/functional/fdiv_bas_idm45507139240192.html b/doc/html/boost/numeric/functional/fdiv_bas_idm45507139240192.html new file mode 100644 index 0000000000..a4321279b3 --- /dev/null +++ b/doc/html/boost/numeric/functional/fdiv_bas_idm45507139240192.html @@ -0,0 +1,54 @@ + + + + +Struct template fdiv_base<Left, Right, typename enable_if< are_integral< Left, Right > >::type> + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Struct template fdiv_base<Left, Right, typename enable_if< are_integral< Left, Right > >::type>

      +

      boost::numeric::functional::fdiv_base<Left, Right, typename enable_if< are_integral< Left, Right > >::type>

      +
      +

      Synopsis

      +
      // In header: <boost/accumulators/numeric/functional.hpp>
+
+template<typename Left, typename Right> 
+struct fdiv_base<Left, Right, typename enable_if< are_integral< Left, Right > >::type> :
+  public boost::numeric::functional::divides< double const, double const  >
+{
+};
      +
      + + + +
      Copyright © 2005, 2006 Eric Niebler

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/numeric/functional/fdiv_base.html b/doc/html/boost/numeric/functional/fdiv_base.html index 39534d4c7f..7d91b771e4 100644 --- a/doc/html/boost/numeric/functional/fdiv_base.html +++ b/doc/html/boost/numeric/functional/fdiv_base.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      @@ -46,7 +46,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/numeric/functional/fdiv_base_Left_idp67171424.html b/doc/html/boost/numeric/functional/fdiv_base_Left_idp67171424.html deleted file mode 100644 index c21d3de3b0..0000000000 --- a/doc/html/boost/numeric/functional/fdiv_base_Left_idp67171424.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template fdiv_base<Left, Right, typename enable_if< are_integral< Left, Right > >::type> - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Struct template fdiv_base<Left, Right, typename enable_if< are_integral< Left, Right > >::type>

      -

      boost::numeric::functional::fdiv_base<Left, Right, typename enable_if< are_integral< Left, Right > >::type>

      -
      -

      Synopsis

      -
      // In header: <boost/accumulators/numeric/functional.hpp>
-
-template<typename Left, typename Right> 
-struct fdiv_base<Left, Right, typename enable_if< are_integral< Left, Right > >::type> :
-  public boost::numeric::functional::divides< double const, double const  >
-{
-};
      -
      - - - -
      Copyright © 2005, 2006 Eric Niebler

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/numeric/functional/greater.html b/doc/html/boost/numeric/functional/greater.html index c6363fed90..0d1b60ca81 100644 --- a/doc/html/boost/numeric/functional/greater.html +++ b/doc/html/boost/numeric/functional/greater.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      @@ -50,7 +50,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/numeric/functional/greater_base.html b/doc/html/boost/numeric/functional/greater_base.html index 459238dc1f..5294e626a4 100644 --- a/doc/html/boost/numeric/functional/greater_base.html +++ b/doc/html/boost/numeric/functional/greater_base.html @@ -36,16 +36,16 @@ struct greater_base : public std::binary_function< Left, Right, typeof(lvalue< Left >() > lvalue< Right >())> { - // public member functions - result_type operator()(Left &, Right &) const; + // public member functions + result_type operator()(Left &, Right &) const; };
      -

      Description

      +

      Description

      -

      -greater_base public member functions

      +

      +greater_base public member functions

      1. -
        result_type operator()(Left & left, Right & right) const;
        +
        result_type operator()(Left & left, Right & right) const;

        diff --git a/doc/html/boost/numeric/functional/greater_equal_base.html b/doc/html/boost/numeric/functional/greater_equal_base.html index d76f2a8367..9fd4097547 100644 --- a/doc/html/boost/numeric/functional/greater_equal_base.html +++ b/doc/html/boost/numeric/functional/greater_equal_base.html @@ -36,16 +36,16 @@ structgreater_equal_base:public std::binary_function< Left, Right, typeof(lvalue< Left >() >=lvalue< Right >())> { - // public member functions - result_typeoperator()(Left&,Right&)const; + // public member functions + result_typeoperator()(Left&,Right&)const;};
        -

        Description

        +

        Description

        -

        -greater_equal_base public member functions

        +

        +greater_equal_base public member functions

        1. -
          result_type operator()(Left & left, Right & right) const;
          +
          result_type operator()(Left & left, Right & right) const;

        diff --git a/doc/html/boost/numeric/functional/less_base.html b/doc/html/boost/numeric/functional/less_base.html index 98cb628a52..6ee15bc756 100644 --- a/doc/html/boost/numeric/functional/less_base.html +++ b/doc/html/boost/numeric/functional/less_base.html @@ -36,16 +36,16 @@ structless_base:public std::binary_function< Left, Right, typeof(lvalue< Left >()< lvalue< Right >())> { - // public member functions - result_typeoperator()(Left&,Right&)const; + // public member functions + result_typeoperator()(Left&,Right&)const;};
        -

        Description

        +

        Description

        -

        -less_base public member functions

        +

        +less_base public member functions

        1. -
          result_type operator()(Left & left, Right & right) const;
          +
          result_type operator()(Left & left, Right & right) const;

        diff --git a/doc/html/boost/numeric/functional/less_equal_base.html b/doc/html/boost/numeric/functional/less_equal_base.html index 59ebffaf08..d810d655c2 100644 --- a/doc/html/boost/numeric/functional/less_equal_base.html +++ b/doc/html/boost/numeric/functional/less_equal_base.html @@ -36,16 +36,16 @@ structless_equal_base:public std::binary_function< Left, Right, typeof(lvalue< Left >()<=lvalue< Right >())> { - // public member functions - result_typeoperator()(Left&,Right&)const; + // public member functions + result_typeoperator()(Left&,Right&)const;};
        -

        Description

        +

        Description

        -

        -less_equal_base public member functions

        +

        +less_equal_base public member functions

        1. -
          result_type operator()(Left & left, Right & right) const;
          +
          result_type operator()(Left & left, Right & right) const;

        diff --git a/doc/html/boost/numeric/functional/logical_not_base.html b/doc/html/boost/numeric/functional/logical_not_base.html index af5172800b..2c18cbf90c 100644 --- a/doc/html/boost/numeric/functional/logical_not_base.html +++ b/doc/html/boost/numeric/functional/logical_not_base.html @@ -37,16 +37,16 @@ publicstd::unary_function<Arg,typeof(!lvalue<Arg>())>{ - // public member functions - result_typeoperator()(Arg&)const; + // public member functions + result_typeoperator()(Arg&)const;};
        -

        Description

        +

        Description

        -

        -logical_not_base public member functions

        +

        +logical_not_base public member functions

        1. -
          result_type operator()(Arg & arg) const;
          +
          result_type operator()(Arg & arg) const;

        diff --git a/doc/html/boost/numeric/functional/max_assi_idm45507138891984.html b/doc/html/boost/numeric/functional/max_assi_idm45507138891984.html new file mode 100644 index 0000000000..b693879543 --- /dev/null +++ b/doc/html/boost/numeric/functional/max_assi_idm45507138891984.html @@ -0,0 +1,63 @@ + + + + +Struct template max_assign<Left, Right, std_vector_tag, std_vector_tag> + + + + + + + + +
        + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Struct template max_assign<Left, Right, std_vector_tag, std_vector_tag>

        +

        boost::numeric::functional::max_assign<Left, Right, std_vector_tag, std_vector_tag>

        +
        +

        Synopsis

        +
        // In header: <boost/accumulators/numeric/functional/vector.hpp>
+
+template<typename Left, typename Right> 
+struct max_assign<Left, Right, std_vector_tag, std_vector_tag> : public std::binary_function< Left, Right, void > {
+
+  // public member functions
+  void operator()(Left &, Right &) const;
+};
        +
        +

        Description

        +
        +

        +max_assign public member functions

        +
        1. void operator()(Left & left, Right & right) const;
        +
        +
        +
        + + + +
        Copyright © 2005, 2006 Eric Niebler

        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/numeric/functional/max_assi_idm45507138967904.html b/doc/html/boost/numeric/functional/max_assi_idm45507138967904.html new file mode 100644 index 0000000000..8d76c3c020 --- /dev/null +++ b/doc/html/boost/numeric/functional/max_assi_idm45507138967904.html @@ -0,0 +1,63 @@ + + + + +Struct template max_assign<Left, Right, std_valarray_tag, std_valarray_tag> + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Struct template max_assign<Left, Right, std_valarray_tag, std_valarray_tag>

        +

        boost::numeric::functional::max_assign<Left, Right, std_valarray_tag, std_valarray_tag>

        +
        +

        Synopsis

        +
        // In header: <boost/accumulators/numeric/functional/valarray.hpp>
+
+template<typename Left, typename Right> 
+struct max_assign<Left, Right, std_valarray_tag, std_valarray_tag> : public std::binary_function< Left, Right, void > {
+
+  // public member functions
+  void operator()(Left &, Right &) const;
+};
        +
        +

        Description

        +
        +

        +max_assign public member functions

        +
        1. void operator()(Left & left, Right & right) const;
        +
        +
        +
        + + + +
        Copyright © 2005, 2006 Eric Niebler

        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/numeric/functional/max_assign_Lef_idp67443712.html b/doc/html/boost/numeric/functional/max_assign_Lef_idp67443712.html deleted file mode 100644 index 8022cc71ac..0000000000 --- a/doc/html/boost/numeric/functional/max_assign_Lef_idp67443712.html +++ /dev/null @@ -1,63 +0,0 @@ - - - - -Struct template max_assign<Left, Right, std_valarray_tag, std_valarray_tag> - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Struct template max_assign<Left, Right, std_valarray_tag, std_valarray_tag>

        -

        boost::numeric::functional::max_assign<Left, Right, std_valarray_tag, std_valarray_tag>

        -
        -

        Synopsis

        -
        // In header: <boost/accumulators/numeric/functional/valarray.hpp>
-
-template<typename Left, typename Right> 
-struct max_assign<Left, Right, std_valarray_tag, std_valarray_tag> : public std::binary_function< Left, Right, void > {
-
-  // public member functions
-  void operator()(Left &, Right &) const;
-};
        -
        -

        Description

        -
        -

        -max_assign public member functions

        -
        1. void operator()(Left & left, Right & right) const;
        -
        -
        -
        - - - -
        Copyright © 2005, 2006 Eric Niebler

        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/numeric/functional/max_assign_Lef_idp67519632.html b/doc/html/boost/numeric/functional/max_assign_Lef_idp67519632.html deleted file mode 100644 index db1c6c7a0c..0000000000 --- a/doc/html/boost/numeric/functional/max_assign_Lef_idp67519632.html +++ /dev/null @@ -1,63 +0,0 @@ - - - - -Struct template max_assign<Left, Right, std_vector_tag, std_vector_tag> - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Struct template max_assign<Left, Right, std_vector_tag, std_vector_tag>

        -

        boost::numeric::functional::max_assign<Left, Right, std_vector_tag, std_vector_tag>

        -
        -

        Synopsis

        -
        // In header: <boost/accumulators/numeric/functional/vector.hpp>
-
-template<typename Left, typename Right> 
-struct max_assign<Left, Right, std_vector_tag, std_vector_tag> : public std::binary_function< Left, Right, void > {
-
-  // public member functions
-  void operator()(Left &, Right &) const;
-};
        -
        -

        Description

        -
        -

        -max_assign public member functions

        -
        1. void operator()(Left & left, Right & right) const;
        -
        -
        -
        - - - -
        Copyright © 2005, 2006 Eric Niebler

        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/numeric/functional/max_assign_base.html b/doc/html/boost/numeric/functional/max_assign_base.html index 4714592805..1d3a675d36 100644 --- a/doc/html/boost/numeric/functional/max_assign_base.html +++ b/doc/html/boost/numeric/functional/max_assign_base.html @@ -35,15 +35,15 @@ template<typename Left, typename Right, typename EnableIf> struct max_assign_base : public std::binary_function< Left, Right, void > { - // public member functions - void operator()(Left &, Right &) const; + // public member functions + void operator()(Left &, Right &) const; };
        -

        Description

        +

        Description

        -

        -max_assign_base public member functions

        -
        1. void operator()(Left & left, Right & right) const;
        +

        +max_assign_base public member functions

        +
        1. void operator()(Left & left, Right & right) const;
      diff --git a/doc/html/boost/numeric/functional/min_assi_idm45507138885088.html b/doc/html/boost/numeric/functional/min_assi_idm45507138885088.html new file mode 100644 index 0000000000..3bdd53386b --- /dev/null +++ b/doc/html/boost/numeric/functional/min_assi_idm45507138885088.html @@ -0,0 +1,63 @@ + + + + +Struct template min_assign<Left, Right, std_vector_tag, std_vector_tag> + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Struct template min_assign<Left, Right, std_vector_tag, std_vector_tag>

      +

      boost::numeric::functional::min_assign<Left, Right, std_vector_tag, std_vector_tag>

      +
      +

      Synopsis

      +
      // In header: <boost/accumulators/numeric/functional/vector.hpp>
+
+template<typename Left, typename Right> 
+struct min_assign<Left, Right, std_vector_tag, std_vector_tag> : public std::binary_function< Left, Right, void > {
+
+  // public member functions
+  void operator()(Left &, Right &) const;
+};
      +
      +

      Description

      +
      +

      +min_assign public member functions

      +
      1. void operator()(Left & left, Right & right) const;
      +
      +
      +
      + + + +
      Copyright © 2005, 2006 Eric Niebler

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/numeric/functional/min_assi_idm45507138961008.html b/doc/html/boost/numeric/functional/min_assi_idm45507138961008.html new file mode 100644 index 0000000000..88956c5f75 --- /dev/null +++ b/doc/html/boost/numeric/functional/min_assi_idm45507138961008.html @@ -0,0 +1,63 @@ + + + + +Struct template min_assign<Left, Right, std_valarray_tag, std_valarray_tag> + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Struct template min_assign<Left, Right, std_valarray_tag, std_valarray_tag>

      +

      boost::numeric::functional::min_assign<Left, Right, std_valarray_tag, std_valarray_tag>

      +
      +

      Synopsis

      +
      // In header: <boost/accumulators/numeric/functional/valarray.hpp>
+
+template<typename Left, typename Right> 
+struct min_assign<Left, Right, std_valarray_tag, std_valarray_tag> : public std::binary_function< Left, Right, void > {
+
+  // public member functions
+  void operator()(Left &, Right &) const;
+};
      +
      +

      Description

      +
      +

      +min_assign public member functions

      +
      1. void operator()(Left & left, Right & right) const;
      +
      +
      +
      + + + +
      Copyright © 2005, 2006 Eric Niebler

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/numeric/functional/min_assign_Lef_idp67450608.html b/doc/html/boost/numeric/functional/min_assign_Lef_idp67450608.html deleted file mode 100644 index 0c4065dcd3..0000000000 --- a/doc/html/boost/numeric/functional/min_assign_Lef_idp67450608.html +++ /dev/null @@ -1,63 +0,0 @@ - - - - -Struct template min_assign<Left, Right, std_valarray_tag, std_valarray_tag> - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Struct template min_assign<Left, Right, std_valarray_tag, std_valarray_tag>

      -

      boost::numeric::functional::min_assign<Left, Right, std_valarray_tag, std_valarray_tag>

      -
      -

      Synopsis

      -
      // In header: <boost/accumulators/numeric/functional/valarray.hpp>
-
-template<typename Left, typename Right> 
-struct min_assign<Left, Right, std_valarray_tag, std_valarray_tag> : public std::binary_function< Left, Right, void > {
-
-  // public member functions
-  void operator()(Left &, Right &) const;
-};
      -
      -

      Description

      -
      -

      -min_assign public member functions

      -
      1. void operator()(Left & left, Right & right) const;
      -
      -
      -
      - - - -
      Copyright © 2005, 2006 Eric Niebler

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/numeric/functional/min_assign_Lef_idp67526528.html b/doc/html/boost/numeric/functional/min_assign_Lef_idp67526528.html deleted file mode 100644 index ccaa67b84b..0000000000 --- a/doc/html/boost/numeric/functional/min_assign_Lef_idp67526528.html +++ /dev/null @@ -1,63 +0,0 @@ - - - - -Struct template min_assign<Left, Right, std_vector_tag, std_vector_tag> - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Struct template min_assign<Left, Right, std_vector_tag, std_vector_tag>

      -

      boost::numeric::functional::min_assign<Left, Right, std_vector_tag, std_vector_tag>

      -
      -

      Synopsis

      -
      // In header: <boost/accumulators/numeric/functional/vector.hpp>
-
-template<typename Left, typename Right> 
-struct min_assign<Left, Right, std_vector_tag, std_vector_tag> : public std::binary_function< Left, Right, void > {
-
-  // public member functions
-  void operator()(Left &, Right &) const;
-};
      -
      -

      Description

      -
      -

      -min_assign public member functions

      -
      1. void operator()(Left & left, Right & right) const;
      -
      -
      -
      - - - -
      Copyright © 2005, 2006 Eric Niebler

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/numeric/functional/min_assign_base.html b/doc/html/boost/numeric/functional/min_assign_base.html index a01ba6ac6d..63aa33ea77 100644 --- a/doc/html/boost/numeric/functional/min_assign_base.html +++ b/doc/html/boost/numeric/functional/min_assign_base.html @@ -35,15 +35,15 @@ template<typename Left, typename Right, typename EnableIf> struct min_assign_base : public std::binary_function< Left, Right, void > { - // public member functions - void operator()(Left &, Right &) const; + // public member functions + void operator()(Left &, Right &) const; };
      -

      Description

      +

      Description

      -

      -min_assign_base public member functions

      -
      1. void operator()(Left & left, Right & right) const;
      +

      +min_assign_base public member functions

      +
      1. void operator()(Left & left, Right & right) const;
      diff --git a/doc/html/boost/numeric/functional/minus_assign_base.html b/doc/html/boost/numeric/functional/minus_assign_base.html index 225a8aea79..75bdc41dc3 100644 --- a/doc/html/boost/numeric/functional/minus_assign_base.html +++ b/doc/html/boost/numeric/functional/minus_assign_base.html @@ -36,16 +36,16 @@ struct minus_assign_base : public std::binary_function< Left, Right, typeof(lvalue< Left >()-=lvalue< Right >())> { - // public member functions - result_type operator()(Left &, Right &) const; + // public member functions + result_type operator()(Left &, Right &) const; };
      -

      Description

      +

      Description

      -

      -minus_assign_base public member functions

      +

      +minus_assign_base public member functions

      1. -
        result_type operator()(Left & left, Right & right) const;
        +
        result_type operator()(Left & left, Right & right) const;

        diff --git a/doc/html/boost/numeric/functional/minus_base.html b/doc/html/boost/numeric/functional/minus_base.html index 266bd7576d..09cde184ee 100644 --- a/doc/html/boost/numeric/functional/minus_base.html +++ b/doc/html/boost/numeric/functional/minus_base.html @@ -36,16 +36,16 @@ structminus_base:public std::binary_function< Left, Right, typeof(lvalue< Left >()-lvalue< Right >())> { - // public member functions - result_typeoperator()(Left&,Right&)const; + // public member functions + result_typeoperator()(Left&,Right&)const;};
        -

        Description

        +

        Description

        -

        -minus_base public member functions

        +

        +minus_base public member functions

        1. -
          result_type operator()(Left & left, Right & right) const;
          +
          result_type operator()(Left & left, Right & right) const;

        diff --git a/doc/html/boost/numeric/functional/modulus_assign_base.html b/doc/html/boost/numeric/functional/modulus_assign_base.html index 286a01862a..80e5261144 100644 --- a/doc/html/boost/numeric/functional/modulus_assign_base.html +++ b/doc/html/boost/numeric/functional/modulus_assign_base.html @@ -36,16 +36,16 @@ structmodulus_assign_base:public std::binary_function< Left, Right, typeof(lvalue< Left >()%=lvalue< Right >())> { - // public member functions - result_typeoperator()(Left&,Right&)const; + // public member functions + result_typeoperator()(Left&,Right&)const;};
        -

        Description

        +

        Description

        -

        -modulus_assign_base public member functions

        +

        +modulus_assign_base public member functions

        1. -
          result_type operator()(Left & left, Right & right) const;
          +
          result_type operator()(Left & left, Right & right) const;

        diff --git a/doc/html/boost/numeric/functional/modulus_base.html b/doc/html/boost/numeric/functional/modulus_base.html index 3b615475aa..523c5f2af3 100644 --- a/doc/html/boost/numeric/functional/modulus_base.html +++ b/doc/html/boost/numeric/functional/modulus_base.html @@ -36,16 +36,16 @@ structmodulus_base:public std::binary_function< Left, Right, typeof(lvalue< Left >()%lvalue< Right >())> { - // public member functions - result_typeoperator()(Left&,Right&)const; + // public member functions + result_typeoperator()(Left&,Right&)const;};
        -

        Description

        +

        Description

        -

        -modulus_base public member functions

        +

        +modulus_base public member functions

        1. -
          result_type operator()(Left & left, Right & right) const;
          +
          result_type operator()(Left & left, Right & right) const;

        diff --git a/doc/html/boost/numeric/functional/multiplies_assign_base.html b/doc/html/boost/numeric/functional/multiplies_assign_base.html index 2083bf6bc7..3ef4e50338 100644 --- a/doc/html/boost/numeric/functional/multiplies_assign_base.html +++ b/doc/html/boost/numeric/functional/multiplies_assign_base.html @@ -36,16 +36,16 @@ structmultiplies_assign_base:public std::binary_function< Left, Right, typeof(lvalue< Left >()*=lvalue< Right >())> { - // public member functions - result_typeoperator()(Left&,Right&)const; + // public member functions + result_typeoperator()(Left&,Right&)const;};
        -

        Description

        +

        Description

        -

        -multiplies_assign_base public member functions

        +

        +multiplies_assign_base public member functions

        1. -
          result_type operator()(Left & left, Right & right) const;
          +
          result_type operator()(Left & left, Right & right) const;

        diff --git a/doc/html/boost/numeric/functional/multiplies_base.html b/doc/html/boost/numeric/functional/multiplies_base.html index 1c11005846..3f1c6d1139 100644 --- a/doc/html/boost/numeric/functional/multiplies_base.html +++ b/doc/html/boost/numeric/functional/multiplies_base.html @@ -36,16 +36,16 @@ structmultiplies_base:public std::binary_function< Left, Right, typeof(lvalue< Left >()*lvalue< Right >())> { - // public member functions - result_typeoperator()(Left&,Right&)const; + // public member functions + result_typeoperator()(Left&,Right&)const;};
        -

        Description

        +

        Description

        -

        -multiplies_base public member functions

        +

        +multiplies_base public member functions

        1. -
          result_type operator()(Left & left, Right & right) const;
          +
          result_type operator()(Left & left, Right & right) const;

        diff --git a/doc/html/boost/numeric/functional/multiply_and_p_idp65905632.html b/doc/html/boost/numeric/functional/multiply_and_p_idp65905632.html deleted file mode 100644 index b47c6c2f36..0000000000 --- a/doc/html/boost/numeric/functional/multiply_and_p_idp65905632.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template multiply_and_promote_to_double - - - - - - - - -
        - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Struct template multiply_and_promote_to_double

        -

        boost::numeric::functional::multiply_and_promote_to_double

        -
        -

        Synopsis

        -
        // In header: <boost/accumulators/statistics/weighted_tail_variate_means.hpp>
-
-template<typename T, typename U> 
-struct multiply_and_promote_to_double :
-  public functional::multiplies< T, double const  >
-{
-};
        -
        - - - -
        Copyright © 2005, 2006 Eric Niebler

        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/numeric/functional/not_equal_to_base.html b/doc/html/boost/numeric/functional/not_equal_to_base.html index 463678a723..bed640553c 100644 --- a/doc/html/boost/numeric/functional/not_equal_to_base.html +++ b/doc/html/boost/numeric/functional/not_equal_to_base.html @@ -36,16 +36,16 @@ struct not_equal_to_base : public std::binary_function< Left, Right, typeof(lvalue< Left >()!=lvalue< Right >())> { - // public member functions - result_type operator()(Left &, Right &) const; + // public member functions + result_type operator()(Left &, Right &) const; };
        -

        Description

        +

        Description

        -

        -not_equal_to_base public member functions

        +

        +not_equal_to_base public member functions

        1. -
          result_type operator()(Left & left, Right & right) const;
          +
          result_type operator()(Left & left, Right & right) const;

          diff --git a/doc/html/boost/numeric/functional/outer_product.html b/doc/html/boost/numeric/functional/outer_product.html deleted file mode 100644 index d750cd781d..0000000000 --- a/doc/html/boost/numeric/functional/outer_product.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Struct template outer_product - - - - - - - - -
          - - - - - - -
          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
          -
          -
          -PrevUpHomeNext -
          -
          -
          -
          -

          Struct template outer_product

          -

          boost::numeric::functional::outer_product

          -
          -

          Synopsis

          -
          // In header: <boost/accumulators/statistics/covariance.hpp>
-
-template<typename Left, typename Right, 
-         typename LeftTag = typename tag<Left>::type, 
-         typename RightTag = typename tag<Right>::type> 
-struct outer_product :
-  public boost::numeric::functional::outer_product_base< Left, Right, void >
-{
-};
          -
          - - - -
          Copyright © 2005, 2006 Eric Niebler

          - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

          -
          -
          -
          -PrevUpHomeNext -
          - - diff --git a/doc/html/boost/numeric/functional/outer_product__idp64902832.html b/doc/html/boost/numeric/functional/outer_product__idp64902832.html deleted file mode 100644 index 1ba6b6012d..0000000000 --- a/doc/html/boost/numeric/functional/outer_product__idp64902832.html +++ /dev/null @@ -1,66 +0,0 @@ - - - - -Struct template outer_product<Left, Right, std_vector_tag, std_vector_tag> - - - - - - - - - - - - - - - -
          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
          -
          -
          -PrevUpHomeNext -
          -
          -
          -
          -

          Struct template outer_product<Left, Right, std_vector_tag, std_vector_tag>

          -

          boost::numeric::functional::outer_product<Left, Right, std_vector_tag, std_vector_tag>

          -
          -

          Synopsis

          -
          // In header: <boost/accumulators/statistics/covariance.hpp>
-
-template<typename Left, typename Right> 
-struct outer_product<Left, Right, std_vector_tag, std_vector_tag> : public std::binary_function< Left, Right, ublas::matrix< functional::multiplies< Left::value_type, Right::value_type >::result_type > >
-{
-  // types
-  typedef ublas::matrix< typename functional::multiplies< typename Left::value_type, typename Right::value_type >::result_type > result_type;
-
-  // public member functions
-  result_type operator()(Left &, Right &) const;
-};
          -
          -

          Description

          -
          -

          -outer_product public member functions

          -
          1. result_type operator()(Left & left, Right & right) const;
          -
          -
          -
          - - - -
          Copyright © 2005, 2006 Eric Niebler

          - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

          -
          -
          -
          -PrevUpHomeNext -
          - - diff --git a/doc/html/boost/numeric/functional/outer_product_base.html b/doc/html/boost/numeric/functional/outer_product_base.html deleted file mode 100644 index cbe6272b63..0000000000 --- a/doc/html/boost/numeric/functional/outer_product_base.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct template outer_product_base - - - - - - - - - - - - - - - -
          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
          -
          -
          -PrevUpHomeNext -
          -
          -
          -
          -

          Struct template outer_product_base

          -

          boost::numeric::functional::outer_product_base

          -
          -

          Synopsis

          -
          // In header: <boost/accumulators/statistics/covariance.hpp>
-
-template<typename Left, typename Right, typename EnableIf = void> 
-struct outer_product_base : public functional::multiplies< Left, Right > {
-};
          -
          - - - -
          Copyright © 2005, 2006 Eric Niebler

          - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

          -
          -
          -
          -PrevUpHomeNext -
          - - diff --git a/doc/html/boost/numeric/functional/plus_assign_base.html b/doc/html/boost/numeric/functional/plus_assign_base.html index a53c947979..de784ffa96 100644 --- a/doc/html/boost/numeric/functional/plus_assign_base.html +++ b/doc/html/boost/numeric/functional/plus_assign_base.html @@ -36,16 +36,16 @@ struct plus_assign_base : public std::binary_function< Left, Right, typeof(lvalue< Left >()+=lvalue< Right >())> { - // public member functions - result_type operator()(Left &, Right &) const; + // public member functions + result_type operator()(Left &, Right &) const; };
          -

          Description

          +

          Description

          -

          -plus_assign_base public member functions

          +

          +plus_assign_base public member functions

          1. -
            result_type operator()(Left & left, Right & right) const;
            +
            result_type operator()(Left & left, Right & right) const;

            diff --git a/doc/html/boost/numeric/functional/plus_base.html b/doc/html/boost/numeric/functional/plus_base.html index 83951d7b9d..ef89901b92 100644 --- a/doc/html/boost/numeric/functional/plus_base.html +++ b/doc/html/boost/numeric/functional/plus_base.html @@ -36,16 +36,16 @@ structplus_base:public std::binary_function< Left, Right, typeof(lvalue< Left >()+lvalue< Right >())> { - // public member functions - result_typeoperator()(Left&,Right&)const; + // public member functions + result_typeoperator()(Left&,Right&)const;};
            -

            Description

            +

            Description

            -

            -plus_base public member functions

            +

            +plus_base public member functions

            1. -
              result_type operator()(Left & left, Right & right) const;
              +
              result_type operator()(Left & left, Right & right) const;

            diff --git a/doc/html/boost/numeric/functional/promote_ToFrom_idp67472480.html b/doc/html/boost/numeric/functional/promote_ToFrom_idp67472480.html deleted file mode 100644 index ea7d757742..0000000000 --- a/doc/html/boost/numeric/functional/promote_ToFrom_idp67472480.html +++ /dev/null @@ -1,63 +0,0 @@ - - - - -Struct template promote<ToFrom, ToFrom, std_valarray_tag, std_valarray_tag> - - - - - - - - -
            - - - - - - -
            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
            -
            -
            -PrevUpHomeNext -
            -
            -
            -
            -

            Struct template promote<ToFrom, ToFrom, std_valarray_tag, std_valarray_tag>

            -

            boost::numeric::functional::promote<ToFrom, ToFrom, std_valarray_tag, std_valarray_tag>

            -
            -

            Synopsis

            -
            // In header: <boost/accumulators/numeric/functional/valarray.hpp>
-
-template<typename ToFrom> 
-struct promote<ToFrom, ToFrom, std_valarray_tag, std_valarray_tag> : public std::unary_function< ToFrom, ToFrom > {
-
-  // public member functions
-  ToFrom & operator()(ToFrom &) const;
-};
            -
            -

            Description

            -
            -

            -promote public member functions

            -
            1. ToFrom & operator()(ToFrom & tofrom) const;
            -
            -
            -
            - - - -
            Copyright © 2005, 2006 Eric Niebler

            - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

            -
            -
            -
            -PrevUpHomeNext -
            - - diff --git a/doc/html/boost/numeric/functional/promote_ToFrom_idp67539616.html b/doc/html/boost/numeric/functional/promote_ToFrom_idp67539616.html deleted file mode 100644 index 6ec053ff55..0000000000 --- a/doc/html/boost/numeric/functional/promote_ToFrom_idp67539616.html +++ /dev/null @@ -1,63 +0,0 @@ - - - - -Struct template promote<ToFrom, ToFrom, std_vector_tag, std_vector_tag> - - - - - - - - - - - - - - - -
            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
            -
            -
            -PrevUpHomeNext -
            -
            -
            -
            -

            Struct template promote<ToFrom, ToFrom, std_vector_tag, std_vector_tag>

            -

            boost::numeric::functional::promote<ToFrom, ToFrom, std_vector_tag, std_vector_tag>

            -
            -

            Synopsis

            -
            // In header: <boost/accumulators/numeric/functional/vector.hpp>
-
-template<typename ToFrom> 
-struct promote<ToFrom, ToFrom, std_vector_tag, std_vector_tag> : public std::unary_function< ToFrom, ToFrom > {
-
-  // public member functions
-  ToFrom & operator()(ToFrom &) const;
-};
            -
            -

            Description

            -
            -

            -promote public member functions

            -
            1. ToFrom & operator()(ToFrom & tofrom) const;
            -
            -
            -
            - - - -
            Copyright © 2005, 2006 Eric Niebler

            - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

            -
            -
            -
            -PrevUpHomeNext -
            - - diff --git a/doc/html/boost/numeric/functional/promote_To__Fr_idp67466288.html b/doc/html/boost/numeric/functional/promote_To__Fr_idp67466288.html deleted file mode 100644 index 348ea34809..0000000000 --- a/doc/html/boost/numeric/functional/promote_To__Fr_idp67466288.html +++ /dev/null @@ -1,63 +0,0 @@ - - - - -Struct template promote<To, From, std_valarray_tag, std_valarray_tag> - - - - - - - - - - - - - - - -
            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
            -
            -
            -PrevUpHomeNext -
            -
            -
            -
            -

            Struct template promote<To, From, std_valarray_tag, std_valarray_tag>

            -

            boost::numeric::functional::promote<To, From, std_valarray_tag, std_valarray_tag>

            -
            -

            Synopsis

            -
            // In header: <boost/accumulators/numeric/functional/valarray.hpp>
-
-template<typename To, typename From> 
-struct promote<To, From, std_valarray_tag, std_valarray_tag> : public std::unary_function< From, To > {
-
-  // public member functions
-  To operator()(From &) const;
-};
            -
            -

            Description

            -
            -

            -promote public member functions

            -
            1. To operator()(From & arr) const;
            -
            -
            -
            - - - -
            Copyright © 2005, 2006 Eric Niebler

            - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

            -
            -
            -
            -PrevUpHomeNext -
            - - diff --git a/doc/html/boost/numeric/functional/promote_To__Fr_idp67533424.html b/doc/html/boost/numeric/functional/promote_To__Fr_idp67533424.html deleted file mode 100644 index 88e922dfc1..0000000000 --- a/doc/html/boost/numeric/functional/promote_To__Fr_idp67533424.html +++ /dev/null @@ -1,63 +0,0 @@ - - - - -Struct template promote<To, From, std_vector_tag, std_vector_tag> - - - - - - - - - - - - - - - -
            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
            -
            -
            -PrevUpHomeNext -
            -
            -
            -
            -

            Struct template promote<To, From, std_vector_tag, std_vector_tag>

            -

            boost::numeric::functional::promote<To, From, std_vector_tag, std_vector_tag>

            -
            -

            Synopsis

            -
            // In header: <boost/accumulators/numeric/functional/vector.hpp>
-
-template<typename To, typename From> 
-struct promote<To, From, std_vector_tag, std_vector_tag> : public std::unary_function< From, To > {
-
-  // public member functions
-  To operator()(From &) const;
-};
            -
            -

            Description

            -
            -

            -promote public member functions

            -
            1. To operator()(From & arr) const;
            -
            -
            -
            - - - -
            Copyright © 2005, 2006 Eric Niebler

            - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

            -
            -
            -
            -PrevUpHomeNext -
            - - diff --git a/doc/html/boost/numeric/functional/promote__idm45507138872000.html b/doc/html/boost/numeric/functional/promote__idm45507138872000.html new file mode 100644 index 0000000000..6ce8c9017c --- /dev/null +++ b/doc/html/boost/numeric/functional/promote__idm45507138872000.html @@ -0,0 +1,63 @@ + + + + +Struct template promote<ToFrom, ToFrom, std_vector_tag, std_vector_tag> + + + + + + + + + + + + + + + +
            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
            +
            +
            +PrevUpHomeNext +
            +
            +
            +
            +

            Struct template promote<ToFrom, ToFrom, std_vector_tag, std_vector_tag>

            +

            boost::numeric::functional::promote<ToFrom, ToFrom, std_vector_tag, std_vector_tag>

            +
            +

            Synopsis

            +
            // In header: <boost/accumulators/numeric/functional/vector.hpp>
+
+template<typename ToFrom> 
+struct promote<ToFrom, ToFrom, std_vector_tag, std_vector_tag> : public std::unary_function< ToFrom, ToFrom > {
+
+  // public member functions
+  ToFrom & operator()(ToFrom &) const;
+};
            +
            +

            Description

            +
            +

            +promote public member functions

            +
            1. ToFrom & operator()(ToFrom & tofrom) const;
            +
            +
            +
            + + + +
            Copyright © 2005, 2006 Eric Niebler

            + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

            +
            +
            +
            +PrevUpHomeNext +
            + + diff --git a/doc/html/boost/numeric/functional/promote__idm45507138878192.html b/doc/html/boost/numeric/functional/promote__idm45507138878192.html new file mode 100644 index 0000000000..62cfbfed10 --- /dev/null +++ b/doc/html/boost/numeric/functional/promote__idm45507138878192.html @@ -0,0 +1,63 @@ + + + + +Struct template promote<To, From, std_vector_tag, std_vector_tag> + + + + + + + + + + + + + + + +
            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
            +
            +
            +PrevUpHomeNext +
            +
            +
            +
            +

            Struct template promote<To, From, std_vector_tag, std_vector_tag>

            +

            boost::numeric::functional::promote<To, From, std_vector_tag, std_vector_tag>

            +
            +

            Synopsis

            +
            // In header: <boost/accumulators/numeric/functional/vector.hpp>
+
+template<typename To, typename From> 
+struct promote<To, From, std_vector_tag, std_vector_tag> : public std::unary_function< From, To > {
+
+  // public member functions
+  To operator()(From &) const;
+};
            +
            +

            Description

            +
            +

            +promote public member functions

            +
            1. To operator()(From & arr) const;
            +
            +
            +
            + + + +
            Copyright © 2005, 2006 Eric Niebler

            + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

            +
            +
            +
            +PrevUpHomeNext +
            + + diff --git a/doc/html/boost/numeric/functional/promote__idm45507138939136.html b/doc/html/boost/numeric/functional/promote__idm45507138939136.html new file mode 100644 index 0000000000..f95d370021 --- /dev/null +++ b/doc/html/boost/numeric/functional/promote__idm45507138939136.html @@ -0,0 +1,63 @@ + + + + +Struct template promote<ToFrom, ToFrom, std_valarray_tag, std_valarray_tag> + + + + + + + + + + + + + + + +
            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
            +
            +
            +PrevUpHomeNext +
            +
            +
            +
            +

            Struct template promote<ToFrom, ToFrom, std_valarray_tag, std_valarray_tag>

            +

            boost::numeric::functional::promote<ToFrom, ToFrom, std_valarray_tag, std_valarray_tag>

            +
            +

            Synopsis

            +
            // In header: <boost/accumulators/numeric/functional/valarray.hpp>
+
+template<typename ToFrom> 
+struct promote<ToFrom, ToFrom, std_valarray_tag, std_valarray_tag> : public std::unary_function< ToFrom, ToFrom > {
+
+  // public member functions
+  ToFrom & operator()(ToFrom &) const;
+};
            +
            +

            Description

            +
            +

            +promote public member functions

            +
            1. ToFrom & operator()(ToFrom & tofrom) const;
            +
            +
            +
            + + + +
            Copyright © 2005, 2006 Eric Niebler

            + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

            +
            +
            +
            +PrevUpHomeNext +
            + + diff --git a/doc/html/boost/numeric/functional/promote__idm45507138945328.html b/doc/html/boost/numeric/functional/promote__idm45507138945328.html new file mode 100644 index 0000000000..be131743c7 --- /dev/null +++ b/doc/html/boost/numeric/functional/promote__idm45507138945328.html @@ -0,0 +1,63 @@ + + + + +Struct template promote<To, From, std_valarray_tag, std_valarray_tag> + + + + + + + + + + + + + + + +
            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
            +
            +
            +PrevUpHomeNext +
            +
            +
            +
            +

            Struct template promote<To, From, std_valarray_tag, std_valarray_tag>

            +

            boost::numeric::functional::promote<To, From, std_valarray_tag, std_valarray_tag>

            +
            +

            Synopsis

            +
            // In header: <boost/accumulators/numeric/functional/valarray.hpp>
+
+template<typename To, typename From> 
+struct promote<To, From, std_valarray_tag, std_valarray_tag> : public std::unary_function< From, To > {
+
+  // public member functions
+  To operator()(From &) const;
+};
            +
            +

            Description

            +
            +

            +promote public member functions

            +
            1. To operator()(From & arr) const;
            +
            +
            +
            + + + +
            Copyright © 2005, 2006 Eric Niebler

            + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

            +
            +
            +
            +PrevUpHomeNext +
            + + diff --git a/doc/html/boost/numeric/functional/promote__idm45507138950960.html b/doc/html/boost/numeric/functional/promote__idm45507138950960.html new file mode 100644 index 0000000000..e8c2a183f9 --- /dev/null +++ b/doc/html/boost/numeric/functional/promote__idm45507138950960.html @@ -0,0 +1,63 @@ + + + + +Struct template promote<bool, From, void, std_valarray_tag> + + + + + + + + + + + + + + + +
            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
            +
            +
            +PrevUpHomeNext +
            +
            +
            +
            +

            Struct template promote<bool, From, void, std_valarray_tag>

            +

            boost::numeric::functional::promote<bool, From, void, std_valarray_tag>

            +
            +

            Synopsis

            +
            // In header: <boost/accumulators/numeric/functional/valarray.hpp>
+
+template<typename From> 
+struct promote<bool, From, void, std_valarray_tag> : public std::unary_function< From, bool > {
+
+  // public member functions
+  bool operator()(From &) const;
+};
            +
            +

            Description

            +
            +

            +promote public member functions

            +
            1. bool operator()(From & arr) const;
            +
            +
            +
            + + + +
            Copyright © 2005, 2006 Eric Niebler

            + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

            +
            +
            +
            +PrevUpHomeNext +
            + + diff --git a/doc/html/boost/numeric/functional/promote__idm45507138954112.html b/doc/html/boost/numeric/functional/promote__idm45507138954112.html new file mode 100644 index 0000000000..a86087a618 --- /dev/null +++ b/doc/html/boost/numeric/functional/promote__idm45507138954112.html @@ -0,0 +1,53 @@ + + + + +Struct template promote<bool const, From, void, std_valarray_tag> + + + + + + + + + + + + + + + +
            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
            +
            +
            +PrevUpHomeNext +
            +
            +
            +
            +

            Struct template promote<bool const, From, void, std_valarray_tag>

            +

            boost::numeric::functional::promote<bool const, From, void, std_valarray_tag>

            +
            +

            Synopsis

            +
            // In header: <boost/accumulators/numeric/functional/valarray.hpp>
+
+template<typename From> 
+struct promote<bool const, From, void, std_valarray_tag> : public boost::numeric::functional::promote< bool, From, void, std_valarray_tag >
+{
+};
            +
            + + + +
            Copyright © 2005, 2006 Eric Niebler

            + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

            +
            +
            +
            +PrevUpHomeNext +
            + + diff --git a/doc/html/boost/numeric/functional/promote__idm45507139047504.html b/doc/html/boost/numeric/functional/promote__idm45507139047504.html new file mode 100644 index 0000000000..84dd946e39 --- /dev/null +++ b/doc/html/boost/numeric/functional/promote__idm45507139047504.html @@ -0,0 +1,63 @@ + + + + +Struct template promote_base<ToFrom, ToFrom, void> + + + + + + + + + + + + + + + +
            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
            +
            +
            +PrevUpHomeNext +
            +
            +
            +
            +

            Struct template promote_base<ToFrom, ToFrom, void>

            +

            boost::numeric::functional::promote_base<ToFrom, ToFrom, void>

            +
            +

            Synopsis

            +
            // In header: <boost/accumulators/numeric/functional.hpp>
+
+template<typename ToFrom> 
+struct promote_base<ToFrom, ToFrom, void> : public std::unary_function< ToFrom, ToFrom > {
+
+  // public member functions
+  ToFrom & operator()(ToFrom &);
+};
            +
            +

            Description

            +
            +

            +promote_base public member functions

            +
            1. ToFrom & operator()(ToFrom & tofrom);
            +
            +
            +
            + + + +
            Copyright © 2005, 2006 Eric Niebler

            + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

            +
            +
            +
            +PrevUpHomeNext +
            + + diff --git a/doc/html/boost/numeric/functional/promote_base.html b/doc/html/boost/numeric/functional/promote_base.html index 2fa946255e..ac00722b2e 100644 --- a/doc/html/boost/numeric/functional/promote_base.html +++ b/doc/html/boost/numeric/functional/promote_base.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
            -PrevUpHomeNext +PrevUpHomeNext
            @@ -35,15 +35,15 @@ template<typename To, typename From, typename EnableIf> struct promote_base : public std::unary_function< From, To > { - // public member functions - To operator()(From &) const; + // public member functions + To operator()(From &) const; };
            -

            Description

            +

            Description

            -

            -promote_base public member functions

            -
            1. To operator()(From & from) const;
            +

            +promote_base public member functions

            +
            1. To operator()(From & from) const;
            @@ -57,7 +57,7 @@
            -PrevUpHomeNext +PrevUpHomeNext
            diff --git a/doc/html/boost/numeric/functional/promote_base_T_idp67364112.html b/doc/html/boost/numeric/functional/promote_base_T_idp67364112.html deleted file mode 100644 index b35c25c9ab..0000000000 --- a/doc/html/boost/numeric/functional/promote_base_T_idp67364112.html +++ /dev/null @@ -1,63 +0,0 @@ - - - - -Struct template promote_base<ToFrom, ToFrom, void> - - - - - - - - - - - - - - - -
            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
            -
            -
            -PrevUpHomeNext -
            -
            -
            -
            -

            Struct template promote_base<ToFrom, ToFrom, void>

            -

            boost::numeric::functional::promote_base<ToFrom, ToFrom, void>

            -
            -

            Synopsis

            -
            // In header: <boost/accumulators/numeric/functional.hpp>
-
-template<typename ToFrom> 
-struct promote_base<ToFrom, ToFrom, void> : public std::unary_function< ToFrom, ToFrom > {
-
-  // public member functions
-  ToFrom & operator()(ToFrom &);
-};
            -
            -

            Description

            -
            -

            -promote_base public member functions

            -
            1. ToFrom & operator()(ToFrom & tofrom);
            -
            -
            -
            - - - -
            Copyright © 2005, 2006 Eric Niebler

            - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

            -
            -
            -
            -PrevUpHomeNext -
            - - diff --git a/doc/html/boost/numeric/functional/promote_bool___idp67460656.html b/doc/html/boost/numeric/functional/promote_bool___idp67460656.html deleted file mode 100644 index f69dc5aa09..0000000000 --- a/doc/html/boost/numeric/functional/promote_bool___idp67460656.html +++ /dev/null @@ -1,63 +0,0 @@ - - - - -Struct template promote<bool, From, void, std_valarray_tag> - - - - - - - - - - - - - - - -
            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
            -
            -
            -PrevUpHomeNext -
            -
            -
            -
            -

            Struct template promote<bool, From, void, std_valarray_tag>

            -

            boost::numeric::functional::promote<bool, From, void, std_valarray_tag>

            -
            -

            Synopsis

            -
            // In header: <boost/accumulators/numeric/functional/valarray.hpp>
-
-template<typename From> 
-struct promote<bool, From, void, std_valarray_tag> : public std::unary_function< From, bool > {
-
-  // public member functions
-  bool operator()(From &) const;
-};
            -
            -

            Description

            -
            -

            -promote public member functions

            -
            1. bool operator()(From & arr) const;
            -
            -
            -
            - - - -
            Copyright © 2005, 2006 Eric Niebler

            - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

            -
            -
            -
            -PrevUpHomeNext -
            - - diff --git a/doc/html/boost/numeric/functional/promote_bool_c_idp67457504.html b/doc/html/boost/numeric/functional/promote_bool_c_idp67457504.html deleted file mode 100644 index b8a067b161..0000000000 --- a/doc/html/boost/numeric/functional/promote_bool_c_idp67457504.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template promote<bool const, From, void, std_valarray_tag> - - - - - - - - - - - - - - - -
            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
            -
            -
            -PrevUpHomeNext -
            -
            -
            -
            -

            Struct template promote<bool const, From, void, std_valarray_tag>

            -

            boost::numeric::functional::promote<bool const, From, void, std_valarray_tag>

            -
            -

            Synopsis

            -
            // In header: <boost/accumulators/numeric/functional/valarray.hpp>
-
-template<typename From> 
-struct promote<bool const, From, void, std_valarray_tag> : public boost::numeric::functional::promote< bool, From, void, std_valarray_tag >
-{
-};
            -
            - - - -
            Copyright © 2005, 2006 Eric Niebler

            - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

            -
            -
            -
            -PrevUpHomeNext -
            - - diff --git a/doc/html/boost/numeric/functional/tag_std__idm45507138866368.html b/doc/html/boost/numeric/functional/tag_std__idm45507138866368.html new file mode 100644 index 0000000000..5780ba7a6e --- /dev/null +++ b/doc/html/boost/numeric/functional/tag_std__idm45507138866368.html @@ -0,0 +1,54 @@ + + + + +Struct template tag<std::vector< T, Al >> + + + + + + + + + + + + + + + +
            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
            +
            +
            +PrevUpHomeNext +
            +
            +
            +
            +

            Struct template tag<std::vector< T, Al >>

            +

            boost::numeric::functional::tag<std::vector< T, Al >>

            +
            +

            Synopsis

            +
            // In header: <boost/accumulators/numeric/functional/vector.hpp>
+
+template<typename T, typename Al> 
+struct tag<std::vector< T, Al >> {
+  // types
+  typedef std_vector_tag type;
+};
            +
            + + + +
            Copyright © 2005, 2006 Eric Niebler

            + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

            +
            +
            +
            +PrevUpHomeNext +
            + + diff --git a/doc/html/boost/numeric/functional/tag_std__idm45507138933504.html b/doc/html/boost/numeric/functional/tag_std__idm45507138933504.html new file mode 100644 index 0000000000..7724e2c6e4 --- /dev/null +++ b/doc/html/boost/numeric/functional/tag_std__idm45507138933504.html @@ -0,0 +1,54 @@ + + + + +Struct template tag<std::valarray< T >> + + + + + + + + + + + + + + + +
            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
            +
            +
            +PrevUpHomeNext +
            +
            +
            +
            +

            Struct template tag<std::valarray< T >>

            +

            boost::numeric::functional::tag<std::valarray< T >>

            +
            +

            Synopsis

            +
            // In header: <boost/accumulators/numeric/functional/valarray.hpp>
+
+template<typename T> 
+struct tag<std::valarray< T >> {
+  // types
+  typedef std_valarray_tag type;
+};
            +
            + + + +
            Copyright © 2005, 2006 Eric Niebler

            + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

            +
            +
            +
            +PrevUpHomeNext +
            + + diff --git a/doc/html/boost/numeric/functional/tag_std_valarr_idp67478112.html b/doc/html/boost/numeric/functional/tag_std_valarr_idp67478112.html deleted file mode 100644 index ece2ebb993..0000000000 --- a/doc/html/boost/numeric/functional/tag_std_valarr_idp67478112.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template tag<std::valarray< T >> - - - - - - - - - - - - - - - -
            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
            -
            -
            -PrevUpHomeNext -
            -
            -
            -
            -

            Struct template tag<std::valarray< T >>

            -

            boost::numeric::functional::tag<std::valarray< T >>

            -
            -

            Synopsis

            -
            // In header: <boost/accumulators/numeric/functional/valarray.hpp>
-
-template<typename T> 
-struct tag<std::valarray< T >> {
-  // types
-  typedef std_valarray_tag type;
-};
            -
            - - - -
            Copyright © 2005, 2006 Eric Niebler

            - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

            -
            -
            -
            -PrevUpHomeNext -
            - - diff --git a/doc/html/boost/numeric/functional/tag_std_vector_idp67545248.html b/doc/html/boost/numeric/functional/tag_std_vector_idp67545248.html deleted file mode 100644 index 71c83b9729..0000000000 --- a/doc/html/boost/numeric/functional/tag_std_vector_idp67545248.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template tag<std::vector< T, Al >> - - - - - - - - - - - - - - - -
            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
            -
            -
            -PrevUpHomeNext -
            -
            -
            -
            -

            Struct template tag<std::vector< T, Al >>

            -

            boost::numeric::functional::tag<std::vector< T, Al >>

            -
            -

            Synopsis

            -
            // In header: <boost/accumulators/numeric/functional/vector.hpp>
-
-template<typename T, typename Al> 
-struct tag<std::vector< T, Al >> {
-  // types
-  typedef std_vector_tag type;
-};
            -
            - - - -
            Copyright © 2005, 2006 Eric Niebler

            - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

            -
            -
            -
            -PrevUpHomeNext -
            - - diff --git a/doc/html/boost/numeric/functional/unary_minus.html b/doc/html/boost/numeric/functional/unary_minus.html index 4f01f1554b..ac84900418 100644 --- a/doc/html/boost/numeric/functional/unary_minus.html +++ b/doc/html/boost/numeric/functional/unary_minus.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
            -PrevUpHomeNext +PrevUpHomeNext
            @@ -48,7 +48,7 @@
            -PrevUpHomeNext +PrevUpHomeNext
            diff --git a/doc/html/boost/numeric/functional/unary_minus_base.html b/doc/html/boost/numeric/functional/unary_minus_base.html index b02844136c..fad5cf8805 100644 --- a/doc/html/boost/numeric/functional/unary_minus_base.html +++ b/doc/html/boost/numeric/functional/unary_minus_base.html @@ -37,16 +37,16 @@ public std::unary_function< Arg, typeof(-lvalue< Arg >())> { - // public member functions - result_type operator()(Arg &) const; + // public member functions + result_type operator()(Arg &) const; };
            -

            Description

            +

            Description

            -

            -unary_minus_base public member functions

            +

            +unary_minus_base public member functions

            1. -
              result_type operator()(Arg & arg) const;
              +
              result_type operator()(Arg & arg) const;

              diff --git a/doc/html/boost/numeric/functional/unary_plus_base.html b/doc/html/boost/numeric/functional/unary_plus_base.html index 3416a7c18d..abefaa6049 100644 --- a/doc/html/boost/numeric/functional/unary_plus_base.html +++ b/doc/html/boost/numeric/functional/unary_plus_base.html @@ -37,16 +37,16 @@ publicstd::unary_function<Arg,typeof(+lvalue<Arg>())>{ - // public member functions - result_typeoperator()(Arg&)const; + // public member functions + result_typeoperator()(Arg&)const;};
              -

              Description

              +

              Description

              -

              -unary_plus_base public member functions

              +

              +unary_plus_base public member functions

              1. -
                result_type operator()(Arg & arg) const;
                +
                result_type operator()(Arg & arg) const;

              diff --git a/doc/html/boost/numeric/one.html b/doc/html/boost/numeric/one.html index 276713962e..4ee347ad7b 100644 --- a/doc/html/boost/numeric/one.html +++ b/doc/html/boost/numeric/one.html @@ -38,18 +38,18 @@ typedefonetype;typedefTvalue_type; - // public member functions - operator T const &()const; + // public member functions + operator T const &()const;// public data membersstaticTconstvalue;};
              -

              Description

              +

              Description

              -

              -one public member functions

              -
              1. operator T const &() const;
              +

              +one public member functions

              +
              1. operator T const &() const;
              diff --git a/doc/html/boost/numeric/op/outer_product.html b/doc/html/boost/numeric/op/outer_product.html deleted file mode 100644 index 555aba5a7a..0000000000 --- a/doc/html/boost/numeric/op/outer_product.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct outer_product - - - - - - - - -
              - - - - - - -
              Boost C++ LibrariesHomeLibrariesPeopleFAQMore
              -
              -
              -PrevUpHomeNext -
              -
              -
              -
              -

              Struct outer_product

              -

              boost::numeric::op::outer_product

              -
              -

              Synopsis

              -
              // In header: <boost/accumulators/statistics/covariance.hpp>
-
-
-struct outer_product {
-};
              -
              - - - -
              Copyright © 2005, 2006 Eric Niebler

              - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

              -
              -
              -
              -PrevUpHomeNext -
              - - diff --git a/doc/html/boost/numeric/zero.html b/doc/html/boost/numeric/zero.html index 285effa4d9..df2bbfafe3 100644 --- a/doc/html/boost/numeric/zero.html +++ b/doc/html/boost/numeric/zero.html @@ -38,18 +38,18 @@ typedef zero type; typedef T value_type; - // public member functions - operator T const &() const; + // public member functions + operator T const &() const; // public data members static T const value; };
              -

              Description

              +

              Description

              -

              -zero public member functions

              -
              1. operator T const &() const;
              +

              +zero public member functions

              +
              1. operator T const &() const;
            diff --git a/doc/html/boost/numeric/zero_or_default.html b/doc/html/boost/numeric/zero_or_default.html index bf9e323149..04e6f06cae 100644 --- a/doc/html/boost/numeric/zero_or_default.html +++ b/doc/html/boost/numeric/zero_or_default.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
            -PrevUpHomeNext +PrevUpHomeNext
            @@ -48,7 +48,7 @@
            -PrevUpHomeNext +PrevUpHomeNext
            diff --git a/doc/html/boost/operator___idp24809744.html b/doc/html/boost/operator___idp24809744.html deleted file mode 100644 index 5dcc2ef7d4..0000000000 --- a/doc/html/boost/operator___idp24809744.html +++ /dev/null @@ -1,101 +0,0 @@ - - - - -Function template operator== - - - - - - - - - - - - - - - -
            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
            -
            -
            -PrevUpHomeNext -
            -
            -
            -
            -

            Function template operator==

            -

            boost::operator== — Compare two circular_buffers element-by-element to determine if they are equal.

            -
            -

            Synopsis

            -
            // In header: <boost/circular_buffer/base.hpp>
-
-
-template<typename T, typename Alloc> 
-  bool operator==(const circular_buffer< T, Alloc > & lhs, 
-                  const circular_buffer< T, Alloc > & rhs);
            -
            -

            Description

            -

            - - -

            -

            Complexity. Linear (in the size of the circular_buffers).

            -

            -

            -

            Iterator Invalidation. Does not invalidate any iterators.

            -

            -

            -
            ---- - - - - - - - - - - - - - - -

            Parameters:

            ---- - - - - - - - - - - -

            lhs

            The circular_buffer to compare.

            rhs

            The circular_buffer to compare.

            Returns:

            lhs.size() == rhs.size() && std::equal(lhs.begin(), lhs.end(), rhs.begin())

            Throws:

            		Nothing.
            -
            -
            - - - -
            Copyright © 2003-2013 Jan Gaspar

            - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

            -
            -
            -
            -PrevUpHomeNext -
            - - diff --git a/doc/html/boost/operator___idp24836512.html b/doc/html/boost/operator___idp24836512.html deleted file mode 100644 index 745b96a73f..0000000000 --- a/doc/html/boost/operator___idp24836512.html +++ /dev/null @@ -1,105 +0,0 @@ - - - - -Function template operator!= - - - - - - - - - - - - - - - -
            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
            -
            -
            -PrevUpHomeNext -
            -
            -
            -
            -

            Function template operator!=

            -

            boost::operator!= — Compare two circular_buffers element-by-element to determine if they are non-equal.

            -
            -

            Synopsis

            -
            // In header: <boost/circular_buffer/base.hpp>
-
-
-template<typename T, typename Alloc> 
-  bool operator!=(const circular_buffer< T, Alloc > & lhs, 
-                  const circular_buffer< T, Alloc > & rhs);
            -
            -

            Description

            -

            - - -

            -

            Complexity. Linear (in the size of the circular_buffers).

            -

            -

            -

            Iterator Invalidation. Does not invalidate any iterators.

            -

            -

            -

            See Also:

            -

            operator==(const circular_buffer<T,Alloc>&, const circular_buffer<T,Alloc>&)

            -

            -

            -
            ---- - - - - - - - - - - - - - - -

            Parameters:

            ---- - - - - - - - - - - -

            lhs

            The circular_buffer to compare.

            rhs

            The circular_buffer to compare.

            Returns:

            !(lhs == rhs)

            Throws:

            		Nothing.
            -
            -
            - - - -
            Copyright © 2003-2013 Jan Gaspar

            - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

            -
            -
            -
            -PrevUpHomeNext -
            - - diff --git a/doc/html/boost/operator___idp24864848.html b/doc/html/boost/operator___idp24864848.html deleted file mode 100644 index f98ba6b089..0000000000 --- a/doc/html/boost/operator___idp24864848.html +++ /dev/null @@ -1,105 +0,0 @@ - - - - -Function template operator<= - - - - - - - - - - - - - - - -
            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
            -
            -
            -PrevUpHomeNext -
            -
            -
            -
            -

            Function template operator<=

            -

            boost::operator<= — Compare two circular_buffers element-by-element to determine if the left one is lesser or equal to the right one.

            -
            -

            Synopsis

            -
            // In header: <boost/circular_buffer/base.hpp>
-
-
-template<typename T, typename Alloc> 
-  bool operator<=(const circular_buffer< T, Alloc > & lhs, 
-                  const circular_buffer< T, Alloc > & rhs);
            -
            -

            Description

            -

            - - -

            -

            Complexity. Linear (in the size of the circular_buffers).

            -

            -

            -

            Iterator Invalidation. Does not invalidate any iterators.

            -

            -

            -

            See Also:

            -

            operator<(const circular_buffer<T,Alloc>&, const circular_buffer<T,Alloc>&)

            -

            -

            -
            ---- - - - - - - - - - - - - - - -

            Parameters:

            ---- - - - - - - - - - - -

            lhs

            The circular_buffer to compare.

            rhs

            The circular_buffer to compare.

            Returns:

            !(rhs < lhs)

            Throws:

            		Nothing.
            -
            -
            - - - -
            Copyright © 2003-2013 Jan Gaspar

            - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

            -
            -
            -
            -PrevUpHomeNext -
            - - diff --git a/doc/html/boost/operator___idp24879024.html b/doc/html/boost/operator___idp24879024.html deleted file mode 100644 index 69ad118dd9..0000000000 --- a/doc/html/boost/operator___idp24879024.html +++ /dev/null @@ -1,105 +0,0 @@ - - - - -Function template operator>= - - - - - - - - - - - - - - - -
            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
            -
            -
            -PrevUpHomeNext -
            -
            -
            -
            -

            Function template operator>=

            -

            boost::operator>= — Compare two circular_buffers element-by-element to determine if the left one is greater or equal to the right one.

            -
            -

            Synopsis

            -
            // In header: <boost/circular_buffer/base.hpp>
-
-
-template<typename T, typename Alloc> 
-  bool operator>=(const circular_buffer< T, Alloc > & lhs, 
-                  const circular_buffer< T, Alloc > & rhs);
            -
            -

            Description

            -

            - - -

            -

            Complexity. Linear (in the size of the circular_buffers).

            -

            -

            -

            Iterator Invalidation. Does not invalidate any iterators.

            -

            -

            -

            See Also:

            -

            operator<(const circular_buffer<T,Alloc>&, const circular_buffer<T,Alloc>&)

            -

            -

            -
            ---- - - - - - - - - - - - - - - -

            Parameters:

            ---- - - - - - - - - - - -

            lhs

            The circular_buffer to compare.

            rhs

            The circular_buffer to compare.

            Returns:

            !(lhs < rhs)

            Throws:

            		Nothing.
            -
            -
            - - - -
            Copyright © 2003-2013 Jan Gaspar

            - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

            -
            -
            -
            -PrevUpHomeNext -
            - - diff --git a/doc/html/boost/operator_idm45506846622160.html b/doc/html/boost/operator_idm45506846622160.html new file mode 100644 index 0000000000..f68024e224 --- /dev/null +++ b/doc/html/boost/operator_idm45506846622160.html @@ -0,0 +1,83 @@ + + + + +Function template operator<< + + + + + + + + + + + + + + + +
            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
            +
            +
            +PrevUpHomeNext +
            +
            +
            +
            +

            Function template operator<<

            +

            boost::operator<< — Provides streaming output for variant types.

            +
            +

            Synopsis

            +
            // In header: <boost/variant/variant.hpp>
+
+
+template<typename ElemType, typename Traits, typename T1, typename T2, ..., 
+         typename TN> 
+  std::basic_ostream<ElemType,Traits> & 
+  operator<<(std::basic_ostream<ElemType,Traits> & out, 
+             const variant<T1, T2, ..., TN> & rhs);
            +
            +

            Description

            +
            ++++ + + + + + + + + + + + + + + +

            Requires:

            		Every bounded type of the variant must + fulfill the requirements of the + OutputStreamable + concept.

            Effects:

            		Calls out << x, where x is + the content of rhs.

            Notes:

            		Not available when BOOST_NO_IOSTREAM is + defined.
            +
            +
            + + + +
            Copyright © 2002, 2003 Eric Friedman, Itay Maman

            Distributed under the Boost Software License, Version 1.0. + (See accompanying file LICENSE_1_0.txt or copy at + http://www.boost.org/LICENSE_1_0.txt) +

            +
            +
            +
            +PrevUpHomeNext +
            + + diff --git a/doc/html/boost/operator_idm45713141989760.html b/doc/html/boost/operator_idm45713141989760.html new file mode 100644 index 0000000000..cac5fc7526 --- /dev/null +++ b/doc/html/boost/operator_idm45713141989760.html @@ -0,0 +1,105 @@ + + + + +Function template operator>= + + + + + + + + + + + + + + + +
            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
            +
            +
            +PrevUpHomeNext +
            +
            +
            +
            +

            Function template operator>=

            +

            boost::operator>= — Compare two circular_buffers element-by-element to determine if the left one is greater or equal to the right one.

            +
            +

            Synopsis

            +
            // In header: <boost/circular_buffer/base.hpp>
+
+
+template<typename T, typename Alloc> 
+  bool operator>=(const circular_buffer< T, Alloc > & lhs, 
+                  const circular_buffer< T, Alloc > & rhs);
            +
            +

            Description

            +

            + + +

            +

            Complexity. Linear (in the size of the circular_buffers).

            +

            +

            +

            Iterator Invalidation. Does not invalidate any iterators.

            +

            +

            +

            See Also:

            +

            operator<(const circular_buffer<T,Alloc>&, const circular_buffer<T,Alloc>&)

            +

            +

            +
            ++++ + + + + + + + + + + + + + + +

            Parameters:

            ++++ + + + + + + + + + + +

            lhs

            The circular_buffer to compare.

            rhs

            The circular_buffer to compare.

            Returns:

            !(lhs < rhs)

            Throws:

            		Nothing.
            +
            +
            + + + +
            Copyright © 2003-2013 Jan Gaspar

            + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

            +
            +
            +
            +PrevUpHomeNext +
            + + diff --git a/doc/html/boost/operator_idm45713142003936.html b/doc/html/boost/operator_idm45713142003936.html new file mode 100644 index 0000000000..308d409005 --- /dev/null +++ b/doc/html/boost/operator_idm45713142003936.html @@ -0,0 +1,105 @@ + + + + +Function template operator<= + + + + + + + + + + + + + + + +
            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
            +
            +
            +PrevUpHomeNext +
            +
            +
            +
            +

            Function template operator<=

            +

            boost::operator<= — Compare two circular_buffers element-by-element to determine if the left one is lesser or equal to the right one.

            +
            +

            Synopsis

            +
            // In header: <boost/circular_buffer/base.hpp>
+
+
+template<typename T, typename Alloc> 
+  bool operator<=(const circular_buffer< T, Alloc > & lhs, 
+                  const circular_buffer< T, Alloc > & rhs);
            +
            +

            Description

            +

            + + +

            +

            Complexity. Linear (in the size of the circular_buffers).

            +

            +

            +

            Iterator Invalidation. Does not invalidate any iterators.

            +

            +

            +

            See Also:

            +

            operator<(const circular_buffer<T,Alloc>&, const circular_buffer<T,Alloc>&)

            +

            +

            +
            ++++ + + + + + + + + + + + + + + +

            Parameters:

            ++++ + + + + + + + + + + +

            lhs

            The circular_buffer to compare.

            rhs

            The circular_buffer to compare.

            Returns:

            !(rhs < lhs)

            Throws:

            		Nothing.
            +
            +
            + + + +
            Copyright © 2003-2013 Jan Gaspar

            + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

            +
            +
            +
            +PrevUpHomeNext +
            + + diff --git a/doc/html/boost/operator_idm45713142018112.html b/doc/html/boost/operator_idm45713142018112.html new file mode 100644 index 0000000000..789fd1fe14 --- /dev/null +++ b/doc/html/boost/operator_idm45713142018112.html @@ -0,0 +1,105 @@ + + + + +Function template operator> + + + + + + + + + + + + + + + +
            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
            +
            +
            +PrevUpHomeNext +
            +
            +
            +
            +

            Function template operator>

            +

            boost::operator> — Compare two circular_buffers element-by-element to determine if the left one is greater than the right one.

            +
            +

            Synopsis

            +
            // In header: <boost/circular_buffer/base.hpp>
+
+
+template<typename T, typename Alloc> 
+  bool operator>(const circular_buffer< T, Alloc > & lhs, 
+                 const circular_buffer< T, Alloc > & rhs);
            +
            +

            Description

            +

            + + +

            +

            Complexity. Linear (in the size of the circular_buffers).

            +

            +

            +

            Iterator Invalidation. Does not invalidate any iterators.

            +

            +

            +

            See Also:

            +

            operator<(const circular_buffer<T,Alloc>&, const circular_buffer<T,Alloc>&)

            +

            +

            +
            ++++ + + + + + + + + + + + + + + +

            Parameters:

            ++++ + + + + + + + + + + +

            lhs

            The circular_buffer to compare.

            rhs

            The circular_buffer to compare.

            Returns:

            rhs < lhs

            Throws:

            		Nothing.
            +
            +
            + + + +
            Copyright © 2003-2013 Jan Gaspar

            + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

            +
            +
            +
            +PrevUpHomeNext +
            + + diff --git a/doc/html/boost/operator_idm45713142032272.html b/doc/html/boost/operator_idm45713142032272.html new file mode 100644 index 0000000000..c0d70a207d --- /dev/null +++ b/doc/html/boost/operator_idm45713142032272.html @@ -0,0 +1,105 @@ + + + + +Function template operator!= + + + + + + + + + + + + + + + +
            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
            +
            +
            +PrevUpHomeNext +
            +
            +
            +
            +

            Function template operator!=

            +

            boost::operator!= — Compare two circular_buffers element-by-element to determine if they are non-equal.

            +
            +

            Synopsis

            +
            // In header: <boost/circular_buffer/base.hpp>
+
+
+template<typename T, typename Alloc> 
+  bool operator!=(const circular_buffer< T, Alloc > & lhs, 
+                  const circular_buffer< T, Alloc > & rhs);
            +
            +

            Description

            +

            + + +

            +

            Complexity. Linear (in the size of the circular_buffers).

            +

            +

            +

            Iterator Invalidation. Does not invalidate any iterators.

            +

            +

            +

            See Also:

            +

            operator==(const circular_buffer<T,Alloc>&, const circular_buffer<T,Alloc>&)

            +

            +

            +
            ++++ + + + + + + + + + + + + + + +

            Parameters:

            ++++ + + + + + + + + + + +

            lhs

            The circular_buffer to compare.

            rhs

            The circular_buffer to compare.

            Returns:

            !(lhs == rhs)

            Throws:

            		Nothing.
            +
            +
            + + + +
            Copyright © 2003-2013 Jan Gaspar

            + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

            +
            +
            +
            +PrevUpHomeNext +
            + + diff --git a/doc/html/boost/operator_idm45713142045616.html b/doc/html/boost/operator_idm45713142045616.html new file mode 100644 index 0000000000..3f9e0a31ee --- /dev/null +++ b/doc/html/boost/operator_idm45713142045616.html @@ -0,0 +1,101 @@ + + + + +Function template operator< + + + + + + + + + + + + + + + +
            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
            +
            +
            +PrevUpHomeNext +
            +
            +
            +
            +

            Function template operator<

            +

            boost::operator< — Compare two circular_buffers element-by-element to determine if the left one is lesser than the right one.

            +
            +

            Synopsis

            +
            // In header: <boost/circular_buffer/base.hpp>
+
+
+template<typename T, typename Alloc> 
+  bool operator<(const circular_buffer< T, Alloc > & lhs, 
+                 const circular_buffer< T, Alloc > & rhs);
            +
            +

            Description

            +

            + + +

            +

            Complexity. Linear (in the size of the circular_buffers).

            +

            +

            +

            Iterator Invalidation. Does not invalidate any iterators.

            +

            +

            +
            ++++ + + + + + + + + + + + + + + +

            Parameters:

            ++++ + + + + + + + + + + +

            lhs

            The circular_buffer to compare.

            rhs

            The circular_buffer to compare.

            Returns:

            std::lexicographical_compare(lhs.begin(), lhs.end(), rhs.begin(), rhs.end())

            Throws:

            		Nothing.
            +
            +
            + + + +
            Copyright © 2003-2013 Jan Gaspar

            + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

            +
            +
            +
            +PrevUpHomeNext +
            + + diff --git a/doc/html/boost/operator_idm45713142059040.html b/doc/html/boost/operator_idm45713142059040.html new file mode 100644 index 0000000000..fc4a45d0c7 --- /dev/null +++ b/doc/html/boost/operator_idm45713142059040.html @@ -0,0 +1,101 @@ + + + + +Function template operator== + + + + + + + + + + + + + + + +
            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
            +
            +
            +PrevUpHomeNext +
            +
            +
            +
            +

            Function template operator==

            +

            boost::operator== — Compare two circular_buffers element-by-element to determine if they are equal.

            +
            +

            Synopsis

            +
            // In header: <boost/circular_buffer/base.hpp>
+
+
+template<typename T, typename Alloc> 
+  bool operator==(const circular_buffer< T, Alloc > & lhs, 
+                  const circular_buffer< T, Alloc > & rhs);
            +
            +

            Description

            +

            + + +

            +

            Complexity. Linear (in the size of the circular_buffers).

            +

            +

            +

            Iterator Invalidation. Does not invalidate any iterators.

            +

            +

            +
            ++++ + + + + + + + + + + + + + + +

            Parameters:

            ++++ + + + + + + + + + + +

            lhs

            The circular_buffer to compare.

            rhs

            The circular_buffer to compare.

            Returns:

            lhs.size() == rhs.size() && std::equal(lhs.begin(), lhs.end(), rhs.begin())

            Throws:

            		Nothing.
            +
            +
            + + + +
            Copyright © 2003-2013 Jan Gaspar

            + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

            +
            +
            +
            +PrevUpHomeNext +
            + + diff --git a/doc/html/boost/operator_idp24823168.html b/doc/html/boost/operator_idp24823168.html deleted file mode 100644 index 180ac63e57..0000000000 --- a/doc/html/boost/operator_idp24823168.html +++ /dev/null @@ -1,101 +0,0 @@ - - - - -Function template operator< - - - - - - - - - - - - - - - -
            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
            -
            -
            -PrevUpHomeNext -
            -
            -
            -
            -

            Function template operator<

            -

            boost::operator< — Compare two circular_buffers element-by-element to determine if the left one is lesser than the right one.

            -
            -

            Synopsis

            -
            // In header: <boost/circular_buffer/base.hpp>
-
-
-template<typename T, typename Alloc> 
-  bool operator<(const circular_buffer< T, Alloc > & lhs, 
-                 const circular_buffer< T, Alloc > & rhs);
            -
            -

            Description

            -

            - - -

            -

            Complexity. Linear (in the size of the circular_buffers).

            -

            -

            -

            Iterator Invalidation. Does not invalidate any iterators.

            -

            -

            -
            ---- - - - - - - - - - - - - - - -

            Parameters:

            ---- - - - - - - - - - - -

            lhs

            The circular_buffer to compare.

            rhs

            The circular_buffer to compare.

            Returns:

            std::lexicographical_compare(lhs.begin(), lhs.end(), rhs.begin(), rhs.end())

            Throws:

            		Nothing.
            -
            -
            - - - -
            Copyright © 2003-2013 Jan Gaspar

            - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

            -
            -
            -
            -PrevUpHomeNext -
            - - diff --git a/doc/html/boost/operator_idp24850672.html b/doc/html/boost/operator_idp24850672.html deleted file mode 100644 index 00644a7764..0000000000 --- a/doc/html/boost/operator_idp24850672.html +++ /dev/null @@ -1,105 +0,0 @@ - - - - -Function template operator> - - - - - - - - - - - - - - - -
            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
            -
            -
            -PrevUpHomeNext -
            -
            -
            -
            -

            Function template operator>

            -

            boost::operator> — Compare two circular_buffers element-by-element to determine if the left one is greater than the right one.

            -
            -

            Synopsis

            -
            // In header: <boost/circular_buffer/base.hpp>
-
-
-template<typename T, typename Alloc> 
-  bool operator>(const circular_buffer< T, Alloc > & lhs, 
-                 const circular_buffer< T, Alloc > & rhs);
            -
            -

            Description

            -

            - - -

            -

            Complexity. Linear (in the size of the circular_buffers).

            -

            -

            -

            Iterator Invalidation. Does not invalidate any iterators.

            -

            -

            -

            See Also:

            -

            operator<(const circular_buffer<T,Alloc>&, const circular_buffer<T,Alloc>&)

            -

            -

            -
            ---- - - - - - - - - - - - - - - -

            Parameters:

            ---- - - - - - - - - - - -

            lhs

            The circular_buffer to compare.

            rhs

            The circular_buffer to compare.

            Returns:

            rhs < lhs

            Throws:

            		Nothing.
            -
            -
            - - - -
            Copyright © 2003-2013 Jan Gaspar

            - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

            -
            -
            -
            -PrevUpHomeNext -
            - - diff --git a/doc/html/boost/operator_idp312686896.html b/doc/html/boost/operator_idp312686896.html deleted file mode 100644 index 32e2ed5871..0000000000 --- a/doc/html/boost/operator_idp312686896.html +++ /dev/null @@ -1,83 +0,0 @@ - - - - -Function template operator<< - - - - - - - - - - - - - - - -
            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
            -
            -
            -PrevUpHomeNext -
            -
            -
            -
            -

            Function template operator<<

            -

            boost::operator<< — Provides streaming output for variant types.

            -
            -

            Synopsis

            -
            // In header: <boost/variant/variant.hpp>
-
-
-template<typename ElemType, typename Traits, typename T1, typename T2, ..., 
-         typename TN> 
-  std::basic_ostream<ElemType,Traits> & 
-  operator<<(std::basic_ostream<ElemType,Traits> & out, 
-             const variant<T1, T2, ..., TN> & rhs);
            -
            -

            Description

            -
            ---- - - - - - - - - - - - - - - -

            Requires:

            		Every bounded type of the variant must - fulfill the requirements of the - OutputStreamable - concept.

            Effects:

            		Calls out << x, where x is - the content of rhs.

            Notes:

            		Not available when BOOST_NO_IOSTREAM is - defined.
            -
            -
            - - - -
            Copyright © 2002, 2003 Eric Friedman, Itay Maman

            Distributed under the Boost Software License, Version 1.0. - (See accompanying file LICENSE_1_0.txt or copy at - http://www.boost.org/LICENSE_1_0.txt) -

            -
            -
            -
            -PrevUpHomeNext -
            - - diff --git a/doc/html/boost/polymorphic_get.html b/doc/html/boost/polymorphic_get.html index 2b205b7da6..7cf1d94324 100644 --- a/doc/html/boost/polymorphic_get.html +++ b/doc/html/boost/polymorphic_get.html @@ -43,7 +43,7 @@ template<typename U, typename T1, typename T2, ..., typename TN> const U & polymorphic_get(const variant<T1, T2, ..., TN> & operand);
            -

            Description

            +

            Description

            Evaluates to polymorphic_strict_get if BOOST_VARIANT_USE_RELAXED_GET_BY_DEFAULT is not defined. If BOOST_VARIANT_USE_RELAXED_GET_BY_DEFAULT diff --git a/doc/html/boost/polymorphic_relaxed_get.html b/doc/html/boost/polymorphic_relaxed_get.html index 64b53965c8..ae6f46124c 100644 --- a/doc/html/boost/polymorphic_relaxed_get.html +++ b/doc/html/boost/polymorphic_relaxed_get.html @@ -44,7 +44,7 @@ template<typename U, typename T1, typename T2, ..., typename TN> const U & polymorphic_relaxed_get(const variant<T1, T2, ..., TN> & operand);

            -

            Description

            +

            Description

            The polymorphic_get function allows run-time checked, type-safe retrieval of the content of the given variant. The function succeeds diff --git a/doc/html/boost/polymorphic_strict_get.html b/doc/html/boost/polymorphic_strict_get.html index b095f259da..5146417f00 100644 --- a/doc/html/boost/polymorphic_strict_get.html +++ b/doc/html/boost/polymorphic_strict_get.html @@ -43,7 +43,7 @@ template<typename U, typename T1, typename T2, ..., typename TN> const U & polymorphic_strict_get(const variant<T1, T2, ..., TN> & operand);

            -

            Description

            +

            Description

            Acts exactly like polymorphic_relaxed_get but does a compile time check that type U is one of the types that can be stored in variant.

            diff --git a/doc/html/boost/posix_time/duration_from_string.html b/doc/html/boost/posix_time/duration_from_string.html index 5734f9589f..4f8c08092b 100644 --- a/doc/html/boost/posix_time/duration_from_string.html +++ b/doc/html/boost/posix_time/duration_from_string.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
            -PrevUpHomeNext +PrevUpHomeNext
            @@ -35,7 +35,7 @@ time_duration duration_from_string(const std::string & s);
            -

            Description

            +

            Description

            Expected format for string is "[-]h[h][:mm][:ss][.fff]". A negative duration will be created if the first character in string is a '-', all other '-' will be treated as delimiters. Accepted delimiters are "-:,.".

            @@ -47,7 +47,7 @@
            -PrevUpHomeNext +PrevUpHomeNext
            diff --git a/doc/html/boost/posix_time/from_ftime.html b/doc/html/boost/posix_time/from_ftime.html index f4f75bf5be..4b6f3165ec 100644 --- a/doc/html/boost/posix_time/from_ftime.html +++ b/doc/html/boost/posix_time/from_ftime.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
            -PrevUpHomeNext +PrevUpHomeNext
            @@ -36,7 +36,7 @@ template<typename TimeT, typename FileTimeT> TimeT from_ftime(const FileTimeT & ft);
            -

            Description

            +

            Description

            Function to create a time object from an initialized FILETIME struct. A FILETIME struct holds 100-nanosecond units (0.0000001). When built with microsecond resolution the FILETIME's sub second value will be truncated. Nanosecond resolution has no truncation.

            @@ -66,7 +66,7 @@
            -PrevUpHomeNext +PrevUpHomeNext
            diff --git a/doc/html/boost/posix_time/hours.html b/doc/html/boost/posix_time/hours.html index 58738c0514..139176f047 100644 --- a/doc/html/boost/posix_time/hours.html +++ b/doc/html/boost/posix_time/hours.html @@ -36,16 +36,16 @@ class hours : public boost::posix_time::time_duration { public: // construct/copy/destruct - explicit hours(long); + explicit hours(long); };
            -

            Description

            +

            Description

            -

            +

            hours public construct/copy/destruct

            -
            1. explicit hours(long h);
            +
            1. explicit hours(long h);
            diff --git a/doc/html/boost/posix_time/millisec_idm45507135057104.html b/doc/html/boost/posix_time/millisec_idm45507135057104.html new file mode 100644 index 0000000000..0733183628 --- /dev/null +++ b/doc/html/boost/posix_time/millisec_idm45507135057104.html @@ -0,0 +1,70 @@ + + + + +Class millisec_posix_time_system_config + + + + + + + + + + + + + + + +
            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
            +
            +
            +PrevUpHomeNext +
            +
            +
            +
            +

            Class millisec_posix_time_system_config

            +

            boost::posix_time::millisec_posix_time_system_config

            +
            +

            Synopsis

            +
            // In header: <boost/date_time/posix_time/posix_time_config.hpp>
+
+
+class millisec_posix_time_system_config {
+public:
+  // types
+  typedef boost::int64_t             time_rep_type;     
+  typedef gregorian::date            date_type;         
+  typedef gregorian::date_duration   date_duration_type;
+  typedef time_duration              time_duration_type;
+  typedef time_res_traits::tick_type int_type;          
+  typedef time_res_traits::impl_type impl_type;         
+  typedef time_res_traits            resolution_traits; 
+
+  // public member functions
+   BOOST_STATIC_CONSTANT(boost::int64_t, tick_per_second = 1000000);
+};
            +
            +

            Description

            +
            +

            +millisec_posix_time_system_config public member functions

            +
            1.  BOOST_STATIC_CONSTANT(boost::int64_t, tick_per_second = 1000000);
            +
            +
            +
            + + + +
            Copyright © 2001-2005 CrystalClear Software, Inc

            Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

            +
            +
            +
            +PrevUpHomeNext +
            + + diff --git a/doc/html/boost/posix_time/millisec_posi_idp112084736.html b/doc/html/boost/posix_time/millisec_posi_idp112084736.html deleted file mode 100644 index d664ed0312..0000000000 --- a/doc/html/boost/posix_time/millisec_posi_idp112084736.html +++ /dev/null @@ -1,70 +0,0 @@ - - - - -Class millisec_posix_time_system_config - - - - - - - - - - - - - - - -
            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
            -
            -
            -PrevUpHomeNext -
            -
            -
            -
            -

            Class millisec_posix_time_system_config

            -

            boost::posix_time::millisec_posix_time_system_config

            -
            -

            Synopsis

            -
            // In header: <boost/date_time/posix_time/posix_time_config.hpp>
-
-
-class millisec_posix_time_system_config {
-public:
-  // types
-  typedef boost::int64_t             time_rep_type;     
-  typedef gregorian::date            date_type;         
-  typedef gregorian::date_duration   date_duration_type;
-  typedef time_duration              time_duration_type;
-  typedef time_res_traits::tick_type int_type;          
-  typedef time_res_traits::impl_type impl_type;         
-  typedef time_res_traits            resolution_traits; 
-
-  // public member functions
-   BOOST_STATIC_CONSTANT(boost::int64_t, tick_per_second = 1000000);
-};
            -
            -

            Description

            -
            -

            -millisec_posix_time_system_config public member functions

            -
            1.  BOOST_STATIC_CONSTANT(boost::int64_t, tick_per_second = 1000000);
            -
            -
            -
            - - - -
            Copyright © 2001-2005 CrystalClear Software, Inc

            Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

            -
            -
            -
            -PrevUpHomeNext -
            - - diff --git a/doc/html/boost/posix_time/minutes.html b/doc/html/boost/posix_time/minutes.html index 452c0eb991..5bb6ca59ea 100644 --- a/doc/html/boost/posix_time/minutes.html +++ b/doc/html/boost/posix_time/minutes.html @@ -36,16 +36,16 @@ class minutes : public boost::posix_time::time_duration { public: // construct/copy/destruct - explicit minutes(long); + explicit minutes(long); };
            -

            Description

            +

            Description

            -

            +

            minutes public construct/copy/destruct

            -
            1. explicit minutes(long m);
            +
            1. explicit minutes(long m);
          diff --git a/doc/html/boost/posix_time/operator-__idp101451904.html b/doc/html/boost/posix_time/operator-__idp101451904.html deleted file mode 100644 index 3df14cb871..0000000000 --- a/doc/html/boost/posix_time/operator-__idp101451904.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Function operator-= - - - - - - - - - - - - - - - -
          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
          -
          -
          -PrevUpHomeNext -
          -
          -
          -
          -

          Function operator-=

          -

          boost::posix_time::operator-=

          -
          -

          Synopsis

          -
          // In header: <boost/date_time/posix_time/date_duration_operators.hpp>
-
-
-ptime operator-=(ptime & t, const boost::gregorian::months & m);
          -
          -

          Description

          -

          Subtracts a months object from a ptime. Result will be same day-of-month as ptime unless original day was the last day of month. see date_time::months_duration for more details

          -
          -
          - - - -
          Copyright © 2001-2005 CrystalClear Software, Inc

          Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

          -
          -
          -
          -PrevUpHomeNext -
          - - diff --git a/doc/html/boost/posix_time/operator-__idp111954528.html b/doc/html/boost/posix_time/operator-__idp111954528.html deleted file mode 100644 index 4d8ac12efd..0000000000 --- a/doc/html/boost/posix_time/operator-__idp111954528.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Function operator-= - - - - - - - - - - - - - - - -
          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
          -
          -
          -PrevUpHomeNext -
          -
          -
          -
          -

          Function operator-=

          -

          boost::posix_time::operator-=

          -
          -

          Synopsis

          -
          // In header: <boost/date_time/posix_time/date_duration_operators.hpp>
-
-
-ptime operator-=(ptime & t, const boost::gregorian::years & y);
          -
          -

          Description

          -

          Subtracts a years object from a ptime. Result will be same month and day-of-month as ptime unless original day was the last day of month. see date_time::years_duration for more details

          -
          -
          - - - -
          Copyright © 2001-2005 CrystalClear Software, Inc

          Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

          -
          -
          -
          -PrevUpHomeNext -
          - - diff --git a/doc/html/boost/posix_time/operator-_idp101448512.html b/doc/html/boost/posix_time/operator-_idp101448512.html deleted file mode 100644 index f97167ee8d..0000000000 --- a/doc/html/boost/posix_time/operator-_idp101448512.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Function operator- - - - - - - - - - - - - - - - -
          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
          -
          -
          -PrevUpHomeNext -
          -
          -
          -
          -

          Function operator-

          -

          boost::posix_time::operator-

          -
          -

          Synopsis

          -
          // In header: <boost/date_time/posix_time/date_duration_operators.hpp>
-
-
-ptime operator-(const ptime & t, const boost::gregorian::months & m);
          -
          -

          Description

          -

          Subtracts a months object and a ptime. Result will be same day-of-month as ptime unless original day was the last day of month. see date_time::months_duration for more details

          -
          -
          - - - -
          Copyright © 2001-2005 CrystalClear Software, Inc

          Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

          -
          -
          -
          -PrevUpHomeNext -
          - - diff --git a/doc/html/boost/posix_time/operator-_idp111951120.html b/doc/html/boost/posix_time/operator-_idp111951120.html deleted file mode 100644 index 4f22c6e790..0000000000 --- a/doc/html/boost/posix_time/operator-_idp111951120.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Function operator- - - - - - - - - - - - - - - - -
          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
          -
          -
          -PrevUpHomeNext -
          -
          -
          -
          -

          Function operator-

          -

          boost::posix_time::operator-

          -
          -

          Synopsis

          -
          // In header: <boost/date_time/posix_time/date_duration_operators.hpp>
-
-
-ptime operator-(const ptime & t, const boost::gregorian::years & y);
          -
          -

          Description

          -

          Subtracts a years object and a ptime. Result will be same month and day-of-month as ptime unless original day was the last day of month. see date_time::years_duration for more details

          -
          -
          - - - -
          Copyright © 2001-2005 CrystalClear Software, Inc

          Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

          -
          -
          -
          -PrevUpHomeNext -
          - - diff --git a/doc/html/boost/posix_time/operator___idp101445280.html b/doc/html/boost/posix_time/operator___idp101445280.html deleted file mode 100644 index 3e9d0ce735..0000000000 --- a/doc/html/boost/posix_time/operator___idp101445280.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Function operator+= - - - - - - - - - - - - - - - -
          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
          -
          -
          -PrevUpHomeNext -
          -
          -
          -
          -

          Function operator+=

          -

          boost::posix_time::operator+=

          -
          -

          Synopsis

          -
          // In header: <boost/date_time/posix_time/date_duration_operators.hpp>
-
-
-ptime operator+=(ptime & t, const boost::gregorian::months & m);
          -
          -

          Description

          -

          Adds a months object to a ptime. Result will be same day-of-month as ptime unless original day was the last day of month. see date_time::months_duration for more details

          -
          -
          - - - -
          Copyright © 2001-2005 CrystalClear Software, Inc

          Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

          -
          -
          -
          -PrevUpHomeNext -
          - - diff --git a/doc/html/boost/posix_time/operator___idp111947888.html b/doc/html/boost/posix_time/operator___idp111947888.html deleted file mode 100644 index 43909469da..0000000000 --- a/doc/html/boost/posix_time/operator___idp111947888.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Function operator+= - - - - - - - - - - - - - - - -
          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
          -
          -
          -PrevUpHomeNext -
          -
          -
          -
          -

          Function operator+=

          -

          boost::posix_time::operator+=

          -
          -

          Synopsis

          -
          // In header: <boost/date_time/posix_time/date_duration_operators.hpp>
-
-
-ptime operator+=(ptime & t, const boost::gregorian::years & y);
          -
          -

          Description

          -

          Adds a years object to a ptime. Result will be same month and day-of-month as ptime unless original day was the last day of month. see date_time::years_duration for more details

          -
          -
          - - - -
          Copyright © 2001-2005 CrystalClear Software, Inc

          Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

          -
          -
          -
          -PrevUpHomeNext -
          - - diff --git a/doc/html/boost/posix_time/operator__idp101441888.html b/doc/html/boost/posix_time/operator__idp101441888.html deleted file mode 100644 index 8dbf7ece29..0000000000 --- a/doc/html/boost/posix_time/operator__idp101441888.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Function operator+ - - - - - - - - - - - - - - - -
          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
          -
          -
          -PrevUpHomeNext -
          -
          -
          -
          -

          Function operator+

          -

          boost::posix_time::operator+

          -
          -

          Synopsis

          -
          // In header: <boost/date_time/posix_time/date_duration_operators.hpp>
-
-
-ptime operator+(const ptime & t, const boost::gregorian::months & m);
          -
          -

          Description

          -

          Adds a months object and a ptime. Result will be same day-of-month as ptime unless original day was the last day of month. see date_time::months_duration for more details

          -
          -
          - - - -
          Copyright © 2001-2005 CrystalClear Software, Inc

          Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

          -
          -
          -
          -PrevUpHomeNext -
          - - diff --git a/doc/html/boost/posix_time/operator__idp111944496.html b/doc/html/boost/posix_time/operator__idp111944496.html deleted file mode 100644 index f32bf9afa6..0000000000 --- a/doc/html/boost/posix_time/operator__idp111944496.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Function operator+ - - - - - - - - - - - - - - - -
          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
          -
          -
          -PrevUpHomeNext -
          -
          -
          -
          -

          Function operator+

          -

          boost::posix_time::operator+

          -
          -

          Synopsis

          -
          // In header: <boost/date_time/posix_time/date_duration_operators.hpp>
-
-
-ptime operator+(const ptime & t, const boost::gregorian::years & y);
          -
          -

          Description

          -

          Adds a years object and a ptime. Result will be same month and day-of-month as ptime unless original day was the last day of month. see date_time::years_duration for more details

          -
          -
          - - - -
          Copyright © 2001-2005 CrystalClear Software, Inc

          Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

          -
          -
          -
          -PrevUpHomeNext -
          - - diff --git a/doc/html/boost/posix_time/operator_idm45507094493328.html b/doc/html/boost/posix_time/operator_idm45507094493328.html new file mode 100644 index 0000000000..59b01399a4 --- /dev/null +++ b/doc/html/boost/posix_time/operator_idm45507094493328.html @@ -0,0 +1,53 @@ + + + + +Function operator-= + + + + + + + + + + + + + + + +
          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
          +
          +
          +PrevUpHomeNext +
          +
          +
          +
          +

          Function operator-=

          +

          boost::posix_time::operator-=

          +
          +

          Synopsis

          +
          // In header: <boost/date_time/posix_time/date_duration_operators.hpp>
+
+
+ptime operator-=(ptime & t, const boost::gregorian::years & y);
          +
          +

          Description

          +

          Subtracts a years object from a ptime. Result will be same month and day-of-month as ptime unless original day was the last day of month. see date_time::years_duration for more details

          +
          +
          + + + +
          Copyright © 2001-2005 CrystalClear Software, Inc

          Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

          +
          +
          +
          +PrevUpHomeNext +
          + + diff --git a/doc/html/boost/posix_time/operator_idm45507094496736.html b/doc/html/boost/posix_time/operator_idm45507094496736.html new file mode 100644 index 0000000000..e24d3a2f93 --- /dev/null +++ b/doc/html/boost/posix_time/operator_idm45507094496736.html @@ -0,0 +1,53 @@ + + + + +Function operator- + + + + + + + + + + + + + + + +
          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
          +
          +
          +PrevUpHomeNext +
          +
          +
          +
          +

          Function operator-

          +

          boost::posix_time::operator-

          +
          +

          Synopsis

          +
          // In header: <boost/date_time/posix_time/date_duration_operators.hpp>
+
+
+ptime operator-(const ptime & t, const boost::gregorian::years & y);
          +
          +

          Description

          +

          Subtracts a years object and a ptime. Result will be same month and day-of-month as ptime unless original day was the last day of month. see date_time::years_duration for more details

          +
          +
          + + + +
          Copyright © 2001-2005 CrystalClear Software, Inc

          Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

          +
          +
          +
          +PrevUpHomeNext +
          + + diff --git a/doc/html/boost/posix_time/operator_idm45507094499968.html b/doc/html/boost/posix_time/operator_idm45507094499968.html new file mode 100644 index 0000000000..cb959d73b2 --- /dev/null +++ b/doc/html/boost/posix_time/operator_idm45507094499968.html @@ -0,0 +1,53 @@ + + + + +Function operator+= + + + + + + + + + + + + + + + +
          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
          +
          +
          +PrevUpHomeNext +
          +
          +
          +
          +

          Function operator+=

          +

          boost::posix_time::operator+=

          +
          +

          Synopsis

          +
          // In header: <boost/date_time/posix_time/date_duration_operators.hpp>
+
+
+ptime operator+=(ptime & t, const boost::gregorian::years & y);
          +
          +

          Description

          +

          Adds a years object to a ptime. Result will be same month and day-of-month as ptime unless original day was the last day of month. see date_time::years_duration for more details

          +
          +
          + + + +
          Copyright © 2001-2005 CrystalClear Software, Inc

          Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

          +
          +
          +
          +PrevUpHomeNext +
          + + diff --git a/doc/html/boost/posix_time/operator_idm45507107058896.html b/doc/html/boost/posix_time/operator_idm45507107058896.html new file mode 100644 index 0000000000..e966fdff7d --- /dev/null +++ b/doc/html/boost/posix_time/operator_idm45507107058896.html @@ -0,0 +1,55 @@ + + + + +Function template operator>> + + + + + + + + + + + + + + + +
          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
          +
          +
          +PrevUpHomeNext +
          +
          +
          +
          +

          Function template operator>>

          +

          boost::posix_time::operator>>

          +
          +

          Synopsis

          +
          // In header: <boost/date_time/posix_time/posix_time_legacy_io.hpp>
+
+
+template<typename charT> 
+  std::basic_istream< charT > & 
+  operator>>(std::basic_istream< charT > & is, time_period & tp);
          +
          +

          Description

          +

          operator>> for time_period. time_period must be in "[date time_duration/date time_duration]" format.

          +
          +
          + + + +
          Copyright © 2001-2005 CrystalClear Software, Inc

          Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

          +
          +
          +
          +PrevUpHomeNext +
          + + diff --git a/doc/html/boost/posix_time/operator_idm45507110093456.html b/doc/html/boost/posix_time/operator_idm45507110093456.html new file mode 100644 index 0000000000..09af223542 --- /dev/null +++ b/doc/html/boost/posix_time/operator_idm45507110093456.html @@ -0,0 +1,53 @@ + + + + +Function operator+ + + + + + + + + + + + + + + + +
          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
          +
          +
          +PrevUpHomeNext +
          +
          +
          +
          +

          Function operator+

          +

          boost::posix_time::operator+

          +
          +

          Synopsis

          +
          // In header: <boost/date_time/posix_time/date_duration_operators.hpp>
+
+
+ptime operator+(const ptime & t, const boost::gregorian::years & y);
          +
          +

          Description

          +

          Adds a years object and a ptime. Result will be same month and day-of-month as ptime unless original day was the last day of month. see date_time::years_duration for more details

          +
          +
          + + + +
          Copyright © 2001-2005 CrystalClear Software, Inc

          Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

          +
          +
          +
          +PrevUpHomeNext +
          + + diff --git a/doc/html/boost/posix_time/operator_idm45507110096688.html b/doc/html/boost/posix_time/operator_idm45507110096688.html new file mode 100644 index 0000000000..d2f44cc137 --- /dev/null +++ b/doc/html/boost/posix_time/operator_idm45507110096688.html @@ -0,0 +1,53 @@ + + + + +Function operator-= + + + + + + + + + + + + + + + +
          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
          +
          +
          +PrevUpHomeNext +
          +
          +
          +
          +

          Function operator-=

          +

          boost::posix_time::operator-=

          +
          +

          Synopsis

          +
          // In header: <boost/date_time/posix_time/date_duration_operators.hpp>
+
+
+ptime operator-=(ptime & t, const boost::gregorian::months & m);
          +
          +

          Description

          +

          Subtracts a months object from a ptime. Result will be same day-of-month as ptime unless original day was the last day of month. see date_time::months_duration for more details

          +
          +
          + + + +
          Copyright © 2001-2005 CrystalClear Software, Inc

          Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

          +
          +
          +
          +PrevUpHomeNext +
          + + diff --git a/doc/html/boost/posix_time/operator_idm45507110100080.html b/doc/html/boost/posix_time/operator_idm45507110100080.html new file mode 100644 index 0000000000..63238b3c1f --- /dev/null +++ b/doc/html/boost/posix_time/operator_idm45507110100080.html @@ -0,0 +1,53 @@ + + + + +Function operator- + + + + + + + + + + + + + + + +
          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
          +
          +
          +PrevUpHomeNext +
          +
          +
          +
          +

          Function operator-

          +

          boost::posix_time::operator-

          +
          +

          Synopsis

          +
          // In header: <boost/date_time/posix_time/date_duration_operators.hpp>
+
+
+ptime operator-(const ptime & t, const boost::gregorian::months & m);
          +
          +

          Description

          +

          Subtracts a months object and a ptime. Result will be same day-of-month as ptime unless original day was the last day of month. see date_time::months_duration for more details

          +
          +
          + + + +
          Copyright © 2001-2005 CrystalClear Software, Inc

          Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

          +
          +
          +
          +PrevUpHomeNext +
          + + diff --git a/doc/html/boost/posix_time/operator_idm45507110103312.html b/doc/html/boost/posix_time/operator_idm45507110103312.html new file mode 100644 index 0000000000..ab2be0b25f --- /dev/null +++ b/doc/html/boost/posix_time/operator_idm45507110103312.html @@ -0,0 +1,53 @@ + + + + +Function operator+= + + + + + + + + + + + + + + + +
          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
          +
          +
          +PrevUpHomeNext +
          +
          +
          +
          +

          Function operator+=

          +

          boost::posix_time::operator+=

          +
          +

          Synopsis

          +
          // In header: <boost/date_time/posix_time/date_duration_operators.hpp>
+
+
+ptime operator+=(ptime & t, const boost::gregorian::months & m);
          +
          +

          Description

          +

          Adds a months object to a ptime. Result will be same day-of-month as ptime unless original day was the last day of month. see date_time::months_duration for more details

          +
          +
          + + + +
          Copyright © 2001-2005 CrystalClear Software, Inc

          Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

          +
          +
          +
          +PrevUpHomeNext +
          + + diff --git a/doc/html/boost/posix_time/operator_idm45507154023312.html b/doc/html/boost/posix_time/operator_idm45507154023312.html new file mode 100644 index 0000000000..a09183be31 --- /dev/null +++ b/doc/html/boost/posix_time/operator_idm45507154023312.html @@ -0,0 +1,53 @@ + + + + +Function operator+ + + + + + + + + + + + + + + + +
          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
          +
          +
          +PrevUpHomeNext +
          +
          +
          +
          +

          Function operator+

          +

          boost::posix_time::operator+

          +
          +

          Synopsis

          +
          // In header: <boost/date_time/posix_time/date_duration_operators.hpp>
+
+
+ptime operator+(const ptime & t, const boost::gregorian::months & m);
          +
          +

          Description

          +

          Adds a months object and a ptime. Result will be same day-of-month as ptime unless original day was the last day of month. see date_time::months_duration for more details

          +
          +
          + + + +
          Copyright © 2001-2005 CrystalClear Software, Inc

          Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

          +
          +
          +
          +PrevUpHomeNext +
          + + diff --git a/doc/html/boost/posix_time/operator_idp43055264.html b/doc/html/boost/posix_time/operator_idp43055264.html deleted file mode 100644 index dac4847f37..0000000000 --- a/doc/html/boost/posix_time/operator_idp43055264.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Function template operator>> - - - - - - - - - - - - - - - -
          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
          -
          -
          -PrevUpHomeNext -
          -
          -
          -
          -

          Function template operator>>

          -

          boost::posix_time::operator>>

          -
          -

          Synopsis

          -
          // In header: <boost/date_time/posix_time/posix_time_legacy_io.hpp>
-
-
-template<typename charT> 
-  std::basic_istream< charT > & 
-  operator>>(std::basic_istream< charT > & is, time_period & tp);
          -
          -

          Description

          -

          operator>> for time_period. time_period must be in "[date time_duration/date time_duration]" format.

          -
          -
          - - - -
          Copyright © 2001-2005 CrystalClear Software, Inc

          Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

          -
          -
          -
          -PrevUpHomeNext -
          - - diff --git a/doc/html/boost/posix_time/posix_time_system_config.html b/doc/html/boost/posix_time/posix_time_system_config.html index 952fc9dd9a..ff47bf4fed 100644 --- a/doc/html/boost/posix_time/posix_time_system_config.html +++ b/doc/html/boost/posix_time/posix_time_system_config.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
          -PrevUpHomeNext +PrevUpHomeNext
          @@ -43,15 +43,15 @@ typedef time_res_traits::tick_type int_type; typedef time_res_traits resolution_traits; - // public member functions - BOOST_STATIC_CONSTANT(boost::int64_t, tick_per_second = 1000000000); + // public member functions + BOOST_STATIC_CONSTANT(boost::int64_t, tick_per_second = 1000000000); };
          -

          Description

          +

          Description

          -

          -posix_time_system_config public member functions

          -
          1.  BOOST_STATIC_CONSTANT(boost::int64_t, tick_per_second = 1000000000);
          +

          +posix_time_system_config public member functions

          +
          1.  BOOST_STATIC_CONSTANT(boost::int64_t, tick_per_second = 1000000000);
          @@ -63,7 +63,7 @@
          -PrevUpHomeNext +PrevUpHomeNext
          diff --git a/doc/html/boost/posix_time/ptime.html b/doc/html/boost/posix_time/ptime.html index 8dc8a582a0..cfc7ab50cf 100644 --- a/doc/html/boost/posix_time/ptime.html +++ b/doc/html/boost/posix_time/ptime.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
          -PrevUpHomeNext +PrevUpHomeNext
          @@ -42,29 +42,29 @@ typedef ptime time_type; // construct/copy/destruct - ptime(gregorian::date, time_duration_type); - explicit ptime(gregorian::date); - ptime(const time_rep_type &); - ptime(const special_values); - ptime(); + ptime(gregorian::date, time_duration_type); + explicit ptime(gregorian::date); + ptime(const time_rep_type &); + ptime(const special_values); + ptime(); };
          -

          Description

          +

          Description

          -

          +

          ptime public construct/copy/destruct

          1. -
            ptime(gregorian::date d, time_duration_type td);
            Construct with date and offset in day.
            2. +
            ptime(gregorian::date d, time_duration_type td);
            Construct with date and offset in day.
          2. -
            explicit ptime(gregorian::date d);
            Construct a time at start of the given day (midnight)
            3. +
            explicit ptime(gregorian::date d);
            Construct a time at start of the given day (midnight)
          3. -
            ptime(const time_rep_type & rhs);
            Copy from time_rep.
            4. +
            ptime(const time_rep_type & rhs);
            Copy from time_rep.
          4. -
            ptime(const special_values sv);
            Construct from special value.
            5. -
          5. ptime();
            6. +
            ptime(const special_values sv);
            Construct from special value. +
          6. ptime();
          @@ -77,7 +77,7 @@
          -PrevUpHomeNext +PrevUpHomeNext
          diff --git a/doc/html/boost/posix_time/seconds.html b/doc/html/boost/posix_time/seconds.html index 93f0703306..bdd706643a 100644 --- a/doc/html/boost/posix_time/seconds.html +++ b/doc/html/boost/posix_time/seconds.html @@ -36,16 +36,16 @@ class seconds : public boost::posix_time::time_duration { public: // construct/copy/destruct - explicit seconds(long); + explicit seconds(long); };
          -

          Description

          +

          Description

          -

          +

          seconds public construct/copy/destruct

          -
          1. explicit seconds(long s);
          +
          1. explicit seconds(long s);
        diff --git a/doc/html/boost/posix_time/simple_time_rep.html b/doc/html/boost/posix_time/simple_time_rep.html index 0d2662e71d..2cbb89e2d9 100644 --- a/doc/html/boost/posix_time/simple_time_rep.html +++ b/doc/html/boost/posix_time/simple_time_rep.html @@ -39,35 +39,35 @@ typedef time_duration time_duration_type; // construct/copy/destruct - simple_time_rep(date_type, time_duration_type); + simple_time_rep(date_type, time_duration_type); - // public member functions - bool is_special() const; - bool is_pos_infinity() const; - bool is_neg_infinity() const; - bool is_not_a_date_time() const; + // public member functions + bool is_special() const; + bool is_pos_infinity() const; + bool is_neg_infinity() const; + bool is_not_a_date_time() const; // public data members date_type day; time_duration_type time_of_day; };
        -

        Description

        +

        Description

        -

        +

        simple_time_rep public construct/copy/destruct

        -
        1. simple_time_rep(date_type d, time_duration_type tod);
        +
        1. simple_time_rep(date_type d, time_duration_type tod);
        -

        -simple_time_rep public member functions

        +

        +simple_time_rep public member functions

          -
        1. bool is_special() const;
          2. -
        2. bool is_pos_infinity() const;
          3. -
        3. bool is_neg_infinity() const;
          4. -
        4. bool is_not_a_date_time() const;
          5. +
        5. bool is_special() const;
          6. +
        6. bool is_pos_infinity() const;
          7. +
        7. bool is_neg_infinity() const;
          8. +
        8. bool is_not_a_date_time() const;
        diff --git a/doc/html/boost/posix_time/time_duration.html b/doc/html/boost/posix_time/time_duration.html index ba1314f820..b462e5d94c 100644 --- a/doc/html/boost/posix_time/time_duration.html +++ b/doc/html/boost/posix_time/time_duration.html @@ -48,25 +48,25 @@ typedef time_res_traits::impl_type impl_type; // construct/copy/destruct - time_duration(hour_type, min_type, sec_type, fractional_seconds_type = 0); - time_duration(); - time_duration(boost::date_time::special_values); - explicit time_duration(impl_type); + time_duration(hour_type, min_type, sec_type, fractional_seconds_type = 0); + time_duration(); + time_duration(boost::date_time::special_values); + explicit time_duration(impl_type); };
        -

        Description

        +

        Description

        -

        +

        time_duration public construct/copy/destruct

          -
        1. time_duration(hour_type hour, min_type min, sec_type sec, 
+
        2. time_duration(hour_type hour, min_type min, sec_type sec, 
               fractional_seconds_type fs = 0);
          3. 
-
        3. time_duration();
          4. 
+
        4. time_duration();
          5. 
 
        5. 
-
          time_duration(boost::date_time::special_values sv);
          Construct from special_values. 
          6. 
-
        6. explicit time_duration(impl_type tick_count);
          7. 
+
          time_duration(boost::date_time::special_values sv);
          Construct from special_values.
          7. +
        7. explicit time_duration(impl_type tick_count);
        diff --git a/doc/html/boost/posix_time/wtime_facet.html b/doc/html/boost/posix_time/wtime_facet.html index 31f2a0bd55..22c596c7ca 100644 --- a/doc/html/boost/posix_time/wtime_facet.html +++ b/doc/html/boost/posix_time/wtime_facet.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        @@ -35,7 +35,7 @@ typedef boost::date_time::time_facet< ptime, wchar_t > wtime_facet;
        -

        Description

        +

        Description

        ptime_facet is depricated and will be phased out. use time_facet instead wptime_input_facet is depricated and will be phased out. use wtime_input_facet instead ptime_input_facet is depricated and will be phased out. use time_input_facet instead

      @@ -47,7 +47,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/program_options/abstract_variables_map.html b/doc/html/boost/program_options/abstract_variables_map.html index db1d519a83..a1315da509 100644 --- a/doc/html/boost/program_options/abstract_variables_map.html +++ b/doc/html/boost/program_options/abstract_variables_map.html @@ -36,37 +36,37 @@ class abstract_variables_map { public: // construct/copy/destruct - abstract_variables_map(); - abstract_variables_map(const abstract_variables_map *); - ~abstract_variables_map(); + abstract_variables_map(); + abstract_variables_map(const abstract_variables_map *); + ~abstract_variables_map(); - // public member functions - const variable_value & operator[](const std::string &) const; - void next(abstract_variables_map *); + // public member functions + const variable_value & operator[](const std::string &) const; + void next(abstract_variables_map *); - // private member functions - virtual const variable_value & get(const std::string &) const = 0; + // private member functions + virtual const variable_value & get(const std::string &) const = 0; };
      -

      Description

      +

      Description

      Implements string->string mapping with convenient value casting facilities.

      -

      +

      abstract_variables_map public construct/copy/destruct

        -
      1. abstract_variables_map();
        2. -
      2. abstract_variables_map(const abstract_variables_map * next);
        3. -
      3. ~abstract_variables_map();
        4. +
      4. abstract_variables_map();
        5. +
      5. abstract_variables_map(const abstract_variables_map * next);
        6. +
      6. ~abstract_variables_map();
      -

      -abstract_variables_map public member functions

      +

      +abstract_variables_map public member functions

      1. -
        const variable_value & operator[](const std::string & name) const;
        +
        const variable_value & operator[](const std::string & name) const;

        Obtains the value of variable 'name', from *this and possibly from the chain of variable maps.

      -

      -abstract_variables_map private member functions

      +

      +abstract_variables_map private member functions

      1. -
        virtual const variable_value & get(const std::string & name) const = 0;
        +
        virtual const variable_value & get(const std::string & name) const = 0;

        Returns value of variable 'name' stored in *this, or empty value otherwise.

      diff --git a/doc/html/boost/program_options/ambiguous_option.html b/doc/html/boost/program_options/ambiguous_option.html index 5a005d8288..fcdcff370e 100644 --- a/doc/html/boost/program_options/ambiguous_option.html +++ b/doc/html/boost/program_options/ambiguous_option.html @@ -38,38 +38,38 @@ { public: // construct/copy/destruct - ambiguous_option(const std::vector< std::string > &); - ~ambiguous_option(); + ambiguous_option(const std::vector< std::string > &); + ~ambiguous_option(); - // public member functions - const std::vector< std::string > & alternatives() const; + // public member functions + const std::vector< std::string > & alternatives() const; - // protected member functions - virtual void substitute_placeholders(const std::string &) const; + // protected member functions + virtual void substitute_placeholders(const std::string &) const; };
      -

      Description

      +

      Description

      Class thrown when there's ambiguity amoung several possible options.

      -

      +

      ambiguous_option public construct/copy/destruct

        -
      1. ambiguous_option(const std::vector< std::string > & xalternatives);
        2. -
      2. ~ambiguous_option();
        3. +
      3. ambiguous_option(const std::vector< std::string > & xalternatives);
        4. +
      4. ~ambiguous_option();
      -

      -ambiguous_option public member functions

      -
      1. const std::vector< std::string > & alternatives() const;
      +

      +ambiguous_option public member functions

      +
      1. const std::vector< std::string > & alternatives() const;
      -

      -ambiguous_option protected member functions

      +

      +ambiguous_option protected member functions

      1. -
        virtual void substitute_placeholders(const std::string & error_template) const;
        +
        virtual void substitute_placeholders(const std::string & error_template) const;

        Makes all substitutions using the template

      diff --git a/doc/html/boost/program_options/basic_command_line_parser.html b/doc/html/boost/program_options/basic_command_line_parser.html index 972934fd68..2e617141eb 100644 --- a/doc/html/boost/program_options/basic_command_line_parser.html +++ b/doc/html/boost/program_options/basic_command_line_parser.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      @@ -36,71 +36,71 @@ class basic_command_line_parser : private cmdline { public: // construct/copy/destruct - basic_command_line_parser(const std::vector< std::basic_string< charT > > &); - basic_command_line_parser(int, const charT *const); + basic_command_line_parser(const std::vector< std::basic_string< charT > > &); + basic_command_line_parser(int, const charT *const); - // public member functions - basic_command_line_parser & options(const options_description &); + // public member functions + basic_command_line_parser & options(const options_description &); basic_command_line_parser & - positional(const positional_options_description &); - basic_command_line_parser & style(int); - basic_command_line_parser & extra_parser(ext_parser); - basic_parsed_options< charT > run(); - basic_command_line_parser & allow_unregistered(); - basic_command_line_parser & extra_style_parser(style_parser); + positional(const positional_options_description &); + basic_command_line_parser & style(int); + basic_command_line_parser & extra_parser(ext_parser); + basic_parsed_options< charT > run(); + basic_command_line_parser & allow_unregistered(); + basic_command_line_parser & extra_style_parser(style_parser); };
      -

      Description

      +

      Description

      Command line parser.

      The class allows one to specify all the information needed for parsing and to parse the command line. It is primarily needed to emulate named function parameters -- a regular function with 5 parameters will be hard to use and creating overloads with a smaller number of parameters will be confusing.

      For the most common case, the function parse_command_line is a better alternative.

      There are two typedefs -- command_line_parser and wcommand_line_parser, for charT == char and charT == wchar_t cases.

      -

      +

      basic_command_line_parser public construct/copy/destruct

      1. -
        basic_command_line_parser(const std::vector< std::basic_string< charT > > & args);
        +
        basic_command_line_parser(const std::vector< std::basic_string< charT > > & args);

        Creates a command line parser for the specified arguments list. The 'args' parameter should not include program name.

      2. -
        basic_command_line_parser(int argc, const charT *const argv);
        +
        basic_command_line_parser(int argc, const charT *const argv);

        Creates a command line parser for the specified arguments list. The parameters should be the same as passed to 'main'.

      -

      -basic_command_line_parser public member functions

      +

      +basic_command_line_parser public member functions

      1. -
        basic_command_line_parser & options(const options_description & desc);
        +
        basic_command_line_parser & options(const options_description & desc);

        Sets options descriptions to use. 

      2. basic_command_line_parser & 
-positional(const positional_options_description & desc);
        +positional(const positional_options_description & desc);

        Sets positional options description to use.

      3. -
        basic_command_line_parser & style(int);
        +
        basic_command_line_parser & style(int);

        Sets the command line style.

      4. -
        basic_command_line_parser & extra_parser(ext_parser);
        +
        basic_command_line_parser & extra_parser(ext_parser);

        Sets the extra parsers.

      5. -
        basic_parsed_options< charT > run();
        +
        basic_parsed_options< charT > run();

        Parses the options and returns the result of parsing. Throws on error.

      6. -
        basic_command_line_parser & allow_unregistered();
        +
        basic_command_line_parser & allow_unregistered();

        Specifies that unregistered options are allowed and should be passed though. For each command like token that looks like an option but does not contain a recognized name, an instance of basic_option<charT> will be added to result, with 'unrecognized' field set to 'true'. It's possible to collect all unrecognized options with the 'collect_unrecognized' funciton.

        7. -
      7. basic_command_line_parser & extra_style_parser(style_parser s);
        8. +
      8. basic_command_line_parser & extra_style_parser(style_parser s);
      @@ -115,7 +115,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/program_options/basic_option.html b/doc/html/boost/program_options/basic_option.html index a652a1c255..5c7a2a7cd7 100644 --- a/doc/html/boost/program_options/basic_option.html +++ b/doc/html/boost/program_options/basic_option.html @@ -36,8 +36,8 @@ class basic_option { public: // construct/copy/destruct - basic_option(); - basic_option(const std::string &, const std::vector< std::string > &); + basic_option(); + basic_option(const std::string &, const std::vector< std::string > &); // public data members std::string string_key; @@ -48,21 +48,21 @@ bool case_insensitive; };
      -

      Description

      +

      Description

      Option found in input source. Contains a key and a value. The key, in turn, can be a string (name of an option), or an integer (position in input source) -- in case no name is specified. The latter is only possible for command line. The template parameter specifies the type of char used for storing the option's value.

      -

      +

      basic_option public construct/copy/destruct

        -
      1. basic_option();
        2. -
      2. basic_option(const std::string & xstring_key, 
+
      3. basic_option();
        4. 
+
      4. basic_option(const std::string & xstring_key, 
              const std::vector< std::string > & xvalue);
        5.
      -

      +

      basic_option public public data members

      diff --git a/doc/html/boost/program_options/basic_pa_idm45507044853824.html b/doc/html/boost/program_options/basic_pa_idm45507044853824.html new file mode 100644 index 0000000000..94ad50e85a --- /dev/null +++ b/doc/html/boost/program_options/basic_pa_idm45507044853824.html @@ -0,0 +1,97 @@ + + + + +Class basic_parsed_options<wchar_t> + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Class basic_parsed_options<wchar_t>

      +

      boost::program_options::basic_parsed_options<wchar_t>

      +
      +

      Synopsis

      +
      // In header: <boost/program_options/parsers.hpp>
+
+
+class basic_parsed_options<wchar_t> {
+public:
+  // construct/copy/destruct
+  explicit basic_parsed_options(const basic_parsed_options< char > &);
+
+  // public data members
+  std::vector< basic_option< wchar_t > > options;
+  const options_description * description;
+  basic_parsed_options< char > utf8_encoded_options;
+  int m_options_prefix;
+};
      +
      +

      Description

      +

      Specialization of basic_parsed_options which:

      +
      +

      +

      +
      +

      +basic_parsed_options + public + construct/copy/destruct

      +
      1. +
        explicit basic_parsed_options(const basic_parsed_options< char > & po);
        +

        Constructs wrapped options from options in UTF8 encoding.

        +
      +
      +
      +

      +basic_parsed_options + public + public data members

      +
        +
      1. +
        basic_parsed_options< char > utf8_encoded_options;
        +

        Stores UTF8 encoded options that were passed to constructor, to avoid reverse conversion in some cases.

        +
        2. +
      2. +
        int m_options_prefix;
        +

        Mainly used for the diagnostic messages in exceptions. The canonical option prefix for the parser which generated these results, depending on the settings for basic_command_line_parser::style() or cmdline::style(). In order of precedence of command_line_style enums: allow_long allow_long_disguise allow_dash_for_short allow_slash_for_short

        +
        3. +
      +
      +
      +
      + + + +
      Copyright © 2002-2004 Vladimir Prus

      Distributed under the Boost Software License, Version 1.0. + (See accompanying file LICENSE_1_0.txt or copy at + http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/program_options/basic_parsed__idp152015376.html b/doc/html/boost/program_options/basic_parsed__idp152015376.html deleted file mode 100644 index c9dc62ed2d..0000000000 --- a/doc/html/boost/program_options/basic_parsed__idp152015376.html +++ /dev/null @@ -1,97 +0,0 @@ - - - - -Class basic_parsed_options<wchar_t> - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Class basic_parsed_options<wchar_t>

      -

      boost::program_options::basic_parsed_options<wchar_t>

      -
      -

      Synopsis

      -
      // In header: <boost/program_options/parsers.hpp>
-
-
-class basic_parsed_options<wchar_t> {
-public:
-  // construct/copy/destruct
-  explicit basic_parsed_options(const basic_parsed_options< char > &);
-
-  // public data members
-  std::vector< basic_option< wchar_t > > options;
-  const options_description * description;
-  basic_parsed_options< char > utf8_encoded_options;
-  int m_options_prefix;
-};
      -
      -

      Description

      -

      Specialization of basic_parsed_options which:

      -
        -

      • provides convenient conversion from basic_parsed_options<char>

        • -

      • stores the passed char-based options for later use.

        • -
      -

      -

      -
      -

      -basic_parsed_options - public - construct/copy/destruct

      -
      1. -
        explicit basic_parsed_options(const basic_parsed_options< char > & po);
        -

        Constructs wrapped options from options in UTF8 encoding.

        -
      -
      -
      -

      -basic_parsed_options - public - public data members

      -
        -
      1. -
        basic_parsed_options< char > utf8_encoded_options;
        -

        Stores UTF8 encoded options that were passed to constructor, to avoid reverse conversion in some cases.

        -
        2. -
      2. -
        int m_options_prefix;
        -

        Mainly used for the diagnostic messages in exceptions. The canonical option prefix for the parser which generated these results, depending on the settings for basic_command_line_parser::style() or cmdline::style(). In order of precedence of command_line_style enums: allow_long allow_long_disguise allow_dash_for_short allow_slash_for_short

        -
        3. -
      -
      -
      -
      - - - -
      Copyright © 2002-2004 Vladimir Prus

      Distributed under the Boost Software License, Version 1.0. - (See accompanying file LICENSE_1_0.txt or copy at - http://www.boost.org/LICENSE_1_0.txt) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/program_options/basic_parsed_options.html b/doc/html/boost/program_options/basic_parsed_options.html new file mode 100644 index 0000000000..842323b614 --- /dev/null +++ b/doc/html/boost/program_options/basic_parsed_options.html @@ -0,0 +1,96 @@ + + + + +Class template basic_parsed_options + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Class template basic_parsed_options

      +

      boost::program_options::basic_parsed_options

      +
      +

      Synopsis

      +
      // In header: <boost/program_options/parsers.hpp>
+
+template<typename charT> 
+class basic_parsed_options {
+public:
+  // construct/copy/destruct
+  explicit basic_parsed_options(const options_description *, int = 0);
+
+  // public data members
+  std::vector< basic_option< charT > > options;
+  const options_description * description;
+  int m_options_prefix;
+};
      +
      +

      Description

      +

      Results of parsing an input source. The primary use of this class is passing information from parsers component to value storage component. This class does not makes much sense itself.

      +
      +

      +basic_parsed_options + public + construct/copy/destruct

      +
      1. explicit basic_parsed_options(const options_description * xdescription, 
+                              int options_prefix = 0);
      +
      +
      +

      +basic_parsed_options + public + public data members

      +
        +
      1. +
        std::vector< basic_option< charT > > options;
        +

        Options found in the source.

        +
        2. +
      2. +
        const options_description * description;
        +

        Options description that was used for parsing. Parsers should return pointer to the instance of option_description passed to them, and issues of lifetime are up to the caller. Can be NULL.

        +
        3. +
      3. +
        int m_options_prefix;
        +

        Mainly used for the diagnostic messages in exceptions. The canonical option prefix for the parser which generated these results, depending on the settings for basic_command_line_parser::style() or cmdline::style(). In order of precedence of command_line_style enums: allow_long allow_long_disguise allow_dash_for_short allow_slash_for_short

        +
        4. +
      +
      +
      +

      Specializations

      +
      +
      +
      +
      + + + +
      Copyright © 2002-2004 Vladimir Prus

      Distributed under the Boost Software License, Version 1.0. + (See accompanying file LICENSE_1_0.txt or copy at + http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/program_options/bool_switch.html b/doc/html/boost/program_options/bool_switch.html index 4796c06686..d6402636d4 100644 --- a/doc/html/boost/program_options/bool_switch.html +++ b/doc/html/boost/program_options/bool_switch.html @@ -36,7 +36,7 @@ BOOST_PROGRAM_OPTIONS_DECL typed_value< bool > * bool_switch(); BOOST_PROGRAM_OPTIONS_DECL typed_value< bool > * bool_switch(bool * v);
      -

      Description

      +

      Description

      Works the same way as the 'value<bool>' function, but the created value_semantic won't accept any explicit value. So, if the option is present on the command line, the value will be 'true'.

      diff --git a/doc/html/boost/program_options/collect_unrecognized.html b/doc/html/boost/program_options/collect_unrecognized.html index 92d662e2dd..0ae6e87523 100644 --- a/doc/html/boost/program_options/collect_unrecognized.html +++ b/doc/html/boost/program_options/collect_unrecognized.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      @@ -38,7 +38,7 @@ collect_unrecognized(const std::vector< basic_option< charT > > & options, enum collect_unrecognized_mode mode);
      -

      Description

      +

      Description

      Collects the original tokens for all named options with 'unregistered' flag set. If 'mode' is 'include_positional' also collects all positional options. Returns the vector of origianl tokens for all collected options.

      @@ -52,7 +52,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/program_options/collect_unrecognized_mode.html b/doc/html/boost/program_options/collect_unrecognized_mode.html index cb346a6f49..aa82296cbe 100644 --- a/doc/html/boost/program_options/collect_unrecognized_mode.html +++ b/doc/html/boost/program_options/collect_unrecognized_mode.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      @@ -36,7 +36,7 @@ enum collect_unrecognized_mode { include_positional, exclude_positional };
      -

      Description

      +

      Description

      Controls if the 'collect_unregistered' function should include positional options, or not.

      @@ -50,7 +50,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/program_options/command_line_style/style_t.html b/doc/html/boost/program_options/command_line_style/style_t.html index d8e4c3a66c..77ba93981a 100644 --- a/doc/html/boost/program_options/command_line_style/style_t.html +++ b/doc/html/boost/program_options/command_line_style/style_t.html @@ -52,7 +52,7 @@ | allow_dash_for_short), default_style = = unix_style };
    -

    Description

    +

    Description

    Various possible styles of options.

    There are "long" options, which start with "--" and "short", which start with either "-" or "/". Both kinds can be allowed or disallowed, see allow_long and allow_short. The allowed character for short options is also configurable.

    Option's value can be specified in the same token as name ("--foo=bar"), or in the next token.

    diff --git a/doc/html/boost/program_options/duplicate_option_error.html b/doc/html/boost/program_options/duplicate_option_error.html index dc84f9b9d0..36115a1413 100644 --- a/doc/html/boost/program_options/duplicate_option_error.html +++ b/doc/html/boost/program_options/duplicate_option_error.html @@ -36,17 +36,17 @@ class duplicate_option_error : public boost::program_options::error { public: // construct/copy/destruct - duplicate_option_error(const std::string &); + duplicate_option_error(const std::string &); };
    -

    Description

    +

    Description

    Class thrown when duplicate option description is found.

    -

    +

    duplicate_option_error public construct/copy/destruct

    -
    1. duplicate_option_error(const std::string & xwhat);
    +
    1. duplicate_option_error(const std::string & xwhat);
    diff --git a/doc/html/boost/program_options/error.html b/doc/html/boost/program_options/error.html index 386db9018c..3a2b061f63 100644 --- a/doc/html/boost/program_options/error.html +++ b/doc/html/boost/program_options/error.html @@ -36,17 +36,17 @@ class error : public logic_error { public: // construct/copy/destruct - error(const std::string &); + error(const std::string &); };
    -

    Description

    +

    Description

    Base class for all errors in the library.

    -

    +

    error public construct/copy/destruct

    -
    1. error(const std::string & xwhat);
    +
    1. error(const std::string & xwhat);
    diff --git a/doc/html/boost/program_options/error_with_no_option_name.html b/doc/html/boost/program_options/error_with_no_option_name.html index d9c8953273..fa1cf99f2f 100644 --- a/doc/html/boost/program_options/error_with_no_option_name.html +++ b/doc/html/boost/program_options/error_with_no_option_name.html @@ -38,33 +38,33 @@ { public: // construct/copy/destruct - error_with_no_option_name(const std::string &, const std::string & = ""); - ~error_with_no_option_name(); + error_with_no_option_name(const std::string &, const std::string & = ""); + ~error_with_no_option_name(); - // public member functions - virtual void set_option_name(const std::string &); + // public member functions + virtual void set_option_name(const std::string &); };
    -

    Description

    +

    Description

    Base class of unparsable options, when the desired option cannot be identified.

    It makes no sense to have an option name, when we can't match an option to the parameter

    Having this a part of the error_with_option_name hierachy makes error handling a lot easier, even if the name indicates some sort of conceptual dissonance!

    -

    +

    error_with_no_option_name public construct/copy/destruct

      -
    1. error_with_no_option_name(const std::string & template_, 
+
    2. error_with_no_option_name(const std::string & template_, 
                           const std::string & original_token = "");
      3. 
-
    3. ~error_with_no_option_name();
      4. 
+
    4. ~error_with_no_option_name();
      5.
    -

    -error_with_no_option_name public member functions

    +

    +error_with_no_option_name public member functions

    1. -
      virtual void set_option_name(const std::string &);
      +
      virtual void set_option_name(const std::string &);

      Does NOT set option name, because no option name makes sense

    diff --git a/doc/html/boost/program_options/error_with_option_name.html b/doc/html/boost/program_options/error_with_option_name.html index a1bc76cb6c..ad023e0929 100644 --- a/doc/html/boost/program_options/error_with_option_name.html +++ b/doc/html/boost/program_options/error_with_option_name.html @@ -36,32 +36,32 @@ class error_with_option_name : public boost::program_options::error { public: // construct/copy/destruct - error_with_option_name(const std::string &, const std::string & = "", + error_with_option_name(const std::string &, const std::string & = "", const std::string & = "", int = 0); - ~error_with_option_name(); + ~error_with_option_name(); - // public member functions - void set_substitute(const std::string &, const std::string &); - void set_substitute_default(const std::string &, const std::string &, + // public member functions + void set_substitute(const std::string &, const std::string &); + void set_substitute_default(const std::string &, const std::string &, const std::string &); - void add_context(const std::string &, const std::string &, int); - void set_prefix(int); - virtual void set_option_name(const std::string &); - std::string get_option_name() const; - void set_original_token(const std::string &); - virtual const char * what() const; + void add_context(const std::string &, const std::string &, int); + void set_prefix(int); + virtual void set_option_name(const std::string &); + std::string get_option_name() const; + void set_original_token(const std::string &); + virtual const char * what() const; - // protected member functions - virtual void substitute_placeholders(const std::string &) const; - void replace_token(const std::string &, const std::string &) const; - std::string get_canonical_option_name() const; - std::string get_canonical_option_prefix() const; + // protected member functions + virtual void substitute_placeholders(const std::string &) const; + void replace_token(const std::string &, const std::string &) const; + std::string get_canonical_option_name() const; + std::string get_canonical_option_prefix() const; // public data members std::string m_error_template; };
    -

    Description

    +

    Description

    Base class for most exceptions in the library.

    Substitutes the values for the parameter name placeholders in the template to create the human readable error message

    Placeholders are surrounded by % signs: example% Poor man's version of boost::format

    @@ -69,71 +69,71 @@

    Options are displayed in "canonical" form This is the most unambiguous form of the parsed option name and would correspond to option_description::format_name() i.e. what is shown by print_usage()

    The "canonical" form depends on whether the option is specified in short or long form, using dashes or slashes or without a prefix (from a configuration file)

    -

    +

    error_with_option_name public construct/copy/destruct

      -
    1. error_with_option_name(const std::string & template_, 
+
    2. error_with_option_name(const std::string & template_, 
                        const std::string & option_name = "", 
                        const std::string & original_token = "", 
                        int option_style = 0);
      3. 
 
    3. 
-
      ~error_with_option_name();
      
+
      ~error_with_option_name();
      
 
      gcc says that throw specification on dtor is loosened without this line 
      
 
      4.
    -

    -error_with_option_name public member functions

    +

    +error_with_option_name public member functions

    1. -
      void set_substitute(const std::string & parameter_name, 
+
      void set_substitute(const std::string & parameter_name, 
                     const std::string & value);
      
 
      Substitute parameter_name->value to create the error message from the error template
    2. -
      void set_substitute_default(const std::string & parameter_name, 
+
      void set_substitute_default(const std::string & parameter_name, 
                             const std::string & from, const std::string & to);
      
 
      If the parameter is missing, then make the from->to substitution instead
    3. -
      void add_context(const std::string & option_name, 
+
      void add_context(const std::string & option_name, 
                  const std::string & original_token, int option_style);
      
 
      Add context to an exception
      4. -
    4. void set_prefix(int option_style);
      5. +
    5. void set_prefix(int option_style);
    6. -
      virtual void set_option_name(const std::string & option_name);
      +
      virtual void set_option_name(const std::string & option_name);

      Overridden in error_with_no_option_name

      7. -
    7. std::string get_option_name() const;
      8. -
    8. void set_original_token(const std::string & original_token);
      9. +
    9. std::string get_option_name() const;
      10. +
    10. void set_original_token(const std::string & original_token);
    11. -
      virtual const char * what() const;
      +
      virtual const char * what() const;

      Creates the error_message on the fly Currently a thin wrapper for substitute_placeholders()

    -

    -error_with_option_name protected member functions

    +

    +error_with_option_name protected member functions

    1. -
      virtual void substitute_placeholders(const std::string & error_template) const;
      +
      virtual void substitute_placeholders(const std::string & error_template) const;

      Makes all substitutions using the template

      2. -
    2. void replace_token(const std::string & from, const std::string & to) const;
      3. +
    3. void replace_token(const std::string & from, const std::string & to) const;
    4. -
      std::string get_canonical_option_name() const;
      +
      std::string get_canonical_option_name() const;

      Construct option name in accordance with the appropriate prefix style: i.e. long dash or short slash etc

      5. -
    5. std::string get_canonical_option_prefix() const;
      6. +
    6. std::string get_canonical_option_prefix() const;
    -

    +

    error_with_option_name public public data members

    diff --git a/doc/html/boost/program_options/ext_parser.html b/doc/html/boost/program_options/ext_parser.html index e6192c598c..aaebaed18b 100644 --- a/doc/html/boost/program_options/ext_parser.html +++ b/doc/html/boost/program_options/ext_parser.html @@ -35,8 +35,8 @@ typedef function1< std::pair< std::string, std::string >, const std::string & > ext_parser;
    -

    Description

    -

    Augments basic_parsed_options<wchar_t> with conversion from 'parsed_options'

    +

    Description

    +

    Augments basic_parsed_options<wchar_t> with conversion from 'parsed_options'

    diff --git a/doc/html/boost/program_options/invalid__idm45507161390480.html b/doc/html/boost/program_options/invalid__idm45507161390480.html new file mode 100644 index 0000000000..cfa53f8479 --- /dev/null +++ b/doc/html/boost/program_options/invalid__idm45507161390480.html @@ -0,0 +1,75 @@ + + + + +Class invalid_command_line_syntax + + + + + + + + +
    + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Class invalid_command_line_syntax

    +

    boost::program_options::invalid_command_line_syntax

    +
    +

    Synopsis

    +
    // In header: <boost/program_options/errors.hpp>
+
+
+class invalid_command_line_syntax :
+  public boost::program_options::invalid_syntax
+{
+public:
+  // construct/copy/destruct
+  invalid_command_line_syntax(kind_t, const std::string & = "", 
+                              const std::string & = "", int = 0);
+  ~invalid_command_line_syntax();
+};
    +
    +

    Description

    +

    Class thrown when there are syntax errors in given command line

    +
    +

    +invalid_command_line_syntax + public + construct/copy/destruct

    +
      +
    1. invalid_command_line_syntax(kind_t kind, const std::string & option_name = "", 
+                            const std::string & original_token = "", 
+                            int option_style = 0);
      2. +
    2. ~invalid_command_line_syntax();
      3. +
    +
    +
    +
    + + + +
    Copyright © 2002-2004 Vladimir Prus

    Distributed under the Boost Software License, Version 1.0. + (See accompanying file LICENSE_1_0.txt or copy at + http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/program_options/invalid_bool_value.html b/doc/html/boost/program_options/invalid_bool_value.html index ab16319655..9eb312c6e7 100644 --- a/doc/html/boost/program_options/invalid_bool_value.html +++ b/doc/html/boost/program_options/invalid_bool_value.html @@ -36,17 +36,17 @@ class invalid_bool_value : public boost::program_options::validation_error { public: // construct/copy/destruct - invalid_bool_value(const std::string &); + invalid_bool_value(const std::string &); };
    -

    Description

    +

    Description

    Class thrown if there is an invalid bool value given

    -

    +

    invalid_bool_value public construct/copy/destruct

    -
    1. invalid_bool_value(const std::string & value);
    +
    1. invalid_bool_value(const std::string & value);
    diff --git a/doc/html/boost/program_options/invalid_comma_idp163674448.html b/doc/html/boost/program_options/invalid_comma_idp163674448.html deleted file mode 100644 index 366b442eb3..0000000000 --- a/doc/html/boost/program_options/invalid_comma_idp163674448.html +++ /dev/null @@ -1,75 +0,0 @@ - - - - -Class invalid_command_line_syntax - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Class invalid_command_line_syntax

    -

    boost::program_options::invalid_command_line_syntax

    -
    -

    Synopsis

    -
    // In header: <boost/program_options/errors.hpp>
-
-
-class invalid_command_line_syntax :
-  public boost::program_options::invalid_syntax
-{
-public:
-  // construct/copy/destruct
-  invalid_command_line_syntax(kind_t, const std::string & = "", 
-                              const std::string & = "", int = 0);
-  ~invalid_command_line_syntax();
-};
    -
    -

    Description

    -

    Class thrown when there are syntax errors in given command line

    -
    -

    -invalid_command_line_syntax - public - construct/copy/destruct

    -
      -
    1. invalid_command_line_syntax(kind_t kind, const std::string & option_name = "", 
-                            const std::string & original_token = "", 
-                            int option_style = 0);
      2. -
    2. ~invalid_command_line_syntax();
      3. -
    -
    -
    -
    - - - -
    Copyright © 2002-2004 Vladimir Prus

    Distributed under the Boost Software License, Version 1.0. - (See accompanying file LICENSE_1_0.txt or copy at - http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/program_options/invalid_command_line_style.html b/doc/html/boost/program_options/invalid_command_line_style.html index ff4e1bd019..b039cb0e0e 100644 --- a/doc/html/boost/program_options/invalid_command_line_style.html +++ b/doc/html/boost/program_options/invalid_command_line_style.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -36,17 +36,17 @@ class invalid_command_line_style : public boost::program_options::error { public: // construct/copy/destruct - invalid_command_line_style(const std::string &); + invalid_command_line_style(const std::string &); };
    -

    Description

    +

    Description

    Class thrown when there are programming error related to style

    -

    +

    invalid_command_line_style public construct/copy/destruct

    -
    1. invalid_command_line_style(const std::string & msg);
    +
    1. invalid_command_line_style(const std::string & msg);
    @@ -60,7 +60,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/program_options/invalid_config_file_syntax.html b/doc/html/boost/program_options/invalid_config_file_syntax.html index a78fb715ea..95d7612513 100644 --- a/doc/html/boost/program_options/invalid_config_file_syntax.html +++ b/doc/html/boost/program_options/invalid_config_file_syntax.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -38,29 +38,29 @@ { public: // construct/copy/destruct - invalid_config_file_syntax(const std::string &, kind_t); - ~invalid_config_file_syntax(); + invalid_config_file_syntax(const std::string &, kind_t); + ~invalid_config_file_syntax(); - // public member functions - virtual std::string tokens() const; + // public member functions + virtual std::string tokens() const; };
    -

    Description

    +

    Description

    -

    +

    invalid_config_file_syntax public construct/copy/destruct

      -
    1. invalid_config_file_syntax(const std::string & invalid_line, kind_t kind);
      2. -
    2. ~invalid_config_file_syntax();
      3. +
    3. invalid_config_file_syntax(const std::string & invalid_line, kind_t kind);
      4. +
    4. ~invalid_config_file_syntax();
    -

    -invalid_config_file_syntax public member functions

    +

    +invalid_config_file_syntax public member functions

    1. -
      virtual std::string tokens() const;
      +
      virtual std::string tokens() const;

      Convenience functions for backwards compatibility

    @@ -76,7 +76,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/program_options/invalid_option_value.html b/doc/html/boost/program_options/invalid_option_value.html index fc80c6ea1e..00ad7bf099 100644 --- a/doc/html/boost/program_options/invalid_option_value.html +++ b/doc/html/boost/program_options/invalid_option_value.html @@ -36,20 +36,20 @@ class invalid_option_value : public boost::program_options::validation_error { public: // construct/copy/destruct - invalid_option_value(const std::string &); - invalid_option_value(const std::wstring &); + invalid_option_value(const std::string &); + invalid_option_value(const std::wstring &); };
    -

    Description

    +

    Description

    Class thrown if there is an invalid option value given

    -

    +

    invalid_option_value public construct/copy/destruct

      -
    1. invalid_option_value(const std::string & value);
      2. -
    2. invalid_option_value(const std::wstring & value);
      3. +
    3. invalid_option_value(const std::string & value);
      4. +
    4. invalid_option_value(const std::wstring & value);
    diff --git a/doc/html/boost/program_options/invalid_syntax.html b/doc/html/boost/program_options/invalid_syntax.html index d0fdb9f7cb..1dba9ca4af 100644 --- a/doc/html/boost/program_options/invalid_syntax.html +++ b/doc/html/boost/program_options/invalid_syntax.html @@ -40,47 +40,47 @@ short_adjacent_not_allowed, empty_adjacent_parameter, missing_parameter, extra_parameter, unrecognized_line }; // construct/copy/destruct - invalid_syntax(kind_t, const std::string & = "", const std::string & = "", + invalid_syntax(kind_t, const std::string & = "", const std::string & = "", int = 0); - ~invalid_syntax(); + ~invalid_syntax(); - // public member functions - kind_t kind() const; - virtual std::string tokens() const; + // public member functions + kind_t kind() const; + virtual std::string tokens() const; - // protected member functions - std::string get_template(kind_t); + // protected member functions + std::string get_template(kind_t); };
    -

    Description

    +

    Description

    Class thrown when there's syntax error either for command line or config file options. See derived children for concrete classes.

    -

    +

    invalid_syntax public construct/copy/destruct

      -
    1. invalid_syntax(kind_t kind, const std::string & option_name = "", 
+
    2. invalid_syntax(kind_t kind, const std::string & option_name = "", 
                const std::string & original_token = "", int option_style = 0);
      3. 
-
    3. ~invalid_syntax();
      4. 
+
    4. ~invalid_syntax();
      5.
    -

    -invalid_syntax public member functions

    +

    +invalid_syntax public member functions

      -
    1. kind_t kind() const;
      2. +
    2. kind_t kind() const;
    3. -
      virtual std::string tokens() const;
      +
      virtual std::string tokens() const;

      Convenience functions for backwards compatibility

    -

    -invalid_syntax protected member functions

    +

    +invalid_syntax protected member functions

    1. -
      std::string get_template(kind_t kind);
      +
      std::string get_template(kind_t kind);

      Used to convert kind_t to a related error text

    diff --git a/doc/html/boost/program_options/multiple_occurrences.html b/doc/html/boost/program_options/multiple_occurrences.html index 2d95efbdec..d447c2c1f6 100644 --- a/doc/html/boost/program_options/multiple_occurrences.html +++ b/doc/html/boost/program_options/multiple_occurrences.html @@ -38,20 +38,20 @@ { public: // construct/copy/destruct - multiple_occurrences(); - ~multiple_occurrences(); + multiple_occurrences(); + ~multiple_occurrences(); };
    -

    Description

    +

    Description

    Class thrown when there are several occurrences of an option, but user called a method which cannot return them all.

    -

    +

    multiple_occurrences public construct/copy/destruct

      -
    1. multiple_occurrences();
      2. -
    2. ~multiple_occurrences();
      3. +
    3. multiple_occurrences();
      4. +
    4. ~multiple_occurrences();
    diff --git a/doc/html/boost/program_options/multiple_values.html b/doc/html/boost/program_options/multiple_values.html index 4d189e1425..122a607963 100644 --- a/doc/html/boost/program_options/multiple_values.html +++ b/doc/html/boost/program_options/multiple_values.html @@ -36,20 +36,20 @@ class multiple_values : public boost::program_options::error_with_option_name { public: // construct/copy/destruct - multiple_values(); - ~multiple_values(); + multiple_values(); + ~multiple_values(); };
    -

    Description

    +

    Description

    Class thrown when there are several option values, but user called a method which cannot return them all.

    -

    +

    multiple_values public construct/copy/destruct

      -
    1. multiple_values();
      2. -
    2. ~multiple_values();
      3. +
    3. multiple_values();
      4. +
    4. ~multiple_values();
    diff --git a/doc/html/boost/program_options/notify.html b/doc/html/boost/program_options/notify.html index 25ca6abc57..b843fbaafb 100644 --- a/doc/html/boost/program_options/notify.html +++ b/doc/html/boost/program_options/notify.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -35,7 +35,7 @@ BOOST_PROGRAM_OPTIONS_DECL void notify(variables_map & m);
    -

    Description

    +

    Description

    Runs all 'notify' function for options in 'm'.

    @@ -49,7 +49,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/program_options/option_description.html b/doc/html/boost/program_options/option_description.html index c171959237..6d3c978fc8 100644 --- a/doc/html/boost/program_options/option_description.html +++ b/doc/html/boost/program_options/option_description.html @@ -38,40 +38,40 @@ enum match_result { no_match, full_match, approximate_match }; // construct/copy/destruct - option_description(); - option_description(const char *, const value_semantic *); - option_description(const char *, const value_semantic *, const char *); - ~option_description(); + option_description(); + option_description(const char *, const value_semantic *); + option_description(const char *, const value_semantic *, const char *); + ~option_description(); - // public member functions - match_result match(const std::string &, bool, bool, bool) const; - const std::string & key(const std::string &) const; - std::string canonical_display_name(int = 0) const; - const std::string & long_name() const; - const std::string & description() const; - shared_ptr< const value_semantic > semantic() const; - std::string format_name() const; - std::string format_parameter() const; + // public member functions + match_result match(const std::string &, bool, bool, bool) const; + const std::string & key(const std::string &) const; + std::string canonical_display_name(int = 0) const; + const std::string & long_name() const; + const std::string & description() const; + shared_ptr< const value_semantic > semantic() const; + std::string format_name() const; + std::string format_parameter() const; - // private member functions - option_description & set_name(const char *); + // private member functions + option_description & set_name(const char *); };
    -

    Description

    +

    Description

    Describes one possible command line/config file option. There are two kinds of properties of an option. First describe it syntactically and are used only to validate input. Second affect interpretation of the option, for example default value for it or function that should be called when the value is finally known. Routines which perform parsing never use second kind of properties -- they are side effect free.

    See Also:

    options_description

    -

    +

    option_description public construct/copy/destruct

      -
    1. option_description();
      2. +
    2. option_description();
    3. -
      option_description(const char * name, const value_semantic * s);
      +
      option_description(const char * name, const value_semantic * s);

      Initializes the object with the passed data.

      Note: it would be nice to make the second parameter auto_ptr, to explicitly pass ownership. Unfortunately, it's often needed to create objects of types derived from 'value_semantic': options_description d; d.add_options()("a", parameter<int>("n")->default_value(1)); Here, the static type returned by 'parameter' should be derived from value_semantic.

      Alas, derived->base conversion for auto_ptr does not really work, see http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2000/n1232.pdf http://www.open-std.org/jtc1/sc22/wg21/docs/cwg_defects.html#84

      @@ -85,48 +85,48 @@

    4. -
      option_description(const char * name, const value_semantic * s, 
+
      option_description(const char * name, const value_semantic * s, 
                    const char * description);
      
 
      Initializes the class with the passed data.
      5. -
    5. ~option_description();
      6. +
    6. ~option_description();
    -

    -option_description public member functions

    +

    +option_description public member functions

    1. match_result 
-match(const std::string & option, bool approx, bool long_ignore_case, 
+match(const std::string & option, bool approx, bool long_ignore_case, 
       bool short_ignore_case) const;

      Given 'option', specified in the input source, returns 'true' if 'option' specifies *this.

    2. -
      const std::string & key(const std::string & option) const;
      +
      const std::string & key(const std::string & option) const;

      Returns the key that should identify the option, in particular in the variables_map class. The 'option' parameter is the option spelling from the input source. If option name contains '*', returns 'option'. If long name was specified, it's the long name, otherwise it's a short name with prepended '-'.

    3. -
      std::string canonical_display_name(int canonical_option_style = 0) const;
      +
      std::string canonical_display_name(int canonical_option_style = 0) const;

      Returns the canonical name for the option description to enable the user to recognised a matching option. 1) For short options ('-', '/'), returns the short name prefixed. 2) For long options ('<ndash></ndash>' / '-') returns the long name prefixed 3) All other cases, returns the long name (if present) or the short name, unprefixed.

      4. -
    4. const std::string & long_name() const;
      5. +
    5. const std::string & long_name() const;
    6. -
      const std::string & description() const;
      Explanation of this option.
      7. +
      const std::string & description() const;
      Explanation of this option.
    7. -
      shared_ptr< const value_semantic > semantic() const;
      Semantic of option's value.
      8. +
      shared_ptr< const value_semantic > semantic() const;
      Semantic of option's value.
    8. -
      std::string format_name() const;
      Returns the option name, formatted suitably for usage message.
      9. +
      std::string format_name() const;
      Returns the option name, formatted suitably for usage message.
    9. -
      std::string format_parameter() const;
      +
      std::string format_parameter() const;

      Returns the parameter name and properties, formatted suitably for usage message.

    -

    -option_description private member functions

    -
    1. option_description & set_name(const char * name);
    +

    +option_description private member functions

    +
    1. option_description & set_name(const char * name);
    diff --git a/doc/html/boost/program_options/options__idm45506977779488.html b/doc/html/boost/program_options/options__idm45506977779488.html new file mode 100644 index 0000000000..0039d0f443 --- /dev/null +++ b/doc/html/boost/program_options/options__idm45506977779488.html @@ -0,0 +1,86 @@ + + + + +Class options_description_easy_init + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Class options_description_easy_init

    +

    boost::program_options::options_description_easy_init

    +
    +

    Synopsis

    +
    // In header: <boost/program_options/options_description.hpp>
+
+
+class options_description_easy_init {
+public:
+  // construct/copy/destruct
+  options_description_easy_init(options_description *);
+
+  // public member functions
+  options_description_easy_init & operator()(const char *, const char *);
+  options_description_easy_init & 
+  operator()(const char *, const value_semantic *);
+  options_description_easy_init & 
+  operator()(const char *, const value_semantic *, const char *);
+};
    +
    +

    Description

    +

    Class which provides convenient creation syntax to option_description.

    +
    +

    +options_description_easy_init + public + construct/copy/destruct

    +
    1. options_description_easy_init(options_description * owner);
    +
    +
    +

    +options_description_easy_init public member functions

    +
      +
    1. options_description_easy_init & 
+operator()(const char * name, const char * description);
      2. +
    2. options_description_easy_init & 
+operator()(const char * name, const value_semantic * s);
      3. +
    3. options_description_easy_init & 
+operator()(const char * name, const value_semantic * s, 
+           const char * description);
      4. +
    +
    +
    +
    + + + +
    Copyright © 2002-2004 Vladimir Prus

    Distributed under the Boost Software License, Version 1.0. + (See accompanying file LICENSE_1_0.txt or copy at + http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/program_options/options_descr_idp214375408.html b/doc/html/boost/program_options/options_descr_idp214375408.html deleted file mode 100644 index a13fbb25c5..0000000000 --- a/doc/html/boost/program_options/options_descr_idp214375408.html +++ /dev/null @@ -1,86 +0,0 @@ - - - - -Class options_description_easy_init - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Class options_description_easy_init

    -

    boost::program_options::options_description_easy_init

    -
    -

    Synopsis

    -
    // In header: <boost/program_options/options_description.hpp>
-
-
-class options_description_easy_init {
-public:
-  // construct/copy/destruct
-  options_description_easy_init(options_description *);
-
-  // public member functions
-  options_description_easy_init & operator()(const char *, const char *);
-  options_description_easy_init & 
-  operator()(const char *, const value_semantic *);
-  options_description_easy_init & 
-  operator()(const char *, const value_semantic *, const char *);
-};
    -
    -

    Description

    -

    Class which provides convenient creation syntax to option_description.

    -
    -

    -options_description_easy_init - public - construct/copy/destruct

    -
    1. options_description_easy_init(options_description * owner);
    -
    -
    -

    -options_description_easy_init public member functions

    -
      -
    1. options_description_easy_init & 
-operator()(const char * name, const char * description);
      2. -
    2. options_description_easy_init & 
-operator()(const char * name, const value_semantic * s);
      3. -
    3. options_description_easy_init & 
-operator()(const char * name, const value_semantic * s, 
-           const char * description);
      4. -
    -
    -
    -
    - - - -
    Copyright © 2002-2004 Vladimir Prus

    Distributed under the Boost Software License, Version 1.0. - (See accompanying file LICENSE_1_0.txt or copy at - http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/program_options/options_description.html b/doc/html/boost/program_options/options_description.html index 17837d3f30..1bfbb3722c 100644 --- a/doc/html/boost/program_options/options_description.html +++ b/doc/html/boost/program_options/options_description.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -36,32 +36,32 @@ class options_description { public: // construct/copy/destruct - options_description(unsigned = m_default_line_length, + options_description(unsigned = m_default_line_length, unsigned = m_default_line_length/2); - options_description(const std::string &, unsigned = m_default_line_length, + options_description(const std::string &, unsigned = m_default_line_length, unsigned = m_default_line_length/2); - // public member functions - void add(shared_ptr< option_description >); - options_description & add(const options_description &); - unsigned get_option_column_width() const; - options_description_easy_init add_options(); + // public member functions + void add(shared_ptr< option_description >); + options_description & add(const options_description &); + unsigned get_option_column_width() const; + options_description_easy_init add_options(); const option_description & - find(const std::string &, bool, bool = false, bool = false) const; + find(const std::string &, bool, bool = false, bool = false) const; const option_description * - find_nothrow(const std::string &, bool, bool = false, bool = false) const; - const std::vector< shared_ptr< option_description > > & options() const; - void print(std::ostream &, unsigned = 0) const; + find_nothrow(const std::string &, bool, bool = false, bool = false) const; + const std::vector< shared_ptr< option_description > > & options() const; + void print(std::ostream &, unsigned = 0) const; - // friend functions + // friend functions friend BOOST_PROGRAM_OPTIONS_DECL std::ostream & - operator<<(std::ostream &, const options_description &); + operator<<(std::ostream &, const options_description &); // public data members static const unsigned m_default_line_length; };
    -

    Description

    +

    Description

    A set of option descriptions. This provides convenient interface for adding new option (the add_options) method, and facilities to search for options by name.

    See here for option adding interface discussion.

    See Also:

    @@ -69,18 +69,18 @@

    -

    +

    options_description public construct/copy/destruct

    1. -
      options_description(unsigned line_length = m_default_line_length, 
+
      options_description(unsigned line_length = m_default_line_length, 
                     unsigned min_description_length = m_default_line_length/2);
      
 
      Creates the instance.
    2. -
      options_description(const std::string & caption, 
+
      options_description(const std::string & caption, 
                     unsigned line_length = m_default_line_length, 
                     unsigned min_description_length = m_default_line_length/2);
      
 
      Creates the instance. The 'caption' parameter gives the name of this 'options_description' instance. Primarily useful for output. The 'description_length' specifies the number of columns that should be reserved for the description text; if the option text encroaches into this, then the description will start on the next line. 
      
@@ -88,44 +88,44 @@
    -

    -options_description public member functions

    +

    +options_description public member functions

    1. -
      void add(shared_ptr< option_description > desc);
      +
      void add(shared_ptr< option_description > desc);

      Adds new variable description. Throws duplicate_variable_error if either short or long name matches that of already present one.

    2. -
      options_description & add(const options_description & desc);
      +
      options_description & add(const options_description & desc);

      Adds a group of option description. This has the same effect as adding all option_descriptions in 'desc' individually, except that output operator will show a separate group. Returns *this.

    3. -
      unsigned get_option_column_width() const;
      +
      unsigned get_option_column_width() const;

      Find the maximum width of the option column, including options in groups.

    4. -
      options_description_easy_init add_options();
      +
      options_description_easy_init add_options();

      Returns an object of implementation-defined type suitable for adding options to options_description. The returned object will have overloaded operator() with parameter type matching 'option_description' constructors. Calling the operator will create new option_description instance and add it. 

    5. const option_description & 
-find(const std::string & name, bool approx, bool long_ignore_case = false, 
+find(const std::string & name, bool approx, bool long_ignore_case = false, 
      bool short_ignore_case = false) const;
    6. const option_description * 
-find_nothrow(const std::string & name, bool approx, 
+find_nothrow(const std::string & name, bool approx, 
              bool long_ignore_case = false, bool short_ignore_case = false) const;
      7. -
    7. const std::vector< shared_ptr< option_description > > & options() const;
      8. +
    8. const std::vector< shared_ptr< option_description > > & options() const;
    9. -
      void print(std::ostream & os, unsigned width = 0) const;
      +
      void print(std::ostream & os, unsigned width = 0) const;

      Outputs 'desc' to the specified stream, calling 'f' to output each option_description element.

    -

    -options_description friend functions

    +

    +options_description friend functions

    1. friend BOOST_PROGRAM_OPTIONS_DECL std::ostream & 
-operator<<(std::ostream & os, const options_description & desc);
      +operator<<(std::ostream & os, const options_description & desc);

      Produces a human readable output of 'desc', listing options, their descriptions and allowed parameters. Other options_description instances previously passed to add will be output separately.

    @@ -141,7 +141,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/program_options/parse_co_idm45507043055104.html b/doc/html/boost/program_options/parse_co_idm45507043055104.html new file mode 100644 index 0000000000..0f055c998e --- /dev/null +++ b/doc/html/boost/program_options/parse_co_idm45507043055104.html @@ -0,0 +1,59 @@ + + + + +Function template parse_config_file + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template parse_config_file

    +

    boost::program_options::parse_config_file

    +
    +

    Synopsis

    +
    // In header: <boost/program_options/parsers.hpp>
+
+
+template<typename charT> 
+  BOOST_PROGRAM_OPTIONS_DECL basic_parsed_options< charT > 
+  parse_config_file(const char * filename, const options_description &, 
+                    bool allow_unregistered = false);
    +
    +

    Description

    +

    Parse a config file.

    +

    Read from file with the given name. The character type is passed to the file stream.

    +
    +
    + + + +
    Copyright © 2002-2004 Vladimir Prus

    Distributed under the Boost Software License, Version 1.0. + (See accompanying file LICENSE_1_0.txt or copy at + http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/program_options/parse_co_idm45507106389456.html b/doc/html/boost/program_options/parse_co_idm45507106389456.html new file mode 100644 index 0000000000..2fc8289dbc --- /dev/null +++ b/doc/html/boost/program_options/parse_co_idm45507106389456.html @@ -0,0 +1,60 @@ + + + + +Function template parse_config_file + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template parse_config_file

    +

    boost::program_options::parse_config_file

    +
    +

    Synopsis

    +
    // In header: <boost/program_options/parsers.hpp>
+
+
+template<typename charT> 
+  BOOST_PROGRAM_OPTIONS_DECL basic_parsed_options< charT > 
+  parse_config_file(std::basic_istream< charT > &, 
+                    const options_description &, 
+                    bool allow_unregistered = false);
    +
    +

    Description

    +

    Parse a config file.

    +

    Read from given stream.

    +
    +
    + + + +
    Copyright © 2002-2004 Vladimir Prus

    Distributed under the Boost Software License, Version 1.0. + (See accompanying file LICENSE_1_0.txt or copy at + http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/program_options/parse_command_line.html b/doc/html/boost/program_options/parse_command_line.html index 1ec6a7a956..7fab825d47 100644 --- a/doc/html/boost/program_options/parse_command_line.html +++ b/doc/html/boost/program_options/parse_command_line.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -34,12 +34,12 @@ template<typename charT> - basic_parsed_options< charT > + basic_parsed_options< charT > parse_command_line(int argc, const charT *const argv, const options_description &, int style = 0, function1< std::pair< std::string, std::string >, const std::string & > ext = ext_parser());
    -

    Description

    +

    Description

    Creates instance of 'command_line_parser', passes parameters to it, and returns the result of calling the 'run' method.

    @@ -53,7 +53,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/program_options/parse_config__idp203490384.html b/doc/html/boost/program_options/parse_config__idp203490384.html deleted file mode 100644 index 6304ca5817..0000000000 --- a/doc/html/boost/program_options/parse_config__idp203490384.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Function template parse_config_file - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template parse_config_file

    -

    boost::program_options::parse_config_file

    -
    -

    Synopsis

    -
    // In header: <boost/program_options/parsers.hpp>
-
-
-template<typename charT> 
-  BOOST_PROGRAM_OPTIONS_DECL basic_parsed_options< charT > 
-  parse_config_file(const char * filename, const options_description &, 
-                    bool allow_unregistered = false);
    -
    -

    Description

    -

    Parse a config file.

    -

    Read from file with the given name. The character type is passed to the file stream.

    -
    -
    - - - -
    Copyright © 2002-2004 Vladimir Prus

    Distributed under the Boost Software License, Version 1.0. - (See accompanying file LICENSE_1_0.txt or copy at - http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/program_options/parse_config__idp206025792.html b/doc/html/boost/program_options/parse_config__idp206025792.html deleted file mode 100644 index ceb87b18b1..0000000000 --- a/doc/html/boost/program_options/parse_config__idp206025792.html +++ /dev/null @@ -1,60 +0,0 @@ - - - - -Function template parse_config_file - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template parse_config_file

    -

    boost::program_options::parse_config_file

    -
    -

    Synopsis

    -
    // In header: <boost/program_options/parsers.hpp>
-
-
-template<typename charT> 
-  BOOST_PROGRAM_OPTIONS_DECL basic_parsed_options< charT > 
-  parse_config_file(std::basic_istream< charT > &, 
-                    const options_description &, 
-                    bool allow_unregistered = false);
    -
    -

    Description

    -

    Parse a config file.

    -

    Read from given stream.

    -
    -
    - - - -
    Copyright © 2002-2004 Vladimir Prus

    Distributed under the Boost Software License, Version 1.0. - (See accompanying file LICENSE_1_0.txt or copy at - http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/program_options/parse_en_idm45506972428912.html b/doc/html/boost/program_options/parse_en_idm45506972428912.html new file mode 100644 index 0000000000..d9ce2a7cc0 --- /dev/null +++ b/doc/html/boost/program_options/parse_en_idm45506972428912.html @@ -0,0 +1,59 @@ + + + + +Function parse_environment + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function parse_environment

    +

    boost::program_options::parse_environment

    +
    +

    Synopsis

    +
    // In header: <boost/program_options/parsers.hpp>
+
+
+BOOST_PROGRAM_OPTIONS_DECL parsed_options 
+parse_environment(const options_description &, 
+                  const function1< std::string, std::string > & name_mapper);
    +
    +

    Description

    +

    Parse environment.

    +

    For each environment variable, the 'name_mapper' function is called to obtain the option name. If it returns empty string, the variable is ignored.

    +

    This is done since naming of environment variables is typically different from the naming of command line options.

    +
    +
    + + + +
    Copyright © 2002-2004 Vladimir Prus

    Distributed under the Boost Software License, Version 1.0. + (See accompanying file LICENSE_1_0.txt or copy at + http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/program_options/parse_en_idm45506995617728.html b/doc/html/boost/program_options/parse_en_idm45506995617728.html new file mode 100644 index 0000000000..ff6161a198 --- /dev/null +++ b/doc/html/boost/program_options/parse_en_idm45506995617728.html @@ -0,0 +1,56 @@ + + + + +Function parse_environment + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function parse_environment

    +

    boost::program_options::parse_environment

    +
    +

    Synopsis

    +
    // In header: <boost/program_options/parsers.hpp>
+
+
+BOOST_PROGRAM_OPTIONS_DECL parsed_options 
+parse_environment(const options_description &, const char * prefix);
    +
    +

    Description

    +

    This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. This function exists to resolve ambiguity between the two above functions when second argument is of 'char*' type. There's implicit conversion to both function1 and string.

    +
    +
    + + + +
    Copyright © 2002-2004 Vladimir Prus

    Distributed under the Boost Software License, Version 1.0. + (See accompanying file LICENSE_1_0.txt or copy at + http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/program_options/parse_en_idm45507039007472.html b/doc/html/boost/program_options/parse_en_idm45507039007472.html new file mode 100644 index 0000000000..78ed06b1b1 --- /dev/null +++ b/doc/html/boost/program_options/parse_en_idm45507039007472.html @@ -0,0 +1,57 @@ + + + + +Function parse_environment + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function parse_environment

    +

    boost::program_options::parse_environment

    +
    +

    Synopsis

    +
    // In header: <boost/program_options/parsers.hpp>
+
+
+BOOST_PROGRAM_OPTIONS_DECL parsed_options 
+parse_environment(const options_description &, const std::string & prefix);
    +
    +

    Description

    +

    Parse environment.

    +

    Takes all environment variables which start with 'prefix'. The option name is obtained from variable name by removing the prefix and converting the remaining string into lower case.

    +
    +
    + + + +
    Copyright © 2002-2004 Vladimir Prus

    Distributed under the Boost Software License, Version 1.0. + (See accompanying file LICENSE_1_0.txt or copy at + http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/program_options/parse_environ_idp154393360.html b/doc/html/boost/program_options/parse_environ_idp154393360.html deleted file mode 100644 index f59bd6c8bb..0000000000 --- a/doc/html/boost/program_options/parse_environ_idp154393360.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function parse_environment - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function parse_environment

    -

    boost::program_options::parse_environment

    -
    -

    Synopsis

    -
    // In header: <boost/program_options/parsers.hpp>
-
-
-BOOST_PROGRAM_OPTIONS_DECL parsed_options 
-parse_environment(const options_description &, const std::string & prefix);
    -
    -

    Description

    -

    Parse environment.

    -

    Takes all environment variables which start with 'prefix'. The option name is obtained from variable name by removing the prefix and converting the remaining string into lower case.

    -
    -
    - - - -
    Copyright © 2002-2004 Vladimir Prus

    Distributed under the Boost Software License, Version 1.0. - (See accompanying file LICENSE_1_0.txt or copy at - http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/program_options/parse_environ_idp224270416.html b/doc/html/boost/program_options/parse_environ_idp224270416.html deleted file mode 100644 index 1e76a783b2..0000000000 --- a/doc/html/boost/program_options/parse_environ_idp224270416.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Function parse_environment - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function parse_environment

    -

    boost::program_options::parse_environment

    -
    -

    Synopsis

    -
    // In header: <boost/program_options/parsers.hpp>
-
-
-BOOST_PROGRAM_OPTIONS_DECL parsed_options 
-parse_environment(const options_description &, 
-                  const function1< std::string, std::string > & name_mapper);
    -
    -

    Description

    -

    Parse environment.

    -

    For each environment variable, the 'name_mapper' function is called to obtain the option name. If it returns empty string, the variable is ignored.

    -

    This is done since naming of environment variables is typically different from the naming of command line options.

    -
    -
    - - - -
    Copyright © 2002-2004 Vladimir Prus

    Distributed under the Boost Software License, Version 1.0. - (See accompanying file LICENSE_1_0.txt or copy at - http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/program_options/parse_environm_idp75334496.html b/doc/html/boost/program_options/parse_environm_idp75334496.html deleted file mode 100644 index 3ce38ebfee..0000000000 --- a/doc/html/boost/program_options/parse_environm_idp75334496.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Function parse_environment - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function parse_environment

    -

    boost::program_options::parse_environment

    -
    -

    Synopsis

    -
    // In header: <boost/program_options/parsers.hpp>
-
-
-BOOST_PROGRAM_OPTIONS_DECL parsed_options 
-parse_environment(const options_description &, const char * prefix);
    -
    -

    Description

    -

    This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. This function exists to resolve ambiguity between the two above functions when second argument is of 'char*' type. There's implicit conversion to both function1 and string.

    -
    -
    - - - -
    Copyright © 2002-2004 Vladimir Prus

    Distributed under the Boost Software License, Version 1.0. - (See accompanying file LICENSE_1_0.txt or copy at - http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/program_options/position_idm45507094291136.html b/doc/html/boost/program_options/position_idm45507094291136.html new file mode 100644 index 0000000000..053d78f4a1 --- /dev/null +++ b/doc/html/boost/program_options/position_idm45507094291136.html @@ -0,0 +1,92 @@ + + + + +Class positional_options_description + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Class positional_options_description

    +

    boost::program_options::positional_options_description

    +
    +

    Synopsis

    +
    // In header: <boost/program_options/positional_options.hpp>
+
+
+class positional_options_description {
+public:
+  // construct/copy/destruct
+  positional_options_description();
+
+  // public member functions
+  positional_options_description & add(const char *, int);
+  unsigned max_total_count() const;
+  const std::string & name_for_position(unsigned) const;
+};
    +
    +

    Description

    +

    Describes positional options.

    +

    The class allows to guess option names for positional options, which are specified on the command line and are identified by the position. The class uses the information provided by the user to associate a name with every positional option, or tell that no name is known.

    +

    The primary assumption is that only the relative order of the positional options themselves matters, and that any interleaving ordinary options don't affect interpretation of positional options.

    +

    The user initializes the class by specifying that first N positional options should be given the name X1, following M options should be given the name X2 and so on.

    +
    +

    +positional_options_description + public + construct/copy/destruct

    +
    1. positional_options_description();
    +
    +
    +

    +positional_options_description public member functions

    +
      +
    1. +
      positional_options_description & add(const char * name, int max_count);
      +

      Species that up to 'max_count' next positional options should be given the 'name'. The value of '-1' means 'unlimited'. No calls to 'add' can be made after call with 'max_value' equal to '-1'.

      +
      2. +
    2. +
      unsigned max_total_count() const;
      +

      Returns the maximum number of positional options that can be present. Can return (numeric_limits<unsigned>::max)() to indicate unlimited number.

      +
      3. +
    3. +
      const std::string & name_for_position(unsigned position) const;
      +

      Returns the name that should be associated with positional options at 'position'. Precondition: position < max_total_count()

      +
      4. +
    +
    +
    +
    + + + +
    Copyright © 2002-2004 Vladimir Prus

    Distributed under the Boost Software License, Version 1.0. + (See accompanying file LICENSE_1_0.txt or copy at + http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/program_options/positional_op_idp150873344.html b/doc/html/boost/program_options/positional_op_idp150873344.html deleted file mode 100644 index c180d2cc11..0000000000 --- a/doc/html/boost/program_options/positional_op_idp150873344.html +++ /dev/null @@ -1,92 +0,0 @@ - - - - -Class positional_options_description - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Class positional_options_description

    -

    boost::program_options::positional_options_description

    -
    -

    Synopsis

    -
    // In header: <boost/program_options/positional_options.hpp>
-
-
-class positional_options_description {
-public:
-  // construct/copy/destruct
-  positional_options_description();
-
-  // public member functions
-  positional_options_description & add(const char *, int);
-  unsigned max_total_count() const;
-  const std::string & name_for_position(unsigned) const;
-};
    -
    -

    Description

    -

    Describes positional options.

    -

    The class allows to guess option names for positional options, which are specified on the command line and are identified by the position. The class uses the information provided by the user to associate a name with every positional option, or tell that no name is known.

    -

    The primary assumption is that only the relative order of the positional options themselves matters, and that any interleaving ordinary options don't affect interpretation of positional options.

    -

    The user initializes the class by specifying that first N positional options should be given the name X1, following M options should be given the name X2 and so on.

    -
    -

    -positional_options_description - public - construct/copy/destruct

    -
    1. positional_options_description();
    -
    -
    -

    -positional_options_description public member functions

    -
      -
    1. -
      positional_options_description & add(const char * name, int max_count);
      -

      Species that up to 'max_count' next positional options should be given the 'name'. The value of '-1' means 'unlimited'. No calls to 'add' can be made after call with 'max_value' equal to '-1'.

      -
      2. -
    2. -
      unsigned max_total_count() const;
      -

      Returns the maximum number of positional options that can be present. Can return (numeric_limits<unsigned>::max)() to indicate unlimited number.

      -
      3. -
    3. -
      const std::string & name_for_position(unsigned position) const;
      -

      Returns the name that should be associated with positional options at 'position'. Precondition: position < max_total_count()

      -
      4. -
    -
    -
    -
    - - - -
    Copyright © 2002-2004 Vladimir Prus

    Distributed under the Boost Software License, Version 1.0. - (See accompanying file LICENSE_1_0.txt or copy at - http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/program_options/reading_file.html b/doc/html/boost/program_options/reading_file.html index 917ecaf569..3f9b526010 100644 --- a/doc/html/boost/program_options/reading_file.html +++ b/doc/html/boost/program_options/reading_file.html @@ -36,17 +36,17 @@ class reading_file : public boost::program_options::error { public: // construct/copy/destruct - reading_file(const char *); + reading_file(const char *); };
    -

    Description

    +

    Description

    Class thrown if config file can not be read

    -

    +

    reading_file public construct/copy/destruct

    -
    1. reading_file(const char * filename);
    +
    1. reading_file(const char * filename);
    diff --git a/doc/html/boost/program_options/required_option.html b/doc/html/boost/program_options/required_option.html index 11fb168d37..a72cd2e568 100644 --- a/doc/html/boost/program_options/required_option.html +++ b/doc/html/boost/program_options/required_option.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -36,20 +36,20 @@ class required_option : public boost::program_options::error_with_option_name { public: // construct/copy/destruct - required_option(const std::string &); - ~required_option(); + required_option(const std::string &); + ~required_option(); };
    -

    Description

    +

    Description

    Class thrown when a required/mandatory option is missing

    -

    +

    required_option public construct/copy/destruct

      -
    1. required_option(const std::string & option_name);
      2. -
    2. ~required_option();
      3. +
    3. required_option(const std::string & option_name);
      4. +
    4. ~required_option();
    @@ -64,7 +64,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/program_options/split_unix.html b/doc/html/boost/program_options/split_unix.html index 9e59aa27c9..e9f8254dce 100644 --- a/doc/html/boost/program_options/split_unix.html +++ b/doc/html/boost/program_options/split_unix.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -43,7 +43,7 @@ const std::wstring & quote = L"'\"", const std::wstring & escape = L"\\");
    -

    Description

    +

    Description

    Splits a given string to a collection of single strings which can be passed to command_line_parser. The second parameter is used to specify a collection of possible seperator chars used for splitting. The seperator is defaulted to space " ". Splitting is done in a unix style way, with respect to quotes '"' and escape characters '\'

    @@ -57,7 +57,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/program_options/store_idm45507045051456.html b/doc/html/boost/program_options/store_idm45507045051456.html new file mode 100644 index 0000000000..5b84f83f10 --- /dev/null +++ b/doc/html/boost/program_options/store_idm45507045051456.html @@ -0,0 +1,57 @@ + + + + +Function store + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function store

    +

    boost::program_options::store

    +
    +

    Synopsis

    +
    // In header: <boost/program_options/variables_map.hpp>
+
+
+BOOST_PROGRAM_OPTIONS_DECL void 
+store(const basic_parsed_options< char > & options, variables_map & m, 
+      bool utf8 = false);
    +
    +

    Description

    +

    Stores in 'm' all options that are defined in 'options'. If 'm' already has a non-defaulted value of an option, that value is not changed, even if 'options' specify some value.

    +
    +
    + + + +
    Copyright © 2002-2004 Vladimir Prus

    Distributed under the Boost Software License, Version 1.0. + (See accompanying file LICENSE_1_0.txt or copy at + http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/program_options/store_idm45507086881680.html b/doc/html/boost/program_options/store_idm45507086881680.html new file mode 100644 index 0000000000..605e170788 --- /dev/null +++ b/doc/html/boost/program_options/store_idm45507086881680.html @@ -0,0 +1,56 @@ + + + + +Function store + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function store

    +

    boost::program_options::store

    +
    +

    Synopsis

    +
    // In header: <boost/program_options/variables_map.hpp>
+
+
+BOOST_PROGRAM_OPTIONS_DECL void 
+store(const basic_parsed_options< wchar_t > & options, variables_map & m);
    +
    +

    Description

    +

    Stores in 'm' all options that are defined in 'options'. If 'm' already has a non-defaulted value of an option, that value is not changed, even if 'options' specify some value. This is wide character variant.

    +
    +
    + + + +
    Copyright © 2002-2004 Vladimir Prus

    Distributed under the Boost Software License, Version 1.0. + (See accompanying file LICENSE_1_0.txt or copy at + http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/program_options/store_idp104980944.html b/doc/html/boost/program_options/store_idp104980944.html deleted file mode 100644 index 3eb185b4aa..0000000000 --- a/doc/html/boost/program_options/store_idp104980944.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Function store - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function store

    -

    boost::program_options::store

    -
    -

    Synopsis

    -
    // In header: <boost/program_options/variables_map.hpp>
-
-
-BOOST_PROGRAM_OPTIONS_DECL void 
-store(const basic_parsed_options< wchar_t > & options, variables_map & m);
    -
    -

    Description

    -

    Stores in 'm' all options that are defined in 'options'. If 'm' already has a non-defaulted value of an option, that value is not changed, even if 'options' specify some value. This is wide character variant.

    -
    -
    - - - -
    Copyright © 2002-2004 Vladimir Prus

    Distributed under the Boost Software License, Version 1.0. - (See accompanying file LICENSE_1_0.txt or copy at - http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/program_options/store_idp219446064.html b/doc/html/boost/program_options/store_idp219446064.html deleted file mode 100644 index 39f8cc9088..0000000000 --- a/doc/html/boost/program_options/store_idp219446064.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function store - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function store

    -

    boost::program_options::store

    -
    -

    Synopsis

    -
    // In header: <boost/program_options/variables_map.hpp>
-
-
-BOOST_PROGRAM_OPTIONS_DECL void 
-store(const basic_parsed_options< char > & options, variables_map & m, 
-      bool utf8 = false);
    -
    -

    Description

    -

    Stores in 'm' all options that are defined in 'options'. If 'm' already has a non-defaulted value of an option, that value is not changed, even if 'options' specify some value.

    -
    -
    - - - -
    Copyright © 2002-2004 Vladimir Prus

    Distributed under the Boost Software License, Version 1.0. - (See accompanying file LICENSE_1_0.txt or copy at - http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/program_options/too_many_idm45507093966064.html b/doc/html/boost/program_options/too_many_idm45507093966064.html new file mode 100644 index 0000000000..d2e3ed1eab --- /dev/null +++ b/doc/html/boost/program_options/too_many_idm45507093966064.html @@ -0,0 +1,68 @@ + + + + +Class too_many_positional_options_error + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Class too_many_positional_options_error

    +

    boost::program_options::too_many_positional_options_error

    +
    +

    Synopsis

    +
    // In header: <boost/program_options/errors.hpp>
+
+
+class too_many_positional_options_error :
+  public boost::program_options::error
+{
+public:
+  // construct/copy/destruct
+  too_many_positional_options_error();
+};
    +
    +

    Description

    +

    Class thrown when there are too many positional options. This is a programming error.

    +
    +

    +too_many_positional_options_error + public + construct/copy/destruct

    +
    1. too_many_positional_options_error();
    +
    +
    +
    + + + +
    Copyright © 2002-2004 Vladimir Prus

    Distributed under the Boost Software License, Version 1.0. + (See accompanying file LICENSE_1_0.txt or copy at + http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/program_options/too_many_posi_idp112496320.html b/doc/html/boost/program_options/too_many_posi_idp112496320.html deleted file mode 100644 index e66216eb6d..0000000000 --- a/doc/html/boost/program_options/too_many_posi_idp112496320.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Class too_many_positional_options_error - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Class too_many_positional_options_error

    -

    boost::program_options::too_many_positional_options_error

    -
    -

    Synopsis

    -
    // In header: <boost/program_options/errors.hpp>
-
-
-class too_many_positional_options_error :
-  public boost::program_options::error
-{
-public:
-  // construct/copy/destruct
-  too_many_positional_options_error();
-};
    -
    -

    Description

    -

    Class thrown when there are too many positional options. This is a programming error.

    -
    -

    -too_many_positional_options_error - public - construct/copy/destruct

    -
    1. too_many_positional_options_error();
    -
    -
    -
    - - - -
    Copyright © 2002-2004 Vladimir Prus

    Distributed under the Boost Software License, Version 1.0. - (See accompanying file LICENSE_1_0.txt or copy at - http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/program_options/typed_value.html b/doc/html/boost/program_options/typed_value.html index c407763e54..6d6f2f1641 100644 --- a/doc/html/boost/program_options/typed_value.html +++ b/doc/html/boost/program_options/typed_value.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -38,107 +38,107 @@ { public: // construct/copy/destruct - typed_value(T *); + typed_value(T *); - // public member functions - typed_value * default_value(const T &); - typed_value * default_value(const T &, const std::string &); - typed_value * implicit_value(const T &); - typed_value * value_name(const std::string &); - typed_value * implicit_value(const T &, const std::string &); - typed_value * notifier(function1< void, const T & >); - typed_value * composing(); - typed_value * multitoken(); - typed_value * zero_tokens(); - typed_value * required(); - std::string name() const; - bool is_composing() const; - unsigned min_tokens() const; - unsigned max_tokens() const; - bool adjacent_tokens_only() const; - bool is_required() const; - void xparse(boost::any &, const std::vector< std::basic_string< charT > > &) const; - virtual bool apply_default(boost::any &) const; - void notify(const boost::any &) const; - virtual const std::type_info & value_type() const; + // public member functions + typed_value * default_value(const T &); + typed_value * default_value(const T &, const std::string &); + typed_value * implicit_value(const T &); + typed_value * value_name(const std::string &); + typed_value * implicit_value(const T &, const std::string &); + typed_value * notifier(function1< void, const T & >); + typed_value * composing(); + typed_value * multitoken(); + typed_value * zero_tokens(); + typed_value * required(); + std::string name() const; + bool is_composing() const; + unsigned min_tokens() const; + unsigned max_tokens() const; + bool adjacent_tokens_only() const; + bool is_required() const; + void xparse(boost::any &, const std::vector< std::basic_string< charT > > &) const; + virtual bool apply_default(boost::any &) const; + void notify(const boost::any &) const; + virtual const std::type_info & value_type() const; };
    -

    Description

    +

    Description

    Class which handles value of a specific type.

    -

    +

    typed_value public construct/copy/destruct

    1. -
      typed_value(T * store_to);
      +
      typed_value(T * store_to);

      Ctor. The 'store_to' parameter tells where to store the value when it's known. The parameter can be NULL.

    -

    -typed_value public member functions

    +

    +typed_value public member functions

    1. -
      typed_value * default_value(const T & v);
      +
      typed_value * default_value(const T & v);

      Specifies default value, which will be used if none is explicitly specified. The type 'T' should provide operator<< for ostream.

    2. -
      typed_value * default_value(const T & v, const std::string & textual);
      +
      typed_value * default_value(const T & v, const std::string & textual);

      Specifies default value, which will be used if none is explicitly specified. Unlike the above overload, the type 'T' need not provide operator<< for ostream, but textual representation of default value must be provided by the user.

    3. -
      typed_value * implicit_value(const T & v);
      +
      typed_value * implicit_value(const T & v);

      Specifies an implicit value, which will be used if the option is given, but without an adjacent value. Using this implies that an explicit value is optional, but if given, must be strictly adjacent to the option, i.e.: '-ovalue' or '<ndash></ndash>option=value'. Giving '-o' or '<ndash></ndash>option' will cause the implicit value to be applied.

    4. -
      typed_value * value_name(const std::string & name);
      +
      typed_value * value_name(const std::string & name);

      Specifies the name used to to the value in help message.

    5. -
      typed_value * implicit_value(const T & v, const std::string & textual);
      +
      typed_value * implicit_value(const T & v, const std::string & textual);

      Specifies an implicit value, which will be used if the option is given, but without an adjacent value. Using this implies that an explicit value is optional, but if given, must be strictly adjacent to the option, i.e.: '-ovalue' or '<ndash></ndash>option=value'. Giving '-o' or '<ndash></ndash>option' will cause the implicit value to be applied. Unlike the above overload, the type 'T' need not provide operator<< for ostream, but textual representation of default value must be provided by the user.

    6. -
      typed_value * notifier(function1< void, const T & > f);
      +
      typed_value * notifier(function1< void, const T & > f);

      Specifies a function to be called when the final value is determined.

    7. -
      typed_value * composing();
      +
      typed_value * composing();

      Specifies that the value is composing. See the 'is_composing' method for explanation.

    8. -
      typed_value * multitoken();
      +
      typed_value * multitoken();

      Specifies that the value can span multiple tokens.

    9. -
      typed_value * zero_tokens();
      +
      typed_value * zero_tokens();

      Specifies that no tokens may be provided as the value of this option, which means that only presense of the option is significant. For such option to be useful, either the 'validate' function should be specialized, or the 'implicit_value' method should be also used. In most cases, you can use the 'bool_switch' function instead of using this method.

    10. -
      typed_value * required();
      +
      typed_value * required();

      Specifies that the value must occur.

      11. -
    11. std::string name() const;
      12. -
    12. bool is_composing() const;
      13. -
    13. unsigned min_tokens() const;
      14. -
    14. unsigned max_tokens() const;
      15. -
    15. bool adjacent_tokens_only() const;
      16. -
    16. bool is_required() const;
      17. +
    17. std::string name() const;
      18. +
    18. bool is_composing() const;
      19. +
    19. unsigned min_tokens() const;
      20. +
    20. unsigned max_tokens() const;
      21. +
    21. bool adjacent_tokens_only() const;
      22. +
    22. bool is_required() const;
    23. -
      void xparse(boost::any & value_store, 
+
      void xparse(boost::any & value_store, 
             const std::vector< std::basic_string< charT > > & new_tokens) const;
      
 
      Creates an instance of the 'validator' class and calls its operator() to perform the actual conversion.
    24. -
      virtual bool apply_default(boost::any & value_store) const;
      +
      virtual bool apply_default(boost::any & value_store) const;

      If default value was specified via previous call to 'default_value', stores that value into 'value_store'. Returns true if default value was stored.

    25. -
      void notify(const boost::any & value_store) const;
      +
      void notify(const boost::any & value_store) const;

      If an address of variable to store value was specified when creating *this, stores the value there. Otherwise, does nothing.

      26. -
    26. virtual const std::type_info & value_type() const;
      27. +
    27. virtual const std::type_info & value_type() const;
    @@ -153,7 +153,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/program_options/typed_value_base.html b/doc/html/boost/program_options/typed_value_base.html index 1e23b29ded..831831254f 100644 --- a/doc/html/boost/program_options/typed_value_base.html +++ b/doc/html/boost/program_options/typed_value_base.html @@ -36,25 +36,25 @@ class typed_value_base { public: // construct/copy/destruct - ~typed_value_base(); + ~typed_value_base(); - // public member functions - virtual const std::type_info & value_type() const = 0; + // public member functions + virtual const std::type_info & value_type() const = 0; };
    -

    Description

    +

    Description

    Base class for all option that have a fixed type, and are willing to announce this type to the outside world. Any 'value_semantics' for which you want to find out the type can be dynamic_cast-ed to typed_value_base. If conversion succeeds, the 'type' method can be called.

    -

    +

    typed_value_base public construct/copy/destruct

    -
    1. ~typed_value_base();
    +
    1. ~typed_value_base();
    -

    -typed_value_base public member functions

    -
    1. virtual const std::type_info & value_type() const = 0;
    +

    +typed_value_base public member functions

    +
    1. virtual const std::type_info & value_type() const = 0;
    diff --git a/doc/html/boost/program_options/unknown_option.html b/doc/html/boost/program_options/unknown_option.html index a82399ee49..f2bdd3579a 100644 --- a/doc/html/boost/program_options/unknown_option.html +++ b/doc/html/boost/program_options/unknown_option.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -38,20 +38,20 @@ { public: // construct/copy/destruct - unknown_option(const std::string & = ""); - ~unknown_option(); + unknown_option(const std::string & = ""); + ~unknown_option(); };
    -

    Description

    +

    Description

    Class thrown when option name is not recognized.

    -

    +

    unknown_option public construct/copy/destruct

      -
    1. unknown_option(const std::string & original_token = "");
      2. -
    2. ~unknown_option();
      3. +
    3. unknown_option(const std::string & original_token = "");
      4. +
    4. ~unknown_option();
    @@ -66,7 +66,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/program_options/untyped_value.html b/doc/html/boost/program_options/untyped_value.html index 1a133b2e1c..567478e088 100644 --- a/doc/html/boost/program_options/untyped_value.html +++ b/doc/html/boost/program_options/untyped_value.html @@ -38,69 +38,69 @@ { public: // construct/copy/destruct - untyped_value(bool = false); + untyped_value(bool = false); - // public member functions - virtual std::string name() const; - virtual unsigned min_tokens() const; - virtual unsigned max_tokens() const; - virtual bool adjacent_tokens_only() const; - virtual bool is_composing() const; - virtual bool is_required() const; - virtual void xparse(boost::any &, const std::vector< std::string > &) const; - virtual bool apply_default(boost::any &) const; - virtual void notify(const boost::any &) const; + // public member functions + virtual std::string name() const; + virtual unsigned min_tokens() const; + virtual unsigned max_tokens() const; + virtual bool adjacent_tokens_only() const; + virtual bool is_composing() const; + virtual bool is_required() const; + virtual void xparse(boost::any &, const std::vector< std::string > &) const; + virtual bool apply_default(boost::any &) const; + virtual void notify(const boost::any &) const; };
    -

    Description

    +

    Description

    Class which specifies a simple handling of a value: the value will have string type and only one token is allowed.

    -

    +

    untyped_value public construct/copy/destruct

    -
    1. untyped_value(bool zero_tokens = false);
    +
    1. untyped_value(bool zero_tokens = false);
    -

    -untyped_value public member functions

    +

    +untyped_value public member functions

    1. -
      virtual std::string name() const;
      +
      virtual std::string name() const;

      Returns the name of the option. The name is only meaningful for automatic help message.

    2. -
      virtual unsigned min_tokens() const;
      +
      virtual unsigned min_tokens() const;

      The minimum number of tokens for this option that should be present on the command line.

    3. -
      virtual unsigned max_tokens() const;
      +
      virtual unsigned max_tokens() const;

      The maximum number of tokens for this option that should be present on the command line.

    4. -
      virtual bool adjacent_tokens_only() const;
      +
      virtual bool adjacent_tokens_only() const;

      Returns true if the option should only take adjacent token, not one from further command-line arguments.

    5. -
      virtual bool is_composing() const;
      +
      virtual bool is_composing() const;

      Returns true if values from different sources should be composed. Otherwise, value from the first source is used and values from other sources are discarded.

    6. -
      virtual bool is_required() const;
      +
      virtual bool is_required() const;

      Returns true if value must be given. Non-optional value 

    7. virtual void 
-xparse(boost::any & value_store, 
+xparse(boost::any & value_store, 
        const std::vector< std::string > & new_tokens) const;

      If 'value_store' is already initialized, or new_tokens has more than one elements, throws. Otherwise, assigns the first string from 'new_tokens' to 'value_store', without any modifications.

    8. -
      virtual bool apply_default(boost::any &) const;
      +
      virtual bool apply_default(boost::any &) const;

      Does nothing.

    9. -
      virtual void notify(const boost::any &) const;
      +
      virtual void notify(const boost::any &) const;

      Does nothing.

    diff --git a/doc/html/boost/program_options/validation_error.html b/doc/html/boost/program_options/validation_error.html index 6aedb43264..301d653ac1 100644 --- a/doc/html/boost/program_options/validation_error.html +++ b/doc/html/boost/program_options/validation_error.html @@ -42,33 +42,33 @@ at_least_one_value_required, invalid_bool_value, invalid_option_value, invalid_option }; // construct/copy/destruct - validation_error(kind_t, const std::string & = "", const std::string & = "", + validation_error(kind_t, const std::string & = "", const std::string & = "", int = 0); - ~validation_error(); + ~validation_error(); - // protected member functions - std::string get_template(kind_t); + // protected member functions + std::string get_template(kind_t); };
    -

    Description

    +

    Description

    Class thrown when value of option is incorrect.

    -

    +

    validation_error public construct/copy/destruct

      -
    1. validation_error(kind_t kind, const std::string & option_name = "", 
+
    2. validation_error(kind_t kind, const std::string & option_name = "", 
                  const std::string & original_token = "", 
                  int option_style = 0);
      3. 
-
    3. ~validation_error();
      4. 
+
    4. ~validation_error();
      5.
    -

    -validation_error protected member functions

    +

    +validation_error protected member functions

    1. -
      std::string get_template(kind_t kind);
      +
      std::string get_template(kind_t kind);

      Used to convert kind_t to a related error text

    diff --git a/doc/html/boost/program_options/value_idm45507036651984.html b/doc/html/boost/program_options/value_idm45507036651984.html new file mode 100644 index 0000000000..bced9e0445 --- /dev/null +++ b/doc/html/boost/program_options/value_idm45507036651984.html @@ -0,0 +1,56 @@ + + + + +Function value + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function value

    +

    boost::program_options::value

    +
    +

    Synopsis

    +
    // In header: <boost/program_options/value_semantic.hpp>
+
+
+template<typename T> typed_value< T > * value();
+template<typename T> typed_value< T > * value(T * v);
    +
    +

    Description

    +

    Creates a typed_value<T> instance. This function is the primary method to create value_semantic instance for a specific type, which can later be passed to 'option_description' constructor. The second overload is used when it's additionally desired to store the value of option into program variable.

    +
    +
    + + + +
    Copyright © 2002-2004 Vladimir Prus

    Distributed under the Boost Software License, Version 1.0. + (See accompanying file LICENSE_1_0.txt or copy at + http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/program_options/value_idp109113408.html b/doc/html/boost/program_options/value_idp109113408.html deleted file mode 100644 index 9949b2fb7a..0000000000 --- a/doc/html/boost/program_options/value_idp109113408.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Function value - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function value

    -

    boost::program_options::value

    -
    -

    Synopsis

    -
    // In header: <boost/program_options/value_semantic.hpp>
-
-
-template<typename T> typed_value< T > * value();
-template<typename T> typed_value< T > * value(T * v);
    -
    -

    Description

    -

    Creates a typed_value<T> instance. This function is the primary method to create value_semantic instance for a specific type, which can later be passed to 'option_description' constructor. The second overload is used when it's additionally desired to store the value of option into program variable.

    -
    -
    - - - -
    Copyright © 2002-2004 Vladimir Prus

    Distributed under the Boost Software License, Version 1.0. - (See accompanying file LICENSE_1_0.txt or copy at - http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/program_options/value_se_idm45507037570000.html b/doc/html/boost/program_options/value_se_idm45507037570000.html new file mode 100644 index 0000000000..f1bae271e7 --- /dev/null +++ b/doc/html/boost/program_options/value_se_idm45507037570000.html @@ -0,0 +1,84 @@ + + + + +Class value_semantic_codecvt_helper<char> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Class value_semantic_codecvt_helper<char>

    +

    boost::program_options::value_semantic_codecvt_helper<char>

    +
    +

    Synopsis

    +
    // In header: <boost/program_options/value_semantic.hpp>
+
+
+class value_semantic_codecvt_helper<char> :
+  public boost::program_options::value_semantic
+{
+public:
+
+  // private member functions
+  virtual void 
+  parse(boost::any &, const std::vector< std::string > &, bool) const;
+
+  // protected member functions
+  virtual void 
+  xparse(boost::any &, const std::vector< std::string > &) const = 0;
+};
    +
    +

    Description

    +

    Helper conversion class for values that accept ascii strings as input. Overrides the 'parse' method and defines new 'xparse' method taking std::string. Depending on whether input to parse is ascii or UTF8, will pass it to xparse unmodified, or with UTF8->ascii conversion.

    +
    +

    +value_semantic_codecvt_helper private member functions

    +
    1. +
      virtual void 
+parse(boost::any & value_store, const std::vector< std::string > & new_tokens, 
+      bool utf8) const;
      +

      Parses a group of tokens that specify a value of option. Stores the result in 'value_store', using whatever representation is desired. May be be called several times if value of the same option is specified more than once.

      +
    +
    +
    +

    +value_semantic_codecvt_helper protected member functions

    +
    1. virtual void 
+xparse(boost::any & value_store, 
+       const std::vector< std::string > & new_tokens) const = 0;
    +
    +
    +
    + + + +
    Copyright © 2002-2004 Vladimir Prus

    Distributed under the Boost Software License, Version 1.0. + (See accompanying file LICENSE_1_0.txt or copy at + http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/program_options/value_se_idm45507102986880.html b/doc/html/boost/program_options/value_se_idm45507102986880.html new file mode 100644 index 0000000000..a26b395b7e --- /dev/null +++ b/doc/html/boost/program_options/value_se_idm45507102986880.html @@ -0,0 +1,63 @@ + + + + +Class template value_semantic_codecvt_helper + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Class template value_semantic_codecvt_helper

    +

    boost::program_options::value_semantic_codecvt_helper

    +
    +

    Synopsis

    +
    // In header: <boost/program_options/value_semantic.hpp>
+
+template<typename charT> 
+class value_semantic_codecvt_helper {
+};
    +
    +

    Description

    +

    Helper class which perform necessary character conversions in the 'parse' method and forwards the data further.

    +
    +

    Specializations

    +
    +
    +
    +
    + + + +
    Copyright © 2002-2004 Vladimir Prus

    Distributed under the Boost Software License, Version 1.0. + (See accompanying file LICENSE_1_0.txt or copy at + http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/program_options/value_se_idm45507132697440.html b/doc/html/boost/program_options/value_se_idm45507132697440.html new file mode 100644 index 0000000000..907f8c83ef --- /dev/null +++ b/doc/html/boost/program_options/value_se_idm45507132697440.html @@ -0,0 +1,84 @@ + + + + +Class value_semantic_codecvt_helper<wchar_t> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Class value_semantic_codecvt_helper<wchar_t>

    +

    boost::program_options::value_semantic_codecvt_helper<wchar_t>

    +
    +

    Synopsis

    +
    // In header: <boost/program_options/value_semantic.hpp>
+
+
+class value_semantic_codecvt_helper<wchar_t> :
+  public boost::program_options::value_semantic
+{
+public:
+
+  // private member functions
+  virtual void 
+  parse(boost::any &, const std::vector< std::string > &, bool) const;
+
+  // protected member functions
+  virtual void 
+  xparse(boost::any &, const std::vector< std::wstring > &) const = 0;
+};
    +
    +

    Description

    +

    Helper conversion class for values that accept ascii strings as input. Overrides the 'parse' method and defines new 'xparse' method taking std::wstring. Depending on whether input to parse is ascii or UTF8, will recode input to Unicode, or pass it unmodified.

    +
    +

    +value_semantic_codecvt_helper private member functions

    +
    1. +
      virtual void 
+parse(boost::any & value_store, const std::vector< std::string > & new_tokens, 
+      bool utf8) const;
      +

      Parses a group of tokens that specify a value of option. Stores the result in 'value_store', using whatever representation is desired. May be be called several times if value of the same option is specified more than once.

      +
    +
    +
    +

    +value_semantic_codecvt_helper protected member functions

    +
    1. virtual void 
+xparse(boost::any & value_store, 
+       const std::vector< std::wstring > & new_tokens) const = 0;
    +
    +
    +
    + + + +
    Copyright © 2002-2004 Vladimir Prus

    Distributed under the Boost Software License, Version 1.0. + (See accompanying file LICENSE_1_0.txt or copy at + http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/program_options/value_semanti_idp103539104.html b/doc/html/boost/program_options/value_semanti_idp103539104.html deleted file mode 100644 index f3f9bf4e4c..0000000000 --- a/doc/html/boost/program_options/value_semanti_idp103539104.html +++ /dev/null @@ -1,84 +0,0 @@ - - - - -Class value_semantic_codecvt_helper<char> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Class value_semantic_codecvt_helper<char>

    -

    boost::program_options::value_semantic_codecvt_helper<char>

    -
    -

    Synopsis

    -
    // In header: <boost/program_options/value_semantic.hpp>
-
-
-class value_semantic_codecvt_helper<char> :
-  public boost::program_options::value_semantic
-{
-public:
-
-  // private member functions
-  virtual void 
-  parse(boost::any &, const std::vector< std::string > &, bool) const;
-
-  // protected member functions
-  virtual void 
-  xparse(boost::any &, const std::vector< std::string > &) const = 0;
-};
    -
    -

    Description

    -

    Helper conversion class for values that accept ascii strings as input. Overrides the 'parse' method and defines new 'xparse' method taking std::string. Depending on whether input to parse is ascii or UTF8, will pass it to xparse unmodified, or with UTF8->ascii conversion.

    -
    -

    -value_semantic_codecvt_helper private member functions

    -
    1. -
      virtual void 
-parse(boost::any & value_store, const std::vector< std::string > & new_tokens, 
-      bool utf8) const;
      -

      Parses a group of tokens that specify a value of option. Stores the result in 'value_store', using whatever representation is desired. May be be called several times if value of the same option is specified more than once.

      -
    -
    -
    -

    -value_semantic_codecvt_helper protected member functions

    -
    1. virtual void 
-xparse(boost::any & value_store, 
-       const std::vector< std::string > & new_tokens) const = 0;
    -
    -
    -
    - - - -
    Copyright © 2002-2004 Vladimir Prus

    Distributed under the Boost Software License, Version 1.0. - (See accompanying file LICENSE_1_0.txt or copy at - http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/program_options/value_semanti_idp207166032.html b/doc/html/boost/program_options/value_semanti_idp207166032.html deleted file mode 100644 index 3adfdf1ebd..0000000000 --- a/doc/html/boost/program_options/value_semanti_idp207166032.html +++ /dev/null @@ -1,63 +0,0 @@ - - - - -Class template value_semantic_codecvt_helper - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Class template value_semantic_codecvt_helper

    -

    boost::program_options::value_semantic_codecvt_helper

    -
    -

    Synopsis

    -
    // In header: <boost/program_options/value_semantic.hpp>
-
-template<typename charT> 
-class value_semantic_codecvt_helper {
-};
    -
    -

    Description

    -

    Helper class which perform necessary character conversions in the 'parse' method and forwards the data further.

    -
    -

    Specializations

    -
    -
    -
    -
    - - - -
    Copyright © 2002-2004 Vladimir Prus

    Distributed under the Boost Software License, Version 1.0. - (See accompanying file LICENSE_1_0.txt or copy at - http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/program_options/value_semantic.html b/doc/html/boost/program_options/value_semantic.html index f17174d6a1..881727f4fe 100644 --- a/doc/html/boost/program_options/value_semantic.html +++ b/doc/html/boost/program_options/value_semantic.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -36,70 +36,70 @@ class value_semantic { public: // construct/copy/destruct - ~value_semantic(); + ~value_semantic(); - // public member functions - virtual std::string name() const = 0; - virtual unsigned min_tokens() const = 0; - virtual unsigned max_tokens() const = 0; - virtual bool adjacent_tokens_only() const = 0; - virtual bool is_composing() const = 0; - virtual bool is_required() const = 0; + // public member functions + virtual std::string name() const = 0; + virtual unsigned min_tokens() const = 0; + virtual unsigned max_tokens() const = 0; + virtual bool adjacent_tokens_only() const = 0; + virtual bool is_composing() const = 0; + virtual bool is_required() const = 0; virtual void - parse(boost::any &, const std::vector< std::string > &, bool) const = 0; - virtual bool apply_default(boost::any &) const = 0; - virtual void notify(const boost::any &) const = 0; + parse(boost::any &, const std::vector< std::string > &, bool) const = 0; + virtual bool apply_default(boost::any &) const = 0; + virtual void notify(const boost::any &) const = 0; };
    -

    Description

    +

    Description

    Class which specifies how the option's value is to be parsed and converted into C++ types.

    -

    +

    value_semantic public construct/copy/destruct

    -
    1. ~value_semantic();
    +
    1. ~value_semantic();
    -

    -value_semantic public member functions

    +

    +value_semantic public member functions

    1. -
      virtual std::string name() const = 0;
      +
      virtual std::string name() const = 0;

      Returns the name of the option. The name is only meaningful for automatic help message.

    2. -
      virtual unsigned min_tokens() const = 0;
      +
      virtual unsigned min_tokens() const = 0;

      The minimum number of tokens for this option that should be present on the command line.

    3. -
      virtual unsigned max_tokens() const = 0;
      +
      virtual unsigned max_tokens() const = 0;

      The maximum number of tokens for this option that should be present on the command line.

    4. -
      virtual bool adjacent_tokens_only() const = 0;
      +
      virtual bool adjacent_tokens_only() const = 0;

      Returns true if the option should only take adjacent token, not one from further command-line arguments.

    5. -
      virtual bool is_composing() const = 0;
      +
      virtual bool is_composing() const = 0;

      Returns true if values from different sources should be composed. Otherwise, value from the first source is used and values from other sources are discarded.

    6. -
      virtual bool is_required() const = 0;
      +
      virtual bool is_required() const = 0;

      Returns true if value must be given. Non-optional value 

    7. virtual void 
-parse(boost::any & value_store, const std::vector< std::string > & new_tokens, 
+parse(boost::any & value_store, const std::vector< std::string > & new_tokens, 
       bool utf8) const = 0;

      Parses a group of tokens that specify a value of option. Stores the result in 'value_store', using whatever representation is desired. May be be called several times if value of the same option is specified more than once.

    8. -
      virtual bool apply_default(boost::any & value_store) const = 0;
      +
      virtual bool apply_default(boost::any & value_store) const = 0;

      Called to assign default value to 'value_store'. Returns true if default value is assigned, and false if no default value exists.

    9. -
      virtual void notify(const boost::any & value_store) const = 0;
      +
      virtual void notify(const boost::any & value_store) const = 0;

      Called when final value of an option is determined.

    @@ -116,7 +116,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/program_options/value_semantic_idp99204112.html b/doc/html/boost/program_options/value_semantic_idp99204112.html deleted file mode 100644 index db43f8b12b..0000000000 --- a/doc/html/boost/program_options/value_semantic_idp99204112.html +++ /dev/null @@ -1,84 +0,0 @@ - - - - -Class value_semantic_codecvt_helper<wchar_t> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Class value_semantic_codecvt_helper<wchar_t>

    -

    boost::program_options::value_semantic_codecvt_helper<wchar_t>

    -
    -

    Synopsis

    -
    // In header: <boost/program_options/value_semantic.hpp>
-
-
-class value_semantic_codecvt_helper<wchar_t> :
-  public boost::program_options::value_semantic
-{
-public:
-
-  // private member functions
-  virtual void 
-  parse(boost::any &, const std::vector< std::string > &, bool) const;
-
-  // protected member functions
-  virtual void 
-  xparse(boost::any &, const std::vector< std::wstring > &) const = 0;
-};
    -
    -

    Description

    -

    Helper conversion class for values that accept ascii strings as input. Overrides the 'parse' method and defines new 'xparse' method taking std::wstring. Depending on whether input to parse is ascii or UTF8, will recode input to Unicode, or pass it unmodified.

    -
    -

    -value_semantic_codecvt_helper private member functions

    -
    1. -
      virtual void 
-parse(boost::any & value_store, const std::vector< std::string > & new_tokens, 
-      bool utf8) const;
      -

      Parses a group of tokens that specify a value of option. Stores the result in 'value_store', using whatever representation is desired. May be be called several times if value of the same option is specified more than once.

      -
    -
    -
    -

    -value_semantic_codecvt_helper protected member functions

    -
    1. virtual void 
-xparse(boost::any & value_store, 
-       const std::vector< std::wstring > & new_tokens) const = 0;
    -
    -
    -
    - - - -
    Copyright © 2002-2004 Vladimir Prus

    Distributed under the Boost Software License, Version 1.0. - (See accompanying file LICENSE_1_0.txt or copy at - http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/program_options/variable_value.html b/doc/html/boost/program_options/variable_value.html index acafbed4b4..05afb4792a 100644 --- a/doc/html/boost/program_options/variable_value.html +++ b/doc/html/boost/program_options/variable_value.html @@ -36,67 +36,67 @@ class variable_value { public: // construct/copy/destruct - variable_value(); - variable_value(const boost::any &, bool); + variable_value(); + variable_value(const boost::any &, bool); - // friend functions + // friend functions friend BOOST_PROGRAM_OPTIONS_DECL void - store(const basic_parsed_options< char > &, variables_map &, bool); + store(const basic_parsed_options< char > &, variables_map &, bool); - // public member functions - template<typename T> const T & as() const; - template<typename T> T & as(); - bool empty() const; - bool defaulted() const; - const boost::any & value() const; - boost::any & value(); + // public member functions + template<typename T> const T & as() const; + template<typename T> T & as(); + bool empty() const; + bool defaulted() const; + const boost::any & value() const; + boost::any & value(); };
    -

    Description

    +

    Description

    Class holding value of option. Contains details about how the value is set and allows to conveniently obtain the value.

    -

    +

    variable_value public construct/copy/destruct

      -
    1. variable_value();
      2. -
    2. variable_value(const boost::any & xv, bool xdefaulted);
      3. +
    3. variable_value();
      4. +
    4. variable_value(const boost::any & xv, bool xdefaulted);
    -

    -variable_value friend functions

    +

    +variable_value friend functions

    1. friend BOOST_PROGRAM_OPTIONS_DECL void 
-store(const basic_parsed_options< char > & options, variables_map & m, bool);
      +store(const basic_parsed_options< char > & options, variables_map & m, bool);

      Stores in 'm' all options that are defined in 'options'. If 'm' already has a non-defaulted value of an option, that value is not changed, even if 'options' specify some value.

    -

    -variable_value public member functions

    +

    +variable_value public member functions

    1. -
      template<typename T> const T & as() const;
      +
      template<typename T> const T & as() const;

      If stored value if of type T, returns that value. Otherwise, throws boost::bad_any_cast exception.

    2. -
      template<typename T> T & as();
      +
      template<typename T> T & as();

      This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

    3. -
      bool empty() const;
      Returns true if no value is stored.
      4. +
      bool empty() const;
      Returns true if no value is stored.
    4. -
      bool defaulted() const;
      +
      bool defaulted() const;

      Returns true if the value was not explicitly given, but has default value.

    5. -
      const boost::any & value() const;
      +
      const boost::any & value() const;

      Returns the contained value.

    6. -
      boost::any & value();
      +
      boost::any & value();

      Returns the contained value.

    diff --git a/doc/html/boost/program_options/variables_map.html b/doc/html/boost/program_options/variables_map.html index 8b3b356a3f..2f18ce0004 100644 --- a/doc/html/boost/program_options/variables_map.html +++ b/doc/html/boost/program_options/variables_map.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -38,58 +38,58 @@ { public: // construct/copy/destruct - variables_map(); - variables_map(const abstract_variables_map *); + variables_map(); + variables_map(const abstract_variables_map *); - // public member functions - const variable_value & operator[](const std::string &) const; - void clear(); - void notify(); + // public member functions + const variable_value & operator[](const std::string &) const; + void clear(); + void notify(); - // private member functions - virtual const variable_value & get(const std::string &) const; + // private member functions + virtual const variable_value & get(const std::string &) const; - // friend functions + // friend functions friend BOOST_PROGRAM_OPTIONS_DECL void - store(const basic_parsed_options< char > &, variables_map &, bool); + store(const basic_parsed_options< char > &, variables_map &, bool); };
    -

    Description

    +

    Description

    Concrete variables map which store variables in real map.

    This class is derived from std::map<std::string, variable_value>, so you can use all map operators to examine its content.

    -

    +

    variables_map public construct/copy/destruct

      -
    1. variables_map();
      2. -
    2. variables_map(const abstract_variables_map * next);
      3. +
    3. variables_map();
      4. +
    4. variables_map(const abstract_variables_map * next);
    -

    -variables_map public member functions

    +

    +variables_map public member functions

      -
    1. const variable_value & operator[](const std::string & name) const;
      2. -
    2. void clear();
      3. -
    3. void notify();
      4. +
    4. const variable_value & operator[](const std::string & name) const;
      5. +
    5. void clear();
      6. +
    6. void notify();
    -

    -variables_map private member functions

    +

    +variables_map private member functions

    1. -
      virtual const variable_value & get(const std::string & name) const;
      +
      virtual const variable_value & get(const std::string & name) const;

      Implementation of abstract_variables_map::get which does 'find' in *this.

    -

    -variables_map friend functions

    +

    +variables_map friend functions

    1. friend BOOST_PROGRAM_OPTIONS_DECL void 
-store(const basic_parsed_options< char > & options, variables_map & xm, 
+store(const basic_parsed_options< char > & options, variables_map & xm, 
       bool utf8);

      Stores in 'm' all options that are defined in 'options'. If 'm' already has a non-defaulted value of an option, that value is not changed, even if 'options' specify some value.

    @@ -106,7 +106,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/program_options/wvalue.html b/doc/html/boost/program_options/wvalue.html index 82c391ad5c..61313635b0 100644 --- a/doc/html/boost/program_options/wvalue.html +++ b/doc/html/boost/program_options/wvalue.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -36,7 +36,7 @@ template<typename T> typed_value< T, wchar_t > * wvalue(); template<typename T> typed_value< T, wchar_t > * wvalue(T * v);
    -

    Description

    +

    Description

    Creates a typed_value<T> instance. This function is the primary method to create value_semantic instance for a specific type, which can later be passed to 'option_description' constructor.

    @@ -50,7 +50,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/property_tree/basic_ptree.html b/doc/html/boost/property_tree/basic_ptree.html index c3d5670f74..45f9149884 100644 --- a/doc/html/boost/property_tree/basic_ptree.html +++ b/doc/html/boost/property_tree/basic_ptree.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -36,164 +36,164 @@ class basic_ptree { public: // construct/copy/destruct - basic_ptree(); - explicit basic_ptree(const data_type &); - basic_ptree(const self_type &); - self_type & operator=(const self_type &); - ~basic_ptree(); + basic_ptree(); + explicit basic_ptree(const data_type &); + basic_ptree(const self_type &); + self_type & operator=(const self_type &); + ~basic_ptree(); - // public member functions - void swap(self_type &); - size_type size() const; - size_type max_size() const; - bool empty() const; - iterator begin(); - const_iterator begin() const; - iterator end(); - const_iterator end() const; - reverse_iterator rbegin(); - const_reverse_iterator rbegin() const; - reverse_iterator rend(); - const_reverse_iterator rend() const; - value_type & front(); - const value_type & front() const; - value_type & back(); - const value_type & back() const; - iterator insert(iterator, const value_type &); - template<typename It> void insert(iterator, It, It); - iterator erase(iterator); - iterator erase(iterator, iterator); - iterator push_front(const value_type &); - iterator push_back(const value_type &); - void pop_front(); - void pop_back(); - void reverse(); - template<typename Compare> void sort(Compare); - void sort(); - bool operator==(const self_type &) const; - bool operator!=(const self_type &) const; - assoc_iterator ordered_begin(); - const_assoc_iterator ordered_begin() const; - assoc_iterator not_found(); - const_assoc_iterator not_found() const; - assoc_iterator find(const key_type &); - const_assoc_iterator find(const key_type &) const; - std::pair< assoc_iterator, assoc_iterator > equal_range(const key_type &); + // public member functions + void swap(self_type &); + size_type size() const; + size_type max_size() const; + bool empty() const; + iterator begin(); + const_iterator begin() const; + iterator end(); + const_iterator end() const; + reverse_iterator rbegin(); + const_reverse_iterator rbegin() const; + reverse_iterator rend(); + const_reverse_iterator rend() const; + value_type & front(); + const value_type & front() const; + value_type & back(); + const value_type & back() const; + iterator insert(iterator, const value_type &); + template<typename It> void insert(iterator, It, It); + iterator erase(iterator); + iterator erase(iterator, iterator); + iterator push_front(const value_type &); + iterator push_back(const value_type &); + void pop_front(); + void pop_back(); + void reverse(); + template<typename Compare> void sort(Compare); + void sort(); + bool operator==(const self_type &) const; + bool operator!=(const self_type &) const; + assoc_iterator ordered_begin(); + const_assoc_iterator ordered_begin() const; + assoc_iterator not_found(); + const_assoc_iterator not_found() const; + assoc_iterator find(const key_type &); + const_assoc_iterator find(const key_type &) const; + std::pair< assoc_iterator, assoc_iterator > equal_range(const key_type &); std::pair< const_assoc_iterator, const_assoc_iterator > - equal_range(const key_type &) const; - size_type count(const key_type &) const; - size_type erase(const key_type &); - iterator to_iterator(assoc_iterator); - const_iterator to_iterator(const_assoc_iterator) const; - data_type & data(); - const data_type & data() const; - void clear(); - self_type & get_child(const path_type &); - const self_type & get_child(const path_type &) const; - self_type & get_child(const path_type &, self_type &); - const self_type & get_child(const path_type &, const self_type &) const; - optional< self_type & > get_child_optional(const path_type &); - optional< const self_type & > get_child_optional(const path_type &) const; - self_type & put_child(const path_type &, const self_type &); - self_type & add_child(const path_type &, const self_type &); + equal_range(const key_type &) const; + size_type count(const key_type &) const; + size_type erase(const key_type &); + iterator to_iterator(assoc_iterator); + const_iterator to_iterator(const_assoc_iterator) const; + data_type & data(); + const data_type & data() const; + void clear(); + self_type & get_child(const path_type &); + const self_type & get_child(const path_type &) const; + self_type & get_child(const path_type &, self_type &); + const self_type & get_child(const path_type &, const self_type &) const; + optional< self_type & > get_child_optional(const path_type &); + optional< const self_type & > get_child_optional(const path_type &) const; + self_type & put_child(const path_type &, const self_type &); + self_type & add_child(const path_type &, const self_type &); template<typename Type, typename Translator> - unspecified get_value(Translator) const; - template<typename Type> Type get_value() const; + unspecified get_value(Translator) const; + template<typename Type> Type get_value() const; template<typename Type, typename Translator> - Type get_value(const Type &, Translator) const; + Type get_value(const Type &, Translator) const; template<typename Ch, typename Translator> - unspecified get_value(const Ch *, Translator) const; - template<typename Type> unspecified get_value(const Type &) const; - template<typename Ch> unspecified get_value(const Ch *) const; + unspecified get_value(const Ch *, Translator) const; + template<typename Type> unspecified get_value(const Type &) const; + template<typename Ch> unspecified get_value(const Ch *) const; template<typename Type, typename Translator> - optional< Type > get_value_optional(Translator) const; - template<typename Type> optional< Type > get_value_optional() const; + optional< Type > get_value_optional(Translator) const; + template<typename Type> optional< Type > get_value_optional() const; template<typename Type, typename Translator> - void put_value(const Type &, Translator); - template<typename Type> void put_value(const Type &); + void put_value(const Type &, Translator); + template<typename Type> void put_value(const Type &); template<typename Type, typename Translator> - unspecified get(const path_type &, Translator) const; - template<typename Type> Type get(const path_type &) const; + unspecified get(const path_type &, Translator) const; + template<typename Type> Type get(const path_type &) const; template<typename Type, typename Translator> - Type get(const path_type &, const Type &, Translator) const; + Type get(const path_type &, const Type &, Translator) const; template<typename Ch, typename Translator> - unspecified get(const path_type &, const Ch *, Translator) const; + unspecified get(const path_type &, const Ch *, Translator) const; template<typename Type> - unspecified get(const path_type &, const Type &) const; - template<typename Ch> unspecified get(const path_type &, const Ch *) const; + unspecified get(const path_type &, const Type &) const; + template<typename Ch> unspecified get(const path_type &, const Ch *) const; template<typename Type, typename Translator> - optional< Type > get_optional(const path_type &, Translator) const; + optional< Type > get_optional(const path_type &, Translator) const; template<typename Type> - optional< Type > get_optional(const path_type &) const; + optional< Type > get_optional(const path_type &) const; template<typename Type, typename Translator> - self_type & put(const path_type &, const Type &, Translator); - template<typename Type> self_type & put(const path_type &, const Type &); + self_type & put(const path_type &, const Type &, Translator); + template<typename Type> self_type & put(const path_type &, const Type &); template<typename Type, typename Translator> - self_type & add(const path_type &, const Type &, Translator); - template<typename Type> self_type & add(const path_type &, const Type &); + self_type & add(const path_type &, const Type &, Translator); + template<typename Type> self_type & add(const path_type &, const Type &); - // private member functions - self_type * walk_path(path_type &) const; - self_type & force_path(path_type &); + // private member functions + self_type * walk_path(path_type &) const; + self_type & force_path(path_type &); };
    -

    Description

    +

    Description

    Property tree main structure. A property tree is a hierarchical data structure which has one element of type Data in each node, as well as an ordered sequence of sub-nodes, which are additionally identified by a non-unique key of type Key.

    Key equivalency is defined by KeyCompare, a predicate defining a strict weak ordering.

    Property tree defines a Container-like interface to the (key-node) pairs of its direct sub-nodes. The iterators are bidirectional. The sequence of nodes is held in insertion order, not key order.

    -

    +

    basic_ptree public construct/copy/destruct

    1. -
      basic_ptree();
      +
      basic_ptree();

      Creates a node with no children and default-constructed data.

    2. -
      explicit basic_ptree(const data_type & data);
      +
      explicit basic_ptree(const data_type & data);

      Creates a node with no children and a copy of the given data.

      3. -
    3. basic_ptree(const self_type & rhs);
      4. +
    4. basic_ptree(const self_type & rhs);
    5. -
      self_type & operator=(const self_type & rhs);
      +
      self_type & operator=(const self_type & rhs);

      Basic guarantee only.

      6. -
    6. ~basic_ptree();
      7. +
    7. ~basic_ptree();
    -

    -basic_ptree public member functions

    +

    +basic_ptree public member functions

    1. -
      void swap(self_type & rhs);
      +
      void swap(self_type & rhs);

      Swap with other tree. Only constant-time and nothrow if the data type's swap is.

    2. -
      size_type size() const;
      +
      size_type size() const;

      The number of direct children of this node.

      3. -
    3. size_type max_size() const;
      4. +
    4. size_type max_size() const;
    5. -
      bool empty() const;
      +
      bool empty() const;

      Whether there are any direct children.

      6. -
    6. iterator begin();
      7. -
    7. const_iterator begin() const;
      8. -
    8. iterator end();
      9. -
    9. const_iterator end() const;
      10. -
    10. reverse_iterator rbegin();
      11. -
    11. const_reverse_iterator rbegin() const;
      12. -
    12. reverse_iterator rend();
      13. -
    13. const_reverse_iterator rend() const;
      14. -
    14. value_type & front();
      15. -
    15. const value_type & front() const;
      16. -
    16. value_type & back();
      17. -
    17. const value_type & back() const;
      18. -
    18. -
      iterator insert(iterator where, const value_type & value);
      +
    19. iterator begin();
      20. +
    20. const_iterator begin() const;
      21. +
    21. iterator end();
      22. +
    22. const_iterator end() const;
      23. +
    23. reverse_iterator rbegin();
      24. +
    24. const_reverse_iterator rbegin() const;
      25. +
    25. reverse_iterator rend();
      26. +
    26. const_reverse_iterator rend() const;
      27. +
    27. value_type & front();
      28. +
    28. const value_type & front() const;
      29. +
    29. value_type & back();
      30. +
    30. const value_type & back() const;
      31. +
    31. +
      iterator insert(iterator where, const value_type & value);

      Insert a copy of the given tree with its key just before the given position in this node. This operation invalidates no iterators.

      @@ -208,14 +208,14 @@
    32. -
      template<typename It> void insert(iterator where, It first, It last);
      +
      template<typename It> void insert(iterator where, It first, It last);

      Range insert. Equivalent to: 

      for(; first != last; ++first) insert(where, *first);

    33. -
      iterator erase(iterator where);
      +
      iterator erase(iterator where);

      Erase the child pointed at by the iterator. This operation invalidates the given iterator, as well as its equivalent assoc_iterator.

      @@ -230,88 +230,88 @@
    34. -
      iterator erase(iterator first, iterator last);
      +
      iterator erase(iterator first, iterator last);

      Range erase. Equivalent to: 

      while(first != last;) first = erase(first);

    35. -
      iterator push_front(const value_type & value);
      +
      iterator push_front(const value_type & value);

      Equivalent to insert(begin(), value).

    36. -
      iterator push_back(const value_type & value);
      +
      iterator push_back(const value_type & value);

      Equivalent to insert(end(), value).

    37. -
      void pop_front();
      +
      void pop_front();

      Equivalent to erase(begin()).

    38. -
      void pop_back();
      +
      void pop_back();

      Equivalent to erase(boost::prior(end())).

    39. -
      void reverse();
      +
      void reverse();

      Reverses the order of direct children in the property tree.

    40. -
      template<typename Compare> void sort(Compare comp);
      +
      template<typename Compare> void sort(Compare comp);

      Sorts the direct children of this node according to the predicate. The predicate is passed the whole pair of key and child.

    41. -
      void sort();
      +
      void sort();

      Sorts the direct children of this node according to key order.

    42. -
      bool operator==(const self_type & rhs) const;
      +
      bool operator==(const self_type & rhs) const;

      Two property trees are the same if they have the same data, the keys and order of their children are the same, and the children compare equal, recursively.

      43. -
    43. bool operator!=(const self_type & rhs) const;
      44. +
    44. bool operator!=(const self_type & rhs) const;
    45. -
      assoc_iterator ordered_begin();
      +
      assoc_iterator ordered_begin();

      Returns an iterator to the first child, in key order.

    46. -
      const_assoc_iterator ordered_begin() const;
      +
      const_assoc_iterator ordered_begin() const;

      Returns an iterator to the first child, in key order.

    47. -
      assoc_iterator not_found();
      +
      assoc_iterator not_found();

      Returns the not-found iterator. Equivalent to end() in a real associative container.

    48. -
      const_assoc_iterator not_found() const;
      +
      const_assoc_iterator not_found() const;

      Returns the not-found iterator. Equivalent to end() in a real associative container.

    49. -
      assoc_iterator find(const key_type & key);
      +
      assoc_iterator find(const key_type & key);

      Find a child with the given key, or not_found() if there is none. There is no guarantee about which child is returned if multiple have the same key.

    50. -
      const_assoc_iterator find(const key_type & key) const;
      +
      const_assoc_iterator find(const key_type & key) const;

      Find a child with the given key, or not_found() if there is none. There is no guarantee about which child is returned if multiple have the same key.

    51. -
      std::pair< assoc_iterator, assoc_iterator > equal_range(const key_type & key);
      +
      std::pair< assoc_iterator, assoc_iterator > equal_range(const key_type & key);

      Find the range of children that have the given key. 

    52. std::pair< const_assoc_iterator, const_assoc_iterator > 
-equal_range(const key_type & key) const;
      +equal_range(const key_type & key) const;

      Find the range of children that have the given key.

    53. -
      size_type count(const key_type & key) const;
      +
      size_type count(const key_type & key) const;

      Count the number of direct children with the given key.

    54. -
      size_type erase(const key_type & key);
      +
      size_type erase(const key_type & key);

      Erase all direct children with the given key and return the count.

    55. -
      iterator to_iterator(assoc_iterator it);
      +
      iterator to_iterator(assoc_iterator it);

      Get the iterator that points to the same element as the argument.

      @@ -324,7 +324,7 @@

    56. -
      const_iterator to_iterator(const_assoc_iterator it) const;
      +
      const_iterator to_iterator(const_assoc_iterator it) const;

      Get the iterator that points to the same element as the argument.

      57. @@ -337,19 +337,19 @@

    57. -
      data_type & data();
      +
      data_type & data();

      Reference to the actual data in this node.

    58. -
      const data_type & data() const;
      +
      const data_type & data() const;

      Reference to the actual data in this node.

    59. -
      void clear();
      +
      void clear();

      Clear this tree completely, of both data and children.

    60. -
      self_type & get_child(const path_type & path);
      +
      self_type & get_child(const path_type & path);

      Get the child at the given path, or throw ptree_bad_path.

      61. @@ -368,28 +368,28 @@

    61. -
      const self_type & get_child(const path_type & path) const;
      +
      const self_type & get_child(const path_type & path) const;

      Get the child at the given path, or throw ptree_bad_path.

    62. -
      self_type & get_child(const path_type & path, self_type & default_value);
      +
      self_type & get_child(const path_type & path, self_type & default_value);

      Get the child at the given path, or return default_value. 

    63. const self_type & 
-get_child(const path_type & path, const self_type & default_value) const;
      +get_child(const path_type & path, const self_type & default_value) const;

      Get the child at the given path, or return default_value.

    64. -
      optional< self_type & > get_child_optional(const path_type & path);
      +
      optional< self_type & > get_child_optional(const path_type & path);

      Get the child at the given path, or return boost::null.

    65. -
      optional< const self_type & > get_child_optional(const path_type & path) const;
      +
      optional< const self_type & > get_child_optional(const path_type & path) const;

      Get the child at the given path, or return boost::null.

    66. -
      self_type & put_child(const path_type & path, const self_type & value);
      +
      self_type & put_child(const path_type & path, const self_type & value);

      Set the node at the given path to the given value. Create any missing parents. If the node at the path already exists, replace it.

      67. @@ -422,7 +422,7 @@
    67. -
      self_type & add_child(const path_type & path, const self_type & value);
      +
      self_type & add_child(const path_type & path, const self_type & value);

      Add the node at the given path. Create any missing parents. If there already is a node at the path, add another one with the same key.

      @@ -463,7 +463,7 @@ 
    68. template<typename Type, typename Translator> 
-  unspecified get_value(Translator tr) const;
      + unspecified get_value(Translator tr) const;

      Take the value of this node and attempt to translate it to a Type object using the supplied translator.

      @@ -479,7 +479,7 @@
    69. -
      template<typename Type> Type get_value() const;
      +
      template<typename Type> Type get_value() const;

      Take the value of this node and attempt to translate it to a Type object using the default translator.

      @@ -496,35 +496,35 @@ 
    70. template<typename Type, typename Translator> 
-  Type get_value(const Type & default_value, Translator tr) const;
      + Type get_value(const Type & default_value, Translator tr) const;

      Take the value of this node and attempt to translate it to a Type object using the supplied translator. Return default_value if this fails. 

    71. template<typename Ch, typename Translator> 
-  unspecified get_value(const Ch * default_value, Translator tr) const;
      + unspecified get_value(const Ch * default_value, Translator tr) const;

      Make get_value do the right thing for string literals. 

    72. template<typename Type> 
-  unspecified get_value(const Type & default_value) const;
      + unspecified get_value(const Type & default_value) const;

      Take the value of this node and attempt to translate it to a Type object using the default translator. Return default_value if this fails.

    73. -
      template<typename Ch> unspecified get_value(const Ch * default_value) const;
      +
      template<typename Ch> unspecified get_value(const Ch * default_value) const;

      Make get_value do the right thing for string literals. 

    74. template<typename Type, typename Translator> 
-  optional< Type > get_value_optional(Translator tr) const;
      + optional< Type > get_value_optional(Translator tr) const;

      Take the value of this node and attempt to translate it to a Type object using the supplied translator. Return boost::null if this fails.

    75. -
      template<typename Type> optional< Type > get_value_optional() const;
      +
      template<typename Type> optional< Type > get_value_optional() const;

      Take the value of this node and attempt to translate it to a Type object using the default translator. Return boost::null if this fails. 

    76. template<typename Type, typename Translator> 
-  void put_value(const Type & value, Translator tr);
      + void put_value(const Type & value, Translator tr);

      Replace the value at this node with the given value, translated to the tree's data type using the supplied translator.

      77. @@ -540,7 +540,7 @@
    77. -
      template<typename Type> void put_value(const Type & value);
      +
      template<typename Type> void put_value(const Type & value);

      Replace the value at this node with the given value, translated to the tree's data type using the default translator.

      @@ -557,37 +557,37 @@ 
    78. template<typename Type, typename Translator> 
-  unspecified get(const path_type & path, Translator tr) const;
      + unspecified get(const path_type & path, Translator tr) const;

      Shorthand for get_child(path).get_value(tr).

    79. -
      template<typename Type> Type get(const path_type & path) const;
      +
      template<typename Type> Type get(const path_type & path) const;

      Shorthand for get_child(path).get_value<Type>(). 

    80. template<typename Type, typename Translator> 
-  Type get(const path_type & path, const Type & default_value, Translator tr) const;
      + Type get(const path_type & path, const Type & default_value, Translator tr) const;

      Shorthand for get_child(path, empty_ptree()) .get_value(default_value, tr). That is, return the translated value if possible, and the default value if the node doesn't exist or conversion fails. 

    81. template<typename Ch, typename Translator> 
-  unspecified get(const path_type & path, const Ch * default_value, 
+  unspecified get(const path_type & path, const Ch * default_value, 
                   Translator tr) const;

      Make get do the right thing for string literals. 

    82. template<typename Type> 
-  unspecified get(const path_type & path, const Type & default_value) const;
      + unspecified get(const path_type & path, const Type & default_value) const;

      Shorthand for get_child(path, empty_ptree()) .get_value(default_value). That is, return the translated value if possible, and the default value if the node doesn't exist or conversion fails. 

    83. template<typename Ch> 
-  unspecified get(const path_type & path, const Ch * default_value) const;
      + unspecified get(const path_type & path, const Ch * default_value) const;

      Make get do the right thing for string literals. 

    84. template<typename Type, typename Translator> 
-  optional< Type > get_optional(const path_type & path, Translator tr) const;
      + optional< Type > get_optional(const path_type & path, Translator tr) const;

      Shorthand for: 

      if(optional\<self_type&\> node = get_child_optional(path))
   return node->get_value_optional(tr);
@@ -597,7 +597,7 @@
 
    85. template<typename Type> 
-  optional< Type > get_optional(const path_type & path) const;
      + optional< Type > get_optional(const path_type & path) const;

      Shorthand for: 

      if(optional\<const self_type&\> node = get_child_optional(path))
   return node->get_value_optional();
@@ -607,7 +607,7 @@
 
    86. template<typename Type, typename Translator> 
-  self_type & put(const path_type & path, const Type & value, Translator tr);
      + self_type & put(const path_type & path, const Type & value, Translator tr);

      Set the value of the node at the given path to the supplied value, translated to the tree's data type. If the node doesn't exist, it is created, including all its missing parents.

      @@ -631,7 +631,7 @@ 
    87. template<typename Type> 
-  self_type & put(const path_type & path, const Type & value);
      + self_type & put(const path_type & path, const Type & value);

      Set the value of the node at the given path to the supplied value, translated to the tree's data type. If the node doesn't exist, it is created, including all its missing parents.

      @@ -655,7 +655,7 @@ 
    88. template<typename Type, typename Translator> 
-  self_type & add(const path_type & path, const Type & value, Translator tr);
      + self_type & add(const path_type & path, const Type & value, Translator tr);

      If the node identified by the path does not exist, create it, including all its missing parents. If the node already exists, add a sibling with the same key. Set the newly created node's value to the given paremeter, translated with the supplied translator. @@ -703,7 +703,7 @@ 

    89. template<typename Type> 
-  self_type & add(const path_type & path, const Type & value);
      + self_type & add(const path_type & path, const Type & value);

      If the node identified by the path does not exist, create it, including all its missing parents. If the node already exists, add a sibling with the same key. Set the newly created node's value to the given paremeter, translated with the supplied translator. @@ -748,11 +748,11 @@

      -

      -basic_ptree private member functions

      +

      +basic_ptree private member functions

        -
      1. self_type * walk_path(path_type & p) const;
        2. -
      2. self_type & force_path(path_type & p);
        3. +
      3. self_type * walk_path(path_type & p) const;
        4. +
      4. self_type & force_path(path_type & p);
      @@ -768,7 +768,7 @@
      90. -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/property_tree/customiz_idm45506971496960.html b/doc/html/boost/property_tree/customiz_idm45506971496960.html new file mode 100644 index 0000000000..b9c6ac4058 --- /dev/null +++ b/doc/html/boost/property_tree/customiz_idm45506971496960.html @@ -0,0 +1,68 @@ + + + + +Struct template customize_stream<Ch, Traits, Ch, void> + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Struct template customize_stream<Ch, Traits, Ch, void>

      +

      boost::property_tree::customize_stream<Ch, Traits, Ch, void>

      +
      +

      Synopsis

      +
      // In header: <boost/property_tree/stream_translator.hpp>
+
+template<typename Ch, typename Traits> 
+struct customize_stream<Ch, Traits, Ch, void> {
+
+  // public static functions
+  static void insert(std::basic_ostream< Ch, Traits > &, Ch);
+  static void extract(std::basic_istream< Ch, Traits > &, Ch &);
+};
      +
      +

      Description

      +
      +

      +customize_stream public static functions

      +
        +
      1. static void insert(std::basic_ostream< Ch, Traits > & s, Ch e);
        2. +
      2. static void extract(std::basic_istream< Ch, Traits > & s, Ch & e);
        3. +
      +
      +
      +
      + + + +
      Copyright © 2008-2010 Marcin Kalicinski
      Copyright © 2010-2013 Sebastian + Redl

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/property_tree/customiz_idm45507087332800.html b/doc/html/boost/property_tree/customiz_idm45507087332800.html new file mode 100644 index 0000000000..fbeaa245ba --- /dev/null +++ b/doc/html/boost/property_tree/customiz_idm45507087332800.html @@ -0,0 +1,68 @@ + + + + +Struct template customize_stream<Ch, Traits, signed char, void> + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Struct template customize_stream<Ch, Traits, signed char, void>

      +

      boost::property_tree::customize_stream<Ch, Traits, signed char, void>

      +
      +

      Synopsis

      +
      // In header: <boost/property_tree/stream_translator.hpp>
+
+template<typename Ch, typename Traits> 
+struct customize_stream<Ch, Traits, signed char, void> {
+
+  // public static functions
+  static void insert(std::basic_ostream< Ch, Traits > &, signed char);
+  static void extract(std::basic_istream< Ch, Traits > &, signed char &);
+};
      +
      +

      Description

      +
      +

      +customize_stream public static functions

      +
        +
      1. static void insert(std::basic_ostream< Ch, Traits > & s, signed char e);
        2. +
      2. static void extract(std::basic_istream< Ch, Traits > & s, signed char & e);
        3. +
      +
      +
      +
      + + + +
      Copyright © 2008-2010 Marcin Kalicinski
      Copyright © 2010-2013 Sebastian + Redl

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/property_tree/customiz_idm45507095445648.html b/doc/html/boost/property_tree/customiz_idm45507095445648.html new file mode 100644 index 0000000000..f45fdca8d0 --- /dev/null +++ b/doc/html/boost/property_tree/customiz_idm45507095445648.html @@ -0,0 +1,68 @@ + + + + +Struct template customize_stream<Ch, Traits, F, typename boost::enable_if< detail::is_inexact< F > >::type> + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Struct template customize_stream<Ch, Traits, F, typename boost::enable_if< detail::is_inexact< F > >::type>

      +

      boost::property_tree::customize_stream<Ch, Traits, F, typename boost::enable_if< detail::is_inexact< F > >::type>

      +
      +

      Synopsis

      +
      // In header: <boost/property_tree/stream_translator.hpp>
+
+template<typename Ch, typename Traits, typename F> 
+struct customize_stream<Ch, Traits, F, typename boost::enable_if< detail::is_inexact< F > >::type> {
+
+  // public static functions
+  static void insert(std::basic_ostream< Ch, Traits > &, const F &);
+  static void extract(std::basic_istream< Ch, Traits > &, F &);
+};
      +
      +

      Description

      +
      +

      +customize_stream public static functions

      +
        +
      1. static void insert(std::basic_ostream< Ch, Traits > & s, const F & e);
        2. +
      2. static void extract(std::basic_istream< Ch, Traits > & s, F & e);
        3. +
      +
      +
      +
      + + + +
      Copyright © 2008-2010 Marcin Kalicinski
      Copyright © 2010-2013 Sebastian + Redl

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/property_tree/customiz_idm45507101050960.html b/doc/html/boost/property_tree/customiz_idm45507101050960.html new file mode 100644 index 0000000000..8d163b2be2 --- /dev/null +++ b/doc/html/boost/property_tree/customiz_idm45507101050960.html @@ -0,0 +1,68 @@ + + + + +Struct template customize_stream<Ch, Traits, unsigned char, void> + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Struct template customize_stream<Ch, Traits, unsigned char, void>

      +

      boost::property_tree::customize_stream<Ch, Traits, unsigned char, void>

      +
      +

      Synopsis

      +
      // In header: <boost/property_tree/stream_translator.hpp>
+
+template<typename Ch, typename Traits> 
+struct customize_stream<Ch, Traits, unsigned char, void> {
+
+  // public static functions
+  static void insert(std::basic_ostream< Ch, Traits > &, unsigned char);
+  static void extract(std::basic_istream< Ch, Traits > &, unsigned char &);
+};
      +
      +

      Description

      +
      +

      +customize_stream public static functions

      +
        +
      1. static void insert(std::basic_ostream< Ch, Traits > & s, unsigned char e);
        2. +
      2. static void extract(std::basic_istream< Ch, Traits > & s, unsigned char & e);
        3. +
      +
      +
      +
      + + + +
      Copyright © 2008-2010 Marcin Kalicinski
      Copyright © 2010-2013 Sebastian + Redl

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/property_tree/customiz_idm45507104805872.html b/doc/html/boost/property_tree/customiz_idm45507104805872.html new file mode 100644 index 0000000000..e8854de0c5 --- /dev/null +++ b/doc/html/boost/property_tree/customiz_idm45507104805872.html @@ -0,0 +1,68 @@ + + + + +Struct template customize_stream<Ch, Traits, bool, void> + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Struct template customize_stream<Ch, Traits, bool, void>

      +

      boost::property_tree::customize_stream<Ch, Traits, bool, void>

      +
      +

      Synopsis

      +
      // In header: <boost/property_tree/stream_translator.hpp>
+
+template<typename Ch, typename Traits> 
+struct customize_stream<Ch, Traits, bool, void> {
+
+  // public static functions
+  static void insert(std::basic_ostream< Ch, Traits > &, bool);
+  static void extract(std::basic_istream< Ch, Traits > &, bool &);
+};
      +
      +

      Description

      +
      +

      +customize_stream public static functions

      +
        +
      1. static void insert(std::basic_ostream< Ch, Traits > & s, bool e);
        2. +
      2. static void extract(std::basic_istream< Ch, Traits > & s, bool & e);
        3. +
      +
      +
      +
      + + + +
      Copyright © 2008-2010 Marcin Kalicinski
      Copyright © 2010-2013 Sebastian + Redl

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/property_tree/customize_str_idp158967040.html b/doc/html/boost/property_tree/customize_str_idp158967040.html deleted file mode 100644 index ac86d3f1c4..0000000000 --- a/doc/html/boost/property_tree/customize_str_idp158967040.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct template customize_stream<Ch, Traits, signed char, void> - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Struct template customize_stream<Ch, Traits, signed char, void>

      -

      boost::property_tree::customize_stream<Ch, Traits, signed char, void>

      -
      -

      Synopsis

      -
      // In header: <boost/property_tree/stream_translator.hpp>
-
-template<typename Ch, typename Traits> 
-struct customize_stream<Ch, Traits, signed char, void> {
-
-  // public static functions
-  static void insert(std::basic_ostream< Ch, Traits > &, signed char);
-  static void extract(std::basic_istream< Ch, Traits > &, signed char &);
-};
      -
      -

      Description

      -
      -

      -customize_stream public static functions

      -
        -
      1. static void insert(std::basic_ostream< Ch, Traits > & s, signed char e);
        2. -
      2. static void extract(std::basic_istream< Ch, Traits > & s, signed char & e);
        3. -
      -
      -
      -
      - - - -
      Copyright © 2008-2010 Marcin Kalicinski
      Copyright © 2010-2013 Sebastian - Redl

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/property_tree/customize_str_idp160898256.html b/doc/html/boost/property_tree/customize_str_idp160898256.html deleted file mode 100644 index 018b99127d..0000000000 --- a/doc/html/boost/property_tree/customize_str_idp160898256.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct template customize_stream<Ch, Traits, Ch, void> - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Struct template customize_stream<Ch, Traits, Ch, void>

      -

      boost::property_tree::customize_stream<Ch, Traits, Ch, void>

      -
      -

      Synopsis

      -
      // In header: <boost/property_tree/stream_translator.hpp>
-
-template<typename Ch, typename Traits> 
-struct customize_stream<Ch, Traits, Ch, void> {
-
-  // public static functions
-  static void insert(std::basic_ostream< Ch, Traits > &, Ch);
-  static void extract(std::basic_istream< Ch, Traits > &, Ch &);
-};
      -
      -

      Description

      -
      -

      -customize_stream public static functions

      -
        -
      1. static void insert(std::basic_ostream< Ch, Traits > & s, Ch e);
        2. -
      2. static void extract(std::basic_istream< Ch, Traits > & s, Ch & e);
        3. -
      -
      -
      -
      - - - -
      Copyright © 2008-2010 Marcin Kalicinski
      Copyright © 2010-2013 Sebastian - Redl

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/property_tree/customize_str_idp224460896.html b/doc/html/boost/property_tree/customize_str_idp224460896.html deleted file mode 100644 index 8ab7adfc68..0000000000 --- a/doc/html/boost/property_tree/customize_str_idp224460896.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct template customize_stream<Ch, Traits, bool, void> - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Struct template customize_stream<Ch, Traits, bool, void>

      -

      boost::property_tree::customize_stream<Ch, Traits, bool, void>

      -
      -

      Synopsis

      -
      // In header: <boost/property_tree/stream_translator.hpp>
-
-template<typename Ch, typename Traits> 
-struct customize_stream<Ch, Traits, bool, void> {
-
-  // public static functions
-  static void insert(std::basic_ostream< Ch, Traits > &, bool);
-  static void extract(std::basic_istream< Ch, Traits > &, bool &);
-};
      -
      -

      Description

      -
      -

      -customize_stream public static functions

      -
        -
      1. static void insert(std::basic_ostream< Ch, Traits > & s, bool e);
        2. -
      2. static void extract(std::basic_istream< Ch, Traits > & s, bool & e);
        3. -
      -
      -
      -
      - - - -
      Copyright © 2008-2010 Marcin Kalicinski
      Copyright © 2010-2013 Sebastian - Redl

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/property_tree/customize_str_idp229460720.html b/doc/html/boost/property_tree/customize_str_idp229460720.html deleted file mode 100644 index 47d8f64063..0000000000 --- a/doc/html/boost/property_tree/customize_str_idp229460720.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct template customize_stream<Ch, Traits, unsigned char, void> - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Struct template customize_stream<Ch, Traits, unsigned char, void>

      -

      boost::property_tree::customize_stream<Ch, Traits, unsigned char, void>

      -
      -

      Synopsis

      -
      // In header: <boost/property_tree/stream_translator.hpp>
-
-template<typename Ch, typename Traits> 
-struct customize_stream<Ch, Traits, unsigned char, void> {
-
-  // public static functions
-  static void insert(std::basic_ostream< Ch, Traits > &, unsigned char);
-  static void extract(std::basic_istream< Ch, Traits > &, unsigned char &);
-};
      -
      -

      Description

      -
      -

      -customize_stream public static functions

      -
        -
      1. static void insert(std::basic_ostream< Ch, Traits > & s, unsigned char e);
        2. -
      2. static void extract(std::basic_istream< Ch, Traits > & s, unsigned char & e);
        3. -
      -
      -
      -
      - - - -
      Copyright © 2008-2010 Marcin Kalicinski
      Copyright © 2010-2013 Sebastian - Redl

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/property_tree/customize_stre_idp95731648.html b/doc/html/boost/property_tree/customize_stre_idp95731648.html deleted file mode 100644 index 848b65490a..0000000000 --- a/doc/html/boost/property_tree/customize_stre_idp95731648.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct template customize_stream<Ch, Traits, F, typename boost::enable_if< detail::is_inexact< F > >::type> - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Struct template customize_stream<Ch, Traits, F, typename boost::enable_if< detail::is_inexact< F > >::type>

      -

      boost::property_tree::customize_stream<Ch, Traits, F, typename boost::enable_if< detail::is_inexact< F > >::type>

      -
      -

      Synopsis

      -
      // In header: <boost/property_tree/stream_translator.hpp>
-
-template<typename Ch, typename Traits, typename F> 
-struct customize_stream<Ch, Traits, F, typename boost::enable_if< detail::is_inexact< F > >::type> {
-
-  // public static functions
-  static void insert(std::basic_ostream< Ch, Traits > &, const F &);
-  static void extract(std::basic_istream< Ch, Traits > &, F &);
-};
      -
      -

      Description

      -
      -

      -customize_stream public static functions

      -
        -
      1. static void insert(std::basic_ostream< Ch, Traits > & s, const F & e);
        2. -
      2. static void extract(std::basic_istream< Ch, Traits > & s, F & e);
        3. -
      -
      -
      -
      - - - -
      Copyright © 2008-2010 Marcin Kalicinski
      Copyright © 2010-2013 Sebastian - Redl

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/property_tree/customize_stream.html b/doc/html/boost/property_tree/customize_stream.html index a1f15bfb39..91de7bc58e 100644 --- a/doc/html/boost/property_tree/customize_stream.html +++ b/doc/html/boost/property_tree/customize_stream.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      @@ -35,18 +35,18 @@ template<typename Ch, typename Traits, typename E, typename Enabler = void> struct customize_stream { - // public static functions - static void insert(std::basic_ostream< Ch, Traits > &, const E &); - static void extract(std::basic_istream< Ch, Traits > &, E &); + // public static functions + static void insert(std::basic_ostream< Ch, Traits > &, const E &); + static void extract(std::basic_istream< Ch, Traits > &, E &); };
      -

      Description

      +

      Description

      -

      -customize_stream public static functions

      +

      +customize_stream public static functions

        -
      1. static void insert(std::basic_ostream< Ch, Traits > & s, const E & e);
        2. -
      2. static void extract(std::basic_istream< Ch, Traits > & s, E & e);
        3. +
      3. static void insert(std::basic_ostream< Ch, Traits > & s, const E & e);
        4. +
      4. static void extract(std::basic_istream< Ch, Traits > & s, E & e);
      @@ -62,7 +62,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/property_tree/id_translator.html b/doc/html/boost/property_tree/id_translator.html index be799141e2..8f86ebe46d 100644 --- a/doc/html/boost/property_tree/id_translator.html +++ b/doc/html/boost/property_tree/id_translator.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      @@ -38,18 +38,18 @@ typedef T internal_type; typedef T external_type; - // public member functions - boost::optional< T > get_value(const T &); - boost::optional< T > put_value(const T &); + // public member functions + boost::optional< T > get_value(const T &); + boost::optional< T > put_value(const T &); };
      -

      Description

      +

      Description

      -

      -id_translator public member functions

      +

      +id_translator public member functions

        -
      1. boost::optional< T > get_value(const T & v);
        2. -
      2. boost::optional< T > put_value(const T & v);
        3. +
      3. boost::optional< T > get_value(const T & v);
        4. +
      4. boost::optional< T > put_value(const T & v);
      @@ -65,7 +65,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/property_tree/info_parser/read_inf_idm45507037423408.html b/doc/html/boost/property_tree/info_parser/read_inf_idm45507037423408.html new file mode 100644 index 0000000000..d53d81edae --- /dev/null +++ b/doc/html/boost/property_tree/info_parser/read_inf_idm45507037423408.html @@ -0,0 +1,77 @@ + + + + +Function template read_info + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Function template read_info

      +

      boost::property_tree::info_parser::read_info

      +
      +

      Synopsis

      +
      // In header: <boost/property_tree/info_parser.hpp>
+
+
+template<typename Ptree, typename Ch> 
+  void read_info(std::basic_istream< Ch > & stream, Ptree & pt);
      +
      +

      Description

      +

      Read INFO from a the given stream and translate it to a property tree.

      +
      + + + + + +
      [Note]Note

      Replaces the existing contents. Strong exception guarantee.

      +

      + +

      +
      ++++ + + + + +

      Throws:

      		info_parser_error If the stream cannot be read, doesn't contain valid INFO, or a conversion fails.
      +
      +
      + + + +
      Copyright © 2008-2010 Marcin Kalicinski
      Copyright © 2010-2013 Sebastian + Redl

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/property_tree/info_parser/read_inf_idm45507037753408.html b/doc/html/boost/property_tree/info_parser/read_inf_idm45507037753408.html new file mode 100644 index 0000000000..7705472225 --- /dev/null +++ b/doc/html/boost/property_tree/info_parser/read_inf_idm45507037753408.html @@ -0,0 +1,78 @@ + + + + +Function template read_info + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Function template read_info

      +

      boost::property_tree::info_parser::read_info

      +
      +

      Synopsis

      +
      // In header: <boost/property_tree/info_parser.hpp>
+
+
+template<typename Ptree> 
+  void read_info(const std::string & filename, Ptree & pt, 
+                 const std::locale & loc = std::locale());
      +
      +

      Description

      +

      Read INFO from a the given file and translate it to a property tree. The tree's key type must be a string type, i.e. it must have a nested value_type typedef that is a valid parameter for basic_ifstream.

      +
      + + + + + +
      [Note]Note

      Replaces the existing contents. Strong exception guarantee.

      +

      + +

      +
      ++++ + + + + +

      Throws:

      		info_parser_error If the file cannot be read, doesn't contain valid INFO, or a conversion fails.
      +
      +
      + + + +
      Copyright © 2008-2010 Marcin Kalicinski
      Copyright © 2010-2013 Sebastian + Redl

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/property_tree/info_parser/read_inf_idm45507039400208.html b/doc/html/boost/property_tree/info_parser/read_inf_idm45507039400208.html new file mode 100644 index 0000000000..e034566fbe --- /dev/null +++ b/doc/html/boost/property_tree/info_parser/read_inf_idm45507039400208.html @@ -0,0 +1,87 @@ + + + + +Function template read_info + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Function template read_info

      +

      boost::property_tree::info_parser::read_info

      +
      +

      Synopsis

      +
      // In header: <boost/property_tree/info_parser.hpp>
+
+
+template<typename Ptree, typename Ch> 
+  void read_info(std::basic_istream< Ch > & stream, Ptree & pt, 
+                 const Ptree & default_ptree);
      +
      +

      Description

      +

      Read INFO from a the given stream and translate it to a property tree.

      +
      + + + + + +
      [Note]Note

      Replaces the existing contents. Strong exception guarantee.

      +

      + +

      +
      ++++ + + + + +

      Parameters:

      ++++ + + + + +

      default_ptree

      If parsing fails, pt is set to a copy of this tree.

      +
      +
      + + + +
      Copyright © 2008-2010 Marcin Kalicinski
      Copyright © 2010-2013 Sebastian + Redl

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/property_tree/info_parser/read_inf_idm45507043140816.html b/doc/html/boost/property_tree/info_parser/read_inf_idm45507043140816.html new file mode 100644 index 0000000000..8b9ea08651 --- /dev/null +++ b/doc/html/boost/property_tree/info_parser/read_inf_idm45507043140816.html @@ -0,0 +1,88 @@ + + + + +Function template read_info + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Function template read_info

      +

      boost::property_tree::info_parser::read_info

      +
      +

      Synopsis

      +
      // In header: <boost/property_tree/info_parser.hpp>
+
+
+template<typename Ptree> 
+  void read_info(const std::string & filename, Ptree & pt, 
+                 const Ptree & default_ptree, 
+                 const std::locale & loc = std::locale());
      +
      +

      Description

      +

      Read INFO from a the given file and translate it to a property tree. The tree's key type must be a string type, i.e. it must have a nested value_type typedef that is a valid parameter for basic_ifstream.

      +
      + + + + + +
      [Note]Note

      Replaces the existing contents. Strong exception guarantee.

      +

      + +

      +
      ++++ + + + + +

      Parameters:

      ++++ + + + + +

      default_ptree

      If parsing fails, pt is set to a copy of this tree.

      +
      +
      + + + +
      Copyright © 2008-2010 Marcin Kalicinski
      Copyright © 2010-2013 Sebastian + Redl

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/property_tree/info_parser/read_info_idp104306320.html b/doc/html/boost/property_tree/info_parser/read_info_idp104306320.html deleted file mode 100644 index 4ad0363a63..0000000000 --- a/doc/html/boost/property_tree/info_parser/read_info_idp104306320.html +++ /dev/null @@ -1,77 +0,0 @@ - - - - -Function template read_info - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Function template read_info

      -

      boost::property_tree::info_parser::read_info

      -
      -

      Synopsis

      -
      // In header: <boost/property_tree/info_parser.hpp>
-
-
-template<typename Ptree, typename Ch> 
-  void read_info(std::basic_istream< Ch > & stream, Ptree & pt);
      -
      -

      Description

      -

      Read INFO from a the given stream and translate it to a property tree.

      -
      - - - - - -
      [Note]Note

      Replaces the existing contents. Strong exception guarantee.

      -

      - -

      -
      ---- - - - - -

      Throws:

      		info_parser_error If the stream cannot be read, doesn't contain valid INFO, or a conversion fails.
      -
      -
      - - - -
      Copyright © 2008-2010 Marcin Kalicinski
      Copyright © 2010-2013 Sebastian - Redl

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/property_tree/info_parser/read_info_idp156124912.html b/doc/html/boost/property_tree/info_parser/read_info_idp156124912.html deleted file mode 100644 index d7a48c137d..0000000000 --- a/doc/html/boost/property_tree/info_parser/read_info_idp156124912.html +++ /dev/null @@ -1,88 +0,0 @@ - - - - -Function template read_info - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Function template read_info

      -

      boost::property_tree::info_parser::read_info

      -
      -

      Synopsis

      -
      // In header: <boost/property_tree/info_parser.hpp>
-
-
-template<typename Ptree> 
-  void read_info(const std::string & filename, Ptree & pt, 
-                 const Ptree & default_ptree, 
-                 const std::locale & loc = std::locale());
      -
      -

      Description

      -

      Read INFO from a the given file and translate it to a property tree. The tree's key type must be a string type, i.e. it must have a nested value_type typedef that is a valid parameter for basic_ifstream.

      -
      - - - - - -
      [Note]Note

      Replaces the existing contents. Strong exception guarantee.

      -

      - -

      -
      ---- - - - - -

      Parameters:

      ---- - - - - -

      default_ptree

      If parsing fails, pt is set to a copy of this tree.

      -
      -
      - - - -
      Copyright © 2008-2010 Marcin Kalicinski
      Copyright © 2010-2013 Sebastian - Redl

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/property_tree/info_parser/read_info_idp212307632.html b/doc/html/boost/property_tree/info_parser/read_info_idp212307632.html deleted file mode 100644 index 3e6b44c78b..0000000000 --- a/doc/html/boost/property_tree/info_parser/read_info_idp212307632.html +++ /dev/null @@ -1,78 +0,0 @@ - - - - -Function template read_info - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Function template read_info

      -

      boost::property_tree::info_parser::read_info

      -
      -

      Synopsis

      -
      // In header: <boost/property_tree/info_parser.hpp>
-
-
-template<typename Ptree> 
-  void read_info(const std::string & filename, Ptree & pt, 
-                 const std::locale & loc = std::locale());
      -
      -

      Description

      -

      Read INFO from a the given file and translate it to a property tree. The tree's key type must be a string type, i.e. it must have a nested value_type typedef that is a valid parameter for basic_ifstream.

      -
      - - - - - -
      [Note]Note

      Replaces the existing contents. Strong exception guarantee.

      -

      - -

      -
      ---- - - - - -

      Throws:

      		info_parser_error If the file cannot be read, doesn't contain valid INFO, or a conversion fails.
      -
      -
      - - - -
      Copyright © 2008-2010 Marcin Kalicinski
      Copyright © 2010-2013 Sebastian - Redl

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/property_tree/info_parser/read_info_idp99726240.html b/doc/html/boost/property_tree/info_parser/read_info_idp99726240.html deleted file mode 100644 index 818b578170..0000000000 --- a/doc/html/boost/property_tree/info_parser/read_info_idp99726240.html +++ /dev/null @@ -1,87 +0,0 @@ - - - - -Function template read_info - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Function template read_info

      -

      boost::property_tree::info_parser::read_info

      -
      -

      Synopsis

      -
      // In header: <boost/property_tree/info_parser.hpp>
-
-
-template<typename Ptree, typename Ch> 
-  void read_info(std::basic_istream< Ch > & stream, Ptree & pt, 
-                 const Ptree & default_ptree);
      -
      -

      Description

      -

      Read INFO from a the given stream and translate it to a property tree.

      -
      - - - - - -
      [Note]Note

      Replaces the existing contents. Strong exception guarantee.

      -

      - -

      -
      ---- - - - - -

      Parameters:

      ---- - - - - -

      default_ptree

      If parsing fails, pt is set to a copy of this tree.

      -
      -
      - - - -
      Copyright © 2008-2010 Marcin Kalicinski
      Copyright © 2010-2013 Sebastian - Redl

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/property_tree/info_parser/write_in_idm45506993828208.html b/doc/html/boost/property_tree/info_parser/write_in_idm45506993828208.html new file mode 100644 index 0000000000..f12a65f058 --- /dev/null +++ b/doc/html/boost/property_tree/info_parser/write_in_idm45506993828208.html @@ -0,0 +1,86 @@ + + + + +Function template write_info + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Function template write_info

      +

      boost::property_tree::info_parser::write_info

      +
      +

      Synopsis

      +
      // In header: <boost/property_tree/info_parser.hpp>
+
+
+template<typename Ptree> 
+  void write_info(const std::string & filename, const Ptree & pt, 
+                  const std::locale & loc = std::locale(), 
+                  const info_writer_settings< typename Ptree::key_type::value_type > & settings = info_writer_make_settings< typename Ptree::key_type::value_type >());
      +
      +

      Description

      +

      Writes a tree to the file in INFO format. The tree's key type must be a string type, i.e. it must have a nested value_type typedef that is a valid parameter for basic_ofstream. + +

      +
      ++++ + + + + + + + + + + +

      Parameters:

      ++++ + + + + +

      settings

      The settings to use when writing the INFO data.

      Throws:

      		info_parser_error If the file cannot be written to, or a conversion fails.
      +
      +
      + + + +
      Copyright © 2008-2010 Marcin Kalicinski
      Copyright © 2010-2013 Sebastian + Redl

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/property_tree/info_parser/write_in_idm45507043418960.html b/doc/html/boost/property_tree/info_parser/write_in_idm45507043418960.html new file mode 100644 index 0000000000..404da7e3b6 --- /dev/null +++ b/doc/html/boost/property_tree/info_parser/write_in_idm45507043418960.html @@ -0,0 +1,85 @@ + + + + +Function template write_info + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Function template write_info

      +

      boost::property_tree::info_parser::write_info

      +
      +

      Synopsis

      +
      // In header: <boost/property_tree/info_parser.hpp>
+
+
+template<typename Ptree, typename Ch> 
+  void write_info(std::basic_ostream< Ch > & stream, const Ptree & pt, 
+                  const info_writer_settings< Ch > & settings = info_writer_settings< Ch >());
      +
      +

      Description

      +

      Writes a tree to the stream in INFO format. + +

      +
      ++++ + + + + + + + + + + +

      Parameters:

      ++++ + + + + +

      settings

      The settings to use when writing the INFO data.

      Throws:

      		info_parser_error If the stream cannot be written to, or a conversion fails.
      +
      +
      + + + +
      Copyright © 2008-2010 Marcin Kalicinski
      Copyright © 2010-2013 Sebastian + Redl

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/property_tree/info_parser/write_info_idp205409920.html b/doc/html/boost/property_tree/info_parser/write_info_idp205409920.html deleted file mode 100644 index 57fa9b7cff..0000000000 --- a/doc/html/boost/property_tree/info_parser/write_info_idp205409920.html +++ /dev/null @@ -1,85 +0,0 @@ - - - - -Function template write_info - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Function template write_info

      -

      boost::property_tree::info_parser::write_info

      -
      -

      Synopsis

      -
      // In header: <boost/property_tree/info_parser.hpp>
-
-
-template<typename Ptree, typename Ch> 
-  void write_info(std::basic_ostream< Ch > & stream, const Ptree & pt, 
-                  const info_writer_settings< Ch > & settings = info_writer_settings< Ch >());
      -
      -

      Description

      -

      Writes a tree to the stream in INFO format. - -

      -
      ---- - - - - - - - - - - -

      Parameters:

      ---- - - - - -

      settings

      The settings to use when writing the INFO data.

      Throws:

      		info_parser_error If the stream cannot be written to, or a conversion fails.
      -
      -
      - - - -
      Copyright © 2008-2010 Marcin Kalicinski
      Copyright © 2010-2013 Sebastian - Redl

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/property_tree/info_parser/write_info_idp217672016.html b/doc/html/boost/property_tree/info_parser/write_info_idp217672016.html deleted file mode 100644 index 513f6718fc..0000000000 --- a/doc/html/boost/property_tree/info_parser/write_info_idp217672016.html +++ /dev/null @@ -1,86 +0,0 @@ - - - - -Function template write_info - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Function template write_info

      -

      boost::property_tree::info_parser::write_info

      -
      -

      Synopsis

      -
      // In header: <boost/property_tree/info_parser.hpp>
-
-
-template<typename Ptree> 
-  void write_info(const std::string & filename, const Ptree & pt, 
-                  const std::locale & loc = std::locale(), 
-                  const info_writer_settings< typename Ptree::key_type::value_type > & settings = info_writer_make_settings< typename Ptree::key_type::value_type >());
      -
      -

      Description

      -

      Writes a tree to the file in INFO format. The tree's key type must be a string type, i.e. it must have a nested value_type typedef that is a valid parameter for basic_ofstream. - -

      -
      ---- - - - - - - - - - - -

      Parameters:

      ---- - - - - -

      settings

      The settings to use when writing the INFO data.

      Throws:

      		info_parser_error If the file cannot be written to, or a conversion fails.
      -
      -
      - - - -
      Copyright © 2008-2010 Marcin Kalicinski
      Copyright © 2010-2013 Sebastian - Redl

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/property_tree/ini_parser/ini_parser_error.html b/doc/html/boost/property_tree/ini_parser/ini_parser_error.html index 97f40d60f5..e1a32b3e50 100644 --- a/doc/html/boost/property_tree/ini_parser/ini_parser_error.html +++ b/doc/html/boost/property_tree/ini_parser/ini_parser_error.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      @@ -36,18 +36,18 @@ class ini_parser_error : public file_parser_error { public: // construct/copy/destruct - ini_parser_error(const std::string &, const std::string &, unsigned long); + ini_parser_error(const std::string &, const std::string &, unsigned long); };
      -

      Description

      +

      Description

      Indicates an error parsing INI formatted data.

      -

      +

      ini_parser_error public construct/copy/destruct

      1. -
        ini_parser_error(const std::string & message, const std::string & filename, 
+
        ini_parser_error(const std::string & message, const std::string & filename, 
                  unsigned long line);
        
 
        Construct an ini_parser_error 
 
        
@@ -95,7 +95,7 @@
 
 
        
 
        
-PrevUpHomeNext
+PrevUpHomeNext
 
        
 
 
diff --git a/doc/html/boost/property_tree/ini_parser/read_ini_idm45507095400496.html b/doc/html/boost/property_tree/ini_parser/read_ini_idm45507095400496.html
new file mode 100644
index 0000000000..335616a620
--- /dev/null
+++ b/doc/html/boost/property_tree/ini_parser/read_ini_idm45507095400496.html
@@ -0,0 +1,105 @@
+
+
+
+
+Function template read_ini
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        
+
        
+
        
+PrevUpHomeNext
+
        
+
        
+
        
+
        
+
        Function template read_ini
        
+
        boost::property_tree::ini_parser::read_ini
        
+
        
+
        Synopsis
        
+
        // In header: <boost/property_tree/ini_parser.hpp>
+
+
+template<typename Ptree> 
+  void read_ini(const std::string & filename, Ptree & pt, 
+                const std::locale & loc = std::locale());
        
+
        
+
        Description
        
+
        Read INI from a the given file and translate it to a property tree. 
        
+
        
+
+
+
+
+
+
        [Note]Note
        Clears existing contents of property tree. In case of error the property tree unmodified. 
        
+
        
+
+
+
        
+
        
++++
+
+
+
+
+
+
+
+
+
+
+
        



        Parameters:
        
++++
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
        



        filename
        Name of file from which to read in the property tree. 
        loc
        The locale to use when reading in the file contents. 
        pt
        The property tree to populate. 
        Throws:
        		
+ini_parser_error In case of error deserializing the property tree. 
        
+
        
+
        
+
+
+
+
        Copyright © 2008-2010 Marcin Kalicinski
        Copyright © 2010-2013 Sebastian
+      Redl
        
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      
        
+
        
+
        
+
        
+PrevUpHomeNext
+
        
+
+
diff --git a/doc/html/boost/property_tree/ini_parser/read_ini_idm45507111553808.html b/doc/html/boost/property_tree/ini_parser/read_ini_idm45507111553808.html
new file mode 100644
index 0000000000..07f263ede8
--- /dev/null
+++ b/doc/html/boost/property_tree/ini_parser/read_ini_idm45507111553808.html
@@ -0,0 +1,101 @@
+
+
+
+
+Function template read_ini
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        
+
        
+
        
+PrevUpHomeNext
+
        
+
        
+
        
+
        
+
        Function template read_ini
        
+
        boost::property_tree::ini_parser::read_ini
        
+
        
+
        Synopsis
        
+
        // In header: <boost/property_tree/ini_parser.hpp>
+
+
+template<typename Ptree> 
+  void read_ini(std::basic_istream< typename Ptree::key_type::value_type > & stream, 
+                Ptree & pt);
        
+
        
+
        Description
        
+
        Read INI from a the given stream and translate it to a property tree. 
        
+
        
+
+
+
+
+
+
        [Note]Note
        Clears existing contents of property tree. In case of error the property tree is not modified. 
        
+
        
+
+
+
        
+
        
++++
+
+
+
+
+
+
+
+
+
+
+
        



        Parameters:
        
++++
+
+
+
+
+
+
+
+
+
+
+
        



        pt
        The property tree to populate. 
        stream
        Stream from which to read in the property tree. 
        Throws:
        		
+ini_parser_error If a format violation is found. 
        
+
        
+
        
+
+
+
+
        Copyright © 2008-2010 Marcin Kalicinski
        Copyright © 2010-2013 Sebastian
+      Redl
        
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      
        
+
        
+
        
+
        
+PrevUpHomeNext
+
        
+
+
diff --git a/doc/html/boost/property_tree/ini_parser/read_ini_idp101407088.html b/doc/html/boost/property_tree/ini_parser/read_ini_idp101407088.html
deleted file mode 100644
index 66630fe441..0000000000
--- a/doc/html/boost/property_tree/ini_parser/read_ini_idp101407088.html
+++ /dev/null
@@ -1,101 +0,0 @@
-
-
-
-
-Function template read_ini
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        
-
        
-
        
-PrevUpHomeNext
-
        
-
        
-
        
-
        
-
        Function template read_ini
        
-
        boost::property_tree::ini_parser::read_ini
        
-
        
-
        Synopsis
        
-
        // In header: <boost/property_tree/ini_parser.hpp>
-
-
-template<typename Ptree> 
-  void read_ini(std::basic_istream< typename Ptree::key_type::value_type > & stream, 
-                Ptree & pt);
        
-
        
-
        Description
        
-
        Read INI from a the given stream and translate it to a property tree. 
        
-
        
-
-
-
-
-
-
        [Note]Note
        Clears existing contents of property tree. In case of error the property tree is not modified. 
        
-
        
-
-
-
        
-
        
----
-
-
-
-
-
-
-
-
-
-
-
        



        Parameters:
        
----
-
-
-
-
-
-
-
-
-
-
-
        



        pt
        The property tree to populate. 
        stream
        Stream from which to read in the property tree. 
        Throws:
        		
-ini_parser_error If a format violation is found. 
        
-
        
-
        
-
-
-
-
        Copyright © 2008-2010 Marcin Kalicinski
        Copyright © 2010-2013 Sebastian
-      Redl
        
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      
        
-
        
-
        
-
        
-PrevUpHomeNext
-
        
-
-
diff --git a/doc/html/boost/property_tree/ini_parser/read_ini_idp230717168.html b/doc/html/boost/property_tree/ini_parser/read_ini_idp230717168.html
deleted file mode 100644
index 967e789416..0000000000
--- a/doc/html/boost/property_tree/ini_parser/read_ini_idp230717168.html
+++ /dev/null
@@ -1,105 +0,0 @@
-
-
-
-
-Function template read_ini
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        
-
        
-
        
-PrevUpHomeNext
-
        
-
        
-
        
-
        
-
        Function template read_ini
        
-
        boost::property_tree::ini_parser::read_ini
        
-
        
-
        Synopsis
        
-
        // In header: <boost/property_tree/ini_parser.hpp>
-
-
-template<typename Ptree> 
-  void read_ini(const std::string & filename, Ptree & pt, 
-                const std::locale & loc = std::locale());
        
-
        
-
        Description
        
-
        Read INI from a the given file and translate it to a property tree. 
        
-
        
-
-
-
-
-
-
        [Note]Note
        Clears existing contents of property tree. In case of error the property tree unmodified. 
        
-
        
-
-
-
        
-
        
----
-
-
-
-
-
-
-
-
-
-
-
        



        Parameters:
        
----
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
        



        filename
        Name of file from which to read in the property tree. 
        loc
        The locale to use when reading in the file contents. 
        pt
        The property tree to populate. 
        Throws:
        		
-ini_parser_error In case of error deserializing the property tree. 
        
-
        
-
        
-
-
-
-
        Copyright © 2008-2010 Marcin Kalicinski
        Copyright © 2010-2013 Sebastian
-      Redl
        
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      
        
-
        
-
        
-
        
-PrevUpHomeNext
-
        
-
-
diff --git a/doc/html/boost/property_tree/ini_parser/validate_flags.html b/doc/html/boost/property_tree/ini_parser/validate_flags.html
index 19135e993d..3dcdf01ac9 100644
--- a/doc/html/boost/property_tree/ini_parser/validate_flags.html
+++ b/doc/html/boost/property_tree/ini_parser/validate_flags.html
@@ -8,7 +8,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
        
 
        
 
        
-PrevUpHomeNext
+PrevUpHomeNext
 
        
 
        
 
        
@@ -35,7 +35,7 @@
 
 bool validate_flags(int flags);
      -

      Description

      +

      Description

      Determines whether the flags are valid for use with the ini_parser.

      @@ -77,7 +77,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/property_tree/ini_parser/write_in_idm45506981221152.html b/doc/html/boost/property_tree/ini_parser/write_in_idm45506981221152.html new file mode 100644 index 0000000000..9f1c6e0d68 --- /dev/null +++ b/doc/html/boost/property_tree/ini_parser/write_in_idm45506981221152.html @@ -0,0 +1,116 @@ + + + + +Function template write_ini + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Function template write_ini

      +

      boost::property_tree::ini_parser::write_ini

      +
      +

      Synopsis

      +
      // In header: <boost/property_tree/ini_parser.hpp>
+
+
+template<typename Ptree> 
+  void write_ini(std::basic_ostream< typename Ptree::key_type::value_type > & stream, 
+                 const Ptree & pt, int flags = 0);
      +
      +

      Description

      +

      Translates the property tree to INI and writes it the given output stream. + + + + + +

      +
      ++++ + + + + + + + + + + + + + + + + + + + + + + + + + + +

      Parameters:

      ++++ + + + + + + + + + + + + + + +

      flags

      The flags to use when writing the INI file. No flags are currently supported.

      pt

      The property tree to tranlsate to INI and output.

      stream

      The stream to which to write the INI representation of the property tree.

      Requires:

      pt cannot have data in its root.

      Requires:

      pt cannot have keys both data and children.

      Requires:

      pt cannot be deeper than two levels.

      Requires:

      There cannot be duplicate keys on any given level of pt.

      Throws:

      		 +ini_parser_error In case of error translating the property tree to INI or writing to the output stream.
      +
      +
      + + + +
      Copyright © 2008-2010 Marcin Kalicinski
      Copyright © 2010-2013 Sebastian + Redl

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/property_tree/ini_parser/write_in_idm45507103416992.html b/doc/html/boost/property_tree/ini_parser/write_in_idm45507103416992.html new file mode 100644 index 0000000000..8fa3d23368 --- /dev/null +++ b/doc/html/boost/property_tree/ini_parser/write_in_idm45507103416992.html @@ -0,0 +1,124 @@ + + + + +Function template write_ini + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Function template write_ini

      +

      boost::property_tree::ini_parser::write_ini

      +
      +

      Synopsis

      +
      // In header: <boost/property_tree/ini_parser.hpp>
+
+
+template<typename Ptree> 
+  void write_ini(const std::string & filename, const Ptree & pt, 
+                 int flags = 0, const std::locale & loc = std::locale());
      +
      +

      Description

      +

      Translates the property tree to INI and writes it the given file. + + + + + +

      +
      ++++ + + + + + + + + + + + + + + + + + + + + + + + + + + +

      Parameters:

      ++++ + + + + + + + + + + + + + + + + + + +

      filename

      The name of the file to which to write the INI representation of the property tree.

      flags

      		 +

      The flags to use when writing the INI file. The following flags are supported:

      +

      • skip_ini_validity_check <ndash></ndash> Skip check if ptree is a valid ini. The validity check covers the preconditions but takes O(n log n) time.

      +

      +

      +

      loc

      The locale to use when writing the file.

      pt

      The property tree to tranlsate to INI and output.

      Requires:

      pt cannot have data in its root.

      Requires:

      pt cannot have keys both data and children.

      Requires:

      pt cannot be deeper than two levels.

      Requires:

      There cannot be duplicate keys on any given level of pt.

      Throws:

      		info_parser_error In case of error translating the property tree to INI or writing to the file.
      +
      +
      + + + +
      Copyright © 2008-2010 Marcin Kalicinski
      Copyright © 2010-2013 Sebastian + Redl

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/property_tree/ini_parser/write_ini_idp155201728.html b/doc/html/boost/property_tree/ini_parser/write_ini_idp155201728.html deleted file mode 100644 index 11eeac63d6..0000000000 --- a/doc/html/boost/property_tree/ini_parser/write_ini_idp155201728.html +++ /dev/null @@ -1,116 +0,0 @@ - - - - -Function template write_ini - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Function template write_ini

      -

      boost::property_tree::ini_parser::write_ini

      -
      -

      Synopsis

      -
      // In header: <boost/property_tree/ini_parser.hpp>
-
-
-template<typename Ptree> 
-  void write_ini(std::basic_ostream< typename Ptree::key_type::value_type > & stream, 
-                 const Ptree & pt, int flags = 0);
      -
      -

      Description

      -

      Translates the property tree to INI and writes it the given output stream. - - - - - -

      -
      ---- - - - - - - - - - - - - - - - - - - - - - - - - - - -

      Parameters:

      ---- - - - - - - - - - - - - - - -

      flags

      The flags to use when writing the INI file. No flags are currently supported.

      pt

      The property tree to tranlsate to INI and output.

      stream

      The stream to which to write the INI representation of the property tree.

      Requires:

      pt cannot have data in its root.

      Requires:

      pt cannot have keys both data and children.

      Requires:

      pt cannot be deeper than two levels.

      Requires:

      There cannot be duplicate keys on any given level of pt.

      Throws:

      		 -ini_parser_error In case of error translating the property tree to INI or writing to the output stream.
      -
      -
      - - - -
      Copyright © 2008-2010 Marcin Kalicinski
      Copyright © 2010-2013 Sebastian - Redl

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/property_tree/ini_parser/write_ini_idp205666256.html b/doc/html/boost/property_tree/ini_parser/write_ini_idp205666256.html deleted file mode 100644 index 2fbb4d1d53..0000000000 --- a/doc/html/boost/property_tree/ini_parser/write_ini_idp205666256.html +++ /dev/null @@ -1,124 +0,0 @@ - - - - -Function template write_ini - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Function template write_ini

      -

      boost::property_tree::ini_parser::write_ini

      -
      -

      Synopsis

      -
      // In header: <boost/property_tree/ini_parser.hpp>
-
-
-template<typename Ptree> 
-  void write_ini(const std::string & filename, const Ptree & pt, 
-                 int flags = 0, const std::locale & loc = std::locale());
      -
      -

      Description

      -

      Translates the property tree to INI and writes it the given file. - - - - - -

      -
      ---- - - - - - - - - - - - - - - - - - - - - - - - - - - -

      Parameters:

      ---- - - - - - - - - - - - - - - - - - - -

      filename

      The name of the file to which to write the INI representation of the property tree.

      flags

      		 -

      The flags to use when writing the INI file. The following flags are supported:

      -

      • skip_ini_validity_check <ndash></ndash> Skip check if ptree is a valid ini. The validity check covers the preconditions but takes O(n log n) time.

      -

      -

      -

      loc

      The locale to use when writing the file.

      pt

      The property tree to tranlsate to INI and output.

      Requires:

      pt cannot have data in its root.

      Requires:

      pt cannot have keys both data and children.

      Requires:

      pt cannot be deeper than two levels.

      Requires:

      There cannot be duplicate keys on any given level of pt.

      Throws:

      		info_parser_error In case of error translating the property tree to INI or writing to the file.
      -
      -
      - - - -
      Copyright © 2008-2010 Marcin Kalicinski
      Copyright © 2010-2013 Sebastian - Redl

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/property_tree/iptree.html b/doc/html/boost/property_tree/iptree.html index 78dc88d01b..77a81d124c 100644 --- a/doc/html/boost/property_tree/iptree.html +++ b/doc/html/boost/property_tree/iptree.html @@ -35,7 +35,7 @@ typedef unspecified iptree;
      -

      Description

      +

      Description

      A property tree with std::string for key and data, and case-insensitive comparison.

      diff --git a/doc/html/boost/property_tree/json_parser/read_jso_idm45506991936080.html b/doc/html/boost/property_tree/json_parser/read_jso_idm45506991936080.html new file mode 100644 index 0000000000..9edef75ba6 --- /dev/null +++ b/doc/html/boost/property_tree/json_parser/read_jso_idm45506991936080.html @@ -0,0 +1,122 @@ + + + + +Function template read_json + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Function template read_json

      +

      boost::property_tree::json_parser::read_json

      +
      +

      Synopsis

      +
      // In header: <boost/property_tree/json_parser.hpp>
+
+
+template<typename Ptree> 
+  void read_json(const std::string & filename, Ptree & pt, 
+                 const std::locale & loc = std::locale());
      +
      +

      Description

      +

      Read JSON from a the given file and translate it to a property tree.

      +
      + + + + + +
      [Note]Note

      Clears existing contents of property tree. In case of error the property tree unmodified.

      +

      +

      +
      + + + + + +
      [Note]Note

      Items of JSON arrays are translated into ptree keys with empty names. Members of objects are translated into named keys.

      +

      +

      +
      + + + + + +
      [Note]Note

      JSON data can be a string, a numeric value, or one of literals "null", "true" and "false". During parse, any of the above is copied verbatim into ptree data string.

      +

      + + +

      +
      ++++ + + + + + + + + + + +

      Parameters:

      ++++ + + + + + + + + + + + + + + +

      filename

      Name of file from which to read in the property tree.

      loc

      The locale to use when reading in the file contents.

      pt

      The property tree to populate.

      Throws:

      		json_parser_error In case of error deserializing the property tree.
      +
      +
      + + + +
      Copyright © 2008-2010 Marcin Kalicinski
      Copyright © 2010-2013 Sebastian + Redl

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/property_tree/json_parser/read_jso_idm45507048694352.html b/doc/html/boost/property_tree/json_parser/read_jso_idm45507048694352.html new file mode 100644 index 0000000000..79ba948717 --- /dev/null +++ b/doc/html/boost/property_tree/json_parser/read_jso_idm45507048694352.html @@ -0,0 +1,118 @@ + + + + +Function template read_json + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Function template read_json

      +

      boost::property_tree::json_parser::read_json

      +
      +

      Synopsis

      +
      // In header: <boost/property_tree/json_parser.hpp>
+
+
+template<typename Ptree> 
+  void read_json(std::basic_istream< typename Ptree::key_type::value_type > & stream, 
+                 Ptree & pt);
      +
      +

      Description

      +

      Read JSON from a the given stream and translate it to a property tree.

      +
      + + + + + +
      [Note]Note

      Clears existing contents of property tree. In case of error the property tree unmodified.

      +

      +

      +
      + + + + + +
      [Note]Note

      Items of JSON arrays are translated into ptree keys with empty names. Members of objects are translated into named keys.

      +

      +

      +
      + + + + + +
      [Note]Note

      JSON data can be a string, a numeric value, or one of literals "null", "true" and "false". During parse, any of the above is copied verbatim into ptree data string.

      +

      + + +

      +
      ++++ + + + + + + + + + + +

      Parameters:

      ++++ + + + + + + + + + + +

      pt

      The property tree to populate.

      stream

      Stream from which to read in the property tree.

      Throws:

      		json_parser_error In case of error deserializing the property tree.
      +
      +
      + + + +
      Copyright © 2008-2010 Marcin Kalicinski
      Copyright © 2010-2013 Sebastian + Redl

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/property_tree/json_parser/read_json_idp110658880.html b/doc/html/boost/property_tree/json_parser/read_json_idp110658880.html deleted file mode 100644 index 65edbff561..0000000000 --- a/doc/html/boost/property_tree/json_parser/read_json_idp110658880.html +++ /dev/null @@ -1,118 +0,0 @@ - - - - -Function template read_json - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Function template read_json

      -

      boost::property_tree::json_parser::read_json

      -
      -

      Synopsis

      -
      // In header: <boost/property_tree/json_parser.hpp>
-
-
-template<typename Ptree> 
-  void read_json(std::basic_istream< typename Ptree::key_type::value_type > & stream, 
-                 Ptree & pt);
      -
      -

      Description

      -

      Read JSON from a the given stream and translate it to a property tree.

      -
      - - - - - -
      [Note]Note

      Clears existing contents of property tree. In case of error the property tree unmodified.

      -

      -

      -
      - - - - - -
      [Note]Note

      Items of JSON arrays are translated into ptree keys with empty names. Members of objects are translated into named keys.

      -

      -

      -
      - - - - - -
      [Note]Note

      JSON data can be a string, a numeric value, or one of literals "null", "true" and "false". During parse, any of the above is copied verbatim into ptree data string.

      -

      - - -

      -
      ---- - - - - - - - - - - -

      Parameters:

      ---- - - - - - - - - - - -

      pt

      The property tree to populate.

      stream

      Stream from which to read in the property tree.

      Throws:

      		json_parser_error In case of error deserializing the property tree.
      -
      -
      - - - -
      Copyright © 2008-2010 Marcin Kalicinski
      Copyright © 2010-2013 Sebastian - Redl

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/property_tree/json_parser/read_json_idp205445056.html b/doc/html/boost/property_tree/json_parser/read_json_idp205445056.html deleted file mode 100644 index af43e61ce0..0000000000 --- a/doc/html/boost/property_tree/json_parser/read_json_idp205445056.html +++ /dev/null @@ -1,122 +0,0 @@ - - - - -Function template read_json - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Function template read_json

      -

      boost::property_tree::json_parser::read_json

      -
      -

      Synopsis

      -
      // In header: <boost/property_tree/json_parser.hpp>
-
-
-template<typename Ptree> 
-  void read_json(const std::string & filename, Ptree & pt, 
-                 const std::locale & loc = std::locale());
      -
      -

      Description

      -

      Read JSON from a the given file and translate it to a property tree.

      -
      - - - - - -
      [Note]Note

      Clears existing contents of property tree. In case of error the property tree unmodified.

      -

      -

      -
      - - - - - -
      [Note]Note

      Items of JSON arrays are translated into ptree keys with empty names. Members of objects are translated into named keys.

      -

      -

      -
      - - - - - -
      [Note]Note

      JSON data can be a string, a numeric value, or one of literals "null", "true" and "false". During parse, any of the above is copied verbatim into ptree data string.

      -

      - - -

      -
      ---- - - - - - - - - - - -

      Parameters:

      ---- - - - - - - - - - - - - - - -

      filename

      Name of file from which to read in the property tree.

      loc

      The locale to use when reading in the file contents.

      pt

      The property tree to populate.

      Throws:

      		json_parser_error In case of error deserializing the property tree.
      -
      -
      - - - -
      Copyright © 2008-2010 Marcin Kalicinski
      Copyright © 2010-2013 Sebastian - Redl

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/property_tree/json_parser/write_js_idm45506991747200.html b/doc/html/boost/property_tree/json_parser/write_js_idm45506991747200.html new file mode 100644 index 0000000000..d62b3093d3 --- /dev/null +++ b/doc/html/boost/property_tree/json_parser/write_js_idm45506991747200.html @@ -0,0 +1,109 @@ + + + + +Function template write_json + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Function template write_json

      +

      boost::property_tree::json_parser::write_json

      +
      +

      Synopsis

      +
      // In header: <boost/property_tree/json_parser.hpp>
+
+
+template<typename Ptree> 
+  void write_json(std::basic_ostream< typename Ptree::key_type::value_type > & stream, 
+                  const Ptree & pt, bool pretty = true);
      +
      +

      Description

      +

      Translates the property tree to JSON and writes it the given output stream.

      +
      + + + + + +
      [Note]Note

      Any property tree key containing only unnamed subkeys will be rendered as JSON arrays.

      +

      + + + +

      +
      ++++ + + + + + + + + + + + + + + +

      Parameters:

      ++++ + + + + + + + + + + + + + + +

      pretty

      Whether to pretty-print. Defaults to true for backward compatibility.

      pt

      The property tree to tranlsate to JSON and output.

      stream

      The stream to which to write the JSON representation of the property tree.

      Requires:

      pt cannot contain keys that have both subkeys and non-empty data.

      Throws:

      		json_parser_error In case of error translating the property tree to JSON or writing to the output stream.
      +
      +
      + + + +
      Copyright © 2008-2010 Marcin Kalicinski
      Copyright © 2010-2013 Sebastian + Redl

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/property_tree/json_parser/write_js_idm45507045482448.html b/doc/html/boost/property_tree/json_parser/write_js_idm45507045482448.html new file mode 100644 index 0000000000..a3c24aedb5 --- /dev/null +++ b/doc/html/boost/property_tree/json_parser/write_js_idm45507045482448.html @@ -0,0 +1,114 @@ + + + + +Function template write_json + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Function template write_json

      +

      boost::property_tree::json_parser::write_json

      +
      +

      Synopsis

      +
      // In header: <boost/property_tree/json_parser.hpp>
+
+
+template<typename Ptree> 
+  void write_json(const std::string & filename, const Ptree & pt, 
+                  const std::locale & loc = std::locale(), 
+                  bool pretty = true);
      +
      +

      Description

      +

      Translates the property tree to JSON and writes it the given file.

      +
      + + + + + +
      [Note]Note

      Any property tree key containing only unnamed subkeys will be rendered as JSON arrays.

      +

      + + + +

      +
      ++++ + + + + + + + + + + + + + + +

      Parameters:

      ++++ + + + + + + + + + + + + + + + + + + +

      filename

      The name of the file to which to write the JSON representation of the property tree.

      loc

      The locale to use when writing out to the output file.

      pretty

      Whether to pretty-print. Defaults to true and last place for backward compatibility.

      pt

      The property tree to translate to JSON and output.

      Requires:

      pt cannot contain keys that have both subkeys and non-empty data.

      Throws:

      		json_parser_error In case of error translating the property tree to JSON or writing to the file.
      +
      +
      + + + +
      Copyright © 2008-2010 Marcin Kalicinski
      Copyright © 2010-2013 Sebastian + Redl

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/property_tree/json_parser/write_json_idp106721152.html b/doc/html/boost/property_tree/json_parser/write_json_idp106721152.html deleted file mode 100644 index d6a3b88461..0000000000 --- a/doc/html/boost/property_tree/json_parser/write_json_idp106721152.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - -Function template write_json - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Function template write_json

      -

      boost::property_tree::json_parser::write_json

      -
      -

      Synopsis

      -
      // In header: <boost/property_tree/json_parser.hpp>
-
-
-template<typename Ptree> 
-  void write_json(const std::string & filename, const Ptree & pt, 
-                  const std::locale & loc = std::locale(), 
-                  bool pretty = true);
      -
      -

      Description

      -

      Translates the property tree to JSON and writes it the given file.

      -
      - - - - - -
      [Note]Note

      Any property tree key containing only unnamed subkeys will be rendered as JSON arrays.

      -

      - - - -

      -
      ---- - - - - - - - - - - - - - - -

      Parameters:

      ---- - - - - - - - - - - - - - - - - - - -

      filename

      The name of the file to which to write the JSON representation of the property tree.

      loc

      The locale to use when writing out to the output file.

      pretty

      Whether to pretty-print. Defaults to true and last place for backward compatibility.

      pt

      The property tree to translate to JSON and output.

      Requires:

      pt cannot contain keys that have both subkeys and non-empty data.

      Throws:

      		json_parser_error In case of error translating the property tree to JSON or writing to the file.
      -
      -
      - - - -
      Copyright © 2008-2010 Marcin Kalicinski
      Copyright © 2010-2013 Sebastian - Redl

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/property_tree/json_parser/write_json_idp214458256.html b/doc/html/boost/property_tree/json_parser/write_json_idp214458256.html deleted file mode 100644 index acd56bc1c8..0000000000 --- a/doc/html/boost/property_tree/json_parser/write_json_idp214458256.html +++ /dev/null @@ -1,109 +0,0 @@ - - - - -Function template write_json - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Function template write_json

      -

      boost::property_tree::json_parser::write_json

      -
      -

      Synopsis

      -
      // In header: <boost/property_tree/json_parser.hpp>
-
-
-template<typename Ptree> 
-  void write_json(std::basic_ostream< typename Ptree::key_type::value_type > & stream, 
-                  const Ptree & pt, bool pretty = true);
      -
      -

      Description

      -

      Translates the property tree to JSON and writes it the given output stream.

      -
      - - - - - -
      [Note]Note

      Any property tree key containing only unnamed subkeys will be rendered as JSON arrays.

      -

      - - - -

      -
      ---- - - - - - - - - - - - - - - -

      Parameters:

      ---- - - - - - - - - - - - - - - -

      pretty

      Whether to pretty-print. Defaults to true for backward compatibility.

      pt

      The property tree to tranlsate to JSON and output.

      stream

      The stream to which to write the JSON representation of the property tree.

      Requires:

      pt cannot contain keys that have both subkeys and non-empty data.

      Throws:

      		json_parser_error In case of error translating the property tree to JSON or writing to the output stream.
      -
      -
      - - - -
      Copyright © 2008-2010 Marcin Kalicinski
      Copyright © 2010-2013 Sebastian - Redl

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/property_tree/load_idm45507150470080.html b/doc/html/boost/property_tree/load_idm45507150470080.html new file mode 100644 index 0000000000..be6f93081b --- /dev/null +++ b/doc/html/boost/property_tree/load_idm45507150470080.html @@ -0,0 +1,104 @@ + + + + +Function template load + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Function template load

      +

      boost::property_tree::load

      +
      +

      Synopsis

      +
      // In header: <boost/property_tree/ptree_serialization.hpp>
+
+
+template<typename Archive, typename K, typename D, typename C> 
+  void load(Archive & ar, basic_ptree< K, D, C > & t, 
+            const unsigned int file_version);
      +
      +

      Description

      +

      De-serialize the property tree to the given archive.

      +
      + + + + + +
      [Note]Note

      In addition to de-serializing from regular archives, this supports loading from archives requiring name-value pairs, e.g. XML archives. The format should be that used by boost::property_tree::save.

      +

      + + +

      +
      ++++ + + + + + + + + + + +

      Parameters:

      ++++ + + + + + + + + + + + + + + +

      ar

      The archive from which to load the serialized property tree. This archive should conform to the concept laid out by the Boost.Serialization library.

      file_version

      file_version for the archive.

      t

      The property tree to de-serialize.

      Postconditions:

      t will contain the de-serialized data from ar.

      +
      +
      + + + +
      Copyright © 2008-2010 Marcin Kalicinski
      Copyright © 2010-2013 Sebastian + Redl

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/property_tree/load_idp205463792.html b/doc/html/boost/property_tree/load_idp205463792.html deleted file mode 100644 index adb032e985..0000000000 --- a/doc/html/boost/property_tree/load_idp205463792.html +++ /dev/null @@ -1,104 +0,0 @@ - - - - -Function template load - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Function template load

      -

      boost::property_tree::load

      -
      -

      Synopsis

      -
      // In header: <boost/property_tree/ptree_serialization.hpp>
-
-
-template<typename Archive, typename K, typename D, typename C> 
-  void load(Archive & ar, basic_ptree< K, D, C > & t, 
-            const unsigned int file_version);
      -
      -

      Description

      -

      De-serialize the property tree to the given archive.

      -
      - - - - - -
      [Note]Note

      In addition to de-serializing from regular archives, this supports loading from archives requiring name-value pairs, e.g. XML archives. The format should be that used by boost::property_tree::save.

      -

      - - -

      -
      ---- - - - - - - - - - - -

      Parameters:

      ---- - - - - - - - - - - - - - - -

      ar

      The archive from which to load the serialized property tree. This archive should conform to the concept laid out by the Boost.Serialization library.

      file_version

      file_version for the archive.

      t

      The property tree to de-serialize.

      Postconditions:

      t will contain the de-serialized data from ar.

      -
      -
      - - - -
      Copyright © 2008-2010 Marcin Kalicinski
      Copyright © 2010-2013 Sebastian - Redl

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/property_tree/path.html b/doc/html/boost/property_tree/path.html index eacc92d9e3..90d5a3f097 100644 --- a/doc/html/boost/property_tree/path.html +++ b/doc/html/boost/property_tree/path.html @@ -33,9 +33,9 @@ 
      // In header: <boost/property_tree/ptree_fwd.hpp>
 
 
-typedef string_path< std::string, id_translator< std::string > > path;
      +typedef string_path< std::string, id_translator< std::string > > path;
      -

      Description

      +

      Description

      Implements a path using a std::string as the key.

      diff --git a/doc/html/boost/property_tree/path_of__idm45507049288992.html b/doc/html/boost/property_tree/path_of__idm45507049288992.html new file mode 100644 index 0000000000..5a358e0796 --- /dev/null +++ b/doc/html/boost/property_tree/path_of__idm45507049288992.html @@ -0,0 +1,56 @@ + + + + +Struct template path_of<std::basic_string< Ch, Traits, Alloc >> + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Struct template path_of<std::basic_string< Ch, Traits, Alloc >>

      +

      boost::property_tree::path_of<std::basic_string< Ch, Traits, Alloc >>

      +
      +

      Synopsis

      +
      // In header: <boost/property_tree/string_path.hpp>
+
+template<typename Ch, typename Traits, typename Alloc> 
+struct path_of<std::basic_string< Ch, Traits, Alloc >> {
+  // types
+  typedef std::basic_string< Ch, Traits, Alloc >           _string;
+  typedef string_path< _string, id_translator< _string > > type;   
+};
      +
      + + + +
      Copyright © 2008-2010 Marcin Kalicinski
      Copyright © 2010-2013 Sebastian + Redl

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/property_tree/path_of_std_b_idp106753552.html b/doc/html/boost/property_tree/path_of_std_b_idp106753552.html deleted file mode 100644 index 876b71410b..0000000000 --- a/doc/html/boost/property_tree/path_of_std_b_idp106753552.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Struct template path_of<std::basic_string< Ch, Traits, Alloc >> - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Struct template path_of<std::basic_string< Ch, Traits, Alloc >>

      -

      boost::property_tree::path_of<std::basic_string< Ch, Traits, Alloc >>

      -
      -

      Synopsis

      -
      // In header: <boost/property_tree/string_path.hpp>
-
-template<typename Ch, typename Traits, typename Alloc> 
-struct path_of<std::basic_string< Ch, Traits, Alloc >> {
-  // types
-  typedef std::basic_string< Ch, Traits, Alloc >           _string;
-  typedef string_path< _string, id_translator< _string > > type;   
-};
      -
      - - - -
      Copyright © 2008-2010 Marcin Kalicinski
      Copyright © 2010-2013 Sebastian - Redl

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/property_tree/ptree.html b/doc/html/boost/property_tree/ptree.html index c0f6e05e49..ebcadb53f6 100644 --- a/doc/html/boost/property_tree/ptree.html +++ b/doc/html/boost/property_tree/ptree.html @@ -35,7 +35,7 @@ typedef basic_ptree< std::string, std::string > ptree;
    -

    Description

    +

    Description

    A property tree with std::string for key and data, and default comparison.

    diff --git a/doc/html/boost/property_tree/ptree_bad_data.html b/doc/html/boost/property_tree/ptree_bad_data.html index 1fb8d2f455..7f04b9fafe 100644 --- a/doc/html/boost/property_tree/ptree_bad_data.html +++ b/doc/html/boost/property_tree/ptree_bad_data.html @@ -36,22 +36,22 @@ class ptree_bad_data : public boost::property_tree::ptree_error { public: // construct/copy/destruct - template<typename T> ptree_bad_data(const std::string &, const T &); - ~ptree_bad_data(); + template<typename T> ptree_bad_data(const std::string &, const T &); + ~ptree_bad_data(); - // public member functions - template<typename T> T data() const; + // public member functions + template<typename T> T data() const; };
    -

    Description

    +

    Description

    -

    +

    ptree_bad_data public construct/copy/destruct

    1. -
      template<typename T> ptree_bad_data(const std::string & what, const T & data);
      Instantiate a ptree_bad_data instance with the given message and data.

      +

      template<typename T> ptree_bad_data(const std::string & what, const T & data);
      Instantiate a ptree_bad_data instance with the given message and data.

      @@ -79,14 +79,14 @@
      2. -
    2. ~ptree_bad_data();
      3. +
    3. ~ptree_bad_data();
    -

    -ptree_bad_data public member functions

    +

    +ptree_bad_data public member functions

    1. -
      template<typename T> T data() const;
      Retrieve the data associated with this error. This is the source value that failed to be translated. You need to explicitly specify its type.
    +
    template<typename T> T data() const;
    Retrieve the data associated with this error. This is the source value that failed to be translated. You need to explicitly specify its type.
    diff --git a/doc/html/boost/property_tree/ptree_bad_path.html b/doc/html/boost/property_tree/ptree_bad_path.html index caf1376c43..d0260b1659 100644 --- a/doc/html/boost/property_tree/ptree_bad_path.html +++ b/doc/html/boost/property_tree/ptree_bad_path.html @@ -36,22 +36,22 @@ class ptree_bad_path : public boost::property_tree::ptree_error { public: // construct/copy/destruct - template<typename T> ptree_bad_path(const std::string &, const T &); - ~ptree_bad_path(); + template<typename T> ptree_bad_path(const std::string &, const T &); + ~ptree_bad_path(); - // public member functions - template<typename T> T path() const; + // public member functions + template<typename T> T path() const; };
    -

    Description

    +

    Description

    -

    +

    ptree_bad_path public construct/copy/destruct

    1. -
      template<typename T> ptree_bad_path(const std::string & what, const T & path);
      Instantiate a ptree_bad_path with the given message and path data.

      +

      template<typename T> ptree_bad_path(const std::string & what, const T & path);
      Instantiate a ptree_bad_path with the given message and path data.

      @@ -79,14 +79,14 @@
      2. -
    2. ~ptree_bad_path();
      3. +
    3. ~ptree_bad_path();
    -

    -ptree_bad_path public member functions

    +

    +ptree_bad_path public member functions

    1. -
      template<typename T> T path() const;
      Retrieve the invalid path. You need to explicitly specify the type of path.
    +
    template<typename T> T path() const;
    Retrieve the invalid path. You need to explicitly specify the type of path.
    diff --git a/doc/html/boost/property_tree/ptree_error.html b/doc/html/boost/property_tree/ptree_error.html index d3f3a9c28c..21be871bc4 100644 --- a/doc/html/boost/property_tree/ptree_error.html +++ b/doc/html/boost/property_tree/ptree_error.html @@ -36,19 +36,19 @@ class ptree_error : public runtime_error { public: // construct/copy/destruct - ptree_error(const std::string &); - ~ptree_error(); + ptree_error(const std::string &); + ~ptree_error(); };
    -

    Description

    +

    Description

    -

    +

    ptree_error public construct/copy/destruct

    1. -
      ptree_error(const std::string & what);
      Instantiate a ptree_error instance with the given message.

      +

      ptree_error(const std::string & what);
      Instantiate a ptree_error instance with the given message.

      @@ -70,7 +70,7 @@
      2. -
    2. ~ptree_error();
      3. +
    3. ~ptree_error();
    diff --git a/doc/html/boost/property_tree/save_idm45507111019696.html b/doc/html/boost/property_tree/save_idm45507111019696.html new file mode 100644 index 0000000000..73e89c57b1 --- /dev/null +++ b/doc/html/boost/property_tree/save_idm45507111019696.html @@ -0,0 +1,104 @@ + + + + +Function template save + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template save

    +

    boost::property_tree::save

    +
    +

    Synopsis

    +
    // In header: <boost/property_tree/ptree_serialization.hpp>
+
+
+template<typename Archive, typename K, typename D, typename C> 
+  void save(Archive & ar, const basic_ptree< K, D, C > & t, 
+            const unsigned int file_version);
    +
    +

    Description

    +

    Serialize the property tree to the given archive.

    +
    + + + + + +
    [Note]Note

    In addition to serializing to regular archives, this supports serializing to archives requiring name-value pairs, e.g. XML archives. However, the output format in the XML archive is not guaranteed to be the same as that when using the Boost.PropertyTree library's boost::property_tree::xml_parser::write_xml.

    +

    + + +

    +
    ++++ + + + + + + + + + + +

    Parameters:

    ++++ + + + + + + + + + + + + + + +

    ar

    The archive to which to save the serialized property tree. This archive should conform to the concept laid out by the Boost.Serialization library.

    file_version

    file_version for the archive.

    t

    The property tree to serialize.

    Postconditions:

    ar will contain the serialized form of t.

    +
    +
    + + + +
    Copyright © 2008-2010 Marcin Kalicinski
    Copyright © 2010-2013 Sebastian + Redl

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/property_tree/save_idp154187280.html b/doc/html/boost/property_tree/save_idp154187280.html deleted file mode 100644 index 0ca7adb906..0000000000 --- a/doc/html/boost/property_tree/save_idp154187280.html +++ /dev/null @@ -1,104 +0,0 @@ - - - - -Function template save - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template save

    -

    boost::property_tree::save

    -
    -

    Synopsis

    -
    // In header: <boost/property_tree/ptree_serialization.hpp>
-
-
-template<typename Archive, typename K, typename D, typename C> 
-  void save(Archive & ar, const basic_ptree< K, D, C > & t, 
-            const unsigned int file_version);
    -
    -

    Description

    -

    Serialize the property tree to the given archive.

    -
    - - - - - -
    [Note]Note

    In addition to serializing to regular archives, this supports serializing to archives requiring name-value pairs, e.g. XML archives. However, the output format in the XML archive is not guaranteed to be the same as that when using the Boost.PropertyTree library's boost::property_tree::xml_parser::write_xml.

    -

    - - -

    -
    ---- - - - - - - - - - - -

    Parameters:

    ---- - - - - - - - - - - - - - - -

    ar

    The archive to which to save the serialized property tree. This archive should conform to the concept laid out by the Boost.Serialization library.

    file_version

    file_version for the archive.

    t

    The property tree to serialize.

    Postconditions:

    ar will contain the serialized form of t.

    -
    -
    - - - -
    Copyright © 2008-2010 Marcin Kalicinski
    Copyright © 2010-2013 Sebastian - Redl

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/property_tree/serializ_idm45506988487232.html b/doc/html/boost/property_tree/serializ_idm45506988487232.html new file mode 100644 index 0000000000..72ad438cb1 --- /dev/null +++ b/doc/html/boost/property_tree/serializ_idm45506988487232.html @@ -0,0 +1,88 @@ + + + + +Function template serialize + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template serialize

    +

    boost::property_tree::serialize

    +
    +

    Synopsis

    +
    // In header: <boost/property_tree/ptree_serialization.hpp>
+
+
+template<typename Archive, typename K, typename D, typename C> 
+  void serialize(Archive & ar, basic_ptree< K, D, C > & t, 
+                 const unsigned int file_version);
    +
    +

    Description

    +

    Load or store the property tree using the given archive. +

    +
    ++++ + + + + +

    Parameters:

    ++++ + + + + + + + + + + + + + + +

    ar

    The archive from which to load or save the serialized property tree. The type of this archive will determine whether saving or loading is performed.

    file_version

    file_version for the archive.

    t

    The property tree to load or save.

    +
    +
    + + + +
    Copyright © 2008-2010 Marcin Kalicinski
    Copyright © 2010-2013 Sebastian + Redl

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/property_tree/serialize_idp98162352.html b/doc/html/boost/property_tree/serialize_idp98162352.html deleted file mode 100644 index 2d54e20fc5..0000000000 --- a/doc/html/boost/property_tree/serialize_idp98162352.html +++ /dev/null @@ -1,88 +0,0 @@ - - - - -Function template serialize - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template serialize

    -

    boost::property_tree::serialize

    -
    -

    Synopsis

    -
    // In header: <boost/property_tree/ptree_serialization.hpp>
-
-
-template<typename Archive, typename K, typename D, typename C> 
-  void serialize(Archive & ar, basic_ptree< K, D, C > & t, 
-                 const unsigned int file_version);
    -
    -

    Description

    -

    Load or store the property tree using the given archive. -

    -
    ---- - - - - -

    Parameters:

    ---- - - - - - - - - - - - - - - -

    ar

    The archive from which to load or save the serialized property tree. The type of this archive will determine whether saving or loading is performed.

    file_version

    file_version for the archive.

    t

    The property tree to load or save.

    -
    -
    - - - -
    Copyright © 2008-2010 Marcin Kalicinski
    Copyright © 2010-2013 Sebastian - Redl

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/property_tree/stream_translator.html b/doc/html/boost/property_tree/stream_translator.html index 6aea2478be..ddfadedc12 100644 --- a/doc/html/boost/property_tree/stream_translator.html +++ b/doc/html/boost/property_tree/stream_translator.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -40,27 +40,27 @@ typedef E external_type; // construct/copy/destruct - explicit stream_translator(std::locale = std::locale()); + explicit stream_translator(std::locale = std::locale()); - // public member functions - boost::optional< E > get_value(const internal_type &); - boost::optional< internal_type > put_value(const E &); + // public member functions + boost::optional< E > get_value(const internal_type &); + boost::optional< internal_type > put_value(const E &); };
    -

    Description

    +

    Description

    -

    +

    stream_translator public construct/copy/destruct

    -
    1. explicit stream_translator(std::locale loc = std::locale());
    +
    1. explicit stream_translator(std::locale loc = std::locale());
    -

    -stream_translator public member functions

    +

    +stream_translator public member functions

      -
    1. boost::optional< E > get_value(const internal_type & v);
      2. -
    2. boost::optional< internal_type > put_value(const E & v);
      3. +
    3. boost::optional< E > get_value(const internal_type & v);
      4. +
    4. boost::optional< internal_type > put_value(const E & v);
    @@ -76,7 +76,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/property_tree/string_path.html b/doc/html/boost/property_tree/string_path.html new file mode 100644 index 0000000000..483243eb23 --- /dev/null +++ b/doc/html/boost/property_tree/string_path.html @@ -0,0 +1,214 @@ + + + + +Class template string_path + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Class template string_path

    +

    boost::property_tree::string_path — Default path class. A path is a sequence of values. Groups of values are separated by the separator value, which defaults to '.' cast to the sequence's value type. The group of values is then passed to the translator to get a key.

    +
    +

    Synopsis

    +
    // In header: <boost/property_tree/string_path.hpp>
+
+template<typename String, typename Translator> 
+class string_path {
+public:
+  // types
+  typedef Translator::external_type key_type; 
+  typedef String::value_type        char_type;
+
+  // construct/copy/destruct
+  explicit string_path(char_type = char_type('.'));
+  string_path(const String &, char_type = char_type('.'), 
+              Translator = Translator());
+  string_path(const char_type *, char_type = char_type('.'), 
+              Translator = Translator());
+  string_path(const string_path &);
+  string_path & operator=(const string_path &);
+
+  // private member functions
+   BOOST_STATIC_ASSERT((is_same< String, typename Translator::internal_type >::value));
+  s_c_iter cstart() const;
+
+  // public member functions
+  key_type reduce();
+  bool empty() const;
+  bool single() const;
+  char_type separator() const;
+  std::string dump() const;
+  string_path & operator/=(const string_path &);
+};
    +
    +

    Description

    +

    If instantiated with std::string and id_translator<std::string>, it accepts paths of the form "one.two.three.four".

    +

    +

    +
    +

    Template Parameters

    +
      +
    1. +
      typename String
      +

      Any Sequence. If the sequence does not support random- access iteration, concatenation of paths assumes that insertions at the end preserve iterator validity.

      +
      2. +
    2. +
      typename Translator
      +

      A translator with internal_type == String.

      +
      3. +
    +
    +
    +

    +string_path + public + construct/copy/destruct

    +
      +
    1. +
      explicit string_path(char_type separator = char_type('.'));
      Create an empty path.
      2. +
    2. +
      string_path(const String & value, char_type separator = char_type('.'), 
+            Translator tr = Translator());
      Create a path by parsing the given string.

      +

      +
      ++++ + + + + +

      Parameters:

      ++++ + + + + + + + + + + + + + + +

      separator

      The separator used in parsing. Defaults to '.'.

      tr

      The translator used by this path to convert the individual parts to keys.

      value

      A sequence, possibly with separators, that describes the path, e.g. "one.two.three".

      +
      3. +
    3. +
      string_path(const char_type * value, char_type separator = char_type('.'), 
+            Translator tr = Translator());
      Create a path by parsing the given string.

      +

      +
      ++++ + + + + +

      Parameters:

      ++++ + + + + + + + + + + + + + + +

      separator

      The separator used in parsing. Defaults to '.'.

      tr

      The translator used by this path to convert the individual parts to keys.

      value

      A zero-terminated array of values. Only use if zero- termination makes sense for your type, and your sequence supports construction from it. Intended for string literals.

      +
      4. +
    4. string_path(const string_path & o);
      5. +
    5. string_path & operator=(const string_path & o);
      6. +
    +
    +
    +

    +string_path private member functions

    +
      +
    1.  BOOST_STATIC_ASSERT((is_same< String, typename Translator::internal_type >::value));
      2. +
    2. s_c_iter cstart() const;
      3. +
    +
    +
    +

    +string_path public member functions

    +
      +
    1. +
      key_type reduce();
      Take a single element off the path at the front and return it.
      2. +
    2. +
      bool empty() const;
      Test if the path is empty.
      3. +
    3. +
      bool single() const;
      Test if the path contains a single element, i.e. no separators.
      4. +
    4. +
      char_type separator() const;
      Get the separator used by this path.
      5. +
    5. std::string dump() const;
      6. +
    6. +
      string_path & operator/=(const string_path & o);
      Append a second path to this one.

      +

      +
      ++++ + + + + +

      Requires:

      o's separator is the same as this one's, or o has no separators

      +
      7. +
    +
    +
    +
    + + + +
    Copyright © 2008-2010 Marcin Kalicinski
    Copyright © 2010-2013 Sebastian + Redl

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/property_tree/swap_idm45507111027024.html b/doc/html/boost/property_tree/swap_idm45507111027024.html new file mode 100644 index 0000000000..2c8556b20c --- /dev/null +++ b/doc/html/boost/property_tree/swap_idm45507111027024.html @@ -0,0 +1,57 @@ + + + + +Function template swap + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template swap

    +

    boost::property_tree::swap

    +
    +

    Synopsis

    +
    // In header: <boost/property_tree/ptree_fwd.hpp>
+
+
+template<typename K, typename D, typename C> 
+  void swap(basic_ptree< K, D, C > & pt1, basic_ptree< K, D, C > & pt2);
    +
    +

    Description

    +

    Swap two property tree instances.

    +
    +
    + + + +
    Copyright © 2008-2010 Marcin Kalicinski
    Copyright © 2010-2013 Sebastian + Redl

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/property_tree/swap_idp92371152.html b/doc/html/boost/property_tree/swap_idp92371152.html deleted file mode 100644 index 80338f2eab..0000000000 --- a/doc/html/boost/property_tree/swap_idp92371152.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function template swap - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template swap

    -

    boost::property_tree::swap

    -
    -

    Synopsis

    -
    // In header: <boost/property_tree/ptree_fwd.hpp>
-
-
-template<typename K, typename D, typename C> 
-  void swap(basic_ptree< K, D, C > & pt1, basic_ptree< K, D, C > & pt2);
    -
    -

    Description

    -

    Swap two property tree instances.

    -
    -
    - - - -
    Copyright © 2008-2010 Marcin Kalicinski
    Copyright © 2010-2013 Sebastian - Redl

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/property_tree/translat_idm45506990189296.html b/doc/html/boost/property_tree/translat_idm45506990189296.html new file mode 100644 index 0000000000..299fa676a7 --- /dev/null +++ b/doc/html/boost/property_tree/translat_idm45506990189296.html @@ -0,0 +1,55 @@ + + + + +Struct template translator_between<std::basic_string< Ch, Traits, Alloc >, E> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct template translator_between<std::basic_string< Ch, Traits, Alloc >, E>

    +

    boost::property_tree::translator_between<std::basic_string< Ch, Traits, Alloc >, E>

    +
    +

    Synopsis

    +
    // In header: <boost/property_tree/stream_translator.hpp>
+
+template<typename Ch, typename Traits, typename Alloc, typename E> 
+struct translator_between<std::basic_string< Ch, Traits, Alloc >, E> {
+  // types
+  typedef stream_translator< Ch, Traits, Alloc, E > type;
+};
    +
    + + + +
    Copyright © 2008-2010 Marcin Kalicinski
    Copyright © 2010-2013 Sebastian + Redl

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/property_tree/translat_idm45507038344480.html b/doc/html/boost/property_tree/translat_idm45507038344480.html new file mode 100644 index 0000000000..594013e332 --- /dev/null +++ b/doc/html/boost/property_tree/translat_idm45507038344480.html @@ -0,0 +1,55 @@ + + + + +Struct template translator_between<std::basic_string< Ch, Traits, Alloc >, std::basic_string< Ch, Traits, Alloc >> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct template translator_between<std::basic_string< Ch, Traits, Alloc >, std::basic_string< Ch, Traits, Alloc >>

    +

    boost::property_tree::translator_between<std::basic_string< Ch, Traits, Alloc >, std::basic_string< Ch, Traits, Alloc >>

    +
    +

    Synopsis

    +
    // In header: <boost/property_tree/id_translator.hpp>
+
+template<typename Ch, typename Traits, typename Alloc> 
+struct translator_between<std::basic_string< Ch, Traits, Alloc >, std::basic_string< Ch, Traits, Alloc >> {
+  // types
+  typedef id_translator< std::basic_string< Ch, Traits, Alloc > > type;
+};
    +
    + + + +
    Copyright © 2008-2010 Marcin Kalicinski
    Copyright © 2010-2013 Sebastian + Redl

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/property_tree/translat_idm45507040148096.html b/doc/html/boost/property_tree/translat_idm45507040148096.html new file mode 100644 index 0000000000..92bd066301 --- /dev/null +++ b/doc/html/boost/property_tree/translat_idm45507040148096.html @@ -0,0 +1,55 @@ + + + + +Struct template translator_between<T, T> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct template translator_between<T, T>

    +

    boost::property_tree::translator_between<T, T>

    +
    +

    Synopsis

    +
    // In header: <boost/property_tree/id_translator.hpp>
+
+template<typename T> 
+struct translator_between<T, T> {
+  // types
+  typedef id_translator< T > type;
+};
    +
    + + + +
    Copyright © 2008-2010 Marcin Kalicinski
    Copyright © 2010-2013 Sebastian + Redl

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/property_tree/translator_be_idp205820704.html b/doc/html/boost/property_tree/translator_be_idp205820704.html deleted file mode 100644 index f3bee5f8f2..0000000000 --- a/doc/html/boost/property_tree/translator_be_idp205820704.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template translator_between<std::basic_string< Ch, Traits, Alloc >, E> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template translator_between<std::basic_string< Ch, Traits, Alloc >, E>

    -

    boost::property_tree::translator_between<std::basic_string< Ch, Traits, Alloc >, E>

    -
    -

    Synopsis

    -
    // In header: <boost/property_tree/stream_translator.hpp>
-
-template<typename Ch, typename Traits, typename Alloc, typename E> 
-struct translator_between<std::basic_string< Ch, Traits, Alloc >, E> {
-  // types
-  typedef stream_translator< Ch, Traits, Alloc, E > type;
-};
    -
    - - - -
    Copyright © 2008-2010 Marcin Kalicinski
    Copyright © 2010-2013 Sebastian - Redl

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/property_tree/translator_be_idp207680880.html b/doc/html/boost/property_tree/translator_be_idp207680880.html deleted file mode 100644 index 99306c8fb2..0000000000 --- a/doc/html/boost/property_tree/translator_be_idp207680880.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template translator_between<T, T> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template translator_between<T, T>

    -

    boost::property_tree::translator_between<T, T>

    -
    -

    Synopsis

    -
    // In header: <boost/property_tree/id_translator.hpp>
-
-template<typename T> 
-struct translator_between<T, T> {
-  // types
-  typedef id_translator< T > type;
-};
    -
    - - - -
    Copyright © 2008-2010 Marcin Kalicinski
    Copyright © 2010-2013 Sebastian - Redl

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/property_tree/translator_be_idp215878496.html b/doc/html/boost/property_tree/translator_be_idp215878496.html deleted file mode 100644 index c3cc4668b1..0000000000 --- a/doc/html/boost/property_tree/translator_be_idp215878496.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template translator_between<std::basic_string< Ch, Traits, Alloc >, std::basic_string< Ch, Traits, Alloc >> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template translator_between<std::basic_string< Ch, Traits, Alloc >, std::basic_string< Ch, Traits, Alloc >>

    -

    boost::property_tree::translator_between<std::basic_string< Ch, Traits, Alloc >, std::basic_string< Ch, Traits, Alloc >>

    -
    -

    Synopsis

    -
    // In header: <boost/property_tree/id_translator.hpp>
-
-template<typename Ch, typename Traits, typename Alloc> 
-struct translator_between<std::basic_string< Ch, Traits, Alloc >, std::basic_string< Ch, Traits, Alloc >> {
-  // types
-  typedef id_translator< std::basic_string< Ch, Traits, Alloc > > type;
-};
    -
    - - - -
    Copyright © 2008-2010 Marcin Kalicinski
    Copyright © 2010-2013 Sebastian - Redl

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/property_tree/wiptree.html b/doc/html/boost/property_tree/wiptree.html index d21d4779e0..d795d5dcce 100644 --- a/doc/html/boost/property_tree/wiptree.html +++ b/doc/html/boost/property_tree/wiptree.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -35,7 +35,7 @@ typedef unspecified wiptree;
    -

    Description

    +

    Description

    A property tree with std::wstring for key and data, and case-insensitive comparison.

    @@ -59,7 +59,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/property_tree/wpath.html b/doc/html/boost/property_tree/wpath.html index cd0b31e7c7..ec354ed5fe 100644 --- a/doc/html/boost/property_tree/wpath.html +++ b/doc/html/boost/property_tree/wpath.html @@ -33,9 +33,9 @@ 
    // In header: <boost/property_tree/ptree_fwd.hpp>
 
 
-typedef string_path< std::wstring, id_translator< std::wstring > > wpath;
    +typedef string_path< std::wstring, id_translator< std::wstring > > wpath;
    -

    Description

    +

    Description

    Implements a path using a std::wstring as the key.

    diff --git a/doc/html/boost/property_tree/wptree.html b/doc/html/boost/property_tree/wptree.html index 6f9a95e305..bbb4047295 100644 --- a/doc/html/boost/property_tree/wptree.html +++ b/doc/html/boost/property_tree/wptree.html @@ -35,7 +35,7 @@ typedef basic_ptree< std::wstring, std::wstring > wptree;
    -

    Description

    +

    Description

    A property tree with std::wstring for key and data, and default comparison.

    diff --git a/doc/html/boost/property_tree/xml_parser/read_xml_idm45506995203264.html b/doc/html/boost/property_tree/xml_parser/read_xml_idm45506995203264.html new file mode 100644 index 0000000000..3d24e27008 --- /dev/null +++ b/doc/html/boost/property_tree/xml_parser/read_xml_idm45506995203264.html @@ -0,0 +1,122 @@ + + + + +Function template read_xml + + + + + + + + +
    + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template read_xml

    +

    boost::property_tree::xml_parser::read_xml

    +
    +

    Synopsis

    +
    // In header: <boost/property_tree/xml_parser.hpp>
+
+
+template<typename Ptree> 
+  void read_xml(std::basic_istream< typename Ptree::key_type::value_type > & stream, 
+                Ptree & pt, int flags = 0);
    +
    +

    Description

    +

    Reads XML from an input stream and translates it to property tree.

    +
    + + + + + +
    [Note]Note

    Clears existing contents of property tree. In case of error the property tree unmodified.

    +

    +

    +
    + + + + + +
    [Note]Note

    XML attributes are placed under keys named <xmlattr>.

    +

    + + +

    +
    ++++ + + + + + + + + + + +

    Parameters:

    ++++ + + + + + + + + + + + + + + +

    flags

    		 +

    Flags controlling the behaviour of the parser. The following flags are supported:

    +
      +

    • no_concat_text <ndash></ndash> Prevents concatenation of text nodes into datastring of property tree. Puts them in separate <xmltext> strings instead.

      • +

    • no_comments <ndash></ndash> Skip XML comments.

      • +

    • trim_whitespace <ndash></ndash> Trim leading and trailing whitespace from text, and collapse sequences of whitespace.

      • +
    +

    +

    +

    pt

    The property tree to populate.

    stream

    Stream from which to read in the property tree.

    Throws:

    		xml_parser_error In case of error deserializing the property tree.
    +
    +
    + + + +
    Copyright © 2008-2010 Marcin Kalicinski
    Copyright © 2010-2013 Sebastian + Redl

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/property_tree/xml_parser/read_xml_idm45507044821152.html b/doc/html/boost/property_tree/xml_parser/read_xml_idm45507044821152.html new file mode 100644 index 0000000000..a4f09950d8 --- /dev/null +++ b/doc/html/boost/property_tree/xml_parser/read_xml_idm45507044821152.html @@ -0,0 +1,125 @@ + + + + +Function template read_xml + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template read_xml

    +

    boost::property_tree::xml_parser::read_xml

    +
    +

    Synopsis

    +
    // In header: <boost/property_tree/xml_parser.hpp>
+
+
+template<typename Ptree> 
+  void read_xml(const std::string & filename, Ptree & pt, int flags = 0, 
+                const std::locale & loc = std::locale());
    +
    +

    Description

    +

    Reads XML from a file using the given locale and translates it to property tree.

    +
    + + + + + +
    [Note]Note

    Clears existing contents of property tree. In case of error the property tree unmodified.

    +

    +

    +
    + + + + + +
    [Note]Note

    XML attributes are placed under keys named <xmlattr>.

    +

    + + +

    +
    ++++ + + + + + + + + + + +

    Parameters:

    ++++ + + + + + + + + + + + + + + + + + + +

    filename

    The file from which to read in the property tree.

    flags

    		 +

    Flags controlling the bahviour of the parser. The following flags are supported:

    +
      +

    • no_concat_text <ndash></ndash> Prevents concatenation of text nodes into datastring of property tree. Puts them in separate <xmltext> strings instead.

      • +

    • no_comments <ndash></ndash> Skip XML comments.

      • +
    +

    +

    +

    loc

    The locale to use when reading in the file contents.

    pt

    The property tree to populate.

    Throws:

    		xml_parser_error In case of error deserializing the property tree.
    +
    +
    + + + +
    Copyright © 2008-2010 Marcin Kalicinski
    Copyright © 2010-2013 Sebastian + Redl

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/property_tree/xml_parser/read_xml_idp150019456.html b/doc/html/boost/property_tree/xml_parser/read_xml_idp150019456.html deleted file mode 100644 index d84cd7b82f..0000000000 --- a/doc/html/boost/property_tree/xml_parser/read_xml_idp150019456.html +++ /dev/null @@ -1,122 +0,0 @@ - - - - -Function template read_xml - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template read_xml

    -

    boost::property_tree::xml_parser::read_xml

    -
    -

    Synopsis

    -
    // In header: <boost/property_tree/xml_parser.hpp>
-
-
-template<typename Ptree> 
-  void read_xml(std::basic_istream< typename Ptree::key_type::value_type > & stream, 
-                Ptree & pt, int flags = 0);
    -
    -

    Description

    -

    Reads XML from an input stream and translates it to property tree.

    -
    - - - - - -
    [Note]Note

    Clears existing contents of property tree. In case of error the property tree unmodified.

    -

    -

    -
    - - - - - -
    [Note]Note

    XML attributes are placed under keys named <xmlattr>.

    -

    - - -

    -
    ---- - - - - - - - - - - -

    Parameters:

    ---- - - - - - - - - - - - - - - -

    flags

    		 -

    Flags controlling the behaviour of the parser. The following flags are supported:

    -
      -

    • no_concat_text <ndash></ndash> Prevents concatenation of text nodes into datastring of property tree. Puts them in separate <xmltext> strings instead.

      • -

    • no_comments <ndash></ndash> Skip XML comments.

      • -

    • trim_whitespace <ndash></ndash> Trim leading and trailing whitespace from text, and collapse sequences of whitespace.

      • -
    -

    -

    -

    pt

    The property tree to populate.

    stream

    Stream from which to read in the property tree.

    Throws:

    		xml_parser_error In case of error deserializing the property tree.
    -
    -
    - - - -
    Copyright © 2008-2010 Marcin Kalicinski
    Copyright © 2010-2013 Sebastian - Redl

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/property_tree/xml_parser/read_xml_idp205787136.html b/doc/html/boost/property_tree/xml_parser/read_xml_idp205787136.html deleted file mode 100644 index d8bbd87945..0000000000 --- a/doc/html/boost/property_tree/xml_parser/read_xml_idp205787136.html +++ /dev/null @@ -1,125 +0,0 @@ - - - - -Function template read_xml - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template read_xml

    -

    boost::property_tree::xml_parser::read_xml

    -
    -

    Synopsis

    -
    // In header: <boost/property_tree/xml_parser.hpp>
-
-
-template<typename Ptree> 
-  void read_xml(const std::string & filename, Ptree & pt, int flags = 0, 
-                const std::locale & loc = std::locale());
    -
    -

    Description

    -

    Reads XML from a file using the given locale and translates it to property tree.

    -
    - - - - - -
    [Note]Note

    Clears existing contents of property tree. In case of error the property tree unmodified.

    -

    -

    -
    - - - - - -
    [Note]Note

    XML attributes are placed under keys named <xmlattr>.

    -

    - - -

    -
    ---- - - - - - - - - - - -

    Parameters:

    ---- - - - - - - - - - - - - - - - - - - -

    filename

    The file from which to read in the property tree.

    flags

    		 -

    Flags controlling the bahviour of the parser. The following flags are supported:

    -
      -

    • no_concat_text <ndash></ndash> Prevents concatenation of text nodes into datastring of property tree. Puts them in separate <xmltext> strings instead.

      • -

    • no_comments <ndash></ndash> Skip XML comments.

      • -
    -

    -

    -

    loc

    The locale to use when reading in the file contents.

    pt

    The property tree to populate.

    Throws:

    		xml_parser_error In case of error deserializing the property tree.
    -
    -
    - - - -
    Copyright © 2008-2010 Marcin Kalicinski
    Copyright © 2010-2013 Sebastian - Redl

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/property_tree/xml_parser/write_xm_idm45506983166032.html b/doc/html/boost/property_tree/xml_parser/write_xm_idm45506983166032.html new file mode 100644 index 0000000000..55c31ca28e --- /dev/null +++ b/doc/html/boost/property_tree/xml_parser/write_xm_idm45506983166032.html @@ -0,0 +1,100 @@ + + + + +Function template write_xml + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template write_xml

    +

    boost::property_tree::xml_parser::write_xml

    +
    +

    Synopsis

    +
    // In header: <boost/property_tree/xml_parser.hpp>
+
+
+template<typename Ptree> 
+  void write_xml(const std::string & filename, const Ptree & pt, 
+                 const std::locale & loc = std::locale(), 
+                 const xml_writer_settings< typename Ptree::key_type > & settings = xml_writer_settings< typename Ptree::key_type >());
    +
    +

    Description

    +

    Translates the property tree to XML and writes it the given file. + +

    +
    ++++ + + + + + + + + + + +

    Parameters:

    ++++ + + + + + + + + + + + + + + + + + + +

    filename

    The file to which to write the XML representation of the property tree.

    loc

    The locale to use when writing the output to file.

    pt

    The property tree to tranlsate to XML and output.

    settings

    The settings to use when writing out the property tree as XML.

    Throws:

    		xml_parser_error In case of error translating the property tree to XML or writing to the output stream.
    +
    +
    + + + +
    Copyright © 2008-2010 Marcin Kalicinski
    Copyright © 2010-2013 Sebastian + Redl

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/property_tree/xml_parser/write_xm_idm45507092216384.html b/doc/html/boost/property_tree/xml_parser/write_xm_idm45507092216384.html new file mode 100644 index 0000000000..6ef8a1a9a6 --- /dev/null +++ b/doc/html/boost/property_tree/xml_parser/write_xm_idm45507092216384.html @@ -0,0 +1,96 @@ + + + + +Function template write_xml + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template write_xml

    +

    boost::property_tree::xml_parser::write_xml

    +
    +

    Synopsis

    +
    // In header: <boost/property_tree/xml_parser.hpp>
+
+
+template<typename Ptree> 
+  void write_xml(std::basic_ostream< typename Ptree::key_type::value_type > & stream, 
+                 const Ptree & pt, 
+                 const xml_writer_settings< typename Ptree::key_type > & settings = xml_writer_settings< typename Ptree::key_type >());
    +
    +

    Description

    +

    Translates the property tree to XML and writes it the given output stream. + +

    +
    ++++ + + + + + + + + + + +

    Parameters:

    ++++ + + + + + + + + + + + + + + +

    pt

    The property tree to tranlsate to XML and output.

    settings

    The settings to use when writing out the property tree as XML.

    stream

    The stream to which to write the XML representation of the property tree.

    Throws:

    		xml_parser_error In case of error translating the property tree to XML or writing to the output stream.
    +
    +
    + + + +
    Copyright © 2008-2010 Marcin Kalicinski
    Copyright © 2010-2013 Sebastian + Redl

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/property_tree/xml_parser/write_xml_idp157243712.html b/doc/html/boost/property_tree/xml_parser/write_xml_idp157243712.html deleted file mode 100644 index 00a2c75833..0000000000 --- a/doc/html/boost/property_tree/xml_parser/write_xml_idp157243712.html +++ /dev/null @@ -1,96 +0,0 @@ - - - - -Function template write_xml - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template write_xml

    -

    boost::property_tree::xml_parser::write_xml

    -
    -

    Synopsis

    -
    // In header: <boost/property_tree/xml_parser.hpp>
-
-
-template<typename Ptree> 
-  void write_xml(std::basic_ostream< typename Ptree::key_type::value_type > & stream, 
-                 const Ptree & pt, 
-                 const xml_writer_settings< typename Ptree::key_type > & settings = xml_writer_settings< typename Ptree::key_type >());
    -
    -

    Description

    -

    Translates the property tree to XML and writes it the given output stream. - -

    -
    ---- - - - - - - - - - - -

    Parameters:

    ---- - - - - - - - - - - - - - - -

    pt

    The property tree to tranlsate to XML and output.

    settings

    The settings to use when writing out the property tree as XML.

    stream

    The stream to which to write the XML representation of the property tree.

    Throws:

    		xml_parser_error In case of error translating the property tree to XML or writing to the output stream.
    -
    -
    - - - -
    Copyright © 2008-2010 Marcin Kalicinski
    Copyright © 2010-2013 Sebastian - Redl

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/property_tree/xml_parser/write_xml_idp163670112.html b/doc/html/boost/property_tree/xml_parser/write_xml_idp163670112.html deleted file mode 100644 index 7e255c94ef..0000000000 --- a/doc/html/boost/property_tree/xml_parser/write_xml_idp163670112.html +++ /dev/null @@ -1,100 +0,0 @@ - - - - -Function template write_xml - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template write_xml

    -

    boost::property_tree::xml_parser::write_xml

    -
    -

    Synopsis

    -
    // In header: <boost/property_tree/xml_parser.hpp>
-
-
-template<typename Ptree> 
-  void write_xml(const std::string & filename, const Ptree & pt, 
-                 const std::locale & loc = std::locale(), 
-                 const xml_writer_settings< typename Ptree::key_type > & settings = xml_writer_settings< typename Ptree::key_type >());
    -
    -

    Description

    -

    Translates the property tree to XML and writes it the given file. - -

    -
    ---- - - - - - - - - - - -

    Parameters:

    ---- - - - - - - - - - - - - - - - - - - -

    filename

    The file to which to write the XML representation of the property tree.

    loc

    The locale to use when writing the output to file.

    pt

    The property tree to tranlsate to XML and output.

    settings

    The settings to use when writing out the property tree as XML.

    Throws:

    		xml_parser_error In case of error translating the property tree to XML or writing to the output stream.
    -
    -
    - - - -
    Copyright © 2008-2010 Marcin Kalicinski
    Copyright © 2010-2013 Sebastian - Redl

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/proto/N.html b/doc/html/boost/proto/N.html index 276dd8ec74..604b604ee3 100644 --- a/doc/html/boost/proto/N.html +++ b/doc/html/boost/proto/N.html @@ -34,7 +34,7 @@ int const N;
    -

    Description

    +

    Description

    Array size wildcard for Proto grammars that match array terminals.

    diff --git a/doc/html/boost/proto/_.html b/doc/html/boost/proto/_.html index 59cd5788b8..d3d7a90015 100644 --- a/doc/html/boost/proto/_.html +++ b/doc/html/boost/proto/_.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -44,13 +44,13 @@ // types typedef Expr result_type; - // public member functions - Expr operator()(typename impl::expr_param, typename impl::state_param, + // public member functions + Expr operator()(typename impl::expr_param, typename impl::state_param, typename impl::data_param) const; }; };
    -

    Description

    +

    Description

    The wildcard type, proto::_, is a grammar element such that proto::matches<E, proto::_>::value @@ -101,7 +101,7 @@

    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/proto/_/impl.html b/doc/html/boost/proto/_/impl.html index 2239fa54bd..738077f5d4 100644 --- a/doc/html/boost/proto/_/impl.html +++ b/doc/html/boost/proto/_/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -38,17 +38,17 @@ // types typedef Expr result_type; - // public member functions - Expr operator()(typename impl::expr_param, typename impl::state_param, + // public member functions + Expr operator()(typename impl::expr_param, typename impl::state_param, typename impl::data_param) const; };
    -

    Description

    +

    Description

    -

    -impl public member functions

    +

    +impl public member functions

    1. -
      Expr operator()(typename impl::expr_param expr, typename impl::state_param, 
+
      Expr operator()(typename impl::expr_param expr, typename impl::state_param, 
                 typename impl::data_param) const;
      
 
      @@ -91,7 +91,7 @@
 
      
 

      
 
      
 
      
-PrevUpHomeNext
+PrevUpHomeNext
 
      
 
 
diff --git a/doc/html/boost/proto/_byref.html b/doc/html/boost/proto/_byref.html
index bed170eec0..30414700b7 100644
--- a/doc/html/boost/proto/_byref.html
+++ b/doc/html/boost/proto/_byref.html
@@ -8,7 +8,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
      
 
      
 
      
-PrevUpHomeNext
+PrevUpHomeNext
 
      
 
      
 
      
@@ -37,24 +37,24 @@
 struct _byref :  proto::callable {
   // member classes/structs/unions
   template<typename This, typename T> 
-  struct result<This(T &)> {
+  struct result<This(T &)> {
     // types
-    typedef boost::reference_wrapper< T > const type;
+    typedef boost::reference_wrapper< T > const type;
   };
   template<typename This, typename T> 
-  struct result<This(T)> {
+  struct result<This(T)> {
     // types
-    typedef boost::reference_wrapper< T const  > const type;
+    typedef boost::reference_wrapper< T const  > const type;
   };
 
-  // public member functions
+  // public member functions
   template<typename T> 
-    boost::reference_wrapper< T > const operator()(T &) const;
+    boost::reference_wrapper< T > const operator()(T &) const;
   template<typename T> 
-    boost::reference_wrapper< T const > const operator()(T const &) const;
+    boost::reference_wrapper< T const > const operator()(T const &) const;
 };
    -

    Description

    +

    Description

    Example:

    @@ -65,12 +65,12 @@

    -

    -_byref public member functions

    +

    +_byref public member functions

    1. template<typename T> 
-  boost::reference_wrapper< T > const operator()(T & t) const;
      + boost::reference_wrapper< T > const operator()(T & t) const;

      Wrap the parameter t in a boost::reference_wrapper<> @@ -109,7 +109,7 @@ 

    2. template<typename T> 
-  boost::reference_wrapper< T const > const operator()(T const & t) const;
      + boost::reference_wrapper< T const > const operator()(T const & t) const;

      This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

    @@ -126,7 +126,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/proto/_byref/result_T_idm45506990745920.html b/doc/html/boost/proto/_byref/result_T_idm45506990745920.html new file mode 100644 index 0000000000..f847753780 --- /dev/null +++ b/doc/html/boost/proto/_byref/result_T_idm45506990745920.html @@ -0,0 +1,55 @@ + + + + +Struct template result<This(T)> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct template result<This(T)>

    +

    boost::proto::_byref::result<This(T)>

    +
    +

    Synopsis

    +
    // In header: <boost/proto/transform/arg.hpp>
+
+
+template<typename This, typename T> 
+struct result<This(T)> {
+  // types
+  typedef boost::reference_wrapper< T const  > const type;
+};
    +
    + + + +
    Copyright © 2008 Eric Niebler

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/proto/_byref/result_T_idm45506990750288.html b/doc/html/boost/proto/_byref/result_T_idm45506990750288.html new file mode 100644 index 0000000000..3c611f016d --- /dev/null +++ b/doc/html/boost/proto/_byref/result_T_idm45506990750288.html @@ -0,0 +1,55 @@ + + + + +Struct template result<This(T &)> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct template result<This(T &)>

    +

    boost::proto::_byref::result<This(T &)>

    +
    +

    Synopsis

    +
    // In header: <boost/proto/transform/arg.hpp>
+
+
+template<typename This, typename T> 
+struct result<This(T &)> {
+  // types
+  typedef boost::reference_wrapper< T > const type;
+};
    +
    + + + +
    Copyright © 2008 Eric Niebler

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/proto/_byref/result_This_T_idp212547664.html b/doc/html/boost/proto/_byref/result_This_T_idp212547664.html deleted file mode 100644 index 7ff8ea1f8f..0000000000 --- a/doc/html/boost/proto/_byref/result_This_T_idp212547664.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template result<This(T &)> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template result<This(T &)>

    -

    boost::proto::_byref::result<This(T &)>

    -
    -

    Synopsis

    -
    // In header: <boost/proto/transform/arg.hpp>
-
-
-template<typename This, typename T> 
-struct result<This(T &)> {
-  // types
-  typedef boost::reference_wrapper< T > const type;
-};
    -
    - - - -
    Copyright © 2008 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/proto/_byref/result_This_T_idp212552032.html b/doc/html/boost/proto/_byref/result_This_T_idp212552032.html deleted file mode 100644 index ae49c01381..0000000000 --- a/doc/html/boost/proto/_byref/result_This_T_idp212552032.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template result<This(T)> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template result<This(T)>

    -

    boost::proto::_byref::result<This(T)>

    -
    -

    Synopsis

    -
    // In header: <boost/proto/transform/arg.hpp>
-
-
-template<typename This, typename T> 
-struct result<This(T)> {
-  // types
-  typedef boost::reference_wrapper< T const  > const type;
-};
    -
    - - - -
    Copyright © 2008 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/proto/_byval.html b/doc/html/boost/proto/_byval.html index 2dfef65485..ab2d7c7334 100644 --- a/doc/html/boost/proto/_byval.html +++ b/doc/html/boost/proto/_byval.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -39,24 +39,24 @@ struct _byval : proto::callable { // member classes/structs/unions template<typename This, typename T> - struct result<This(boost::reference_wrapper< T >)> : result<This(T)> { + struct result<This(boost::reference_wrapper< T >)> : result<This(T)> { }; template<typename This, typename T> - struct result<This(T &)> : result<This(T)> { + struct result<This(T &)> : result<This(T)> { }; template<typename This, typename T> - struct result<This(T)> { + struct result<This(T)> { // types - typedef T type; + typedef T type; }; - // public member functions - template<typename T> T operator()(T const &) const; + // public member functions + template<typename T> T operator()(T const &) const; template<typename T> - T operator()(boost::reference_wrapper< T > const &) const; + T operator()(boost::reference_wrapper< T > const &) const; };
    -

    Description

    +

    Description

    Example:

    @@ -67,11 +67,11 @@

    -

    -_byval public member functions

    +

    +_byval public member functions

    1. -
      template<typename T> T operator()(T const & t) const;
      +
      template<typename T> T operator()(T const & t) const;
      @@ -106,7 +106,7 @@ 
    2. template<typename T> 
-  T operator()(boost::reference_wrapper< T > const & t) const;
      + T operator()(boost::reference_wrapper< T > const & t) const;

      This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

      3. @@ -123,7 +123,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/proto/_byval/result_T_idm45506990714496.html b/doc/html/boost/proto/_byval/result_T_idm45506990714496.html new file mode 100644 index 0000000000..ba28304e41 --- /dev/null +++ b/doc/html/boost/proto/_byval/result_T_idm45506990714496.html @@ -0,0 +1,55 @@ + + + + +Struct template result<This(T)> + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Struct template result<This(T)>

      +

      boost::proto::_byval::result<This(T)>

      +
      +

      Synopsis

      +
      // In header: <boost/proto/transform/arg.hpp>
+
+
+template<typename This, typename T> 
+struct result<This(T)> {
+  // types
+  typedef T type;
+};
      +
      + + + +
      Copyright © 2008 Eric Niebler

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/proto/_byval/result_T_idm45506990718128.html b/doc/html/boost/proto/_byval/result_T_idm45506990718128.html new file mode 100644 index 0000000000..8faeb42453 --- /dev/null +++ b/doc/html/boost/proto/_byval/result_T_idm45506990718128.html @@ -0,0 +1,53 @@ + + + + +Struct template result<This(T &)> + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Struct template result<This(T &)>

      +

      boost::proto::_byval::result<This(T &)>

      +
      +

      Synopsis

      +
      // In header: <boost/proto/transform/arg.hpp>
+
+
+template<typename This, typename T> 
+struct result<This(T &)> :  result<This(T)> {
+};
      +
      + + + +
      Copyright © 2008 Eric Niebler

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/proto/_byval/result_T_idm45506990721776.html b/doc/html/boost/proto/_byval/result_T_idm45506990721776.html new file mode 100644 index 0000000000..4f8d6c0d86 --- /dev/null +++ b/doc/html/boost/proto/_byval/result_T_idm45506990721776.html @@ -0,0 +1,53 @@ + + + + +Struct template result<This(boost::reference_wrapper< T >)> + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Struct template result<This(boost::reference_wrapper< T >)>

      +

      boost::proto::_byval::result<This(boost::reference_wrapper< T >)>

      +
      +

      Synopsis

      +
      // In header: <boost/proto/transform/arg.hpp>
+
+
+template<typename This, typename T> 
+struct result<This(boost::reference_wrapper< T >)> :  result<This(T)> {
+};
      +
      + + + +
      Copyright © 2008 Eric Niebler

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/proto/_byval/result_This_T_idp212579824.html b/doc/html/boost/proto/_byval/result_This_T_idp212579824.html deleted file mode 100644 index 39e80ecb2c..0000000000 --- a/doc/html/boost/proto/_byval/result_This_T_idp212579824.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template result<This(T &)> - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Struct template result<This(T &)>

      -

      boost::proto::_byval::result<This(T &)>

      -
      -

      Synopsis

      -
      // In header: <boost/proto/transform/arg.hpp>
-
-
-template<typename This, typename T> 
-struct result<This(T &)> :  result<This(T)> {
-};
      -
      - - - -
      Copyright © 2008 Eric Niebler

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/proto/_byval/result_This_T_idp212583456.html b/doc/html/boost/proto/_byval/result_This_T_idp212583456.html deleted file mode 100644 index 4ba64bb6b1..0000000000 --- a/doc/html/boost/proto/_byval/result_This_T_idp212583456.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template result<This(T)> - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Struct template result<This(T)>

      -

      boost::proto::_byval::result<This(T)>

      -
      -

      Synopsis

      -
      // In header: <boost/proto/transform/arg.hpp>
-
-
-template<typename This, typename T> 
-struct result<This(T)> {
-  // types
-  typedef T type;
-};
      -
      - - - -
      Copyright © 2008 Eric Niebler

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/proto/_byval/result_This_b_idp212576176.html b/doc/html/boost/proto/_byval/result_This_b_idp212576176.html deleted file mode 100644 index 2aa8820254..0000000000 --- a/doc/html/boost/proto/_byval/result_This_b_idp212576176.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template result<This(boost::reference_wrapper< T >)> - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Struct template result<This(boost::reference_wrapper< T >)>

      -

      boost::proto::_byval::result<This(boost::reference_wrapper< T >)>

      -
      -

      Synopsis

      -
      // In header: <boost/proto/transform/arg.hpp>
-
-
-template<typename This, typename T> 
-struct result<This(boost::reference_wrapper< T >)> :  result<This(T)> {
-};
      -
      - - - -
      Copyright © 2008 Eric Niebler

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/proto/_child_c.html b/doc/html/boost/proto/_child_c.html index 9dad62b786..1e5690c56a 100644 --- a/doc/html/boost/proto/_child_c.html +++ b/doc/html/boost/proto/_child_c.html @@ -40,14 +40,14 @@ // types typedef typename proto::result_of::child_c< Expr, N >::type result_type; - // public member functions + // public member functions typename proto::result_of::child_c< Expr, N >::type - operator()(typename impl::expr_param, typename impl::state_param, + operator()(typename impl::expr_param, typename impl::state_param, typename impl::data_param) const; }; };
      -

      Description

      +

      Description

      Example:

      diff --git a/doc/html/boost/proto/_child_c/impl.html b/doc/html/boost/proto/_child_c/impl.html index 0bb364369c..d2fdef46f3 100644 --- a/doc/html/boost/proto/_child_c/impl.html +++ b/doc/html/boost/proto/_child_c/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      @@ -38,19 +38,19 @@ // types typedef typename proto::result_of::child_c< Expr, N >::type result_type; - // public member functions + // public member functions typename proto::result_of::child_c< Expr, N >::type - operator()(typename impl::expr_param, typename impl::state_param, + operator()(typename impl::expr_param, typename impl::state_param, typename impl::data_param) const; };
      -

      Description

      +

      Description

      -

      -impl public member functions

      +

      +impl public member functions

      1. typename proto::result_of::child_c< Expr, N >::type 
-operator()(typename impl::expr_param expr, typename impl::state_param, 
+operator()(typename impl::expr_param expr, typename impl::state_param, 
            typename impl::data_param) const;

        Returns the N-th child of expr @@ -83,7 +83,7 @@

        Returns:

        - proto::child_c<N>(expr) + proto::child_c<N>(expr)

        @@ -106,7 +106,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        diff --git a/doc/html/boost/proto/_data.html b/doc/html/boost/proto/_data.html index 076d4abf28..0f0857dbbe 100644 --- a/doc/html/boost/proto/_data.html +++ b/doc/html/boost/proto/_data.html @@ -51,7 +51,7 @@ }; };
      -

      Description

      +

      Description

      If the data (third) parameter is a transform environment, it returns the value associated with the proto::data_type key. Otherwise, it returns diff --git a/doc/html/boost/proto/_data/impl.html b/doc/html/boost/proto/_data/impl.html index c5f8bf0187..f0392c86a1 100644 --- a/doc/html/boost/proto/_data/impl.html +++ b/doc/html/boost/proto/_data/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@

      -PrevUpHomeNext +PrevUpHomeNext
      @@ -53,7 +53,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/proto/_default.html b/doc/html/boost/proto/_default.html index 9c04399c14..cb47228ea2 100644 --- a/doc/html/boost/proto/_default.html +++ b/doc/html/boost/proto/_default.html @@ -42,8 +42,8 @@ typedef typename Expr::tag_type Tag; // For exposition only typedef see-below result_type; - // public member functions - result_type operator()(typename impl::expr_param, + // public member functions + result_type operator()(typename impl::expr_param, typename impl::state_param, typename impl::data_param) const; @@ -54,7 +54,7 @@ }; };
      -

      Description

      +

      Description

      For the complete description of the behavior of the proto::_default transform, see the documentation for the nested diff --git a/doc/html/boost/proto/_default/impl.html b/doc/html/boost/proto/_default/impl.html index f194557f0f..bf31098051 100644 --- a/doc/html/boost/proto/_default/impl.html +++ b/doc/html/boost/proto/_default/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@

      -PrevUpHomeNext +PrevUpHomeNext
      @@ -39,8 +39,8 @@ typedef typename Expr::tag_type Tag; // For exposition only typedef see-below result_type; - // public member functions - result_type operator()(typename impl::expr_param, + // public member functions + result_type operator()(typename impl::expr_param, typename impl::state_param, typename impl::data_param) const; @@ -50,7 +50,7 @@ static Data s_data; // For exposition only };
      -

      Description

      +

      Description

      Let OP be the C++ operator corresponding to Expr::proto_tag. (For example, if @@ -64,7 +64,7 @@ approximate the behavior.

      -

      +

      impl public types

      @@ -78,7 +78,7 @@ then the result type is 

      decltype(
-  OP Grammar()(proto::child(s_expr), s_state, s_data)
+  OP Grammar()(proto::child(s_expr), s_state, s_data)
 )

      @@ -89,7 +89,7 @@ then the result type is 

      decltype(
-  Grammar()(proto::child(s_expr), s_state, s_data) OP
+  Grammar()(proto::child(s_expr), s_state, s_data) OP
 )

      @@ -100,8 +100,8 @@ then the result type is 

      decltype(
-  Grammar()(proto::left(s_expr), s_state, s_data) OP
-  Grammar()(proto::right(s_expr), s_state, s_data)
+  Grammar()(proto::left(s_expr), s_state, s_data) OP
+  Grammar()(proto::right(s_expr), s_state, s_data)
 )

      @@ -114,8 +114,8 @@ then the result type is 

      decltype(
-  Grammar()(proto::left(s_expr), s_state, s_data) [
-  Grammar()(proto::right(s_expr), s_state, s_data) ]
+  Grammar()(proto::left(s_expr), s_state, s_data) [
+  Grammar()(proto::right(s_expr), s_state, s_data) ]
 )

      @@ -128,9 +128,9 @@ then the result type is 

      decltype(
-  Grammar()(proto::child_c<0>(s_expr), s_state, s_data) ?
-  Grammar()(proto::child_c<1>(s_expr), s_state, s_data) :
-  Grammar()(proto::child_c<2>(s_expr), s_state, s_data)
+  Grammar()(proto::child_c<0>(s_expr), s_state, s_data) ?
+  Grammar()(proto::child_c<1>(s_expr), s_state, s_data) :
+  Grammar()(proto::child_c<2>(s_expr), s_state, s_data)
 )

      @@ -143,10 +143,10 @@ then the result type is 

      decltype(
-  Grammar()(proto::child_c<0>(s_expr), s_state, s_data) (
-  Grammar()(proto::child_c<1>(s_expr), s_state, s_data),
+  Grammar()(proto::child_c<0>(s_expr), s_state, s_data) (
+  Grammar()(proto::child_c<1>(s_expr), s_state, s_data),
   ...
-  Grammar()(proto::child_c<N>(s_expr), s_state, s_data) )
+  Grammar()(proto::child_c<N>(s_expr), s_state, s_data) )
 )

      @@ -155,10 +155,10 @@
    -

    -impl public member functions

    +

    +impl public member functions

    1. -
      result_type operator()(typename impl::expr_param expr, 
+
      result_type operator()(typename impl::expr_param expr, 
                        typename impl::state_param state, 
                        typename impl::data_param data) const;
      
 
@@ -169,7 +169,7 @@
                     If Tag corresponds to a unary prefix operator,
                     then return
                     
      
-
      OP Grammar()(proto::child(expr), state, data)
      
+
      OP Grammar()(proto::child(expr), state, data)
      2. @@ -178,7 +178,7 @@ If Tag corresponds to a unary postfix operator, then return

      -
      Grammar()(proto::child(expr), state, data) OP
      +
      Grammar()(proto::child(expr), state, data) OP

      @@ -187,8 +187,8 @@ If Tag corresponds to a binary infix operator, then return

      -
      Grammar()(proto::left(expr), state, data) OP
-Grammar()(proto::right(expr), state, data)
      +
      Grammar()(proto::left(expr), state, data) OP
+Grammar()(proto::right(expr), state, data)

      @@ -199,8 +199,8 @@ Grammar()(Grammar()(proto::left(expr), state, data) [ -Grammar()(proto::right(expr), state, data) ] +
      Grammar()(proto::left(expr), state, data) [
+Grammar()(proto::right(expr), state, data) ]

      @@ -211,9 +211,9 @@ Grammar()(Grammar()(proto::child_c<0>(expr), state, data) ? -Grammar()(proto::child_c<1>(expr), state, data) : -Grammar()(proto::child_c<2>(expr), state, data) +
      Grammar()(proto::child_c<0>(expr), state, data) ?
+Grammar()(proto::child_c<1>(expr), state, data) :
+Grammar()(proto::child_c<2>(expr), state, data)

      @@ -224,10 +224,10 @@ Grammar()(Grammar()(proto::child_c<0>(expr), state, data) ( -Grammar()(proto::child_c<1>(expr), state, data), +
      Grammar()(proto::child_c<0>(expr), state, data) (
+Grammar()(proto::child_c<1>(expr), state, data),
 ...
-Grammar()(proto::child_c<N>(expr), state, data) )
      +Grammar()(proto::child_c<N>(expr), state, data) )

      @@ -246,7 +246,7 @@ Grammar()( -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/proto/_env.html b/doc/html/boost/proto/_env.html index 4a10adc698..307de62a47 100644 --- a/doc/html/boost/proto/_env.html +++ b/doc/html/boost/proto/_env.html @@ -42,14 +42,14 @@ // types typedef Data result_type; - // public member functions - result_type operator()(typename impl::expr_param, + // public member functions + result_type operator()(typename impl::expr_param, typename impl::state_param, typename impl::data_param) const; }; };
    -

    Description

    +

    Description

    See proto::_env::impl for the full details.

    diff --git a/doc/html/boost/proto/_env/impl.html b/doc/html/boost/proto/_env/impl.html index ef4d4c23f7..e826a7e11c 100644 --- a/doc/html/boost/proto/_env/impl.html +++ b/doc/html/boost/proto/_env/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -38,18 +38,18 @@ // types typedef Data result_type; - // public member functions - result_type operator()(typename impl::expr_param, + // public member functions + result_type operator()(typename impl::expr_param, typename impl::state_param, typename impl::data_param) const; };
    -

    Description

    +

    Description

    -

    -impl public member functions

    +

    +impl public member functions

    1. -
      result_type operator()(typename impl::expr_param, typename impl::state_param, 
+
      result_type operator()(typename impl::expr_param, typename impl::state_param, 
                        typename impl::data_param data) const;
      
 
      
                   Returns the current transform environment
@@ -96,7 +96,7 @@
 
 
      
 
      
-PrevUpHomeNext
+PrevUpHomeNext
 
      
 
 
diff --git a/doc/html/boost/proto/_env_var.html b/doc/html/boost/proto/_env_var.html
index 28993412c6..df2d559dc4 100644
--- a/doc/html/boost/proto/_env_var.html
+++ b/doc/html/boost/proto/_env_var.html
@@ -7,7 +7,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
 
      
 
      
-PrevUpHomeNext
+PrevUpHomeNext
 
      
 
      
 
      
@@ -43,14 +43,14 @@
     // types
     typedef typename proto::result_of::env_var<Data, Key>::type result_type;
 
-    // public member functions
-    result_type operator()(typename impl::expr_param, 
+    // public member functions
+    result_type operator()(typename impl::expr_param, 
                            typename impl::state_param, 
                            typename impl::data_param) const;
   };
 };
    -

    Description

    +

    Description

    See proto::_env_var::impl for the full details.

    @@ -66,7 +66,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/proto/_env_var/impl.html b/doc/html/boost/proto/_env_var/impl.html index d9973c2c4b..0471b2ddf0 100644 --- a/doc/html/boost/proto/_env_var/impl.html +++ b/doc/html/boost/proto/_env_var/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -38,18 +38,18 @@ // types typedef typename proto::result_of::env_var<Data, Key>::type result_type; - // public member functions - result_type operator()(typename impl::expr_param, + // public member functions + result_type operator()(typename impl::expr_param, typename impl::state_param, typename impl::data_param) const; };
    -

    Description

    +

    Description

    -

    -impl public member functions

    +

    +impl public member functions

    1. -
      result_type operator()(typename impl::expr_param, typename impl::state_param, 
+
      result_type operator()(typename impl::expr_param, typename impl::state_param, 
                        typename impl::data_param data) const;
      
 
      
                   Fetches the value associated with Key from the transform environment
@@ -84,7 +84,7 @@
 
 
      Returns:
      
 
      
-                  proto::env_var(data)
+                  proto::env_var(data)
                 
      
 
 
@@ -103,7 +103,7 @@
 
 
      
 
      
-PrevUpHomeNext
+PrevUpHomeNext
 
      
 
 
diff --git a/doc/html/boost/proto/_expr.html b/doc/html/boost/proto/_expr.html
index 8fe0ebfc2f..31d42ed54f 100644
--- a/doc/html/boost/proto/_expr.html
+++ b/doc/html/boost/proto/_expr.html
@@ -7,7 +7,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
 
      
 
      
-PrevUpHomeNext
+PrevUpHomeNext
 
      
 
      
 
      
@@ -40,13 +40,13 @@
     // types
     typedef Expr result_type;
 
-    // public member functions
-    Expr operator()(typename impl::expr_param, typename impl::state_param, 
+    // public member functions
+    Expr operator()(typename impl::expr_param, typename impl::state_param, 
                     typename impl::data_param) const;
   };
 };
    -

    Description

    +

    Description

    Example:

    @@ -67,7 +67,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/proto/_expr/impl.html b/doc/html/boost/proto/_expr/impl.html index 73fc92d6db..53da4da115 100644 --- a/doc/html/boost/proto/_expr/impl.html +++ b/doc/html/boost/proto/_expr/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -38,17 +38,17 @@ // types typedef Expr result_type; - // public member functions - Expr operator()(typename impl::expr_param, typename impl::state_param, + // public member functions + Expr operator()(typename impl::expr_param, typename impl::state_param, typename impl::data_param) const; };
    -

    Description

    +

    Description

    -

    -impl public member functions

    +

    +impl public member functions

    1. -
      Expr operator()(typename impl::expr_param expr, typename impl::state_param, 
+
      Expr operator()(typename impl::expr_param expr, typename impl::state_param, 
                 typename impl::data_param) const;
      
 
      
                   Returns the current expression.
@@ -98,7 +98,7 @@
 
 
      
 
      
-PrevUpHomeNext
+PrevUpHomeNext
 
      
 
 
diff --git a/doc/html/boost/proto/_state.html b/doc/html/boost/proto/_state.html
index b3bdfa74a3..59568eee5b 100644
--- a/doc/html/boost/proto/_state.html
+++ b/doc/html/boost/proto/_state.html
@@ -40,13 +40,13 @@
     // types
     typedef State result_type;
 
-    // public member functions
-    State operator()(typename impl::expr_param, typename impl::state_param, 
+    // public member functions
+    State operator()(typename impl::expr_param, typename impl::state_param, 
                      typename impl::data_param) const;
   };
 };
    -

    Description

    +

    Description

    Example:

    diff --git a/doc/html/boost/proto/_state/impl.html b/doc/html/boost/proto/_state/impl.html index a5d290e411..b07f4adbf0 100644 --- a/doc/html/boost/proto/_state/impl.html +++ b/doc/html/boost/proto/_state/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -38,17 +38,17 @@ // types typedef State result_type; - // public member functions - State operator()(typename impl::expr_param, typename impl::state_param, + // public member functions + State operator()(typename impl::expr_param, typename impl::state_param, typename impl::data_param) const; };
    -

    Description

    +

    Description

    -

    -impl public member functions

    +

    +impl public member functions

    1. -
      State operator()(typename impl::expr_param, typename impl::state_param state, 
+
      State operator()(typename impl::expr_param, typename impl::state_param state, 
                  typename impl::data_param) const;
      
 
      
                   Returns the current state.
@@ -98,7 +98,7 @@
 
 
      
 
      
-PrevUpHomeNext
+PrevUpHomeNext
 
      
 
 
diff --git a/doc/html/boost/proto/_value.html b/doc/html/boost/proto/_value.html
index c67b1e5b02..d516e59eac 100644
--- a/doc/html/boost/proto/_value.html
+++ b/doc/html/boost/proto/_value.html
@@ -40,14 +40,14 @@
     // types
     typedef typename proto::result_of::value< Expr >::type result_type;
 
-    // public member functions
+    // public member functions
     typename proto::result_of::value< Expr >::type 
-    operator()(typename impl::expr_param, typename impl::state_param, 
+    operator()(typename impl::expr_param, typename impl::state_param, 
                typename impl::data_param) const;
   };
 };
    -

    Description

    +

    Description

    Example:

    diff --git a/doc/html/boost/proto/_value/impl.html b/doc/html/boost/proto/_value/impl.html index 15642abe4f..98ba248462 100644 --- a/doc/html/boost/proto/_value/impl.html +++ b/doc/html/boost/proto/_value/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -38,19 +38,19 @@ // types typedef typename proto::result_of::value< Expr >::type result_type; - // public member functions + // public member functions typename proto::result_of::value< Expr >::type - operator()(typename impl::expr_param, typename impl::state_param, + operator()(typename impl::expr_param, typename impl::state_param, typename impl::data_param) const; };
    -

    Description

    +

    Description

    -

    -impl public member functions

    +

    +impl public member functions

    1. typename proto::result_of::value< Expr >::type 
-operator()(typename impl::expr_param expr, typename impl::state_param, 
+operator()(typename impl::expr_param expr, typename impl::state_param, 
            typename impl::data_param) const;

      Returns the value of the specified terminal expression. @@ -83,7 +83,7 @@

      Returns:

      - proto::value(expr) + proto::value(expr)

      @@ -106,7 +106,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/proto/_void.html b/doc/html/boost/proto/_void.html index 293d7cb655..5cacae238e 100644 --- a/doc/html/boost/proto/_void.html +++ b/doc/html/boost/proto/_void.html @@ -40,13 +40,13 @@ // types typedef void result_type; - // public member functions - void operator()(typename impl::expr_param, typename impl::state_param, + // public member functions + void operator()(typename impl::expr_param, typename impl::state_param, typename impl::data_param) const; }; };
    -

    Description

    +

    Description

    diff --git a/doc/html/boost/proto/_void/impl.html b/doc/html/boost/proto/_void/impl.html index d6c60de3bc..7d21287336 100644 --- a/doc/html/boost/proto/_void/impl.html +++ b/doc/html/boost/proto/_void/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -38,17 +38,17 @@ // types typedef void result_type; - // public member functions - void operator()(typename impl::expr_param, typename impl::state_param, + // public member functions + void operator()(typename impl::expr_param, typename impl::state_param, typename impl::data_param) const; };
    -

    Description

    +

    Description

    -

    -impl public member functions

    +

    +impl public member functions

    1. -
      void operator()(typename impl::expr_param, typename impl::state_param, 
+
      void operator()(typename impl::expr_param, typename impl::state_param, 
                 typename impl::data_param) const;
      
 
      
                   Does nothing.
@@ -77,7 +77,7 @@
 
 
      
 
      
-PrevUpHomeNext
+PrevUpHomeNext
 
      
 
 
diff --git a/doc/html/boost/proto/address_of.html b/doc/html/boost/proto/address_of.html
index 6ba0cbfcc5..1548820559 100644
--- a/doc/html/boost/proto/address_of.html
+++ b/doc/html/boost/proto/address_of.html
@@ -50,7 +50,7 @@
   };
 };
    -

    Description

    +

    Description

    diff --git a/doc/html/boost/proto/address_of/impl.html b/doc/html/boost/proto/address_of/impl.html index d95076843d..b48e6e616b 100644 --- a/doc/html/boost/proto/address_of/impl.html +++ b/doc/html/boost/proto/address_of/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -49,7 +49,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/proto/and_.html b/doc/html/boost/proto/and_.html index 668cc9b52b..e810e352f5 100644 --- a/doc/html/boost/proto/and_.html +++ b/doc/html/boost/proto/and_.html @@ -45,14 +45,14 @@ // types typedef typename boost::result_of<Gn(Expr, State, Data)>::type result_type; - // public member functions - result_type operator()(typename impl::expr_param, + // public member functions + result_type operator()(typename impl::expr_param, typename impl::state_param, typename impl::data_param) const; }; };
    -

    Description

    +

    Description

    An expression type E matches proto::and_<G0,G1,...Gn> diff --git a/doc/html/boost/proto/and_/impl.html b/doc/html/boost/proto/and_/impl.html index 2cc2e98060..a5fb0cb2dc 100644 --- a/doc/html/boost/proto/and_/impl.html +++ b/doc/html/boost/proto/and_/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@

    -PrevUpHomeNext +PrevUpHomeNext
    @@ -38,18 +38,18 @@ // types typedef typename boost::result_of<Gn(Expr, State, Data)>::type result_type; - // public member functions - result_type operator()(typename impl::expr_param, + // public member functions + result_type operator()(typename impl::expr_param, typename impl::state_param, typename impl::data_param) const; };
    -

    Description

    +

    Description

    -

    -impl public member functions

    +

    +impl public member functions

    1. -
      result_type operator()(typename impl::expr_param expr, 
+
      result_type operator()(typename impl::expr_param expr, 
                        typename impl::state_param state, 
                        typename impl::data_param data) const;
      
 
      
@@ -103,7 +103,7 @@
 
      
 
      
 
      
-PrevUpHomeNext
+PrevUpHomeNext
 
      
 
 
diff --git a/doc/html/boost/proto/arity_of.html b/doc/html/boost/proto/arity_of.html
index 12a643fc21..c6ce885d59 100644
--- a/doc/html/boost/proto/arity_of.html
+++ b/doc/html/boost/proto/arity_of.html
@@ -8,7 +8,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
      
 
      
 
      
-PrevUpHomeNext
+PrevUpHomeNext
 
      
 
      
 
      
@@ -46,7 +46,7 @@
 
 
      
 
      
-PrevUpHomeNext
+PrevUpHomeNext
 
      
 
 
diff --git a/doc/html/boost/proto/as_child_idm45506990983408.html b/doc/html/boost/proto/as_child_idm45506990983408.html
new file mode 100644
index 0000000000..be2ad91789
--- /dev/null
+++ b/doc/html/boost/proto/as_child_idm45506990983408.html
@@ -0,0 +1,88 @@
+
+
+
+
+Function as_child
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      
+
      
+
      
+PrevUpHomeNext
+
      
+
      
+
      
+
      
+
      Function as_child
      
+
      boost::proto::as_child — A function that wraps non-Proto objects in Proto terminals (by reference) and leaves
+          Proto expression types alone.
      
+
      
+
      Synopsis
      
+
      // In header: <boost/proto/traits.hpp>
+
+
+template<typename T> 
+  typename proto::result_of::as_child< T >::type as_child(T & t);
+template<typename T> 
+  typename proto::result_of::as_child< T const >::type as_child(T const & t);
+template<typename Domain, typename T> 
+  typename proto::result_of::as_child< T, Domain >::type as_child(T & t);
+template<typename Domain, typename T> 
+  typename proto::result_of::as_child< T const, Domain >::type 
+  as_child(T const & t);
      
+
      
+
      Description
      
+
      
+            The proto::as_child() function returns Proto expression
+            objects that are suitable for storage as child nodes in an expression tree. It turns
+            non-Proto objects into Proto terminals. Its behavior is domain-specific. By default,
+            non-Proto types are held wrapped by reference in a new Proto terminal expression, and
+            objects that are already Proto expressions are simply returned by reference.
+          
      
+
      
+            If Domain is not explicitly specified, it is assumed to
+            be proto::default_domain.
+          
      
+
      
+            See proto::domain::as_child<>
+            for a complete description of this function's default behavior.
+          
      
+
      
++++
+
+
+
+
+
      



      Returns:
      		typename Domain::template as_child< T >()(t)
      
+
      
+
      
+
+
+
+
      Copyright © 2008 Eric Niebler
      
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      
      
+
      
+
      
+
      
+PrevUpHomeNext
+
      
+
+
diff --git a/doc/html/boost/proto/as_child_idp227418704.html b/doc/html/boost/proto/as_child_idp227418704.html
deleted file mode 100644
index 907d0f5e1c..0000000000
--- a/doc/html/boost/proto/as_child_idp227418704.html
+++ /dev/null
@@ -1,88 +0,0 @@
-
-
-
-
-Function as_child
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      
-
      
-
      
-PrevUpHomeNext
-
      
-
      
-
      
-
      
-
      Function as_child
      
-
      boost::proto::as_child — A function that wraps non-Proto objects in Proto terminals (by reference) and leaves
-          Proto expression types alone.
      
-
      
-
      Synopsis
      
-
      // In header: <boost/proto/traits.hpp>
-
-
-template<typename T> 
-  typename proto::result_of::as_child< T >::type as_child(T & t);
-template<typename T> 
-  typename proto::result_of::as_child< T const >::type as_child(T const & t);
-template<typename Domain, typename T> 
-  typename proto::result_of::as_child< T, Domain >::type as_child(T & t);
-template<typename Domain, typename T> 
-  typename proto::result_of::as_child< T const, Domain >::type 
-  as_child(T const & t);
      
-
      
-
      Description
      
-
      
-            The proto::as_child() function returns Proto expression
-            objects that are suitable for storage as child nodes in an expression tree. It turns
-            non-Proto objects into Proto terminals. Its behavior is domain-specific. By default,
-            non-Proto types are held wrapped by reference in a new Proto terminal expression, and
-            objects that are already Proto expressions are simply returned by reference.
-          
      
-
      
-            If Domain is not explicitly specified, it is assumed to
-            be proto::default_domain.
-          
      
-
      
-            See proto::domain::as_child<>
-            for a complete description of this function's default behavior.
-          
      
-
      
----
-
-
-
-
-
      



      Returns:
      		typename Domain::template as_child< T >()(t)
      
-
      
-
      
-
-
-
-
      Copyright © 2008 Eric Niebler
      
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      
      
-
      
-
      
-
      
-PrevUpHomeNext
-
      
-
-
diff --git a/doc/html/boost/proto/as_env_idm45506990359280.html b/doc/html/boost/proto/as_env_idm45506990359280.html
new file mode 100644
index 0000000000..22d12cefa8
--- /dev/null
+++ b/doc/html/boost/proto/as_env_idm45506990359280.html
@@ -0,0 +1,79 @@
+
+
+
+
+Function as_env
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      
+
      
+
      
+PrevUpHomeNext
+
      
+
      
+
      
+
      
+
      Function as_env
      
+
      boost::proto::as_env — 
+          For ensuring that the given argument is a transform environment. If it is not already,
+          it is made one as if by (proto::data = t).
+        
      
+
      
+
      Synopsis
      
+
      // In header: <boost/proto/transform/env.hpp>
+
+
+template<typename T> 
+  typename proto::result_of::as_env<T &>::type as_env(T & t);
+template<typename T> 
+  typename proto::result_of::as_env<T const &>::type as_env(T const & t);
      
+
      
+
      Description
      
+
      
+            See also:
+            
      
+
      
+
      
+          
      
+
      
++++
+
+
+
+
+
      



      Returns:
      		proto::functional::as_env()(t)
      
+
      
+
      
+
+
+
+
      Copyright © 2008 Eric Niebler
      
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      
      
+
      
+
      
+
      
+PrevUpHomeNext
+
      
+
+
diff --git a/doc/html/boost/proto/as_env_idp212938672.html b/doc/html/boost/proto/as_env_idp212938672.html
deleted file mode 100644
index b5d8c63ca2..0000000000
--- a/doc/html/boost/proto/as_env_idp212938672.html
+++ /dev/null
@@ -1,79 +0,0 @@
-
-
-
-
-Function as_env
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      
-
      
-
      
-PrevUpHomeNext
-
      
-
      
-
      
-
      
-
      Function as_env
      
-
      boost::proto::as_env — 
-          For ensuring that the given argument is a transform environment. If it is not already,
-          it is made one as if by (proto::data = t).
-        
      
-
      
-
      Synopsis
      
-
      // In header: <boost/proto/transform/env.hpp>
-
-
-template<typename T> 
-  typename proto::result_of::as_env<T &>::type as_env(T & t);
-template<typename T> 
-  typename proto::result_of::as_env<T const &>::type as_env(T const & t);
      
-
      
-
      Description
      
-
      
-            See also:
-            
      
-
      
-
      
-          
      
-
      
----
-
-
-
-
-
      



      Returns:
      		proto::functional::as_env()(t)
      
-
      
-
      
-
-
-
-
      Copyright © 2008 Eric Niebler
      
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      
      
-
      
-
      
-
      
-PrevUpHomeNext
-
      
-
-
diff --git a/doc/html/boost/proto/as_expr_idm45506991005376.html b/doc/html/boost/proto/as_expr_idm45506991005376.html
new file mode 100644
index 0000000000..414f916c6c
--- /dev/null
+++ b/doc/html/boost/proto/as_expr_idm45506991005376.html
@@ -0,0 +1,88 @@
+
+
+
+
+Function as_expr
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      
+
      
+
      
+PrevUpHomeNext
+
      
+
      
+
      
+
      
+
      Function as_expr
      
+
      boost::proto::as_expr — A function that wraps non-Proto expression types in Proto terminals and leaves Proto
+          expression types alone.
      
+
      
+
      Synopsis
      
+
      // In header: <boost/proto/traits.hpp>
+
+
+template<typename T> 
+  typename proto::result_of::as_expr< T >::type as_expr(T & t);
+template<typename T> 
+  typename proto::result_of::as_expr< T const >::type as_expr(T const & t);
+template<typename Domain, typename T> 
+  typename proto::result_of::as_expr< T, Domain >::type as_expr(T & t);
+template<typename Domain, typename T> 
+  typename proto::result_of::as_expr< T const, Domain >::type 
+  as_expr(T const & t);
      
+
      
+
      Description
      
+
      
+            The proto::as_expr() function returns Proto expression
+            objects that are suitable for storage in a local variable. It turns non-Proto objects
+            into Proto terminals. Its behavior is domain-specific. By default, 
+            non-Proto types are wrapped by value (if possible) in a new Proto terminal expression,
+            and objects that are already Proto expressions are returned by value.
+          
      
+
      
+            If Domain is not explicitly specified, it is assumed to
+            be proto::default_domain.
+          
      
+
      
+            See proto::domain::as_expr<>
+            for a complete description of this function's default behavior.
+          
      
+
      
++++
+
+
+
+
+
      



      Returns:
      		typename Domain::template as_expr< T >()(t)
      
+
      
+
      
+
+
+
+
      Copyright © 2008 Eric Niebler
      
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      
      
+
      
+
      
+
      
+PrevUpHomeNext
+
      
+
+
diff --git a/doc/html/boost/proto/as_expr_idp227396736.html b/doc/html/boost/proto/as_expr_idp227396736.html
deleted file mode 100644
index 1ab1a936f2..0000000000
--- a/doc/html/boost/proto/as_expr_idp227396736.html
+++ /dev/null
@@ -1,88 +0,0 @@
-
-
-
-
-Function as_expr
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      
-
      
-
      
-PrevUpHomeNext
-
      
-
      
-
      
-
      
-
      Function as_expr
      
-
      boost::proto::as_expr — A function that wraps non-Proto expression types in Proto terminals and leaves Proto
-          expression types alone.
      
-
      
-
      Synopsis
      
-
      // In header: <boost/proto/traits.hpp>
-
-
-template<typename T> 
-  typename proto::result_of::as_expr< T >::type as_expr(T & t);
-template<typename T> 
-  typename proto::result_of::as_expr< T const >::type as_expr(T const & t);
-template<typename Domain, typename T> 
-  typename proto::result_of::as_expr< T, Domain >::type as_expr(T & t);
-template<typename Domain, typename T> 
-  typename proto::result_of::as_expr< T const, Domain >::type 
-  as_expr(T const & t);
      
-
      
-
      Description
      
-
      
-            The proto::as_expr() function returns Proto expression
-            objects that are suitable for storage in a local variable. It turns non-Proto objects
-            into Proto terminals. Its behavior is domain-specific. By default, 
-            non-Proto types are wrapped by value (if possible) in a new Proto terminal expression,
-            and objects that are already Proto expressions are returned by value.
-          
      
-
      
-            If Domain is not explicitly specified, it is assumed to
-            be proto::default_domain.
-          
      
-
      
-            See proto::domain::as_expr<>
-            for a complete description of this function's default behavior.
-          
      
-
      
----
-
-
-
-
-
      



      Returns:
      		typename Domain::template as_expr< T >()(t)
      
-
      
-
      
-
-
-
-
      Copyright © 2008 Eric Niebler
      
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      
      
-
      
-
      
-
      
-PrevUpHomeNext
-
      
-
-
diff --git a/doc/html/boost/proto/assert_matches.html b/doc/html/boost/proto/assert_matches.html
index 8b22b3abff..46e1f7f68f 100644
--- a/doc/html/boost/proto/assert_matches.html
+++ b/doc/html/boost/proto/assert_matches.html
@@ -7,7 +7,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
 
      
 
      
-PrevUpHomeNext
+PrevUpHomeNext
 
      
 
      
 
      
@@ -39,7 +39,7 @@
 template<typename Grammar, typename Expr> 
   void assert_matches(Expr const & expr);
    -

    Description

    +

    Description

    Use proto::assert_matches() to assert at compile-time that an expression matches a grammar. @@ -85,7 +85,7 @@ proto::assert_matches<PlusInts>( -PrevUpHomeNext +PrevUpHomeNext

    diff --git a/doc/html/boost/proto/assert_matches_not.html b/doc/html/boost/proto/assert_matches_not.html index d9d7b40fb4..104fca1528 100644 --- a/doc/html/boost/proto/assert_matches_not.html +++ b/doc/html/boost/proto/assert_matches_not.html @@ -39,7 +39,7 @@ template<typename Grammar, typename Expr> void assert_matches_not(Expr const & expr);
    -

    Description

    +

    Description

    Use proto::assert_matches_not() to assert at compile-time that an expression does not match a grammar. diff --git a/doc/html/boost/proto/assign.html b/doc/html/boost/proto/assign.html index c141079a94..36e6a12412 100644 --- a/doc/html/boost/proto/assign.html +++ b/doc/html/boost/proto/assign.html @@ -50,7 +50,7 @@ }; };

    -

    Description

    +

    Description

    diff --git a/doc/html/boost/proto/assign/impl.html b/doc/html/boost/proto/assign/impl.html index 3765721433..a7f15ec5a2 100644 --- a/doc/html/boost/proto/assign/impl.html +++ b/doc/html/boost/proto/assign/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -47,7 +47,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/proto/basic_default_generator.html b/doc/html/boost/proto/basic_default_generator.html index 4a630e8198..020be0c262 100644 --- a/doc/html/boost/proto/basic_default_generator.html +++ b/doc/html/boost/proto/basic_default_generator.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -51,7 +51,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/proto/basic_expr.html b/doc/html/boost/proto/basic_expr.html index 9a250a8c6c..48da1e0264 100644 --- a/doc/html/boost/proto/basic_expr.html +++ b/doc/html/boost/proto/basic_expr.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -44,15 +44,15 @@ typedef basic_expr proto_derived_expr; typedef typename Args::childN proto_childN; // For each N in [0,max(Arity,1)). - // public static functions - template<typename... A> static basic_expr const make(A const &...); + // public static functions + template<typename... A> static basic_expr const make(A const &...); - // public member functions - basic_expr & proto_base(); - basic_expr const & proto_base() const; + // public member functions + basic_expr & proto_base(); + basic_expr const & proto_base() const; };
    -

    Description

    +

    Description

    proto::basic_expr<> is a node in an expression template tree. It is a container for its child sub-trees. It also serves as the @@ -87,10 +87,10 @@ expressions.

    -

    -basic_expr public static functions

    +

    +basic_expr public static functions

    1. -
      template<typename... A> static basic_expr const make(A const &... a);
      +
      template<typename... A> static basic_expr const make(A const &... a);
      @@ -114,11 +114,11 @@
      -

      -basic_expr public member functions

      +

      +basic_expr public member functions

      1. -
        basic_expr & proto_base();
        +
        basic_expr & proto_base();
      @@ -133,7 +133,7 @@
    2. -
      basic_expr const & proto_base() const;
      +
      basic_expr const & proto_base() const;

      This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. @@ -153,7 +153,7 @@

      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/proto/binary_expr.html b/doc/html/boost/proto/binary_expr.html index 07ef14ebe5..464b5c2e55 100644 --- a/doc/html/boost/proto/binary_expr.html +++ b/doc/html/boost/proto/binary_expr.html @@ -51,7 +51,7 @@ }; };
    -

    Description

    +

    Description

    Use proto::binary_expr<proto::_, proto::_, proto::_> as a grammar element to match any binary expression.

    diff --git a/doc/html/boost/proto/binary_expr/impl.html b/doc/html/boost/proto/binary_expr/impl.html index 659fdd2678..125ba02c63 100644 --- a/doc/html/boost/proto/binary_expr/impl.html +++ b/doc/html/boost/proto/binary_expr/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -49,7 +49,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/proto/bitwise_and.html b/doc/html/boost/proto/bitwise_and.html index 4a66e628ad..d1d5a4ffb3 100644 --- a/doc/html/boost/proto/bitwise_and.html +++ b/doc/html/boost/proto/bitwise_and.html @@ -50,7 +50,7 @@ }; };
    -

    Description

    +

    Description

    diff --git a/doc/html/boost/proto/bitwise_and/impl.html b/doc/html/boost/proto/bitwise_and/impl.html index 04842c4271..59facd1548 100644 --- a/doc/html/boost/proto/bitwise_and/impl.html +++ b/doc/html/boost/proto/bitwise_and/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -49,7 +49,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/proto/bitwise_and_assign.html b/doc/html/boost/proto/bitwise_and_assign.html index 57d87736d1..90166ce23f 100644 --- a/doc/html/boost/proto/bitwise_and_assign.html +++ b/doc/html/boost/proto/bitwise_and_assign.html @@ -49,7 +49,7 @@ }; };
    -

    Description

    +

    Description

    diff --git a/doc/html/boost/proto/bitwise_and_assign/impl.html b/doc/html/boost/proto/bitwise_and_assign/impl.html index d3d8aa4e15..86bf7086bd 100644 --- a/doc/html/boost/proto/bitwise_and_assign/impl.html +++ b/doc/html/boost/proto/bitwise_and_assign/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -49,7 +49,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/proto/bitwise_or.html b/doc/html/boost/proto/bitwise_or.html index 1c12c19c87..9c1d7934fc 100644 --- a/doc/html/boost/proto/bitwise_or.html +++ b/doc/html/boost/proto/bitwise_or.html @@ -50,7 +50,7 @@ }; };
    -

    Description

    +

    Description

    diff --git a/doc/html/boost/proto/bitwise_or/impl.html b/doc/html/boost/proto/bitwise_or/impl.html index 613f913816..409c31d09f 100644 --- a/doc/html/boost/proto/bitwise_or/impl.html +++ b/doc/html/boost/proto/bitwise_or/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -49,7 +49,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/proto/bitwise_or_assign.html b/doc/html/boost/proto/bitwise_or_assign.html index fa81bc8af5..7bed523044 100644 --- a/doc/html/boost/proto/bitwise_or_assign.html +++ b/doc/html/boost/proto/bitwise_or_assign.html @@ -50,7 +50,7 @@ }; };
    -

    Description

    +

    Description

    diff --git a/doc/html/boost/proto/bitwise_or_assign/impl.html b/doc/html/boost/proto/bitwise_or_assign/impl.html index 42ace39f05..e6a51bba43 100644 --- a/doc/html/boost/proto/bitwise_or_assign/impl.html +++ b/doc/html/boost/proto/bitwise_or_assign/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -49,7 +49,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/proto/bitwise_xor.html b/doc/html/boost/proto/bitwise_xor.html index 53767272f7..82501d5734 100644 --- a/doc/html/boost/proto/bitwise_xor.html +++ b/doc/html/boost/proto/bitwise_xor.html @@ -50,7 +50,7 @@ }; };
    -

    Description

    +

    Description

    diff --git a/doc/html/boost/proto/bitwise_xor/impl.html b/doc/html/boost/proto/bitwise_xor/impl.html index 1eb3a3e21b..d4e37cec54 100644 --- a/doc/html/boost/proto/bitwise_xor/impl.html +++ b/doc/html/boost/proto/bitwise_xor/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -49,7 +49,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/proto/bitwise_xor_assign.html b/doc/html/boost/proto/bitwise_xor_assign.html index dc770fa140..72469aa2f6 100644 --- a/doc/html/boost/proto/bitwise_xor_assign.html +++ b/doc/html/boost/proto/bitwise_xor_assign.html @@ -49,7 +49,7 @@ }; };
    -

    Description

    +

    Description

    diff --git a/doc/html/boost/proto/bitwise_xor_assign/impl.html b/doc/html/boost/proto/bitwise_xor_assign/impl.html index 35e720acbe..afae309aef 100644 --- a/doc/html/boost/proto/bitwise_xor_assign/impl.html +++ b/doc/html/boost/proto/bitwise_xor_assign/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -49,7 +49,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/proto/by_value_generator.html b/doc/html/boost/proto/by_value_generator.html index 0f6867c656..e3d34a6a92 100644 --- a/doc/html/boost/proto/by_value_generator.html +++ b/doc/html/boost/proto/by_value_generator.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -39,16 +39,16 @@ struct by_value_generator : proto::callable { // member classes/structs/unions template<typename This, typename Expr> - struct result<This(Expr)> { + struct result<This(Expr)> { // types - typedef unspecified type; + typedef unspecified type; }; - // public member functions - template<typename Expr> unspecified operator()(Expr const &) const; + // public member functions + template<typename Expr> unspecified operator()(Expr const &) const; };
    -

    Description

    +

    Description

    Generators are intended for use as the first template parameter to the proto::domain<> @@ -59,10 +59,10 @@ MyGenerator>.

    -

    -by_value_generator public member functions

    +

    +by_value_generator public member functions

    1. -
      template<typename Expr> unspecified operator()(Expr const & expr) const;
      +
      template<typename Expr> unspecified operator()(Expr const & expr) const;
      @@ -84,7 +84,7 @@ - +

      Returns:

      Equivalent to proto::deep_copy(expr)

      Equivalent to proto::deep_copy(expr)
      @@ -102,7 +102,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/proto/by_value_generator/result_T_idm45506975265200.html b/doc/html/boost/proto/by_value_generator/result_T_idm45506975265200.html new file mode 100644 index 0000000000..9687703560 --- /dev/null +++ b/doc/html/boost/proto/by_value_generator/result_T_idm45506975265200.html @@ -0,0 +1,55 @@ + + + + +Struct template result<This(Expr)> + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Struct template result<This(Expr)>

      +

      boost::proto::by_value_generator::result<This(Expr)>

      +
      +

      Synopsis

      +
      // In header: <boost/proto/generate.hpp>
+
+
+template<typename This, typename Expr> 
+struct result<This(Expr)> {
+  // types
+  typedef unspecified type;
+};
      +
      + + + +
      Copyright © 2008 Eric Niebler

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/proto/by_value_generator/result_This_E_idp204758176.html b/doc/html/boost/proto/by_value_generator/result_This_E_idp204758176.html deleted file mode 100644 index 3cb1eb96a7..0000000000 --- a/doc/html/boost/proto/by_value_generator/result_This_E_idp204758176.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template result<This(Expr)> - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Struct template result<This(Expr)>

      -

      boost::proto::by_value_generator::result<This(Expr)>

      -
      -

      Synopsis

      -
      // In header: <boost/proto/generate.hpp>
-
-
-template<typename This, typename Expr> 
-struct result<This(Expr)> {
-  // types
-  typedef unspecified type;
-};
      -
      - - - -
      Copyright © 2008 Eric Niebler

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/proto/call.html b/doc/html/boost/proto/call.html index 4499056276..c136fc0849 100644 --- a/doc/html/boost/proto/call.html +++ b/doc/html/boost/proto/call.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      @@ -40,14 +40,14 @@ // types typedef see-below result_type; - // public member functions - result_type operator()(typename impl::expr_param, + // public member functions + result_type operator()(typename impl::expr_param, typename impl::state_param, typename impl::data_param) const; }; };
      -

      Description

      +

      Description

      The purpose of proto::call<> is to annotate a transform as callable so that proto::when<> knows @@ -75,7 +75,7 @@

      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/proto/call/impl.html b/doc/html/boost/proto/call/impl.html index f67699177c..a7a739f52c 100644 --- a/doc/html/boost/proto/call/impl.html +++ b/doc/html/boost/proto/call/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      @@ -38,15 +38,15 @@ // types typedef see-below result_type; - // public member functions - result_type operator()(typename impl::expr_param, + // public member functions + result_type operator()(typename impl::expr_param, typename impl::state_param, typename impl::data_param) const; };
      -

      Description

      +

      Description

      -

      +

      impl public types

      @@ -150,10 +150,10 @@
    -

    -impl public member functions

    +

    +impl public member functions

    1. -
      result_type operator()(typename impl::expr_param expr, 
+
      result_type operator()(typename impl::expr_param expr, 
                        typename impl::state_param state, 
                        typename impl::data_param data) const;
      
 
      
@@ -263,7 +263,7 @@
 
 
      
 
      
-PrevUpHomeNext
+PrevUpHomeNext
 
      
 
 
diff --git a/doc/html/boost/proto/callable.html b/doc/html/boost/proto/callable.html
index 669b049b1a..ed7a8280c6 100644
--- a/doc/html/boost/proto/callable.html
+++ b/doc/html/boost/proto/callable.html
@@ -36,7 +36,7 @@
 struct callable {
 };
    -

    Description

    +

    Description

    When defining a callable PolymorphicFunctionObject, inherit from proto::callable so that it can be used to create diff --git a/doc/html/boost/proto/child_c_idm45506990932896.html b/doc/html/boost/proto/child_c_idm45506990932896.html new file mode 100644 index 0000000000..69083309c8 --- /dev/null +++ b/doc/html/boost/proto/child_c_idm45506990932896.html @@ -0,0 +1,92 @@ + + + + +Function child_c + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +

    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function child_c

    +

    boost::proto::child_c — Return the Nth child of the specified + Proto expression.

    +
    +

    Synopsis

    +
    // In header: <boost/proto/traits.hpp>
+
+
+template<long N, typename Expr> 
+  typename proto::result_of::child_c< Expr &, N >::type child_c(Expr & expr);
+template<long N, typename Expr> 
+  typename proto::result_of::child_c< Expr const &, N >::type 
+  child_c(Expr const & expr);
    +
    +

    Description

    +

    + Return the Nth child of the specified Proto + expression. The child is returned by reference. +

    +
    ++++ + + + + + + + + + + + + + + +

    Requires:

    		 +

    + proto::is_expr<Expr>::value is + true. +

    +

    + N < Expr::proto_arity::value +

    +

    Returns:

    A reference to the Nth child + of expr.

    Throws:

    		Will not throw.
    +
    +
    + + + +
    Copyright © 2008 Eric Niebler

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/proto/child_c_idp227469216.html b/doc/html/boost/proto/child_c_idp227469216.html deleted file mode 100644 index a09b03ce67..0000000000 --- a/doc/html/boost/proto/child_c_idp227469216.html +++ /dev/null @@ -1,92 +0,0 @@ - - - - -Function child_c - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function child_c

    -

    boost::proto::child_c — Return the Nth child of the specified - Proto expression.

    -
    -

    Synopsis

    -
    // In header: <boost/proto/traits.hpp>
-
-
-template<long N, typename Expr> 
-  typename proto::result_of::child_c< Expr &, N >::type child_c(Expr & expr);
-template<long N, typename Expr> 
-  typename proto::result_of::child_c< Expr const &, N >::type 
-  child_c(Expr const & expr);
    -
    -

    Description

    -

    - Return the Nth child of the specified Proto - expression. The child is returned by reference. -

    -
    ---- - - - - - - - - - - - - - - -

    Requires:

    		 -

    - proto::is_expr<Expr>::value is - true. -

    -

    - N < Expr::proto_arity::value -

    -

    Returns:

    A reference to the Nth child - of expr.

    Throws:

    		Will not throw.
    -
    -
    - - - -
    Copyright © 2008 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/proto/child_idm45506990961392.html b/doc/html/boost/proto/child_idm45506990961392.html new file mode 100644 index 0000000000..afabe83e9f --- /dev/null +++ b/doc/html/boost/proto/child_idm45506990961392.html @@ -0,0 +1,114 @@ + + + + +Function child + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function child

    +

    boost::proto::child — Return the Nth child of the specified Proto expression.

    +
    +

    Synopsis

    +
    // In header: <boost/proto/traits.hpp>
+
+
+template<typename N, typename Expr> 
+  typename proto::result_of::child< Expr &, N >::type child(Expr & expr);
+template<typename N, typename Expr> 
+  typename proto::result_of::child< Expr const &, N >::type 
+  child(Expr const & expr);
+template<typename Expr> 
+  typename proto::result_of::child< Expr & >::type child(Expr & expr);
+template<typename Expr> 
+  typename proto::result_of::child< Expr const & >::type 
+  child(Expr const & expr);
    +
    +

    Description

    +

    + Return the Nth child of the specified Proto expression. + If N is not specified, as in proto::child(expr), + then N is assumed to be mpl::long_<0>. + The child is returned by reference. +

    +
    ++++ + + + + + + + + + + + + + + + + + + +

    Parameters:

    ++++ + + + + +

    expr

    The Proto expression.

    Requires:

    		 +

    + proto::is_expr<Expr>::value is + true. +

    +

    + N is an MPL Integral Constant. +

    +

    + N::value < Expr::proto_arity::value +

    +

    Returns:

    A reference to the Nth child + of expr.

    Throws:

    		Will not throw.
    +
    +
    + + + +
    Copyright © 2008 Eric Niebler

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/proto/child_idp227440720.html b/doc/html/boost/proto/child_idp227440720.html deleted file mode 100644 index 0ff365d2f5..0000000000 --- a/doc/html/boost/proto/child_idp227440720.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - -Function child - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function child

    -

    boost::proto::child — Return the Nth child of the specified Proto expression.

    -
    -

    Synopsis

    -
    // In header: <boost/proto/traits.hpp>
-
-
-template<typename N, typename Expr> 
-  typename proto::result_of::child< Expr &, N >::type child(Expr & expr);
-template<typename N, typename Expr> 
-  typename proto::result_of::child< Expr const &, N >::type 
-  child(Expr const & expr);
-template<typename Expr> 
-  typename proto::result_of::child< Expr & >::type child(Expr & expr);
-template<typename Expr> 
-  typename proto::result_of::child< Expr const & >::type 
-  child(Expr const & expr);
    -
    -

    Description

    -

    - Return the Nth child of the specified Proto expression. - If N is not specified, as in proto::child(expr), - then N is assumed to be mpl::long_<0>. - The child is returned by reference. -

    -
    ---- - - - - - - - - - - - - - - - - - - -

    Parameters:

    ---- - - - - -

    expr

    The Proto expression.

    Requires:

    		 -

    - proto::is_expr<Expr>::value is - true. -

    -

    - N is an MPL Integral Constant. -

    -

    - N::value < Expr::proto_arity::value -

    -

    Returns:

    A reference to the Nth child - of expr.

    Throws:

    		Will not throw.
    -
    -
    - - - -
    Copyright © 2008 Eric Niebler

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/proto/comma.html b/doc/html/boost/proto/comma.html index fdf8be5baa..3679c744ec 100644 --- a/doc/html/boost/proto/comma.html +++ b/doc/html/boost/proto/comma.html @@ -48,7 +48,7 @@ }; };
    -

    Description

    +

    Description

    diff --git a/doc/html/boost/proto/comma/impl.html b/doc/html/boost/proto/comma/impl.html index b695b3918e..7077141ac3 100644 --- a/doc/html/boost/proto/comma/impl.html +++ b/doc/html/boost/proto/comma/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -47,7 +47,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/proto/complement.html b/doc/html/boost/proto/complement.html index e395dbc8f1..1d59ff07b9 100644 --- a/doc/html/boost/proto/complement.html +++ b/doc/html/boost/proto/complement.html @@ -50,7 +50,7 @@ }; };
    -

    Description

    +

    Description

    diff --git a/doc/html/boost/proto/complement/impl.html b/doc/html/boost/proto/complement/impl.html index 03f649c1ae..e0ae3a0d2b 100644 --- a/doc/html/boost/proto/complement/impl.html +++ b/doc/html/boost/proto/complement/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -49,7 +49,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/proto/compose_generators.html b/doc/html/boost/proto/compose_generators.html index 90c93f021e..e48aceef42 100644 --- a/doc/html/boost/proto/compose_generators.html +++ b/doc/html/boost/proto/compose_generators.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -37,22 +37,22 @@ struct compose_generators : proto::callable { // member classes/structs/unions template<typename This, typename Expr> - struct result<This(Expr)> : + struct result<This(Expr)> : boost::result_of< Second(typename boost::result_of<First(Expr)>::type) > { }; - // public member functions + // public member functions template<typename Expr> typename boost::result_of< Second(typename boost::result_of<First(Expr)>::type) >::type - operator()(Expr const &) const; + operator()(Expr const &) const; };
    -

    Description

    +

    Description

    Generators are intended for use as the first template parameter to the proto::domain<> @@ -62,14 +62,14 @@ generator for further transformation.

    -

    -compose_generators public member functions

    +

    +compose_generators public member functions

    1. template<typename Expr> 
   typename boost::result_of<
       Second(typename boost::result_of<First(Expr)>::type)
     >::type 
-  operator()(Expr const & expr) const;
      + operator()(Expr const & expr) const;
      @@ -109,7 +109,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/proto/compose_generators/result_T_idm45506975247184.html b/doc/html/boost/proto/compose_generators/result_T_idm45506975247184.html new file mode 100644 index 0000000000..a6bf1c70ab --- /dev/null +++ b/doc/html/boost/proto/compose_generators/result_T_idm45506975247184.html @@ -0,0 +1,57 @@ + + + + +Struct template result<This(Expr)> + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Struct template result<This(Expr)>

      +

      boost::proto::compose_generators::result<This(Expr)>

      +
      +

      Synopsis

      +
      // In header: <boost/proto/generate.hpp>
+
+
+template<typename This, typename Expr> 
+struct result<This(Expr)> :  
+    boost::result_of<
+      Second(typename boost::result_of<First(Expr)>::type)
+    >
+{
+};
      +
      + + + +
      Copyright © 2008 Eric Niebler

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/proto/compose_generators/result_This_E_idp224772464.html b/doc/html/boost/proto/compose_generators/result_This_E_idp224772464.html deleted file mode 100644 index 270755e2cc..0000000000 --- a/doc/html/boost/proto/compose_generators/result_This_E_idp224772464.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Struct template result<This(Expr)> - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Struct template result<This(Expr)>

      -

      boost::proto::compose_generators::result<This(Expr)>

      -
      -

      Synopsis

      -
      // In header: <boost/proto/generate.hpp>
-
-
-template<typename This, typename Expr> 
-struct result<This(Expr)> :  
-    boost::result_of<
-      Second(typename boost::result_of<First(Expr)>::type)
-    >
-{
-};
      -
      - - - -
      Copyright © 2008 Eric Niebler

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/proto/context/callable_context.html b/doc/html/boost/proto/context/callable_context.html index 90e19dfaa1..37f2efba2c 100644 --- a/doc/html/boost/proto/context/callable_context.html +++ b/doc/html/boost/proto/context/callable_context.html @@ -42,7 +42,7 @@ }; };
      -

      Description

      +

      Description

      proto::callable_context<> is a base class that implements the context protocol by passing fanned-out expression nodes to the derived diff --git a/doc/html/boost/proto/context/callable_context/eval.html b/doc/html/boost/proto/context/callable_context/eval.html index ac544c4154..7836305ae7 100644 --- a/doc/html/boost/proto/context/callable_context/eval.html +++ b/doc/html/boost/proto/context/callable_context/eval.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@

      -PrevUpHomeNext +PrevUpHomeNext
      @@ -37,7 +37,7 @@ struct eval : see-below { };
      -

      Description

      +

      Description

      A BinaryFunction that accepts an Expr and a Context, and either fans out the expression and passes @@ -64,7 +64,7 @@

      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/proto/context/callable_eval.html b/doc/html/boost/proto/context/callable_eval.html index 838c1b9a89..5ee3fe3131 100644 --- a/doc/html/boost/proto/context/callable_eval.html +++ b/doc/html/boost/proto/context/callable_eval.html @@ -46,25 +46,25 @@ )>::type result_type; - // public member functions - result_type operator()(Expr &, Context &) const; + // public member functions + result_type operator()(Expr &, Context &) const; };
      -

      Description

      +

      Description

      proto::context::callable_eval<> requires that Context is a PolymorphicFunctionObject that can be invoked with Expr's tag and children as expressions, as follows:

      -
      context(typename Expr::proto_tag(), proto::child_c<0>(expr), ... proto::child_c<N>(expr))
      +
      context(typename Expr::proto_tag(), proto::child_c<0>(expr), ... proto::child_c<N>(expr))

      -

      -callable_eval public member functions

      +

      +callable_eval public member functions

      1. -
        result_type operator()(Expr & expr, Context & context) const;
        +
        result_type operator()(Expr & expr, Context & context) const;
        @@ -95,8 +95,8 @@ diff --git a/doc/html/boost/proto/context/default_context.html b/doc/html/boost/proto/context/default_context.html index be85235d6b..47ee7e7f2d 100644 --- a/doc/html/boost/proto/context/default_context.html +++ b/doc/html/boost/proto/context/default_context.html @@ -40,7 +40,7 @@ };};
        -

        Description

        +

        Description

        An evaluation context that gives the operators their normal C++ semantics.

        diff --git a/doc/html/boost/proto/context/default_context/eval.html b/doc/html/boost/proto/context/default_context/eval.html index 95841be35e..013a159d3c 100644 --- a/doc/html/boost/proto/context/default_context/eval.html +++ b/doc/html/boost/proto/context/default_context/eval.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@

        context(typename Expr::proto_tag(), - proto::child_c<0>(expr),... - proto::child_c<N>(expr)) + proto::child_c<0>(expr),... + proto::child_c<N>(expr))

        -PrevUpHomeNext +PrevUpHomeNext
        @@ -47,7 +47,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        diff --git a/doc/html/boost/proto/context/default_eval.html b/doc/html/boost/proto/context/default_eval.html index 13cbb12444..1d1b64bf65 100644 --- a/doc/html/boost/proto/context/default_eval.html +++ b/doc/html/boost/proto/context/default_eval.html @@ -43,15 +43,15 @@ typedef typename Expr::tag_type Tag; // For exposition only typedef see-below result_type; - // public member functions - result_type operator()(Expr &, Context &) const; + // public member functions + result_type operator()(Expr &, Context &) const; // public data members static Expr & s_expr; // For exposition only static Context & s_context; // For exposition only };
        -

        Description

        +

        Description

        Let OP be the C++ operator corresponding to Expr::proto_tag. (For example, if @@ -65,7 +65,7 @@ approximate the behavior.

        -

        +

        default_eval public types

        @@ -79,7 +79,7 @@ then the result type is 

        decltype(
-  OP proto::eval(proto::child(s_expr), s_context)
+  OP proto::eval(proto::child(s_expr), s_context)
 )

        @@ -90,7 +90,7 @@ then the result type is 

        decltype(
-  proto::eval(proto::child(s_expr), s_context) OP
+  proto::eval(proto::child(s_expr), s_context) OP
 )

        @@ -101,8 +101,8 @@ then the result type is 

        decltype(
-  proto::eval(proto::left(s_expr), s_context) OP
-  proto::eval(proto::right(s_expr), s_context)
+  proto::eval(proto::left(s_expr), s_context) OP
+  proto::eval(proto::right(s_expr), s_context)
 )

        @@ -115,8 +115,8 @@ then the result type is 

        decltype(
-  proto::eval(proto::left(s_expr), s_context) [
-  proto::eval(proto::right(s_expr), s_context) ]
+  proto::eval(proto::left(s_expr), s_context) [
+  proto::eval(proto::right(s_expr), s_context) ]
 )

        @@ -129,9 +129,9 @@ then the result type is 

        decltype(
-  proto::eval(proto::child_c<0>(s_expr), s_context) ?
-  proto::eval(proto::child_c<1>(s_expr), s_context) :
-  proto::eval(proto::child_c<2>(s_expr), s_context)
+  proto::eval(proto::child_c<0>(s_expr), s_context) ?
+  proto::eval(proto::child_c<1>(s_expr), s_context) :
+  proto::eval(proto::child_c<2>(s_expr), s_context)
 )

        @@ -144,10 +144,10 @@ then the result type is 

        decltype(
-  proto::eval(proto::child_c<0>(s_expr), s_context) (
-  proto::eval(proto::child_c<1>(s_expr), s_context),
+  proto::eval(proto::child_c<0>(s_expr), s_context) (
+  proto::eval(proto::child_c<1>(s_expr), s_context),
   ...
-  proto::eval(proto::child_c<N>(s_expr), s_context) )
+  proto::eval(proto::child_c<N>(s_expr), s_context) )
 )

        @@ -156,17 +156,17 @@
      -

      -default_eval public member functions

      +

      +default_eval public member functions

      1. -
        result_type operator()(Expr & expr, Context & context) const;
        +
        result_type operator()(Expr & expr, Context & context) const;
        -

        Description

        +

        Description

      diff --git a/doc/html/boost/proto/context/null_context/eval.html b/doc/html/boost/proto/context/null_context/eval.html index 498371670d..fbddb15cbc 100644 --- a/doc/html/boost/proto/context/null_context/eval.html +++ b/doc/html/boost/proto/context/null_context/eval.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      @@ -47,7 +47,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/proto/context/null_eval.html b/doc/html/boost/proto/context/null_eval.html index f207306e0c..847bf43823 100644 --- a/doc/html/boost/proto/context/null_eval.html +++ b/doc/html/boost/proto/context/null_eval.html @@ -37,21 +37,21 @@ // types typedef void result_type; - // public member functions - void operator()(Expr &, Context &) const; + // public member functions + void operator()(Expr &, Context &) const; };
      -

      Description

      +

      Description

      -

      -null_eval public member functions

      +

      +null_eval public member functions

      1. -
        void operator()(Expr & expr, Context & context) const;
        +
        void operator()(Expr & expr, Context & context) const;

        For N in [0,Expr arity), evaluate:

        -
        proto::eval(proto::child_c<N>(expr), context)
        +
        proto::eval(proto::child_c<N>(expr), context)

      diff --git a/doc/html/boost/proto/convertible_to.html b/doc/html/boost/proto/convertible_to.html index 9bb86e7de9..9cdbadbb43 100644 --- a/doc/html/boost/proto/convertible_to.html +++ b/doc/html/boost/proto/convertible_to.html @@ -36,7 +36,7 @@ struct convertible_to { };
      -

      Description

      +

      Description

      Use proto::convertible_to<> to match a terminal that is convertible to some type. For example, the grammar diff --git a/doc/html/boost/proto/data.html b/doc/html/boost/proto/data.html index 56853b3ecc..05571d7685 100644 --- a/doc/html/boost/proto/data.html +++ b/doc/html/boost/proto/data.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@

      -PrevUpHomeNext +PrevUpHomeNext
      @@ -34,7 +34,7 @@ proto::data_type const data;
      -

      Description

      +

      Description

      A key used for creating a transform environment.

      @@ -48,7 +48,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/proto/data_type.html b/doc/html/boost/proto/data_type.html index 7c60566fab..eebb4570e7 100644 --- a/doc/html/boost/proto/data_type.html +++ b/doc/html/boost/proto/data_type.html @@ -38,25 +38,25 @@ struct data_type { - // public member functions - template<typename Value> env<data_type, see-below> operator=(Value &) const; + // public member functions + template<typename Value> env<data_type, see-below> operator=(Value &) const; template<typename Value> - env<data_type, see-below> operator=(Value const &) const; + env<data_type, see-below> operator=(Value const &) const; };
      -

      Description

      +

      Description

      The proto::data_type type, along with the proto::data global, are declared using the BOOST_PROTO_DEFINE_ENV_VAR() macro.

      -

      -data_type public member functions

      +

      +data_type public member functions

      1. -
        template<typename Value> 
-  env<data_type, see-below> operator=(Value & value) const;
+
        template<typename Value> 
+  env<data_type, see-below> operator=(Value & value) const;
 template<typename Value> 
-  env<data_type, see-below> operator=(Value const & value) const;
        
+  env<data_type, see-below> operator=(Value const & value) const;

        If Value is a specialization boost::reference_wrapper<T>, this function returns env<data_type, T &>(value.get()). diff --git a/doc/html/boost/proto/deduce_domain.html b/doc/html/boost/proto/deduce_domain.html index 54c41ae743..e57198c085 100644 --- a/doc/html/boost/proto/deduce_domain.html +++ b/doc/html/boost/proto/deduce_domain.html @@ -37,12 +37,12 @@ struct deduce_domain { };

      -

      Description

      +

      Description

      When proto::deduce_domain is used as a domain — either explicitly or implicitly by - proto::make_expr(), - proto::unpack_expr(), + proto::make_expr(), + proto::unpack_expr(), or Proto's operator overloads — Proto will use the domains of the child expressions to compute the domain of the parent. It is done in such a way that (A) expressions in domains that share a common super-domain are interoperable, and (B) expressions that are in diff --git a/doc/html/boost/proto/deep_cop_idm45506996666736.html b/doc/html/boost/proto/deep_cop_idm45506996666736.html new file mode 100644 index 0000000000..080e8f308c --- /dev/null +++ b/doc/html/boost/proto/deep_cop_idm45506996666736.html @@ -0,0 +1,77 @@ + + + + +Function template deep_copy + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +

      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Function template deep_copy

      +

      boost::proto::deep_copy — A function for deep-copying Proto expression trees.

      +
      +

      Synopsis

      +
      // In header: <boost/proto/deep_copy.hpp>
+
+
+template<typename Expr> 
+  typename proto::result_of::deep_copy<Expr>::type 
+  deep_copy(Expr const & expr);
      +
      +

      Description

      +

      + A function for deep-copying Proto expression trees. When a tree is deep-copied, all internal + nodes and terminals held by reference are instead held by value.

      +
      ++++ + + + + +

      Notes:

      		 +

      + Terminals of reference-to-function type are left unchanged. +

      +

      + Equivalent to proto::functional::deep_copy()(expr) + . +

      +
      +
      +
      + + + +
      Copyright © 2008 Eric Niebler

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/proto/deep_copy_idp215592560.html b/doc/html/boost/proto/deep_copy_idp215592560.html deleted file mode 100644 index 4d2a093a78..0000000000 --- a/doc/html/boost/proto/deep_copy_idp215592560.html +++ /dev/null @@ -1,77 +0,0 @@ - - - - -Function template deep_copy - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Function template deep_copy

      -

      boost::proto::deep_copy — A function for deep-copying Proto expression trees.

      -
      -

      Synopsis

      -
      // In header: <boost/proto/deep_copy.hpp>
-
-
-template<typename Expr> 
-  typename proto::result_of::deep_copy<Expr>::type 
-  deep_copy(Expr const & expr);
      -
      -

      Description

      -

      - A function for deep-copying Proto expression trees. When a tree is deep-copied, all internal - nodes and terminals held by reference are instead held by value.

      -
      ---- - - - - -

      Notes:

      		 -

      - Terminals of reference-to-function type are left unchanged. -

      -

      - Equivalent to proto::functional::deep_copy()(expr) - . -

      -
      -
      -
      - - - -
      Copyright © 2008 Eric Niebler

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/proto/default_generator.html b/doc/html/boost/proto/default_generator.html index 47b76b6367..df098a760c 100644 --- a/doc/html/boost/proto/default_generator.html +++ b/doc/html/boost/proto/default_generator.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      @@ -36,16 +36,16 @@ struct default_generator : proto::callable { // member classes/structs/unions template<typename This, typename Expr> - struct result<This(Expr)> { + struct result<This(Expr)> { // types - typedef Expr type; + typedef Expr type; }; - // public member functions - template<typename Expr> Expr operator()(Expr const &) const; + // public member functions + template<typename Expr> Expr operator()(Expr const &) const; };
      -

      Description

      +

      Description

      Generators are intended for use as the first template parameter to the proto::domain<> @@ -54,10 +54,10 @@ expressions passed to it.

      -

      -default_generator public member functions

      +

      +default_generator public member functions

      1. -
        template<typename Expr> Expr operator()(Expr const & expr) const;
        +
        template<typename Expr> Expr operator()(Expr const & expr) const;
        @@ -97,7 +97,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        diff --git a/doc/html/boost/proto/default_generator/result_T_idm45506975321328.html b/doc/html/boost/proto/default_generator/result_T_idm45506975321328.html new file mode 100644 index 0000000000..bcdc8db055 --- /dev/null +++ b/doc/html/boost/proto/default_generator/result_T_idm45506975321328.html @@ -0,0 +1,55 @@ + + + + +Struct template result<This(Expr)> + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Struct template result<This(Expr)>

        +

        boost::proto::default_generator::result<This(Expr)>

        +
        +

        Synopsis

        +
        // In header: <boost/proto/generate.hpp>
+
+
+template<typename This, typename Expr> 
+struct result<This(Expr)> {
+  // types
+  typedef Expr type;
+};
        +
        + + + +
        Copyright © 2008 Eric Niebler

        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/proto/default_generator/result_This_E_idp204702048.html b/doc/html/boost/proto/default_generator/result_This_E_idp204702048.html deleted file mode 100644 index 7e0b5ae72c..0000000000 --- a/doc/html/boost/proto/default_generator/result_This_E_idp204702048.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template result<This(Expr)> - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Struct template result<This(Expr)>

        -

        boost::proto::default_generator::result<This(Expr)>

        -
        -

        Synopsis

        -
        // In header: <boost/proto/generate.hpp>
-
-
-template<typename This, typename Expr> 
-struct result<This(Expr)> {
-  // types
-  typedef Expr type;
-};
        -
        - - - -
        Copyright © 2008 Eric Niebler

        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/proto/dereference.html b/doc/html/boost/proto/dereference.html index 04d50ad614..dba33de7c9 100644 --- a/doc/html/boost/proto/dereference.html +++ b/doc/html/boost/proto/dereference.html @@ -50,7 +50,7 @@ }; };
        -

        Description

        +

        Description

      diff --git a/doc/html/boost/proto/dereference/impl.html b/doc/html/boost/proto/dereference/impl.html index cfcb6e11fd..36edd04caf 100644 --- a/doc/html/boost/proto/dereference/impl.html +++ b/doc/html/boost/proto/dereference/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      @@ -49,7 +49,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/proto/display__idm45506996767344.html b/doc/html/boost/proto/display__idm45506996767344.html new file mode 100644 index 0000000000..0441697df3 --- /dev/null +++ b/doc/html/boost/proto/display__idm45506996767344.html @@ -0,0 +1,91 @@ + + + + +Function display_expr + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Function display_expr

      +

      boost::proto::display_expr — Pretty-print a Proto expression tree.

      +
      +

      Synopsis

      +
      // In header: <boost/proto/debug.hpp>
+
+
+template<typename Expr> 
+  void display_expr(Expr const & expr, std::ostream & sout);
+template<typename Expr> void display_expr(Expr const & expr);
      +
      +

      Description

      +
      ++++ + + + + + + + + + + +

      Parameters:

      ++++ + + + + + + + + + + +

      expr

      The Proto expression tree to pretty-print

      sout

      + The ostream to which the output should be written. If not specified, defaults to std::cout. +

      Notes:

      + Equivalent to proto::functional::display_expr(0, sout)(expr). +

      +
      +
      + + + +
      Copyright © 2008 Eric Niebler

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/proto/display_expr_idp215492336.html b/doc/html/boost/proto/display_expr_idp215492336.html deleted file mode 100644 index 3dcf5356c1..0000000000 --- a/doc/html/boost/proto/display_expr_idp215492336.html +++ /dev/null @@ -1,91 +0,0 @@ - - - - -Function display_expr - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Function display_expr

      -

      boost::proto::display_expr — Pretty-print a Proto expression tree.

      -
      -

      Synopsis

      -
      // In header: <boost/proto/debug.hpp>
-
-
-template<typename Expr> 
-  void display_expr(Expr const & expr, std::ostream & sout);
-template<typename Expr> void display_expr(Expr const & expr);
      -
      -

      Description

      -
      ---- - - - - - - - - - - -

      Parameters:

      ---- - - - - - - - - - - -

      expr

      The Proto expression tree to pretty-print

      sout

      - The ostream to which the output should be written. If not specified, defaults to std::cout. -

      Notes:

      - Equivalent to proto::functional::display_expr(0, sout)(expr). -

      -
      -
      - - - -
      Copyright © 2008 Eric Niebler

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/proto/divides.html b/doc/html/boost/proto/divides.html index 94acb02d60..01d67d4274 100644 --- a/doc/html/boost/proto/divides.html +++ b/doc/html/boost/proto/divides.html @@ -50,7 +50,7 @@ }; };
      -

      Description

      +

      Description

      diff --git a/doc/html/boost/proto/divides/impl.html b/doc/html/boost/proto/divides/impl.html index 45b36ad4b9..25e55d1364 100644 --- a/doc/html/boost/proto/divides/impl.html +++ b/doc/html/boost/proto/divides/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      @@ -47,7 +47,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/proto/divides_assign.html b/doc/html/boost/proto/divides_assign.html index 871429923a..d5aa00aa0d 100644 --- a/doc/html/boost/proto/divides_assign.html +++ b/doc/html/boost/proto/divides_assign.html @@ -50,7 +50,7 @@ }; };
      -

      Description

      +

      Description

      diff --git a/doc/html/boost/proto/divides_assign/impl.html b/doc/html/boost/proto/divides_assign/impl.html index 4f77964133..eb01831eb6 100644 --- a/doc/html/boost/proto/divides_assign/impl.html +++ b/doc/html/boost/proto/divides_assign/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      @@ -49,7 +49,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/proto/domain.html b/doc/html/boost/proto/domain.html index f3f042ac1d..b93cd6a183 100644 --- a/doc/html/boost/proto/domain.html +++ b/doc/html/boost/proto/domain.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      @@ -59,8 +59,8 @@ // types typedef see-below result_type; - // public member functions - result_type operator()(T &) const; + // public member functions + result_type operator()(T &) const; }; // A callable unary MonomorphicFunctionObject that specifies how objects are @@ -72,12 +72,12 @@ // types typedef see-below result_type; - // public member functions - result_type operator()(T &) const; + // public member functions + result_type operator()(T &) const; }; };
      -

      Description

      +

      Description

      The Generator parameter determines how new expressions in the domain are post-processed. Typically, a generator wraps all new expressions in a wrapper that imparts domain-specific behaviors to expressions within @@ -140,7 +140,7 @@

      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/proto/domain/as_child.html b/doc/html/boost/proto/domain/as_child.html index eab511ced5..444bad91c6 100644 --- a/doc/html/boost/proto/domain/as_child.html +++ b/doc/html/boost/proto/domain/as_child.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      @@ -47,11 +47,11 @@ // types typedef see-below result_type; - // public member functions - result_type operator()(T &) const; + // public member functions + result_type operator()(T &) const; };
      -

      Description

      +

      Description

      A unary MonomorphicFunctionObject that specifies how objects are turned into Proto expressions in this domain. The resulting expression object is suitable for storage @@ -88,10 +88,10 @@

      -

      -as_child public member functions

      +

      +as_child public member functions

      1. -
        result_type operator()(T & t) const;
        +
        result_type operator()(T & t) const;
        @@ -125,7 +125,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        diff --git a/doc/html/boost/proto/domain/as_expr.html b/doc/html/boost/proto/domain/as_expr.html index 6c129fe6c4..391e12a430 100644 --- a/doc/html/boost/proto/domain/as_expr.html +++ b/doc/html/boost/proto/domain/as_expr.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        @@ -46,11 +46,11 @@ // types typedef see-below result_type; - // public member functions - result_type operator()(T &) const; + // public member functions + result_type operator()(T &) const; };
        -

        Description

        +

        Description

        A unary MonomorphicFunctionObject that specifies how objects are turned into Proto expressions in this domain. The resulting expression object is suitable for storage @@ -100,10 +100,10 @@

        -

        -as_expr public member functions

        +

        +as_expr public member functions

        1. -
          result_type operator()(T & t) const;
          +
          result_type operator()(T & t) const;
          @@ -137,7 +137,7 @@
          -PrevUpHomeNext +PrevUpHomeNext
          diff --git a/doc/html/boost/proto/domain_of.html b/doc/html/boost/proto/domain_of.html index 15421bfdef..f848ca175c 100644 --- a/doc/html/boost/proto/domain_of.html +++ b/doc/html/boost/proto/domain_of.html @@ -38,7 +38,7 @@ typedef domain-of-T type; };
          -

          Description

          +

          Description

          A metafunction that returns the domain of a given type. If T is a Proto expression type, it returns that expression's associated domain. If not, it returns diff --git a/doc/html/boost/proto/empty_env.html b/doc/html/boost/proto/empty_env.html index fe7572151b..f9ef4ffce2 100644 --- a/doc/html/boost/proto/empty_env.html +++ b/doc/html/boost/proto/empty_env.html @@ -38,16 +38,16 @@ struct empty_env { - // public member functions - proto::key_not_found operator[](unspecified) const; + // public member functions + proto::key_not_found operator[](unspecified) const; };

          -

          Description

          +

          Description

          -

          -empty_env public member functions

          +

          +empty_env public member functions

          1. -
            proto::key_not_found operator[](unspecified) const;
            +
            proto::key_not_found operator[](unspecified) const;

            The type of the argument to this function has a user-defined implicit conversion from any type.

          diff --git a/doc/html/boost/proto/env.html b/doc/html/boost/proto/env.html index a8649375c5..f400cabd9a 100644 --- a/doc/html/boost/proto/env.html +++ b/doc/html/boost/proto/env.html @@ -35,20 +35,20 @@ template<typename Key, typename Value, typename Env = proto::empty_env> struct env { // construct/copy/destruct - explicit env(Value const &, Env const & = Env()); + explicit env(Value const &, Env const & = Env()); - // public member functions - see-below operator[](see-below) const; + // public member functions + see-below operator[](see-below) const; };
          -

          Description

          +

          Description

          -

          +

          env public construct/copy/destruct

          1. -
            explicit env(Value const & value, Env const & other = Env());
            +
            explicit env(Value const & value, Env const & other = Env());
            @@ -81,10 +81,10 @@
            -

            -env public member functions

            +

            +env public member functions

            1. -
              see-below operator[](see-below) const;
              +
              see-below operator[](see-below) const;

              If called with an object that is implicitly convertible to type Key, this function returns the Value passed to the constructor. Otherwise, it returns diff --git a/doc/html/boost/proto/env_var_idm45506984357536.html b/doc/html/boost/proto/env_var_idm45506984357536.html new file mode 100644 index 0000000000..2ca3d24b7b --- /dev/null +++ b/doc/html/boost/proto/env_var_idm45506984357536.html @@ -0,0 +1,77 @@ + + + + +Function env_var + + + + + + + + +

            + + + + + + +
            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
            +
            +
            +PrevUpHomeNext +
            +
            +
            +
            +

            Function env_var

            +

            boost::proto::env_var — + For fetching the value from a transform environment corresponding to the + specified Key. +

            +
            +

            Synopsis

            +
            // In header: <boost/proto/transform/env.hpp>
+
+
+template<typename Key, typename Env> 
+  typename proto::result_of::env_var<Env &, Key>::type env_var(Env & e);
+template<typename Key, typename Env> 
+  typename proto::result_of::env_var<Env const &, Key>::type 
+  env_var(Env const & e);
            +
            +

            Description

            +

            + See also: +

            +
            +

            +

            +
            ++++ + + + + +

            Returns:

            		proto::functional::env_var<Key>()(e)
            +
            +
            + + + +
            Copyright © 2008 Eric Niebler

            + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

            +
            +
            +
            +PrevUpHomeNext +
            + + diff --git a/doc/html/boost/proto/env_var_idp212966112.html b/doc/html/boost/proto/env_var_idp212966112.html deleted file mode 100644 index b9302f11b8..0000000000 --- a/doc/html/boost/proto/env_var_idp212966112.html +++ /dev/null @@ -1,77 +0,0 @@ - - - - -Function env_var - - - - - - - - - - - - - - - -
            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
            -
            -
            -PrevUpHomeNext -
            -
            -
            -
            -

            Function env_var

            -

            boost::proto::env_var — - For fetching the value from a transform environment corresponding to the - specified Key. -

            -
            -

            Synopsis

            -
            // In header: <boost/proto/transform/env.hpp>
-
-
-template<typename Key, typename Env> 
-  typename proto::result_of::env_var<Env &, Key>::type env_var(Env & e);
-template<typename Key, typename Env> 
-  typename proto::result_of::env_var<Env const &, Key>::type 
-  env_var(Env const & e);
            -
            -

            Description

            -

            - See also: -

            -
            -

            -

            -
            ---- - - - - -

            Returns:

            		proto::functional::env_var<Key>()(e)
            -
            -
            - - - -
            Copyright © 2008 Eric Niebler

            - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

            -
            -
            -
            -PrevUpHomeNext -
            - - diff --git a/doc/html/boost/proto/equal_to.html b/doc/html/boost/proto/equal_to.html index 3ba407ca85..4f40f85a5c 100644 --- a/doc/html/boost/proto/equal_to.html +++ b/doc/html/boost/proto/equal_to.html @@ -50,7 +50,7 @@ }; };
            -

            Description

            +

            Description

          diff --git a/doc/html/boost/proto/equal_to/impl.html b/doc/html/boost/proto/equal_to/impl.html index a4465ea150..a2eacd825d 100644 --- a/doc/html/boost/proto/equal_to/impl.html +++ b/doc/html/boost/proto/equal_to/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
          -PrevUpHomeNext +PrevUpHomeNext
          @@ -49,7 +49,7 @@
          -PrevUpHomeNext +PrevUpHomeNext
          diff --git a/doc/html/boost/proto/eval_idm45506996501744.html b/doc/html/boost/proto/eval_idm45506996501744.html new file mode 100644 index 0000000000..94bbe9b846 --- /dev/null +++ b/doc/html/boost/proto/eval_idm45506996501744.html @@ -0,0 +1,92 @@ + + + + +Function eval + + + + + + + + + + + + + + + +
          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
          +
          +
          +PrevUpHomeNext +
          +
          +
          +
          +

          Function eval

          +

          boost::proto::eval — Evaluate a given Proto expression with a given context.

          +
          +

          Synopsis

          +
          // In header: <boost/proto/eval.hpp>
+
+
+template<typename Expr, typename Context> 
+  typename proto::result_of::eval< Expr, Context >::type 
+  eval(Expr & expr, Context & context);
+template<typename Expr, typename Context> 
+  typename proto::result_of::eval< Expr, Context >::type 
+  eval(Expr & expr, Context const & context);
          +
          +

          Description

          +
          ++++ + + + + + + + + + + +

          Parameters:

          ++++ + + + + + + + + + + +

          context

          The context in which the expression should be evaluated.

          expr

          The Proto expression to evaluate.

          Returns:

          + typename Context::template eval<Expr>()(expr, context) +

          +
          +
          + + + +
          Copyright © 2008 Eric Niebler

          + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

          +
          +
          +
          +PrevUpHomeNext +
          + + diff --git a/doc/html/boost/proto/eval_idp203813264.html b/doc/html/boost/proto/eval_idp203813264.html deleted file mode 100644 index 2e0e103d1c..0000000000 --- a/doc/html/boost/proto/eval_idp203813264.html +++ /dev/null @@ -1,92 +0,0 @@ - - - - -Function eval - - - - - - - - - - - - - - - -
          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
          -
          -
          -PrevUpHomeNext -
          -
          -
          -
          -

          Function eval

          -

          boost::proto::eval — Evaluate a given Proto expression with a given context.

          -
          -

          Synopsis

          -
          // In header: <boost/proto/eval.hpp>
-
-
-template<typename Expr, typename Context> 
-  typename proto::result_of::eval< Expr, Context >::type 
-  eval(Expr & expr, Context & context);
-template<typename Expr, typename Context> 
-  typename proto::result_of::eval< Expr, Context >::type 
-  eval(Expr & expr, Context const & context);
          -
          -

          Description

          -
          ---- - - - - - - - - - - -

          Parameters:

          ---- - - - - - - - - - - -

          context

          The context in which the expression should be evaluated.

          expr

          The Proto expression to evaluate.

          Returns:

          - typename Context::template eval<Expr>()(expr, context) -

          -
          -
          - - - -
          Copyright © 2008 Eric Niebler

          - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

          -
          -
          -
          -PrevUpHomeNext -
          - - diff --git a/doc/html/boost/proto/exact.html b/doc/html/boost/proto/exact.html index 65641f7189..74c0b7d457 100644 --- a/doc/html/boost/proto/exact.html +++ b/doc/html/boost/proto/exact.html @@ -36,7 +36,7 @@ struct exact { };
          -

          Description

          +

          Description

          By default, matching terminals ignores references and cv-qualifiers. For instance, a terminal expression of type proto::terminal<int const &>::type diff --git a/doc/html/boost/proto/expr.html b/doc/html/boost/proto/expr.html index cac9601207..aba921ec54 100644 --- a/doc/html/boost/proto/expr.html +++ b/doc/html/boost/proto/expr.html @@ -51,29 +51,29 @@ typedef unspecified type; }; - // public static functions - template<typename... A> static expr const make(A const &...); + // public static functions + template<typename... A> static expr const make(A const &...); - // public member functions - expr & proto_base(); - expr const & proto_base() const; - template<typename A> unspecified operator=(A &); - template<typename A> unspecified operator=(A const &); - template<typename A> unspecified operator=(A &) const; - template<typename A> unspecified operator=(A const &) const; - template<typename A> unspecified operator[](A &); - template<typename A> unspecified operator[](A const &); - template<typename A> unspecified operator[](A &) const; - template<typename A> unspecified operator[](A const &) const; - template<typename... A> unspecified operator()(A const &...); - template<typename... A> unspecified operator()(A const &...) const; + // public member functions + expr & proto_base(); + expr const & proto_base() const; + template<typename A> unspecified operator=(A &); + template<typename A> unspecified operator=(A const &); + template<typename A> unspecified operator=(A &) const; + template<typename A> unspecified operator=(A const &) const; + template<typename A> unspecified operator[](A &); + template<typename A> unspecified operator[](A const &); + template<typename A> unspecified operator[](A &) const; + template<typename A> unspecified operator[](A const &) const; + template<typename... A> unspecified operator()(A const &...); + template<typename... A> unspecified operator()(A const &...) const; // public data members proto_childN childN; // For each N in [0,max(Arity,1)). static const long proto_arity_c; // = Arity; };

          -

          Description

          +

          Description

          proto::expr<> is a node in an expression template tree. It is a container for its child sub-trees. It also serves as the @@ -108,10 +108,10 @@ expressions.

          -

          -expr public static functions

          +

          +expr public static functions

          1. -
            template<typename... A> static expr const make(A const &... a);
            +
            template<typename... A> static expr const make(A const &... a);
            @@ -135,11 +135,11 @@
            -

            -expr public member functions

            +

            +expr public member functions

            1. -
              expr & proto_base();
              +
              expr & proto_base();
            @@ -152,12 +152,12 @@
          2. -
            expr const & proto_base() const;
            +
            expr const & proto_base() const;

            This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

          3. -
            template<typename A> unspecified operator=(A & a);
            +
            template<typename A> unspecified operator=(A & a);

            Lazy assignment expression

            @@ -171,28 +171,28 @@
          4. -
            template<typename A> unspecified operator=(A const & a);
            +
            template<typename A> unspecified operator=(A const & a);

            This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

          5. -
            template<typename A> unspecified operator=(A & a) const;
            +
            template<typename A> unspecified operator=(A & a) const;

            This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

          6. -
            template<typename A> unspecified operator=(A const & a) const;
            +
            template<typename A> unspecified operator=(A const & a) const;

            This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

          7. -
            template<typename A> unspecified operator[](A & a);
            +
            template<typename A> unspecified operator[](A & a);

            Lazy subscript expression

            @@ -206,28 +206,28 @@
          8. -
            template<typename A> unspecified operator[](A const & a);
            +
            template<typename A> unspecified operator[](A const & a);

            This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

          9. -
            template<typename A> unspecified operator[](A & a) const;
            +
            template<typename A> unspecified operator[](A & a) const;

            This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

          10. -
            template<typename A> unspecified operator[](A const & a) const;
            +
            template<typename A> unspecified operator[](A const & a) const;

            This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

          11. -
            template<typename... A> unspecified operator()(A const &... a);
            +
            template<typename... A> unspecified operator()(A const &... a);

            Lazy function call

            @@ -241,7 +241,7 @@
          12. -
            template<typename... A> unspecified operator()(A const &... a) const;
            +
            template<typename... A> unspecified operator()(A const &... a) const;

            This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. diff --git a/doc/html/boost/proto/expr/result.html b/doc/html/boost/proto/expr/result.html index fe3726a268..f8c5983168 100644 --- a/doc/html/boost/proto/expr/result.html +++ b/doc/html/boost/proto/expr/result.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@

            -PrevUpHomeNext +PrevUpHomeNext
            @@ -39,7 +39,7 @@ typedef unspecified type; };
            -

            Description

            +

            Description

            Encodes the return type of proto::expr<>::operator(). Makes proto::expr<> a TR1-style function object type @@ -57,7 +57,7 @@

            -PrevUpHomeNext +PrevUpHomeNext
            diff --git a/doc/html/boost/proto/extends.html b/doc/html/boost/proto/extends.html index 48a9e209b7..7131898421 100644 --- a/doc/html/boost/proto/extends.html +++ b/doc/html/boost/proto/extends.html @@ -54,33 +54,33 @@ }; // construct/copy/destruct - extends(); - extends(extends const &); - extends(Expr const &); + extends(); + extends(extends const &); + extends(Expr const &); - // public static functions - static Derived const make(Expr const &); + // public static functions + static Derived const make(Expr const &); - // public member functions - proto_base_expr & proto_base(); - proto_base_expr const & proto_base() const; - template<typename A> unspecified operator=(A &); - template<typename A> unspecified operator=(A const &); - template<typename A> unspecified operator=(A &) const; - template<typename A> unspecified operator=(A const &) const; - template<typename A> unspecified operator[](A &); - template<typename A> unspecified operator[](A const &); - template<typename A> unspecified operator[](A &) const; - template<typename A> unspecified operator[](A const &) const; - template<typename... A> unspecified operator()(A const &...); - template<typename... A> unspecified operator()(A const &...) const; + // public member functions + proto_base_expr & proto_base(); + proto_base_expr const & proto_base() const; + template<typename A> unspecified operator=(A &); + template<typename A> unspecified operator=(A const &); + template<typename A> unspecified operator=(A &) const; + template<typename A> unspecified operator=(A const &) const; + template<typename A> unspecified operator[](A &); + template<typename A> unspecified operator[](A const &); + template<typename A> unspecified operator[](A &) const; + template<typename A> unspecified operator[](A const &) const; + template<typename... A> unspecified operator()(A const &...); + template<typename... A> unspecified operator()(A const &...) const; // public data members Expr proto_expr_; // For exposition only. static const long proto_arity_c; // = proto_base_expr::proto_arity_c; };
            -

            Description

            +

            Description

            Use proto::extends<> to give expressions in your domain custom data members and member functions. @@ -137,30 +137,30 @@

            -

            +

            extends public construct/copy/destruct

              -
            1. extends();
              2. -
            2. extends(extends const & that);
              3. -
            3. extends(Expr const & expr_);
              4. +
            4. extends();
              5. +
            5. extends(extends const & that);
              6. +
            6. extends(Expr const & expr_);
            -

            -extends public static functions

            +

            +extends public static functions

            1. -
              static Derived const make(Expr const & expr);
              +
              static Derived const make(Expr const & expr);

              Construct an expression extension from the base expression.

            -

            -extends public member functions

            +

            +extends public member functions

            1. -
              proto_base_expr & proto_base();
              +
              proto_base_expr & proto_base();
              @@ -179,7 +179,7 @@
            2. -
              proto_base_expr const & proto_base() const;
              +
              proto_base_expr const & proto_base() const;
              @@ -198,7 +198,7 @@
            3. -
              template<typename A> unspecified operator=(A & a);
              +
              template<typename A> unspecified operator=(A & a);

              Lazy assignment expression

              @@ -212,28 +212,28 @@
            4. -
              template<typename A> unspecified operator=(A const & a);
              +
              template<typename A> unspecified operator=(A const & a);

              This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

            5. -
              template<typename A> unspecified operator=(A & a) const;
              +
              template<typename A> unspecified operator=(A & a) const;

              This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

            6. -
              template<typename A> unspecified operator=(A const & a) const;
              +
              template<typename A> unspecified operator=(A const & a) const;

              This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

            7. -
              template<typename A> unspecified operator[](A & a);
              +
              template<typename A> unspecified operator[](A & a);

              Lazy subscript expression

              @@ -247,28 +247,28 @@
            8. -
              template<typename A> unspecified operator[](A const & a);
              +
              template<typename A> unspecified operator[](A const & a);

              This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

            9. -
              template<typename A> unspecified operator[](A & a) const;
              +
              template<typename A> unspecified operator[](A & a) const;

              This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

            10. -
              template<typename A> unspecified operator[](A const & a) const;
              +
              template<typename A> unspecified operator[](A const & a) const;

              This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

            11. -
              template<typename... A> unspecified operator()(A const &... a);
              +
              template<typename... A> unspecified operator()(A const &... a);

              Lazy function call

              @@ -282,7 +282,7 @@
            12. -
              template<typename... A> unspecified operator()(A const &... a) const;
              +
              template<typename... A> unspecified operator()(A const &... a) const;

              This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. diff --git a/doc/html/boost/proto/extends/result.html b/doc/html/boost/proto/extends/result.html index 4e8d463ecc..845d3c9c63 100644 --- a/doc/html/boost/proto/extends/result.html +++ b/doc/html/boost/proto/extends/result.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@

              -PrevUpHomeNext +PrevUpHomeNext
              @@ -39,7 +39,7 @@ typedef unspecified type; };
              -

              Description

              +

              Description

              So that boost::result_of<> can compute the return type of proto::extends::operator().

              @@ -55,7 +55,7 @@
              -PrevUpHomeNext +PrevUpHomeNext
              diff --git a/doc/html/boost/proto/external_transform.html b/doc/html/boost/proto/external_transform.html index b6c9bc0968..71e658e5ed 100644 --- a/doc/html/boost/proto/external_transform.html +++ b/doc/html/boost/proto/external_transform.html @@ -37,7 +37,7 @@ struct external_transform { };
              -

              Description

              +

              Description

              See proto::external_transforms for an example.

              diff --git a/doc/html/boost/proto/external_transforms.html b/doc/html/boost/proto/external_transforms.html index c9e6e3191f..ed96d29799 100644 --- a/doc/html/boost/proto/external_transforms.html +++ b/doc/html/boost/proto/external_transforms.html @@ -45,7 +45,7 @@ }; };
              -

              Description

              +

              Description

              It is sometimes desirable to define a grammar that can be customized with different sets of transforms. To do that, where you would normally specify a transform within a grammar, you can instead put diff --git a/doc/html/boost/proto/external_transforms/when.html b/doc/html/boost/proto/external_transforms/when.html index 00de3a1089..0280eb0320 100644 --- a/doc/html/boost/proto/external_transforms/when.html +++ b/doc/html/boost/proto/external_transforms/when.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@

              -PrevUpHomeNext +PrevUpHomeNext
              @@ -49,7 +49,7 @@
              -PrevUpHomeNext +PrevUpHomeNext
              diff --git a/doc/html/boost/proto/flatten_idm45506975343680.html b/doc/html/boost/proto/flatten_idm45506975343680.html new file mode 100644 index 0000000000..1e1ad7d296 --- /dev/null +++ b/doc/html/boost/proto/flatten_idm45506975343680.html @@ -0,0 +1,69 @@ + + + + +Function flatten + + + + + + + + + + + + + + + +
              Boost C++ LibrariesHomeLibrariesPeopleFAQMore
              +
              +
              +PrevUpHomeNext +
              +
              +
              +
              +

              Function flatten

              +

              boost::proto::flatten — A function that returns a "flattened" view of a Proto expression tree.

              +
              +

              Synopsis

              +
              // In header: <boost/proto/fusion.hpp>
+
+
+template<typename Expr> 
+  typename proto::result_of::flatten< Expr >::type const flatten(Expr & expr);
+template<typename Expr> 
+  typename proto::result_of::flatten< Expr const >::type const 
+  flatten(Expr const & expr);
              +
              +

              Description

              +

              + For a tree with a top-most node tag of type T, the elements + of the flattened sequence are determined by recursing into each child node with the same tag + type and returning those nodes of different type. So for instance, the Proto expression tree + corresponding to the expression a | b | c has a flattened + view with elements [a, b, c], even though the tree is grouped as + ((a | b) | c). +

              +

              + The returned view is a Fusion Forward Sequence. +

              +
              +
              + + + +
              Copyright © 2008 Eric Niebler

              + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

              +
              +
              +
              +PrevUpHomeNext +
              + + diff --git a/doc/html/boost/proto/flatten_idp204679696.html b/doc/html/boost/proto/flatten_idp204679696.html deleted file mode 100644 index 39bd23d1f4..0000000000 --- a/doc/html/boost/proto/flatten_idp204679696.html +++ /dev/null @@ -1,69 +0,0 @@ - - - - -Function flatten - - - - - - - - - - - - - - - -
              Boost C++ LibrariesHomeLibrariesPeopleFAQMore
              -
              -
              -PrevUpHomeNext -
              -
              -
              -
              -

              Function flatten

              -

              boost::proto::flatten — A function that returns a "flattened" view of a Proto expression tree.

              -
              -

              Synopsis

              -
              // In header: <boost/proto/fusion.hpp>
-
-
-template<typename Expr> 
-  typename proto::result_of::flatten< Expr >::type const flatten(Expr & expr);
-template<typename Expr> 
-  typename proto::result_of::flatten< Expr const >::type const 
-  flatten(Expr const & expr);
              -
              -

              Description

              -

              - For a tree with a top-most node tag of type T, the elements - of the flattened sequence are determined by recursing into each child node with the same tag - type and returning those nodes of different type. So for instance, the Proto expression tree - corresponding to the expression a | b | c has a flattened - view with elements [a, b, c], even though the tree is grouped as - ((a | b) | c). -

              -

              - The returned view is a Fusion Forward Sequence. -

              -
              -
              - - - -
              Copyright © 2008 Eric Niebler

              - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

              -
              -
              -
              -PrevUpHomeNext -
              - - diff --git a/doc/html/boost/proto/fold.html b/doc/html/boost/proto/fold.html index f7c2ac5dba..b51aa7a8f4 100644 --- a/doc/html/boost/proto/fold.html +++ b/doc/html/boost/proto/fold.html @@ -46,14 +46,14 @@ typedef unspecified fun; // fun(d)(s,e) == when<_,Fun>()(e,s,d) typedef typename fusion::result_of::fold<seq, state0, fun>::type result_type; - // public member functions - result_type operator()(typename impl::expr_param, + // public member functions + result_type operator()(typename impl::expr_param, typename impl::state_param, typename impl::data_param) const; }; };
              -

              Description

              +

              Description

              For the complete description of the behavior of the proto::fold<> transform, see the documentation for the nested diff --git a/doc/html/boost/proto/fold/impl.html b/doc/html/boost/proto/fold/impl.html index 72def295a7..3d5b0c56b4 100644 --- a/doc/html/boost/proto/fold/impl.html +++ b/doc/html/boost/proto/fold/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@

              -PrevUpHomeNext +PrevUpHomeNext
              @@ -43,18 +43,18 @@ typedef unspecified fun; // fun(d)(s,e) == when<_,Fun>()(e,s,d) typedef typename fusion::result_of::fold<seq, state0, fun>::type result_type; - // public member functions - result_type operator()(typename impl::expr_param, + // public member functions + result_type operator()(typename impl::expr_param, typename impl::state_param, typename impl::data_param) const; };
              -

              Description

              +

              Description

              -

              -impl public member functions

              +

              +impl public member functions

              1. -
                result_type operator()(typename impl::expr_param expr, 
+
                result_type operator()(typename impl::expr_param expr, 
                        typename impl::state_param state, 
                        typename impl::data_param data) const;
                
 
                
@@ -110,7 +110,7 @@
 
 
                
 
                
-PrevUpHomeNext
+PrevUpHomeNext
 
                
 
 
diff --git a/doc/html/boost/proto/fold_tree.html b/doc/html/boost/proto/fold_tree.html
index 8cf65dfd48..9871285725 100644
--- a/doc/html/boost/proto/fold_tree.html
+++ b/doc/html/boost/proto/fold_tree.html
@@ -45,7 +45,7 @@
   };
 };
              -

              Description

              +

              Description

              proto::fold_tree<> is useful for flattening trees into lists; for example, you might use proto::fold_tree<> to flatten an diff --git a/doc/html/boost/proto/fold_tree/impl.html b/doc/html/boost/proto/fold_tree/impl.html index 7ba06dcc00..9c69271b47 100644 --- a/doc/html/boost/proto/fold_tree/impl.html +++ b/doc/html/boost/proto/fold_tree/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@

              -PrevUpHomeNext +PrevUpHomeNext
              @@ -50,7 +50,7 @@
              -PrevUpHomeNext +PrevUpHomeNext
              diff --git a/doc/html/boost/proto/function.html b/doc/html/boost/proto/function.html index a96b1f9de7..85e64062a7 100644 --- a/doc/html/boost/proto/function.html +++ b/doc/html/boost/proto/function.html @@ -51,7 +51,7 @@ }; };
              -

              Description

              +

              Description

              diff --git a/doc/html/boost/proto/function/impl.html b/doc/html/boost/proto/function/impl.html index 8473cfa2f3..6e2c52724a 100644 --- a/doc/html/boost/proto/function/impl.html +++ b/doc/html/boost/proto/function/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
              -PrevUpHomeNext +PrevUpHomeNext
              @@ -49,7 +49,7 @@
              -PrevUpHomeNext +PrevUpHomeNext
              diff --git a/doc/html/boost/proto/functional/advance.html b/doc/html/boost/proto/functional/advance.html index f44cf93b59..9166a4e5fb 100644 --- a/doc/html/boost/proto/functional/advance.html +++ b/doc/html/boost/proto/functional/advance.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
              -PrevUpHomeNext +PrevUpHomeNext
              @@ -38,21 +38,21 @@ // types typedef void result_type; - // public member functions + // public member functions template<typename InputIterator> template<typename Distance> - void operator()(InputIterator &, Distance) const; + void operator()(InputIterator &, Distance) const; };
              -

              Description

              +

              Description

              A PolymorphicFunctionObject type that invokes the std::advance() function on its arguments.

              -

              -advance public member functions

              +

              +advance public member functions

              1. template<typename InputIterator> template<typename Distance> 
-  void operator()(InputIterator & x, Distance n) const;
                + void operator()(InputIterator & x, Distance n) const;

                Calls std::advance(x, n)

              @@ -68,7 +68,7 @@
              -PrevUpHomeNext +PrevUpHomeNext
              diff --git a/doc/html/boost/proto/functional/as_child.html b/doc/html/boost/proto/functional/as_child.html index 48a34ef941..51c8c4fa28 100644 --- a/doc/html/boost/proto/functional/as_child.html +++ b/doc/html/boost/proto/functional/as_child.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
              -PrevUpHomeNext +PrevUpHomeNext
              @@ -29,7 +29,7 @@

              Struct template as_child

              boost::proto::functional::as_child — A callable PolymorphicFunctionObject that is equivalent to the - proto::as_child() function. + proto::as_child() function.

              Synopsis

              @@ -39,28 +39,28 @@ struct as_child : proto::callable { // member classes/structs/unions template<typename This, typename T> - struct result<This(T)> : proto::result_of::as_child< typename remove_reference< T >::type, Domain > + struct result<This(T)> : proto::result_of::as_child< typename remove_reference< T >::type, Domain > { }; - // public member functions + // public member functions template<typename T> typename proto::result_of::as_child< T, Domain >::type - operator()(T &) const; + operator()(T &) const; template<typename T> typename proto::result_of::as_child< T const, Domain >::type - operator()(T const &) const; + operator()(T const &) const; };
              -

              Description

              +

              Description

              -

              -as_child public member functions

              +

              +as_child public member functions

              1. template<typename T> 
   typename proto::result_of::as_child< T, Domain >::type 
-  operator()(T & t) const;
                + operator()(T & t) const;

                Wrap an object in a Proto terminal if it isn't a Proto expression already.

                @@ -86,7 +86,7 @@

                Returns:

                - proto::as_child<Domain>(t) + proto::as_child<Domain>(t)

                @@ -95,7 +95,7 @@ 
              2. template<typename T> 
   typename proto::result_of::as_child< T const, Domain >::type 
-  operator()(T const & t) const;
                + operator()(T const & t) const;

                This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

              @@ -112,7 +112,7 @@
              -PrevUpHomeNext +PrevUpHomeNext
              diff --git a/doc/html/boost/proto/functional/as_child/result_T_idm45506973673760.html b/doc/html/boost/proto/functional/as_child/result_T_idm45506973673760.html new file mode 100644 index 0000000000..4dd8306164 --- /dev/null +++ b/doc/html/boost/proto/functional/as_child/result_T_idm45506973673760.html @@ -0,0 +1,55 @@ + + + + +Struct template result<This(T)> + + + + + + + + + + + + + + + +
              Boost C++ LibrariesHomeLibrariesPeopleFAQMore
              +
              +
              +PrevUpHomeNext +
              +
              +
              +
              +

              Struct template result<This(T)>

              +

              boost::proto::functional::as_child::result<This(T)>

              +
              +

              Synopsis

              +
              // In header: <boost/proto/traits.hpp>
+
+
+template<typename This, typename T> 
+struct result<This(T)> :
+   proto::result_of::as_child< typename remove_reference< T >::type, Domain >
+{
+};
              +
              + + + +
              Copyright © 2008 Eric Niebler

              + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

              +
              +
              +
              +PrevUpHomeNext +
              + + diff --git a/doc/html/boost/proto/functional/as_child/result_This_T_idp208626464.html b/doc/html/boost/proto/functional/as_child/result_This_T_idp208626464.html deleted file mode 100644 index 06a192e798..0000000000 --- a/doc/html/boost/proto/functional/as_child/result_This_T_idp208626464.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template result<This(T)> - - - - - - - - - - - - - - - -
              Boost C++ LibrariesHomeLibrariesPeopleFAQMore
              -
              -
              -PrevUpHomeNext -
              -
              -
              -
              -

              Struct template result<This(T)>

              -

              boost::proto::functional::as_child::result<This(T)>

              -
              -

              Synopsis

              -
              // In header: <boost/proto/traits.hpp>
-
-
-template<typename This, typename T> 
-struct result<This(T)> :
-   proto::result_of::as_child< typename remove_reference< T >::type, Domain >
-{
-};
              -
              - - - -
              Copyright © 2008 Eric Niebler

              - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

              -
              -
              -
              -PrevUpHomeNext -
              - - diff --git a/doc/html/boost/proto/functional/as_env.html b/doc/html/boost/proto/functional/as_env.html index b20e4dceaa..0bfa0112b3 100644 --- a/doc/html/boost/proto/functional/as_env.html +++ b/doc/html/boost/proto/functional/as_env.html @@ -45,22 +45,22 @@ typedef see-below type; }; - // public member functions - template<typename T> see-below operator()(T &) const; - template<typename T> see-below operator()(T const &) const; + // public member functions + template<typename T> see-below operator()(T &) const; + template<typename T> see-below operator()(T const &) const; };
              -

              Description

              +

              Description

              -

              -as_env public member functions

              +

              +as_env public member functions

              1. -
                template<typename T> see-below operator()(T & t) const;
-template<typename T> see-below operator()(T const & t) const;
                +
                template<typename T> see-below operator()(T & t) const;
+template<typename T> see-below operator()(T const & t) const;

                If proto::is_env<T>::value is false, this function returns the result of (proto::data = t). - See proto::data_type::operator= for details. + See proto::data_type::operator= for details.

                Otherwise, this function returns t by reference. diff --git a/doc/html/boost/proto/functional/as_env/result.html b/doc/html/boost/proto/functional/as_env/result.html index 1bcc9984ee..bc984c538a 100644 --- a/doc/html/boost/proto/functional/as_env/result.html +++ b/doc/html/boost/proto/functional/as_env/result.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@

                -PrevUpHomeNext +PrevUpHomeNext
                @@ -39,21 +39,21 @@ typedef see-below type; };
                -

                Description

                +

                Description

                - Encodes the return type of proto::functional::as_env::operator(). + Encodes the return type of proto::functional::as_env::operator(). The presence of this member template makes proto::functional::as_env a valid TR1-style function object type usable with boost::result_of<>.

                -

                +

                result public types

                1. typedef see-below type;

                  -

                  See proto::functional::as_env::operator().

                  +

                  See proto::functional::as_env::operator().

                @@ -68,7 +68,7 @@
                -PrevUpHomeNext +PrevUpHomeNext
                diff --git a/doc/html/boost/proto/functional/as_expr.html b/doc/html/boost/proto/functional/as_expr.html index 47b9f61715..93980171cc 100644 --- a/doc/html/boost/proto/functional/as_expr.html +++ b/doc/html/boost/proto/functional/as_expr.html @@ -8,7 +8,7 @@ - + @@ -21,14 +21,14 @@
                -PrevUpHomeNext +PrevUpHomeNext

                Struct template as_expr

                boost::proto::functional::as_expr — A callable PolymorphicFunctionObject that is equivalent to the - proto::as_expr() function. + proto::as_expr() function.

                Synopsis

                @@ -38,28 +38,28 @@ struct as_expr : proto::callable { // member classes/structs/unions template<typename This, typename T> - struct result<This(T)> : proto::result_of::as_expr< typename remove_reference< T >::type, Domain > + struct result<This(T)> : proto::result_of::as_expr< typename remove_reference< T >::type, Domain > { }; - // public member functions + // public member functions template<typename T> typename proto::result_of::as_expr< T, Domain >::type - operator()(T &) const; + operator()(T &) const; template<typename T> typename proto::result_of::as_expr< T const, Domain >::type - operator()(T const &) const; + operator()(T const &) const; };
                -

                Description

                +

                Description

                -

                -as_expr public member functions

                +

                +as_expr public member functions

                1. template<typename T> 
   typename proto::result_of::as_expr< T, Domain >::type 
-  operator()(T & t) const;
                  + operator()(T & t) const;

                  Wrap an object in a Proto terminal if it isn't a Proto expression already.

                  @@ -85,7 +85,7 @@

                  Returns:

                  - proto::as_expr<Domain>(t) + proto::as_expr<Domain>(t)

                  @@ -94,7 +94,7 @@ 
                2. template<typename T> 
   typename proto::result_of::as_expr< T const, Domain >::type 
-  operator()(T const & t) const;
                  + operator()(T const & t) const;

                  This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

                @@ -111,7 +111,7 @@
                -PrevUpHomeNext +PrevUpHomeNext
                diff --git a/doc/html/boost/proto/functional/as_expr/result_T_idm45506973695920.html b/doc/html/boost/proto/functional/as_expr/result_T_idm45506973695920.html new file mode 100644 index 0000000000..fa2fe5e6d1 --- /dev/null +++ b/doc/html/boost/proto/functional/as_expr/result_T_idm45506973695920.html @@ -0,0 +1,55 @@ + + + + +Struct template result<This(T)> + + + + + + + + + + + + + + + +
                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                +
                +
                +PrevUpHomeNext +
                +
                +
                +
                +

                Struct template result<This(T)>

                +

                boost::proto::functional::as_expr::result<This(T)>

                +
                +

                Synopsis

                +
                // In header: <boost/proto/traits.hpp>
+
+
+template<typename This, typename T> 
+struct result<This(T)> :
+   proto::result_of::as_expr< typename remove_reference< T >::type, Domain >
+{
+};
                +
                + + + +
                Copyright © 2008 Eric Niebler

                + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                +
                +
                +
                +PrevUpHomeNext +
                + + diff --git a/doc/html/boost/proto/functional/as_expr/result_This_T_idp208604304.html b/doc/html/boost/proto/functional/as_expr/result_This_T_idp208604304.html deleted file mode 100644 index 66c40b0cb9..0000000000 --- a/doc/html/boost/proto/functional/as_expr/result_This_T_idp208604304.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template result<This(T)> - - - - - - - - - - - - - - - -
                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                -
                -
                -PrevUpHomeNext -
                -
                -
                -
                -

                Struct template result<This(T)>

                -

                boost::proto::functional::as_expr::result<This(T)>

                -
                -

                Synopsis

                -
                // In header: <boost/proto/traits.hpp>
-
-
-template<typename This, typename T> 
-struct result<This(T)> :
-   proto::result_of::as_expr< typename remove_reference< T >::type, Domain >
-{
-};
                -
                - - - -
                Copyright © 2008 Eric Niebler

                - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                -
                -
                -
                -PrevUpHomeNext -
                - - diff --git a/doc/html/boost/proto/functional/at.html b/doc/html/boost/proto/functional/at.html index a3a228da39..63d003daf2 100644 --- a/doc/html/boost/proto/functional/at.html +++ b/doc/html/boost/proto/functional/at.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
                -PrevUpHomeNext +PrevUpHomeNext
                @@ -37,34 +37,34 @@ struct at : proto::callable { // member classes/structs/unions template<typename This, typename Seq, typename N> - struct result<This(Seq, N)> : fusion::result_of::at< + struct result<This(Seq, N)> : fusion::result_of::at< typename boost::remove_reference<Seq>::type , typename boost::remove_const<typename boost::remove_reference<N>::type>::type > { }; - // public member functions + // public member functions template<typename Seq, typename N> typename fusion::result_of::at< Seq, N >::type - operator()(Seq &, N const &) const; + operator()(Seq &, N const &) const; template<typename Seq, typename N> typename fusion::result_of::at< Seq const, N >::type - operator()(Seq const &, N const &) const; + operator()(Seq const &, N const &) const; };
                -

                Description

                +

                Description

                A PolymorphicFunctionObject type that invokes the fusion::at() accessor function on its arguments.

                -

                -at public member functions

                +

                +at public member functions

                1. template<typename Seq, typename N> 
   typename fusion::result_of::at< Seq, N >::type 
-  operator()(Seq & seq, N const & n) const;
                  + operator()(Seq & seq, N const & n) const;
                  @@ -79,7 +79,7 @@ 
                2. template<typename Seq, typename N> 
   typename fusion::result_of::at< Seq const, N >::type 
-  operator()(Seq const & seq, N const & n) const;
                  + operator()(Seq const & seq, N const & n) const;
                  3. @@ -105,7 +105,7 @@
                  -PrevUpHomeNext +PrevUpHomeNext
                  diff --git a/doc/html/boost/proto/functional/at/result_T_idm45506975827424.html b/doc/html/boost/proto/functional/at/result_T_idm45506975827424.html new file mode 100644 index 0000000000..35a2a956b4 --- /dev/null +++ b/doc/html/boost/proto/functional/at/result_T_idm45506975827424.html @@ -0,0 +1,57 @@ + + + + +Struct template result<This(Seq, N)> + + + + + + + + + + + + + + + +
                  Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                  +
                  +
                  +PrevUpHomeNext +
                  +
                  +
                  +
                  +

                  Struct template result<This(Seq, N)>

                  +

                  boost::proto::functional::at::result<This(Seq, N)>

                  +
                  +

                  Synopsis

                  +
                  // In header: <boost/proto/functional/fusion/at.hpp>
+
+
+template<typename This, typename Seq, typename N> 
+struct result<This(Seq, N)> :  fusion::result_of::at<
+      typename boost::remove_reference<Seq>::type
+    , typename boost::remove_const<typename boost::remove_reference<N>::type>::type
+  >
+{
+};
                  +
                  + + + +
                  Copyright © 2008 Eric Niebler

                  + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                  +
                  +
                  +
                  +PrevUpHomeNext +
                  + + diff --git a/doc/html/boost/proto/functional/at/result_This_S_idp204195952.html b/doc/html/boost/proto/functional/at/result_This_S_idp204195952.html deleted file mode 100644 index a4d0f728e8..0000000000 --- a/doc/html/boost/proto/functional/at/result_This_S_idp204195952.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Struct template result<This(Seq, N)> - - - - - - - - - - - - - - - -
                  Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                  -
                  -
                  -PrevUpHomeNext -
                  -
                  -
                  -
                  -

                  Struct template result<This(Seq, N)>

                  -

                  boost::proto::functional::at::result<This(Seq, N)>

                  -
                  -

                  Synopsis

                  -
                  // In header: <boost/proto/functional/fusion/at.hpp>
-
-
-template<typename This, typename Seq, typename N> 
-struct result<This(Seq, N)> :  fusion::result_of::at<
-      typename boost::remove_reference<Seq>::type
-    , typename boost::remove_const<typename boost::remove_reference<N>::type>::type
-  >
-{
-};
                  -
                  - - - -
                  Copyright © 2008 Eric Niebler

                  - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                  -
                  -
                  -
                  -PrevUpHomeNext -
                  - - diff --git a/doc/html/boost/proto/functional/begin.html b/doc/html/boost/proto/functional/begin.html index 3c910bca4d..19eccdaf93 100644 --- a/doc/html/boost/proto/functional/begin.html +++ b/doc/html/boost/proto/functional/begin.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
                  -PrevUpHomeNext +PrevUpHomeNext
                  @@ -37,31 +37,31 @@ struct begin : proto::callable { // member classes/structs/unions template<typename This, typename Range> - struct result<This(Range)> : boost::range_iterator< + struct result<This(Range)> : boost::range_iterator< typename boost::remove_reference<Range>::type > { }; - // public member functions + // public member functions template<typename Range> - typename boost::range_iterator< Range >::type operator()(Range &) const; + typename boost::range_iterator< Range >::type operator()(Range &) const; template<typename Range> typename boost::range_iterator< Range const >::type - operator()(Range const &) const; + operator()(Range const &) const; };
                  -

                  Description

                  +

                  Description

                  A PolymorphicFunctionObject type that invokes the boost::begin() accessor function on its arguments.

                  -

                  -begin public member functions

                  +

                  +begin public member functions

                  1. template<typename Range> 
-  typename boost::range_iterator< Range >::type operator()(Range & rng) const;
                    + typename boost::range_iterator< Range >::type operator()(Range & rng) const;
                    @@ -76,7 +76,7 @@ 
                  2. template<typename Range> 
   typename boost::range_iterator< Range const >::type 
-  operator()(Range const & rng) const;
                    + operator()(Range const & rng) const;
                    3. @@ -102,7 +102,7 @@
                    -PrevUpHomeNext +PrevUpHomeNext
                    diff --git a/doc/html/boost/proto/functional/begin/result_T_idm45506975669312.html b/doc/html/boost/proto/functional/begin/result_T_idm45506975669312.html new file mode 100644 index 0000000000..9595f170ae --- /dev/null +++ b/doc/html/boost/proto/functional/begin/result_T_idm45506975669312.html @@ -0,0 +1,56 @@ + + + + +Struct template result<This(Range)> + + + + + + + + + + + + + + + +
                    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                    +
                    +
                    +PrevUpHomeNext +
                    +
                    +
                    +
                    +

                    Struct template result<This(Range)>

                    +

                    boost::proto::functional::begin::result<This(Range)>

                    +
                    +

                    Synopsis

                    +
                    // In header: <boost/proto/functional/range/begin.hpp>
+
+
+template<typename This, typename Range> 
+struct result<This(Range)> :  boost::range_iterator<
+      typename boost::remove_reference<Range>::type
+  >
+{
+};
                    +
                    + + + +
                    Copyright © 2008 Eric Niebler

                    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                    +
                    +
                    +
                    +PrevUpHomeNext +
                    + + diff --git a/doc/html/boost/proto/functional/begin/result_This_R_idp204354064.html b/doc/html/boost/proto/functional/begin/result_This_R_idp204354064.html deleted file mode 100644 index e38c6c6aa0..0000000000 --- a/doc/html/boost/proto/functional/begin/result_This_R_idp204354064.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Struct template result<This(Range)> - - - - - - - - - - - - - - - -
                    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                    -
                    -
                    -PrevUpHomeNext -
                    -
                    -
                    -
                    -

                    Struct template result<This(Range)>

                    -

                    boost::proto::functional::begin::result<This(Range)>

                    -
                    -

                    Synopsis

                    -
                    // In header: <boost/proto/functional/range/begin.hpp>
-
-
-template<typename This, typename Range> 
-struct result<This(Range)> :  boost::range_iterator<
-      typename boost::remove_reference<Range>::type
-  >
-{
-};
                    -
                    - - - -
                    Copyright © 2008 Eric Niebler

                    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                    -
                    -
                    -
                    -PrevUpHomeNext -
                    - - diff --git a/doc/html/boost/proto/functional/child.html b/doc/html/boost/proto/functional/child.html index ee04aedde3..77ac9ee38b 100644 --- a/doc/html/boost/proto/functional/child.html +++ b/doc/html/boost/proto/functional/child.html @@ -7,8 +7,8 @@ - - + + @@ -21,14 +21,14 @@
                    -PrevUpHomeNext +PrevUpHomeNext

                    Struct template child

                    boost::proto::functional::child — A callable PolymorphicFunctionObject that is equivalent to the - proto::child() function.

                    + proto::child() function.

                    Synopsis

                    // In header: <boost/proto/traits.hpp>
@@ -37,32 +37,32 @@
 struct child :  proto::callable {
   // member classes/structs/unions
   template<typename This, typename Expr> 
-  struct result<This(Expr)> :  proto::result_of::child< Expr, N > {
+  struct result<This(Expr)> :  proto::result_of::child< Expr, N > {
   };
 
-  // public member functions
+  // public member functions
   template<typename Expr> 
     typename proto::result_of::child< Expr &, N >::type 
-    operator()(Expr &) const;
+    operator()(Expr &) const;
   template<typename Expr> 
     typename proto::result_of::child< Expr const &, N >::type 
-    operator()(Expr const &) const;
+    operator()(Expr const &) const;
 };
                    -

                    Description

                    +

                    Description

                    A callable PolymorphicFunctionObject that is equivalent to the - proto::child() + proto::child() function. N is required to be an MPL Integral Constant.

                    -

                    -child public member functions

                    +

                    +child public member functions

                    1. template<typename Expr> 
   typename proto::result_of::child< Expr &, N >::type 
-  operator()(Expr & expr) const;
                      + operator()(Expr & expr) const;

                      Return the Nth child of the given expression.

                      @@ -100,7 +100,7 @@

                      Returns:

                      - proto::child<N>(expr) + proto::child<N>(expr)

                      @@ -113,7 +113,7 @@ 
                    2. template<typename Expr> 
   typename proto::result_of::child< Expr const &, N >::type 
-  operator()(Expr const & expr) const;
                      + operator()(Expr const & expr) const;

                      This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

                    @@ -130,7 +130,7 @@
                    -PrevUpHomeNext +PrevUpHomeNext
                    diff --git a/doc/html/boost/proto/functional/child/result_T_idm45506973622592.html b/doc/html/boost/proto/functional/child/result_T_idm45506973622592.html new file mode 100644 index 0000000000..c4b74efc6c --- /dev/null +++ b/doc/html/boost/proto/functional/child/result_T_idm45506973622592.html @@ -0,0 +1,53 @@ + + + + +Struct template result<This(Expr)> + + + + + + + + + + + + + + + +
                    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                    +
                    +
                    +PrevUpHomeNext +
                    +
                    +
                    +
                    +

                    Struct template result<This(Expr)>

                    +

                    boost::proto::functional::child::result<This(Expr)>

                    +
                    +

                    Synopsis

                    +
                    // In header: <boost/proto/traits.hpp>
+
+
+template<typename This, typename Expr> 
+struct result<This(Expr)> :  proto::result_of::child< Expr, N > {
+};
                    +
                    + + + +
                    Copyright © 2008 Eric Niebler

                    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                    +
                    +
                    +
                    +PrevUpHomeNext +
                    + + diff --git a/doc/html/boost/proto/functional/child/result_This_E_idp208677632.html b/doc/html/boost/proto/functional/child/result_This_E_idp208677632.html deleted file mode 100644 index 3005ae67f1..0000000000 --- a/doc/html/boost/proto/functional/child/result_This_E_idp208677632.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template result<This(Expr)> - - - - - - - - - - - - - - - -
                    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                    -
                    -
                    -PrevUpHomeNext -
                    -
                    -
                    -
                    -

                    Struct template result<This(Expr)>

                    -

                    boost::proto::functional::child::result<This(Expr)>

                    -
                    -

                    Synopsis

                    -
                    // In header: <boost/proto/traits.hpp>
-
-
-template<typename This, typename Expr> 
-struct result<This(Expr)> :  proto::result_of::child< Expr, N > {
-};
                    -
                    - - - -
                    Copyright © 2008 Eric Niebler

                    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                    -
                    -
                    -
                    -PrevUpHomeNext -
                    - - diff --git a/doc/html/boost/proto/functional/child_c.html b/doc/html/boost/proto/functional/child_c.html index c0a3a99d49..75900f24f9 100644 --- a/doc/html/boost/proto/functional/child_c.html +++ b/doc/html/boost/proto/functional/child_c.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
                    -PrevUpHomeNext +PrevUpHomeNext
                    @@ -29,7 +29,7 @@

                    Struct template child_c

                    boost::proto::functional::child_c — A callable PolymorphicFunctionObject that is equivalent to the - proto::child_c() function. + proto::child_c() function.

                    Synopsis

                    @@ -39,27 +39,27 @@ struct child_c : proto::callable { // member classes/structs/unions template<typename This, typename Expr> - struct result<This(Expr)> : proto::result_of::child_c< Expr, N > { + struct result<This(Expr)> : proto::result_of::child_c< Expr, N > { }; - // public member functions + // public member functions template<typename Expr> typename proto::result_of::child_c< Expr &, N >::type - operator()(Expr &) const; + operator()(Expr &) const; template<typename Expr> typename proto::result_of::child_c< Expr const &, N >::type - operator()(Expr const &) const; + operator()(Expr const &) const; };
                    -

                    Description

                    +

                    Description

                    -

                    -child_c public member functions

                    +

                    +child_c public member functions

                    1. template<typename Expr> 
   typename proto::result_of::child_c< Expr &, N >::type 
-  operator()(Expr & expr) const;
                      + operator()(Expr & expr) const;

                      Return the Nth child of the given expression.

                      @@ -97,7 +97,7 @@

                      Returns:

                      - proto::child_c<N>(expr) + proto::child_c<N>(expr)

                      @@ -110,7 +110,7 @@ 
                    2. template<typename Expr> 
   typename proto::result_of::child_c< Expr const &, N >::type 
-  operator()(Expr const & expr) const;
                      + operator()(Expr const & expr) const;

                      This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

                    @@ -127,7 +127,7 @@
                    -PrevUpHomeNext +PrevUpHomeNext
                    diff --git a/doc/html/boost/proto/functional/child_c/result_T_idm45506973651728.html b/doc/html/boost/proto/functional/child_c/result_T_idm45506973651728.html new file mode 100644 index 0000000000..4a5550f369 --- /dev/null +++ b/doc/html/boost/proto/functional/child_c/result_T_idm45506973651728.html @@ -0,0 +1,53 @@ + + + + +Struct template result<This(Expr)> + + + + + + + + + + + + + + + +
                    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                    +
                    +
                    +PrevUpHomeNext +
                    +
                    +
                    +
                    +

                    Struct template result<This(Expr)>

                    +

                    boost::proto::functional::child_c::result<This(Expr)>

                    +
                    +

                    Synopsis

                    +
                    // In header: <boost/proto/traits.hpp>
+
+
+template<typename This, typename Expr> 
+struct result<This(Expr)> :  proto::result_of::child_c< Expr, N > {
+};
                    +
                    + + + +
                    Copyright © 2008 Eric Niebler

                    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                    +
                    +
                    +
                    +PrevUpHomeNext +
                    + + diff --git a/doc/html/boost/proto/functional/child_c/result_This_E_idp208648496.html b/doc/html/boost/proto/functional/child_c/result_This_E_idp208648496.html deleted file mode 100644 index c24f62c655..0000000000 --- a/doc/html/boost/proto/functional/child_c/result_This_E_idp208648496.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template result<This(Expr)> - - - - - - - - - - - - - - - -
                    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                    -
                    -
                    -PrevUpHomeNext -
                    -
                    -
                    -
                    -

                    Struct template result<This(Expr)>

                    -

                    boost::proto::functional::child_c::result<This(Expr)>

                    -
                    -

                    Synopsis

                    -
                    // In header: <boost/proto/traits.hpp>
-
-
-template<typename This, typename Expr> 
-struct result<This(Expr)> :  proto::result_of::child_c< Expr, N > {
-};
                    -
                    - - - -
                    Copyright © 2008 Eric Niebler

                    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                    -
                    -
                    -
                    -PrevUpHomeNext -
                    - - diff --git a/doc/html/boost/proto/functional/deep_copy.html b/doc/html/boost/proto/functional/deep_copy.html index 44de46b871..67cbcaf788 100644 --- a/doc/html/boost/proto/functional/deep_copy.html +++ b/doc/html/boost/proto/functional/deep_copy.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
                    -PrevUpHomeNext +PrevUpHomeNext
                    @@ -37,26 +37,26 @@ struct deep_copy : proto::callable { // member classes/structs/unions template<typename This, typename Expr> - struct result<This(Expr)> : result_of::deep_copy<Expr> { + struct result<This(Expr)> : result_of::deep_copy<Expr> { }; - // public member functions + // public member functions template<typename Expr> - result_of::deep_copy<Expr>::type operator()(Expr const &) const; + result_of::deep_copy<Expr>::type operator()(Expr const &) const; };
                    -

                    Description

                    +

                    Description

                    A PolymorphicFunctionObject type for deep-copying Proto expression trees. When a tree is deep-copied, all internal nodes and terminals held by reference are instead held by value. The only exception is function references, which continue to be held by reference.

                    -

                    -deep_copy public member functions

                    +

                    +deep_copy public member functions

                    1. template<typename Expr> 
-  result_of::deep_copy<Expr>::type operator()(Expr const & expr) const;
                      Deep-copies a Proto expression tree, turning all nodes and terminals held by + result_of::deep_copy<Expr>::type operator()(Expr const & expr) const;Deep-copies a Proto expression tree, turning all nodes and terminals held by reference into ones held by value.
                    @@ -71,7 +71,7 @@
                    -PrevUpHomeNext +PrevUpHomeNext
                    diff --git a/doc/html/boost/proto/functional/deep_copy/result_T_idm45506996676928.html b/doc/html/boost/proto/functional/deep_copy/result_T_idm45506996676928.html new file mode 100644 index 0000000000..6967ef2e5d --- /dev/null +++ b/doc/html/boost/proto/functional/deep_copy/result_T_idm45506996676928.html @@ -0,0 +1,53 @@ + + + + +Struct template result<This(Expr)> + + + + + + + + + + + + + + + +
                    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                    +
                    +
                    +PrevUpHomeNext +
                    +
                    +
                    +
                    +

                    Struct template result<This(Expr)>

                    +

                    boost::proto::functional::deep_copy::result<This(Expr)>

                    +
                    +

                    Synopsis

                    +
                    // In header: <boost/proto/deep_copy.hpp>
+
+
+template<typename This, typename Expr> 
+struct result<This(Expr)> :  result_of::deep_copy<Expr> {
+};
                    +
                    + + + +
                    Copyright © 2008 Eric Niebler

                    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                    +
                    +
                    +
                    +PrevUpHomeNext +
                    + + diff --git a/doc/html/boost/proto/functional/deep_copy/result_This_E_idp215582368.html b/doc/html/boost/proto/functional/deep_copy/result_This_E_idp215582368.html deleted file mode 100644 index e3aeb960d4..0000000000 --- a/doc/html/boost/proto/functional/deep_copy/result_This_E_idp215582368.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template result<This(Expr)> - - - - - - - - - - - - - - - -
                    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                    -
                    -
                    -PrevUpHomeNext -
                    -
                    -
                    -
                    -

                    Struct template result<This(Expr)>

                    -

                    boost::proto::functional::deep_copy::result<This(Expr)>

                    -
                    -

                    Synopsis

                    -
                    // In header: <boost/proto/deep_copy.hpp>
-
-
-template<typename This, typename Expr> 
-struct result<This(Expr)> :  result_of::deep_copy<Expr> {
-};
                    -
                    - - - -
                    Copyright © 2008 Eric Niebler

                    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                    -
                    -
                    -
                    -PrevUpHomeNext -
                    - - diff --git a/doc/html/boost/proto/functional/display_expr.html b/doc/html/boost/proto/functional/display_expr.html index deee503e66..ec5ce421be 100644 --- a/doc/html/boost/proto/functional/display_expr.html +++ b/doc/html/boost/proto/functional/display_expr.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
                    -PrevUpHomeNext +PrevUpHomeNext
                    @@ -38,23 +38,23 @@ typedef void result_type; // construct/copy/destruct - display_expr(std::ostream & = std::cout, int = 0); + display_expr(std::ostream & = std::cout, int = 0); - // public member functions - template<typename Expr> void operator()(Expr const &) const; + // public member functions + template<typename Expr> void operator()(Expr const &) const; };
                    -

                    Description

                    +

                    Description

                    A PolymorphicFunctionObject which accepts a Proto expression tree and pretty-prints it to an ostream for debugging purposes.

                    -

                    +

                    display_expr public construct/copy/destruct

                    1. -
                      display_expr(std::ostream & sout = std::cout, int depth = 0);
                      +
                      display_expr(std::ostream & sout = std::cout, int depth = 0);
                      @@ -87,9 +87,9 @@
                      -

                      -display_expr public member functions

                      -
                      1. template<typename Expr> void operator()(Expr const & expr) const;
                      +

                      +display_expr public member functions

                      +
                      1. template<typename Expr> void operator()(Expr const & expr) const;
                      @@ -103,7 +103,7 @@
                      -PrevUpHomeNext +PrevUpHomeNext
                      diff --git a/doc/html/boost/proto/functional/distance.html b/doc/html/boost/proto/functional/distance.html index eb6529f07c..b9d0d96352 100644 --- a/doc/html/boost/proto/functional/distance.html +++ b/doc/html/boost/proto/functional/distance.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
                      -PrevUpHomeNext +PrevUpHomeNext
                      @@ -37,30 +37,30 @@ struct distance : proto::callable { // member classes/structs/unions template<typename This, typename InputIterator> - struct result<This(InputIterator, InputIterator)> { + struct result<This(InputIterator, InputIterator)> { // types typedef typename std::iterator_traits< typename boost::remove_const< typename boost::remove_reference<InputIterator>::type >::type - >::difference_type type; + >::difference_type type; }; - // public member functions + // public member functions template<typename InputIterator> - void operator()(InputIterator, InputIterator) const; + void operator()(InputIterator, InputIterator) const; };
                      -

                      Description

                      +

                      Description

                      A PolymorphicFunctionObject type that invokes the std::distance() function on its arguments.

                      -

                      -distance public member functions

                      +

                      +distance public member functions

                      1. template<typename InputIterator> 
-  void operator()(InputIterator first, InputIterator last) const;
                        + void operator()(InputIterator first, InputIterator last) const;
                        @@ -85,7 +85,7 @@
                        -PrevUpHomeNext +PrevUpHomeNext
                        diff --git a/doc/html/boost/proto/functional/distance/result_T_idm45506975522832.html b/doc/html/boost/proto/functional/distance/result_T_idm45506975522832.html new file mode 100644 index 0000000000..cd6dfca1e6 --- /dev/null +++ b/doc/html/boost/proto/functional/distance/result_T_idm45506975522832.html @@ -0,0 +1,59 @@ + + + + +Struct template result<This(InputIterator, InputIterator)> + + + + + + + + + + + + + + + +
                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                        +
                        +
                        +PrevUpHomeNext +
                        +
                        +
                        +
                        +

                        Struct template result<This(InputIterator, InputIterator)>

                        +

                        boost::proto::functional::distance::result<This(InputIterator, InputIterator)>

                        +
                        +

                        Synopsis

                        +
                        // In header: <boost/proto/functional/std/iterator.hpp>
+
+
+template<typename This, typename InputIterator> 
+struct result<This(InputIterator, InputIterator)> {
+  // types
+  typedef typename std::iterator_traits<
+      typename boost::remove_const<
+        typename boost::remove_reference<InputIterator>::type
+      >::type
+    >::difference_type type;
+};
                        +
                        + + + +
                        Copyright © 2008 Eric Niebler

                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                        +
                        +
                        +
                        +PrevUpHomeNext +
                        + + diff --git a/doc/html/boost/proto/functional/distance/result_This_I_idp204500544.html b/doc/html/boost/proto/functional/distance/result_This_I_idp204500544.html deleted file mode 100644 index 24b607698b..0000000000 --- a/doc/html/boost/proto/functional/distance/result_This_I_idp204500544.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Struct template result<This(InputIterator, InputIterator)> - - - - - - - - - - - - - - - -
                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                        -
                        -
                        -PrevUpHomeNext -
                        -
                        -
                        -
                        -

                        Struct template result<This(InputIterator, InputIterator)>

                        -

                        boost::proto::functional::distance::result<This(InputIterator, InputIterator)>

                        -
                        -

                        Synopsis

                        -
                        // In header: <boost/proto/functional/std/iterator.hpp>
-
-
-template<typename This, typename InputIterator> 
-struct result<This(InputIterator, InputIterator)> {
-  // types
-  typedef typename std::iterator_traits<
-      typename boost::remove_const<
-        typename boost::remove_reference<InputIterator>::type
-      >::type
-    >::difference_type type;
-};
                        -
                        - - - -
                        Copyright © 2008 Eric Niebler

                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                        -
                        -
                        -
                        -PrevUpHomeNext -
                        - - diff --git a/doc/html/boost/proto/functional/empty.html b/doc/html/boost/proto/functional/empty.html index 8736a3314a..7c0eeaeca1 100644 --- a/doc/html/boost/proto/functional/empty.html +++ b/doc/html/boost/proto/functional/empty.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                        -PrevUpHomeNext +PrevUpHomeNext
                        @@ -38,19 +38,19 @@ // types typedef bool result_type; - // public member functions - template<typename Range> bool operator()(Range const &) const; + // public member functions + template<typename Range> bool operator()(Range const &) const; };
                        -

                        Description

                        +

                        Description

                        A PolymorphicFunctionObject type that invokes the boost::empty() function on its arguments.

                        -

                        -empty public member functions

                        +

                        +empty public member functions

                        1. -
                          template<typename Range> bool operator()(Range const & rng) const;
                          +
                          template<typename Range> bool operator()(Range const & rng) const;
                          @@ -75,7 +75,7 @@
                          -PrevUpHomeNext +PrevUpHomeNext
                          diff --git a/doc/html/boost/proto/functional/end.html b/doc/html/boost/proto/functional/end.html index d75e1638cd..538c96eeed 100644 --- a/doc/html/boost/proto/functional/end.html +++ b/doc/html/boost/proto/functional/end.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
                          -PrevUpHomeNext +PrevUpHomeNext
                          @@ -37,31 +37,31 @@ struct end : proto::callable { // member classes/structs/unions template<typename This, typename Range> - struct result<This(Range)> : boost::range_iterator< + struct result<This(Range)> : boost::range_iterator< typename boost::remove_reference<Range>::type > { }; - // public member functions + // public member functions template<typename Range> - typename boost::range_iterator< Range >::type operator()(Range &) const; + typename boost::range_iterator< Range >::type operator()(Range &) const; template<typename Range> typename boost::range_iterator< Range const >::type - operator()(Range const &) const; + operator()(Range const &) const; };
                          -

                          Description

                          +

                          Description

                          A PolymorphicFunctionObject type that invokes the boost::end() accessor function on its arguments.

                          -

                          -end public member functions

                          +

                          +end public member functions

                          1. template<typename Range> 
-  typename boost::range_iterator< Range >::type operator()(Range & rng) const;
                            + typename boost::range_iterator< Range >::type operator()(Range & rng) const;
                            @@ -76,7 +76,7 @@ 
                          2. template<typename Range> 
   typename boost::range_iterator< Range const >::type 
-  operator()(Range const & rng) const;
                            + operator()(Range const & rng) const;
                            3. @@ -102,7 +102,7 @@
                            -PrevUpHomeNext +PrevUpHomeNext
                            diff --git a/doc/html/boost/proto/functional/end/result_T_idm45506975629344.html b/doc/html/boost/proto/functional/end/result_T_idm45506975629344.html new file mode 100644 index 0000000000..dc2fba8588 --- /dev/null +++ b/doc/html/boost/proto/functional/end/result_T_idm45506975629344.html @@ -0,0 +1,56 @@ + + + + +Struct template result<This(Range)> + + + + + + + + + + + + + + + +
                            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                            +
                            +
                            +PrevUpHomeNext +
                            +
                            +
                            +
                            +

                            Struct template result<This(Range)>

                            +

                            boost::proto::functional::end::result<This(Range)>

                            +
                            +

                            Synopsis

                            +
                            // In header: <boost/proto/functional/range/end.hpp>
+
+
+template<typename This, typename Range> 
+struct result<This(Range)> :  boost::range_iterator<
+      typename boost::remove_reference<Range>::type
+  >
+{
+};
                            +
                            + + + +
                            Copyright © 2008 Eric Niebler

                            + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                            +
                            +
                            +
                            +PrevUpHomeNext +
                            + + diff --git a/doc/html/boost/proto/functional/end/result_This_R_idp204394032.html b/doc/html/boost/proto/functional/end/result_This_R_idp204394032.html deleted file mode 100644 index 9011fcfadd..0000000000 --- a/doc/html/boost/proto/functional/end/result_This_R_idp204394032.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Struct template result<This(Range)> - - - - - - - - - - - - - - - -
                            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                            -
                            -
                            -PrevUpHomeNext -
                            -
                            -
                            -
                            -

                            Struct template result<This(Range)>

                            -

                            boost::proto::functional::end::result<This(Range)>

                            -
                            -

                            Synopsis

                            -
                            // In header: <boost/proto/functional/range/end.hpp>
-
-
-template<typename This, typename Range> 
-struct result<This(Range)> :  boost::range_iterator<
-      typename boost::remove_reference<Range>::type
-  >
-{
-};
                            -
                            - - - -
                            Copyright © 2008 Eric Niebler

                            - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                            -
                            -
                            -
                            -PrevUpHomeNext -
                            - - diff --git a/doc/html/boost/proto/functional/env_var.html b/doc/html/boost/proto/functional/env_var.html index dee2900e79..b392d43cc1 100644 --- a/doc/html/boost/proto/functional/env_var.html +++ b/doc/html/boost/proto/functional/env_var.html @@ -44,16 +44,16 @@ typedef see-below type; }; - // public member functions - template<typename Env> see-below operator()(Env const &) const; + // public member functions + template<typename Env> see-below operator()(Env const &) const; };
                            -

                            Description

                            +

                            Description

                            -

                            -env_var public member functions

                            +

                            +env_var public member functions

                            1. -
                              template<typename Env> see-below operator()(Env const & e) const;
                              +
                              template<typename Env> see-below operator()(Env const & e) const;

                              This function behaves as follows:

                              @@ -77,7 +77,7 @@

                              - See proto::env::operator[] for additional information. + See proto::env::operator[] for additional information.

                            diff --git a/doc/html/boost/proto/functional/env_var/result.html b/doc/html/boost/proto/functional/env_var/result.html index ea6a3e6ae9..4a2f78a5c9 100644 --- a/doc/html/boost/proto/functional/env_var/result.html +++ b/doc/html/boost/proto/functional/env_var/result.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                            -PrevUpHomeNext +PrevUpHomeNext
                            @@ -39,21 +39,21 @@ typedef see-below type; };
                            -

                            Description

                            +

                            Description

                            - Encodes the return type of proto::functional::env_var::operator(). + Encodes the return type of proto::functional::env_var::operator(). The presence of this member template makes proto::functional::env_var a valid TR1-style function object type usable with boost::result_of<>.

                            -

                            +

                            result public types

                            1. typedef see-below type;

                              -

                              See proto::functional::env_var::operator().

                              +

                              See proto::functional::env_var::operator().

                            @@ -68,7 +68,7 @@
                            -PrevUpHomeNext +PrevUpHomeNext
                            diff --git a/doc/html/boost/proto/functional/eval.html b/doc/html/boost/proto/functional/eval.html index 0e49dfb8df..b32ec7fc58 100644 --- a/doc/html/boost/proto/functional/eval.html +++ b/doc/html/boost/proto/functional/eval.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
                            -PrevUpHomeNext +PrevUpHomeNext
                            @@ -37,7 +37,7 @@ struct eval : proto::callable { // member classes/structs/unions template<typename This, typename Expr, typename Context> - struct result<This(Expr, Context)> : + struct result<This(Expr, Context)> : proto::result_of::eval< typename boost::remove_reference< Expr >::type, typename boost::remove_reference< Context >::type @@ -45,24 +45,24 @@ { }; - // public member functions + // public member functions template<typename Expr, typename Context> typename proto::result_of::eval< Expr, Context >::type - operator()(Expr &, Context &) const; + operator()(Expr &, Context &) const; template<typename Expr, typename Context> typename proto::result_of::eval< Expr, Context >::type - operator()(Expr &, Context const &) const; + operator()(Expr &, Context const &) const; };
                            -

                            Description

                            +

                            Description

                            -

                            -eval public member functions

                            +

                            +eval public member functions

                            1. template<typename Expr, typename Context> 
   typename proto::result_of::eval< Expr, Context >::type 
-  operator()(Expr & expr, Context & context) const;
                              Evaluate a given Proto expression with a given context.
                              + operator()(Expr& expr,Context& context)const;Evaluate a given Proto expression with a given context.
                              @@ -99,7 +99,7 @@ 
                            2. template<typename Expr, typename Context> 
   typename proto::result_of::eval< Expr, Context >::type 
-  operator()(Expr & expr, Context const & context) const;
                              + operator()(Expr & expr, Context const & context) const;

                              This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. @@ -119,7 +119,7 @@

                              3. -PrevUpHomeNext +PrevUpHomeNext
                              diff --git a/doc/html/boost/proto/functional/eval/result_T_idm45506996531472.html b/doc/html/boost/proto/functional/eval/result_T_idm45506996531472.html new file mode 100644 index 0000000000..aac1cbe340 --- /dev/null +++ b/doc/html/boost/proto/functional/eval/result_T_idm45506996531472.html @@ -0,0 +1,58 @@ + + + + +Struct template result<This(Expr, Context)> + + + + + + + + + + + + + + + +
                              Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                              +
                              +
                              +PrevUpHomeNext +
                              +
                              +
                              +
                              +

                              Struct template result<This(Expr, Context)>

                              +

                              boost::proto::functional::eval::result<This(Expr, Context)>

                              +
                              +

                              Synopsis

                              +
                              // In header: <boost/proto/eval.hpp>
+
+
+template<typename This, typename Expr, typename Context> 
+struct result<This(Expr, Context)> :  
+    proto::result_of::eval<
+      typename boost::remove_reference< Expr >::type, 
+      typename boost::remove_reference< Context >::type 
+    >
+{
+};
                              +
                              + + + +
                              Copyright © 2008 Eric Niebler

                              + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                              +
                              +
                              +
                              +PrevUpHomeNext +
                              + + diff --git a/doc/html/boost/proto/functional/eval/result_This_E_idp215726640.html b/doc/html/boost/proto/functional/eval/result_This_E_idp215726640.html deleted file mode 100644 index afea15d5b4..0000000000 --- a/doc/html/boost/proto/functional/eval/result_This_E_idp215726640.html +++ /dev/null @@ -1,58 +0,0 @@ - - - - -Struct template result<This(Expr, Context)> - - - - - - - - - - - - - - - -
                              Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                              -
                              -
                              -PrevUpHomeNext -
                              -
                              -
                              -
                              -

                              Struct template result<This(Expr, Context)>

                              -

                              boost::proto::functional::eval::result<This(Expr, Context)>

                              -
                              -

                              Synopsis

                              -
                              // In header: <boost/proto/eval.hpp>
-
-
-template<typename This, typename Expr, typename Context> 
-struct result<This(Expr, Context)> :  
-    proto::result_of::eval<
-      typename boost::remove_reference< Expr >::type, 
-      typename boost::remove_reference< Context >::type 
-    >
-{
-};
                              -
                              - - - -
                              Copyright © 2008 Eric Niebler

                              - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                              -
                              -
                              -
                              -PrevUpHomeNext -
                              - - diff --git a/doc/html/boost/proto/functional/first.html b/doc/html/boost/proto/functional/first.html index 6a4a3e5b76..24014575c1 100644 --- a/doc/html/boost/proto/functional/first.html +++ b/doc/html/boost/proto/functional/first.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
                              -PrevUpHomeNext +PrevUpHomeNext
                              @@ -39,38 +39,38 @@ struct first : proto::callable { // member classes/structs/unions template<typename This, typename Pair> - struct result<This(Pair)> { + struct result<This(Pair)> { // types - typedef typename Pair::first_type type; + typedef typename Pair::first_type type; }; template<typename This, typename Pair> - struct result<This(Pair &)> { + struct result<This(Pair &)> { // types - typedef typename Pair::first_type & type; + typedef typename Pair::first_type & type; }; template<typename This, typename Pair> - struct result<This(Pair const &)> { + struct result<This(Pair const &)> { // types - typedef typename Pair::first_type const & type; + typedef typename Pair::first_type const & type; }; - // public member functions - template<typename Pair> typename Pair::first_type & operator()(Pair &) const; + // public member functions + template<typename Pair> typename Pair::first_type & operator()(Pair &) const; template<typename Pair> - typename Pair::first_type const & operator()(Pair const &) const; + typename Pair::first_type const & operator()(Pair const &) const; };
                              -

                              Description

                              +

                              Description

                              A PolymorphicFunctionObject type that returns the first element of a std::pair<>.

                              -

                              -first public member functions

                              +

                              +first public member functions

                              1. template<typename Pair> 
-  typename Pair::first_type & operator()(Pair & pair) const;
                                + typename Pair::first_type & operator()(Pair & pair) const;
                                @@ -86,7 +86,7 @@ 
                              2. template<typename Pair> 
-  typename Pair::first_type const & operator()(Pair const & pair) const;
                                + typename Pair::first_type const & operator()(Pair const & pair) const;
                                3. @@ -114,7 +114,7 @@
                                -PrevUpHomeNext +PrevUpHomeNext
                                diff --git a/doc/html/boost/proto/functional/first/result_T_idm45506975424160.html b/doc/html/boost/proto/functional/first/result_T_idm45506975424160.html new file mode 100644 index 0000000000..c034bcc7a0 --- /dev/null +++ b/doc/html/boost/proto/functional/first/result_T_idm45506975424160.html @@ -0,0 +1,55 @@ + + + + +Struct template result<This(Pair const &)> + + + + + + + + + + + + + + + +
                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                +
                                +
                                +PrevUpHomeNext +
                                +
                                +
                                +
                                +

                                Struct template result<This(Pair const &)>

                                +

                                boost::proto::functional::first::result<This(Pair const &)>

                                +
                                +

                                Synopsis

                                +
                                // In header: <boost/proto/functional/std/utility.hpp>
+
+
+template<typename This, typename Pair> 
+struct result<This(Pair const &)> {
+  // types
+  typedef typename Pair::first_type const & type;
+};
                                +
                                + + + +
                                Copyright © 2008 Eric Niebler

                                + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                +
                                +
                                +
                                +PrevUpHomeNext +
                                + + diff --git a/doc/html/boost/proto/functional/first/result_T_idm45506975428480.html b/doc/html/boost/proto/functional/first/result_T_idm45506975428480.html new file mode 100644 index 0000000000..e8e6cc7125 --- /dev/null +++ b/doc/html/boost/proto/functional/first/result_T_idm45506975428480.html @@ -0,0 +1,55 @@ + + + + +Struct template result<This(Pair &)> + + + + + + + + + + + + + + + +
                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                +
                                +
                                +PrevUpHomeNext +
                                +
                                +
                                +
                                +

                                Struct template result<This(Pair &)>

                                +

                                boost::proto::functional::first::result<This(Pair &)>

                                +
                                +

                                Synopsis

                                +
                                // In header: <boost/proto/functional/std/utility.hpp>
+
+
+template<typename This, typename Pair> 
+struct result<This(Pair &)> {
+  // types
+  typedef typename Pair::first_type & type;
+};
                                +
                                + + + +
                                Copyright © 2008 Eric Niebler

                                + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                +
                                +
                                +
                                +PrevUpHomeNext +
                                + + diff --git a/doc/html/boost/proto/functional/first/result_T_idm45506975432800.html b/doc/html/boost/proto/functional/first/result_T_idm45506975432800.html new file mode 100644 index 0000000000..7e4126ccce --- /dev/null +++ b/doc/html/boost/proto/functional/first/result_T_idm45506975432800.html @@ -0,0 +1,55 @@ + + + + +Struct template result<This(Pair)> + + + + + + + + + + + + + + + +
                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                +
                                +
                                +PrevUpHomeNext +
                                +
                                +
                                +
                                +

                                Struct template result<This(Pair)>

                                +

                                boost::proto::functional::first::result<This(Pair)>

                                +
                                +

                                Synopsis

                                +
                                // In header: <boost/proto/functional/std/utility.hpp>
+
+
+template<typename This, typename Pair> 
+struct result<This(Pair)> {
+  // types
+  typedef typename Pair::first_type type;
+};
                                +
                                + + + +
                                Copyright © 2008 Eric Niebler

                                + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                +
                                +
                                +
                                +PrevUpHomeNext +
                                + + diff --git a/doc/html/boost/proto/functional/first/result_This_P_idp204590576.html b/doc/html/boost/proto/functional/first/result_This_P_idp204590576.html deleted file mode 100644 index 3cafa04e2e..0000000000 --- a/doc/html/boost/proto/functional/first/result_This_P_idp204590576.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template result<This(Pair)> - - - - - - - - - - - - - - - -
                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                -
                                -
                                -PrevUpHomeNext -
                                -
                                -
                                -
                                -

                                Struct template result<This(Pair)>

                                -

                                boost::proto::functional::first::result<This(Pair)>

                                -
                                -

                                Synopsis

                                -
                                // In header: <boost/proto/functional/std/utility.hpp>
-
-
-template<typename This, typename Pair> 
-struct result<This(Pair)> {
-  // types
-  typedef typename Pair::first_type type;
-};
                                -
                                - - - -
                                Copyright © 2008 Eric Niebler

                                - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                -
                                -
                                -
                                -PrevUpHomeNext -
                                - - diff --git a/doc/html/boost/proto/functional/first/result_This_P_idp204594896.html b/doc/html/boost/proto/functional/first/result_This_P_idp204594896.html deleted file mode 100644 index d16e724cff..0000000000 --- a/doc/html/boost/proto/functional/first/result_This_P_idp204594896.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template result<This(Pair &)> - - - - - - - - - - - - - - - -
                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                -
                                -
                                -PrevUpHomeNext -
                                -
                                -
                                -
                                -

                                Struct template result<This(Pair &)>

                                -

                                boost::proto::functional::first::result<This(Pair &)>

                                -
                                -

                                Synopsis

                                -
                                // In header: <boost/proto/functional/std/utility.hpp>
-
-
-template<typename This, typename Pair> 
-struct result<This(Pair &)> {
-  // types
-  typedef typename Pair::first_type & type;
-};
                                -
                                - - - -
                                Copyright © 2008 Eric Niebler

                                - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                -
                                -
                                -
                                -PrevUpHomeNext -
                                - - diff --git a/doc/html/boost/proto/functional/first/result_This_P_idp204599216.html b/doc/html/boost/proto/functional/first/result_This_P_idp204599216.html deleted file mode 100644 index 5c2de99172..0000000000 --- a/doc/html/boost/proto/functional/first/result_This_P_idp204599216.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template result<This(Pair const &)> - - - - - - - - - - - - - - - -
                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                -
                                -
                                -PrevUpHomeNext -
                                -
                                -
                                -
                                -

                                Struct template result<This(Pair const &)>

                                -

                                boost::proto::functional::first::result<This(Pair const &)>

                                -
                                -

                                Synopsis

                                -
                                // In header: <boost/proto/functional/std/utility.hpp>
-
-
-template<typename This, typename Pair> 
-struct result<This(Pair const &)> {
-  // types
-  typedef typename Pair::first_type const & type;
-};
                                -
                                - - - -
                                Copyright © 2008 Eric Niebler

                                - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                -
                                -
                                -
                                -PrevUpHomeNext -
                                - - diff --git a/doc/html/boost/proto/functional/flatten.html b/doc/html/boost/proto/functional/flatten.html index a418f9d11f..37ca3c6c72 100644 --- a/doc/html/boost/proto/functional/flatten.html +++ b/doc/html/boost/proto/functional/flatten.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
                                -PrevUpHomeNext +PrevUpHomeNext
                                @@ -37,22 +37,22 @@ struct flatten : proto::callable { // member classes/structs/unions template<typename This, typename Expr> - struct result<This(Expr)> : result< This(Expr const &) > { + struct result<This(Expr)> : result< This(Expr const &) > { }; template<typename This, typename Expr> - struct result<This(Expr &)> : proto::result_of::flatten< Expr > { + struct result<This(Expr &)> : proto::result_of::flatten< Expr > { }; - // public member functions + // public member functions template<typename Expr> typename proto::result_of::flatten< Expr >::type const - operator()(Expr &) const; + operator()(Expr &) const; template<typename Expr> typename proto::result_of::flatten< Expr const >::type const - operator()(Expr const &) const; + operator()(Expr const &) const; };
                                -

                                Description

                                +

                                Description

                                A PolymorphicFunctionObject type that returns a "flattened" view of a Proto expression tree. For a tree with a top-most node tag of type @@ -66,13 +66,13 @@ The resulting view is a Fusion Forward Sequence.

                                -

                                -flatten public member functions

                                +

                                +flatten public member functions

                                1. template<typename Expr> 
   typename proto::result_of::flatten< Expr >::type const 
-  operator()(Expr & expr) const;
                                  + operator()(Expr & expr) const;

                                  Returns a Fusion Forward Sequence representing a flattened view of expr.

                                  @@ -80,7 +80,7 @@ 
                                2. template<typename Expr> 
   typename proto::result_of::flatten< Expr const >::type const 
-  operator()(Expr const & expr) const;
                                  + operator()(Expr const & expr) const;

                                  Returns a Fusion Forward Sequence representing a flattened view of expr.

                                  @@ -99,7 +99,7 @@
                                  -PrevUpHomeNext +PrevUpHomeNext
                                  diff --git a/doc/html/boost/proto/functional/flatten/result_T_idm45506975366000.html b/doc/html/boost/proto/functional/flatten/result_T_idm45506975366000.html new file mode 100644 index 0000000000..7055574409 --- /dev/null +++ b/doc/html/boost/proto/functional/flatten/result_T_idm45506975366000.html @@ -0,0 +1,53 @@ + + + + +Struct template result<This(Expr &)> + + + + + + + + + + + + + + + +
                                  Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                  +
                                  +
                                  +PrevUpHomeNext +
                                  +
                                  +
                                  +
                                  +

                                  Struct template result<This(Expr &)>

                                  +

                                  boost::proto::functional::flatten::result<This(Expr &)>

                                  +
                                  +

                                  Synopsis

                                  +
                                  // In header: <boost/proto/fusion.hpp>
+
+
+template<typename This, typename Expr> 
+struct result<This(Expr &)> :  proto::result_of::flatten< Expr > {
+};
                                  +
                                  + + + +
                                  Copyright © 2008 Eric Niebler

                                  + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                  +
                                  +
                                  +
                                  +PrevUpHomeNext +
                                  + + diff --git a/doc/html/boost/proto/functional/flatten/result_T_idm45506975370048.html b/doc/html/boost/proto/functional/flatten/result_T_idm45506975370048.html new file mode 100644 index 0000000000..68b8243bf0 --- /dev/null +++ b/doc/html/boost/proto/functional/flatten/result_T_idm45506975370048.html @@ -0,0 +1,53 @@ + + + + +Struct template result<This(Expr)> + + + + + + + + + + + + + + + +
                                  Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                  +
                                  +
                                  +PrevUpHomeNext +
                                  +
                                  +
                                  +
                                  +

                                  Struct template result<This(Expr)>

                                  +

                                  boost::proto::functional::flatten::result<This(Expr)>

                                  +
                                  +

                                  Synopsis

                                  +
                                  // In header: <boost/proto/fusion.hpp>
+
+
+template<typename This, typename Expr> 
+struct result<This(Expr)> :  result< This(Expr const &) > {
+};
                                  +
                                  + + + +
                                  Copyright © 2008 Eric Niebler

                                  + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                  +
                                  +
                                  +
                                  +PrevUpHomeNext +
                                  + + diff --git a/doc/html/boost/proto/functional/flatten/result_This_E_idp204653328.html b/doc/html/boost/proto/functional/flatten/result_This_E_idp204653328.html deleted file mode 100644 index 41e43d524e..0000000000 --- a/doc/html/boost/proto/functional/flatten/result_This_E_idp204653328.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template result<This(Expr)> - - - - - - - - - - - - - - - -
                                  Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                  -
                                  -
                                  -PrevUpHomeNext -
                                  -
                                  -
                                  -
                                  -

                                  Struct template result<This(Expr)>

                                  -

                                  boost::proto::functional::flatten::result<This(Expr)>

                                  -
                                  -

                                  Synopsis

                                  -
                                  // In header: <boost/proto/fusion.hpp>
-
-
-template<typename This, typename Expr> 
-struct result<This(Expr)> :  result< This(Expr const &) > {
-};
                                  -
                                  - - - -
                                  Copyright © 2008 Eric Niebler

                                  - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                  -
                                  -
                                  -
                                  -PrevUpHomeNext -
                                  - - diff --git a/doc/html/boost/proto/functional/flatten/result_This_E_idp204657376.html b/doc/html/boost/proto/functional/flatten/result_This_E_idp204657376.html deleted file mode 100644 index aad1df5170..0000000000 --- a/doc/html/boost/proto/functional/flatten/result_This_E_idp204657376.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template result<This(Expr &)> - - - - - - - - - - - - - - - -
                                  Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                  -
                                  -
                                  -PrevUpHomeNext -
                                  -
                                  -
                                  -
                                  -

                                  Struct template result<This(Expr &)>

                                  -

                                  boost::proto::functional::flatten::result<This(Expr &)>

                                  -
                                  -

                                  Synopsis

                                  -
                                  // In header: <boost/proto/fusion.hpp>
-
-
-template<typename This, typename Expr> 
-struct result<This(Expr &)> :  proto::result_of::flatten< Expr > {
-};
                                  -
                                  - - - -
                                  Copyright © 2008 Eric Niebler

                                  - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                  -
                                  -
                                  -
                                  -PrevUpHomeNext -
                                  - - diff --git a/doc/html/boost/proto/functional/has_env_var.html b/doc/html/boost/proto/functional/has_env_var.html index 4267ba6540..82c92f7496 100644 --- a/doc/html/boost/proto/functional/has_env_var.html +++ b/doc/html/boost/proto/functional/has_env_var.html @@ -44,16 +44,16 @@ typedef see-below type; }; - // public member functions - template<typename Env> see-below operator()(Env const &) const; + // public member functions + template<typename Env> see-below operator()(Env const &) const; };
                                -

                                Description

                                +

                                Description

                                -

                                -has_env_var public member functions

                                +

                                +has_env_var public member functions

                                1. -
                                  template<typename Env> see-below operator()(Env const & e) const;
                                  +
                                  template<typename Env> see-below operator()(Env const & e) const;

                                  This function behaves as follows:

                                  @@ -64,7 +64,7 @@
                                2. If e[Key()] returns an instance of proto::key_not_found, return - mpl::false_. See proto::env::operator[] + mpl::false_. See proto::env::operator[] for more information.
                                3. diff --git a/doc/html/boost/proto/functional/has_env_var/result.html b/doc/html/boost/proto/functional/has_env_var/result.html index 75a0c53dd2..699b1adf02 100644 --- a/doc/html/boost/proto/functional/has_env_var/result.html +++ b/doc/html/boost/proto/functional/has_env_var/result.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                  -PrevUpHomeNext +PrevUpHomeNext
                                  @@ -39,21 +39,21 @@ typedef see-below type; };
                                  -

                                  Description

                                  +

                                  Description

                                  - Encodes the return type of proto::functional::has_env_var::operator(). + Encodes the return type of proto::functional::has_env_var::operator(). The presence of this member template makes proto::functional::has_env_var a valid TR1-style function object type usable with boost::result_of<>.

                                  -

                                  +

                                  result public types

                                  1. typedef see-below type;

                                    -

                                    See proto::functional::has_env_var::operator().

                                    +

                                    See proto::functional::has_env_var::operator().

                                  @@ -68,7 +68,7 @@
                                  -PrevUpHomeNext +PrevUpHomeNext
                                  diff --git a/doc/html/boost/proto/functional/left.html b/doc/html/boost/proto/functional/left.html index 454bd0f407..a0999c7718 100644 --- a/doc/html/boost/proto/functional/left.html +++ b/doc/html/boost/proto/functional/left.html @@ -7,8 +7,8 @@ - - + + @@ -21,14 +21,14 @@
                                  -PrevUpHomeNext +PrevUpHomeNext

                                  Struct left

                                  boost::proto::functional::left — A callable PolymorphicFunctionObject that is equivalent to the - proto::left() function.

                                  + proto::left() function.

                                  Synopsis

                                  // In header: <boost/proto/traits.hpp>
@@ -37,26 +37,26 @@
 struct left :  proto::callable {
   // member classes/structs/unions
   template<typename This, typename Expr> 
-  struct result<This(Expr)> :  proto::result_of::left< Expr > {
+  struct result<This(Expr)> :  proto::result_of::left< Expr > {
   };
 
-  // public member functions
+  // public member functions
   template<typename Expr> 
-    typename proto::result_of::left< Expr & >::type operator()(Expr &) const;
+    typename proto::result_of::left< Expr & >::type operator()(Expr &) const;
   template<typename Expr> 
     typename proto::result_of::left< Expr const & >::type 
-    operator()(Expr const &) const;
+    operator()(Expr const &) const;
 };
                                  -

                                  Description

                                  +

                                  Description

                                  -

                                  -left public member functions

                                  +

                                  +left public member functions

                                  1. template<typename Expr> 
   typename proto::result_of::left< Expr & >::type 
-  operator()(Expr & expr) const;
                                    + operator()(Expr & expr) const;

                                    Return the left child of the given binary expression.

                                    @@ -94,7 +94,7 @@

                                    Returns:

                                    - proto::left(expr) + proto::left(expr)

                                    @@ -107,7 +107,7 @@ 
                                  2. template<typename Expr> 
   typename proto::result_of::left< Expr const & >::type 
-  operator()(Expr const & expr) const;
                                    + operator()(Expr const & expr) const;

                                    This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

                                  @@ -124,7 +124,7 @@
                                  -PrevUpHomeNext +PrevUpHomeNext
                                  diff --git a/doc/html/boost/proto/functional/left/result_T_idm45506973573376.html b/doc/html/boost/proto/functional/left/result_T_idm45506973573376.html new file mode 100644 index 0000000000..0051f9517f --- /dev/null +++ b/doc/html/boost/proto/functional/left/result_T_idm45506973573376.html @@ -0,0 +1,53 @@ + + + + +Struct template result<This(Expr)> + + + + + + + + + + + + + + + +
                                  Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                  +
                                  +
                                  +PrevUpHomeNext +
                                  +
                                  +
                                  +
                                  +

                                  Struct template result<This(Expr)>

                                  +

                                  boost::proto::functional::left::result<This(Expr)>

                                  +
                                  +

                                  Synopsis

                                  +
                                  // In header: <boost/proto/traits.hpp>
+
+
+template<typename This, typename Expr> 
+struct result<This(Expr)> :  proto::result_of::left< Expr > {
+};
                                  +
                                  + + + +
                                  Copyright © 2008 Eric Niebler

                                  + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                  +
                                  +
                                  +
                                  +PrevUpHomeNext +
                                  + + diff --git a/doc/html/boost/proto/functional/left/result_This_E_idp226498320.html b/doc/html/boost/proto/functional/left/result_This_E_idp226498320.html deleted file mode 100644 index c0b90a9b7e..0000000000 --- a/doc/html/boost/proto/functional/left/result_This_E_idp226498320.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template result<This(Expr)> - - - - - - - - - - - - - - - -
                                  Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                  -
                                  -
                                  -PrevUpHomeNext -
                                  -
                                  -
                                  -
                                  -

                                  Struct template result<This(Expr)>

                                  -

                                  boost::proto::functional::left::result<This(Expr)>

                                  -
                                  -

                                  Synopsis

                                  -
                                  // In header: <boost/proto/traits.hpp>
-
-
-template<typename This, typename Expr> 
-struct result<This(Expr)> :  proto::result_of::left< Expr > {
-};
                                  -
                                  - - - -
                                  Copyright © 2008 Eric Niebler

                                  - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                  -
                                  -
                                  -
                                  -PrevUpHomeNext -
                                  - - diff --git a/doc/html/boost/proto/functional/make_expr.html b/doc/html/boost/proto/functional/make_expr.html index bcd6125c09..7e5583bd7b 100644 --- a/doc/html/boost/proto/functional/make_expr.html +++ b/doc/html/boost/proto/functional/make_expr.html @@ -8,7 +8,7 @@ - + @@ -21,14 +21,14 @@
                                  -PrevUpHomeNext +PrevUpHomeNext

                                  Struct template make_expr

                                  boost::proto::functional::make_expr — A PolymorphicFunctionObject equivalent to the - proto::make_expr() function.

                                  + proto::make_expr() function.

                                  Synopsis

                                  // In header: <boost/proto/make_expr.hpp>
@@ -37,32 +37,32 @@
 struct make_expr :  proto::callable {
   // member classes/structs/unions
   template<typename This, typename... A> 
-  struct result<This(A...)> :  
+  struct result<This(A...)> :  
     proto::result_of::make_expr< Tag, Domain, A... > {
   };
 
-  // public member functions
+  // public member functions
   template<typename... A> 
     typename proto::result_of::make_expr< Tag, Domain, A const... >::type const 
-    operator()(A const &...) const;
+    operator()(A const &...) const;
 };
                                  -

                                  Description

                                  +

                                  Description

                                  In all cases, proto::functional::make_expr<Tag, Domain>()(a...) - is equivalent to proto::make_expr<Tag, Domain>(a...). + is equivalent to proto::make_expr<Tag, Domain>(a...).

                                  proto::functional::make_expr<Tag>()(a...) is equivalent to - proto::make_expr<Tag>(a...). + proto::make_expr<Tag>(a...).

                                  -

                                  -make_expr public member functions

                                  +

                                  +make_expr public member functions

                                  1. template<typename... A> 
   typename proto::result_of::make_expr< Tag, Domain, A const... >::type const 
-  operator()(A const &... a) const;
                                    + operator()(A const &... a) const;

                                    Construct an expression node with tag type Tag and in the domain Domain. @@ -77,7 +77,7 @@

                                    Returns:

                                    - proto::make_expr<Tag, Domain>(a...) + proto::make_expr<Tag, Domain>(a...)

                                  @@ -95,7 +95,7 @@
                                  -PrevUpHomeNext +PrevUpHomeNext
                                  diff --git a/doc/html/boost/proto/functional/make_expr/result_T_idm45506975157536.html b/doc/html/boost/proto/functional/make_expr/result_T_idm45506975157536.html new file mode 100644 index 0000000000..d2931760c2 --- /dev/null +++ b/doc/html/boost/proto/functional/make_expr/result_T_idm45506975157536.html @@ -0,0 +1,54 @@ + + + + +Struct template result<This(A...)> + + + + + + + + + + + + + + + +
                                  Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                  +
                                  +
                                  +PrevUpHomeNext +
                                  +
                                  +
                                  +
                                  +

                                  Struct template result<This(A...)>

                                  +

                                  boost::proto::functional::make_expr::result<This(A...)>

                                  +
                                  +

                                  Synopsis

                                  +
                                  // In header: <boost/proto/make_expr.hpp>
+
+
+template<typename This, typename... A> 
+struct result<This(A...)> :  
+    proto::result_of::make_expr< Tag, Domain, A... > {
+};
                                  +
                                  + + + +
                                  Copyright © 2008 Eric Niebler

                                  + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                  +
                                  +
                                  +
                                  +PrevUpHomeNext +
                                  + + diff --git a/doc/html/boost/proto/functional/make_expr/result_This_A_idp224862112.html b/doc/html/boost/proto/functional/make_expr/result_This_A_idp224862112.html deleted file mode 100644 index 3582e9926d..0000000000 --- a/doc/html/boost/proto/functional/make_expr/result_This_A_idp224862112.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template result<This(A...)> - - - - - - - - - - - - - - - -
                                  Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                  -
                                  -
                                  -PrevUpHomeNext -
                                  -
                                  -
                                  -
                                  -

                                  Struct template result<This(A...)>

                                  -

                                  boost::proto::functional::make_expr::result<This(A...)>

                                  -
                                  -

                                  Synopsis

                                  -
                                  // In header: <boost/proto/make_expr.hpp>
-
-
-template<typename This, typename... A> 
-struct result<This(A...)> :  
-    proto::result_of::make_expr< Tag, Domain, A... > {
-};
                                  -
                                  - - - -
                                  Copyright © 2008 Eric Niebler

                                  - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                  -
                                  -
                                  -
                                  -PrevUpHomeNext -
                                  - - diff --git a/doc/html/boost/proto/functional/make_pair.html b/doc/html/boost/proto/functional/make_pair.html index e80897f312..661bfd772c 100644 --- a/doc/html/boost/proto/functional/make_pair.html +++ b/doc/html/boost/proto/functional/make_pair.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
                                  -PrevUpHomeNext +PrevUpHomeNext
                                  @@ -37,31 +37,31 @@ struct make_pair : proto::callable { // member classes/structs/unions template<typename This, typename First, typename Second> - struct result<This(First, Second)> { + struct result<This(First, Second)> { // types typedef std::pair< typename boost::remove_const<typename boost::remove_reference<First>::type>::type , typename boost::remove_const<typename boost::remove_reference<Second>::type>::type - > type; + > type; }; - // public member functions + // public member functions template<typename First, typename Second> typename std::pair< First, Second > - operator()(First const &, Second const &) const; + operator()(First const &, Second const &) const; };
                                  -

                                  Description

                                  +

                                  Description

                                  A PolymorphicFunctionObject type that invokes std::make_pair() on its arguments.

                                  -

                                  -make_pair public member functions

                                  +

                                  +make_pair public member functions

                                  1. template<typename First, typename Second> 
   typename std::pair< First, Second > 
-  operator()(First const & first, Second const & second) const;
                                    + operator()(First const & first, Second const & second) const;
                                    @@ -86,7 +86,7 @@
                                    -PrevUpHomeNext +PrevUpHomeNext
                                    diff --git a/doc/html/boost/proto/functional/make_pair/result_T_idm45506975449936.html b/doc/html/boost/proto/functional/make_pair/result_T_idm45506975449936.html new file mode 100644 index 0000000000..c9dce27ce9 --- /dev/null +++ b/doc/html/boost/proto/functional/make_pair/result_T_idm45506975449936.html @@ -0,0 +1,58 @@ + + + + +Struct template result<This(First, Second)> + + + + + + + + + + + + + + + +
                                    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                    +
                                    +
                                    +PrevUpHomeNext +
                                    +
                                    +
                                    +
                                    +

                                    Struct template result<This(First, Second)>

                                    +

                                    boost::proto::functional::make_pair::result<This(First, Second)>

                                    +
                                    +

                                    Synopsis

                                    +
                                    // In header: <boost/proto/functional/std/utility.hpp>
+
+
+template<typename This, typename First, typename Second> 
+struct result<This(First, Second)> {
+  // types
+  typedef std::pair<
+        typename boost::remove_const<typename boost::remove_reference<First>::type>::type
+      , typename boost::remove_const<typename boost::remove_reference<Second>::type>::type
+    > type;
+};
                                    +
                                    + + + +
                                    Copyright © 2008 Eric Niebler

                                    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                    +
                                    +
                                    +
                                    +PrevUpHomeNext +
                                    + + diff --git a/doc/html/boost/proto/functional/make_pair/result_This_F_idp204573440.html b/doc/html/boost/proto/functional/make_pair/result_This_F_idp204573440.html deleted file mode 100644 index e6221d9801..0000000000 --- a/doc/html/boost/proto/functional/make_pair/result_This_F_idp204573440.html +++ /dev/null @@ -1,58 +0,0 @@ - - - - -Struct template result<This(First, Second)> - - - - - - - - - - - - - - - -
                                    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                    -
                                    -
                                    -PrevUpHomeNext -
                                    -
                                    -
                                    -
                                    -

                                    Struct template result<This(First, Second)>

                                    -

                                    boost::proto::functional::make_pair::result<This(First, Second)>

                                    -
                                    -

                                    Synopsis

                                    -
                                    // In header: <boost/proto/functional/std/utility.hpp>
-
-
-template<typename This, typename First, typename Second> 
-struct result<This(First, Second)> {
-  // types
-  typedef std::pair<
-        typename boost::remove_const<typename boost::remove_reference<First>::type>::type
-      , typename boost::remove_const<typename boost::remove_reference<Second>::type>::type
-    > type;
-};
                                    -
                                    - - - -
                                    Copyright © 2008 Eric Niebler

                                    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                    -
                                    -
                                    -
                                    -PrevUpHomeNext -
                                    - - diff --git a/doc/html/boost/proto/functional/next.html b/doc/html/boost/proto/functional/next.html index 4847f96435..792d681720 100644 --- a/doc/html/boost/proto/functional/next.html +++ b/doc/html/boost/proto/functional/next.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
                                    -PrevUpHomeNext +PrevUpHomeNext
                                    @@ -37,37 +37,37 @@ struct next : proto::callable { // member classes/structs/unions template<typename This, typename ForwardIterator> - struct result<This(ForwardIterator)> { + struct result<This(ForwardIterator)> { // types typedef typename boost::remove_const< typename boost::remove_reference<ForwardIterator>::type - >::type type; + >::type type; }; template<typename This, typename ForwardIterator, typename Distance> - struct result<This(ForwardIterator, Distance)> { + struct result<This(ForwardIterator, Distance)> { // types typedef typename boost::remove_const< typename boost::remove_reference<ForwardIterator>::type - >::type type; + >::type type; }; - // public member functions - template<typename ForwardIterator> void operator()(ForwardIterator) const; + // public member functions + template<typename ForwardIterator> void operator()(ForwardIterator) const; template<typename ForwardIterator> - void operator()(ForwardIterator, + void operator()(ForwardIterator, typename std::iterator_traits<ForwardIterator>::difference_type) const; };
                                    -

                                    Description

                                    +

                                    Description

                                    A PolymorphicFunctionObject type that invokes the std::next() function on its arguments.

                                    -

                                    -next public member functions

                                    +

                                    +next public member functions

                                    1. -
                                      template<typename ForwardIterator> void operator()(ForwardIterator x) const;
                                      +
                                      template<typename ForwardIterator> void operator()(ForwardIterator x) const;
                                      @@ -81,7 +81,7 @@ 
                                    2. template<typename ForwardIterator> 
-  void operator()(ForwardIterator x, 
+  void operator()(ForwardIterator x, 
                   typename std::iterator_traits<ForwardIterator>::difference_type n) const;
                                      3. @@ -108,7 +108,7 @@
                                      -PrevUpHomeNext +PrevUpHomeNext
                                      diff --git a/doc/html/boost/proto/functional/next/result_T_idm45506975502464.html b/doc/html/boost/proto/functional/next/result_T_idm45506975502464.html new file mode 100644 index 0000000000..ede0b6dbde --- /dev/null +++ b/doc/html/boost/proto/functional/next/result_T_idm45506975502464.html @@ -0,0 +1,57 @@ + + + + +Struct template result<This(ForwardIterator, Distance)> + + + + + + + + + + + + + + + +
                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                      +
                                      +
                                      +PrevUpHomeNext +
                                      +
                                      +
                                      +
                                      +

                                      Struct template result<This(ForwardIterator, Distance)>

                                      +

                                      boost::proto::functional::next::result<This(ForwardIterator, Distance)>

                                      +
                                      +

                                      Synopsis

                                      +
                                      // In header: <boost/proto/functional/std/iterator.hpp>
+
+
+template<typename This, typename ForwardIterator, typename Distance> 
+struct result<This(ForwardIterator, Distance)> {
+  // types
+  typedef typename boost::remove_const<
+      typename boost::remove_reference<ForwardIterator>::type
+    >::type type;
+};
                                      +
                                      + + + +
                                      Copyright © 2008 Eric Niebler

                                      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                      +
                                      +
                                      +
                                      +PrevUpHomeNext +
                                      + + diff --git a/doc/html/boost/proto/functional/next/result_T_idm45506975506896.html b/doc/html/boost/proto/functional/next/result_T_idm45506975506896.html new file mode 100644 index 0000000000..c21da49f4f --- /dev/null +++ b/doc/html/boost/proto/functional/next/result_T_idm45506975506896.html @@ -0,0 +1,57 @@ + + + + +Struct template result<This(ForwardIterator)> + + + + + + + + + + + + + + + +
                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                      +
                                      +
                                      +PrevUpHomeNext +
                                      +
                                      +
                                      +
                                      +

                                      Struct template result<This(ForwardIterator)>

                                      +

                                      boost::proto::functional::next::result<This(ForwardIterator)>

                                      +
                                      +

                                      Synopsis

                                      +
                                      // In header: <boost/proto/functional/std/iterator.hpp>
+
+
+template<typename This, typename ForwardIterator> 
+struct result<This(ForwardIterator)> {
+  // types
+  typedef typename boost::remove_const<
+      typename boost::remove_reference<ForwardIterator>::type
+    >::type type;
+};
                                      +
                                      + + + +
                                      Copyright © 2008 Eric Niebler

                                      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                      +
                                      +
                                      +
                                      +PrevUpHomeNext +
                                      + + diff --git a/doc/html/boost/proto/functional/next/result_This_F_idp204516480.html b/doc/html/boost/proto/functional/next/result_This_F_idp204516480.html deleted file mode 100644 index fcbf4f1676..0000000000 --- a/doc/html/boost/proto/functional/next/result_This_F_idp204516480.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Struct template result<This(ForwardIterator)> - - - - - - - - - - - - - - - -
                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                      -
                                      -
                                      -PrevUpHomeNext -
                                      -
                                      -
                                      -
                                      -

                                      Struct template result<This(ForwardIterator)>

                                      -

                                      boost::proto::functional::next::result<This(ForwardIterator)>

                                      -
                                      -

                                      Synopsis

                                      -
                                      // In header: <boost/proto/functional/std/iterator.hpp>
-
-
-template<typename This, typename ForwardIterator> 
-struct result<This(ForwardIterator)> {
-  // types
-  typedef typename boost::remove_const<
-      typename boost::remove_reference<ForwardIterator>::type
-    >::type type;
-};
                                      -
                                      - - - -
                                      Copyright © 2008 Eric Niebler

                                      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                      -
                                      -
                                      -
                                      -PrevUpHomeNext -
                                      - - diff --git a/doc/html/boost/proto/functional/next/result_This_F_idp204520912.html b/doc/html/boost/proto/functional/next/result_This_F_idp204520912.html deleted file mode 100644 index 89c5e63bca..0000000000 --- a/doc/html/boost/proto/functional/next/result_This_F_idp204520912.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Struct template result<This(ForwardIterator, Distance)> - - - - - - - - - - - - - - - -
                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                      -
                                      -
                                      -PrevUpHomeNext -
                                      -
                                      -
                                      -
                                      -

                                      Struct template result<This(ForwardIterator, Distance)>

                                      -

                                      boost::proto::functional::next::result<This(ForwardIterator, Distance)>

                                      -
                                      -

                                      Synopsis

                                      -
                                      // In header: <boost/proto/functional/std/iterator.hpp>
-
-
-template<typename This, typename ForwardIterator, typename Distance> 
-struct result<This(ForwardIterator, Distance)> {
-  // types
-  typedef typename boost::remove_const<
-      typename boost::remove_reference<ForwardIterator>::type
-    >::type type;
-};
                                      -
                                      - - - -
                                      Copyright © 2008 Eric Niebler

                                      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                      -
                                      -
                                      -
                                      -PrevUpHomeNext -
                                      - - diff --git a/doc/html/boost/proto/functional/pop_back.html b/doc/html/boost/proto/functional/pop_back.html index 9671503587..4881210319 100644 --- a/doc/html/boost/proto/functional/pop_back.html +++ b/doc/html/boost/proto/functional/pop_back.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
                                      -PrevUpHomeNext +PrevUpHomeNext
                                      @@ -37,33 +37,33 @@ struct pop_back : proto::callable { // member classes/structs/unions template<typename This, typename Seq> - struct result<This(Seq)> : result< This(Seq const &) > { + struct result<This(Seq)> : result< This(Seq const &) > { }; template<typename This, typename Seq> - struct result<This(Seq &)> : fusion::result_of::pop_back< Seq > { + struct result<This(Seq &)> : fusion::result_of::pop_back< Seq > { }; - // public member functions + // public member functions template<typename Seq> - typename fusion::result_of::pop_back< Seq >::type operator()(Seq &) const; + typename fusion::result_of::pop_back< Seq >::type operator()(Seq &) const; template<typename Seq> typename fusion::result_of::pop_back< Seq const >::type - operator()(Seq const &) const; + operator()(Seq const &) const; };
                                      -

                                      Description

                                      +

                                      Description

                                      A PolymorphicFunctionObject type that invokes the fusion::pop_back() algorithm on its argument.

                                      -

                                      -pop_back public member functions

                                      +

                                      +pop_back public member functions

                                      1. template<typename Seq> 
   typename fusion::result_of::pop_back< Seq >::type 
-  operator()(Seq & seq) const;
                                        + operator()(Seq & seq) const;
                                        @@ -78,7 +78,7 @@ 
                                      2. template<typename Seq> 
   typename fusion::result_of::pop_back< Seq const >::type 
-  operator()(Seq const & seq) const;
                                        + operator()(Seq const & seq) const;
                                        3. @@ -104,7 +104,7 @@
                                        -PrevUpHomeNext +PrevUpHomeNext
                                        diff --git a/doc/html/boost/proto/functional/pop_back/result_T_idm45506975795264.html b/doc/html/boost/proto/functional/pop_back/result_T_idm45506975795264.html new file mode 100644 index 0000000000..c7edfef87e --- /dev/null +++ b/doc/html/boost/proto/functional/pop_back/result_T_idm45506975795264.html @@ -0,0 +1,53 @@ + + + + +Struct template result<This(Seq &)> + + + + + + + + + + + + + + + +
                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                        +
                                        +
                                        +PrevUpHomeNext +
                                        +
                                        +
                                        +
                                        +

                                        Struct template result<This(Seq &)>

                                        +

                                        boost::proto::functional::pop_back::result<This(Seq &)>

                                        +
                                        +

                                        Synopsis

                                        +
                                        // In header: <boost/proto/functional/fusion/pop_back.hpp>
+
+
+template<typename This, typename Seq> 
+struct result<This(Seq &)> :  fusion::result_of::pop_back< Seq > {
+};
                                        +
                                        + + + +
                                        Copyright © 2008 Eric Niebler

                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                        +
                                        +
                                        +
                                        +PrevUpHomeNext +
                                        + + diff --git a/doc/html/boost/proto/functional/pop_back/result_T_idm45506975799312.html b/doc/html/boost/proto/functional/pop_back/result_T_idm45506975799312.html new file mode 100644 index 0000000000..b121d233d0 --- /dev/null +++ b/doc/html/boost/proto/functional/pop_back/result_T_idm45506975799312.html @@ -0,0 +1,53 @@ + + + + +Struct template result<This(Seq)> + + + + + + + + + + + + + + + +
                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                        +
                                        +
                                        +PrevUpHomeNext +
                                        +
                                        +
                                        +
                                        +

                                        Struct template result<This(Seq)>

                                        +

                                        boost::proto::functional::pop_back::result<This(Seq)>

                                        +
                                        +

                                        Synopsis

                                        +
                                        // In header: <boost/proto/functional/fusion/pop_back.hpp>
+
+
+template<typename This, typename Seq> 
+struct result<This(Seq)> :  result< This(Seq const &) > {
+};
                                        +
                                        + + + +
                                        Copyright © 2008 Eric Niebler

                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                        +
                                        +
                                        +
                                        +PrevUpHomeNext +
                                        + + diff --git a/doc/html/boost/proto/functional/pop_back/result_This_S_idp204224064.html b/doc/html/boost/proto/functional/pop_back/result_This_S_idp204224064.html deleted file mode 100644 index ca5be9cdb0..0000000000 --- a/doc/html/boost/proto/functional/pop_back/result_This_S_idp204224064.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template result<This(Seq)> - - - - - - - - - - - - - - - -
                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                        -
                                        -
                                        -PrevUpHomeNext -
                                        -
                                        -
                                        -
                                        -

                                        Struct template result<This(Seq)>

                                        -

                                        boost::proto::functional::pop_back::result<This(Seq)>

                                        -
                                        -

                                        Synopsis

                                        -
                                        // In header: <boost/proto/functional/fusion/pop_back.hpp>
-
-
-template<typename This, typename Seq> 
-struct result<This(Seq)> :  result< This(Seq const &) > {
-};
                                        -
                                        - - - -
                                        Copyright © 2008 Eric Niebler

                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                        -
                                        -
                                        -
                                        -PrevUpHomeNext -
                                        - - diff --git a/doc/html/boost/proto/functional/pop_back/result_This_S_idp204228112.html b/doc/html/boost/proto/functional/pop_back/result_This_S_idp204228112.html deleted file mode 100644 index 70fd6fc019..0000000000 --- a/doc/html/boost/proto/functional/pop_back/result_This_S_idp204228112.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template result<This(Seq &)> - - - - - - - - - - - - - - - -
                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                        -
                                        -
                                        -PrevUpHomeNext -
                                        -
                                        -
                                        -
                                        -

                                        Struct template result<This(Seq &)>

                                        -

                                        boost::proto::functional::pop_back::result<This(Seq &)>

                                        -
                                        -

                                        Synopsis

                                        -
                                        // In header: <boost/proto/functional/fusion/pop_back.hpp>
-
-
-template<typename This, typename Seq> 
-struct result<This(Seq &)> :  fusion::result_of::pop_back< Seq > {
-};
                                        -
                                        - - - -
                                        Copyright © 2008 Eric Niebler

                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                        -
                                        -
                                        -
                                        -PrevUpHomeNext -
                                        - - diff --git a/doc/html/boost/proto/functional/pop_front.html b/doc/html/boost/proto/functional/pop_front.html index 76833dee6b..45511cdd96 100644 --- a/doc/html/boost/proto/functional/pop_front.html +++ b/doc/html/boost/proto/functional/pop_front.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
                                        -PrevUpHomeNext +PrevUpHomeNext
                                        @@ -37,21 +37,21 @@ struct pop_front : proto::callable { // member classes/structs/unions template<typename This, typename Seq> - struct result<This(Seq)> : result< This(Seq const &) > { + struct result<This(Seq)> : result< This(Seq const &) > { }; template<typename This, typename Seq> - struct result<This(Seq &)> : fusion::result_of::pop_front< Seq > { + struct result<This(Seq &)> : fusion::result_of::pop_front< Seq > { }; - // public member functions + // public member functions template<typename Seq> - typename fusion::result_of::pop_front< Seq >::type operator()(Seq &) const; + typename fusion::result_of::pop_front< Seq >::type operator()(Seq &) const; template<typename Seq> typename fusion::result_of::pop_front< Seq const >::type - operator()(Seq const &) const; + operator()(Seq const &) const; };
                                        -

                                        Description

                                        +

                                        Description

                                        A PolymorphicFunctionObject type that invokes the fusion::pop_front() algorithm on its argument. This is @@ -62,13 +62,13 @@ transform; that is, fold all but the first child.

                                        -

                                        -pop_front public member functions

                                        +

                                        +pop_front public member functions

                                        1. template<typename Seq> 
   typename fusion::result_of::pop_front< Seq >::type 
-  operator()(Seq & seq) const;
                                          + operator()(Seq & seq) const;
                                          @@ -83,7 +83,7 @@ 
                                        2. template<typename Seq> 
   typename fusion::result_of::pop_front< Seq const >::type 
-  operator()(Seq const & seq) const;
                                          + operator()(Seq const & seq) const;
                                          3. @@ -109,7 +109,7 @@
                                          -PrevUpHomeNext +PrevUpHomeNext
                                          diff --git a/doc/html/boost/proto/functional/pop_front/result_T_idm45506975765328.html b/doc/html/boost/proto/functional/pop_front/result_T_idm45506975765328.html new file mode 100644 index 0000000000..e7f6923762 --- /dev/null +++ b/doc/html/boost/proto/functional/pop_front/result_T_idm45506975765328.html @@ -0,0 +1,53 @@ + + + + +Struct template result<This(Seq &)> + + + + + + + + + + + + + + + +
                                          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                          +
                                          +
                                          +PrevUpHomeNext +
                                          +
                                          +
                                          +
                                          +

                                          Struct template result<This(Seq &)>

                                          +

                                          boost::proto::functional::pop_front::result<This(Seq &)>

                                          +
                                          +

                                          Synopsis

                                          +
                                          // In header: <boost/proto/functional/fusion/pop_front.hpp>
+
+
+template<typename This, typename Seq> 
+struct result<This(Seq &)> :  fusion::result_of::pop_front< Seq > {
+};
                                          +
                                          + + + +
                                          Copyright © 2008 Eric Niebler

                                          + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                          +
                                          +
                                          +
                                          +PrevUpHomeNext +
                                          + + diff --git a/doc/html/boost/proto/functional/pop_front/result_T_idm45506975769376.html b/doc/html/boost/proto/functional/pop_front/result_T_idm45506975769376.html new file mode 100644 index 0000000000..99d3852150 --- /dev/null +++ b/doc/html/boost/proto/functional/pop_front/result_T_idm45506975769376.html @@ -0,0 +1,53 @@ + + + + +Struct template result<This(Seq)> + + + + + + + + + + + + + + + +
                                          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                          +
                                          +
                                          +PrevUpHomeNext +
                                          +
                                          +
                                          +
                                          +

                                          Struct template result<This(Seq)>

                                          +

                                          boost::proto::functional::pop_front::result<This(Seq)>

                                          +
                                          +

                                          Synopsis

                                          +
                                          // In header: <boost/proto/functional/fusion/pop_front.hpp>
+
+
+template<typename This, typename Seq> 
+struct result<This(Seq)> :  result< This(Seq const &) > {
+};
                                          +
                                          + + + +
                                          Copyright © 2008 Eric Niebler

                                          + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                          +
                                          +
                                          +
                                          +PrevUpHomeNext +
                                          + + diff --git a/doc/html/boost/proto/functional/pop_front/result_This_S_idp204254000.html b/doc/html/boost/proto/functional/pop_front/result_This_S_idp204254000.html deleted file mode 100644 index 876ae6a7a3..0000000000 --- a/doc/html/boost/proto/functional/pop_front/result_This_S_idp204254000.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template result<This(Seq)> - - - - - - - - - - - - - - - -
                                          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                          -
                                          -
                                          -PrevUpHomeNext -
                                          -
                                          -
                                          -
                                          -

                                          Struct template result<This(Seq)>

                                          -

                                          boost::proto::functional::pop_front::result<This(Seq)>

                                          -
                                          -

                                          Synopsis

                                          -
                                          // In header: <boost/proto/functional/fusion/pop_front.hpp>
-
-
-template<typename This, typename Seq> 
-struct result<This(Seq)> :  result< This(Seq const &) > {
-};
                                          -
                                          - - - -
                                          Copyright © 2008 Eric Niebler

                                          - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                          -
                                          -
                                          -
                                          -PrevUpHomeNext -
                                          - - diff --git a/doc/html/boost/proto/functional/pop_front/result_This_S_idp204258048.html b/doc/html/boost/proto/functional/pop_front/result_This_S_idp204258048.html deleted file mode 100644 index 7eef3a7eca..0000000000 --- a/doc/html/boost/proto/functional/pop_front/result_This_S_idp204258048.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template result<This(Seq &)> - - - - - - - - - - - - - - - -
                                          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                          -
                                          -
                                          -PrevUpHomeNext -
                                          -
                                          -
                                          -
                                          -

                                          Struct template result<This(Seq &)>

                                          -

                                          boost::proto::functional::pop_front::result<This(Seq &)>

                                          -
                                          -

                                          Synopsis

                                          -
                                          // In header: <boost/proto/functional/fusion/pop_front.hpp>
-
-
-template<typename This, typename Seq> 
-struct result<This(Seq &)> :  fusion::result_of::pop_front< Seq > {
-};
                                          -
                                          - - - -
                                          Copyright © 2008 Eric Niebler

                                          - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                          -
                                          -
                                          -
                                          -PrevUpHomeNext -
                                          - - diff --git a/doc/html/boost/proto/functional/prior.html b/doc/html/boost/proto/functional/prior.html index 910343af29..6f0d92b231 100644 --- a/doc/html/boost/proto/functional/prior.html +++ b/doc/html/boost/proto/functional/prior.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
                                          -PrevUpHomeNext +PrevUpHomeNext
                                          @@ -37,39 +37,39 @@ struct prior : proto::callable { // member classes/structs/unions template<typename This, typename BidirectionalIterator> - struct result<This(BidirectionalIterator)> { + struct result<This(BidirectionalIterator)> { // types typedef typename boost::remove_const< typename boost::remove_reference<BidirectionalIterator>::type - >::type type; + >::type type; }; template<typename This, typename BidirectionalIterator, typename Distance> - struct result<This(BidirectionalIterator, Distance)> { + struct result<This(BidirectionalIterator, Distance)> { // types typedef typename boost::remove_const< typename boost::remove_reference<BidirectionalIterator>::type - >::type type; + >::type type; }; - // public member functions + // public member functions template<typename BidirectionalIterator> - void operator()(BidirectionalIterator) const; + void operator()(BidirectionalIterator) const; template<typename BidirectionalIterator> - void operator()(BidirectionalIterator, + void operator()(BidirectionalIterator, typename std::iterator_traits<BidirectionalIterator>::difference_type) const; };
                                          -

                                          Description

                                          +

                                          Description

                                          A PolymorphicFunctionObject type that invokes the std::prior() function on its arguments.

                                          -

                                          -prior public member functions

                                          +

                                          +prior public member functions

                                          1. template<typename BidirectionalIterator> 
-  void operator()(BidirectionalIterator x) const;
                                            + void operator()(BidirectionalIterator x) const;
                                            @@ -83,7 +83,7 @@ 
                                          2. template<typename BidirectionalIterator> 
-  void operator()(BidirectionalIterator x, 
+  void operator()(BidirectionalIterator x, 
                   typename std::iterator_traits<BidirectionalIterator>::difference_type n) const;
                                            3. @@ -110,7 +110,7 @@
                                            -PrevUpHomeNext +PrevUpHomeNext
                                            diff --git a/doc/html/boost/proto/functional/prior/result_T_idm45506975476896.html b/doc/html/boost/proto/functional/prior/result_T_idm45506975476896.html new file mode 100644 index 0000000000..b21825e199 --- /dev/null +++ b/doc/html/boost/proto/functional/prior/result_T_idm45506975476896.html @@ -0,0 +1,57 @@ + + + + +Struct template result<This(BidirectionalIterator, Distance)> + + + + + + + + + + + + + + + +
                                            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                            +
                                            +
                                            +PrevUpHomeNext +
                                            +
                                            +
                                            +
                                            +

                                            Struct template result<This(BidirectionalIterator, Distance)>

                                            +

                                            boost::proto::functional::prior::result<This(BidirectionalIterator, Distance)>

                                            +
                                            +

                                            Synopsis

                                            +
                                            // In header: <boost/proto/functional/std/iterator.hpp>
+
+
+template<typename This, typename BidirectionalIterator, typename Distance> 
+struct result<This(BidirectionalIterator, Distance)> {
+  // types
+  typedef typename boost::remove_const<
+      typename boost::remove_reference<BidirectionalIterator>::type
+    >::type type;
+};
                                            +
                                            + + + +
                                            Copyright © 2008 Eric Niebler

                                            + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                            +
                                            +
                                            +
                                            +PrevUpHomeNext +
                                            + + diff --git a/doc/html/boost/proto/functional/prior/result_T_idm45506975481312.html b/doc/html/boost/proto/functional/prior/result_T_idm45506975481312.html new file mode 100644 index 0000000000..5261b5d544 --- /dev/null +++ b/doc/html/boost/proto/functional/prior/result_T_idm45506975481312.html @@ -0,0 +1,57 @@ + + + + +Struct template result<This(BidirectionalIterator)> + + + + + + + + + + + + + + + +
                                            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                            +
                                            +
                                            +PrevUpHomeNext +
                                            +
                                            +
                                            +
                                            +

                                            Struct template result<This(BidirectionalIterator)>

                                            +

                                            boost::proto::functional::prior::result<This(BidirectionalIterator)>

                                            +
                                            +

                                            Synopsis

                                            +
                                            // In header: <boost/proto/functional/std/iterator.hpp>
+
+
+template<typename This, typename BidirectionalIterator> 
+struct result<This(BidirectionalIterator)> {
+  // types
+  typedef typename boost::remove_const<
+      typename boost::remove_reference<BidirectionalIterator>::type
+    >::type type;
+};
                                            +
                                            + + + +
                                            Copyright © 2008 Eric Niebler

                                            + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                            +
                                            +
                                            +
                                            +PrevUpHomeNext +
                                            + + diff --git a/doc/html/boost/proto/functional/prior/result_This_B_idp204542064.html b/doc/html/boost/proto/functional/prior/result_This_B_idp204542064.html deleted file mode 100644 index f957aeba99..0000000000 --- a/doc/html/boost/proto/functional/prior/result_This_B_idp204542064.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Struct template result<This(BidirectionalIterator)> - - - - - - - - - - - - - - - -
                                            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                            -
                                            -
                                            -PrevUpHomeNext -
                                            -
                                            -
                                            -
                                            -

                                            Struct template result<This(BidirectionalIterator)>

                                            -

                                            boost::proto::functional::prior::result<This(BidirectionalIterator)>

                                            -
                                            -

                                            Synopsis

                                            -
                                            // In header: <boost/proto/functional/std/iterator.hpp>
-
-
-template<typename This, typename BidirectionalIterator> 
-struct result<This(BidirectionalIterator)> {
-  // types
-  typedef typename boost::remove_const<
-      typename boost::remove_reference<BidirectionalIterator>::type
-    >::type type;
-};
                                            -
                                            - - - -
                                            Copyright © 2008 Eric Niebler

                                            - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                            -
                                            -
                                            -
                                            -PrevUpHomeNext -
                                            - - diff --git a/doc/html/boost/proto/functional/prior/result_This_B_idp204546480.html b/doc/html/boost/proto/functional/prior/result_This_B_idp204546480.html deleted file mode 100644 index 8b3e541310..0000000000 --- a/doc/html/boost/proto/functional/prior/result_This_B_idp204546480.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Struct template result<This(BidirectionalIterator, Distance)> - - - - - - - - - - - - - - - -
                                            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                            -
                                            -
                                            -PrevUpHomeNext -
                                            -
                                            -
                                            -
                                            -

                                            Struct template result<This(BidirectionalIterator, Distance)>

                                            -

                                            boost::proto::functional::prior::result<This(BidirectionalIterator, Distance)>

                                            -
                                            -

                                            Synopsis

                                            -
                                            // In header: <boost/proto/functional/std/iterator.hpp>
-
-
-template<typename This, typename BidirectionalIterator, typename Distance> 
-struct result<This(BidirectionalIterator, Distance)> {
-  // types
-  typedef typename boost::remove_const<
-      typename boost::remove_reference<BidirectionalIterator>::type
-    >::type type;
-};
                                            -
                                            - - - -
                                            Copyright © 2008 Eric Niebler

                                            - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                            -
                                            -
                                            -
                                            -PrevUpHomeNext -
                                            - - diff --git a/doc/html/boost/proto/functional/push_back.html b/doc/html/boost/proto/functional/push_back.html index dd4554e125..5178a14c05 100644 --- a/doc/html/boost/proto/functional/push_back.html +++ b/doc/html/boost/proto/functional/push_back.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
                                            -PrevUpHomeNext +PrevUpHomeNext
                                            @@ -37,30 +37,30 @@ struct push_back : proto::callable { // member classes/structs/unions template<typename This, typename Seq, typename T> - struct result<This(Seq, T)> : fusion::result_of::push_back< + struct result<This(Seq, T)> : fusion::result_of::push_back< typename boost::add_const<typename boost::remove_reference<Seq>::type>::type , typename boost::remove_const<typename boost::remove_reference<T>::type>::type > { }; - // public member functions + // public member functions template<typename Seq, typename T> typename fusion::result_of::push_back< Seq const, T >::type - operator()(Seq const &, T const &) const; + operator()(Seq const &, T const &) const; };
                                            -

                                            Description

                                            +

                                            Description

                                            A PolymorphicFunctionObject type that invokes the fusion::push_back() algorithm on its arguments.

                                            -

                                            -push_back public member functions

                                            +

                                            +push_back public member functions

                                            1. template<typename Seq, typename T> 
   typename fusion::result_of::push_back< Seq const, T >::type 
-  operator()(Seq const & seq, T const & t) const;
                                              + operator()(Seq const & seq, T const & t) const;
                                              @@ -85,7 +85,7 @@
                                              -PrevUpHomeNext +PrevUpHomeNext
                                              diff --git a/doc/html/boost/proto/functional/push_back/result_T_idm45506975741456.html b/doc/html/boost/proto/functional/push_back/result_T_idm45506975741456.html new file mode 100644 index 0000000000..f26ddc35cd --- /dev/null +++ b/doc/html/boost/proto/functional/push_back/result_T_idm45506975741456.html @@ -0,0 +1,57 @@ + + + + +Struct template result<This(Seq, T)> + + + + + + + + + + + + + + + +
                                              Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                              +
                                              +
                                              +PrevUpHomeNext +
                                              +
                                              +
                                              +
                                              +

                                              Struct template result<This(Seq, T)>

                                              +

                                              boost::proto::functional::push_back::result<This(Seq, T)>

                                              +
                                              +

                                              Synopsis

                                              +
                                              // In header: <boost/proto/functional/fusion/push_back.hpp>
+
+
+template<typename This, typename Seq, typename T> 
+struct result<This(Seq, T)> :  fusion::result_of::push_back<
+      typename boost::add_const<typename boost::remove_reference<Seq>::type>::type
+    , typename boost::remove_const<typename boost::remove_reference<T>::type>::type
+  >
+{
+};
                                              +
                                              + + + +
                                              Copyright © 2008 Eric Niebler

                                              + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                              +
                                              +
                                              +
                                              +PrevUpHomeNext +
                                              + + diff --git a/doc/html/boost/proto/functional/push_back/result_This_S_idp204281920.html b/doc/html/boost/proto/functional/push_back/result_This_S_idp204281920.html deleted file mode 100644 index 87ac06798f..0000000000 --- a/doc/html/boost/proto/functional/push_back/result_This_S_idp204281920.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Struct template result<This(Seq, T)> - - - - - - - - - - - - - - - -
                                              Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                              -
                                              -
                                              -PrevUpHomeNext -
                                              -
                                              -
                                              -
                                              -

                                              Struct template result<This(Seq, T)>

                                              -

                                              boost::proto::functional::push_back::result<This(Seq, T)>

                                              -
                                              -

                                              Synopsis

                                              -
                                              // In header: <boost/proto/functional/fusion/push_back.hpp>
-
-
-template<typename This, typename Seq, typename T> 
-struct result<This(Seq, T)> :  fusion::result_of::push_back<
-      typename boost::add_const<typename boost::remove_reference<Seq>::type>::type
-    , typename boost::remove_const<typename boost::remove_reference<T>::type>::type
-  >
-{
-};
                                              -
                                              - - - -
                                              Copyright © 2008 Eric Niebler

                                              - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                              -
                                              -
                                              -
                                              -PrevUpHomeNext -
                                              - - diff --git a/doc/html/boost/proto/functional/push_front.html b/doc/html/boost/proto/functional/push_front.html index 948229b707..5925354f40 100644 --- a/doc/html/boost/proto/functional/push_front.html +++ b/doc/html/boost/proto/functional/push_front.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
                                              -PrevUpHomeNext +PrevUpHomeNext
                                              @@ -37,30 +37,30 @@ struct push_front : proto::callable { // member classes/structs/unions template<typename This, typename Seq, typename T> - struct result<This(Seq, T)> : fusion::result_of::push_front< + struct result<This(Seq, T)> : fusion::result_of::push_front< typename boost::add_const<typename boost::remove_reference<Seq>::type>::type , typename boost::remove_const<typename boost::remove_reference<T>::type>::type > { }; - // public member functions + // public member functions template<typename Seq, typename T> typename fusion::result_of::push_front< Seq const, T >::type - operator()(Seq const &, T const &) const; + operator()(Seq const &, T const &) const; };
                                              -

                                              Description

                                              +

                                              Description

                                              A PolymorphicFunctionObject type that invokes the fusion::push_front() algorithm on its arguments.

                                              -

                                              -push_front public member functions

                                              +

                                              +push_front public member functions

                                              1. template<typename Seq, typename T> 
   typename fusion::result_of::push_front< Seq const, T >::type 
-  operator()(Seq const & seq, T const & t) const;
                                                + operator()(Seq const & seq, T const & t) const;
                                                @@ -85,7 +85,7 @@
                                                -PrevUpHomeNext +PrevUpHomeNext
                                                diff --git a/doc/html/boost/proto/functional/push_front/result_T_idm45506975719776.html b/doc/html/boost/proto/functional/push_front/result_T_idm45506975719776.html new file mode 100644 index 0000000000..571521710c --- /dev/null +++ b/doc/html/boost/proto/functional/push_front/result_T_idm45506975719776.html @@ -0,0 +1,57 @@ + + + + +Struct template result<This(Seq, T)> + + + + + + + + + + + + + + + +
                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                +
                                                +
                                                +PrevUpHomeNext +
                                                +
                                                +
                                                +
                                                +

                                                Struct template result<This(Seq, T)>

                                                +

                                                boost::proto::functional::push_front::result<This(Seq, T)>

                                                +
                                                +

                                                Synopsis

                                                +
                                                // In header: <boost/proto/functional/fusion/push_front.hpp>
+
+
+template<typename This, typename Seq, typename T> 
+struct result<This(Seq, T)> :  fusion::result_of::push_front<
+      typename boost::add_const<typename boost::remove_reference<Seq>::type>::type
+    , typename boost::remove_const<typename boost::remove_reference<T>::type>::type
+  >
+{
+};
                                                +
                                                + + + +
                                                Copyright © 2008 Eric Niebler

                                                + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                +
                                                +
                                                +
                                                +PrevUpHomeNext +
                                                + + diff --git a/doc/html/boost/proto/functional/push_front/result_This_S_idp204303600.html b/doc/html/boost/proto/functional/push_front/result_This_S_idp204303600.html deleted file mode 100644 index a479c2e62a..0000000000 --- a/doc/html/boost/proto/functional/push_front/result_This_S_idp204303600.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Struct template result<This(Seq, T)> - - - - - - - - - - - - - - - -
                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                -
                                                -
                                                -PrevUpHomeNext -
                                                -
                                                -
                                                -
                                                -

                                                Struct template result<This(Seq, T)>

                                                -

                                                boost::proto::functional::push_front::result<This(Seq, T)>

                                                -
                                                -

                                                Synopsis

                                                -
                                                // In header: <boost/proto/functional/fusion/push_front.hpp>
-
-
-template<typename This, typename Seq, typename T> 
-struct result<This(Seq, T)> :  fusion::result_of::push_front<
-      typename boost::add_const<typename boost::remove_reference<Seq>::type>::type
-    , typename boost::remove_const<typename boost::remove_reference<T>::type>::type
-  >
-{
-};
                                                -
                                                - - - -
                                                Copyright © 2008 Eric Niebler

                                                - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                -
                                                -
                                                -
                                                -PrevUpHomeNext -
                                                - - diff --git a/doc/html/boost/proto/functional/rbegin.html b/doc/html/boost/proto/functional/rbegin.html index 9843cf67c3..cb0bf60018 100644 --- a/doc/html/boost/proto/functional/rbegin.html +++ b/doc/html/boost/proto/functional/rbegin.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
                                                -PrevUpHomeNext +PrevUpHomeNext
                                                @@ -37,33 +37,33 @@ struct rbegin : proto::callable { // member classes/structs/unions template<typename This, typename Range> - struct result<This(Range)> : boost::range_reverse_iterator< + struct result<This(Range)> : boost::range_reverse_iterator< typename boost::remove_reference<Range>::type > { }; - // public member functions + // public member functions template<typename Range> typename boost::range_reverse_iterator< Range >::type - operator()(Range &) const; + operator()(Range &) const; template<typename Range> typename boost::range_reverse_iterator< Range const >::type - operator()(Range const &) const; + operator()(Range const &) const; };
                                                -

                                                Description

                                                +

                                                Description

                                                A PolymorphicFunctionObject type that invokes the boost::rbegin() accessor function on its arguments.

                                                -

                                                -rbegin public member functions

                                                +

                                                +rbegin public member functions

                                                1. template<typename Range> 
   typename boost::range_reverse_iterator< Range >::type 
-  operator()(Range & rng) const;
                                                  + operator()(Range & rng) const;
                                                  @@ -78,7 +78,7 @@ 
                                                2. template<typename Range> 
   typename boost::range_reverse_iterator< Range const >::type 
-  operator()(Range const & rng) const;
                                                  + operator()(Range const & rng) const;
                                                  3. @@ -104,7 +104,7 @@
                                                  -PrevUpHomeNext +PrevUpHomeNext
                                                  diff --git a/doc/html/boost/proto/functional/rbegin/result_T_idm45506975605520.html b/doc/html/boost/proto/functional/rbegin/result_T_idm45506975605520.html new file mode 100644 index 0000000000..0e9a1d257c --- /dev/null +++ b/doc/html/boost/proto/functional/rbegin/result_T_idm45506975605520.html @@ -0,0 +1,56 @@ + + + + +Struct template result<This(Range)> + + + + + + + + + + + + + + + +
                                                  Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                  +
                                                  +
                                                  +PrevUpHomeNext +
                                                  +
                                                  +
                                                  +
                                                  +

                                                  Struct template result<This(Range)>

                                                  +

                                                  boost::proto::functional::rbegin::result<This(Range)>

                                                  +
                                                  +

                                                  Synopsis

                                                  +
                                                  // In header: <boost/proto/functional/range/rbegin.hpp>
+
+
+template<typename This, typename Range> 
+struct result<This(Range)> :  boost::range_reverse_iterator<
+      typename boost::remove_reference<Range>::type
+  >
+{
+};
                                                  +
                                                  + + + +
                                                  Copyright © 2008 Eric Niebler

                                                  + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                  +
                                                  +
                                                  +
                                                  +PrevUpHomeNext +
                                                  + + diff --git a/doc/html/boost/proto/functional/rbegin/result_This_R_idp204417856.html b/doc/html/boost/proto/functional/rbegin/result_This_R_idp204417856.html deleted file mode 100644 index b3f6b76c0a..0000000000 --- a/doc/html/boost/proto/functional/rbegin/result_This_R_idp204417856.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Struct template result<This(Range)> - - - - - - - - - - - - - - - -
                                                  Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                  -
                                                  -
                                                  -PrevUpHomeNext -
                                                  -
                                                  -
                                                  -
                                                  -

                                                  Struct template result<This(Range)>

                                                  -

                                                  boost::proto::functional::rbegin::result<This(Range)>

                                                  -
                                                  -

                                                  Synopsis

                                                  -
                                                  // In header: <boost/proto/functional/range/rbegin.hpp>
-
-
-template<typename This, typename Range> 
-struct result<This(Range)> :  boost::range_reverse_iterator<
-      typename boost::remove_reference<Range>::type
-  >
-{
-};
                                                  -
                                                  - - - -
                                                  Copyright © 2008 Eric Niebler

                                                  - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                  -
                                                  -
                                                  -
                                                  -PrevUpHomeNext -
                                                  - - diff --git a/doc/html/boost/proto/functional/rend.html b/doc/html/boost/proto/functional/rend.html index 7fb652cb34..b23e6cb95b 100644 --- a/doc/html/boost/proto/functional/rend.html +++ b/doc/html/boost/proto/functional/rend.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
                                                  -PrevUpHomeNext +PrevUpHomeNext
                                                  @@ -37,33 +37,33 @@ struct rend : proto::callable { // member classes/structs/unions template<typename This, typename Range> - struct result<This(Range)> : boost::range_reverse_iterator< + struct result<This(Range)> : boost::range_reverse_iterator< typename boost::remove_reference<Range>::type > { }; - // public member functions + // public member functions template<typename Range> typename boost::range_reverse_iterator< Range >::type - operator()(Range &) const; + operator()(Range &) const; template<typename Range> typename boost::range_reverse_iterator< Range const >::type - operator()(Range const &) const; + operator()(Range const &) const; };
                                                  -

                                                  Description

                                                  +

                                                  Description

                                                  A PolymorphicFunctionObject type that invokes the boost::rend() accessor function on its arguments.

                                                  -

                                                  -rend public member functions

                                                  +

                                                  +rend public member functions

                                                  1. template<typename Range> 
   typename boost::range_reverse_iterator< Range >::type 
-  operator()(Range & rng) const;
                                                    + operator()(Range & rng) const;
                                                    @@ -78,7 +78,7 @@ 
                                                  2. template<typename Range> 
   typename boost::range_reverse_iterator< Range const >::type 
-  operator()(Range const & rng) const;
                                                    + operator()(Range const & rng) const;
                                                    3. @@ -104,7 +104,7 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    diff --git a/doc/html/boost/proto/functional/rend/result_T_idm45506975581680.html b/doc/html/boost/proto/functional/rend/result_T_idm45506975581680.html new file mode 100644 index 0000000000..607fa473bc --- /dev/null +++ b/doc/html/boost/proto/functional/rend/result_T_idm45506975581680.html @@ -0,0 +1,56 @@ + + + + +Struct template result<This(Range)> + + + + + + + + + + + + + + + +
                                                    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                    +
                                                    +
                                                    +PrevUpHomeNext +
                                                    +
                                                    +
                                                    +
                                                    +

                                                    Struct template result<This(Range)>

                                                    +

                                                    boost::proto::functional::rend::result<This(Range)>

                                                    +
                                                    +

                                                    Synopsis

                                                    +
                                                    // In header: <boost/proto/functional/range/rend.hpp>
+
+
+template<typename This, typename Range> 
+struct result<This(Range)> :  boost::range_reverse_iterator<
+      typename boost::remove_reference<Range>::type
+  >
+{
+};
                                                    +
                                                    + + + +
                                                    Copyright © 2008 Eric Niebler

                                                    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                    +
                                                    +
                                                    +
                                                    +PrevUpHomeNext +
                                                    + + diff --git a/doc/html/boost/proto/functional/rend/result_This_R_idp204441696.html b/doc/html/boost/proto/functional/rend/result_This_R_idp204441696.html deleted file mode 100644 index fdf4544d54..0000000000 --- a/doc/html/boost/proto/functional/rend/result_This_R_idp204441696.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Struct template result<This(Range)> - - - - - - - - - - - - - - - -
                                                    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                    -
                                                    -
                                                    -PrevUpHomeNext -
                                                    -
                                                    -
                                                    -
                                                    -

                                                    Struct template result<This(Range)>

                                                    -

                                                    boost::proto::functional::rend::result<This(Range)>

                                                    -
                                                    -

                                                    Synopsis

                                                    -
                                                    // In header: <boost/proto/functional/range/rend.hpp>
-
-
-template<typename This, typename Range> 
-struct result<This(Range)> :  boost::range_reverse_iterator<
-      typename boost::remove_reference<Range>::type
-  >
-{
-};
                                                    -
                                                    - - - -
                                                    Copyright © 2008 Eric Niebler

                                                    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                    -
                                                    -
                                                    -
                                                    -PrevUpHomeNext -
                                                    - - diff --git a/doc/html/boost/proto/functional/reverse.html b/doc/html/boost/proto/functional/reverse.html index 5cf5358eb2..82747ee3ce 100644 --- a/doc/html/boost/proto/functional/reverse.html +++ b/doc/html/boost/proto/functional/reverse.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    @@ -38,21 +38,21 @@ struct reverse : proto::callable { // member classes/structs/unions template<typename This, typename Seq> - struct result<This(Seq)> : result< This(Seq const &) > { + struct result<This(Seq)> : result< This(Seq const &) > { }; template<typename This, typename Seq> - struct result<This(Seq &)> : fusion::result_of::reverse< Seq > { + struct result<This(Seq &)> : fusion::result_of::reverse< Seq > { }; - // public member functions + // public member functions template<typename Seq> - typename fusion::result_of::reverse< Seq >::type operator()(Seq &) const; + typename fusion::result_of::reverse< Seq >::type operator()(Seq &) const; template<typename Seq> typename fusion::result_of::reverse< Seq const >::type - operator()(Seq const &) const; + operator()(Seq const &) const; };
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    A PolymorphicFunctionObject type that invokes the fusion::reverse() algorithm on its argument. This is @@ -61,12 +61,12 @@ of a Proto expression node.

                                                    -

                                                    -reverse public member functions

                                                    +

                                                    +reverse public member functions

                                                    1. template<typename Seq> 
-  typename fusion::result_of::reverse< Seq >::type operator()(Seq & seq) const;
                                                      + typename fusion::result_of::reverse< Seq >::type operator()(Seq & seq) const;
                                                      @@ -81,7 +81,7 @@ 
                                                    2. template<typename Seq> 
   typename fusion::result_of::reverse< Seq const >::type 
-  operator()(Seq const & seq) const;
                                                      + operator()(Seq const & seq) const;
                                                      3. @@ -107,7 +107,7 @@
                                                      -PrevUpHomeNext +PrevUpHomeNext
                                                      diff --git a/doc/html/boost/proto/functional/reverse/result_T_idm45506975693040.html b/doc/html/boost/proto/functional/reverse/result_T_idm45506975693040.html new file mode 100644 index 0000000000..d63e266d46 --- /dev/null +++ b/doc/html/boost/proto/functional/reverse/result_T_idm45506975693040.html @@ -0,0 +1,53 @@ + + + + +Struct template result<This(Seq &)> + + + + + + + + + + + + + + + +
                                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                      +
                                                      +
                                                      +PrevUpHomeNext +
                                                      +
                                                      +
                                                      +
                                                      +

                                                      Struct template result<This(Seq &)>

                                                      +

                                                      boost::proto::functional::reverse::result<This(Seq &)>

                                                      +
                                                      +

                                                      Synopsis

                                                      +
                                                      // In header: <boost/proto/functional/fusion/reverse.hpp>
+
+
+template<typename This, typename Seq> 
+struct result<This(Seq &)> :  fusion::result_of::reverse< Seq > {
+};
                                                      +
                                                      + + + +
                                                      Copyright © 2008 Eric Niebler

                                                      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                      +
                                                      +
                                                      +
                                                      +PrevUpHomeNext +
                                                      + + diff --git a/doc/html/boost/proto/functional/reverse/result_T_idm45506975697088.html b/doc/html/boost/proto/functional/reverse/result_T_idm45506975697088.html new file mode 100644 index 0000000000..0080979ff0 --- /dev/null +++ b/doc/html/boost/proto/functional/reverse/result_T_idm45506975697088.html @@ -0,0 +1,53 @@ + + + + +Struct template result<This(Seq)> + + + + + + + + + + + + + + + +
                                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                      +
                                                      +
                                                      +PrevUpHomeNext +
                                                      +
                                                      +
                                                      +
                                                      +

                                                      Struct template result<This(Seq)>

                                                      +

                                                      boost::proto::functional::reverse::result<This(Seq)>

                                                      +
                                                      +

                                                      Synopsis

                                                      +
                                                      // In header: <boost/proto/functional/fusion/reverse.hpp>
+
+
+template<typename This, typename Seq> 
+struct result<This(Seq)> :  result< This(Seq const &) > {
+};
                                                      +
                                                      + + + +
                                                      Copyright © 2008 Eric Niebler

                                                      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                      +
                                                      +
                                                      +
                                                      +PrevUpHomeNext +
                                                      + + diff --git a/doc/html/boost/proto/functional/reverse/result_This_S_idp204326288.html b/doc/html/boost/proto/functional/reverse/result_This_S_idp204326288.html deleted file mode 100644 index b6c56e9b7c..0000000000 --- a/doc/html/boost/proto/functional/reverse/result_This_S_idp204326288.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template result<This(Seq)> - - - - - - - - - - - - - - - -
                                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                      -
                                                      -
                                                      -PrevUpHomeNext -
                                                      -
                                                      -
                                                      -
                                                      -

                                                      Struct template result<This(Seq)>

                                                      -

                                                      boost::proto::functional::reverse::result<This(Seq)>

                                                      -
                                                      -

                                                      Synopsis

                                                      -
                                                      // In header: <boost/proto/functional/fusion/reverse.hpp>
-
-
-template<typename This, typename Seq> 
-struct result<This(Seq)> :  result< This(Seq const &) > {
-};
                                                      -
                                                      - - - -
                                                      Copyright © 2008 Eric Niebler

                                                      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                      -
                                                      -
                                                      -
                                                      -PrevUpHomeNext -
                                                      - - diff --git a/doc/html/boost/proto/functional/reverse/result_This_S_idp204330336.html b/doc/html/boost/proto/functional/reverse/result_This_S_idp204330336.html deleted file mode 100644 index 146466eb64..0000000000 --- a/doc/html/boost/proto/functional/reverse/result_This_S_idp204330336.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template result<This(Seq &)> - - - - - - - - - - - - - - - -
                                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                      -
                                                      -
                                                      -PrevUpHomeNext -
                                                      -
                                                      -
                                                      -
                                                      -

                                                      Struct template result<This(Seq &)>

                                                      -

                                                      boost::proto::functional::reverse::result<This(Seq &)>

                                                      -
                                                      -

                                                      Synopsis

                                                      -
                                                      // In header: <boost/proto/functional/fusion/reverse.hpp>
-
-
-template<typename This, typename Seq> 
-struct result<This(Seq &)> :  fusion::result_of::reverse< Seq > {
-};
                                                      -
                                                      - - - -
                                                      Copyright © 2008 Eric Niebler

                                                      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                      -
                                                      -
                                                      -
                                                      -PrevUpHomeNext -
                                                      - - diff --git a/doc/html/boost/proto/functional/right.html b/doc/html/boost/proto/functional/right.html index f95622bd91..06df6d1417 100644 --- a/doc/html/boost/proto/functional/right.html +++ b/doc/html/boost/proto/functional/right.html @@ -7,8 +7,8 @@ - - + + @@ -21,14 +21,14 @@
                                                      -PrevUpHomeNext +PrevUpHomeNext

                                                      Struct right

                                                      boost::proto::functional::right — A callable PolymorphicFunctionObject that is equivalent to the - proto::right() function.

                                                      + proto::right() function.

                                                      Synopsis

                                                      // In header: <boost/proto/traits.hpp>
@@ -37,26 +37,26 @@
 struct right :  proto::callable {
   // member classes/structs/unions
   template<typename This, typename Expr> 
-  struct result<This(Expr)> :  proto::result_of::right< Expr > {
+  struct result<This(Expr)> :  proto::result_of::right< Expr > {
   };
 
-  // public member functions
+  // public member functions
   template<typename Expr> 
-    typename proto::result_of::right< Expr & >::type operator()(Expr &) const;
+    typename proto::result_of::right< Expr & >::type operator()(Expr &) const;
   template<typename Expr> 
     typename proto::result_of::right< Expr const & >::type 
-    operator()(Expr const &) const;
+    operator()(Expr const &) const;
 };
                                                      -

                                                      Description

                                                      +

                                                      Description

                                                      -

                                                      -right public member functions

                                                      +

                                                      +right public member functions

                                                      1. template<typename Expr> 
   typename proto::result_of::right< Expr & >::type 
-  operator()(Expr & expr) const;
                                                        + operator()(Expr & expr) const;

                                                        Return the right child of the given binary expression.

                                                        @@ -91,7 +91,7 @@ @@ -103,7 +103,7 @@ 
                                                      2. template<typename Expr> 
   typename proto::result_of::right< Expr const & >::type 
-  operator()(Expr const & expr) const;
                                                        3. + operator()(Exprconst& expr)const; @@ -118,7 +118,7 @@

                                                        Returns:

                                                        - proto::right(expr) + proto::right(expr)

                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                        diff --git a/doc/html/boost/proto/functional/right/result_T_idm45506973548368.html b/doc/html/boost/proto/functional/right/result_T_idm45506973548368.html new file mode 100644 index 0000000000..0fcb7d5a07 --- /dev/null +++ b/doc/html/boost/proto/functional/right/result_T_idm45506973548368.html @@ -0,0 +1,53 @@ + + + + +Struct template result<This(Expr)> + + + + + + + + + + + + + + + +
                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                        +
                                                        +
                                                        +PrevUpHomeNext +
                                                        +
                                                        +
                                                        +
                                                        +

                                                        Struct template result<This(Expr)>

                                                        +

                                                        boost::proto::functional::right::result<This(Expr)>

                                                        +
                                                        +

                                                        Synopsis

                                                        +
                                                        // In header: <boost/proto/traits.hpp>
+
+
+template<typename This, typename Expr> 
+struct result<This(Expr)> :  proto::result_of::right< Expr > {
+};
                                                        +
                                                        + + + +
                                                        Copyright © 2008 Eric Niebler

                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                        +
                                                        +
                                                        +
                                                        +PrevUpHomeNext +
                                                        + + diff --git a/doc/html/boost/proto/functional/right/result_This_E_idp226523328.html b/doc/html/boost/proto/functional/right/result_This_E_idp226523328.html deleted file mode 100644 index 1160cd8ed8..0000000000 --- a/doc/html/boost/proto/functional/right/result_This_E_idp226523328.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template result<This(Expr)> - - - - - - - - - - - - - - - -
                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                        -
                                                        -
                                                        -PrevUpHomeNext -
                                                        -
                                                        -
                                                        -
                                                        -

                                                        Struct template result<This(Expr)>

                                                        -

                                                        boost::proto::functional::right::result<This(Expr)>

                                                        -
                                                        -

                                                        Synopsis

                                                        -
                                                        // In header: <boost/proto/traits.hpp>
-
-
-template<typename This, typename Expr> 
-struct result<This(Expr)> :  proto::result_of::right< Expr > {
-};
                                                        -
                                                        - - - -
                                                        Copyright © 2008 Eric Niebler

                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                        -
                                                        -
                                                        -
                                                        -PrevUpHomeNext -
                                                        - - diff --git a/doc/html/boost/proto/functional/second.html b/doc/html/boost/proto/functional/second.html index 7e6137d095..3467732c5f 100644 --- a/doc/html/boost/proto/functional/second.html +++ b/doc/html/boost/proto/functional/second.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                        @@ -39,40 +39,40 @@ struct second : proto::callable { // member classes/structs/unions template<typename This, typename Pair> - struct result<This(Pair)> { + struct result<This(Pair)> { // types - typedef typename Pair::second_type type; + typedef typename Pair::second_type type; }; template<typename This, typename Pair> - struct result<This(Pair &)> { + struct result<This(Pair &)> { // types - typedef typename Pair::second_type & type; + typedef typename Pair::second_type & type; }; template<typename This, typename Pair> - struct result<This(Pair const &)> { + struct result<This(Pair const &)> { // types - typedef typename Pair::second_type const & type; + typedef typename Pair::second_type const & type; }; - // public member functions + // public member functions template<typename Pair> - typename Pair::second_type & operator()(Pair &) const; + typename Pair::second_type & operator()(Pair &) const; template<typename Pair> - typename Pair::second_type const & operator()(Pair const &) const; + typename Pair::second_type const & operator()(Pair const &) const; };
                                                        -

                                                        Description

                                                        +

                                                        Description

                                                        A PolymorphicFunctionObject type that returns the second element of a std::pair<>.

                                                        -

                                                        -second public member functions

                                                        +

                                                        +second public member functions

                                                        1. template<typename Pair> 
-  typename Pair::second_type & operator()(Pair & pair) const;
                                                          + typename Pair::second_type & operator()(Pair & pair) const;
                                                          @@ -88,7 +88,7 @@ 
                                                        2. template<typename Pair> 
-  typename Pair::second_type const & operator()(Pair const & pair) const;
                                                          + typename Pair::second_type const & operator()(Pair const & pair) const;
                                                          3. @@ -116,7 +116,7 @@
                                                          -PrevUpHomeNext +PrevUpHomeNext
                                                          diff --git a/doc/html/boost/proto/functional/second/result_T_idm45506975395760.html b/doc/html/boost/proto/functional/second/result_T_idm45506975395760.html new file mode 100644 index 0000000000..c258932224 --- /dev/null +++ b/doc/html/boost/proto/functional/second/result_T_idm45506975395760.html @@ -0,0 +1,55 @@ + + + + +Struct template result<This(Pair const &)> + + + + + + + + + + + + + + + +
                                                          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                          +
                                                          +
                                                          +PrevUpHomeNext +
                                                          +
                                                          +
                                                          +
                                                          +

                                                          Struct template result<This(Pair const &)>

                                                          +

                                                          boost::proto::functional::second::result<This(Pair const &)>

                                                          +
                                                          +

                                                          Synopsis

                                                          +
                                                          // In header: <boost/proto/functional/std/utility.hpp>
+
+
+template<typename This, typename Pair> 
+struct result<This(Pair const &)> {
+  // types
+  typedef typename Pair::second_type const & type;
+};
                                                          +
                                                          + + + +
                                                          Copyright © 2008 Eric Niebler

                                                          + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                          +
                                                          +
                                                          +
                                                          +PrevUpHomeNext +
                                                          + + diff --git a/doc/html/boost/proto/functional/second/result_T_idm45506975400080.html b/doc/html/boost/proto/functional/second/result_T_idm45506975400080.html new file mode 100644 index 0000000000..ad39815e88 --- /dev/null +++ b/doc/html/boost/proto/functional/second/result_T_idm45506975400080.html @@ -0,0 +1,55 @@ + + + + +Struct template result<This(Pair &)> + + + + + + + + + + + + + + + +
                                                          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                          +
                                                          +
                                                          +PrevUpHomeNext +
                                                          +
                                                          +
                                                          +
                                                          +

                                                          Struct template result<This(Pair &)>

                                                          +

                                                          boost::proto::functional::second::result<This(Pair &)>

                                                          +
                                                          +

                                                          Synopsis

                                                          +
                                                          // In header: <boost/proto/functional/std/utility.hpp>
+
+
+template<typename This, typename Pair> 
+struct result<This(Pair &)> {
+  // types
+  typedef typename Pair::second_type & type;
+};
                                                          +
                                                          + + + +
                                                          Copyright © 2008 Eric Niebler

                                                          + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                          +
                                                          +
                                                          +
                                                          +PrevUpHomeNext +
                                                          + + diff --git a/doc/html/boost/proto/functional/second/result_T_idm45506975404400.html b/doc/html/boost/proto/functional/second/result_T_idm45506975404400.html new file mode 100644 index 0000000000..9e4725be8c --- /dev/null +++ b/doc/html/boost/proto/functional/second/result_T_idm45506975404400.html @@ -0,0 +1,55 @@ + + + + +Struct template result<This(Pair)> + + + + + + + + + + + + + + + +
                                                          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                          +
                                                          +
                                                          +PrevUpHomeNext +
                                                          +
                                                          +
                                                          +
                                                          +

                                                          Struct template result<This(Pair)>

                                                          +

                                                          boost::proto::functional::second::result<This(Pair)>

                                                          +
                                                          +

                                                          Synopsis

                                                          +
                                                          // In header: <boost/proto/functional/std/utility.hpp>
+
+
+template<typename This, typename Pair> 
+struct result<This(Pair)> {
+  // types
+  typedef typename Pair::second_type type;
+};
                                                          +
                                                          + + + +
                                                          Copyright © 2008 Eric Niebler

                                                          + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                          +
                                                          +
                                                          +
                                                          +PrevUpHomeNext +
                                                          + + diff --git a/doc/html/boost/proto/functional/second/result_This_P_idp204618976.html b/doc/html/boost/proto/functional/second/result_This_P_idp204618976.html deleted file mode 100644 index 92833a2ec6..0000000000 --- a/doc/html/boost/proto/functional/second/result_This_P_idp204618976.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template result<This(Pair)> - - - - - - - - - - - - - - - -
                                                          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                          -
                                                          -
                                                          -PrevUpHomeNext -
                                                          -
                                                          -
                                                          -
                                                          -

                                                          Struct template result<This(Pair)>

                                                          -

                                                          boost::proto::functional::second::result<This(Pair)>

                                                          -
                                                          -

                                                          Synopsis

                                                          -
                                                          // In header: <boost/proto/functional/std/utility.hpp>
-
-
-template<typename This, typename Pair> 
-struct result<This(Pair)> {
-  // types
-  typedef typename Pair::second_type type;
-};
                                                          -
                                                          - - - -
                                                          Copyright © 2008 Eric Niebler

                                                          - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                          -
                                                          -
                                                          -
                                                          -PrevUpHomeNext -
                                                          - - diff --git a/doc/html/boost/proto/functional/second/result_This_P_idp204623296.html b/doc/html/boost/proto/functional/second/result_This_P_idp204623296.html deleted file mode 100644 index 62480d29c4..0000000000 --- a/doc/html/boost/proto/functional/second/result_This_P_idp204623296.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template result<This(Pair &)> - - - - - - - - - - - - - - - -
                                                          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                          -
                                                          -
                                                          -PrevUpHomeNext -
                                                          -
                                                          -
                                                          -
                                                          -

                                                          Struct template result<This(Pair &)>

                                                          -

                                                          boost::proto::functional::second::result<This(Pair &)>

                                                          -
                                                          -

                                                          Synopsis

                                                          -
                                                          // In header: <boost/proto/functional/std/utility.hpp>
-
-
-template<typename This, typename Pair> 
-struct result<This(Pair &)> {
-  // types
-  typedef typename Pair::second_type & type;
-};
                                                          -
                                                          - - - -
                                                          Copyright © 2008 Eric Niebler

                                                          - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                          -
                                                          -
                                                          -
                                                          -PrevUpHomeNext -
                                                          - - diff --git a/doc/html/boost/proto/functional/second/result_This_P_idp204627616.html b/doc/html/boost/proto/functional/second/result_This_P_idp204627616.html deleted file mode 100644 index 456927914b..0000000000 --- a/doc/html/boost/proto/functional/second/result_This_P_idp204627616.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template result<This(Pair const &)> - - - - - - - - - - - - - - - -
                                                          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                          -
                                                          -
                                                          -PrevUpHomeNext -
                                                          -
                                                          -
                                                          -
                                                          -

                                                          Struct template result<This(Pair const &)>

                                                          -

                                                          boost::proto::functional::second::result<This(Pair const &)>

                                                          -
                                                          -

                                                          Synopsis

                                                          -
                                                          // In header: <boost/proto/functional/std/utility.hpp>
-
-
-template<typename This, typename Pair> 
-struct result<This(Pair const &)> {
-  // types
-  typedef typename Pair::second_type const & type;
-};
                                                          -
                                                          - - - -
                                                          Copyright © 2008 Eric Niebler

                                                          - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                          -
                                                          -
                                                          -
                                                          -PrevUpHomeNext -
                                                          - - diff --git a/doc/html/boost/proto/functional/size.html b/doc/html/boost/proto/functional/size.html index d65e444493..1ed9d63bd9 100644 --- a/doc/html/boost/proto/functional/size.html +++ b/doc/html/boost/proto/functional/size.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
                                                          -PrevUpHomeNext +PrevUpHomeNext
                                                          @@ -37,29 +37,29 @@ struct size : proto::callable { // member classes/structs/unions template<typename This, typename Range> - struct result<This(Range)> : boost::range_size< + struct result<This(Range)> : boost::range_size< typename boost::remove_reference<Range>::type > { }; - // public member functions + // public member functions template<typename Range> typename boost::range_size< Range const >::type - operator()(Range const &) const; + operator()(Range const &) const; };
                                                          -

                                                          Description

                                                          +

                                                          Description

                                                          A PolymorphicFunctionObject type that invokes the boost::size() function on its arguments.

                                                          -

                                                          -size public member functions

                                                          +

                                                          +size public member functions

                                                          1. template<typename Range> 
   typename boost::range_size< Range const >::type 
-  operator()(Range const & rng) const;
                                                            + operator()(Range const & rng) const;
                                                            @@ -84,7 +84,7 @@
                                                            -PrevUpHomeNext +PrevUpHomeNext
                                                            diff --git a/doc/html/boost/proto/functional/size/result_T_idm45506975557840.html b/doc/html/boost/proto/functional/size/result_T_idm45506975557840.html new file mode 100644 index 0000000000..c0957e3477 --- /dev/null +++ b/doc/html/boost/proto/functional/size/result_T_idm45506975557840.html @@ -0,0 +1,57 @@ + + + + +Struct template result<This(Range)> + + + + + + + + + + + + + + + +
                                                            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                            +
                                                            +
                                                            +PrevUpHomeNext +
                                                            +
                                                            +
                                                            +
                                                            +

                                                            Struct template result<This(Range)>

                                                            +

                                                            boost::proto::functional::size::result<This(Range)>

                                                            +
                                                            +

                                                            Synopsis

                                                            +
                                                            // In header: <boost/proto/functional/range/size.hpp>
+
+
+template<typename This, typename Range> 
+struct result<This(Range)> :
+   boost::range_size<
+      typename boost::remove_reference<Range>::type
+  >
+{
+};
                                                            +
                                                            + + + +
                                                            Copyright © 2008 Eric Niebler

                                                            + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                            +
                                                            +
                                                            +
                                                            +PrevUpHomeNext +
                                                            + + diff --git a/doc/html/boost/proto/functional/size/result_This_R_idp204465536.html b/doc/html/boost/proto/functional/size/result_This_R_idp204465536.html deleted file mode 100644 index ce9fe16def..0000000000 --- a/doc/html/boost/proto/functional/size/result_This_R_idp204465536.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Struct template result<This(Range)> - - - - - - - - - - - - - - - -
                                                            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                            -
                                                            -
                                                            -PrevUpHomeNext -
                                                            -
                                                            -
                                                            -
                                                            -

                                                            Struct template result<This(Range)>

                                                            -

                                                            boost::proto::functional::size::result<This(Range)>

                                                            -
                                                            -

                                                            Synopsis

                                                            -
                                                            // In header: <boost/proto/functional/range/size.hpp>
-
-
-template<typename This, typename Range> 
-struct result<This(Range)> :
-   boost::range_size<
-      typename boost::remove_reference<Range>::type
-  >
-{
-};
                                                            -
                                                            - - - -
                                                            Copyright © 2008 Eric Niebler

                                                            - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                            -
                                                            -
                                                            -
                                                            -PrevUpHomeNext -
                                                            - - diff --git a/doc/html/boost/proto/functional/unpack_expr.html b/doc/html/boost/proto/functional/unpack_expr.html index 1a264dafd9..84e0bfd7b8 100644 --- a/doc/html/boost/proto/functional/unpack_expr.html +++ b/doc/html/boost/proto/functional/unpack_expr.html @@ -7,8 +7,8 @@ - - + + @@ -21,14 +21,14 @@
                                                            -PrevUpHomeNext +PrevUpHomeNext

                                                            Struct template unpack_expr

                                                            boost::proto::functional::unpack_expr — A PolymorphicFunctionObject equivalent to the - proto::unpack_expr() function. + proto::unpack_expr() function.

                                                            Synopsis

                                                            @@ -38,7 +38,7 @@ struct unpack_expr : proto::callable { // member classes/structs/unions template<typename This, typename Sequence> - struct result<This(Sequence)> : + struct result<This(Sequence)> : proto::result_of::unpack_expr< Tag, Domain, @@ -47,29 +47,29 @@ { }; - // public member functions + // public member functions template<typename Sequence> typename proto::result_of::unpack_expr< Tag, Domain, Sequence const >::type const - operator()(Sequence const &) const; + operator()(Sequence const &) const; };
                                                            -

                                                            Description

                                                            +

                                                            Description

                                                            In all cases, proto::functional::unpack_expr<Tag, Domain>()(seq) is - equivalent to proto::unpack_expr()<Tag, + equivalent to proto::unpack_expr()<Tag, Domain>(seq).

                                                            proto::functional::unpack_expr<Tag>()(seq) is equivalent to - proto::unpack_expr()<Tag>(seq). + proto::unpack_expr()<Tag>(seq).

                                                            -

                                                            -unpack_expr public member functions

                                                            +

                                                            +unpack_expr public member functions

                                                            1. template<typename Sequence> 
   typename proto::result_of::unpack_expr< Tag, Domain, Sequence const >::type const 
-  operator()(Sequence const & sequence) const;
                                                              + operator()(Sequence const & sequence) const;

                                                              Construct an expression node with tag type Tag and in the domain Domain. @@ -96,7 +96,7 @@

                                                              Returns:

                                                              - proto::unpack_expr<Tag, Domain>(sequence) + proto::unpack_expr<Tag, Domain>(sequence)

                                                              @@ -115,7 +115,7 @@
                                                              -PrevUpHomeNext +PrevUpHomeNext
                                                              diff --git a/doc/html/boost/proto/functional/unpack_expr/result_T_idm45506975133408.html b/doc/html/boost/proto/functional/unpack_expr/result_T_idm45506975133408.html new file mode 100644 index 0000000000..785ddedbeb --- /dev/null +++ b/doc/html/boost/proto/functional/unpack_expr/result_T_idm45506975133408.html @@ -0,0 +1,59 @@ + + + + +Struct template result<This(Sequence)> + + + + + + + + + + + + + + + +
                                                              Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                              +
                                                              +
                                                              +PrevUpHomeNext +
                                                              +
                                                              +
                                                              +
                                                              +

                                                              Struct template result<This(Sequence)>

                                                              +

                                                              boost::proto::functional::unpack_expr::result<This(Sequence)>

                                                              +
                                                              +

                                                              Synopsis

                                                              +
                                                              // In header: <boost/proto/make_expr.hpp>
+
+
+template<typename This, typename Sequence> 
+struct result<This(Sequence)> :  
+    proto::result_of::unpack_expr<
+      Tag,
+      Domain,
+      typename boost::remove_reference< Sequence >::type
+    >
+{
+};
                                                              +
                                                              + + + +
                                                              Copyright © 2008 Eric Niebler

                                                              + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                              +
                                                              +
                                                              +
                                                              +PrevUpHomeNext +
                                                              + + diff --git a/doc/html/boost/proto/functional/unpack_expr/result_This_S_idp224886240.html b/doc/html/boost/proto/functional/unpack_expr/result_This_S_idp224886240.html deleted file mode 100644 index 6a1605fa37..0000000000 --- a/doc/html/boost/proto/functional/unpack_expr/result_This_S_idp224886240.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Struct template result<This(Sequence)> - - - - - - - - - - - - - - - -
                                                              Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                              -
                                                              -
                                                              -PrevUpHomeNext -
                                                              -
                                                              -
                                                              -
                                                              -

                                                              Struct template result<This(Sequence)>

                                                              -

                                                              boost::proto::functional::unpack_expr::result<This(Sequence)>

                                                              -
                                                              -

                                                              Synopsis

                                                              -
                                                              // In header: <boost/proto/make_expr.hpp>
-
-
-template<typename This, typename Sequence> 
-struct result<This(Sequence)> :  
-    proto::result_of::unpack_expr<
-      Tag,
-      Domain,
-      typename boost::remove_reference< Sequence >::type
-    >
-{
-};
                                                              -
                                                              - - - -
                                                              Copyright © 2008 Eric Niebler

                                                              - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                              -
                                                              -
                                                              -
                                                              -PrevUpHomeNext -
                                                              - - diff --git a/doc/html/boost/proto/functional/value.html b/doc/html/boost/proto/functional/value.html index b2cc88222a..6c1efe7851 100644 --- a/doc/html/boost/proto/functional/value.html +++ b/doc/html/boost/proto/functional/value.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
                                                              -PrevUpHomeNext +PrevUpHomeNext
                                                              @@ -29,7 +29,7 @@

                                                              Struct value

                                                              boost::proto::functional::value — A callable PolymorphicFunctionObject that is equivalent to the - proto::value() function. + proto::value() function.

                                                              Synopsis

                                                              @@ -39,26 +39,26 @@ struct value : proto::callable { // member classes/structs/unions template<typename This, typename Expr> - struct result<This(Expr)> : proto::result_of::value< Expr > { + struct result<This(Expr)> : proto::result_of::value< Expr > { }; - // public member functions + // public member functions template<typename Expr> - typename proto::result_of::value< Expr & >::type operator()(Expr &) const; + typename proto::result_of::value< Expr & >::type operator()(Expr &) const; template<typename Expr> typename proto::result_of::value< Expr const & >::type - operator()(Expr const &) const; + operator()(Expr const &) const; };
                                                            -

                                                            Description

                                                            +

                                                            Description

                                                            -

                                                            -value public member functions

                                                            +

                                                            +value public member functions

                                                            1. template<typename Expr> 
   typename proto::result_of::value< Expr & >::type 
-  operator()(Expr & expr) const;
                                                              + operator()(Expr & expr) const;

                                                              Return the value of the given terminal expression.

                                                              @@ -96,7 +96,7 @@

                                                              Returns:

                                                              - proto::value(expr) + proto::value(expr)

                                                              @@ -109,7 +109,7 @@ 
                                                            2. template<typename Expr> 
   typename proto::result_of::value< Expr const & >::type 
-  operator()(Expr const & expr) const;
                                                              + operator()(Expr const & expr) const;

                                                              This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

                                                            @@ -126,7 +126,7 @@
                                                            -PrevUpHomeNext +PrevUpHomeNext
                                                            diff --git a/doc/html/boost/proto/functional/value/result_T_idm45506973597312.html b/doc/html/boost/proto/functional/value/result_T_idm45506973597312.html new file mode 100644 index 0000000000..762588a623 --- /dev/null +++ b/doc/html/boost/proto/functional/value/result_T_idm45506973597312.html @@ -0,0 +1,53 @@ + + + + +Struct template result<This(Expr)> + + + + + + + + + + + + + + + +
                                                            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                            +
                                                            +
                                                            +PrevUpHomeNext +
                                                            +
                                                            +
                                                            +
                                                            +

                                                            Struct template result<This(Expr)>

                                                            +

                                                            boost::proto::functional::value::result<This(Expr)>

                                                            +
                                                            +

                                                            Synopsis

                                                            +
                                                            // In header: <boost/proto/traits.hpp>
+
+
+template<typename This, typename Expr> 
+struct result<This(Expr)> :  proto::result_of::value< Expr > {
+};
                                                            +
                                                            + + + +
                                                            Copyright © 2008 Eric Niebler

                                                            + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                            +
                                                            +
                                                            +
                                                            +PrevUpHomeNext +
                                                            + + diff --git a/doc/html/boost/proto/functional/value/result_This_E_idp208702912.html b/doc/html/boost/proto/functional/value/result_This_E_idp208702912.html deleted file mode 100644 index bd825cf102..0000000000 --- a/doc/html/boost/proto/functional/value/result_This_E_idp208702912.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template result<This(Expr)> - - - - - - - - - - - - - - - -
                                                            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                            -
                                                            -
                                                            -PrevUpHomeNext -
                                                            -
                                                            -
                                                            -
                                                            -

                                                            Struct template result<This(Expr)>

                                                            -

                                                            boost::proto::functional::value::result<This(Expr)>

                                                            -
                                                            -

                                                            Synopsis

                                                            -
                                                            // In header: <boost/proto/traits.hpp>
-
-
-template<typename This, typename Expr> 
-struct result<This(Expr)> :  proto::result_of::value< Expr > {
-};
                                                            -
                                                            - - - -
                                                            Copyright © 2008 Eric Niebler

                                                            - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                            -
                                                            -
                                                            -
                                                            -PrevUpHomeNext -
                                                            - - diff --git a/doc/html/boost/proto/generator.html b/doc/html/boost/proto/generator.html index 3109adce7b..7c4ee1db5a 100644 --- a/doc/html/boost/proto/generator.html +++ b/doc/html/boost/proto/generator.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
                                                            -PrevUpHomeNext +PrevUpHomeNext
                                                            @@ -36,16 +36,16 @@ struct generator { // member classes/structs/unions template<typename This, typename Expr> - struct result<This(Expr)> { + struct result<This(Expr)> { // types - typedef Extends< Expr > type; + typedef Extends< Expr > type; }; - // public member functions - template<typename Expr> Extends< Expr > operator()(Expr const &) const; + // public member functions + template<typename Expr> Extends< Expr > operator()(Expr const &) const; };
                                                            -

                                                            Description

                                                            +

                                                            Description

                                                            Generators are intended for use as the first template parameter to the proto::domain<> @@ -54,10 +54,10 @@ the Extends<> wrapper.

                                                            -

                                                            -generator public member functions

                                                            +

                                                            +generator public member functions

                                                            1. -
                                                              template<typename Expr> Extends< Expr > operator()(Expr const & expr) const;
                                                              +
                                                              template<typename Expr> Extends< Expr > operator()(Expr const & expr) const;
                                                              @@ -97,7 +97,7 @@
                                                              -PrevUpHomeNext +PrevUpHomeNext
                                                              diff --git a/doc/html/boost/proto/generator/result_T_idm45506975300688.html b/doc/html/boost/proto/generator/result_T_idm45506975300688.html new file mode 100644 index 0000000000..6fbb41875e --- /dev/null +++ b/doc/html/boost/proto/generator/result_T_idm45506975300688.html @@ -0,0 +1,55 @@ + + + + +Struct template result<This(Expr)> + + + + + + + + + + + + + + + +
                                                              Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                              +
                                                              +
                                                              +PrevUpHomeNext +
                                                              +
                                                              +
                                                              +
                                                              +

                                                              Struct template result<This(Expr)>

                                                              +

                                                              boost::proto::generator::result<This(Expr)>

                                                              +
                                                              +

                                                              Synopsis

                                                              +
                                                              // In header: <boost/proto/generate.hpp>
+
+
+template<typename This, typename Expr> 
+struct result<This(Expr)> {
+  // types
+  typedef Extends< Expr > type;
+};
                                                              +
                                                              + + + +
                                                              Copyright © 2008 Eric Niebler

                                                              + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                              +
                                                              +
                                                              +
                                                              +PrevUpHomeNext +
                                                              + + diff --git a/doc/html/boost/proto/generator/result_This_E_idp204722688.html b/doc/html/boost/proto/generator/result_This_E_idp204722688.html deleted file mode 100644 index 171e196cef..0000000000 --- a/doc/html/boost/proto/generator/result_This_E_idp204722688.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template result<This(Expr)> - - - - - - - - - - - - - - - -
                                                              Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                              -
                                                              -
                                                              -PrevUpHomeNext -
                                                              -
                                                              -
                                                              -
                                                              -

                                                              Struct template result<This(Expr)>

                                                              -

                                                              boost::proto::generator::result<This(Expr)>

                                                              -
                                                              -

                                                              Synopsis

                                                              -
                                                              // In header: <boost/proto/generate.hpp>
-
-
-template<typename This, typename Expr> 
-struct result<This(Expr)> {
-  // types
-  typedef Extends< Expr > type;
-};
                                                              -
                                                              - - - -
                                                              Copyright © 2008 Eric Niebler

                                                              - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                              -
                                                              -
                                                              -
                                                              -PrevUpHomeNext -
                                                              - - diff --git a/doc/html/boost/proto/greater.html b/doc/html/boost/proto/greater.html index d422aa1a17..8528ec90df 100644 --- a/doc/html/boost/proto/greater.html +++ b/doc/html/boost/proto/greater.html @@ -50,7 +50,7 @@ }; };
                                                              -

                                                              Description

                                                              +

                                                              Description

                                                            diff --git a/doc/html/boost/proto/greater/impl.html b/doc/html/boost/proto/greater/impl.html index 5465cae91d..79919e6bc5 100644 --- a/doc/html/boost/proto/greater/impl.html +++ b/doc/html/boost/proto/greater/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                                            -PrevUpHomeNext +PrevUpHomeNext
                                                            @@ -47,7 +47,7 @@
                                                            -PrevUpHomeNext +PrevUpHomeNext
                                                            diff --git a/doc/html/boost/proto/greater_equal.html b/doc/html/boost/proto/greater_equal.html index 9d0ccc6cb7..238932c8de 100644 --- a/doc/html/boost/proto/greater_equal.html +++ b/doc/html/boost/proto/greater_equal.html @@ -50,7 +50,7 @@ }; };
                                                            -

                                                            Description

                                                            +

                                                            Description

                                                            diff --git a/doc/html/boost/proto/greater_equal/impl.html b/doc/html/boost/proto/greater_equal/impl.html index ef0f3781a4..344274f8aa 100644 --- a/doc/html/boost/proto/greater_equal/impl.html +++ b/doc/html/boost/proto/greater_equal/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                                            -PrevUpHomeNext +PrevUpHomeNext
                                                            @@ -49,7 +49,7 @@
                                                            -PrevUpHomeNext +PrevUpHomeNext
                                                            diff --git a/doc/html/boost/proto/has_env__idm45506984371088.html b/doc/html/boost/proto/has_env__idm45506984371088.html new file mode 100644 index 0000000000..270fae4052 --- /dev/null +++ b/doc/html/boost/proto/has_env__idm45506984371088.html @@ -0,0 +1,78 @@ + + + + +Function has_env_var + + + + + + + + + + + + + + + +
                                                            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                            +
                                                            +
                                                            +PrevUpHomeNext +
                                                            +
                                                            +
                                                            +
                                                            +

                                                            Function has_env_var

                                                            +

                                                            boost::proto::has_env_var — + For testing to see whether a value exists in a transform environment corresponding to the + specified Key. +

                                                            +
                                                            +

                                                            Synopsis

                                                            +
                                                            // In header: <boost/proto/transform/env.hpp>
+
+
+template<typename Key, typename Env> 
+  typename proto::result_of::has_env_var<Env &, Key>::type 
+  has_env_var(Env & e);
+template<typename Key, typename Env> 
+  typename proto::result_of::has_env_var<Env const &, Key>::type 
+  has_env_var(Env const & e);
                                                            +
                                                            +

                                                            Description

                                                            +

                                                            + See also: +

                                                            +
                                                            +

                                                            +

                                                            +
                                                            ++++ + + + + +

                                                            Returns:

                                                            		proto::functional::has_env_var<Key>()(e)
                                                            +
                                                            +
                                                            + + + +
                                                            Copyright © 2008 Eric Niebler

                                                            + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                            +
                                                            +
                                                            +
                                                            +PrevUpHomeNext +
                                                            + + diff --git a/doc/html/boost/proto/has_env_var_idp212952560.html b/doc/html/boost/proto/has_env_var_idp212952560.html deleted file mode 100644 index 3c874a247e..0000000000 --- a/doc/html/boost/proto/has_env_var_idp212952560.html +++ /dev/null @@ -1,78 +0,0 @@ - - - - -Function has_env_var - - - - - - - - - - - - - - - -
                                                            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                            -
                                                            -
                                                            -PrevUpHomeNext -
                                                            -
                                                            -
                                                            -
                                                            -

                                                            Function has_env_var

                                                            -

                                                            boost::proto::has_env_var — - For testing to see whether a value exists in a transform environment corresponding to the - specified Key. -

                                                            -
                                                            -

                                                            Synopsis

                                                            -
                                                            // In header: <boost/proto/transform/env.hpp>
-
-
-template<typename Key, typename Env> 
-  typename proto::result_of::has_env_var<Env &, Key>::type 
-  has_env_var(Env & e);
-template<typename Key, typename Env> 
-  typename proto::result_of::has_env_var<Env const &, Key>::type 
-  has_env_var(Env const & e);
                                                            -
                                                            -

                                                            Description

                                                            -

                                                            - See also: -

                                                            -
                                                            -

                                                            -

                                                            -
                                                            ---- - - - - -

                                                            Returns:

                                                            		proto::functional::has_env_var<Key>()(e)
                                                            -
                                                            -
                                                            - - - -
                                                            Copyright © 2008 Eric Niebler

                                                            - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                            -
                                                            -
                                                            -
                                                            -PrevUpHomeNext -
                                                            - - diff --git a/doc/html/boost/proto/if_.html b/doc/html/boost/proto/if_.html index ec7f1c7568..6d62f5041a 100644 --- a/doc/html/boost/proto/if_.html +++ b/doc/html/boost/proto/if_.html @@ -50,14 +50,14 @@ typename boost::result_of<proto::when<proto::_, Else>(Expr, State, Data)>::type >::type result_type; - // public member functions - result_type operator()(typename impl::expr_param, + // public member functions + result_type operator()(typename impl::expr_param, typename impl::state_param, typename impl::data_param) const; }; };
                                                            -

                                                            Description

                                                            +

                                                            Description

                                                            When proto::if_<If, Then, Else> is used as a grammar, If must be a Proto transform and diff --git a/doc/html/boost/proto/if_/impl.html b/doc/html/boost/proto/if_/impl.html index c122062dae..b5ac42f593 100644 --- a/doc/html/boost/proto/if_/impl.html +++ b/doc/html/boost/proto/if_/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@

                                                            -PrevUpHomeNext +PrevUpHomeNext
                                                            @@ -42,18 +42,18 @@ typename boost::result_of<proto::when<proto::_, Else>(Expr, State, Data)>::type >::type result_type; - // public member functions - result_type operator()(typename impl::expr_param, + // public member functions + result_type operator()(typename impl::expr_param, typename impl::state_param, typename impl::data_param) const; };
                                                            -

                                                            Description

                                                            +

                                                            Description

                                                            -

                                                            -impl public member functions

                                                            +

                                                            +impl public member functions

                                                            1. -
                                                              result_type operator()(typename impl::expr_param expr, 
+
                                                              result_type operator()(typename impl::expr_param expr, 
                        typename impl::state_param state, 
                        typename impl::data_param data) const;
                                                              
 
                                                              
@@ -107,7 +107,7 @@
 
                                                              
 
                                                              
 
                                                              
-PrevUpHomeNext
+PrevUpHomeNext
 
                                                              
 
 
diff --git a/doc/html/boost/proto/if_else_.html b/doc/html/boost/proto/if_else_.html
index 15752eaf05..f351493485 100644
--- a/doc/html/boost/proto/if_else_.html
+++ b/doc/html/boost/proto/if_else_.html
@@ -51,7 +51,7 @@
   };
 };
                                                            -

                                                            Description

                                                            +

                                                            Description

                                                            diff --git a/doc/html/boost/proto/if_else_/impl.html b/doc/html/boost/proto/if_else_/impl.html index 17a1abad95..b91314705f 100644 --- a/doc/html/boost/proto/if_else_/impl.html +++ b/doc/html/boost/proto/if_else_/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                                            -PrevUpHomeNext +PrevUpHomeNext
                                                            @@ -49,7 +49,7 @@
                                                            -PrevUpHomeNext +PrevUpHomeNext
                                                            diff --git a/doc/html/boost/proto/integral_c.html b/doc/html/boost/proto/integral_c.html index 172c99338b..2f101a1c5a 100644 --- a/doc/html/boost/proto/integral_c.html +++ b/doc/html/boost/proto/integral_c.html @@ -40,13 +40,13 @@ // types typedef T result_type; - // public member functions - T operator()(typename impl::expr_param, typename impl::state_param, + // public member functions + T operator()(typename impl::expr_param, typename impl::state_param, typename impl::data_param) const; }; };
                                                            -

                                                            Description

                                                            +

                                                            Description

                                                            diff --git a/doc/html/boost/proto/integral_c/impl.html b/doc/html/boost/proto/integral_c/impl.html index 15598235f0..43c1b9a5e1 100644 --- a/doc/html/boost/proto/integral_c/impl.html +++ b/doc/html/boost/proto/integral_c/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                                            -PrevUpHomeNext +PrevUpHomeNext
                                                            @@ -38,17 +38,17 @@ // types typedef T result_type; - // public member functions - T operator()(typename impl::expr_param, typename impl::state_param, + // public member functions + T operator()(typename impl::expr_param, typename impl::state_param, typename impl::data_param) const; };
                                                            -

                                                            Description

                                                            +

                                                            Description

                                                            -

                                                            -impl public member functions

                                                            +

                                                            +impl public member functions

                                                            1. -
                                                              T operator()(typename impl::expr_param, typename impl::state_param, 
+
                                                              T operator()(typename impl::expr_param, typename impl::state_param, 
              typename impl::data_param) const;
                                                              
 
                                                              @@ -82,7 +82,7 @@
 
                                                              
 

                                                              
 
                                                              
 
                                                              
-PrevUpHomeNext
+PrevUpHomeNext
 
                                                              
 
 
diff --git a/doc/html/boost/proto/is_aggregate.html b/doc/html/boost/proto/is_aggregate.html
index 2f571077a3..dc8f7b80af 100644
--- a/doc/html/boost/proto/is_aggregate.html
+++ b/doc/html/boost/proto/is_aggregate.html
@@ -36,7 +36,7 @@
 struct is_aggregate :  mpl::bool_<true-or-false> {
 };
                                                            -

                                                            Description

                                                            +

                                                            Description

                                                            proto::is_aggregate<> is used by the proto::make<> transform to determine how diff --git a/doc/html/boost/proto/is_callable.html b/doc/html/boost/proto/is_callable.html index 36a668f2ac..190a1044e4 100644 --- a/doc/html/boost/proto/is_callable.html +++ b/doc/html/boost/proto/is_callable.html @@ -37,7 +37,7 @@ struct is_callable : mpl::bool_<true-or-false> { };

                                                            -

                                                            Description

                                                            +

                                                            Description

                                                            proto::is_callable<> is used by the proto::when<> diff --git a/doc/html/boost/proto/is_domain.html b/doc/html/boost/proto/is_domain.html index a0fde86f9a..20adb5bbed 100644 --- a/doc/html/boost/proto/is_domain.html +++ b/doc/html/boost/proto/is_domain.html @@ -36,7 +36,7 @@ struct is_domain : mpl::bool_< true-or-false > { };

                                                            -

                                                            Description

                                                            +

                                                            Description

                                                            A metafunction that returns mpl::true_ if the type T is the type of a Proto domain; diff --git a/doc/html/boost/proto/is_env.html b/doc/html/boost/proto/is_env.html index 4bb5e9b7a3..6c93acee44 100644 --- a/doc/html/boost/proto/is_env.html +++ b/doc/html/boost/proto/is_env.html @@ -37,7 +37,7 @@ struct is_env : mpl::bool_<true-or-false> { };

                                                            -

                                                            Description

                                                            +

                                                            Description

                                                            is_env<T> inherits from mpl::true_ under the following conditions:

                                                            diff --git a/doc/html/boost/proto/is_expr.html b/doc/html/boost/proto/is_expr.html index d554c4461b..8424271b8b 100644 --- a/doc/html/boost/proto/is_expr.html +++ b/doc/html/boost/proto/is_expr.html @@ -37,7 +37,7 @@ struct is_expr : mpl::bool_<true-or-false> { };
                                                            -

                                                            Description

                                                            +

                                                            Description

                                                            If T is an instantiation of proto::expr<> or diff --git a/doc/html/boost/proto/is_proto_expr.html b/doc/html/boost/proto/is_proto_expr.html index 4a7ce1cc46..e7bb56329a 100644 --- a/doc/html/boost/proto/is_proto_expr.html +++ b/doc/html/boost/proto/is_proto_expr.html @@ -37,7 +37,7 @@ struct is_proto_expr { };

                                                            -

                                                            Description

                                                            +

                                                            Description

                                                            proto::is_proto_expr allows argument-dependent lookup to find Proto's operator overloads. For example:

                                                            diff --git a/doc/html/boost/proto/is_transform.html b/doc/html/boost/proto/is_transform.html index 325fdb1eb5..e6a6c467a8 100644 --- a/doc/html/boost/proto/is_transform.html +++ b/doc/html/boost/proto/is_transform.html @@ -37,7 +37,7 @@ struct is_transform : mpl::bool_<true-or-false> { };
                                                            -

                                                            Description

                                                            +

                                                            Description

                                                            proto::is_transform<> is used by the proto::make<> diff --git a/doc/html/boost/proto/lazy.html b/doc/html/boost/proto/lazy.html index e444371e01..9665ad54b9 100644 --- a/doc/html/boost/proto/lazy.html +++ b/doc/html/boost/proto/lazy.html @@ -44,14 +44,14 @@ // types typedef see-below result_type; - // public member functions - result_type operator()(typename impl::expr_param, + // public member functions + result_type operator()(typename impl::expr_param, typename impl::state_param, typename impl::data_param) const; }; };

                                                            -

                                                            Description

                                                            +

                                                            Description

                                                            proto::lazy<> is useful as a higher-order transform, when the transform to be applied depends on the current state of the transformation. The diff --git a/doc/html/boost/proto/lazy/impl.html b/doc/html/boost/proto/lazy/impl.html index 0b0c4544ab..a32b9dc4b3 100644 --- a/doc/html/boost/proto/lazy/impl.html +++ b/doc/html/boost/proto/lazy/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@

                                                            -PrevUpHomeNext +PrevUpHomeNext
                                                            @@ -38,15 +38,15 @@ // types typedef see-below result_type; - // public member functions - result_type operator()(typename impl::expr_param, + // public member functions + result_type operator()(typename impl::expr_param, typename impl::state_param, typename impl::data_param) const; };
                                                            -

                                                            Description

                                                            +

                                                            Description

                                                            -

                                                            +

                                                            impl public types

                                                            @@ -88,10 +88,10 @@
                                                          -

                                                          -impl public member functions

                                                          +

                                                          +impl public member functions

                                                          1. -
                                                            result_type operator()(typename impl::expr_param expr, 
+
                                                            result_type operator()(typename impl::expr_param expr, 
                        typename impl::state_param state, 
                        typename impl::data_param data) const;
                                                            
 
                                                            
@@ -145,7 +145,7 @@
 
 
                                                            
 
                                                            
-PrevUpHomeNext
+PrevUpHomeNext
 
                                                            
 
 
diff --git a/doc/html/boost/proto/left_idm45506990901376.html b/doc/html/boost/proto/left_idm45506990901376.html
new file mode 100644
index 0000000000..760c228120
--- /dev/null
+++ b/doc/html/boost/proto/left_idm45506990901376.html
@@ -0,0 +1,88 @@
+
+
+
+
+Function left
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
                                                            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                            
+
                                                            
+
                                                            
+PrevUpHomeNext
+
                                                            
+
                                                            
+
                                                            
+
                                                            
+
                                                            Function left
                                                            
+
                                                            boost::proto::left — Return the left child of the specified binary Proto expression. 
                                                            
+
                                                            
+
                                                            Synopsis
                                                            
+
                                                            // In header: <boost/proto/traits.hpp>
+
+
+template<typename Expr> 
+  typename proto::result_of::left< Expr & >::type left(Expr & expr);
+template<typename Expr> 
+  typename proto::result_of::left< Expr const & >::type 
+  left(Expr const & expr);
                                                            
+
                                                            
+
                                                            Description
                                                            
+
                                                            Return the left child of the specified binary Proto expression. The child is returned by reference.
                                                            
+
                                                            
++++
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
                                                            



                                                            Requires:
                                                            		
+
                                                            
+            proto::is_expr<Expr>::value is
+            true.
+          
                                                            
+
                                                            
+            2 == Expr::proto_arity::value
+          
                                                            
+
                                                            Returns:
                                                            A reference to the left child of expr.
+        
                                                            Throws:
                                                            		Will not throw.
                                                            
+
                                                            
+
                                                            
+
+
+
+
                                                            Copyright © 2008 Eric Niebler
                                                            
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      
                                                            
+
                                                            
+
                                                            
+
                                                            
+PrevUpHomeNext
+
                                                            
+
+
diff --git a/doc/html/boost/proto/left_idp227500736.html b/doc/html/boost/proto/left_idp227500736.html
deleted file mode 100644
index a7db6a099a..0000000000
--- a/doc/html/boost/proto/left_idp227500736.html
+++ /dev/null
@@ -1,88 +0,0 @@
-
-
-
-
-Function left
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
                                                            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                            
-
                                                            
-
                                                            
-PrevUpHomeNext
-
                                                            
-
                                                            
-
                                                            
-
                                                            
-
                                                            Function left
                                                            
-
                                                            boost::proto::left — Return the left child of the specified binary Proto expression. 
                                                            
-
                                                            
-
                                                            Synopsis
                                                            
-
                                                            // In header: <boost/proto/traits.hpp>
-
-
-template<typename Expr> 
-  typename proto::result_of::left< Expr & >::type left(Expr & expr);
-template<typename Expr> 
-  typename proto::result_of::left< Expr const & >::type 
-  left(Expr const & expr);
                                                            
-
                                                            
-
                                                            Description
                                                            
-
                                                            Return the left child of the specified binary Proto expression. The child is returned by reference.
                                                            
-
                                                            
----
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
                                                            



                                                            Requires:
                                                            		
-
                                                            
-            proto::is_expr<Expr>::value is
-            true.
-          
                                                            
-
                                                            
-            2 == Expr::proto_arity::value
-          
                                                            
-
                                                            Returns:
                                                            A reference to the left child of expr.
-        
                                                            Throws:
                                                            		Will not throw.
                                                            
-
                                                            
-
                                                            
-
-
-
-
                                                            Copyright © 2008 Eric Niebler
                                                            
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      
                                                            
-
                                                            
-
                                                            
-
                                                            
-PrevUpHomeNext
-
                                                            
-
-
diff --git a/doc/html/boost/proto/less.html b/doc/html/boost/proto/less.html
index 33e168355a..192068ba9b 100644
--- a/doc/html/boost/proto/less.html
+++ b/doc/html/boost/proto/less.html
@@ -48,7 +48,7 @@
   };
 };
                                                          -

                                                          Description

                                                          +

                                                          Description

                                                          diff --git a/doc/html/boost/proto/less/impl.html b/doc/html/boost/proto/less/impl.html index 707e5fedb8..4538b6eba5 100644 --- a/doc/html/boost/proto/less/impl.html +++ b/doc/html/boost/proto/less/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                                          -PrevUpHomeNext +PrevUpHomeNext
                                                          @@ -47,7 +47,7 @@
                                                          -PrevUpHomeNext +PrevUpHomeNext
                                                          diff --git a/doc/html/boost/proto/less_equal.html b/doc/html/boost/proto/less_equal.html index 477a329db8..d448937a11 100644 --- a/doc/html/boost/proto/less_equal.html +++ b/doc/html/boost/proto/less_equal.html @@ -50,7 +50,7 @@ }; };
                                                          -

                                                          Description

                                                          +

                                                          Description

                                                          diff --git a/doc/html/boost/proto/less_equal/impl.html b/doc/html/boost/proto/less_equal/impl.html index 7772bd68f9..cd1db95c86 100644 --- a/doc/html/boost/proto/less_equal/impl.html +++ b/doc/html/boost/proto/less_equal/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                                          -PrevUpHomeNext +PrevUpHomeNext
                                                          @@ -49,7 +49,7 @@
                                                          -PrevUpHomeNext +PrevUpHomeNext
                                                          diff --git a/doc/html/boost/proto/listN.html b/doc/html/boost/proto/listN.html index 59dee0369c..81efbba372 100644 --- a/doc/html/boost/proto/listN.html +++ b/doc/html/boost/proto/listN.html @@ -44,7 +44,7 @@ static const long arity; // = N; };
                                                          -

                                                          Description

                                                          +

                                                          Description

                                                          Type sequences, for use as the 2nd parameter to the proto::expr<> or diff --git a/doc/html/boost/proto/lit.html b/doc/html/boost/proto/lit.html index 1b9c7691dc..1120700589 100644 --- a/doc/html/boost/proto/lit.html +++ b/doc/html/boost/proto/lit.html @@ -38,7 +38,7 @@ template<typename T> proto::literal< T & > const lit(T & t); template<typename T> proto::literal< T const & > const lit(T const & t);

                                                          -

                                                          Description

                                                          +

                                                          Description

                                                          diff --git a/doc/html/boost/proto/literal.html b/doc/html/boost/proto/literal.html index cf845cd34b..218467f466 100644 --- a/doc/html/boost/proto/literal.html +++ b/doc/html/boost/proto/literal.html @@ -43,17 +43,17 @@ typedeftypenameproto::result_of::value<Xconst&>::typeconst_reference;// construct/copy/destruct - literal(); - template<typename U>literal(U&); - template<typename U>literal(Uconst&); - template<typename U>literal(proto::literal<U,Domain>const&); + literal(); + template<typename U>literal(U&); + template<typename U>literal(Uconst&); + template<typename U>literal(proto::literal<U,Domain>const&); - // public member functions - referenceget(); - const_referenceget()const; + // public member functions + referenceget(); + const_referenceget()const;};
                                                          -

                                                          Description

                                                          +

                                                          Description

                                                          A simple wrapper for a terminal, provided for ease of use. In all cases, proto::literal<X> l(x); is equivalent to @@ -64,23 +64,23 @@ proto::default_domain.

                                                          -

                                                          +

                                                          literal public construct/copy/destruct

                                                            -
                                                          1. literal();
                                                            2. -
                                                          2. template<typename U> literal(U & u);
                                                            3. -
                                                          3. template<typename U> literal(U const & u);
                                                            4. -
                                                          4. template<typename U> literal(proto::literal< U, Domain > const & u);
                                                            5. +
                                                          5. literal();
                                                            6. +
                                                          6. template<typename U> literal(U & u);
                                                            7. +
                                                          7. template<typename U> literal(U const & u);
                                                            8. +
                                                          8. template<typename U> literal(proto::literal< U, Domain > const & u);
                                                          -

                                                          -literal public member functions

                                                          +

                                                          +literal public member functions

                                                          1. -
                                                            reference get();
                                                            +
                                                            reference get();
                                                          @@ -88,12 +88,12 @@ - +

                                                          Returns:

                                                          		proto::value(*this)proto::value(*this)
                                                        3. -
                                                          const_reference get() const;
                                                          +
                                                          const_reference get() const;
                                                          @@ -101,7 +101,7 @@ - +

                                                          Returns:

                                                          		proto::value(*this)proto::value(*this)
                                                          4. diff --git a/doc/html/boost/proto/logical_and.html b/doc/html/boost/proto/logical_and.html index 7ae0021cd9..bc16466d6e 100644 --- a/doc/html/boost/proto/logical_and.html +++ b/doc/html/boost/proto/logical_and.html @@ -50,7 +50,7 @@ }; };
                                                        -

                                                        Description

                                                        +

                                                        Description

                                                        diff --git a/doc/html/boost/proto/logical_and/impl.html b/doc/html/boost/proto/logical_and/impl.html index 4ca785abce..3dbfb61b68 100644 --- a/doc/html/boost/proto/logical_and/impl.html +++ b/doc/html/boost/proto/logical_and/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                        @@ -49,7 +49,7 @@
                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                        diff --git a/doc/html/boost/proto/logical_not.html b/doc/html/boost/proto/logical_not.html index 7bb4da5243..37ac317b97 100644 --- a/doc/html/boost/proto/logical_not.html +++ b/doc/html/boost/proto/logical_not.html @@ -50,7 +50,7 @@ }; };
                                                        -

                                                        Description

                                                        +

                                                        Description

                                                        diff --git a/doc/html/boost/proto/logical_not/impl.html b/doc/html/boost/proto/logical_not/impl.html index d19f290db8..4d60f64e2c 100644 --- a/doc/html/boost/proto/logical_not/impl.html +++ b/doc/html/boost/proto/logical_not/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                        @@ -49,7 +49,7 @@
                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                        diff --git a/doc/html/boost/proto/logical_or.html b/doc/html/boost/proto/logical_or.html index 3bdac0526b..70072a5837 100644 --- a/doc/html/boost/proto/logical_or.html +++ b/doc/html/boost/proto/logical_or.html @@ -50,7 +50,7 @@ }; };
                                                        -

                                                        Description

                                                        +

                                                        Description

                                                        diff --git a/doc/html/boost/proto/logical_or/impl.html b/doc/html/boost/proto/logical_or/impl.html index 6f9cd70944..28b571ab52 100644 --- a/doc/html/boost/proto/logical_or/impl.html +++ b/doc/html/boost/proto/logical_or/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                        @@ -49,7 +49,7 @@
                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                        diff --git a/doc/html/boost/proto/make.html b/doc/html/boost/proto/make.html index 2032757219..1000d3bccc 100644 --- a/doc/html/boost/proto/make.html +++ b/doc/html/boost/proto/make.html @@ -41,14 +41,14 @@ // types typedef see-below result_type; - // public member functions - result_type operator()(typename impl::expr_param, + // public member functions + result_type operator()(typename impl::expr_param, typename impl::state_param, typename impl::data_param) const; }; };
                                                        -

                                                        Description

                                                        +

                                                        Description

                                                        The purpose of proto::make<> is to annotate a transform as an ObjectTransform so that diff --git a/doc/html/boost/proto/make/impl.html b/doc/html/boost/proto/make/impl.html index c199ab4a45..7f7558d206 100644 --- a/doc/html/boost/proto/make/impl.html +++ b/doc/html/boost/proto/make/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@

                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                        @@ -38,15 +38,15 @@ // types typedef see-below result_type; - // public member functions - result_type operator()(typename impl::expr_param, + // public member functions + result_type operator()(typename impl::expr_param, typename impl::state_param, typename impl::data_param) const; };
                                                        -

                                                        Description

                                                        +

                                                        Description

                                                        -

                                                        +

                                                        impl public types

                                                        @@ -153,10 +153,10 @@
                                                      -

                                                      -impl public member functions

                                                      +

                                                      +impl public member functions

                                                      1. -
                                                        result_type operator()(typename impl::expr_param expr, 
+
                                                        result_type operator()(typename impl::expr_param expr, 
                        typename impl::state_param state, 
                        typename impl::data_param data) const;
                                                        
 
                                                        
@@ -241,7 +241,7 @@
 
 
                                                        
 
                                                        
-PrevUpHomeNext
+PrevUpHomeNext
 
                                                        
 
 
diff --git a/doc/html/boost/proto/make_exp_idm45506975053600.html b/doc/html/boost/proto/make_exp_idm45506975053600.html
new file mode 100644
index 0000000000..c93a781b53
--- /dev/null
+++ b/doc/html/boost/proto/make_exp_idm45506975053600.html
@@ -0,0 +1,104 @@
+
+
+
+
+Function make_expr
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                        
+
                                                        
+
                                                        
+PrevUpHomeNext
+
                                                        
+
                                                        
+
                                                        
+
                                                        
+
                                                        Function make_expr
                                                        
+
                                                        boost::proto::make_expr — Construct an expression of the requested tag type with a domain and with the specified
+          arguments as children.
                                                        
+
                                                        
+
                                                        Synopsis
                                                        
+
                                                        // In header: <boost/proto/make_expr.hpp>
+
+
+template<typename Tag, typename... A> 
+  typename proto::result_of::make_expr<Tag, A const...>::type const 
+  make_expr(A const &... a);
+template<typename Tag, typename Domain, typename... A> 
+  typename proto::result_of::make_expr<Tag, Domain, A const...>::type const 
+  make_expr(A const &... a);
                                                        
+
                                                        
+
                                                        Description
                                                        
+
                                                        
+            This function template may be invoked either with or without specifying a
+            Domain template parameter. If no domain is specified, the domain
+            is deduced by examining domains of the given arguments. See
+            proto::deduce_domain for a full
+            description of the procedure used.
+          
                                                        
+
                                                        
+            Let WRAP(x) be defined such that:
+            
                                                        
+
                                                          
+
                                                        • 
+                  If x is a boost::reference_wrapper<>,
+                  WRAP(x) is equivalent to
+                  proto::as_child<Domain>(x.get()).
+                
                                                          • 
+
                                                        • 
+                  Otherwise, WRAP(x) is equivalent to
+                  proto::as_expr<Domain>(x).
+                
                                                          • 
+
                                                        
+
                                                        
+          
                                                        
+
                                                        
+            If proto::wants_basic_expr<typename Domain::proto_generator>::value
+            is true, then let E be
+            proto::basic_expr; otherwise,
+            let E be
+            proto::expr.
+          
                                                        
+
                                                        
+            Let MAKE(Tag, b...) be defined as
+            E<Tag,
+            proto::listN<decltype(b)...> >::make(b...).
+          
                                                        
+
                                                        
+            If Tag is
+            proto::tag::terminal, then return
+            WRAP(a0).
+          
                                                        
+
                                                        
+            Otherwise, return
+            Domain()(MAKE(Tag, WRAP(a)...)).
+          
                                                        
+
                                                        
+
                                                        
+
+
+
+
                                                        Copyright © 2008 Eric Niebler
                                                        
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      
                                                        
+
                                                        
+
                                                        
+
                                                        
+PrevUpHomeNext
+
                                                        
+
+
diff --git a/doc/html/boost/proto/make_expr_idp224966048.html b/doc/html/boost/proto/make_expr_idp224966048.html
deleted file mode 100644
index e0e3f45ce0..0000000000
--- a/doc/html/boost/proto/make_expr_idp224966048.html
+++ /dev/null
@@ -1,104 +0,0 @@
-
-
-
-
-Function make_expr
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                        
-
                                                        
-
                                                        
-PrevUpHomeNext
-
                                                        
-
                                                        
-
                                                        
-
                                                        
-
                                                        Function make_expr
                                                        
-
                                                        boost::proto::make_expr — Construct an expression of the requested tag type with a domain and with the specified
-          arguments as children.
                                                        
-
                                                        
-
                                                        Synopsis
                                                        
-
                                                        // In header: <boost/proto/make_expr.hpp>
-
-
-template<typename Tag, typename... A> 
-  typename proto::result_of::make_expr<Tag, A const...>::type const 
-  make_expr(A const &... a);
-template<typename Tag, typename Domain, typename... A> 
-  typename proto::result_of::make_expr<Tag, Domain, A const...>::type const 
-  make_expr(A const &... a);
                                                        
-
                                                        
-
                                                        Description
                                                        
-
                                                        
-            This function template may be invoked either with or without specifying a
-            Domain template parameter. If no domain is specified, the domain
-            is deduced by examining domains of the given arguments. See
-            proto::deduce_domain for a full
-            description of the procedure used.
-          
                                                        
-
                                                        
-            Let WRAP(x) be defined such that:
-            
                                                        
-
                                                          
-
                                                        • 
-                  If x is a boost::reference_wrapper<>,
-                  WRAP(x) is equivalent to
-                  proto::as_child<Domain>(x.get()).
-                
                                                          • 
-
                                                        • 
-                  Otherwise, WRAP(x) is equivalent to
-                  proto::as_expr<Domain>(x).
-                
                                                          • 
-
                                                        
-
                                                        
-          
                                                        
-
                                                        
-            If proto::wants_basic_expr<typename Domain::proto_generator>::value
-            is true, then let E be
-            proto::basic_expr; otherwise,
-            let E be
-            proto::expr.
-          
                                                        
-
                                                        
-            Let MAKE(Tag, b...) be defined as
-            E<Tag,
-            proto::listN<decltype(b)...> >::make(b...).
-          
                                                        
-
                                                        
-            If Tag is
-            proto::tag::terminal, then return
-            WRAP(a0).
-          
                                                        
-
                                                        
-            Otherwise, return
-            Domain()(MAKE(Tag, WRAP(a)...)).
-          
                                                        
-
                                                        
-
                                                        
-
-
-
-
                                                        Copyright © 2008 Eric Niebler
                                                        
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      
                                                        
-
                                                        
-
                                                        
-
                                                        
-PrevUpHomeNext
-
                                                        
-
-
diff --git a/doc/html/boost/proto/matches.html b/doc/html/boost/proto/matches.html
index 43ce5aec87..248bde7c79 100644
--- a/doc/html/boost/proto/matches.html
+++ b/doc/html/boost/proto/matches.html
@@ -36,7 +36,7 @@
 struct matches :  mpl::bool_<true-or-false> {
 };
                                                      -

                                                      Description

                                                      +

                                                      Description

                                                      proto::matches<Expr, Grammar> inherits from mpl::true_ if diff --git a/doc/html/boost/proto/mem_ptr.html b/doc/html/boost/proto/mem_ptr.html index 33cfb02910..10b37c6d87 100644 --- a/doc/html/boost/proto/mem_ptr.html +++ b/doc/html/boost/proto/mem_ptr.html @@ -46,7 +46,7 @@ }; };

                                                      -

                                                      Description

                                                      +

                                                      Description

                                                      diff --git a/doc/html/boost/proto/mem_ptr/impl.html b/doc/html/boost/proto/mem_ptr/impl.html index bb374f00af..56328c1a4f 100644 --- a/doc/html/boost/proto/mem_ptr/impl.html +++ b/doc/html/boost/proto/mem_ptr/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                                      -PrevUpHomeNext +PrevUpHomeNext
                                                      @@ -47,7 +47,7 @@
                                                      -PrevUpHomeNext +PrevUpHomeNext
                                                      diff --git a/doc/html/boost/proto/minus.html b/doc/html/boost/proto/minus.html index e703817ef9..388d062fbb 100644 --- a/doc/html/boost/proto/minus.html +++ b/doc/html/boost/proto/minus.html @@ -48,7 +48,7 @@ }; };
                                                      -

                                                      Description

                                                      +

                                                      Description

                                                      diff --git a/doc/html/boost/proto/minus/impl.html b/doc/html/boost/proto/minus/impl.html index 0f9f7013a1..aff4033bdc 100644 --- a/doc/html/boost/proto/minus/impl.html +++ b/doc/html/boost/proto/minus/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                                      -PrevUpHomeNext +PrevUpHomeNext
                                                      @@ -47,7 +47,7 @@
                                                      -PrevUpHomeNext +PrevUpHomeNext
                                                      diff --git a/doc/html/boost/proto/minus_assign.html b/doc/html/boost/proto/minus_assign.html index 74b267d5b8..513cda670b 100644 --- a/doc/html/boost/proto/minus_assign.html +++ b/doc/html/boost/proto/minus_assign.html @@ -50,7 +50,7 @@ }; };
                                                      -

                                                      Description

                                                      +

                                                      Description

                                                      diff --git a/doc/html/boost/proto/minus_assign/impl.html b/doc/html/boost/proto/minus_assign/impl.html index 742b6c247c..7aaf3e729f 100644 --- a/doc/html/boost/proto/minus_assign/impl.html +++ b/doc/html/boost/proto/minus_assign/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                                      -PrevUpHomeNext +PrevUpHomeNext
                                                      @@ -49,7 +49,7 @@
                                                      -PrevUpHomeNext +PrevUpHomeNext
                                                      diff --git a/doc/html/boost/proto/modulus.html b/doc/html/boost/proto/modulus.html index e8ae37d021..e9fedbaf32 100644 --- a/doc/html/boost/proto/modulus.html +++ b/doc/html/boost/proto/modulus.html @@ -50,7 +50,7 @@ }; };
                                                      -

                                                      Description

                                                      +

                                                      Description

                                                      diff --git a/doc/html/boost/proto/modulus/impl.html b/doc/html/boost/proto/modulus/impl.html index 0622115e97..4367495f91 100644 --- a/doc/html/boost/proto/modulus/impl.html +++ b/doc/html/boost/proto/modulus/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                                      -PrevUpHomeNext +PrevUpHomeNext
                                                      @@ -47,7 +47,7 @@
                                                      -PrevUpHomeNext +PrevUpHomeNext
                                                      diff --git a/doc/html/boost/proto/modulus_assign.html b/doc/html/boost/proto/modulus_assign.html index 2dff7ab1f2..c987426cf5 100644 --- a/doc/html/boost/proto/modulus_assign.html +++ b/doc/html/boost/proto/modulus_assign.html @@ -50,7 +50,7 @@ }; };
                                                      -

                                                      Description

                                                      +

                                                      Description

                                                    diff --git a/doc/html/boost/proto/modulus_assign/impl.html b/doc/html/boost/proto/modulus_assign/impl.html index bd50fa7e46..2f1f6eedbd 100644 --- a/doc/html/boost/proto/modulus_assign/impl.html +++ b/doc/html/boost/proto/modulus_assign/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    @@ -49,7 +49,7 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    diff --git a/doc/html/boost/proto/multiplies.html b/doc/html/boost/proto/multiplies.html index 53b93377eb..1b51b529c9 100644 --- a/doc/html/boost/proto/multiplies.html +++ b/doc/html/boost/proto/multiplies.html @@ -50,7 +50,7 @@ }; };
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    diff --git a/doc/html/boost/proto/multiplies/impl.html b/doc/html/boost/proto/multiplies/impl.html index 2b3bfd22c3..7bdf46c5bd 100644 --- a/doc/html/boost/proto/multiplies/impl.html +++ b/doc/html/boost/proto/multiplies/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    @@ -49,7 +49,7 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    diff --git a/doc/html/boost/proto/multiplies_assign.html b/doc/html/boost/proto/multiplies_assign.html index 2b5d83b0a0..0b51233389 100644 --- a/doc/html/boost/proto/multiplies_assign.html +++ b/doc/html/boost/proto/multiplies_assign.html @@ -50,7 +50,7 @@ }; };
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    diff --git a/doc/html/boost/proto/multiplies_assign/impl.html b/doc/html/boost/proto/multiplies_assign/impl.html index bfd1738b8c..f13d4b3718 100644 --- a/doc/html/boost/proto/multiplies_assign/impl.html +++ b/doc/html/boost/proto/multiplies_assign/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    @@ -49,7 +49,7 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    diff --git a/doc/html/boost/proto/nary_expr.html b/doc/html/boost/proto/nary_expr.html index 1f914618ff..4558e47afd 100644 --- a/doc/html/boost/proto/nary_expr.html +++ b/doc/html/boost/proto/nary_expr.html @@ -51,7 +51,7 @@ }; };
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    Use proto::nary_expr<proto::_, proto::vararg<proto::_> > as a grammar element to match any n-ary expression; that is, any non-terminal. diff --git a/doc/html/boost/proto/nary_expr/impl.html b/doc/html/boost/proto/nary_expr/impl.html index db8ba9f88e..13f532bf01 100644 --- a/doc/html/boost/proto/nary_expr/impl.html +++ b/doc/html/boost/proto/nary_expr/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@

                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    @@ -49,7 +49,7 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    diff --git a/doc/html/boost/proto/negate.html b/doc/html/boost/proto/negate.html index d9c01c6aea..12e176b67e 100644 --- a/doc/html/boost/proto/negate.html +++ b/doc/html/boost/proto/negate.html @@ -50,7 +50,7 @@ }; };
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    diff --git a/doc/html/boost/proto/negate/impl.html b/doc/html/boost/proto/negate/impl.html index 07963a8d04..a5761a8887 100644 --- a/doc/html/boost/proto/negate/impl.html +++ b/doc/html/boost/proto/negate/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    @@ -47,7 +47,7 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    diff --git a/doc/html/boost/proto/noinvoke.html b/doc/html/boost/proto/noinvoke.html index 5b70440433..3f4b1ae863 100644 --- a/doc/html/boost/proto/noinvoke.html +++ b/doc/html/boost/proto/noinvoke.html @@ -38,7 +38,7 @@ struct noinvoke { };
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    ObjectTransforms are evaluated by proto::make<>, diff --git a/doc/html/boost/proto/not_.html b/doc/html/boost/proto/not_.html index 5678421394..76857f4f04 100644 --- a/doc/html/boost/proto/not_.html +++ b/doc/html/boost/proto/not_.html @@ -45,13 +45,13 @@ // types typedef Expr result_type; - // public member functions - Expr operator()(typename impl::expr_param, typename impl::state_param, + // public member functions + Expr operator()(typename impl::expr_param, typename impl::state_param, typename impl::data_param) const; }; };

                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    If an expression type E does not match a grammar G, then E does diff --git a/doc/html/boost/proto/not_/impl.html b/doc/html/boost/proto/not_/impl.html index f79ad30e1b..9d9e2c5cec 100644 --- a/doc/html/boost/proto/not_/impl.html +++ b/doc/html/boost/proto/not_/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@

                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    @@ -38,17 +38,17 @@ // types typedef Expr result_type; - // public member functions - Expr operator()(typename impl::expr_param, typename impl::state_param, + // public member functions + Expr operator()(typename impl::expr_param, typename impl::state_param, typename impl::data_param) const; };
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    -

                                                    -impl public member functions

                                                    +

                                                    +impl public member functions

                                                    1. -
                                                      Expr operator()(typename impl::expr_param expr, typename impl::state_param, 
+
                                                      Expr operator()(typename impl::expr_param expr, typename impl::state_param, 
                 typename impl::data_param) const;
                                                      
 
                                                      @@ -98,7 +98,7 @@
 
                                                      
 

                                                      
 
                                                      
 
                                                      
-PrevUpHomeNext
+PrevUpHomeNext
 
                                                      
 
 
diff --git a/doc/html/boost/proto/not_equal_to.html b/doc/html/boost/proto/not_equal_to.html
index 4bf00221c2..052fd81dc9 100644
--- a/doc/html/boost/proto/not_equal_to.html
+++ b/doc/html/boost/proto/not_equal_to.html
@@ -50,7 +50,7 @@
   };
 };
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    diff --git a/doc/html/boost/proto/not_equal_to/impl.html b/doc/html/boost/proto/not_equal_to/impl.html index 4dd110bc4c..e67487dd2b 100644 --- a/doc/html/boost/proto/not_equal_to/impl.html +++ b/doc/html/boost/proto/not_equal_to/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    @@ -49,7 +49,7 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    diff --git a/doc/html/boost/proto/nullary_expr.html b/doc/html/boost/proto/nullary_expr.html index 130b8d256c..12b50725bb 100644 --- a/doc/html/boost/proto/nullary_expr.html +++ b/doc/html/boost/proto/nullary_expr.html @@ -46,13 +46,13 @@ // types typedef Expr result_type; - // public member functions - Expr operator()(typename impl::expr_param, typename impl::state_param, + // public member functions + Expr operator()(typename impl::expr_param, typename impl::state_param, typename impl::data_param) const; }; };
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    Use proto::nullary_expr<proto::_, proto::_> as a grammar element to match any nullary expression. diff --git a/doc/html/boost/proto/nullary_expr/impl.html b/doc/html/boost/proto/nullary_expr/impl.html index 8aa1bcd3f6..c745c9b197 100644 --- a/doc/html/boost/proto/nullary_expr/impl.html +++ b/doc/html/boost/proto/nullary_expr/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@

                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    @@ -38,17 +38,17 @@ // types typedef Expr result_type; - // public member functions - Expr operator()(typename impl::expr_param, typename impl::state_param, + // public member functions + Expr operator()(typename impl::expr_param, typename impl::state_param, typename impl::data_param) const; };
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    -

                                                    -impl public member functions

                                                    +

                                                    +impl public member functions

                                                    1. -
                                                      Expr operator()(typename impl::expr_param expr, typename impl::state_param, 
+
                                                      Expr operator()(typename impl::expr_param expr, typename impl::state_param, 
                 typename impl::data_param) const;
                                                      
 
                                                      @@ -101,7 +101,7 @@
 
                                                      
 

                                                      
 
                                                      
 
                                                      
-PrevUpHomeNext
+PrevUpHomeNext
 
                                                      
 
 
diff --git a/doc/html/boost/proto/operator__idp212979632.html b/doc/html/boost/proto/operator__idp212979632.html
deleted file mode 100644
index 45ea57f5e4..0000000000
--- a/doc/html/boost/proto/operator__idp212979632.html
+++ /dev/null
@@ -1,118 +0,0 @@
-
-
-
-
-Function operator,
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
                                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                      
-
                                                      
-
                                                      
-PrevUpHomeNext
-
                                                      
-
                                                      
-
                                                      
-
                                                      
-
                                                      Function operator,
                                                      
-
                                                      boost::proto::operator, — 
-          For composing a larger transform environment from two smaller ones.
-        
                                                      
-
                                                      
-
                                                      Synopsis
                                                      
-
                                                      // In header: <boost/proto/transform/env.hpp>
-
-
-template<typename Env, typename Key, typename Value> 
-  proto::env<Key, Value, UNCVREF(typename proto::result_of::as_env<Env &>::type)> 
-  operator,(Env & other, proto::env<Key, Value> const & head);
-template<typename Env, typename Key, typename Value> 
-  proto::env<Key, Value, UNCVREF(typename proto::result_of::as_env<Env const &>::type)> 
-  operator,(Env const & other, proto::env<Key, Value> const & head);
                                                      
-
                                                      
-
                                                      Description
                                                      
-
                                                      
-            The effect of this function is to take two transform environments and compose them into
-            a larger environment that contains the key/values pairs of the two. The first argument
-            is allowed to not be a transform environment, in which case it is turned into one with
-            the proto::as_env() function before composition with the
-            second argument. The second argument is required to be a transform environment with exactly
-            one key/value pair.
-          
                                                      
-
                                                      
-            Example:
-          
                                                      
-
                                                      
-            Given user-defined keys key0 and key1 of types key0_type
-            and key1_type, the following code demonstrates how the chained use of operator,
-            can build a composite transform environment containing a number of key/value pairs:
-            
                                                      
-
                                                      proto::env<
-    key1_type
-  , int
-  , proto::env<
-        key0_type
-      , char const (&)[6]
-      , proto::env<proto::data_type, int>
-    >
-> myenv = (proto::data = 1, key0 = "hello", key1 = 42);
-// NOTE: operator, here --^    and here --^
-
-// Check the results:
-assert(1 == myenv[proto::data]);
-assert(0 == std::strcmp(myenv[key0], "hello"));
-assert(42 == myenv[key1]);
                                                      
-
                                                      
-          
                                                      
-
                                                      
-            Note: In the return type and the "Returns" clause, UNCVREF(X) is
-            the type X stripped of top-level reference and cv-qualifiers.
-          
                                                      
-
                                                      
-            Note: In the "Returns" clause, cv is replaced with const
-            for the second overload, and nothing for the first.
-          
                                                      
-
                                                      
-            See also:
-            
                                                      
-
                                                      
-
                                                      
-          
                                                      
-
                                                      
----
-
-
-
-
-
                                                      



                                                      Returns:
                                                      		proto::env<Key, Value, UNCVREF(typename proto::result_of::as_env<Env cv &>::type)>(head[Key()], proto::as_env(other))
                                                      
-
                                                      
-
                                                      
-
-
-
-
                                                      Copyright © 2008 Eric Niebler
                                                      
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      
                                                      
-
                                                      
-
                                                      
-
                                                      
-PrevUpHomeNext
-
                                                      
-
-
diff --git a/doc/html/boost/proto/operator_idm45506984344016.html b/doc/html/boost/proto/operator_idm45506984344016.html
new file mode 100644
index 0000000000..aa19aa7284
--- /dev/null
+++ b/doc/html/boost/proto/operator_idm45506984344016.html
@@ -0,0 +1,118 @@
+
+
+
+
+Function operator,
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
                                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                      
+
                                                      
+
                                                      
+PrevUpHomeNext
+
                                                      
+
                                                      
+
                                                      
+
                                                      
+
                                                      Function operator,
                                                      
+
                                                      boost::proto::operator, — 
+          For composing a larger transform environment from two smaller ones.
+        
                                                      
+
                                                      
+
                                                      Synopsis
                                                      
+
                                                      // In header: <boost/proto/transform/env.hpp>
+
+
+template<typename Env, typename Key, typename Value> 
+  proto::env<Key, Value, UNCVREF(typename proto::result_of::as_env<Env &>::type)> 
+  operator,(Env & other, proto::env<Key, Value> const & head);
+template<typename Env, typename Key, typename Value> 
+  proto::env<Key, Value, UNCVREF(typename proto::result_of::as_env<Env const &>::type)> 
+  operator,(Env const & other, proto::env<Key, Value> const & head);
                                                      
+
                                                      
+
                                                      Description
                                                      
+
                                                      
+            The effect of this function is to take two transform environments and compose them into
+            a larger environment that contains the key/values pairs of the two. The first argument
+            is allowed to not be a transform environment, in which case it is turned into one with
+            the proto::as_env() function before composition with the
+            second argument. The second argument is required to be a transform environment with exactly
+            one key/value pair.
+          
                                                      
+
                                                      
+            Example:
+          
                                                      
+
                                                      
+            Given user-defined keys key0 and key1 of types key0_type
+            and key1_type, the following code demonstrates how the chained use of operator,
+            can build a composite transform environment containing a number of key/value pairs:
+            
                                                      
+
                                                      proto::env<
+    key1_type
+  , int
+  , proto::env<
+        key0_type
+      , char const (&)[6]
+      , proto::env<proto::data_type, int>
+    >
+> myenv = (proto::data = 1, key0 = "hello", key1 = 42);
+// NOTE: operator, here --^    and here --^
+
+// Check the results:
+assert(1 == myenv[proto::data]);
+assert(0 == std::strcmp(myenv[key0], "hello"));
+assert(42 == myenv[key1]);
                                                      
+
                                                      
+          
                                                      
+
                                                      
+            Note: In the return type and the "Returns" clause, UNCVREF(X) is
+            the type X stripped of top-level reference and cv-qualifiers.
+          
                                                      
+
                                                      
+            Note: In the "Returns" clause, cv is replaced with const
+            for the second overload, and nothing for the first.
+          
                                                      
+
                                                      
+            See also:
+            
                                                      
+
                                                      
+
                                                      
+          
                                                      
+
                                                      
++++
+
+
+
+
+
                                                      



                                                      Returns:
                                                      		proto::env<Key, Value, UNCVREF(typename proto::result_of::as_env<Env cv &>::type)>(head[Key()], proto::as_env(other))
                                                      
+
                                                      
+
                                                      
+
+
+
+
                                                      Copyright © 2008 Eric Niebler
                                                      
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      
                                                      
+
                                                      
+
                                                      
+
                                                      
+PrevUpHomeNext
+
                                                      
+
+
diff --git a/doc/html/boost/proto/or_.html b/doc/html/boost/proto/or_.html
index dcdfeaa483..186929466e 100644
--- a/doc/html/boost/proto/or_.html
+++ b/doc/html/boost/proto/or_.html
@@ -45,14 +45,14 @@
     // types
     typedef unspecified result_type;
 
-    // public member functions
-    result_type operator()(typename impl::expr_param, 
+    // public member functions
+    result_type operator()(typename impl::expr_param, 
                            typename impl::state_param, 
                            typename impl::data_param) const;
   };
 };
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    An expression type E matches proto::or_<G0,G1,...Gn> diff --git a/doc/html/boost/proto/or_/impl.html b/doc/html/boost/proto/or_/impl.html index 20438db80d..01a4f35622 100644 --- a/doc/html/boost/proto/or_/impl.html +++ b/doc/html/boost/proto/or_/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@

                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    @@ -38,18 +38,18 @@ // types typedef unspecified result_type; - // public member functions - result_type operator()(typename impl::expr_param, + // public member functions + result_type operator()(typename impl::expr_param, typename impl::state_param, typename impl::data_param) const; };
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    -

                                                    -impl public member functions

                                                    +

                                                    +impl public member functions

                                                    1. -
                                                      result_type operator()(typename impl::expr_param expr, 
+
                                                      result_type operator()(typename impl::expr_param expr, 
                        typename impl::state_param state, 
                        typename impl::data_param data) const;
                                                      
 
                                                      
@@ -110,7 +110,7 @@
 
                                                      
 
                                                      
 
                                                      
-PrevUpHomeNext
+PrevUpHomeNext
 
                                                      
 
 
diff --git a/doc/html/boost/proto/otherwise.html b/doc/html/boost/proto/otherwise.html
index 3919bc7c5b..b44d59ec8b 100644
--- a/doc/html/boost/proto/otherwise.html
+++ b/doc/html/boost/proto/otherwise.html
@@ -7,7 +7,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
 
                                                      
 
                                                      
-PrevUpHomeNext
+PrevUpHomeNext
 
                                                      
 
                                                      
 
                                                      
@@ -39,7 +39,7 @@
 struct otherwise :  proto::when< proto::_, Fun > {
 };
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    Use proto::otherwise<T> in your grammars as a synonym for proto::when< proto::_, Fun > @@ -69,7 +69,7 @@

                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    diff --git a/doc/html/boost/proto/pack.html b/doc/html/boost/proto/pack.html index 4fe6bb2a1b..1f89638eb0 100644 --- a/doc/html/boost/proto/pack.html +++ b/doc/html/boost/proto/pack.html @@ -39,7 +39,7 @@ struct pack { };
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    proto::pack is useful within CallableTransforms and diff --git a/doc/html/boost/proto/pass_through.html b/doc/html/boost/proto/pass_through.html index 310aefbee2..fedcaf13d7 100644 --- a/doc/html/boost/proto/pass_through.html +++ b/doc/html/boost/proto/pass_through.html @@ -53,14 +53,14 @@ typedef typename mpl::if_<proto::wants_basic_expr<G>, BE, E>::type expr_type; // For exposition only typedef typename boost::result_of<D(expr_type)>::type result_type; - // public member functions - result_type operator()(typename impl::expr_param, + // public member functions + result_type operator()(typename impl::expr_param, typename impl::state_param, typename impl::data_param) const; }; };

                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    Given a Grammar such as proto::plus<T0, T1>, an expression type that matches the grammar such as diff --git a/doc/html/boost/proto/pass_through/impl.html b/doc/html/boost/proto/pass_through/impl.html index 9b11fd9b3c..35e73c51eb 100644 --- a/doc/html/boost/proto/pass_through/impl.html +++ b/doc/html/boost/proto/pass_through/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@

                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    @@ -50,18 +50,18 @@ typedef typename mpl::if_<proto::wants_basic_expr<G>, BE, E>::type expr_type; // For exposition only typedef typename boost::result_of<D(expr_type)>::type result_type; - // public member functions - result_type operator()(typename impl::expr_param, + // public member functions + result_type operator()(typename impl::expr_param, typename impl::state_param, typename impl::data_param) const; };
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    -

                                                    -impl public member functions

                                                    +

                                                    +impl public member functions

                                                    1. -
                                                      result_type operator()(typename impl::expr_param expr, 
+
                                                      result_type operator()(typename impl::expr_param expr, 
                        typename impl::state_param state, 
                        typename impl::data_param data) const;
                                                      
 
                                                      
@@ -84,9 +84,9 @@
 
                                                      
                   
                                                      D()(expr_type::make(
-  G0()(proto::child_c<0>(expr), state, data),
+  G0()(proto::child_c<0>(expr), state, data),
   ...
-  GN()(proto::child_c<N>(expr), state, data)
+  GN()(proto::child_c<N>(expr), state, data)
 ))
                                                      
                 
                                                      
@@ -108,7 +108,7 @@
 
                                                      
 
 
                                                      
 
                                                      
 
                                                      
-PrevUpHomeNext
+PrevUpHomeNext
 
                                                      
 
 
diff --git a/doc/html/boost/proto/plus.html b/doc/html/boost/proto/plus.html
index f56d40de41..6bb70fe786 100644
--- a/doc/html/boost/proto/plus.html
+++ b/doc/html/boost/proto/plus.html
@@ -48,7 +48,7 @@
   };
 };
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    diff --git a/doc/html/boost/proto/plus/impl.html b/doc/html/boost/proto/plus/impl.html index 6f5862f930..cbf7c7b5a4 100644 --- a/doc/html/boost/proto/plus/impl.html +++ b/doc/html/boost/proto/plus/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    @@ -47,7 +47,7 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    diff --git a/doc/html/boost/proto/plus_assign.html b/doc/html/boost/proto/plus_assign.html index 3a6f2c92f4..c39fb60367 100644 --- a/doc/html/boost/proto/plus_assign.html +++ b/doc/html/boost/proto/plus_assign.html @@ -50,7 +50,7 @@ }; };
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    diff --git a/doc/html/boost/proto/plus_assign/impl.html b/doc/html/boost/proto/plus_assign/impl.html index 15c43da232..faaf3c7552 100644 --- a/doc/html/boost/proto/plus_assign/impl.html +++ b/doc/html/boost/proto/plus_assign/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    @@ -49,7 +49,7 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    diff --git a/doc/html/boost/proto/pod_generator.html b/doc/html/boost/proto/pod_generator.html index 71cf6c21bd..b1659da310 100644 --- a/doc/html/boost/proto/pod_generator.html +++ b/doc/html/boost/proto/pod_generator.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    @@ -36,16 +36,16 @@ struct pod_generator : proto::callable { // member classes/structs/unions template<typename This, typename Expr> - struct result<This(Expr)> { + struct result<This(Expr)> { // types - typedef Extends< Expr > type; + typedef Extends< Expr > type; }; - // public member functions - template<typename Expr> Extends< Expr > operator()(Expr const &) const; + // public member functions + template<typename Expr> Extends< Expr > operator()(Expr const &) const; };
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    Generators are intended for use as the first template parameter to the proto::domain<> @@ -55,10 +55,10 @@ initialzation for the wrapped object.

                                                    -

                                                    -pod_generator public member functions

                                                    +

                                                    +pod_generator public member functions

                                                    1. -
                                                      template<typename Expr> Extends< Expr > operator()(Expr const & expr) const;
                                                      +
                                                      template<typename Expr> Extends< Expr > operator()(Expr const & expr) const;
                                                      @@ -100,7 +100,7 @@
                                                      -PrevUpHomeNext +PrevUpHomeNext
                                                      diff --git a/doc/html/boost/proto/pod_generator/result_T_idm45506975282944.html b/doc/html/boost/proto/pod_generator/result_T_idm45506975282944.html new file mode 100644 index 0000000000..33ce3c8933 --- /dev/null +++ b/doc/html/boost/proto/pod_generator/result_T_idm45506975282944.html @@ -0,0 +1,55 @@ + + + + +Struct template result<This(Expr)> + + + + + + + + + + + + + + + +
                                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                      +
                                                      +
                                                      +PrevUpHomeNext +
                                                      +
                                                      +
                                                      +
                                                      +

                                                      Struct template result<This(Expr)>

                                                      +

                                                      boost::proto::pod_generator::result<This(Expr)>

                                                      +
                                                      +

                                                      Synopsis

                                                      +
                                                      // In header: <boost/proto/generate.hpp>
+
+
+template<typename This, typename Expr> 
+struct result<This(Expr)> {
+  // types
+  typedef Extends< Expr > type;
+};
                                                      +
                                                      + + + +
                                                      Copyright © 2008 Eric Niebler

                                                      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                      +
                                                      +
                                                      +
                                                      +PrevUpHomeNext +
                                                      + + diff --git a/doc/html/boost/proto/pod_generator/result_This_E_idp204740432.html b/doc/html/boost/proto/pod_generator/result_This_E_idp204740432.html deleted file mode 100644 index 1f5728d20b..0000000000 --- a/doc/html/boost/proto/pod_generator/result_This_E_idp204740432.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template result<This(Expr)> - - - - - - - - - - - - - - - -
                                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                      -
                                                      -
                                                      -PrevUpHomeNext -
                                                      -
                                                      -
                                                      -
                                                      -

                                                      Struct template result<This(Expr)>

                                                      -

                                                      boost::proto::pod_generator::result<This(Expr)>

                                                      -
                                                      -

                                                      Synopsis

                                                      -
                                                      // In header: <boost/proto/generate.hpp>
-
-
-template<typename This, typename Expr> 
-struct result<This(Expr)> {
-  // types
-  typedef Extends< Expr > type;
-};
                                                      -
                                                      - - - -
                                                      Copyright © 2008 Eric Niebler

                                                      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                      -
                                                      -
                                                      -
                                                      -PrevUpHomeNext -
                                                      - - diff --git a/doc/html/boost/proto/post_dec.html b/doc/html/boost/proto/post_dec.html index 9a78340692..2c758b15ff 100644 --- a/doc/html/boost/proto/post_dec.html +++ b/doc/html/boost/proto/post_dec.html @@ -52,7 +52,7 @@ }; };
                                                      -

                                                      Description

                                                      +

                                                      Description

                                                    diff --git a/doc/html/boost/proto/post_dec/impl.html b/doc/html/boost/proto/post_dec/impl.html index e4dff3c680..00ba0cef35 100644 --- a/doc/html/boost/proto/post_dec/impl.html +++ b/doc/html/boost/proto/post_dec/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    @@ -49,7 +49,7 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    diff --git a/doc/html/boost/proto/post_inc.html b/doc/html/boost/proto/post_inc.html index ada8a0d74f..89d90bd179 100644 --- a/doc/html/boost/proto/post_inc.html +++ b/doc/html/boost/proto/post_inc.html @@ -50,7 +50,7 @@ }; };
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    diff --git a/doc/html/boost/proto/post_inc/impl.html b/doc/html/boost/proto/post_inc/impl.html index b15f2e5e35..5c81267b73 100644 --- a/doc/html/boost/proto/post_inc/impl.html +++ b/doc/html/boost/proto/post_inc/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    @@ -49,7 +49,7 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    diff --git a/doc/html/boost/proto/pre_dec.html b/doc/html/boost/proto/pre_dec.html index 5af680bf32..5f51e5a725 100644 --- a/doc/html/boost/proto/pre_dec.html +++ b/doc/html/boost/proto/pre_dec.html @@ -50,7 +50,7 @@ }; };
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    diff --git a/doc/html/boost/proto/pre_dec/impl.html b/doc/html/boost/proto/pre_dec/impl.html index 43bab3a2ee..0de6e36757 100644 --- a/doc/html/boost/proto/pre_dec/impl.html +++ b/doc/html/boost/proto/pre_dec/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    @@ -47,7 +47,7 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    diff --git a/doc/html/boost/proto/pre_inc.html b/doc/html/boost/proto/pre_inc.html index 615965cf4b..22353a78c5 100644 --- a/doc/html/boost/proto/pre_inc.html +++ b/doc/html/boost/proto/pre_inc.html @@ -50,7 +50,7 @@ }; };
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    diff --git a/doc/html/boost/proto/pre_inc/impl.html b/doc/html/boost/proto/pre_inc/impl.html index 4236a0e5de..7c6de43f04 100644 --- a/doc/html/boost/proto/pre_inc/impl.html +++ b/doc/html/boost/proto/pre_inc/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    @@ -47,7 +47,7 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    diff --git a/doc/html/boost/proto/protect.html b/doc/html/boost/proto/protect.html index 197dc8e577..802bfbb7f0 100644 --- a/doc/html/boost/proto/protect.html +++ b/doc/html/boost/proto/protect.html @@ -44,7 +44,7 @@ }; };
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    When building higher order transforms with diff --git a/doc/html/boost/proto/protect/impl.html b/doc/html/boost/proto/protect/impl.html index b8535c88f6..b2a3dba857 100644 --- a/doc/html/boost/proto/protect/impl.html +++ b/doc/html/boost/proto/protect/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@

                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    @@ -49,7 +49,7 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    diff --git a/doc/html/boost/proto/result_of/as_child.html b/doc/html/boost/proto/result_of/as_child.html index 22c961cdb4..b791b1bded 100644 --- a/doc/html/boost/proto/result_of/as_child.html +++ b/doc/html/boost/proto/result_of/as_child.html @@ -28,7 +28,7 @@

                                                    Struct template as_child

                                                    boost::proto::result_of::as_child — A metafunction that computes the return type of the - proto::as_child() function.

                                                    + proto::as_child() function.

                                                    Synopsis

                                                    // In header: <boost/proto/traits.hpp>
@@ -39,7 +39,7 @@
   typedef typename Domain::template as_child< T >::result_type type;
 };
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    The proto::result_of::as_child<> metafunction turns types into Proto expression types, if they are not already, in a domain-specific way. It is used by Proto diff --git a/doc/html/boost/proto/result_of/as_env.html b/doc/html/boost/proto/result_of/as_env.html index e5a5c85034..2aeb485f3b 100644 --- a/doc/html/boost/proto/result_of/as_env.html +++ b/doc/html/boost/proto/result_of/as_env.html @@ -28,7 +28,7 @@

                                                    Struct template as_env

                                                    boost::proto::result_of::as_env — - Metafunction for computing the return type of proto::as_env(). + Metafunction for computing the return type of proto::as_env().

                                                    Synopsis

                                                    diff --git a/doc/html/boost/proto/result_of/as_expr.html b/doc/html/boost/proto/result_of/as_expr.html index 3034bce76e..51d641aea0 100644 --- a/doc/html/boost/proto/result_of/as_expr.html +++ b/doc/html/boost/proto/result_of/as_expr.html @@ -7,7 +7,7 @@ - + @@ -21,14 +21,14 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext

                                                    Struct template as_expr

                                                    boost::proto::result_of::as_expr — A metafunction that computes the return type of the - proto::as_expr() function.

                                                    + proto::as_expr() function.

                                                    Synopsis

                                                    // In header: <boost/proto/traits.hpp>
@@ -39,12 +39,12 @@
   typedef typename Domain::template as_expr< T >::result_type type;
 };
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    The proto::result_of::as_expr<> metafunction turns types into Proto expression types, if they are not already, in a domain-specific way. It is intended for use to compute the type of a local variable that can hold the result of the - proto::as_expr() function. + proto::as_expr() function.

                                                    See proto::domain::as_expr<> @@ -62,7 +62,7 @@

                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    diff --git a/doc/html/boost/proto/result_of/child.html b/doc/html/boost/proto/result_of/child.html index 6e31812bb3..9475a53419 100644 --- a/doc/html/boost/proto/result_of/child.html +++ b/doc/html/boost/proto/result_of/child.html @@ -37,7 +37,7 @@ struct child : proto::result_of::child_c<Expr, N::value> { };
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    proto::result_of::child<Expr, N> is equivalent to proto::result_of::child_c<Expr, N::value>. diff --git a/doc/html/boost/proto/result_of/child_c.html b/doc/html/boost/proto/result_of/child_c.html index 6841a95754..ce2d2b5bcf 100644 --- a/doc/html/boost/proto/result_of/child_c.html +++ b/doc/html/boost/proto/result_of/child_c.html @@ -40,14 +40,14 @@ typedef see-below type; };

                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    A metafunction that returns the type of the Nth child of a Proto expression. N must be 0 or less than Expr::proto_arity::value.

                                                    -

                                                    +

                                                    child_c public types

                                                    diff --git a/doc/html/boost/proto/result_of/deep_copy.html b/doc/html/boost/proto/result_of/deep_copy.html index fac180b9c8..d80c8752f4 100644 --- a/doc/html/boost/proto/result_of/deep_copy.html +++ b/doc/html/boost/proto/result_of/deep_copy.html @@ -28,7 +28,7 @@

                                                    Struct template deep_copy

                                                    boost::proto::result_of::deep_copy — A metafunction for calculating the return type of - proto::deep_copy().

                                                    + proto::deep_copy()                                                    .

                                                    Synopsis

                                                    // In header: <boost/proto/deep_copy.hpp>
@@ -39,10 +39,10 @@
   typedef unspecified type;
 };
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    A metafunction for calculating the return type of - proto::deep_copy(). The type + proto::deep_copy(). The type parameter Expr should be the type of a Proto expression tree. It should not be a reference type, nor should it be cv-qualified.

                                                    diff --git a/doc/html/boost/proto/result_of/env_var.html b/doc/html/boost/proto/result_of/env_var.html index 494a88578c..a74d9ecdbb 100644 --- a/doc/html/boost/proto/result_of/env_var.html +++ b/doc/html/boost/proto/result_of/env_var.html @@ -28,7 +28,7 @@

                                                    Struct template env_var

                                                    boost::proto::result_of::env_var — - Metafunction for computing the return type of proto::env_var(). + Metafunction for computing the return type of proto::env_var().

                                                    Synopsis

                                                    diff --git a/doc/html/boost/proto/result_of/eval.html b/doc/html/boost/proto/result_of/eval.html index 50e624a226..891db62a58 100644 --- a/doc/html/boost/proto/result_of/eval.html +++ b/doc/html/boost/proto/result_of/eval.html @@ -7,8 +7,8 @@ - - + + @@ -21,14 +21,14 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext

                                                    Struct template eval

                                                    boost::proto::result_of::eval — A metafunction for calculating the return type of - proto::eval() given a + proto::eval() given a certain Expr and Context types.

                                                    Synopsis

                                                    @@ -50,7 +50,7 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    diff --git a/doc/html/boost/proto/result_of/flatten.html b/doc/html/boost/proto/result_of/flatten.html index f17dea1afd..a7ec5f6c19 100644 --- a/doc/html/boost/proto/result_of/flatten.html +++ b/doc/html/boost/proto/result_of/flatten.html @@ -7,8 +7,8 @@ - - + + @@ -21,14 +21,14 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext

                                                    Struct template flatten

                                                    boost::proto::result_of::flatten — Metafunction that computes the return type of - proto::flatten()

                                                    + proto::flatten()

                                                    Synopsis

                                                    // In header: <boost/proto/fusion.hpp>
@@ -49,7 +49,7 @@
 
 
                                                    
 
                                                    
-PrevUpHomeNext
+PrevUpHomeNext
 
                                                    
 
 
diff --git a/doc/html/boost/proto/result_of/has_env_var.html b/doc/html/boost/proto/result_of/has_env_var.html
index d56e8db963..014d9b3b8f 100644
--- a/doc/html/boost/proto/result_of/has_env_var.html
+++ b/doc/html/boost/proto/result_of/has_env_var.html
@@ -28,7 +28,7 @@
 
                                                    
 
                                                    Struct template has_env_var
                                                    
 
                                                    boost::proto::result_of::has_env_var — 
-            Metafunction for computing the return type of proto::has_env_var().
+            Metafunction for computing the return type of proto::has_env_var().
           
                                                    
 
                                                    
 
                                                    Synopsis
                                                    
diff --git a/doc/html/boost/proto/result_of/left.html b/doc/html/boost/proto/result_of/left.html
index fccef89c62..a40d780d14 100644
--- a/doc/html/boost/proto/result_of/left.html
+++ b/doc/html/boost/proto/result_of/left.html
@@ -36,7 +36,7 @@
 struct left :  proto::result_of::child_c< Expr, 0 > {
 };
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    proto::result_of::left<Expr> is equivalent to proto::result_of::child_c<Expr, 0>. diff --git a/doc/html/boost/proto/result_of/make_exp_idm45506975105632.html b/doc/html/boost/proto/result_of/make_exp_idm45506975105632.html new file mode 100644 index 0000000000..c518ac6283 --- /dev/null +++ b/doc/html/boost/proto/result_of/make_exp_idm45506975105632.html @@ -0,0 +1,110 @@ + + + + +Struct template make_expr<Tag, Domain, A...> + + + + + + + + + + + + + + + +
                                                    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                    +

                                                    +
                                                    +PrevUpHomeNext +
                                                    +
                                                    +
                                                    +
                                                    +

                                                    Struct template make_expr<Tag, Domain, A...>

                                                    +

                                                    boost::proto::result_of::make_expr<Tag, Domain, A...> — Metafunction that computes the return type of the + proto::make_expr() + function, within the specified domain.

                                                    +
                                                    +

                                                    Synopsis

                                                    +
                                                    // In header: <boost/proto/make_expr.hpp>
+
+template<typename Tag, typename Domain, typename... A> 
+struct make_expr<Tag, Domain, A...> {
+  // types
+  typedef see-below type;
+};
                                                    +
                                                    +

                                                    Description

                                                    +

                                                    + Computes the return type of the + proto::make_expr() + function. +

                                                    +
                                                    +

                                                    +make_expr + public + types

                                                    +
                                                    1. +

                                                      +typedef see-below type;

                                                      +

                                                      + Let WRAP<X> be defined such that: +

                                                      +
                                                      +

                                                      +

                                                      +

                                                      + If proto::wants_basic_expr<typename Domain::proto_generator>::value + is true, then let E be + proto::basic_expr; otherwise, + let E be + proto::expr. +

                                                      +

                                                      + If Tag is + proto::tag::terminal, then + type is a typedef for + typename WRAP<A0>::type. +

                                                      +

                                                      + Otherwise, type is a typedef for + boost::result_of<Domain(E< + Tag, proto::listN< + typename WRAP<A>::type...> >)>::type +

                                                      +
                                                    +
                                                    +
                                                    +
                                                    + + + +
                                                    Copyright © 2008 Eric Niebler

                                                    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                    +
                                                    +
                                                    +
                                                    +PrevUpHomeNext +
                                                    + + diff --git a/doc/html/boost/proto/result_of/make_expr.html b/doc/html/boost/proto/result_of/make_expr.html index 80f164dca3..dbd3f363f0 100644 --- a/doc/html/boost/proto/result_of/make_expr.html +++ b/doc/html/boost/proto/result_of/make_expr.html @@ -7,8 +7,8 @@ - - + + @@ -21,14 +21,14 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext

                                                    Struct template make_expr

                                                    boost::proto::result_of::make_expr — Metafunction that computes the return type of the - proto::make_expr() + proto::make_expr() function, with a domain deduced from the domains of the children.

                                                    Synopsis

                                                    @@ -41,10 +41,10 @@ typedef typename proto::result_of::make_expr<Tag, D, A...>::type type; };
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    Computes the return type of the - proto::make_expr() function. + proto::make_expr() function.

                                                    In this specialization, the domain is deduced from the domains of the child types. @@ -52,7 +52,7 @@ is true, then another specialization is selected.

                                                    -

                                                    +

                                                    make_expr public types

                                                    @@ -79,7 +79,7 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    diff --git a/doc/html/boost/proto/result_of/make_expr_Tag_idp224914016.html b/doc/html/boost/proto/result_of/make_expr_Tag_idp224914016.html deleted file mode 100644 index 8bd2f18799..0000000000 --- a/doc/html/boost/proto/result_of/make_expr_Tag_idp224914016.html +++ /dev/null @@ -1,110 +0,0 @@ - - - - -Struct template make_expr<Tag, Domain, A...> - - - - - - - - - - - - - - - -
                                                    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                    -
                                                    -
                                                    -PrevUpHomeNext -
                                                    -
                                                    -
                                                    -
                                                    -

                                                    Struct template make_expr<Tag, Domain, A...>

                                                    -

                                                    boost::proto::result_of::make_expr<Tag, Domain, A...> — Metafunction that computes the return type of the - proto::make_expr() - function, within the specified domain.

                                                    -
                                                    -

                                                    Synopsis

                                                    -
                                                    // In header: <boost/proto/make_expr.hpp>
-
-template<typename Tag, typename Domain, typename... A> 
-struct make_expr<Tag, Domain, A...> {
-  // types
-  typedef see-below type;
-};
                                                    -
                                                    -

                                                    Description

                                                    -

                                                    - Computes the return type of the - proto::make_expr() - function. -

                                                    -
                                                    -

                                                    -make_expr - public - types

                                                    -
                                                    1. -

                                                      -typedef see-below type;

                                                      -

                                                      - Let WRAP<X> be defined such that: -

                                                      -
                                                      -

                                                      -

                                                      -

                                                      - If proto::wants_basic_expr<typename Domain::proto_generator>::value - is true, then let E be - proto::basic_expr; otherwise, - let E be - proto::expr. -

                                                      -

                                                      - If Tag is - proto::tag::terminal, then - type is a typedef for - typename WRAP<A0>::type. -

                                                      -

                                                      - Otherwise, type is a typedef for - boost::result_of<Domain(E< - Tag, proto::listN< - typename WRAP<A>::type...> >)>::type -

                                                      -
                                                    -
                                                    -
                                                    -
                                                    - - - -
                                                    Copyright © 2008 Eric Niebler

                                                    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                    -
                                                    -
                                                    -
                                                    -PrevUpHomeNext -
                                                    - - diff --git a/doc/html/boost/proto/result_of/right.html b/doc/html/boost/proto/result_of/right.html index 4f0f905057..c929287109 100644 --- a/doc/html/boost/proto/result_of/right.html +++ b/doc/html/boost/proto/result_of/right.html @@ -36,7 +36,7 @@ struct right : proto::result_of::child_c< Expr, 1 > { };
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    proto::result_of::right<Expr> is equivalent to proto::result_of::child_c<Expr, 1>. diff --git a/doc/html/boost/proto/result_of/unpack_e_idm45506975065392.html b/doc/html/boost/proto/result_of/unpack_e_idm45506975065392.html new file mode 100644 index 0000000000..1012084cc1 --- /dev/null +++ b/doc/html/boost/proto/result_of/unpack_e_idm45506975065392.html @@ -0,0 +1,73 @@ + + + + +Struct template unpack_expr<Tag, Domain, Sequence> + + + + + + + + + + + + + + + +
                                                    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                    +

                                                    +
                                                    +PrevUpHomeNext +
                                                    +
                                                    +
                                                    +
                                                    +

                                                    Struct template unpack_expr<Tag, Domain, Sequence>

                                                    +

                                                    boost::proto::result_of::unpack_expr<Tag, Domain, Sequence> — Metafunction that computes the return type of the + proto::unpack_expr() + function, within the specified domain. +

                                                    +
                                                    +

                                                    Synopsis

                                                    +
                                                    // In header: <boost/proto/make_expr.hpp>
+
+template<typename Tag, typename Domain, typename Sequence> 
+struct unpack_expr<Tag, Domain, Sequence> {
+  // types
+  typedef 
+    typename proto::result_of::make_expr<
+      Tag,
+      Domain,
+      typename fusion::result_of::value_at_c<S, 0>::type,
+      ...
+      typename fusion::result_of::value_at_c<S, N-1>::type
+    >::type
+   type;  // Where S is a RandomAccessSequence equivalent to Sequence, and N is the size of S.
+};
                                                    +
                                                    +

                                                    Description

                                                    +

                                                    + Computes the return type of the + proto::unpack_expr() + function. +

                                                    +
                                                    +
                                                    + + + +
                                                    Copyright © 2008 Eric Niebler

                                                    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                    +
                                                    +
                                                    +
                                                    +PrevUpHomeNext +
                                                    + + diff --git a/doc/html/boost/proto/result_of/unpack_expr.html b/doc/html/boost/proto/result_of/unpack_expr.html index 0feee3d265..a457d022cf 100644 --- a/doc/html/boost/proto/result_of/unpack_expr.html +++ b/doc/html/boost/proto/result_of/unpack_expr.html @@ -7,8 +7,8 @@ - - + + @@ -21,14 +21,14 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext

                                                    Struct template unpack_expr

                                                    boost::proto::result_of::unpack_expr — Metafunction that computes the return type of the - proto::unpack_expr() + proto::unpack_expr() function, with a domain deduced from the domains of the children.

                                                    @@ -48,10 +48,10 @@ type; // Where S is a Fusion RandomAccessSequence equivalent to Sequence, and N is the size of S. };
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    Compute the return type of the - proto::unpack_expr() + proto::unpack_expr() function.

                                                    @@ -74,7 +74,7 @@

                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    diff --git a/doc/html/boost/proto/result_of/unpack_expr_T_idp224954256.html b/doc/html/boost/proto/result_of/unpack_expr_T_idp224954256.html deleted file mode 100644 index 7bf6e9c05e..0000000000 --- a/doc/html/boost/proto/result_of/unpack_expr_T_idp224954256.html +++ /dev/null @@ -1,73 +0,0 @@ - - - - -Struct template unpack_expr<Tag, Domain, Sequence> - - - - - - - - - - - - - - - -
                                                    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                    -
                                                    -
                                                    -PrevUpHomeNext -
                                                    -
                                                    -
                                                    -
                                                    -

                                                    Struct template unpack_expr<Tag, Domain, Sequence>

                                                    -

                                                    boost::proto::result_of::unpack_expr<Tag, Domain, Sequence> — Metafunction that computes the return type of the - proto::unpack_expr() - function, within the specified domain. -

                                                    -
                                                    -

                                                    Synopsis

                                                    -
                                                    // In header: <boost/proto/make_expr.hpp>
-
-template<typename Tag, typename Domain, typename Sequence> 
-struct unpack_expr<Tag, Domain, Sequence> {
-  // types
-  typedef 
-    typename proto::result_of::make_expr<
-      Tag,
-      Domain,
-      typename fusion::result_of::value_at_c<S, 0>::type,
-      ...
-      typename fusion::result_of::value_at_c<S, N-1>::type
-    >::type
-   type;  // Where S is a RandomAccessSequence equivalent to Sequence, and N is the size of S.
-};
                                                    -
                                                    -

                                                    Description

                                                    -

                                                    - Computes the return type of the - proto::unpack_expr() - function. -

                                                    -
                                                    -
                                                    - - - -
                                                    Copyright © 2008 Eric Niebler

                                                    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                    -
                                                    -
                                                    -
                                                    -PrevUpHomeNext -
                                                    - - diff --git a/doc/html/boost/proto/result_of/value.html b/doc/html/boost/proto/result_of/value.html index 4746f671fb..dd960014a4 100644 --- a/doc/html/boost/proto/result_of/value.html +++ b/doc/html/boost/proto/result_of/value.html @@ -39,9 +39,9 @@ typedef see-below type; };
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    -

                                                    +

                                                    value public types

                                                    diff --git a/doc/html/boost/proto/reverse_fold_tree.html b/doc/html/boost/proto/reverse_fold_tree.html index cf12812a6c..f7e82d7f73 100644 --- a/doc/html/boost/proto/reverse_fold_tree.html +++ b/doc/html/boost/proto/reverse_fold_tree.html @@ -47,7 +47,7 @@ }; };
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    proto::reverse_fold_tree<> is useful for flattening trees into lists; for example, you might use proto::reverse_fold_tree<> diff --git a/doc/html/boost/proto/reverse_fold_tree/impl.html b/doc/html/boost/proto/reverse_fold_tree/impl.html index 2e757812cd..4e89089871 100644 --- a/doc/html/boost/proto/reverse_fold_tree/impl.html +++ b/doc/html/boost/proto/reverse_fold_tree/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@

                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    @@ -50,7 +50,7 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    diff --git a/doc/html/boost/proto/right_idm45506990886896.html b/doc/html/boost/proto/right_idm45506990886896.html new file mode 100644 index 0000000000..6e3e692fe7 --- /dev/null +++ b/doc/html/boost/proto/right_idm45506990886896.html @@ -0,0 +1,102 @@ + + + + +Function right + + + + + + + + + + + + + + + +
                                                    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                    +
                                                    +
                                                    +PrevUpHomeNext +
                                                    +
                                                    +
                                                    +
                                                    +

                                                    Function right

                                                    +

                                                    boost::proto::right — Return the right child of the specified binary Proto expression.

                                                    +
                                                    +

                                                    Synopsis

                                                    +
                                                    // In header: <boost/proto/traits.hpp>
+
+
+template<typename Expr> 
+  typename proto::result_of::right< Expr & >::type right(Expr & expr);
+template<typename Expr> 
+  typename proto::result_of::right< Expr const & >::type 
+  right(Expr const & expr);
                                                    +
                                                    +

                                                    Description

                                                    +

                                                    Return the right child of the specified binary Proto expression. The child is returned by reference.

                                                    +
                                                    ++++ + + + + + + + + + + + + + + + + + + +

                                                    Parameters:

                                                    ++++ + + + + +

                                                    expr

                                                    The Proto expression.

                                                    Requires:

                                                    		 +

                                                    + proto::is_expr<Expr>::value is + true. +

                                                    +

                                                    + 2 == Expr::proto_arity::value +

                                                    +

                                                    Returns:

                                                    + A reference to the right child of expr. +

                                                    Throws:

                                                    		Will not throw.
                                                    +
                                                    +
                                                    + + + +
                                                    Copyright © 2008 Eric Niebler

                                                    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                    +
                                                    +
                                                    +
                                                    +PrevUpHomeNext +
                                                    + + diff --git a/doc/html/boost/proto/right_idp227515216.html b/doc/html/boost/proto/right_idp227515216.html deleted file mode 100644 index 5eb169d5cf..0000000000 --- a/doc/html/boost/proto/right_idp227515216.html +++ /dev/null @@ -1,102 +0,0 @@ - - - - -Function right - - - - - - - - - - - - - - - -
                                                    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                    -
                                                    -
                                                    -PrevUpHomeNext -
                                                    -
                                                    -
                                                    -
                                                    -

                                                    Function right

                                                    -

                                                    boost::proto::right — Return the right child of the specified binary Proto expression.

                                                    -
                                                    -

                                                    Synopsis

                                                    -
                                                    // In header: <boost/proto/traits.hpp>
-
-
-template<typename Expr> 
-  typename proto::result_of::right< Expr & >::type right(Expr & expr);
-template<typename Expr> 
-  typename proto::result_of::right< Expr const & >::type 
-  right(Expr const & expr);
                                                    -
                                                    -

                                                    Description

                                                    -

                                                    Return the right child of the specified binary Proto expression. The child is returned by reference.

                                                    -
                                                    ---- - - - - - - - - - - - - - - - - - - -

                                                    Parameters:

                                                    ---- - - - - -

                                                    expr

                                                    The Proto expression.

                                                    Requires:

                                                    		 -

                                                    - proto::is_expr<Expr>::value is - true. -

                                                    -

                                                    - 2 == Expr::proto_arity::value -

                                                    -

                                                    Returns:

                                                    - A reference to the right child of expr. -

                                                    Throws:

                                                    		Will not throw.
                                                    -
                                                    -
                                                    - - - -
                                                    Copyright © 2008 Eric Niebler

                                                    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                    -
                                                    -
                                                    -
                                                    -PrevUpHomeNext -
                                                    - - diff --git a/doc/html/boost/proto/shift_left.html b/doc/html/boost/proto/shift_left.html index 795875bfa3..6e30feec41 100644 --- a/doc/html/boost/proto/shift_left.html +++ b/doc/html/boost/proto/shift_left.html @@ -50,7 +50,7 @@ }; };
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    diff --git a/doc/html/boost/proto/shift_left/impl.html b/doc/html/boost/proto/shift_left/impl.html index 02090dbac0..61c4bcaf89 100644 --- a/doc/html/boost/proto/shift_left/impl.html +++ b/doc/html/boost/proto/shift_left/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    @@ -49,7 +49,7 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    diff --git a/doc/html/boost/proto/shift_left_assign.html b/doc/html/boost/proto/shift_left_assign.html index 8419e60beb..ab1a87aee3 100644 --- a/doc/html/boost/proto/shift_left_assign.html +++ b/doc/html/boost/proto/shift_left_assign.html @@ -50,7 +50,7 @@ }; };
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    diff --git a/doc/html/boost/proto/shift_left_assign/impl.html b/doc/html/boost/proto/shift_left_assign/impl.html index 468b2528eb..5f06d43c2f 100644 --- a/doc/html/boost/proto/shift_left_assign/impl.html +++ b/doc/html/boost/proto/shift_left_assign/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    @@ -49,7 +49,7 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    diff --git a/doc/html/boost/proto/shift_right.html b/doc/html/boost/proto/shift_right.html index f5e7628d13..44cdd57c3c 100644 --- a/doc/html/boost/proto/shift_right.html +++ b/doc/html/boost/proto/shift_right.html @@ -50,7 +50,7 @@ }; };
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    diff --git a/doc/html/boost/proto/shift_right/impl.html b/doc/html/boost/proto/shift_right/impl.html index 522033b7d6..434a356e5b 100644 --- a/doc/html/boost/proto/shift_right/impl.html +++ b/doc/html/boost/proto/shift_right/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    @@ -49,7 +49,7 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    diff --git a/doc/html/boost/proto/shift_right_assign.html b/doc/html/boost/proto/shift_right_assign.html index 67a47dd0eb..7eecb8a99e 100644 --- a/doc/html/boost/proto/shift_right_assign.html +++ b/doc/html/boost/proto/shift_right_assign.html @@ -49,7 +49,7 @@ }; };
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    diff --git a/doc/html/boost/proto/shift_right_assign/impl.html b/doc/html/boost/proto/shift_right_assign/impl.html index 50b7a5e414..251ebee2a9 100644 --- a/doc/html/boost/proto/shift_right_assign/impl.html +++ b/doc/html/boost/proto/shift_right_assign/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    @@ -49,7 +49,7 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    diff --git a/doc/html/boost/proto/subscript.html b/doc/html/boost/proto/subscript.html index 8fa506855d..d933809a00 100644 --- a/doc/html/boost/proto/subscript.html +++ b/doc/html/boost/proto/subscript.html @@ -50,7 +50,7 @@ }; };
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    diff --git a/doc/html/boost/proto/subscript/impl.html b/doc/html/boost/proto/subscript/impl.html index b6dd27e354..013b465ef4 100644 --- a/doc/html/boost/proto/subscript/impl.html +++ b/doc/html/boost/proto/subscript/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    @@ -49,7 +49,7 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    diff --git a/doc/html/boost/proto/switch_.html b/doc/html/boost/proto/switch_.html index dcc7b82665..4277bb0077 100644 --- a/doc/html/boost/proto/switch_.html +++ b/doc/html/boost/proto/switch_.html @@ -52,7 +52,7 @@ }; };
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    An expression type E matches proto::switch_<C,T> if diff --git a/doc/html/boost/proto/switch_/impl.html b/doc/html/boost/proto/switch_/impl.html index eed034a6d9..43031e8fff 100644 --- a/doc/html/boost/proto/switch_/impl.html +++ b/doc/html/boost/proto/switch_/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@

                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    @@ -51,7 +51,7 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    diff --git a/doc/html/boost/proto/tag/terminal.html b/doc/html/boost/proto/tag/terminal.html index 30a65c494d..ee7e118f62 100644 --- a/doc/html/boost/proto/tag/terminal.html +++ b/doc/html/boost/proto/tag/terminal.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    @@ -46,7 +46,7 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    diff --git a/doc/html/boost/proto/term.html b/doc/html/boost/proto/term.html index 501f4d28a1..f39b8de8b4 100644 --- a/doc/html/boost/proto/term.html +++ b/doc/html/boost/proto/term.html @@ -44,7 +44,7 @@ static const long arity; // = 0; };
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    A type sequence with one element, for use as the 2nd parameter to the proto::expr<> and diff --git a/doc/html/boost/proto/terminal.html b/doc/html/boost/proto/terminal.html index 01998acf0e..834eb7b3a7 100644 --- a/doc/html/boost/proto/terminal.html +++ b/doc/html/boost/proto/terminal.html @@ -46,13 +46,13 @@ // types typedef Expr result_type; - // public member functions - Expr operator()(typename impl::expr_param, typename impl::state_param, + // public member functions + Expr operator()(typename impl::expr_param, typename impl::state_param, typename impl::data_param) const; }; };

                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    diff --git a/doc/html/boost/proto/terminal/impl.html b/doc/html/boost/proto/terminal/impl.html index e0d1a82aac..d14b09f462 100644 --- a/doc/html/boost/proto/terminal/impl.html +++ b/doc/html/boost/proto/terminal/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    @@ -38,17 +38,17 @@ // types typedef Expr result_type; - // public member functions - Expr operator()(typename impl::expr_param, typename impl::state_param, + // public member functions + Expr operator()(typename impl::expr_param, typename impl::state_param, typename impl::data_param) const; };
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    -

                                                    -impl public member functions

                                                    +

                                                    +impl public member functions

                                                    1. -
                                                      Expr operator()(typename impl::expr_param expr, typename impl::state_param, 
+
                                                      Expr operator()(typename impl::expr_param expr, typename impl::state_param, 
                 typename impl::data_param) const;
                                                      
 
                                                      @@ -101,7 +101,7 @@
 
                                                      
 

                                                      
 
                                                      
 
                                                      
-PrevUpHomeNext
+PrevUpHomeNext
 
                                                      
 
 
diff --git a/doc/html/boost/proto/transform.html b/doc/html/boost/proto/transform.html
index b8b0645b0b..eff93e0cb2 100644
--- a/doc/html/boost/proto/transform.html
+++ b/doc/html/boost/proto/transform.html
@@ -8,7 +8,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
                                                      
 
                                                      
 
                                                      
-PrevUpHomeNext
+PrevUpHomeNext
 
                                                      
 
                                                      
 
                                                      
@@ -39,48 +39,48 @@
 
   // member classes/structs/unions
   template<typename This, typename Expr> 
-  struct result<This(Expr)> {
+  struct result<This(Expr)> {
     // types
-    typedef typename PrimitiveTransform::template impl< Expr, unspecified, unspecified >::result_type type;
+    typedef typename PrimitiveTransform::template impl< Expr, unspecified, unspecified >::result_type type;
   };
   template<typename This, typename Expr, typename State> 
-  struct result<This(Expr, State)> {
+  struct result<This(Expr, State)> {
     // types
-    typedef typename PrimitiveTransform::template impl< Expr, State, unspecified >::result_type type;
+    typedef typename PrimitiveTransform::template impl< Expr, State, unspecified >::result_type type;
   };
   template<typename This, typename Expr, typename State, typename Data> 
-  struct result<This(Expr, State, Data)> {
+  struct result<This(Expr, State, Data)> {
     // types
-    typedef typename PrimitiveTransform::template impl< Expr, State, Data >::result_type type;
+    typedef typename PrimitiveTransform::template impl< Expr, State, Data >::result_type type;
   };
 
-  // public member functions
+  // public member functions
   template<typename Expr> 
     typename PrimitiveTransform::template impl<Expr &, unspecified, unspecified>::result_type 
-    operator()(Expr &) const;
+    operator()(Expr &) const;
   template<typename Expr, typename State> 
     typename PrimitiveTransform::template impl<Expr &, State &, unspecified>::result_type 
-    operator()(Expr &, State &) const;
+    operator()(Expr &, State &) const;
   template<typename Expr, typename State> 
     typename PrimitiveTransform::template impl<Expr &, State const &, unspecified>::result_type 
-    operator()(Expr &, State const &) const;
+    operator()(Expr &, State const &) const;
   template<typename Expr, typename State, typename Data> 
     typename PrimitiveTransform::template impl<Expr &, State &, Data &>::result_type 
-    operator()(Expr &, State &, Data &) const;
+    operator()(Expr &, State &, Data &) const;
   template<typename Expr, typename State, typename Data> 
     typename PrimitiveTransform::template impl<Expr &, State const &, Data &>::result_type 
-    operator()(Expr &, State const &, Data &) const;
+    operator()(Expr &, State const &, Data &) const;
 };
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    -

                                                    -transform public member functions

                                                    +

                                                    +transform public member functions

                                                    1. template<typename Expr> 
   typename PrimitiveTransform::template impl<Expr &, unspecified, unspecified>::result_type 
-  operator()(Expr & expr) const;
                                                      + operator()(Expr & expr) const;
                                                      @@ -97,7 +97,7 @@ 
                                                    2. template<typename Expr, typename State> 
   typename PrimitiveTransform::template impl<Expr &, State &, unspecified>::result_type 
-  operator()(Expr & expr, State & state) const;
                                                      + operator()(Expr & expr, State & state) const;
                                                      3. @@ -114,7 +114,7 @@ 
                                                    3. template<typename Expr, typename State> 
   typename PrimitiveTransform::template impl<Expr &, State const &, unspecified>::result_type 
-  operator()(Expr & expr, State const & state) const;
                                                      + operator()(Expr & expr, State const & state) const;
                                                      4. @@ -131,7 +131,7 @@ 
                                                    4. template<typename Expr, typename State, typename Data> 
   typename PrimitiveTransform::template impl<Expr &, State &, Data &>::result_type 
-  operator()(Expr & expr, State & state, Data & data) const;
                                                      + operator()(Expr & expr, State & state, Data & data) const;
                                                      5. @@ -148,7 +148,7 @@ 
                                                    5. template<typename Expr, typename State, typename Data> 
   typename PrimitiveTransform::template impl<Expr &, State const &, Data &>::result_type 
-  operator()(Expr & expr, State const & state, Data & data) const;
                                                      + operator()(Expr & expr, State const & state, Data & data) const;
                                                      6. @@ -176,7 +176,7 @@
                                                      -PrevUpHomeNext +PrevUpHomeNext
                                                      diff --git a/doc/html/boost/proto/transform/result_T_idm45506984144464.html b/doc/html/boost/proto/transform/result_T_idm45506984144464.html new file mode 100644 index 0000000000..36a25bd651 --- /dev/null +++ b/doc/html/boost/proto/transform/result_T_idm45506984144464.html @@ -0,0 +1,55 @@ + + + + +Struct template result<This(Expr, State, Data)> + + + + + + + + + + + + + + + +
                                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                      +
                                                      +
                                                      +PrevUpHomeNext +
                                                      +
                                                      +
                                                      +
                                                      +

                                                      Struct template result<This(Expr, State, Data)>

                                                      +

                                                      boost::proto::transform::result<This(Expr, State, Data)>

                                                      +
                                                      +

                                                      Synopsis

                                                      +
                                                      // In header: <boost/proto/transform/impl.hpp>
+
+
+template<typename This, typename Expr, typename State, typename Data> 
+struct result<This(Expr, State, Data)> {
+  // types
+  typedef typename PrimitiveTransform::template impl< Expr, State, Data >::result_type type;
+};
                                                      +
                                                      + + + +
                                                      Copyright © 2008 Eric Niebler

                                                      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                      +
                                                      +
                                                      +
                                                      +PrevUpHomeNext +
                                                      + + diff --git a/doc/html/boost/proto/transform/result_T_idm45506984149872.html b/doc/html/boost/proto/transform/result_T_idm45506984149872.html new file mode 100644 index 0000000000..cc079e6d29 --- /dev/null +++ b/doc/html/boost/proto/transform/result_T_idm45506984149872.html @@ -0,0 +1,55 @@ + + + + +Struct template result<This(Expr, State)> + + + + + + + + + + + + + + + +
                                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                      +
                                                      +
                                                      +PrevUpHomeNext +
                                                      +
                                                      +
                                                      +
                                                      +

                                                      Struct template result<This(Expr, State)>

                                                      +

                                                      boost::proto::transform::result<This(Expr, State)>

                                                      +
                                                      +

                                                      Synopsis

                                                      +
                                                      // In header: <boost/proto/transform/impl.hpp>
+
+
+template<typename This, typename Expr, typename State> 
+struct result<This(Expr, State)> {
+  // types
+  typedef typename PrimitiveTransform::template impl< Expr, State, unspecified >::result_type type;
+};
                                                      +
                                                      + + + +
                                                      Copyright © 2008 Eric Niebler

                                                      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                      +
                                                      +
                                                      +
                                                      +PrevUpHomeNext +
                                                      + + diff --git a/doc/html/boost/proto/transform/result_T_idm45506984155152.html b/doc/html/boost/proto/transform/result_T_idm45506984155152.html new file mode 100644 index 0000000000..f3942464a0 --- /dev/null +++ b/doc/html/boost/proto/transform/result_T_idm45506984155152.html @@ -0,0 +1,55 @@ + + + + +Struct template result<This(Expr)> + + + + + + + + + + + + + + + +
                                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                      +
                                                      +
                                                      +PrevUpHomeNext +
                                                      +
                                                      +
                                                      +
                                                      +

                                                      Struct template result<This(Expr)>

                                                      +

                                                      boost::proto::transform::result<This(Expr)>

                                                      +
                                                      +

                                                      Synopsis

                                                      +
                                                      // In header: <boost/proto/transform/impl.hpp>
+
+
+template<typename This, typename Expr> 
+struct result<This(Expr)> {
+  // types
+  typedef typename PrimitiveTransform::template impl< Expr, unspecified, unspecified >::result_type type;
+};
                                                      +
                                                      + + + +
                                                      Copyright © 2008 Eric Niebler

                                                      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                      +
                                                      +
                                                      +
                                                      +PrevUpHomeNext +
                                                      + + diff --git a/doc/html/boost/proto/transform/result_This_E_idp213168496.html b/doc/html/boost/proto/transform/result_This_E_idp213168496.html deleted file mode 100644 index 73652d31c7..0000000000 --- a/doc/html/boost/proto/transform/result_This_E_idp213168496.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template result<This(Expr)> - - - - - - - - - - - - - - - -
                                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                      -
                                                      -
                                                      -PrevUpHomeNext -
                                                      -
                                                      -
                                                      -
                                                      -

                                                      Struct template result<This(Expr)>

                                                      -

                                                      boost::proto::transform::result<This(Expr)>

                                                      -
                                                      -

                                                      Synopsis

                                                      -
                                                      // In header: <boost/proto/transform/impl.hpp>
-
-
-template<typename This, typename Expr> 
-struct result<This(Expr)> {
-  // types
-  typedef typename PrimitiveTransform::template impl< Expr, unspecified, unspecified >::result_type type;
-};
                                                      -
                                                      - - - -
                                                      Copyright © 2008 Eric Niebler

                                                      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                      -
                                                      -
                                                      -
                                                      -PrevUpHomeNext -
                                                      - - diff --git a/doc/html/boost/proto/transform/result_This_E_idp213173776.html b/doc/html/boost/proto/transform/result_This_E_idp213173776.html deleted file mode 100644 index bdc955857f..0000000000 --- a/doc/html/boost/proto/transform/result_This_E_idp213173776.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template result<This(Expr, State)> - - - - - - - - - - - - - - - -
                                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                      -
                                                      -
                                                      -PrevUpHomeNext -
                                                      -
                                                      -
                                                      -
                                                      -

                                                      Struct template result<This(Expr, State)>

                                                      -

                                                      boost::proto::transform::result<This(Expr, State)>

                                                      -
                                                      -

                                                      Synopsis

                                                      -
                                                      // In header: <boost/proto/transform/impl.hpp>
-
-
-template<typename This, typename Expr, typename State> 
-struct result<This(Expr, State)> {
-  // types
-  typedef typename PrimitiveTransform::template impl< Expr, State, unspecified >::result_type type;
-};
                                                      -
                                                      - - - -
                                                      Copyright © 2008 Eric Niebler

                                                      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                      -
                                                      -
                                                      -
                                                      -PrevUpHomeNext -
                                                      - - diff --git a/doc/html/boost/proto/transform/result_This_E_idp213179184.html b/doc/html/boost/proto/transform/result_This_E_idp213179184.html deleted file mode 100644 index 42cf35a4de..0000000000 --- a/doc/html/boost/proto/transform/result_This_E_idp213179184.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template result<This(Expr, State, Data)> - - - - - - - - - - - - - - - -
                                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                      -
                                                      -
                                                      -PrevUpHomeNext -
                                                      -
                                                      -
                                                      -
                                                      -

                                                      Struct template result<This(Expr, State, Data)>

                                                      -

                                                      boost::proto::transform::result<This(Expr, State, Data)>

                                                      -
                                                      -

                                                      Synopsis

                                                      -
                                                      // In header: <boost/proto/transform/impl.hpp>
-
-
-template<typename This, typename Expr, typename State, typename Data> 
-struct result<This(Expr, State, Data)> {
-  // types
-  typedef typename PrimitiveTransform::template impl< Expr, State, Data >::result_type type;
-};
                                                      -
                                                      - - - -
                                                      Copyright © 2008 Eric Niebler

                                                      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                      -
                                                      -
                                                      -
                                                      -PrevUpHomeNext -
                                                      - - diff --git a/doc/html/boost/proto/transform_impl.html b/doc/html/boost/proto/transform_impl.html index f1574cb43c..db07a393c1 100644 --- a/doc/html/boost/proto/transform_impl.html +++ b/doc/html/boost/proto/transform_impl.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                                                      -PrevUpHomeNext +PrevUpHomeNext
                                                      @@ -53,7 +53,7 @@
                                                      -PrevUpHomeNext +PrevUpHomeNext
                                                      diff --git a/doc/html/boost/proto/transforms.html b/doc/html/boost/proto/transforms.html index 29a8746d5e..bb8347b15a 100644 --- a/doc/html/boost/proto/transforms.html +++ b/doc/html/boost/proto/transforms.html @@ -34,7 +34,7 @@ proto::transforms_type const transforms;
                                                      -

                                                      Description

                                                      +

                                                      Description

                                                      A key key for use when creating and accessing a slot in a transform environment for a set of external transforms. diff --git a/doc/html/boost/proto/transforms_type.html b/doc/html/boost/proto/transforms_type.html index f6fd732bbe..fe159b4b81 100644 --- a/doc/html/boost/proto/transforms_type.html +++ b/doc/html/boost/proto/transforms_type.html @@ -39,26 +39,26 @@ struct transforms_type { - // public member functions + // public member functions template<typename Value> - env<transforms_type, see-below> operator=(Value &) const; + env<transforms_type, see-below> operator=(Value &) const; template<typename Value> - env<transforms_type, see-below> operator=(Value const &) const; + env<transforms_type, see-below> operator=(Value const &) const; };

                                                      -

                                                      Description

                                                      +

                                                      Description

                                                      The proto::transforms_type type, along with the proto::transforms global, are declared using the BOOST_PROTO_DEFINE_ENV_VAR() macro.

                                                      -

                                                      -transforms_type public member functions

                                                      +

                                                      +transforms_type public member functions

                                                      1. -
                                                        template<typename Value> 
-  env<transforms_type, see-below> operator=(Value & value) const;
+
                                                        template<typename Value> 
+  env<transforms_type, see-below> operator=(Value & value) const;
 template<typename Value> 
-  env<transforms_type, see-below> operator=(Value const & value) const;
                                                        
+  env<transforms_type, see-below> operator=(Value const & value) const;

                                                        If Value is a specialization boost::reference_wrapper<T>, this function returns env<transforms_type, T &>(value.get()). diff --git a/doc/html/boost/proto/unary_expr.html b/doc/html/boost/proto/unary_expr.html index df84e7389e..7fee0edae2 100644 --- a/doc/html/boost/proto/unary_expr.html +++ b/doc/html/boost/proto/unary_expr.html @@ -51,7 +51,7 @@ }; };

                                                      -

                                                      Description

                                                      +

                                                      Description

                                                      Use proto::unary_expr<proto::_, proto::_> as a grammar element to match any unary expression. diff --git a/doc/html/boost/proto/unary_expr/impl.html b/doc/html/boost/proto/unary_expr/impl.html index 408d152c26..9e437dbf05 100644 --- a/doc/html/boost/proto/unary_expr/impl.html +++ b/doc/html/boost/proto/unary_expr/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@

                                                      -PrevUpHomeNext +PrevUpHomeNext
                                                      @@ -49,7 +49,7 @@
                                                      -PrevUpHomeNext +PrevUpHomeNext
                                                      diff --git a/doc/html/boost/proto/unary_plus.html b/doc/html/boost/proto/unary_plus.html index c0aa04d84d..76403736d5 100644 --- a/doc/html/boost/proto/unary_plus.html +++ b/doc/html/boost/proto/unary_plus.html @@ -50,7 +50,7 @@ }; };
                                                      -

                                                      Description

                                                      +

                                                      Description

                                                      diff --git a/doc/html/boost/proto/unary_plus/impl.html b/doc/html/boost/proto/unary_plus/impl.html index cbd57be715..fd5469ad58 100644 --- a/doc/html/boost/proto/unary_plus/impl.html +++ b/doc/html/boost/proto/unary_plus/impl.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                                      -PrevUpHomeNext +PrevUpHomeNext
                                                      @@ -49,7 +49,7 @@
                                                      -PrevUpHomeNext +PrevUpHomeNext
                                                      diff --git a/doc/html/boost/proto/unexpr.html b/doc/html/boost/proto/unexpr.html index cea3a1bd78..189f8c0005 100644 --- a/doc/html/boost/proto/unexpr.html +++ b/doc/html/boost/proto/unexpr.html @@ -36,10 +36,10 @@ template<typename Expr> struct unexpr : Expr { // construct/copy/destruct - unexpr(Expr const &); + unexpr(Expr const &); };
                                                      -

                                                      Description

                                                      +

                                                      Description

                                                      For an expression type E, @@ -50,11 +50,11 @@ is false.

                                                      -

                                                      +

                                                      unexpr public construct/copy/destruct

                                                      -
                                                      1. unexpr(Expr const & expr);
                                                      +
                                                      1. unexpr(Expr const & expr);
                                                      diff --git a/doc/html/boost/proto/unpack_e_idm45506975022288.html b/doc/html/boost/proto/unpack_e_idm45506975022288.html new file mode 100644 index 0000000000..f4f0128b2d --- /dev/null +++ b/doc/html/boost/proto/unpack_e_idm45506975022288.html @@ -0,0 +1,128 @@ + + + + +Function unpack_expr + + + + + + + + + + + + + + + +
                                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                      +
                                                      +
                                                      +PrevUpHomeNext +
                                                      +
                                                      +
                                                      +
                                                      +

                                                      Function unpack_expr

                                                      +

                                                      boost::proto::unpack_expr — Construct an expression of the requested tag type with a domain and with children + from the specified Fusion Forward Sequence.

                                                      +
                                                      +

                                                      Synopsis

                                                      +
                                                      // In header: <boost/proto/make_expr.hpp>
+
+
+template<typename Tag, typename Sequence> 
+  typename proto::result_of::unpack_expr<Tag, Sequence const>::type const 
+  unpack_expr(Sequence const & sequence);
+template<typename Tag, typename Domain, typename Sequence> 
+  typename proto::result_of::unpack_expr<Tag, Domain, Sequence const>::type const 
+  unpack_expr(Sequence const & sequence);
                                                      +
                                                      +

                                                      Description

                                                      +

                                                      + This function template may be invoked either with or without specifying a + Domain argument. If no domain is specified, the domain + is deduced by examining domains of each element of the sequence. See + proto::deduce_domain for a full + description of the procedure used. +

                                                      +

                                                      + Let s be a Fusion RandomAccessSequence equivalent to + sequence. + Let WRAP(N, s) be defined such that: +

                                                      +
                                                        +

                                                      • + If fusion::result_of::value_at_c<decltype(s),N>::type is a reference type + or an instantiation of boost::reference_wrapper<>, + WRAP(N, s) is equivalent to + proto::as_child<Domain>(fusion::at_c<N>(s)). +

                                                        • +

                                                      • + Otherwise, WRAP(N, s) is equivalent to + proto::as_expr<Domain>(fusion::at_c<N>(s)). +

                                                        • +
                                                      +

                                                      +

                                                      +

                                                      + If proto::wants_basic_expr<typename Domain::proto_generator>::value + is true, then let E be + proto::basic_expr; otherwise, + let E be + proto::expr. +

                                                      +

                                                      + Let MAKE(Tag, b...) be defined as + E<Tag, + proto::listN<decltype(b)...> >::make(b...). +

                                                      +

                                                      + If Tag is + proto::tag::terminal, then return + WRAP(0, s). +

                                                      +

                                                      + Otherwise, return + Domain()(MAKE(Tag, WRAP(0, s),... + WRAP(N-1, s))), where + N is the size of Sequence. +

                                                      +
                                                      ++++ + + + + +

                                                      Parameters:

                                                      ++++ + + + + +

                                                      sequence

                                                      A Fusion Forward Sequence.

                                                      +
                                                      +
                                                      + + + +
                                                      Copyright © 2008 Eric Niebler

                                                      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                      +
                                                      +
                                                      +
                                                      +PrevUpHomeNext +
                                                      + + diff --git a/doc/html/boost/proto/unpack_expr_idp224997360.html b/doc/html/boost/proto/unpack_expr_idp224997360.html deleted file mode 100644 index b58d53b61c..0000000000 --- a/doc/html/boost/proto/unpack_expr_idp224997360.html +++ /dev/null @@ -1,128 +0,0 @@ - - - - -Function unpack_expr - - - - - - - - - - - - - - - -
                                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                      -
                                                      -
                                                      -PrevUpHomeNext -
                                                      -
                                                      -
                                                      -
                                                      -

                                                      Function unpack_expr

                                                      -

                                                      boost::proto::unpack_expr — Construct an expression of the requested tag type with a domain and with children - from the specified Fusion Forward Sequence.

                                                      -
                                                      -

                                                      Synopsis

                                                      -
                                                      // In header: <boost/proto/make_expr.hpp>
-
-
-template<typename Tag, typename Sequence> 
-  typename proto::result_of::unpack_expr<Tag, Sequence const>::type const 
-  unpack_expr(Sequence const & sequence);
-template<typename Tag, typename Domain, typename Sequence> 
-  typename proto::result_of::unpack_expr<Tag, Domain, Sequence const>::type const 
-  unpack_expr(Sequence const & sequence);
                                                      -
                                                      -

                                                      Description

                                                      -

                                                      - This function template may be invoked either with or without specifying a - Domain argument. If no domain is specified, the domain - is deduced by examining domains of each element of the sequence. See - proto::deduce_domain for a full - description of the procedure used. -

                                                      -

                                                      - Let s be a Fusion RandomAccessSequence equivalent to - sequence. - Let WRAP(N, s) be defined such that: -

                                                      -
                                                        -

                                                      • - If fusion::result_of::value_at_c<decltype(s),N>::type is a reference type - or an instantiation of boost::reference_wrapper<>, - WRAP(N, s) is equivalent to - proto::as_child<Domain>(fusion::at_c<N>(s)). -

                                                        • -

                                                      • - Otherwise, WRAP(N, s) is equivalent to - proto::as_expr<Domain>(fusion::at_c<N>(s)). -

                                                        • -
                                                      -

                                                      -

                                                      -

                                                      - If proto::wants_basic_expr<typename Domain::proto_generator>::value - is true, then let E be - proto::basic_expr; otherwise, - let E be - proto::expr. -

                                                      -

                                                      - Let MAKE(Tag, b...) be defined as - E<Tag, - proto::listN<decltype(b)...> >::make(b...). -

                                                      -

                                                      - If Tag is - proto::tag::terminal, then return - WRAP(0, s). -

                                                      -

                                                      - Otherwise, return - Domain()(MAKE(Tag, WRAP(0, s),... - WRAP(N-1, s))), where - N is the size of Sequence. -

                                                      -
                                                      ---- - - - - -

                                                      Parameters:

                                                      ---- - - - - -

                                                      sequence

                                                      A Fusion Forward Sequence.

                                                      -
                                                      -
                                                      - - - -
                                                      Copyright © 2008 Eric Niebler

                                                      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                      -
                                                      -
                                                      -
                                                      -PrevUpHomeNext -
                                                      - - diff --git a/doc/html/boost/proto/use_basic_expr.html b/doc/html/boost/proto/use_basic_expr.html index af0d9d6d7d..19ef749eec 100644 --- a/doc/html/boost/proto/use_basic_expr.html +++ b/doc/html/boost/proto/use_basic_expr.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                                                      -PrevUpHomeNext +PrevUpHomeNext
                                                      @@ -36,7 +36,7 @@ struct use_basic_expr : Generator { };
                                                      -

                                                      Description

                                                      +

                                                      Description

                                                      Annotate a generator to indicate that it would prefer to be passed instances of @@ -58,7 +58,7 @@

                                                      -PrevUpHomeNext +PrevUpHomeNext
                                                      diff --git a/doc/html/boost/proto/value_idm45506990913840.html b/doc/html/boost/proto/value_idm45506990913840.html new file mode 100644 index 0000000000..c66e055985 --- /dev/null +++ b/doc/html/boost/proto/value_idm45506990913840.html @@ -0,0 +1,84 @@ + + + + +Function value + + + + + + + + + + + + + + + +
                                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                      +
                                                      +
                                                      +PrevUpHomeNext +
                                                      +
                                                      +
                                                      +
                                                      +

                                                      Function value

                                                      +

                                                      boost::proto::value — Return the value stored within the specified Proto terminal expression.

                                                      +
                                                      +

                                                      Synopsis

                                                      +
                                                      // In header: <boost/proto/traits.hpp>
+
+
+template<typename Expr> 
+  typename proto::result_of::value< Expr & >::type value(Expr & expr);
+template<typename Expr> 
+  typename proto::result_of::value< Expr const & >::type 
+  value(Expr const & expr);
                                                      +
                                                      +

                                                      Description

                                                      +

                                                      + Return the the value stored within the specified Proto terminal expression. The value is + returned by reference. +

                                                      +
                                                      ++++ + + + + + + + + + + + + + + +

                                                      Requires:

                                                      + 0 == Expr::proto_arity::value +

                                                      Returns:

                                                      A reference to the terminal's value

                                                      Throws:

                                                      		Will not throw.
                                                      +
                                                      +
                                                      + + + +
                                                      Copyright © 2008 Eric Niebler

                                                      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                      +
                                                      +
                                                      +
                                                      +PrevUpHomeNext +
                                                      + + diff --git a/doc/html/boost/proto/value_idp227488272.html b/doc/html/boost/proto/value_idp227488272.html deleted file mode 100644 index 6bb53196f8..0000000000 --- a/doc/html/boost/proto/value_idp227488272.html +++ /dev/null @@ -1,84 +0,0 @@ - - - - -Function value - - - - - - - - - - - - - - - -
                                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                      -
                                                      -
                                                      -PrevUpHomeNext -
                                                      -
                                                      -
                                                      -
                                                      -

                                                      Function value

                                                      -

                                                      boost::proto::value — Return the value stored within the specified Proto terminal expression.

                                                      -
                                                      -

                                                      Synopsis

                                                      -
                                                      // In header: <boost/proto/traits.hpp>
-
-
-template<typename Expr> 
-  typename proto::result_of::value< Expr & >::type value(Expr & expr);
-template<typename Expr> 
-  typename proto::result_of::value< Expr const & >::type 
-  value(Expr const & expr);
                                                      -
                                                      -

                                                      Description

                                                      -

                                                      - Return the the value stored within the specified Proto terminal expression. The value is - returned by reference. -

                                                      -
                                                      ---- - - - - - - - - - - - - - - -

                                                      Requires:

                                                      - 0 == Expr::proto_arity::value -

                                                      Returns:

                                                      A reference to the terminal's value

                                                      Throws:

                                                      		Will not throw.
                                                      -
                                                      -
                                                      - - - -
                                                      Copyright © 2008 Eric Niebler

                                                      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                      -
                                                      -
                                                      -
                                                      -PrevUpHomeNext -
                                                      - - diff --git a/doc/html/boost/proto/vararg.html b/doc/html/boost/proto/vararg.html index 5cbe2cfdbb..e4f6a5a91f 100644 --- a/doc/html/boost/proto/vararg.html +++ b/doc/html/boost/proto/vararg.html @@ -36,7 +36,7 @@ struct vararg { };
                                                      -

                                                      Description

                                                      +

                                                      Description

                                                      An expression type proto::basic_expr<AT, proto::listN<A0,...An,U0,...Um> > diff --git a/doc/html/boost/proto/wants_basic_expr.html b/doc/html/boost/proto/wants_basic_expr.html index a1b2dde5de..81499e1747 100644 --- a/doc/html/boost/proto/wants_basic_expr.html +++ b/doc/html/boost/proto/wants_basic_expr.html @@ -36,7 +36,7 @@ struct wants_basic_expr : mpl::bool_< true-or-false > { };

                                                      -

                                                      Description

                                                      +

                                                      Description

                                                      A Boolean metafunction that tests a generator to see whether it would prefer to be passed instances of diff --git a/doc/html/boost/proto/when.html b/doc/html/boost/proto/when.html index 6afc4fb608..3e1b2f26b3 100644 --- a/doc/html/boost/proto/when.html +++ b/doc/html/boost/proto/when.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@

                                                      -PrevUpHomeNext +PrevUpHomeNext
                                                      @@ -39,7 +39,7 @@ typedef typename Grammar::proto_grammar proto_grammar; };
                                                      -

                                                      Description

                                                      +

                                                      Description

                                                      Use proto::when<> to override a grammar's default transform with a custom transform. It is for used when composing larger transforms by @@ -82,7 +82,7 @@

                                                      -PrevUpHomeNext +PrevUpHomeNext
                                                      diff --git a/doc/html/boost/proto/when_Gra_idm45506983606192.html b/doc/html/boost/proto/when_Gra_idm45506983606192.html new file mode 100644 index 0000000000..810706271f --- /dev/null +++ b/doc/html/boost/proto/when_Gra_idm45506983606192.html @@ -0,0 +1,93 @@ + + + + +Struct template when<Grammar, proto::external_transform> + + + + + + + + + + + + + + + +
                                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                      +
                                                      +
                                                      +PrevUpHomeNext +
                                                      +
                                                      +
                                                      +
                                                      +

                                                      Struct template when<Grammar, proto::external_transform>

                                                      +

                                                      boost::proto::when<Grammar, > — A grammar element that associates an externally-specified transform with the grammar. + The transform is looked up in the Data parameter using the Grammar as a key.

                                                      +
                                                      +

                                                      Synopsis

                                                      +
                                                      // In header: <boost/proto/transform/when.hpp>
+
+template<typename Grammar> 
+struct when<Grammar, proto::external_transform> :
+   
+  proto::transform< when<Grammar, proto::external_transform> >
+{
+  // types
+  typedef typename Grammar::proto_grammar proto_grammar;
+
+  // member classes/structs/unions
+  template<typename Expr, typename State, typename Data> 
+  struct impl :  
+    boost::remove_reference< 
+      typename mpl::eval_if_c<
+        proto::result_of::has_env_var<Data, proto::transforms_type>::value,
+        proto::result_of::env_var<Data, proto::transforms_type>,
+        proto::result_of::env_var<Data, proto::data_type>
+      >::type
+    >::type
+      ::template when< Grammar >
+        ::template impl< Expr, State, Data >
+  {
+  };
+};
                                                      +
                                                      +

                                                      Description

                                                      +

                                                      + Use proto::when<> to override a grammar's default + transform with a custom transform. It is for use when composing larger transforms by associating + smaller transforms with individual rules in your grammar. +

                                                      +

                                                      + The when<G, proto::external_transform> + indicates that the associated transform is not yet known. It should be looked up when the transform + is about to be applied. It is found by looking it up in the passed-in Data parameter, which + behaves like a compile-time map from grammar types to transform types. The map is indexed using + Grammar as a key. The associated value type is used as the transform + to apply. In this way, the same grammar can be used to define multiple evaluating strategies that + can be added post-hoc. +

                                                      +

                                                      + See proto::external_transforms for an example. +

                                                      +
                                                      +
                                                      + + + +
                                                      Copyright © 2008 Eric Niebler

                                                      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                      +
                                                      +
                                                      +
                                                      +PrevUpHomeNext +
                                                      + + diff --git a/doc/html/boost/proto/when_Gra_idm45506983606192/impl.html b/doc/html/boost/proto/when_Gra_idm45506983606192/impl.html new file mode 100644 index 0000000000..8dbae1571a --- /dev/null +++ b/doc/html/boost/proto/when_Gra_idm45506983606192/impl.html @@ -0,0 +1,73 @@ + + + + +Struct template impl + + + + + + + + + + + + + + + +
                                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                      +
                                                      +
                                                      +PrevUpHomeNext +
                                                      +
                                                      +
                                                      +
                                                      +

                                                      Struct template impl

                                                      +

                                                      boost::proto::when<Grammar, >::impl

                                                      +
                                                      +

                                                      Synopsis

                                                      +
                                                      // In header: <boost/proto/transform/when.hpp>
+
+
+template<typename Expr, typename State, typename Data> 
+struct impl :  
+    boost::remove_reference< 
+      typename mpl::eval_if_c<
+        proto::result_of::has_env_var<Data, proto::transforms_type>::value,
+        proto::result_of::env_var<Data, proto::transforms_type>,
+        proto::result_of::env_var<Data, proto::data_type>
+      >::type
+    >::type
+      ::template when< Grammar >
+        ::template impl< Expr, State, Data >
+{
+};
                                                      +
                                                      +

                                                      Description

                                                      +

                                                      + The implementation of the impl struct depends on whether the Data + parameter is a transform environment that contains a value corresponding to the + proto::transforms_type key. If so, that value is treated as a + map from rules to transforms. Otherwise, the Data type itself is treated + as such a map. +

                                                      +
                                                      +
                                                      + + + +
                                                      Copyright © 2008 Eric Niebler

                                                      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                      +
                                                      +
                                                      +
                                                      +PrevUpHomeNext +
                                                      + + diff --git a/doc/html/boost/proto/when_Gra_idm45506983649024.html b/doc/html/boost/proto/when_Gra_idm45506983649024.html new file mode 100644 index 0000000000..7cc544b342 --- /dev/null +++ b/doc/html/boost/proto/when_Gra_idm45506983649024.html @@ -0,0 +1,95 @@ + + + + +Struct template when<Grammar, R(A..., ...)> + + + + + + + + + + + + + + + +
                                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                      +
                                                      +
                                                      +PrevUpHomeNext +
                                                      +
                                                      +
                                                      +
                                                      +

                                                      Struct template when<Grammar, R(A..., ...)>

                                                      +

                                                      boost::proto::when<Grammar, R(A..., ...)> — A grammar element and a Transform that associates a + transform with the grammar.

                                                      +
                                                      +

                                                      Synopsis

                                                      +
                                                      // In header: <boost/proto/transform/when.hpp>
+
+template<typename Grammar, typename R, typename... A> 
+struct when<Grammar, R(A..., ...)> :  proto::transform< when<Grammar, R(A..., ...)> > {
+  // types
+  typedef typename Grammar::proto_grammar proto_grammar;
+
+  // member classes/structs/unions
+  template<typename Expr, typename State, typename Data> 
+  struct impl :  proto::transform_impl< Expr, State, Data > {
+    // types
+    typedef proto::call<R(A..., ...)>                                  call_;        // For exposition only
+    typedef proto::make<R(A..., ...)>                                  make_;        // For exposition only
+    typedef typename mpl::if_<proto::is_callable<R>,call_,make_>::type which;        // For exposition only
+    typedef typename boost::result_of<which(Expr, State, Data)>::type  result_type;
+
+    // public member functions
+    result_type operator()(typename impl::expr_param, 
+                           typename impl::state_param, 
+                           typename impl::data_param) const;
+  };
+};
                                                      +
                                                      +

                                                      Description

                                                      +

                                                      + Use proto::when<> to override a grammar's default + transform with a custom transform. It is for use when composing larger transforms by associating + smaller transforms with individual rules in your grammar. +

                                                      +

                                                      + The when<G, R(A..., ...)> form accepts either a + CallableTransform or an ObjectTransform as its + second parameter. proto::when<> uses + proto::is_callable<R>::value to + distinguish between the two, and uses + proto::call<> to evaluate + CallableTransforms and + proto::make<> to evaluate + ObjectTransforms. +

                                                      +

                                                      + Note: In the specialization + when<G, R(A..., ...)>, the first ellipsis denotes a + C++11-style variadic template (which is emulated for C++98 compilers). The second ellipsis + is a C-style vararg. +

                                                      +
                                                      +
                                                      + + + +
                                                      Copyright © 2008 Eric Niebler

                                                      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                      +
                                                      +
                                                      +
                                                      +PrevUpHomeNext +
                                                      + + diff --git a/doc/html/boost/proto/when_Gra_idm45506983649024/impl.html b/doc/html/boost/proto/when_Gra_idm45506983649024/impl.html new file mode 100644 index 0000000000..00689e8bb6 --- /dev/null +++ b/doc/html/boost/proto/when_Gra_idm45506983649024/impl.html @@ -0,0 +1,126 @@ + + + + +Struct template impl + + + + + + + + + + + + + + + +
                                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                      +
                                                      +
                                                      +PrevUpHomeNext +
                                                      +
                                                      +
                                                      +
                                                      +

                                                      Struct template impl

                                                      +

                                                      boost::proto::when<Grammar, R(A..., ...)>::impl

                                                      +
                                                      +

                                                      Synopsis

                                                      +
                                                      // In header: <boost/proto/transform/when.hpp>
+
+
+template<typename Expr, typename State, typename Data> 
+struct impl :  proto::transform_impl< Expr, State, Data > {
+  // types
+  typedef proto::call<R(A..., ...)>                                  call_;        // For exposition only
+  typedef proto::make<R(A..., ...)>                                  make_;        // For exposition only
+  typedef typename mpl::if_<proto::is_callable<R>,call_,make_>::type which;        // For exposition only
+  typedef typename boost::result_of<which(Expr, State, Data)>::type  result_type;
+
+  // public member functions
+  result_type operator()(typename impl::expr_param, 
+                         typename impl::state_param, 
+                         typename impl::data_param) const;
+};
                                                      +
                                                      +

                                                      Description

                                                      +
                                                      +

                                                      +impl public member functions

                                                      +
                                                      1. +
                                                        result_type operator()(typename impl::expr_param expr, 
+                       typename impl::state_param state, 
+                       typename impl::data_param data) const;
                                                        +

                                                        + Evaluate R(A..., ...) as a transform either with + proto::call<> or with + proto::make<> depending + on whether proto::is_callable<R>::value + is true or false. +

                                                        +
                                                        ++++ + + + + + + + + + + + + + + +

                                                        Parameters:

                                                        ++++ + + + + + + + + + + + + + + +

                                                        data

                                                        An arbitrary data

                                                        expr

                                                        The current expression

                                                        state

                                                        The current state

                                                        Requires:

                                                        + proto::matches<Expr, Grammar>::value + is true. +

                                                        Returns:

                                                        + which()(expr, state, data) +

                                                        +
                                                      +
                                                      +
                                                      +
                                                      + + + +
                                                      Copyright © 2008 Eric Niebler

                                                      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                      +
                                                      +
                                                      +
                                                      +PrevUpHomeNext +
                                                      + + diff --git a/doc/html/boost/proto/when_Gra_idm45506983690064.html b/doc/html/boost/proto/when_Gra_idm45506983690064.html new file mode 100644 index 0000000000..b2a0893faf --- /dev/null +++ b/doc/html/boost/proto/when_Gra_idm45506983690064.html @@ -0,0 +1,89 @@ + + + + +Struct template when<Grammar, R(A...)> + + + + + + + + + + + + + + + +
                                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                      +
                                                      +
                                                      +PrevUpHomeNext +
                                                      +
                                                      +
                                                      +
                                                      +

                                                      Struct template when<Grammar, R(A...)>

                                                      +

                                                      boost::proto::when<Grammar, R(A...)> — A grammar element and a Transform that associates a + transform with the grammar.

                                                      +
                                                      +

                                                      Synopsis

                                                      +
                                                      // In header: <boost/proto/transform/when.hpp>
+
+template<typename Grammar, typename R, typename... A> 
+struct when<Grammar, R(A...)> :  proto::transform< when<Grammar, R(A...)> > {
+  // types
+  typedef typename Grammar::proto_grammar proto_grammar;
+
+  // member classes/structs/unions
+  template<typename Expr, typename State, typename Data> 
+  struct impl :  proto::transform_impl< Expr, State, Data > {
+    // types
+    typedef proto::call<R(A...)>                                       call_;        // For exposition only
+    typedef proto::make<R(A...)>                                       make_;        // For exposition only
+    typedef typename mpl::if_<proto::is_callable<R>,call_,make_>::type which;        // For exposition only
+    typedef typename boost::result_of<which(Expr, State, Data)>::type  result_type;
+
+    // public member functions
+    result_type operator()(typename impl::expr_param, 
+                           typename impl::state_param, 
+                           typename impl::data_param) const;
+  };
+};
                                                      +
                                                      +

                                                      Description

                                                      +

                                                      + Use proto::when<> to override a grammar's default + transform with a custom transform. It is for use when composing larger transforms by associating + smaller transforms with individual rules in your grammar. +

                                                      +

                                                      + The when<G, R(A...)> form accepts either a + CallableTransform or an ObjectTransform as its + second parameter. proto::when<> uses + proto::is_callable<R>::value to + distinguish between the two, and uses + proto::call<> to evaluate + CallableTransforms and + proto::make<> to evaluate + ObjectTransforms. +

                                                      +
                                                      +
                                                      + + + +
                                                      Copyright © 2008 Eric Niebler

                                                      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                      +
                                                      +
                                                      +
                                                      +PrevUpHomeNext +
                                                      + + diff --git a/doc/html/boost/proto/when_Gra_idm45506983690064/impl.html b/doc/html/boost/proto/when_Gra_idm45506983690064/impl.html new file mode 100644 index 0000000000..083ef228c1 --- /dev/null +++ b/doc/html/boost/proto/when_Gra_idm45506983690064/impl.html @@ -0,0 +1,126 @@ + + + + +Struct template impl + + + + + + + + + + + + + + + +
                                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                      +
                                                      +
                                                      +PrevUpHomeNext +
                                                      +
                                                      +
                                                      +
                                                      +

                                                      Struct template impl

                                                      +

                                                      boost::proto::when<Grammar, R(A...)>::impl

                                                      +
                                                      +

                                                      Synopsis

                                                      +
                                                      // In header: <boost/proto/transform/when.hpp>
+
+
+template<typename Expr, typename State, typename Data> 
+struct impl :  proto::transform_impl< Expr, State, Data > {
+  // types
+  typedef proto::call<R(A...)>                                       call_;        // For exposition only
+  typedef proto::make<R(A...)>                                       make_;        // For exposition only
+  typedef typename mpl::if_<proto::is_callable<R>,call_,make_>::type which;        // For exposition only
+  typedef typename boost::result_of<which(Expr, State, Data)>::type  result_type;
+
+  // public member functions
+  result_type operator()(typename impl::expr_param, 
+                         typename impl::state_param, 
+                         typename impl::data_param) const;
+};
                                                      +
                                                      +

                                                      Description

                                                      +
                                                      +

                                                      +impl public member functions

                                                      +
                                                      1. +
                                                        result_type operator()(typename impl::expr_param expr, 
+                       typename impl::state_param state, 
+                       typename impl::data_param data) const;
                                                        +

                                                        + Evaluate R(A...) as a transform either with + proto::call<> or with + proto::make<> depending + on whether proto::is_callable<R>::value + is true or false. +

                                                        +
                                                        ++++ + + + + + + + + + + + + + + +

                                                        Parameters:

                                                        ++++ + + + + + + + + + + + + + + +

                                                        data

                                                        An arbitrary data

                                                        expr

                                                        The current expression

                                                        state

                                                        The current state

                                                        Requires:

                                                        + proto::matches<Expr, Grammar>::value + is true. +

                                                        Returns:

                                                        + which()(expr, state, data) +

                                                        +
                                                      +
                                                      +
                                                      +
                                                      + + + +
                                                      Copyright © 2008 Eric Niebler

                                                      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                      +
                                                      +
                                                      +
                                                      +PrevUpHomeNext +
                                                      + + diff --git a/doc/html/boost/proto/when_Gra_idm45506983699520.html b/doc/html/boost/proto/when_Gra_idm45506983699520.html new file mode 100644 index 0000000000..4eb09d15fa --- /dev/null +++ b/doc/html/boost/proto/when_Gra_idm45506983699520.html @@ -0,0 +1,67 @@ + + + + +Struct template when<Grammar, Fun *> + + + + + + + + + + + + + + + +
                                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                      +
                                                      +
                                                      +PrevUpHomeNext +
                                                      +
                                                      +
                                                      +
                                                      +

                                                      Struct template when<Grammar, Fun *>

                                                      +

                                                      boost::proto::when<Grammar, Fun *> — A specialization that treats function pointer Transforms as if they + were function type Transforms.

                                                      +
                                                      +

                                                      Synopsis

                                                      +
                                                      // In header: <boost/proto/transform/when.hpp>
+
+template<typename Grammar, typename Fun> 
+struct when<Grammar, Fun *> :  proto::when< Grammar, Fun > {
+};
                                                      +
                                                      +

                                                      Description

                                                      +

                                                      + This specialization requires that Fun is actually a function type. +

                                                      +

                                                      + This specialization is required for nested transforms such as + proto::when<G, T0(T1(_))>. In C++, functions that are used + as parameters to other functions automatically decay to funtion pointer types. In other words, the + type T0(T1(_)) is indistinguishable from + T0(T1(*)(_)). This specialization is required to handle these + nested function pointer type transforms properly. +

                                                      +
                                                      +
                                                      + + + +
                                                      Copyright © 2008 Eric Niebler

                                                      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                      +
                                                      +
                                                      +
                                                      +PrevUpHomeNext +
                                                      + + diff --git a/doc/html/boost/proto/when_Grammar__idp209631056.html b/doc/html/boost/proto/when_Grammar__idp209631056.html deleted file mode 100644 index d95d06a20b..0000000000 --- a/doc/html/boost/proto/when_Grammar__idp209631056.html +++ /dev/null @@ -1,67 +0,0 @@ - - - - -Struct template when<Grammar, Fun *> - - - - - - - - - - - - - - - -
                                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                      -
                                                      -
                                                      -PrevUpHomeNext -
                                                      -
                                                      -
                                                      -
                                                      -

                                                      Struct template when<Grammar, Fun *>

                                                      -

                                                      boost::proto::when<Grammar, Fun *> — A specialization that treats function pointer Transforms as if they - were function type Transforms.

                                                      -
                                                      -

                                                      Synopsis

                                                      -
                                                      // In header: <boost/proto/transform/when.hpp>
-
-template<typename Grammar, typename Fun> 
-struct when<Grammar, Fun *> :  proto::when< Grammar, Fun > {
-};
                                                      -
                                                      -

                                                      Description

                                                      -

                                                      - This specialization requires that Fun is actually a function type. -

                                                      -

                                                      - This specialization is required for nested transforms such as - proto::when<G, T0(T1(_))>. In C++, functions that are used - as parameters to other functions automatically decay to funtion pointer types. In other words, the - type T0(T1(_)) is indistinguishable from - T0(T1(*)(_)). This specialization is required to handle these - nested function pointer type transforms properly. -

                                                      -
                                                      -
                                                      - - - -
                                                      Copyright © 2008 Eric Niebler

                                                      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                      -
                                                      -
                                                      -
                                                      -PrevUpHomeNext -
                                                      - - diff --git a/doc/html/boost/proto/when_Grammar__idp209640512.html b/doc/html/boost/proto/when_Grammar__idp209640512.html deleted file mode 100644 index c7d0285244..0000000000 --- a/doc/html/boost/proto/when_Grammar__idp209640512.html +++ /dev/null @@ -1,89 +0,0 @@ - - - - -Struct template when<Grammar, R(A...)> - - - - - - - - - - - - - - - -
                                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                      -
                                                      -
                                                      -PrevUpHomeNext -
                                                      -
                                                      -
                                                      -
                                                      -

                                                      Struct template when<Grammar, R(A...)>

                                                      -

                                                      boost::proto::when<Grammar, R(A...)> — A grammar element and a Transform that associates a - transform with the grammar.

                                                      -
                                                      -

                                                      Synopsis

                                                      -
                                                      // In header: <boost/proto/transform/when.hpp>
-
-template<typename Grammar, typename R, typename... A> 
-struct when<Grammar, R(A...)> :  proto::transform< when<Grammar, R(A...)> > {
-  // types
-  typedef typename Grammar::proto_grammar proto_grammar;
-
-  // member classes/structs/unions
-  template<typename Expr, typename State, typename Data> 
-  struct impl :  proto::transform_impl< Expr, State, Data > {
-    // types
-    typedef proto::call<R(A...)>                                       call_;        // For exposition only
-    typedef proto::make<R(A...)>                                       make_;        // For exposition only
-    typedef typename mpl::if_<proto::is_callable<R>,call_,make_>::type which;        // For exposition only
-    typedef typename boost::result_of<which(Expr, State, Data)>::type  result_type;
-
-    // public member functions
-    result_type operator()(typename impl::expr_param, 
-                           typename impl::state_param, 
-                           typename impl::data_param) const;
-  };
-};
                                                      -
                                                      -

                                                      Description

                                                      -

                                                      - Use proto::when<> to override a grammar's default - transform with a custom transform. It is for use when composing larger transforms by associating - smaller transforms with individual rules in your grammar. -

                                                      -

                                                      - The when<G, R(A...)> form accepts either a - CallableTransform or an ObjectTransform as its - second parameter. proto::when<> uses - proto::is_callable<R>::value to - distinguish between the two, and uses - proto::call<> to evaluate - CallableTransforms and - proto::make<> to evaluate - ObjectTransforms. -

                                                      -
                                                      -
                                                      - - - -
                                                      Copyright © 2008 Eric Niebler

                                                      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                      -
                                                      -
                                                      -
                                                      -PrevUpHomeNext -
                                                      - - diff --git a/doc/html/boost/proto/when_Grammar__idp209640512/impl.html b/doc/html/boost/proto/when_Grammar__idp209640512/impl.html deleted file mode 100644 index d62d6c4912..0000000000 --- a/doc/html/boost/proto/when_Grammar__idp209640512/impl.html +++ /dev/null @@ -1,126 +0,0 @@ - - - - -Struct template impl - - - - - - - - - - - - - - - -
                                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                      -
                                                      -
                                                      -PrevUpHomeNext -
                                                      -
                                                      -
                                                      -
                                                      -

                                                      Struct template impl

                                                      -

                                                      boost::proto::when<Grammar, R(A...)>::impl

                                                      -
                                                      -

                                                      Synopsis

                                                      -
                                                      // In header: <boost/proto/transform/when.hpp>
-
-
-template<typename Expr, typename State, typename Data> 
-struct impl :  proto::transform_impl< Expr, State, Data > {
-  // types
-  typedef proto::call<R(A...)>                                       call_;        // For exposition only
-  typedef proto::make<R(A...)>                                       make_;        // For exposition only
-  typedef typename mpl::if_<proto::is_callable<R>,call_,make_>::type which;        // For exposition only
-  typedef typename boost::result_of<which(Expr, State, Data)>::type  result_type;
-
-  // public member functions
-  result_type operator()(typename impl::expr_param, 
-                         typename impl::state_param, 
-                         typename impl::data_param) const;
-};
                                                      -
                                                      -

                                                      Description

                                                      -
                                                      -

                                                      -impl public member functions

                                                      -
                                                      1. -
                                                        result_type operator()(typename impl::expr_param expr, 
-                       typename impl::state_param state, 
-                       typename impl::data_param data) const;
                                                        -

                                                        - Evaluate R(A...) as a transform either with - proto::call<> or with - proto::make<> depending - on whether proto::is_callable<R>::value - is true or false. -

                                                        -
                                                        ---- - - - - - - - - - - - - - - -

                                                        Parameters:

                                                        ---- - - - - - - - - - - - - - - -

                                                        data

                                                        An arbitrary data

                                                        expr

                                                        The current expression

                                                        state

                                                        The current state

                                                        Requires:

                                                        - proto::matches<Expr, Grammar>::value - is true. -

                                                        Returns:

                                                        - which()(expr, state, data) -

                                                        -
                                                      -
                                                      -
                                                      -
                                                      - - - -
                                                      Copyright © 2008 Eric Niebler

                                                      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                      -
                                                      -
                                                      -
                                                      -PrevUpHomeNext -
                                                      - - diff --git a/doc/html/boost/proto/when_Grammar__idp209681552.html b/doc/html/boost/proto/when_Grammar__idp209681552.html deleted file mode 100644 index 661ddebd2d..0000000000 --- a/doc/html/boost/proto/when_Grammar__idp209681552.html +++ /dev/null @@ -1,95 +0,0 @@ - - - - -Struct template when<Grammar, R(A..., ...)> - - - - - - - - - - - - - - - -
                                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                      -
                                                      -
                                                      -PrevUpHomeNext -
                                                      -
                                                      -
                                                      -
                                                      -

                                                      Struct template when<Grammar, R(A..., ...)>

                                                      -

                                                      boost::proto::when<Grammar, R(A..., ...)> — A grammar element and a Transform that associates a - transform with the grammar.

                                                      -
                                                      -

                                                      Synopsis

                                                      -
                                                      // In header: <boost/proto/transform/when.hpp>
-
-template<typename Grammar, typename R, typename... A> 
-struct when<Grammar, R(A..., ...)> :  proto::transform< when<Grammar, R(A..., ...)> > {
-  // types
-  typedef typename Grammar::proto_grammar proto_grammar;
-
-  // member classes/structs/unions
-  template<typename Expr, typename State, typename Data> 
-  struct impl :  proto::transform_impl< Expr, State, Data > {
-    // types
-    typedef proto::call<R(A..., ...)>                                  call_;        // For exposition only
-    typedef proto::make<R(A..., ...)>                                  make_;        // For exposition only
-    typedef typename mpl::if_<proto::is_callable<R>,call_,make_>::type which;        // For exposition only
-    typedef typename boost::result_of<which(Expr, State, Data)>::type  result_type;
-
-    // public member functions
-    result_type operator()(typename impl::expr_param, 
-                           typename impl::state_param, 
-                           typename impl::data_param) const;
-  };
-};
                                                      -
                                                      -

                                                      Description

                                                      -

                                                      - Use proto::when<> to override a grammar's default - transform with a custom transform. It is for use when composing larger transforms by associating - smaller transforms with individual rules in your grammar. -

                                                      -

                                                      - The when<G, R(A..., ...)> form accepts either a - CallableTransform or an ObjectTransform as its - second parameter. proto::when<> uses - proto::is_callable<R>::value to - distinguish between the two, and uses - proto::call<> to evaluate - CallableTransforms and - proto::make<> to evaluate - ObjectTransforms. -

                                                      -

                                                      - Note: In the specialization - when<G, R(A..., ...)>, the first ellipsis denotes a - C++11-style variadic template (which is emulated for C++98 compilers). The second ellipsis - is a C-style vararg. -

                                                      -
                                                      -
                                                      - - - -
                                                      Copyright © 2008 Eric Niebler

                                                      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                      -
                                                      -
                                                      -
                                                      -PrevUpHomeNext -
                                                      - - diff --git a/doc/html/boost/proto/when_Grammar__idp209681552/impl.html b/doc/html/boost/proto/when_Grammar__idp209681552/impl.html deleted file mode 100644 index eb1fdb90eb..0000000000 --- a/doc/html/boost/proto/when_Grammar__idp209681552/impl.html +++ /dev/null @@ -1,126 +0,0 @@ - - - - -Struct template impl - - - - - - - - - - - - - - - -
                                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                      -
                                                      -
                                                      -PrevUpHomeNext -
                                                      -
                                                      -
                                                      -
                                                      -

                                                      Struct template impl

                                                      -

                                                      boost::proto::when<Grammar, R(A..., ...)>::impl

                                                      -
                                                      -

                                                      Synopsis

                                                      -
                                                      // In header: <boost/proto/transform/when.hpp>
-
-
-template<typename Expr, typename State, typename Data> 
-struct impl :  proto::transform_impl< Expr, State, Data > {
-  // types
-  typedef proto::call<R(A..., ...)>                                  call_;        // For exposition only
-  typedef proto::make<R(A..., ...)>                                  make_;        // For exposition only
-  typedef typename mpl::if_<proto::is_callable<R>,call_,make_>::type which;        // For exposition only
-  typedef typename boost::result_of<which(Expr, State, Data)>::type  result_type;
-
-  // public member functions
-  result_type operator()(typename impl::expr_param, 
-                         typename impl::state_param, 
-                         typename impl::data_param) const;
-};
                                                      -
                                                      -

                                                      Description

                                                      -
                                                      -

                                                      -impl public member functions

                                                      -
                                                      1. -
                                                        result_type operator()(typename impl::expr_param expr, 
-                       typename impl::state_param state, 
-                       typename impl::data_param data) const;
                                                        -

                                                        - Evaluate R(A..., ...) as a transform either with - proto::call<> or with - proto::make<> depending - on whether proto::is_callable<R>::value - is true or false. -

                                                        -
                                                        ---- - - - - - - - - - - - - - - -

                                                        Parameters:

                                                        ---- - - - - - - - - - - - - - - -

                                                        data

                                                        An arbitrary data

                                                        expr

                                                        The current expression

                                                        state

                                                        The current state

                                                        Requires:

                                                        - proto::matches<Expr, Grammar>::value - is true. -

                                                        Returns:

                                                        - which()(expr, state, data) -

                                                        -
                                                      -
                                                      -
                                                      -
                                                      - - - -
                                                      Copyright © 2008 Eric Niebler

                                                      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                      -
                                                      -
                                                      -
                                                      -PrevUpHomeNext -
                                                      - - diff --git a/doc/html/boost/proto/when_Grammar__idp209724384.html b/doc/html/boost/proto/when_Grammar__idp209724384.html deleted file mode 100644 index 924ae4c408..0000000000 --- a/doc/html/boost/proto/when_Grammar__idp209724384.html +++ /dev/null @@ -1,93 +0,0 @@ - - - - -Struct template when<Grammar, proto::external_transform> - - - - - - - - - - - - - - - -
                                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                      -
                                                      -
                                                      -PrevUpHomeNext -
                                                      -
                                                      -
                                                      -
                                                      -

                                                      Struct template when<Grammar, proto::external_transform>

                                                      -

                                                      boost::proto::when<Grammar, > — A grammar element that associates an externally-specified transform with the grammar. - The transform is looked up in the Data parameter using the Grammar as a key.

                                                      -
                                                      -

                                                      Synopsis

                                                      -
                                                      // In header: <boost/proto/transform/when.hpp>
-
-template<typename Grammar> 
-struct when<Grammar, proto::external_transform> :
-   
-  proto::transform< when<Grammar, proto::external_transform> >
-{
-  // types
-  typedef typename Grammar::proto_grammar proto_grammar;
-
-  // member classes/structs/unions
-  template<typename Expr, typename State, typename Data> 
-  struct impl :  
-    boost::remove_reference< 
-      typename mpl::eval_if_c<
-        proto::result_of::has_env_var<Data, proto::transforms_type>::value,
-        proto::result_of::env_var<Data, proto::transforms_type>,
-        proto::result_of::env_var<Data, proto::data_type>
-      >::type
-    >::type
-      ::template when< Grammar >
-        ::template impl< Expr, State, Data >
-  {
-  };
-};
                                                      -
                                                      -

                                                      Description

                                                      -

                                                      - Use proto::when<> to override a grammar's default - transform with a custom transform. It is for use when composing larger transforms by associating - smaller transforms with individual rules in your grammar. -

                                                      -

                                                      - The when<G, proto::external_transform> - indicates that the associated transform is not yet known. It should be looked up when the transform - is about to be applied. It is found by looking it up in the passed-in Data parameter, which - behaves like a compile-time map from grammar types to transform types. The map is indexed using - Grammar as a key. The associated value type is used as the transform - to apply. In this way, the same grammar can be used to define multiple evaluating strategies that - can be added post-hoc. -

                                                      -

                                                      - See proto::external_transforms for an example. -

                                                      -
                                                      -
                                                      - - - -
                                                      Copyright © 2008 Eric Niebler

                                                      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                      -
                                                      -
                                                      -
                                                      -PrevUpHomeNext -
                                                      - - diff --git a/doc/html/boost/proto/when_Grammar__idp209724384/impl.html b/doc/html/boost/proto/when_Grammar__idp209724384/impl.html deleted file mode 100644 index 7ced954f06..0000000000 --- a/doc/html/boost/proto/when_Grammar__idp209724384/impl.html +++ /dev/null @@ -1,73 +0,0 @@ - - - - -Struct template impl - - - - - - - - - - - - - - - -
                                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                      -
                                                      -
                                                      -PrevUpHomeNext -
                                                      -
                                                      -
                                                      -
                                                      -

                                                      Struct template impl

                                                      -

                                                      boost::proto::when<Grammar, >::impl

                                                      -
                                                      -

                                                      Synopsis

                                                      -
                                                      // In header: <boost/proto/transform/when.hpp>
-
-
-template<typename Expr, typename State, typename Data> 
-struct impl :  
-    boost::remove_reference< 
-      typename mpl::eval_if_c<
-        proto::result_of::has_env_var<Data, proto::transforms_type>::value,
-        proto::result_of::env_var<Data, proto::transforms_type>,
-        proto::result_of::env_var<Data, proto::data_type>
-      >::type
-    >::type
-      ::template when< Grammar >
-        ::template impl< Expr, State, Data >
-{
-};
                                                      -
                                                      -

                                                      Description

                                                      -

                                                      - The implementation of the impl struct depends on whether the Data - parameter is a transform environment that contains a value corresponding to the - proto::transforms_type key. If so, that value is treated as a - map from rules to transforms. Otherwise, the Data type itself is treated - as such a map. -

                                                      -
                                                      -
                                                      - - - -
                                                      Copyright © 2008 Eric Niebler

                                                      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                      -
                                                      -
                                                      -
                                                      -PrevUpHomeNext -
                                                      - - diff --git a/doc/html/boost/random/additive_combine_engine.html b/doc/html/boost/random/additive_combine_engine.html index b0cba77236..5757fc24a9 100644 --- a/doc/html/boost/random/additive_combine_engine.html +++ b/doc/html/boost/random/additive_combine_engine.html @@ -41,67 +41,67 @@ typedef MLCG1::result_type result_type; // construct/copy/destruct - additive_combine_engine(); - explicit additive_combine_engine(result_type); - template<typename SeedSeq> explicit additive_combine_engine(SeedSeq &); - additive_combine_engine(typename MLCG1::result_type, + additive_combine_engine(); + explicit additive_combine_engine(result_type); + template<typename SeedSeq> explicit additive_combine_engine(SeedSeq &); + additive_combine_engine(typename MLCG1::result_type, typename MLCG2::result_type); - template<typename It> additive_combine_engine(It &, It); + template<typename It> additive_combine_engine(It &, It); - // public static functions - static result_type min(); - static result_type max(); + // public static functions + static result_type min(); + static result_type max(); - // public member functions - void seed(); - void seed(result_type); - template<typename SeedSeq> void seed(SeedSeq &); - void seed(typename MLCG1::result_type, typename MLCG2::result_type); - template<typename It> void seed(It &, It); - result_type operator()(); - template<typename Iter> void generate(Iter, Iter); - void discard(boost::uintmax_t); + // public member functions + void seed(); + void seed(result_type); + template<typename SeedSeq> void seed(SeedSeq &); + void seed(typename MLCG1::result_type, typename MLCG2::result_type); + template<typename It> void seed(It &, It); + result_type operator()(); + template<typename Iter> void generate(Iter, Iter); + void discard(boost::uintmax_t); - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, + operator<<(std::basic_ostream< CharT, Traits > &, const additive_combine_engine &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, + operator>>(std::basic_istream< CharT, Traits > &, const additive_combine_engine &); - friend bool operator==(const additive_combine_engine &, + friend bool operator==(const additive_combine_engine &, const additive_combine_engine &); - friend bool operator!=(const additive_combine_engine &, + friend bool operator!=(const additive_combine_engine &, const additive_combine_engine &); // public data members static const bool has_fixed_range; };
                                                      -

                                                      Description

                                                      +

                                                      Description

                                                      An instantiation of class template additive_combine_engine models a pseudo-random number generator . It combines two multiplicative linear_congruential_engine number generators, i.e. those with c = 0. It is described in

                                                      "Efficient and Portable Combined Random Number Generators", Pierre L'Ecuyer, Communications of the ACM, Vol. 31, No. 6, June 1988, pp. 742-749, 774

                                                      The template parameters MLCG1 and MLCG2 shall denote two different linear_congruential_engine number generators, each with c = 0. Each invocation returns a random number X(n) := (MLCG1(n) - MLCG2(n)) mod (m1 - 1), where m1 denotes the modulus of MLCG1.

                                                      -

                                                      +

                                                      additive_combine_engine public construct/copy/destruct

                                                      1. -
                                                        additive_combine_engine();
                                                        +
                                                        additive_combine_engine();

                                                        Constructs an additive_combine_engine using the default constructors of the two base generators.

                                                      2. -
                                                        explicit additive_combine_engine(result_type seed);
                                                        +
                                                        explicit additive_combine_engine(result_type seed);

                                                        Constructs an additive_combine_engine, using seed as the constructor argument for both base generators.

                                                      3. -
                                                        template<typename SeedSeq> explicit additive_combine_engine(SeedSeq & seq);
                                                        +
                                                        template<typename SeedSeq> explicit additive_combine_engine(SeedSeq & seq);

                                                        Constructs an additive_combine_engine, using seq as the constructor argument for both base generators.

                                                        @@ -114,12 +114,12 @@

                                                      4. -
                                                        additive_combine_engine(typename MLCG1::result_type seed1, 
+
                                                        additive_combine_engine(typename MLCG1::result_type seed1, 
                         typename MLCG2::result_type seed2);
                                                        
 
                                                        Constructs an additive_combine_engine, using seed1 and seed2 as the constructor argument to the first and second base generators, respectively.
                                                      5. -
                                                        template<typename It> additive_combine_engine(It & first, It last);
                                                        +
                                                        template<typename It> additive_combine_engine(It & first, It last);

                                                        Contructs an additive_combine_engine with values from the range defined by the input iterators first and last. first will be modified to point to the element after the last one used.

                                                        Throws: std::invalid_argument if the input range is too small.

                                                        Exception Safety: Basic

                                                        @@ -127,86 +127,86 @@
                                                        -

                                                        -additive_combine_engine public static functions

                                                        +

                                                        +additive_combine_engine public static functions

                                                        1. -
                                                          static result_type min();
                                                          +
                                                          static result_type min();

                                                          Returns the smallest value that the generator can produce

                                                        2. -
                                                          static result_type max();
                                                          +
                                                          static result_type max();

                                                          Returns the largest value that the generator can produce

                                                        -

                                                        -additive_combine_engine public member functions

                                                        +

                                                        +additive_combine_engine public member functions

                                                        1. -
                                                          void seed();
                                                          +
                                                          void seed();

                                                          Seeds an additive_combine_engine using the default seeds of the two base generators.

                                                        2. -
                                                          void seed(result_type seed);
                                                          +
                                                          void seed(result_type seed);

                                                          Seeds an additive_combine_engine, using seed as the seed for both base generators.

                                                        3. -
                                                          template<typename SeedSeq> void seed(SeedSeq & seq);
                                                          +
                                                          template<typename SeedSeq> void seed(SeedSeq & seq);

                                                          Seeds an additive_combine_engine, using seq to seed both base generators.

                                                          See the warning on the corresponding constructor.

                                                        4. -
                                                          void seed(typename MLCG1::result_type seed1, 
+
                                                          void seed(typename MLCG1::result_type seed1, 
           typename MLCG2::result_type seed2);
                                                          
 
                                                          Seeds an additive_combine generator, using seed1 and seed2 as the seeds to the first and second base generators, respectively.
                                                        5. -
                                                          template<typename It> void seed(It & first, It last);
                                                          +
                                                          template<typename It> void seed(It & first, It last);

                                                          Seeds an additive_combine_engine with values from the range defined by the input iterators first and last. first will be modified to point to the element after the last one used.

                                                          Throws: std::invalid_argument if the input range is too small.

                                                          Exception Safety: Basic

                                                        6. -
                                                          result_type operator()();
                                                          +
                                                          result_type operator()();

                                                          Returns the next value of the generator.

                                                        7. -
                                                          template<typename Iter> void generate(Iter first, Iter last);
                                                          +
                                                          template<typename Iter> void generate(Iter first, Iter last);

                                                          Fills a range with random values

                                                        8. -
                                                          void discard(boost::uintmax_t z);
                                                          +
                                                          void discard(boost::uintmax_t z);

                                                          Advances the state of the generator by z.

                                                        -

                                                        -additive_combine_engine friend functions

                                                        +

                                                        +additive_combine_engine friend functions

                                                        1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const additive_combine_engine & r);

                                                          Writes the state of an additive_combine_engine to a std::ostream. The textual representation of an additive_combine_engine is the textual representation of the first base generator followed by the textual representation of the second base generator. 

                                                        2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
              const additive_combine_engine & r);

                                                          Reads the state of an additive_combine_engine from a std::istream.

                                                        3. -
                                                          friend bool operator==(const additive_combine_engine & x, 
+
                                                          friend bool operator==(const additive_combine_engine & x, 
                        const additive_combine_engine & y);
                                                          
 
                                                          Returns: true iff the two additive_combine_engines will produce the same sequence of values.
                                                        4. -
                                                          friend bool operator!=(const additive_combine_engine & lhs, 
+
                                                          friend bool operator!=(const additive_combine_engine & lhs, 
                        const additive_combine_engine & rhs);
                                                          
 
                                                          Returns: true iff the two additive_combine_engines will produce different sequences of values.
                                                          5. diff --git a/doc/html/boost/random/bernoulli_distribution.html b/doc/html/boost/random/bernoulli_distribution.html index 245e40e644..ac97dc03fd 100644 --- a/doc/html/boost/random/bernoulli_distribution.html +++ b/doc/html/boost/random/bernoulli_distribution.html @@ -47,135 +47,135 @@ typedef bernoulli_distribution distribution_type; // construct/copy/destruct - explicit param_type(RealType = 0.5); + explicit param_type(RealType = 0.5); - // public member functions - RealType p() const; + // public member functions + RealType p() const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); + operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, const param_type &); - friend bool operator==(const param_type &, const param_type &); - friend bool operator!=(const param_type &, const param_type &); + operator>>(std::basic_istream< CharT, Traits > &, const param_type &); + friend bool operator==(const param_type &, const param_type &); + friend bool operator!=(const param_type &, const param_type &); }; // construct/copy/destruct - explicit bernoulli_distribution(const RealType & = 0.5); - explicit bernoulli_distribution(const param_type &); + explicit bernoulli_distribution(const RealType & = 0.5); + explicit bernoulli_distribution(const param_type &); - // public member functions - RealType p() const; - bool min() const; - bool max() const; - param_type param() const; - void param(const param_type &); - void reset(); - template<typename Engine> bool operator()(Engine &) const; + // public member functions + RealType p() const; + bool min() const; + bool max() const; + param_type param() const; + void param(const param_type &); + void reset(); + template<typename Engine> bool operator()(Engine &) const; template<typename Engine> - bool operator()(Engine &, const param_type &) const; + bool operator()(Engine &, const param_type &) const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, + operator<<(std::basic_ostream< CharT, Traits > &, const bernoulli_distribution &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, + operator>>(std::basic_istream< CharT, Traits > &, const bernoulli_distribution &); - friend bool operator==(const bernoulli_distribution &, + friend bool operator==(const bernoulli_distribution &, const bernoulli_distribution &); - friend bool operator!=(const bernoulli_distribution &, + friend bool operator!=(const bernoulli_distribution &, const bernoulli_distribution &); };
                                                        -

                                                        Description

                                                        +

                                                        Description

                                                        Instantiations of class template bernoulli_distribution model a random distribution . Such a random distribution produces bool values distributed with probabilities P(true) = p and P(false) = 1-p. p is the parameter of the distribution.

                                                        -

                                                        +

                                                        bernoulli_distribution public construct/copy/destruct

                                                        1. -
                                                          explicit bernoulli_distribution(const RealType & p = 0.5);
                                                          +
                                                          explicit bernoulli_distribution(const RealType & p = 0.5);

                                                          Constructs a bernoulli_distribution object. p is the parameter of the distribution.

                                                          Requires: 0 <= p <= 1

                                                        2. -
                                                          explicit bernoulli_distribution(const param_type & param);
                                                          +
                                                          explicit bernoulli_distribution(const param_type & param);

                                                          Constructs bernoulli_distribution from its parameters

                                                        -

                                                        -bernoulli_distribution public member functions

                                                        +

                                                        +bernoulli_distribution public member functions

                                                        1. -
                                                          RealType p() const;
                                                          +
                                                          RealType p() const;

                                                          Returns: The "p" parameter of the distribution.

                                                        2. -
                                                          bool min() const;
                                                          +
                                                          bool min() const;

                                                          Returns the smallest value that the distribution can produce.

                                                        3. -
                                                          bool max() const;
                                                          +
                                                          bool max() const;

                                                          Returns the largest value that the distribution can produce.

                                                        4. -
                                                          param_type param() const;
                                                          +
                                                          param_type param() const;

                                                          Returns the parameters of the distribution.

                                                        5. -
                                                          void param(const param_type & param);
                                                          +
                                                          void param(const param_type & param);

                                                          Sets the parameters of the distribution.

                                                        6. -
                                                          void reset();
                                                          +
                                                          void reset();

                                                          Effects: Subsequent uses of the distribution do not depend on values produced by any engine prior to invoking reset.

                                                        7. -
                                                          template<typename Engine> bool operator()(Engine & eng) const;
                                                          +
                                                          template<typename Engine> bool operator()(Engine & eng) const;

                                                          Returns: a random variate distributed according to the bernoulli_distribution . 

                                                        8. template<typename Engine> 
-  bool operator()(Engine & eng, const param_type & param) const;
                                                          + bool operator()(Engine & eng, const param_type & param) const;

                                                          Returns: a random variate distributed according to the bernoulli_distribution with parameters specified by param.

                                                        -

                                                        -bernoulli_distribution friend functions

                                                        +

                                                        +bernoulli_distribution friend functions

                                                        1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const bernoulli_distribution & bd);

                                                          Writes the parameters of the distribution to a std::ostream. 

                                                        2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
              const bernoulli_distribution & bd);

                                                          Reads the parameters of the distribution from a std::istream.

                                                        3. -
                                                          friend bool operator==(const bernoulli_distribution & lhs, 
+
                                                          friend bool operator==(const bernoulli_distribution & lhs, 
                        const bernoulli_distribution & rhs);
                                                          
 
                                                          Returns true iff the two distributions will produce identical sequences of values given equal generators.
                                                        4. -
                                                          friend bool operator!=(const bernoulli_distribution & lhs, 
+
                                                          friend bool operator!=(const bernoulli_distribution & lhs, 
                        const bernoulli_distribution & rhs);
                                                          
 
                                                          Returns true iff the two distributions will produce different sequences of values given equal generators.
                                                          5. diff --git a/doc/html/boost/random/bernoulli_distribution/param_type.html b/doc/html/boost/random/bernoulli_distribution/param_type.html index cbcff53969..e256166e57 100644 --- a/doc/html/boost/random/bernoulli_distribution/param_type.html +++ b/doc/html/boost/random/bernoulli_distribution/param_type.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                                        6. -PrevUpHomeNext +PrevUpHomeNext
                                                        @@ -40,66 +40,66 @@ typedef bernoulli_distribution distribution_type; // construct/copy/destruct - explicit param_type(RealType = 0.5); + explicit param_type(RealType = 0.5); - // public member functions - RealType p() const; + // public member functions + RealType p() const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); + operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, const param_type &); - friend bool operator==(const param_type &, const param_type &); - friend bool operator!=(const param_type &, const param_type &); + operator>>(std::basic_istream< CharT, Traits > &, const param_type &); + friend bool operator==(const param_type &, const param_type &); + friend bool operator!=(const param_type &, const param_type &); };
                                                        -

                                                        Description

                                                        +

                                                        Description

                                                        -

                                                        +

                                                        param_type public construct/copy/destruct

                                                        1. -
                                                          explicit param_type(RealType p = 0.5);
                                                          +
                                                          explicit param_type(RealType p = 0.5);

                                                          Constructs the parameters of the distribution.

                                                          Requires: 0 <= p <= 1

                                                        -

                                                        -param_type public member functions

                                                        +

                                                        +param_type public member functions

                                                        1. -
                                                          RealType p() const;
                                                          +
                                                          RealType p() const;

                                                          Returns the p parameter of the distribution.

                                                        -

                                                        -param_type friend functions

                                                        +

                                                        +param_type friend functions

                                                        1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const param_type & param);

                                                          Writes the parameters to a std::ostream. 

                                                        2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
              const param_type & param);

                                                          Reads the parameters from a std::istream.

                                                        3. -
                                                          friend bool operator==(const param_type & lhs, const param_type & rhs);
                                                          +
                                                          friend bool operator==(const param_type & lhs, const param_type & rhs);

                                                          Returns true if the two sets of parameters are equal.

                                                        4. -
                                                          friend bool operator!=(const param_type & lhs, const param_type & rhs);
                                                          +
                                                          friend bool operator!=(const param_type & lhs, const param_type & rhs);

                                                          Returns true if the two sets of parameters are different.

                                                        @@ -116,7 +116,7 @@
                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                        diff --git a/doc/html/boost/random/beta_distribution.html b/doc/html/boost/random/beta_distribution.html index 3644cb6854..093d9e4f89 100644 --- a/doc/html/boost/random/beta_distribution.html +++ b/doc/html/boost/random/beta_distribution.html @@ -47,140 +47,140 @@ typedef beta_distribution distribution_type; // construct/copy/destruct - explicit param_type(RealType = 1.0, RealType = 1.0); + explicit param_type(RealType = 1.0, RealType = 1.0); - // public member functions - RealType alpha() const; - RealType beta() const; + // public member functions + RealType alpha() const; + RealType beta() const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); + operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, const param_type &); - friend bool operator==(const param_type &, const param_type &); - friend bool operator!=(const param_type &, const param_type &); + operator>>(std::basic_istream< CharT, Traits > &, const param_type &); + friend bool operator==(const param_type &, const param_type &); + friend bool operator!=(const param_type &, const param_type &); }; // construct/copy/destruct - explicit beta_distribution(RealType = 1.0, RealType = 1.0); - explicit beta_distribution(const param_type &); + explicit beta_distribution(RealType = 1.0, RealType = 1.0); + explicit beta_distribution(const param_type &); - // public member functions - template<typename URNG> RealType operator()(URNG &) const; + // public member functions + template<typename URNG> RealType operator()(URNG &) const; template<typename URNG> - RealType operator()(URNG &, const param_type &) const; - RealType alpha() const; - RealType beta() const; - RealType min() const; - RealType max() const; - param_type param() const; - void param(const param_type &); - void reset(); + RealType operator()(URNG &, const param_type &) const; + RealType alpha() const; + RealType beta() const; + RealType min() const; + RealType max() const; + param_type param() const; + void param(const param_type &); + void reset(); - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, + operator<<(std::basic_ostream< CharT, Traits > &, const beta_distribution &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, + operator>>(std::basic_istream< CharT, Traits > &, const beta_distribution &); - friend bool operator==(const beta_distribution &, const beta_distribution &); - friend bool operator!=(const beta_distribution &, const beta_distribution &); + friend bool operator==(const beta_distribution &, const beta_distribution &); + friend bool operator!=(const beta_distribution &, const beta_distribution &); };
                                                        -

                                                        Description

                                                        +

                                                        Description

                                                        The beta distribution is a real-valued distribution which produces values in the range [0, 1]. It has two parameters, alpha and beta.

                                                        It has .

                                                        -

                                                        +

                                                        beta_distribution public construct/copy/destruct

                                                        1. -
                                                          explicit beta_distribution(RealType alpha = 1.0, RealType beta = 1.0);
                                                          +
                                                          explicit beta_distribution(RealType alpha = 1.0, RealType beta = 1.0);

                                                          Constructs an beta_distribution from its "alpha" and "beta" parameters.

                                                          Requires: alpha > 0, beta > 0

                                                        2. -
                                                          explicit beta_distribution(const param_type & param);
                                                          +
                                                          explicit beta_distribution(const param_type & param);

                                                          Constructs an beta_distribution from its parameters.

                                                        -

                                                        -beta_distribution public member functions

                                                        +

                                                        +beta_distribution public member functions

                                                        1. -
                                                          template<typename URNG> RealType operator()(URNG & urng) const;
                                                          +
                                                          template<typename URNG> RealType operator()(URNG & urng) const;

                                                          Returns a random variate distributed according to the beta distribution. 

                                                        2. template<typename URNG> 
-  RealType operator()(URNG & urng, const param_type & param) const;
                                                          + RealType operator()(URNG & urng, const param_type & param) const;

                                                          Returns a random variate distributed accordint to the beta distribution with parameters specified by param.

                                                        3. -
                                                          RealType alpha() const;
                                                          +
                                                          RealType alpha() const;

                                                          Returns the "alpha" parameter of the distribution.

                                                        4. -
                                                          RealType beta() const;
                                                          +
                                                          RealType beta() const;

                                                          Returns the "beta" parameter of the distribution.

                                                        5. -
                                                          RealType min() const;
                                                          +
                                                          RealType min() const;

                                                          Returns the smallest value that the distribution can produce.

                                                        6. -
                                                          RealType max() const;
                                                          +
                                                          RealType max() const;

                                                          Returns the largest value that the distribution can produce.

                                                        7. -
                                                          param_type param() const;
                                                          +
                                                          param_type param() const;

                                                          Returns the parameters of the distribution.

                                                        8. -
                                                          void param(const param_type & param);
                                                          +
                                                          void param(const param_type & param);

                                                          Sets the parameters of the distribution.

                                                        9. -
                                                          void reset();
                                                          +
                                                          void reset();

                                                          Effects: Subsequent uses of the distribution do not depend on values produced by any engine prior to invoking reset.

                                                        -

                                                        -beta_distribution friend functions

                                                        +

                                                        +beta_distribution friend functions

                                                        1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const beta_distribution & wd);

                                                          Writes an beta_distribution to a std::ostream. 

                                                        2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
              const beta_distribution & wd);

                                                          Reads an beta_distribution from a std::istream.

                                                        3. -
                                                          friend bool operator==(const beta_distribution & lhs, 
+
                                                          friend bool operator==(const beta_distribution & lhs, 
                        const beta_distribution & rhs);
                                                          
 
                                                          Returns true if the two instances of beta_distribution will return identical sequences of values given equal generators.
                                                        4. -
                                                          friend bool operator!=(const beta_distribution & lhs, 
+
                                                          friend bool operator!=(const beta_distribution & lhs, 
                        const beta_distribution & rhs);
                                                          
 
                                                          Returns true if the two instances of beta_distribution will return different sequences of values given equal generators.
                                                          5. diff --git a/doc/html/boost/random/beta_distribution/param_type.html b/doc/html/boost/random/beta_distribution/param_type.html index 66ae73b684..20f3bb7eb5 100644 --- a/doc/html/boost/random/beta_distribution/param_type.html +++ b/doc/html/boost/random/beta_distribution/param_type.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                                          -PrevUpHomeNext +PrevUpHomeNext
                                                          @@ -40,73 +40,73 @@ typedef beta_distribution distribution_type; // construct/copy/destruct - explicit param_type(RealType = 1.0, RealType = 1.0); + explicit param_type(RealType = 1.0, RealType = 1.0); - // public member functions - RealType alpha() const; - RealType beta() const; + // public member functions + RealType alpha() const; + RealType beta() const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); + operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, const param_type &); - friend bool operator==(const param_type &, const param_type &); - friend bool operator!=(const param_type &, const param_type &); + operator>>(std::basic_istream< CharT, Traits > &, const param_type &); + friend bool operator==(const param_type &, const param_type &); + friend bool operator!=(const param_type &, const param_type &); };
                                                          -

                                                          Description

                                                          +

                                                          Description

                                                          -

                                                          +

                                                          param_type public construct/copy/destruct

                                                          1. -
                                                            explicit param_type(RealType alpha = 1.0, RealType beta = 1.0);
                                                            +
                                                            explicit param_type(RealType alpha = 1.0, RealType beta = 1.0);

                                                            Constructs a param_type from the "alpha" and "beta" parameters of the distribution.

                                                            Requires: alpha > 0, beta > 0

                                                          -

                                                          -param_type public member functions

                                                          +

                                                          +param_type public member functions

                                                          1. -
                                                            RealType alpha() const;
                                                            +
                                                            RealType alpha() const;

                                                            Returns the "alpha" parameter of the distribtuion.

                                                          2. -
                                                            RealType beta() const;
                                                            +
                                                            RealType beta() const;

                                                            Returns the "beta" parameter of the distribution.

                                                          -

                                                          -param_type friend functions

                                                          +

                                                          +param_type friend functions

                                                          1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const param_type & param);

                                                            Writes a param_type to a std::ostream. 

                                                          2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
              const param_type & param);

                                                            Reads a param_type from a std::istream.

                                                          3. -
                                                            friend bool operator==(const param_type & lhs, const param_type & rhs);
                                                            +
                                                            friend bool operator==(const param_type & lhs, const param_type & rhs);

                                                            Returns true if the two sets of parameters are the same.

                                                          4. -
                                                            friend bool operator!=(const param_type & lhs, const param_type & rhs);
                                                            +
                                                            friend bool operator!=(const param_type & lhs, const param_type & rhs);

                                                            Returns true if the two sets of parameters are the different.

                                                          @@ -123,7 +123,7 @@
                                                          -PrevUpHomeNext +PrevUpHomeNext
                                                          diff --git a/doc/html/boost/random/binomial_distribution.html b/doc/html/boost/random/binomial_distribution.html index e067f14e8a..f99b9c4699 100644 --- a/doc/html/boost/random/binomial_distribution.html +++ b/doc/html/boost/random/binomial_distribution.html @@ -47,53 +47,53 @@ typedef binomial_distribution distribution_type; // construct/copy/destruct - explicit param_type(IntType = 1, RealType = 0.5); + explicit param_type(IntType = 1, RealType = 0.5); - // public member functions - IntType t() const; - RealType p() const; + // public member functions + IntType t() const; + RealType p() const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); + operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, param_type &); - friend bool operator==(const param_type &, const param_type &); - friend bool operator!=(const param_type &, const param_type &); + operator>>(std::basic_istream< CharT, Traits > &, param_type &); + friend bool operator==(const param_type &, const param_type &); + friend bool operator!=(const param_type &, const param_type &); }; // construct/copy/destruct - explicit binomial_distribution(IntType = 1, RealType = 0.5); - explicit binomial_distribution(const param_type &); + explicit binomial_distribution(IntType = 1, RealType = 0.5); + explicit binomial_distribution(const param_type &); - // public member functions - template<typename URNG> IntType operator()(URNG &) const; - template<typename URNG> IntType operator()(URNG &, const param_type &) const; - IntType t() const; - RealType p() const; - IntType min() const; - IntType max() const; - param_type param() const; - void param(const param_type &); - void reset(); + // public member functions + template<typename URNG> IntType operator()(URNG &) const; + template<typename URNG> IntType operator()(URNG &, const param_type &) const; + IntType t() const; + RealType p() const; + IntType min() const; + IntType max() const; + param_type param() const; + void param(const param_type &); + void reset(); - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, + operator<<(std::basic_ostream< CharT, Traits > &, const binomial_distribution &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, binomial_distribution &); - friend bool operator==(const binomial_distribution &, + operator>>(std::basic_istream< CharT, Traits > &, binomial_distribution &); + friend bool operator==(const binomial_distribution &, const binomial_distribution &); - friend bool operator!=(const binomial_distribution &, + friend bool operator!=(const binomial_distribution &, const binomial_distribution &); };
                                                          -

                                                          Description

                                                          +

                                                          Description

                                                          The binomial distribution is an integer valued distribution with two parameters, t and p. The values of the distribution are within the range [0,t].

                                                          The distribution function is .

                                                          The algorithm used is the BTRD algorithm described in

                                                          @@ -101,90 +101,90 @@

                                                          "The generation of binomial random variates", Wolfgang Hormann, Journal of Statistical Computation and Simulation, Volume 46, Issue 1 & 2 April 1993 , pages 101 - 110

                                                          -

                                                          +

                                                          binomial_distribution public construct/copy/destruct

                                                          1. -
                                                            explicit binomial_distribution(IntType t = 1, RealType p = 0.5);
                                                            +
                                                            explicit binomial_distribution(IntType t = 1, RealType p = 0.5);

                                                            Construct a binomial_distribution object. t and p are the parameters of the distribution.

                                                            Requires: t >=0 && 0 <= p <= 1

                                                          2. -
                                                            explicit binomial_distribution(const param_type & param);
                                                            +
                                                            explicit binomial_distribution(const param_type & param);

                                                            Construct an binomial_distribution object from the parameters.

                                                          -

                                                          -binomial_distribution public member functions

                                                          +

                                                          +binomial_distribution public member functions

                                                          1. -
                                                            template<typename URNG> IntType operator()(URNG & urng) const;
                                                            +
                                                            template<typename URNG> IntType operator()(URNG & urng) const;

                                                            Returns a random variate distributed according to the binomial distribution. 

                                                          2. template<typename URNG> 
-  IntType operator()(URNG & urng, const param_type & param) const;
                                                            + IntType operator()(URNG & urng, const param_type & param) const;

                                                            Returns a random variate distributed according to the binomial distribution with parameters specified by param.

                                                          3. -
                                                            IntType t() const;
                                                            +
                                                            IntType t() const;

                                                            Returns the t parameter of the distribution.

                                                          4. -
                                                            RealType p() const;
                                                            +
                                                            RealType p() const;

                                                            Returns the p parameter of the distribution.

                                                          5. -
                                                            IntType min() const;
                                                            +
                                                            IntType min() const;

                                                            Returns the smallest value that the distribution can produce.

                                                          6. -
                                                            IntType max() const;
                                                            +
                                                            IntType max() const;

                                                            Returns the largest value that the distribution can produce.

                                                          7. -
                                                            param_type param() const;
                                                            +
                                                            param_type param() const;

                                                            Returns the parameters of the distribution.

                                                          8. -
                                                            void param(const param_type & param);
                                                            +
                                                            void param(const param_type & param);

                                                            Sets parameters of the distribution.

                                                          9. -
                                                            void reset();
                                                            +
                                                            void reset();

                                                            Effects: Subsequent uses of the distribution do not depend on values produced by any engine prior to invoking reset.

                                                          -

                                                          -binomial_distribution friend functions

                                                          +

                                                          +binomial_distribution friend functions

                                                          1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const binomial_distribution & bd);

                                                            Writes the parameters of the distribution to a std::ostream. 

                                                          2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
              binomial_distribution & bd);

                                                            Reads the parameters of the distribution from a std::istream.

                                                          3. -
                                                            friend bool operator==(const binomial_distribution & lhs, 
+
                                                            friend bool operator==(const binomial_distribution & lhs, 
                        const binomial_distribution & rhs);
                                                            
 
                                                            Returns true if the two distributions will produce the same sequence of values, given equal generators.
                                                          4. -
                                                            friend bool operator!=(const binomial_distribution & lhs, 
+
                                                            friend bool operator!=(const binomial_distribution & lhs, 
                        const binomial_distribution & rhs);
                                                            
 
                                                            Returns true if the two distributions could produce different sequences of values, given equal generators.
                                                            5. diff --git a/doc/html/boost/random/binomial_distribution/param_type.html b/doc/html/boost/random/binomial_distribution/param_type.html index 2625df9355..9fa2080d1c 100644 --- a/doc/html/boost/random/binomial_distribution/param_type.html +++ b/doc/html/boost/random/binomial_distribution/param_type.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                                            -PrevUpHomeNext +PrevUpHomeNext
                                                            @@ -40,72 +40,72 @@ typedef binomial_distribution distribution_type; // construct/copy/destruct - explicit param_type(IntType = 1, RealType = 0.5); + explicit param_type(IntType = 1, RealType = 0.5); - // public member functions - IntType t() const; - RealType p() const; + // public member functions + IntType t() const; + RealType p() const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); + operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, param_type &); - friend bool operator==(const param_type &, const param_type &); - friend bool operator!=(const param_type &, const param_type &); + operator>>(std::basic_istream< CharT, Traits > &, param_type &); + friend bool operator==(const param_type &, const param_type &); + friend bool operator!=(const param_type &, const param_type &); };
                                                            -

                                                            Description

                                                            +

                                                            Description

                                                            -

                                                            +

                                                            param_type public construct/copy/destruct

                                                            1. -
                                                              explicit param_type(IntType t = 1, RealType p = 0.5);
                                                              +
                                                              explicit param_type(IntType t = 1, RealType p = 0.5);

                                                              Construct a param_type object. t and p are the parameters of the distribution.

                                                              Requires: t >=0 && 0 <= p <= 1

                                                            -

                                                            -param_type public member functions

                                                            +

                                                            +param_type public member functions

                                                            1. -
                                                              IntType t() const;
                                                              +
                                                              IntType t() const;

                                                              Returns the t parameter of the distribution.

                                                            2. -
                                                              RealType p() const;
                                                              +
                                                              RealType p() const;

                                                              Returns the p parameter of the distribution.

                                                            -

                                                            -param_type friend functions

                                                            +

                                                            +param_type friend functions

                                                            1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const param_type & param);

                                                              Writes the parameters of the distribution to a std::ostream. 

                                                            2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, param_type & param);
                                                              + operator>>(std::basic_istream< CharT, Traits > & is, param_type & param);

                                                              Reads the parameters of the distribution from a std::istream.

                                                            3. -
                                                              friend bool operator==(const param_type & lhs, const param_type & rhs);
                                                              +
                                                              friend bool operator==(const param_type & lhs, const param_type & rhs);

                                                              Returns true if the parameters have the same values.

                                                            4. -
                                                              friend bool operator!=(const param_type & lhs, const param_type & rhs);
                                                              +
                                                              friend bool operator!=(const param_type & lhs, const param_type & rhs);

                                                              Returns true if the parameters have different values.

                                                            @@ -122,7 +122,7 @@
                                                            -PrevUpHomeNext +PrevUpHomeNext
                                                            diff --git a/doc/html/boost/random/cauchy_distribution.html b/doc/html/boost/random/cauchy_distribution.html index bf76fb9377..ce631199d3 100644 --- a/doc/html/boost/random/cauchy_distribution.html +++ b/doc/html/boost/random/cauchy_distribution.html @@ -47,147 +47,147 @@ typedef cauchy_distribution distribution_type; // construct/copy/destruct - explicit param_type(RealType = 0.0, RealType = 1.0); + explicit param_type(RealType = 0.0, RealType = 1.0); - // public member functions - RealType median() const; - RealType sigma() const; - RealType a() const; - RealType b() const; + // public member functions + RealType median() const; + RealType sigma() const; + RealType a() const; + RealType b() const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); + operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, const param_type &); - friend bool operator==(const param_type &, const param_type &); - friend bool operator!=(const param_type &, const param_type &); + operator>>(std::basic_istream< CharT, Traits > &, const param_type &); + friend bool operator==(const param_type &, const param_type &); + friend bool operator!=(const param_type &, const param_type &); }; // construct/copy/destruct - explicit cauchy_distribution(RealType = 0.0, RealType = 1.0); - explicit cauchy_distribution(const param_type &); + explicit cauchy_distribution(RealType = 0.0, RealType = 1.0); + explicit cauchy_distribution(const param_type &); - // public member functions - RealType median() const; - RealType sigma() const; - RealType a() const; - RealType b() const; - RealType min() const; - RealType max() const; - param_type param() const; - void param(const param_type &); - void reset(); - template<typename Engine> result_type operator()(Engine &); + // public member functions + RealType median() const; + RealType sigma() const; + RealType a() const; + RealType b() const; + RealType min() const; + RealType max() const; + param_type param() const; + void param(const param_type &); + void reset(); + template<typename Engine> result_type operator()(Engine &); template<typename Engine> - result_type operator()(Engine &, const param_type &); + result_type operator()(Engine &, const param_type &); - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, + operator<<(std::basic_ostream< CharT, Traits > &, const cauchy_distribution &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, + operator>>(std::basic_istream< CharT, Traits > &, const cauchy_distribution &); - friend bool operator==(const cauchy_distribution &, + friend bool operator==(const cauchy_distribution &, const cauchy_distribution &); - friend bool operator!=(const cauchy_distribution &, + friend bool operator!=(const cauchy_distribution &, const cauchy_distribution &); };
                                                            -

                                                            Description

                                                            +

                                                            Description

                                                            The cauchy distribution is a continuous distribution with two parameters, median and sigma.

                                                            It has

                                                            -

                                                            +

                                                            cauchy_distribution public construct/copy/destruct

                                                            1. -
                                                              explicit cauchy_distribution(RealType median = 0.0, RealType sigma = 1.0);
                                                              +
                                                              explicit cauchy_distribution(RealType median = 0.0, RealType sigma = 1.0);

                                                              Constructs a cauchy_distribution with the paramters median and sigma.

                                                            2. -
                                                              explicit cauchy_distribution(const param_type & param);
                                                              +
                                                              explicit cauchy_distribution(const param_type & param);

                                                              Constructs a cauchy_distribution from it's parameters.

                                                            -

                                                            -cauchy_distribution public member functions

                                                            +

                                                            +cauchy_distribution public member functions

                                                            1. -
                                                              RealType median() const;
                                                              +
                                                              RealType median() const;

                                                              Returns: the "median" parameter of the distribution

                                                            2. -
                                                              RealType sigma() const;
                                                              +
                                                              RealType sigma() const;

                                                              Returns: the "sigma" parameter of the distribution

                                                            3. -
                                                              RealType a() const;
                                                              +
                                                              RealType a() const;

                                                              Returns: the "median" parameter of the distribution

                                                            4. -
                                                              RealType b() const;
                                                              +
                                                              RealType b() const;

                                                              Returns: the "sigma" parameter of the distribution

                                                            5. -
                                                              RealType min() const;
                                                              +
                                                              RealType min() const;

                                                              Returns the smallest value that the distribution can produce.

                                                            6. -
                                                              RealType max() const;
                                                              +
                                                              RealType max() const;

                                                              Returns the largest value that the distribution can produce.

                                                              7. -
                                                            7. param_type param() const;
                                                              8. -
                                                            8. void param(const param_type & param);
                                                              9. +
                                                            9. param_type param() const;
                                                              10. +
                                                            10. void param(const param_type & param);
                                                            11. -
                                                              void reset();
                                                              +
                                                              void reset();

                                                              Effects: Subsequent uses of the distribution do not depend on values produced by any engine prior to invoking reset.

                                                            12. -
                                                              template<typename Engine> result_type operator()(Engine & eng);
                                                              +
                                                              template<typename Engine> result_type operator()(Engine & eng);

                                                              Returns: A random variate distributed according to the cauchy distribution. 

                                                            13. template<typename Engine> 
-  result_type operator()(Engine & eng, const param_type & param);
                                                              + result_type operator()(Engine & eng, const param_type & param);

                                                              Returns: A random variate distributed according to the cauchy distribution with parameters specified by param.

                                                            -

                                                            -cauchy_distribution friend functions

                                                            +

                                                            +cauchy_distribution friend functions

                                                            1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const cauchy_distribution & cd);

                                                              Writes the distribution to a std::ostream. 

                                                            2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
              const cauchy_distribution & cd);

                                                              Reads the distribution from a std::istream.

                                                            3. -
                                                              friend bool operator==(const cauchy_distribution & lhs, 
+
                                                              friend bool operator==(const cauchy_distribution & lhs, 
                        const cauchy_distribution & rhs);
                                                              
 
                                                              Returns true if the two distributions will produce identical sequences of values, given equal generators.
                                                            4. -
                                                              friend bool operator!=(const cauchy_distribution & lhs, 
+
                                                              friend bool operator!=(const cauchy_distribution & lhs, 
                        const cauchy_distribution & rhs);
                                                              
 
                                                              Returns true if the two distributions may produce different sequences of values, given equal generators.
                                                              5. diff --git a/doc/html/boost/random/cauchy_distribution/param_type.html b/doc/html/boost/random/cauchy_distribution/param_type.html index cb5d7a5ca0..6b0f1fcbd5 100644 --- a/doc/html/boost/random/cauchy_distribution/param_type.html +++ b/doc/html/boost/random/cauchy_distribution/param_type.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                                              -PrevUpHomeNext +PrevUpHomeNext
                                                              @@ -40,82 +40,82 @@ typedef cauchy_distribution distribution_type; // construct/copy/destruct - explicit param_type(RealType = 0.0, RealType = 1.0); + explicit param_type(RealType = 0.0, RealType = 1.0); - // public member functions - RealType median() const; - RealType sigma() const; - RealType a() const; - RealType b() const; + // public member functions + RealType median() const; + RealType sigma() const; + RealType a() const; + RealType b() const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); + operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, const param_type &); - friend bool operator==(const param_type &, const param_type &); - friend bool operator!=(const param_type &, const param_type &); + operator>>(std::basic_istream< CharT, Traits > &, const param_type &); + friend bool operator==(const param_type &, const param_type &); + friend bool operator!=(const param_type &, const param_type &); };
                                                              -

                                                              Description

                                                              +

                                                              Description

                                                              -

                                                              +

                                                              param_type public construct/copy/destruct

                                                              1. -
                                                                explicit param_type(RealType median = 0.0, RealType sigma = 1.0);
                                                                +
                                                                explicit param_type(RealType median = 0.0, RealType sigma = 1.0);

                                                                Constructs the parameters of the cauchy distribution.

                                                              -

                                                              -param_type public member functions

                                                              +

                                                              +param_type public member functions

                                                              1. -
                                                                RealType median() const;
                                                                +
                                                                RealType median() const;

                                                                Returns the median of the distribution.

                                                              2. -
                                                                RealType sigma() const;
                                                                +
                                                                RealType sigma() const;

                                                                Returns the sigma parameter of the distribution.

                                                              3. -
                                                                RealType a() const;
                                                                +
                                                                RealType a() const;

                                                                Returns the median of the distribution.

                                                              4. -
                                                                RealType b() const;
                                                                +
                                                                RealType b() const;

                                                                Returns the sigma parameter of the distribution.

                                                              -

                                                              -param_type friend functions

                                                              +

                                                              +param_type friend functions

                                                              1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const param_type & param);

                                                                Writes the parameters to a std::ostream. 

                                                              2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
              const param_type & param);

                                                                Reads the parameters from a std::istream.

                                                              3. -
                                                                friend bool operator==(const param_type & lhs, const param_type & rhs);
                                                                +
                                                                friend bool operator==(const param_type & lhs, const param_type & rhs);

                                                                Returns true if the two sets of parameters are equal.

                                                              4. -
                                                                friend bool operator!=(const param_type & lhs, const param_type & rhs);
                                                                +
                                                                friend bool operator!=(const param_type & lhs, const param_type & rhs);

                                                                Returns true if the two sets of parameters are different.

                                                              @@ -132,7 +132,7 @@
                                                              -PrevUpHomeNext +PrevUpHomeNext
                                                              diff --git a/doc/html/boost/random/chi_squared_distribution.html b/doc/html/boost/random/chi_squared_distribution.html index 64227a956b..b105f0908b 100644 --- a/doc/html/boost/random/chi_squared_distribution.html +++ b/doc/html/boost/random/chi_squared_distribution.html @@ -47,136 +47,136 @@ typedef chi_squared_distribution distribution_type; // construct/copy/destruct - explicit param_type(RealType = 1); + explicit param_type(RealType = 1); - // public member functions - RealType n() const; + // public member functions + RealType n() const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); + operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, param_type &); - friend bool operator==(const param_type &, const param_type &); - friend bool operator!=(const param_type &, const param_type &); + operator>>(std::basic_istream< CharT, Traits > &, param_type &); + friend bool operator==(const param_type &, const param_type &); + friend bool operator!=(const param_type &, const param_type &); }; // construct/copy/destruct - explicit chi_squared_distribution(RealType = 1); - explicit chi_squared_distribution(const param_type &); + explicit chi_squared_distribution(RealType = 1); + explicit chi_squared_distribution(const param_type &); - // public member functions - template<typename URNG> RealType operator()(URNG &); + // public member functions + template<typename URNG> RealType operator()(URNG &); template<typename URNG> - RealType operator()(URNG &, const param_type &) const; - RealType n() const; - RealType min() const; - RealType max() const; - param_type param() const; - void param(const param_type &); - void reset(); + RealType operator()(URNG &, const param_type &) const; + RealType n() const; + RealType min() const; + RealType max() const; + param_type param() const; + void param(const param_type &); + void reset(); - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, + operator<<(std::basic_ostream< CharT, Traits > &, const chi_squared_distribution &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, + operator>>(std::basic_istream< CharT, Traits > &, chi_squared_distribution &); - friend bool operator==(const chi_squared_distribution &, + friend bool operator==(const chi_squared_distribution &, const chi_squared_distribution &); - friend bool operator!=(const chi_squared_distribution &, + friend bool operator!=(const chi_squared_distribution &, const chi_squared_distribution &); };
                                                              -

                                                              Description

                                                              +

                                                              Description

                                                              The chi squared distribution is a real valued distribution with one parameter, n. The distribution produces values > 0.

                                                              The distribution function is .

                                                              -

                                                              +

                                                              chi_squared_distribution public construct/copy/destruct

                                                              1. -
                                                                explicit chi_squared_distribution(RealType n = 1);
                                                                +
                                                                explicit chi_squared_distribution(RealType n = 1);

                                                                Construct a chi_squared_distribution object. n is the parameter of the distribution.

                                                                Requires: t >=0 && 0 <= p <= 1

                                                              2. -
                                                                explicit chi_squared_distribution(const param_type & param);
                                                                +
                                                                explicit chi_squared_distribution(const param_type & param);

                                                                Construct an chi_squared_distribution object from the parameters.

                                                              -

                                                              -chi_squared_distribution public member functions

                                                              +

                                                              +chi_squared_distribution public member functions

                                                              1. -
                                                                template<typename URNG> RealType operator()(URNG & urng);
                                                                +
                                                                template<typename URNG> RealType operator()(URNG & urng);

                                                                Returns a random variate distributed according to the chi squared distribution. 

                                                              2. template<typename URNG> 
-  RealType operator()(URNG & urng, const param_type & param) const;
                                                                + RealType operator()(URNG & urng, const param_type & param) const;

                                                                Returns a random variate distributed according to the chi squared distribution with parameters specified by param.

                                                              3. -
                                                                RealType n() const;
                                                                +
                                                                RealType n() const;

                                                                Returns the n parameter of the distribution.

                                                              4. -
                                                                RealType min() const;
                                                                +
                                                                RealType min() const;

                                                                Returns the smallest value that the distribution can produce.

                                                              5. -
                                                                RealType max() const;
                                                                +
                                                                RealType max() const;

                                                                Returns the largest value that the distribution can produce.

                                                              6. -
                                                                param_type param() const;
                                                                +
                                                                param_type param() const;

                                                                Returns the parameters of the distribution.

                                                              7. -
                                                                void param(const param_type & param);
                                                                +
                                                                void param(const param_type & param);

                                                                Sets parameters of the distribution.

                                                              8. -
                                                                void reset();
                                                                +
                                                                void reset();

                                                                Effects: Subsequent uses of the distribution do not depend on values produced by any engine prior to invoking reset.

                                                              -

                                                              -chi_squared_distribution friend functions

                                                              +

                                                              +chi_squared_distribution friend functions

                                                              1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const chi_squared_distribution & c2d);

                                                                Writes the parameters of the distribution to a std::ostream. 

                                                              2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
              chi_squared_distribution & c2d);

                                                                Reads the parameters of the distribution from a std::istream.

                                                              3. -
                                                                friend bool operator==(const chi_squared_distribution & lhs, 
+
                                                                friend bool operator==(const chi_squared_distribution & lhs, 
                        const chi_squared_distribution & rhs);
                                                                
 
                                                                Returns true if the two distributions will produce the same sequence of values, given equal generators.
                                                              4. -
                                                                friend bool operator!=(const chi_squared_distribution & lhs, 
+
                                                                friend bool operator!=(const chi_squared_distribution & lhs, 
                        const chi_squared_distribution & rhs);
                                                                
 
                                                                Returns true if the two distributions could produce different sequences of values, given equal generators.
                                                                5. diff --git a/doc/html/boost/random/chi_squared_distribution/param_type.html b/doc/html/boost/random/chi_squared_distribution/param_type.html index 06012705d5..ea8ea90b34 100644 --- a/doc/html/boost/random/chi_squared_distribution/param_type.html +++ b/doc/html/boost/random/chi_squared_distribution/param_type.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                                                -PrevUpHomeNext +PrevUpHomeNext
                                                                @@ -40,65 +40,65 @@ typedef chi_squared_distribution distribution_type; // construct/copy/destruct - explicit param_type(RealType = 1); + explicit param_type(RealType = 1); - // public member functions - RealType n() const; + // public member functions + RealType n() const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); + operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, param_type &); - friend bool operator==(const param_type &, const param_type &); - friend bool operator!=(const param_type &, const param_type &); + operator>>(std::basic_istream< CharT, Traits > &, param_type &); + friend bool operator==(const param_type &, const param_type &); + friend bool operator!=(const param_type &, const param_type &); };
                                                                -

                                                                Description

                                                                +

                                                                Description

                                                                -

                                                                +

                                                                param_type public construct/copy/destruct

                                                                1. -
                                                                  explicit param_type(RealType n = 1);
                                                                  +
                                                                  explicit param_type(RealType n = 1);

                                                                  Construct a param_type object. n is the parameter of the distribution.

                                                                  Requires: t >=0 && 0 <= p <= 1

                                                                -

                                                                -param_type public member functions

                                                                +

                                                                +param_type public member functions

                                                                1. -
                                                                  RealType n() const;
                                                                  +
                                                                  RealType n() const;

                                                                  Returns the n parameter of the distribution.

                                                                -

                                                                -param_type friend functions

                                                                +

                                                                +param_type friend functions

                                                                1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const param_type & param);

                                                                  Writes the parameters of the distribution to a std::ostream. 

                                                                2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, param_type & param);
                                                                  + operator>>(std::basic_istream< CharT, Traits > & is, param_type & param);

                                                                  Reads the parameters of the distribution from a std::istream.

                                                                3. -
                                                                  friend bool operator==(const param_type & lhs, const param_type & rhs);
                                                                  +
                                                                  friend bool operator==(const param_type & lhs, const param_type & rhs);

                                                                  Returns true if the parameters have the same values.

                                                                4. -
                                                                  friend bool operator!=(const param_type & lhs, const param_type & rhs);
                                                                  +
                                                                  friend bool operator!=(const param_type & lhs, const param_type & rhs);

                                                                  Returns true if the parameters have different values.

                                                                @@ -115,7 +115,7 @@
                                                                -PrevUpHomeNext +PrevUpHomeNext
                                                                diff --git a/doc/html/boost/random/discard_block_engine.html b/doc/html/boost/random/discard_block_engine.html index 0abff729b7..c26c703bbc 100644 --- a/doc/html/boost/random/discard_block_engine.html +++ b/doc/html/boost/random/discard_block_engine.html @@ -40,38 +40,38 @@ typedef base_type::result_type result_type; // construct/copy/destruct - discard_block_engine(); - explicit discard_block_engine(const base_type &); - explicit discard_block_engine(base_type &&); - explicit discard_block_engine(seed_type); - template<typename SeedSeq> explicit discard_block_engine(SeedSeq &); - template<typename It> discard_block_engine(It &, It); + discard_block_engine(); + explicit discard_block_engine(const base_type &); + explicit discard_block_engine(base_type &&); + explicit discard_block_engine(seed_type); + template<typename SeedSeq> explicit discard_block_engine(SeedSeq &); + template<typename It> discard_block_engine(It &, It); - // public member functions - void seed(); - void seed(seed_type); - template<typename SeedSeq> void seed(SeedSeq &); - template<typename It> void seed(It &, It); - const base_type & base() const; - result_type operator()(); - void discard(boost::uintmax_t); - template<typename It> void generate(It, It); + // public member functions + void seed(); + void seed(seed_type); + template<typename SeedSeq> void seed(SeedSeq &); + template<typename It> void seed(It &, It); + const base_type & base() const; + result_type operator()(); + void discard(boost::uintmax_t); + template<typename It> void generate(It, It); - // public static functions - static result_type min(); - static result_type max(); + // public static functions + static result_type min(); + static result_type max(); - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, + operator<<(std::basic_ostream< CharT, Traits > &, const discard_block_engine &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, discard_block_engine &); - friend bool operator==(const discard_block_engine &, + operator>>(std::basic_istream< CharT, Traits > &, discard_block_engine &); + friend bool operator==(const discard_block_engine &, const discard_block_engine &); - friend bool operator!=(const discard_block_engine &, + friend bool operator!=(const discard_block_engine &, const discard_block_engine &); // public data members @@ -82,112 +82,112 @@ static const std::size_t returned_block; };
                                                                -

                                                                Description

                                                                +

                                                                Description

                                                                The class template discard_block_engine is a model of pseudo-random number generator . It modifies another generator by discarding parts of its output. Out of every block of p results, the first r will be returned and the rest discarded.

                                                                Requires: 0 < p <= r

                                                                -

                                                                +

                                                                discard_block_engine public construct/copy/destruct

                                                                1. -
                                                                  discard_block_engine();
                                                                  +
                                                                  discard_block_engine();

                                                                  Uses the default seed for the base generator.

                                                                2. -
                                                                  explicit discard_block_engine(const base_type & rng);
                                                                  +
                                                                  explicit discard_block_engine(const base_type & rng);

                                                                  Constructs a new discard_block_engine with a copy of rng.

                                                                3. -
                                                                  explicit discard_block_engine(base_type && rng);
                                                                  +
                                                                  explicit discard_block_engine(base_type && rng);

                                                                  Constructs a new discard_block_engine with rng.

                                                                4. -
                                                                  explicit discard_block_engine(seed_type value);
                                                                  +
                                                                  explicit discard_block_engine(seed_type value);

                                                                  Creates a new discard_block_engine and seeds the underlying generator with value

                                                                5. -
                                                                  template<typename SeedSeq> explicit discard_block_engine(SeedSeq & seq);
                                                                  +
                                                                  template<typename SeedSeq> explicit discard_block_engine(SeedSeq & seq);

                                                                  Creates a new discard_block_engine and seeds the underlying generator with seq

                                                                6. -
                                                                  template<typename It> discard_block_engine(It & first, It last);
                                                                  +
                                                                  template<typename It> discard_block_engine(It & first, It last);

                                                                  Creates a new discard_block_engine and seeds the underlying generator with first and last.

                                                                -

                                                                -discard_block_engine public member functions

                                                                +

                                                                +discard_block_engine public member functions

                                                                1. -
                                                                  void seed();
                                                                  +
                                                                  void seed();

                                                                  default seeds the underlying generator.

                                                                2. -
                                                                  void seed(seed_type s);
                                                                  +
                                                                  void seed(seed_type s);

                                                                  Seeds the underlying generator with s.

                                                                3. -
                                                                  template<typename SeedSeq> void seed(SeedSeq & seq);
                                                                  +
                                                                  template<typename SeedSeq> void seed(SeedSeq & seq);

                                                                  Seeds the underlying generator with seq.

                                                                4. -
                                                                  template<typename It> void seed(It & first, It last);
                                                                  +
                                                                  template<typename It> void seed(It & first, It last);

                                                                  Seeds the underlying generator with first and last.

                                                                5. -
                                                                  const base_type & base() const;
                                                                  +
                                                                  const base_type & base() const;

                                                                  Returns the underlying engine.

                                                                6. -
                                                                  result_type operator()();
                                                                  +
                                                                  result_type operator()();

                                                                  Returns the next value of the generator.

                                                                  7. -
                                                                7. void discard(boost::uintmax_t z);
                                                                  8. -
                                                                8. template<typename It> void generate(It first, It last);
                                                                  9. +
                                                                9. void discard(boost::uintmax_t z);
                                                                  10. +
                                                                10. template<typename It> void generate(It first, It last);
                                                                -

                                                                -discard_block_engine public static functions

                                                                +

                                                                +discard_block_engine public static functions

                                                                1. -
                                                                  static result_type min();
                                                                  +
                                                                  static result_type min();

                                                                  Returns the smallest value that the generator can produce. This is the same as the minimum of the underlying generator.

                                                                2. -
                                                                  static result_type max();
                                                                  +
                                                                  static result_type max();

                                                                  Returns the largest value that the generator can produce. This is the same as the maximum of the underlying generator.

                                                                -

                                                                -discard_block_engine friend functions

                                                                +

                                                                +discard_block_engine friend functions

                                                                1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const discard_block_engine & s);

                                                                  Writes a discard_block_engine to a std::ostream. 

                                                                2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
              discard_block_engine & s);

                                                                  Reads a discard_block_engine from a std::istream.

                                                                3. -
                                                                  friend bool operator==(const discard_block_engine & x, 
+
                                                                  friend bool operator==(const discard_block_engine & x, 
                        const discard_block_engine & y);
                                                                  
 
                                                                  Returns true if the two generators will produce identical sequences.
                                                                4. -
                                                                  friend bool operator!=(const discard_block_engine & x, 
+
                                                                  friend bool operator!=(const discard_block_engine & x, 
                        const discard_block_engine & y);
                                                                  
 
                                                                  Returns true if the two generators will produce different sequences.
                                                                  5. diff --git a/doc/html/boost/random/discrete_distribution.html b/doc/html/boost/random/discrete_distribution.html index e095581ece..8af388c54f 100644 --- a/doc/html/boost/random/discrete_distribution.html +++ b/doc/html/boost/random/discrete_distribution.html @@ -47,121 +47,121 @@ typedef discrete_distribution distribution_type; // construct/copy/destruct - param_type(); - template<typename Iter> param_type(Iter, Iter); - param_type(const std::initializer_list< WeightType > &); - template<typename Range> explicit param_type(const Range &); - template<typename Func> param_type(std::size_t, double, double, Func); + param_type(); + template<typename Iter> param_type(Iter, Iter); + param_type(const std::initializer_list< WeightType > &); + template<typename Range> explicit param_type(const Range &); + template<typename Func> param_type(std::size_t, double, double, Func); - // public member functions - std::vector< WeightType > probabilities() const; + // public member functions + std::vector< WeightType > probabilities() const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); + operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, const param_type &); - friend bool operator==(const param_type &, const param_type &); - friend bool operator!=(const param_type &, const param_type &); + operator>>(std::basic_istream< CharT, Traits > &, const param_type &); + friend bool operator==(const param_type &, const param_type &); + friend bool operator!=(const param_type &, const param_type &); }; // construct/copy/destruct - discrete_distribution(); - template<typename Iter> discrete_distribution(Iter, Iter); - discrete_distribution(std::initializer_list< WeightType >); - template<typename Range> explicit discrete_distribution(const Range &); + discrete_distribution(); + template<typename Iter> discrete_distribution(Iter, Iter); + discrete_distribution(std::initializer_list< WeightType >); + template<typename Range> explicit discrete_distribution(const Range &); template<typename Func> - discrete_distribution(std::size_t, double, double, Func); - explicit discrete_distribution(const param_type &); + discrete_distribution(std::size_t, double, double, Func); + explicit discrete_distribution(const param_type &); - // public member functions - template<typename URNG> IntType operator()(URNG &) const; - template<typename URNG> IntType operator()(URNG &, const param_type &) const; - result_type min() const; - result_type max() const; - std::vector< WeightType > probabilities() const; - param_type param() const; - void param(const param_type &); - void reset(); + // public member functions + template<typename URNG> IntType operator()(URNG &) const; + template<typename URNG> IntType operator()(URNG &, const param_type &) const; + result_type min() const; + result_type max() const; + std::vector< WeightType > probabilities() const; + param_type param() const; + void param(const param_type &); + void reset(); - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, + operator<<(std::basic_ostream< CharT, Traits > &, const discrete_distribution &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, + operator>>(std::basic_istream< CharT, Traits > &, const discrete_distribution &); - friend bool operator==(const discrete_distribution &, + friend bool operator==(const discrete_distribution &, const discrete_distribution &); - friend bool operator!=(const discrete_distribution &, + friend bool operator!=(const discrete_distribution &, const discrete_distribution &); };
                                                                -

                                                                Description

                                                                +

                                                                Description

                                                                The class discrete_distribution models a random distribution . It produces integers in the range [0, n) with the probability of producing each value is specified by the parameters of the distribution.

                                                                -

                                                                +

                                                                discrete_distribution public construct/copy/destruct

                                                                1. -
                                                                  discrete_distribution();
                                                                  +
                                                                  discrete_distribution();

                                                                  Creates a new discrete_distribution object that has and .

                                                                2. -
                                                                  template<typename Iter> discrete_distribution(Iter first, Iter last);
                                                                  +
                                                                  template<typename Iter> discrete_distribution(Iter first, Iter last);

                                                                  Constructs a discrete_distribution from an iterator range. If first == last, equivalent to the default constructor. Otherwise, the values of the range represent weights for the possible values of the distribution.

                                                                3. -
                                                                  discrete_distribution(std::initializer_list< WeightType > wl);
                                                                  +
                                                                  discrete_distribution(std::initializer_list< WeightType > wl);

                                                                  Constructs a discrete_distribution from a std::initializer_list. If the initializer_list is empty, equivalent to the default constructor. Otherwise, the values of the initializer_list represent weights for the possible values of the distribution. For example, given the distribution

                                                                  discrete_distribution<> dist{1, 4, 5};

                                                                  The probability of a 0 is 1/10, the probability of a 1 is 2/5, the probability of a 2 is 1/2, and no other values are possible.

                                                                4. -
                                                                  template<typename Range> explicit discrete_distribution(const Range & range);
                                                                  +
                                                                  template<typename Range> explicit discrete_distribution(const Range & range);

                                                                  Constructs a discrete_distribution from a Boost.Range range. If the range is empty, equivalent to the default constructor. Otherwise, the values of the range represent weights for the possible values of the distribution. 

                                                                5. template<typename Func> 
-  discrete_distribution(std::size_t nw, double xmin, double xmax, Func fw);
                                                                  + discrete_distribution(std::size_t nw, double xmin, double xmax, Func fw);

                                                                  Constructs a discrete_distribution that approximates a function. If nw is zero, equivalent to the default constructor. Otherwise, the range of the distribution is [0, nw), and the weights are found by calling fw with values evenly distributed between and , where .

                                                                6. -
                                                                  explicit discrete_distribution(const param_type & param);
                                                                  +
                                                                  explicit discrete_distribution(const param_type & param);

                                                                  Constructs a discrete_distribution from its parameters.

                                                                -

                                                                -discrete_distribution public member functions

                                                                +

                                                                +discrete_distribution public member functions

                                                                1. -
                                                                  template<typename URNG> IntType operator()(URNG & urng) const;
                                                                  +
                                                                  template<typename URNG> IntType operator()(URNG & urng) const;

                                                                  Returns a value distributed according to the parameters of the discrete_distribution. 

                                                                2. template<typename URNG> 
-  IntType operator()(URNG & urng, const param_type & param) const;
                                                                  + IntType operator()(URNG & urng, const param_type & param) const;

                                                                  Returns a value distributed according to the parameters specified by param.

                                                                3. -
                                                                  result_type min() const;
                                                                  +
                                                                  result_type min() const;

                                                                  Returns the smallest value that the distribution can produce.

                                                                4. -
                                                                  result_type max() const;
                                                                  +
                                                                  result_type max() const;

                                                                  Returns the largest value that the distribution can produce.

                                                                5. -
                                                                  std::vector< WeightType > probabilities() const;
                                                                  +
                                                                  std::vector< WeightType > probabilities() const;

                                                                  Returns a vector containing the probabilities of each value of the distribution. For example, given

                                                                  discrete_distribution<> dist = { 1, 4, 5 };
 std::vector<double> p = dist.param();
@@ -170,44 +170,44 @@
 
                                                                  If WeightType is integral, then the weights will be returned unchanged.
                                                                6. -
                                                                  param_type param() const;
                                                                  +
                                                                  param_type param() const;

                                                                  Returns the parameters of the distribution.

                                                                7. -
                                                                  void param(const param_type & param);
                                                                  +
                                                                  void param(const param_type & param);

                                                                  Sets the parameters of the distribution.

                                                                8. -
                                                                  void reset();
                                                                  +
                                                                  void reset();

                                                                  Effects: Subsequent uses of the distribution do not depend on values produced by any engine prior to invoking reset.

                                                                -

                                                                -discrete_distribution friend functions

                                                                +

                                                                +discrete_distribution friend functions

                                                                1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const discrete_distribution & dd);

                                                                  Writes a distribution to a std::ostream. 

                                                                2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
              const discrete_distribution & dd);

                                                                  Reads a distribution from a std::istream

                                                                3. -
                                                                  friend bool operator==(const discrete_distribution & lhs, 
+
                                                                  friend bool operator==(const discrete_distribution & lhs, 
                        const discrete_distribution & rhs);
                                                                  
 
                                                                  Returns true if the two distributions will return the same sequence of values, when passed equal generators.
                                                                4. -
                                                                  friend bool operator!=(const discrete_distribution & lhs, 
+
                                                                  friend bool operator!=(const discrete_distribution & lhs, 
                        const discrete_distribution & rhs);
                                                                  
 
                                                                  Returns true if the two distributions may return different sequences of values, when passed equal generators.
                                                                  5. diff --git a/doc/html/boost/random/discrete_distribution/param_type.html b/doc/html/boost/random/discrete_distribution/param_type.html index 6961773511..4e1746b136 100644 --- a/doc/html/boost/random/discrete_distribution/param_type.html +++ b/doc/html/boost/random/discrete_distribution/param_type.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                                                  -PrevUpHomeNext +PrevUpHomeNext
                                                                  @@ -40,88 +40,88 @@ typedef discrete_distribution distribution_type; // construct/copy/destruct - param_type(); - template<typename Iter> param_type(Iter, Iter); - param_type(const std::initializer_list< WeightType > &); - template<typename Range> explicit param_type(const Range &); - template<typename Func> param_type(std::size_t, double, double, Func); + param_type(); + template<typename Iter> param_type(Iter, Iter); + param_type(const std::initializer_list< WeightType > &); + template<typename Range> explicit param_type(const Range &); + template<typename Func> param_type(std::size_t, double, double, Func); - // public member functions - std::vector< WeightType > probabilities() const; + // public member functions + std::vector< WeightType > probabilities() const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); + operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, const param_type &); - friend bool operator==(const param_type &, const param_type &); - friend bool operator!=(const param_type &, const param_type &); + operator>>(std::basic_istream< CharT, Traits > &, const param_type &); + friend bool operator==(const param_type &, const param_type &); + friend bool operator!=(const param_type &, const param_type &); };
                                                                  -

                                                                  Description

                                                                  +

                                                                  Description

                                                                  -

                                                                  +

                                                                  param_type public construct/copy/destruct

                                                                  1. -
                                                                    param_type();
                                                                    +
                                                                    param_type();

                                                                    Constructs a param_type object, representing a distribution with and .

                                                                  2. -
                                                                    template<typename Iter> param_type(Iter first, Iter last);
                                                                    +
                                                                    template<typename Iter> param_type(Iter first, Iter last);

                                                                    If first == last, equivalent to the default constructor. Otherwise, the values of the range represent weights for the possible values of the distribution.

                                                                  3. -
                                                                    param_type(const std::initializer_list< WeightType > & wl);
                                                                    +
                                                                    param_type(const std::initializer_list< WeightType > & wl);

                                                                    If wl.size() == 0, equivalent to the default constructor. Otherwise, the values of the initializer_list represent weights for the possible values of the distribution.

                                                                  4. -
                                                                    template<typename Range> explicit param_type(const Range & range);
                                                                    +
                                                                    template<typename Range> explicit param_type(const Range & range);

                                                                    If the range is empty, equivalent to the default constructor. Otherwise, the elements of the range represent weights for the possible values of the distribution. 

                                                                  5. template<typename Func> 
-  param_type(std::size_t nw, double xmin, double xmax, Func fw);
                                                                    + param_type(std::size_t nw, double xmin, double xmax, Func fw);

                                                                    If nw is zero, equivalent to the default constructor. Otherwise, the range of the distribution is [0, nw), and the weights are found by calling fw with values evenly distributed between and , where .

                                                                  -

                                                                  -param_type public member functions

                                                                  +

                                                                  +param_type public member functions

                                                                  1. -
                                                                    std::vector< WeightType > probabilities() const;
                                                                    +
                                                                    std::vector< WeightType > probabilities() const;

                                                                    Returns a vector containing the probabilities of each possible value of the distribution.

                                                                  -

                                                                  -param_type friend functions

                                                                  +

                                                                  +param_type friend functions

                                                                  1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const param_type & param);

                                                                    Writes the parameters to a std::ostream. 

                                                                  2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
              const param_type & param);

                                                                    Reads the parameters from a std::istream.

                                                                  3. -
                                                                    friend bool operator==(const param_type & lhs, const param_type & rhs);
                                                                    +
                                                                    friend bool operator==(const param_type & lhs, const param_type & rhs);

                                                                    Returns true if the two sets of parameters are the same.

                                                                  4. -
                                                                    friend bool operator!=(const param_type & lhs, const param_type & rhs);
                                                                    +
                                                                    friend bool operator!=(const param_type & lhs, const param_type & rhs);

                                                                    Returns true if the two sets of parameters are different.

                                                                  @@ -138,7 +138,7 @@
                                                                  -PrevUpHomeNext +PrevUpHomeNext
                                                                  diff --git a/doc/html/boost/random/ecuyer1988.html b/doc/html/boost/random/ecuyer1988.html index 8d38f8f736..7adf1e3c61 100644 --- a/doc/html/boost/random/ecuyer1988.html +++ b/doc/html/boost/random/ecuyer1988.html @@ -35,7 +35,7 @@ typedef additive_combine_engine< linear_congruential_engine< uint32_t, 40014, 0, 2147483563 >, linear_congruential_engine< uint32_t, 40692, 0, 2147483399 >> ecuyer1988;
                                                                  -

                                                                  Description

                                                                  +

                                                                  Description

                                                                  The specialization ecuyer1988 was suggested in

                                                                  "Efficient and Portable Combined Random Number Generators", Pierre L'Ecuyer, Communications of the ACM, Vol. 31, No. 6, June 1988, pp. 742-749, 774

                                                                  diff --git a/doc/html/boost/random/exponential_distribution.html b/doc/html/boost/random/exponential_distribution.html index 216f379ec2..06c8c42fbd 100644 --- a/doc/html/boost/random/exponential_distribution.html +++ b/doc/html/boost/random/exponential_distribution.html @@ -47,136 +47,136 @@ typedef exponential_distribution distribution_type; // construct/copy/destruct - param_type(RealType = 1.0); + param_type(RealType = 1.0); - // public member functions - RealType lambda() const; + // public member functions + RealType lambda() const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); + operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, const param_type &); - friend bool operator==(const param_type &, const param_type &); - friend bool operator!=(const param_type &, const param_type &); + operator>>(std::basic_istream< CharT, Traits > &, const param_type &); + friend bool operator==(const param_type &, const param_type &); + friend bool operator!=(const param_type &, const param_type &); }; // construct/copy/destruct - explicit exponential_distribution(RealType = 1.0); - explicit exponential_distribution(const param_type &); + explicit exponential_distribution(RealType = 1.0); + explicit exponential_distribution(const param_type &); - // public member functions - RealType lambda() const; - RealType min() const; - RealType max() const; - param_type param() const; - void param(const param_type &); - void reset(); - template<typename Engine> result_type operator()(Engine &) const; + // public member functions + RealType lambda() const; + RealType min() const; + RealType max() const; + param_type param() const; + void param(const param_type &); + void reset(); + template<typename Engine> result_type operator()(Engine &) const; template<typename Engine> - result_type operator()(Engine &, const param_type &) const; + result_type operator()(Engine &, const param_type &) const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, + operator<<(std::basic_ostream< CharT, Traits > &, const exponential_distribution &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, + operator>>(std::basic_istream< CharT, Traits > &, const exponential_distribution &); - friend bool operator==(const exponential_distribution &, + friend bool operator==(const exponential_distribution &, const exponential_distribution &); - friend bool operator!=(const exponential_distribution &, + friend bool operator!=(const exponential_distribution &, const exponential_distribution &); };
                                                                  -

                                                                  Description

                                                                  +

                                                                  Description

                                                                  The exponential distribution is a model of random distribution with a single parameter lambda.

                                                                  It has

                                                                  -

                                                                  +

                                                                  exponential_distribution public construct/copy/destruct

                                                                  1. -
                                                                    explicit exponential_distribution(RealType lambda = 1.0);
                                                                    +
                                                                    explicit exponential_distribution(RealType lambda = 1.0);

                                                                    Constructs an exponential_distribution with a given lambda.

                                                                    Requires: lambda > 0

                                                                  2. -
                                                                    explicit exponential_distribution(const param_type & param);
                                                                    +
                                                                    explicit exponential_distribution(const param_type & param);

                                                                    Constructs an exponential_distribution from its parameters

                                                                  -

                                                                  -exponential_distribution public member functions

                                                                  +

                                                                  +exponential_distribution public member functions

                                                                  1. -
                                                                    RealType lambda() const;
                                                                    +
                                                                    RealType lambda() const;

                                                                    Returns the lambda parameter of the distribution.

                                                                  2. -
                                                                    RealType min() const;
                                                                    +
                                                                    RealType min() const;

                                                                    Returns the smallest value that the distribution can produce.

                                                                  3. -
                                                                    RealType max() const;
                                                                    +
                                                                    RealType max() const;

                                                                    Returns the largest value that the distribution can produce.

                                                                  4. -
                                                                    param_type param() const;
                                                                    +
                                                                    param_type param() const;

                                                                    Returns the parameters of the distribution.

                                                                  5. -
                                                                    void param(const param_type & param);
                                                                    +
                                                                    void param(const param_type & param);

                                                                    Sets the parameters of the distribution.

                                                                  6. -
                                                                    void reset();
                                                                    +
                                                                    void reset();

                                                                    Effects: Subsequent uses of the distribution do not depend on values produced by any engine prior to invoking reset.

                                                                  7. -
                                                                    template<typename Engine> result_type operator()(Engine & eng) const;
                                                                    +
                                                                    template<typename Engine> result_type operator()(Engine & eng) const;

                                                                    Returns a random variate distributed according to the exponential distribution. 

                                                                  8. template<typename Engine> 
-  result_type operator()(Engine & eng, const param_type & param) const;
                                                                    + result_type operator()(Engine & eng, const param_type & param) const;

                                                                    Returns a random variate distributed according to the exponential distribution with parameters specified by param.

                                                                  -

                                                                  -exponential_distribution friend functions

                                                                  +

                                                                  +exponential_distribution friend functions

                                                                  1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const exponential_distribution & ed);

                                                                    Writes the distribution to a std::ostream. 

                                                                  2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
              const exponential_distribution & ed);

                                                                    Reads the distribution from a std::istream.

                                                                  3. -
                                                                    friend bool operator==(const exponential_distribution & lhs, 
+
                                                                    friend bool operator==(const exponential_distribution & lhs, 
                        const exponential_distribution & rhs);
                                                                    
 
                                                                    Returns true iff the two distributions will produce identical sequences of values given equal generators.
                                                                  4. -
                                                                    friend bool operator!=(const exponential_distribution & lhs, 
+
                                                                    friend bool operator!=(const exponential_distribution & lhs, 
                        const exponential_distribution & rhs);
                                                                    
 
                                                                    Returns true iff the two distributions will produce different sequences of values given equal generators.
                                                                    5. diff --git a/doc/html/boost/random/exponential_distribution/param_type.html b/doc/html/boost/random/exponential_distribution/param_type.html index 855b7e9d2c..908d1cebe4 100644 --- a/doc/html/boost/random/exponential_distribution/param_type.html +++ b/doc/html/boost/random/exponential_distribution/param_type.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                                    @@ -40,66 +40,66 @@ typedef exponential_distribution distribution_type; // construct/copy/destruct - param_type(RealType = 1.0); + param_type(RealType = 1.0); - // public member functions - RealType lambda() const; + // public member functions + RealType lambda() const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); + operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, const param_type &); - friend bool operator==(const param_type &, const param_type &); - friend bool operator!=(const param_type &, const param_type &); + operator>>(std::basic_istream< CharT, Traits > &, const param_type &); + friend bool operator==(const param_type &, const param_type &); + friend bool operator!=(const param_type &, const param_type &); };
                                                                    -

                                                                    Description

                                                                    +

                                                                    Description

                                                                    -

                                                                    +

                                                                    param_type public construct/copy/destruct

                                                                    1. -
                                                                      param_type(RealType lambda = 1.0);
                                                                      +
                                                                      param_type(RealType lambda = 1.0);

                                                                      Constructs parameters with a given lambda.

                                                                      Requires: lambda > 0

                                                                    -

                                                                    -param_type public member functions

                                                                    +

                                                                    +param_type public member functions

                                                                    1. -
                                                                      RealType lambda() const;
                                                                      +
                                                                      RealType lambda() const;

                                                                      Returns the lambda parameter of the distribution.

                                                                    -

                                                                    -param_type friend functions

                                                                    +

                                                                    +param_type friend functions

                                                                    1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const param_type & param);

                                                                      Writes the parameters to a std::ostream. 

                                                                    2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
              const param_type & param);

                                                                      Reads the parameters from a std::istream.

                                                                    3. -
                                                                      friend bool operator==(const param_type & lhs, const param_type & rhs);
                                                                      +
                                                                      friend bool operator==(const param_type & lhs, const param_type & rhs);

                                                                      Returns true if the two sets of parameters are equal.

                                                                    4. -
                                                                      friend bool operator!=(const param_type & lhs, const param_type & rhs);
                                                                      +
                                                                      friend bool operator!=(const param_type & lhs, const param_type & rhs);

                                                                      Returns true if the two sets of parameters are different.

                                                                    @@ -116,7 +116,7 @@
                                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                                    diff --git a/doc/html/boost/random/extreme_value_distribution.html b/doc/html/boost/random/extreme_value_distribution.html index 41603ee94c..1992de340e 100644 --- a/doc/html/boost/random/extreme_value_distribution.html +++ b/doc/html/boost/random/extreme_value_distribution.html @@ -47,142 +47,142 @@ typedef extreme_value_distribution distribution_type; // construct/copy/destruct - explicit param_type(RealType = 1.0, RealType = 1.0); + explicit param_type(RealType = 1.0, RealType = 1.0); - // public member functions - RealType a() const; - RealType b() const; + // public member functions + RealType a() const; + RealType b() const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); + operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, const param_type &); - friend bool operator==(const param_type &, const param_type &); - friend bool operator!=(const param_type &, const param_type &); + operator>>(std::basic_istream< CharT, Traits > &, const param_type &); + friend bool operator==(const param_type &, const param_type &); + friend bool operator!=(const param_type &, const param_type &); }; // construct/copy/destruct - explicit extreme_value_distribution(RealType = 1.0, RealType = 1.0); - explicit extreme_value_distribution(const param_type &); + explicit extreme_value_distribution(RealType = 1.0, RealType = 1.0); + explicit extreme_value_distribution(const param_type &); - // public member functions - template<typename URNG> RealType operator()(URNG &) const; + // public member functions + template<typename URNG> RealType operator()(URNG &) const; template<typename URNG> - RealType operator()(URNG &, const param_type &) const; - RealType a() const; - RealType b() const; - RealType min() const; - RealType max() const; - param_type param() const; - void param(const param_type &); - void reset(); + RealType operator()(URNG &, const param_type &) const; + RealType a() const; + RealType b() const; + RealType min() const; + RealType max() const; + param_type param() const; + void param(const param_type &); + void reset(); - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, + operator<<(std::basic_ostream< CharT, Traits > &, const extreme_value_distribution &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, + operator>>(std::basic_istream< CharT, Traits > &, const extreme_value_distribution &); - friend bool operator==(const extreme_value_distribution &, + friend bool operator==(const extreme_value_distribution &, const extreme_value_distribution &); - friend bool operator!=(const extreme_value_distribution &, + friend bool operator!=(const extreme_value_distribution &, const extreme_value_distribution &); };
                                                                    -

                                                                    Description

                                                                    +

                                                                    Description

                                                                    The extreme value distribution is a real valued distribution with two parameters a and b.

                                                                    It has .

                                                                    -

                                                                    +

                                                                    extreme_value_distribution public construct/copy/destruct

                                                                    1. -
                                                                      explicit extreme_value_distribution(RealType a = 1.0, RealType b = 1.0);
                                                                      +
                                                                      explicit extreme_value_distribution(RealType a = 1.0, RealType b = 1.0);

                                                                      Constructs an extreme_value_distribution from its "a" and "b" parameters.

                                                                      Requires: b > 0

                                                                    2. -
                                                                      explicit extreme_value_distribution(const param_type & param);
                                                                      +
                                                                      explicit extreme_value_distribution(const param_type & param);

                                                                      Constructs an extreme_value_distribution from its parameters.

                                                                    -

                                                                    -extreme_value_distribution public member functions

                                                                    +

                                                                    +extreme_value_distribution public member functions

                                                                    1. -
                                                                      template<typename URNG> RealType operator()(URNG & urng) const;
                                                                      +
                                                                      template<typename URNG> RealType operator()(URNG & urng) const;

                                                                      Returns a random variate distributed according to the extreme_value_distribution. 

                                                                    2. template<typename URNG> 
-  RealType operator()(URNG & urng, const param_type & param) const;
                                                                      + RealType operator()(URNG & urng, const param_type & param) const;

                                                                      Returns a random variate distributed accordint to the extreme value distribution with parameters specified by param.

                                                                    3. -
                                                                      RealType a() const;
                                                                      +
                                                                      RealType a() const;

                                                                      Returns the "a" parameter of the distribution.

                                                                    4. -
                                                                      RealType b() const;
                                                                      +
                                                                      RealType b() const;

                                                                      Returns the "b" parameter of the distribution.

                                                                    5. -
                                                                      RealType min() const;
                                                                      +
                                                                      RealType min() const;

                                                                      Returns the smallest value that the distribution can produce.

                                                                    6. -
                                                                      RealType max() const;
                                                                      +
                                                                      RealType max() const;

                                                                      Returns the largest value that the distribution can produce.

                                                                    7. -
                                                                      param_type param() const;
                                                                      +
                                                                      param_type param() const;

                                                                      Returns the parameters of the distribution.

                                                                    8. -
                                                                      void param(const param_type & param);
                                                                      +
                                                                      void param(const param_type & param);

                                                                      Sets the parameters of the distribution.

                                                                    9. -
                                                                      void reset();
                                                                      +
                                                                      void reset();

                                                                      Effects: Subsequent uses of the distribution do not depend on values produced by any engine prior to invoking reset.

                                                                    -

                                                                    -extreme_value_distribution friend functions

                                                                    +

                                                                    +extreme_value_distribution friend functions

                                                                    1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const extreme_value_distribution & wd);

                                                                      Writes an extreme_value_distribution to a std::ostream. 

                                                                    2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
              const extreme_value_distribution & wd);

                                                                      Reads an extreme_value_distribution from a std::istream.

                                                                    3. -
                                                                      friend bool operator==(const extreme_value_distribution & lhs, 
+
                                                                      friend bool operator==(const extreme_value_distribution & lhs, 
                        const extreme_value_distribution & rhs);
                                                                      
 
                                                                      Returns true if the two instances of extreme_value_distribution will return identical sequences of values given equal generators.
                                                                    4. -
                                                                      friend bool operator!=(const extreme_value_distribution & lhs, 
+
                                                                      friend bool operator!=(const extreme_value_distribution & lhs, 
                        const extreme_value_distribution & rhs);
                                                                      
 
                                                                      Returns true if the two instances of extreme_value_distribution will return different sequences of values given equal generators.
                                                                      5. diff --git a/doc/html/boost/random/extreme_value_distribution/param_type.html b/doc/html/boost/random/extreme_value_distribution/param_type.html index 47bfc2bbe8..ba87b1666f 100644 --- a/doc/html/boost/random/extreme_value_distribution/param_type.html +++ b/doc/html/boost/random/extreme_value_distribution/param_type.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                                                      -PrevUpHomeNext +PrevUpHomeNext
                                                                      @@ -40,73 +40,73 @@ typedef extreme_value_distribution distribution_type; // construct/copy/destruct - explicit param_type(RealType = 1.0, RealType = 1.0); + explicit param_type(RealType = 1.0, RealType = 1.0); - // public member functions - RealType a() const; - RealType b() const; + // public member functions + RealType a() const; + RealType b() const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); + operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, const param_type &); - friend bool operator==(const param_type &, const param_type &); - friend bool operator!=(const param_type &, const param_type &); + operator>>(std::basic_istream< CharT, Traits > &, const param_type &); + friend bool operator==(const param_type &, const param_type &); + friend bool operator!=(const param_type &, const param_type &); };
                                                                      -

                                                                      Description

                                                                      +

                                                                      Description

                                                                      -

                                                                      +

                                                                      param_type public construct/copy/destruct

                                                                      1. -
                                                                        explicit param_type(RealType a = 1.0, RealType b = 1.0);
                                                                        +
                                                                        explicit param_type(RealType a = 1.0, RealType b = 1.0);

                                                                        Constructs a param_type from the "a" and "b" parameters of the distribution.

                                                                        Requires: b > 0

                                                                      -

                                                                      -param_type public member functions

                                                                      +

                                                                      +param_type public member functions

                                                                      1. -
                                                                        RealType a() const;
                                                                        +
                                                                        RealType a() const;

                                                                        Returns the "a" parameter of the distribtuion.

                                                                      2. -
                                                                        RealType b() const;
                                                                        +
                                                                        RealType b() const;

                                                                        Returns the "b" parameter of the distribution.

                                                                      -

                                                                      -param_type friend functions

                                                                      +

                                                                      +param_type friend functions

                                                                      1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const param_type & param);

                                                                        Writes a param_type to a std::ostream. 

                                                                      2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
              const param_type & param);

                                                                        Reads a param_type from a std::istream.

                                                                      3. -
                                                                        friend bool operator==(const param_type & lhs, const param_type & rhs);
                                                                        +
                                                                        friend bool operator==(const param_type & lhs, const param_type & rhs);

                                                                        Returns true if the two sets of parameters are the same.

                                                                      4. -
                                                                        friend bool operator!=(const param_type & lhs, const param_type & rhs);
                                                                        +
                                                                        friend bool operator!=(const param_type & lhs, const param_type & rhs);

                                                                        Returns true if the two sets of parameters are the different.

                                                                      @@ -123,7 +123,7 @@
                                                                      -PrevUpHomeNext +PrevUpHomeNext
                                                                      diff --git a/doc/html/boost/random/fisher_f_distribution.html b/doc/html/boost/random/fisher_f_distribution.html index bdde3870a1..fffe3c9833 100644 --- a/doc/html/boost/random/fisher_f_distribution.html +++ b/doc/html/boost/random/fisher_f_distribution.html @@ -47,142 +47,142 @@ typedef fisher_f_distribution distribution_type; // construct/copy/destruct - explicit param_type(RealType = 1.0, RealType = 1.0); + explicit param_type(RealType = 1.0, RealType = 1.0); - // public member functions - RealType m() const; - RealType n() const; + // public member functions + RealType m() const; + RealType n() const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); + operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, const param_type &); - friend bool operator==(const param_type &, const param_type &); - friend bool operator!=(const param_type &, const param_type &); + operator>>(std::basic_istream< CharT, Traits > &, const param_type &); + friend bool operator==(const param_type &, const param_type &); + friend bool operator!=(const param_type &, const param_type &); }; // construct/copy/destruct - explicit fisher_f_distribution(RealType = 1.0, RealType = 1.0); - explicit fisher_f_distribution(const param_type &); + explicit fisher_f_distribution(RealType = 1.0, RealType = 1.0); + explicit fisher_f_distribution(const param_type &); - // public member functions - template<typename URNG> RealType operator()(URNG &); + // public member functions + template<typename URNG> RealType operator()(URNG &); template<typename URNG> - RealType operator()(URNG &, const param_type &) const; - RealType m() const; - RealType n() const; - RealType min() const; - RealType max() const; - param_type param() const; - void param(const param_type &); - void reset(); + RealType operator()(URNG &, const param_type &) const; + RealType m() const; + RealType n() const; + RealType min() const; + RealType max() const; + param_type param() const; + void param(const param_type &); + void reset(); - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, + operator<<(std::basic_ostream< CharT, Traits > &, const fisher_f_distribution &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, + operator>>(std::basic_istream< CharT, Traits > &, const fisher_f_distribution &); - friend bool operator==(const fisher_f_distribution &, + friend bool operator==(const fisher_f_distribution &, const fisher_f_distribution &); - friend bool operator!=(const fisher_f_distribution &, + friend bool operator!=(const fisher_f_distribution &, const fisher_f_distribution &); };
                                                                      -

                                                                      Description

                                                                      +

                                                                      Description

                                                                      The Fisher F distribution is a real valued distribution with two parameters m and n.

                                                                      It has .

                                                                      -

                                                                      +

                                                                      fisher_f_distribution public construct/copy/destruct

                                                                      1. -
                                                                        explicit fisher_f_distribution(RealType m = 1.0, RealType n = 1.0);
                                                                        +
                                                                        explicit fisher_f_distribution(RealType m = 1.0, RealType n = 1.0);

                                                                        Constructs a fisher_f_distribution from its "m" and "n" parameters.

                                                                        Requires: m > 0 and n > 0

                                                                      2. -
                                                                        explicit fisher_f_distribution(const param_type & param);
                                                                        +
                                                                        explicit fisher_f_distribution(const param_type & param);

                                                                        Constructs an fisher_f_distribution from its parameters.

                                                                      -

                                                                      -fisher_f_distribution public member functions

                                                                      +

                                                                      +fisher_f_distribution public member functions

                                                                      1. -
                                                                        template<typename URNG> RealType operator()(URNG & urng);
                                                                        +
                                                                        template<typename URNG> RealType operator()(URNG & urng);

                                                                        Returns a random variate distributed according to the F distribution. 

                                                                      2. template<typename URNG> 
-  RealType operator()(URNG & urng, const param_type & param) const;
                                                                        + RealType operator()(URNG & urng, const param_type & param) const;

                                                                        Returns a random variate distributed according to the F distribution with parameters specified by param.

                                                                      3. -
                                                                        RealType m() const;
                                                                        +
                                                                        RealType m() const;

                                                                        Returns the "m" parameter of the distribution.

                                                                      4. -
                                                                        RealType n() const;
                                                                        +
                                                                        RealType n() const;

                                                                        Returns the "n" parameter of the distribution.

                                                                      5. -
                                                                        RealType min() const;
                                                                        +
                                                                        RealType min() const;

                                                                        Returns the smallest value that the distribution can produce.

                                                                      6. -
                                                                        RealType max() const;
                                                                        +
                                                                        RealType max() const;

                                                                        Returns the largest value that the distribution can produce.

                                                                      7. -
                                                                        param_type param() const;
                                                                        +
                                                                        param_type param() const;

                                                                        Returns the parameters of the distribution.

                                                                      8. -
                                                                        void param(const param_type & param);
                                                                        +
                                                                        void param(const param_type & param);

                                                                        Sets the parameters of the distribution.

                                                                      9. -
                                                                        void reset();
                                                                        +
                                                                        void reset();

                                                                        Effects: Subsequent uses of the distribution do not depend on values produced by any engine prior to invoking reset.

                                                                      -

                                                                      -fisher_f_distribution friend functions

                                                                      +

                                                                      +fisher_f_distribution friend functions

                                                                      1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const fisher_f_distribution & fd);

                                                                        Writes an fisher_f_distribution to a std::ostream. 

                                                                      2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
              const fisher_f_distribution & fd);

                                                                        Reads an fisher_f_distribution from a std::istream.

                                                                      3. -
                                                                        friend bool operator==(const fisher_f_distribution & lhs, 
+
                                                                        friend bool operator==(const fisher_f_distribution & lhs, 
                        const fisher_f_distribution & rhs);
                                                                        
 
                                                                        Returns true if the two instances of fisher_f_distribution will return identical sequences of values given equal generators.
                                                                      4. -
                                                                        friend bool operator!=(const fisher_f_distribution & lhs, 
+
                                                                        friend bool operator!=(const fisher_f_distribution & lhs, 
                        const fisher_f_distribution & rhs);
                                                                        
 
                                                                        Returns true if the two instances of fisher_f_distribution will return different sequences of values given equal generators.
                                                                        5. diff --git a/doc/html/boost/random/fisher_f_distribution/param_type.html b/doc/html/boost/random/fisher_f_distribution/param_type.html index faca896649..9e70459699 100644 --- a/doc/html/boost/random/fisher_f_distribution/param_type.html +++ b/doc/html/boost/random/fisher_f_distribution/param_type.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                        @@ -40,73 +40,73 @@ typedef fisher_f_distribution distribution_type; // construct/copy/destruct - explicit param_type(RealType = 1.0, RealType = 1.0); + explicit param_type(RealType = 1.0, RealType = 1.0); - // public member functions - RealType m() const; - RealType n() const; + // public member functions + RealType m() const; + RealType n() const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); + operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, const param_type &); - friend bool operator==(const param_type &, const param_type &); - friend bool operator!=(const param_type &, const param_type &); + operator>>(std::basic_istream< CharT, Traits > &, const param_type &); + friend bool operator==(const param_type &, const param_type &); + friend bool operator!=(const param_type &, const param_type &); };
                                                                        -

                                                                        Description

                                                                        +

                                                                        Description

                                                                        -

                                                                        +

                                                                        param_type public construct/copy/destruct

                                                                        1. -
                                                                          explicit param_type(RealType m = 1.0, RealType n = 1.0);
                                                                          +
                                                                          explicit param_type(RealType m = 1.0, RealType n = 1.0);

                                                                          Constructs a param_type from the "m" and "n" parameters of the distribution.

                                                                          Requires: m > 0 and n > 0

                                                                        -

                                                                        -param_type public member functions

                                                                        +

                                                                        +param_type public member functions

                                                                        1. -
                                                                          RealType m() const;
                                                                          +
                                                                          RealType m() const;

                                                                          Returns the "m" parameter of the distribtuion.

                                                                        2. -
                                                                          RealType n() const;
                                                                          +
                                                                          RealType n() const;

                                                                          Returns the "n" parameter of the distribution.

                                                                        -

                                                                        -param_type friend functions

                                                                        +

                                                                        +param_type friend functions

                                                                        1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const param_type & param);

                                                                          Writes a param_type to a std::ostream. 

                                                                        2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
              const param_type & param);

                                                                          Reads a param_type from a std::istream.

                                                                        3. -
                                                                          friend bool operator==(const param_type & lhs, const param_type & rhs);
                                                                          +
                                                                          friend bool operator==(const param_type & lhs, const param_type & rhs);

                                                                          Returns true if the two sets of parameters are the same.

                                                                        4. -
                                                                          friend bool operator!=(const param_type & lhs, const param_type & rhs);
                                                                          +
                                                                          friend bool operator!=(const param_type & lhs, const param_type & rhs);

                                                                          Returns true if the two sets of parameters are the different.

                                                                        @@ -123,7 +123,7 @@
                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                        diff --git a/doc/html/boost/random/gamma_distribution.html b/doc/html/boost/random/gamma_distribution.html index 3b1b5c503f..3aba31c4c2 100644 --- a/doc/html/boost/random/gamma_distribution.html +++ b/doc/html/boost/random/gamma_distribution.html @@ -47,137 +47,137 @@ typedef gamma_distribution distribution_type; // construct/copy/destruct - param_type(const RealType & = 1.0, const RealType & = 1.0); + param_type(const RealType & = 1.0, const RealType & = 1.0); - // public member functions - RealType alpha() const; - RealType beta() const; + // public member functions + RealType alpha() const; + RealType beta() const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); + operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, param_type &); - friend bool operator==(const param_type &, const param_type &); - friend bool operator!=(const param_type &, const param_type &); + operator>>(std::basic_istream< CharT, Traits > &, param_type &); + friend bool operator==(const param_type &, const param_type &); + friend bool operator!=(const param_type &, const param_type &); }; // construct/copy/destruct - explicit gamma_distribution(const result_type & = 1.0, + explicit gamma_distribution(const result_type & = 1.0, const result_type & = 1.0); - explicit gamma_distribution(const param_type &); + explicit gamma_distribution(const param_type &); - // public member functions - RealType alpha() const; - RealType beta() const; - RealType min() const; - RealType max() const; - param_type param() const; - void param(const param_type &); - void reset(); - template<typename Engine> result_type operator()(Engine &); + // public member functions + RealType alpha() const; + RealType beta() const; + RealType min() const; + RealType max() const; + param_type param() const; + void param(const param_type &); + void reset(); + template<typename Engine> result_type operator()(Engine &); template<typename URNG> - RealType operator()(URNG &, const param_type &) const; + RealType operator()(URNG &, const param_type &) const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, + operator<<(std::basic_ostream< CharT, Traits > &, const gamma_distribution &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, gamma_distribution &); - friend bool operator==(const gamma_distribution &, + operator>>(std::basic_istream< CharT, Traits > &, gamma_distribution &); + friend bool operator==(const gamma_distribution &, const gamma_distribution &); - friend bool operator!=(const gamma_distribution &, + friend bool operator!=(const gamma_distribution &, const gamma_distribution &); };
                                                                        -

                                                                        Description

                                                                        +

                                                                        Description

                                                                        The gamma distribution is a continuous distribution with two parameters alpha and beta. It produces values > 0.

                                                                        It has .

                                                                        -

                                                                        +

                                                                        gamma_distribution public construct/copy/destruct

                                                                        1. -
                                                                          explicit gamma_distribution(const result_type & alpha = 1.0, 
+
                                                                          explicit gamma_distribution(const result_type & alpha = 1.0, 
                             const result_type & beta = 1.0);
                                                                          
 
                                                                          Creates a new gamma_distribution with parameters "alpha" and "beta".
                                                                          
 
                                                                          Requires: alpha > 0 && beta > 0
                                                                        2. -
                                                                          explicit gamma_distribution(const param_type & param);
                                                                          +
                                                                          explicit gamma_distribution(const param_type & param);

                                                                          Constructs a gamma_distribution from its parameters.

                                                                        -

                                                                        -gamma_distribution public member functions

                                                                        +

                                                                        +gamma_distribution public member functions

                                                                        1. -
                                                                          RealType alpha() const;
                                                                          +
                                                                          RealType alpha() const;

                                                                          Returns the "alpha" paramter of the distribution.

                                                                        2. -
                                                                          RealType beta() const;
                                                                          +
                                                                          RealType beta() const;

                                                                          Returns the "beta" parameter of the distribution.

                                                                        3. -
                                                                          RealType min() const;
                                                                          +
                                                                          RealType min() const;

                                                                          Returns the smallest value that the distribution can produce.

                                                                          4. -
                                                                        4. RealType max() const;
                                                                          5. +
                                                                        5. RealType max() const;
                                                                        6. -
                                                                          param_type param() const;
                                                                          +
                                                                          param_type param() const;

                                                                          Returns the parameters of the distribution.

                                                                        7. -
                                                                          void param(const param_type & param);
                                                                          +
                                                                          void param(const param_type & param);

                                                                          Sets the parameters of the distribution.

                                                                        8. -
                                                                          void reset();
                                                                          +
                                                                          void reset();

                                                                          Effects: Subsequent uses of the distribution do not depend on values produced by any engine prior to invoking reset.

                                                                        9. -
                                                                          template<typename Engine> result_type operator()(Engine & eng);
                                                                          +
                                                                          template<typename Engine> result_type operator()(Engine & eng);

                                                                          Returns a random variate distributed according to the gamma distribution. 

                                                                        10. template<typename URNG> 
-  RealType operator()(URNG & urng, const param_type & param) const;
                                                                          11. + RealType operator()(URNG & urng, const param_type & param) const;
                                                                        -

                                                                        -gamma_distribution friend functions

                                                                        +

                                                                        +gamma_distribution friend functions

                                                                        1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const gamma_distribution & gd);

                                                                          Writes a gamma_distribution to a std::ostream. 

                                                                        2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
              gamma_distribution & gd);

                                                                          Reads a gamma_distribution from a std::istream.

                                                                        3. -
                                                                          friend bool operator==(const gamma_distribution & lhs, 
+
                                                                          friend bool operator==(const gamma_distribution & lhs, 
                        const gamma_distribution & rhs);
                                                                          
 
                                                                          Returns true if the two distributions will produce identical sequences of random variates given equal generators.
                                                                        4. -
                                                                          friend bool operator!=(const gamma_distribution & lhs, 
+
                                                                          friend bool operator!=(const gamma_distribution & lhs, 
                        const gamma_distribution & rhs);
                                                                          
 
                                                                          Returns true if the two distributions can produce different sequences of random variates, given equal generators.
                                                                          5. diff --git a/doc/html/boost/random/gamma_distribution/param_type.html b/doc/html/boost/random/gamma_distribution/param_type.html index 13308ae368..061f52ba8b 100644 --- a/doc/html/boost/random/gamma_distribution/param_type.html +++ b/doc/html/boost/random/gamma_distribution/param_type.html @@ -6,9 +6,9 @@ - + - + @@ -21,7 +21,7 @@
                                                                          -PrevUpHomeNext +PrevUpHomeNext
                                                                          @@ -40,72 +40,72 @@ typedef gamma_distribution distribution_type; // construct/copy/destruct - param_type(const RealType & = 1.0, const RealType & = 1.0); + param_type(const RealType & = 1.0, const RealType & = 1.0); - // public member functions - RealType alpha() const; - RealType beta() const; + // public member functions + RealType alpha() const; + RealType beta() const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); + operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, param_type &); - friend bool operator==(const param_type &, const param_type &); - friend bool operator!=(const param_type &, const param_type &); + operator>>(std::basic_istream< CharT, Traits > &, param_type &); + friend bool operator==(const param_type &, const param_type &); + friend bool operator!=(const param_type &, const param_type &); };
                                                                          -

                                                                          Description

                                                                          +

                                                                          Description

                                                                          -

                                                                          +

                                                                          param_type public construct/copy/destruct

                                                                          1. -
                                                                            param_type(const RealType & alpha = 1.0, const RealType & beta = 1.0);
                                                                            +
                                                                            param_type(const RealType & alpha = 1.0, const RealType & beta = 1.0);

                                                                            Constructs a param_type object from the "alpha" and "beta" parameters.

                                                                            Requires: alpha > 0 && beta > 0

                                                                          -

                                                                          -param_type public member functions

                                                                          +

                                                                          +param_type public member functions

                                                                          1. -
                                                                            RealType alpha() const;
                                                                            +
                                                                            RealType alpha() const;

                                                                            Returns the "alpha" parameter of the distribution.

                                                                          2. -
                                                                            RealType beta() const;
                                                                            +
                                                                            RealType beta() const;

                                                                            Returns the "beta" parameter of the distribution.

                                                                          -

                                                                          -param_type friend functions

                                                                          +

                                                                          +param_type friend functions

                                                                          1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const param_type & param);

                                                                            Writes the parameters to a std::ostream. 

                                                                          2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, param_type & param);
                                                                            + operator>>(std::basic_istream< CharT, Traits > & is, param_type & param);

                                                                            Reads the parameters from a std::istream.

                                                                          3. -
                                                                            friend bool operator==(const param_type & lhs, const param_type & rhs);
                                                                            +
                                                                            friend bool operator==(const param_type & lhs, const param_type & rhs);

                                                                            Returns true if the two sets of parameters are the same.

                                                                          4. -
                                                                            friend bool operator!=(const param_type & lhs, const param_type & rhs);
                                                                            +
                                                                            friend bool operator!=(const param_type & lhs, const param_type & rhs);

                                                                            Returns true if the two sets fo parameters are different.

                                                                          @@ -122,7 +122,7 @@
                                                                          -PrevUpHomeNext +PrevUpHomeNext
                                                                          diff --git a/doc/html/boost/random/generate_canonical.html b/doc/html/boost/random/generate_canonical.html new file mode 100644 index 0000000000..4d294d1058 --- /dev/null +++ b/doc/html/boost/random/generate_canonical.html @@ -0,0 +1,56 @@ + + + + +Function template generate_canonical + + + + + + + + + + + + + + + +
                                                                          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                          +
                                                                          +
                                                                          +PrevUpHomeNext +
                                                                          +
                                                                          +
                                                                          +
                                                                          +

                                                                          Function template generate_canonical

                                                                          +

                                                                          boost::random::generate_canonical

                                                                          +
                                                                          +

                                                                          Synopsis

                                                                          +
                                                                          // In header: <boost/random/generate_canonical.hpp>
+
+
+template<typename RealType, std::size_t bits, typename URNG> 
+  RealType generate_canonical(URNG & g);
                                                                          +
                                                                          +

                                                                          Description

                                                                          +

                                                                          Returns a value uniformly distributed in the range [0, 1) with at least bits random bits.

                                                                          +
                                                                          +
                                                                          + + + +
                                                                          Copyright © 2000-2005 Jens Maurer
                                                                          Copyright © 2009, 2010 Steven Watanabe

                                                                          + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                          +
                                                                          +
                                                                          +
                                                                          +PrevUpHomeNext +
                                                                          + + diff --git a/doc/html/boost/random/geometric_distribution.html b/doc/html/boost/random/geometric_distribution.html index 7563a5e8ba..39c7c8ede9 100644 --- a/doc/html/boost/random/geometric_distribution.html +++ b/doc/html/boost/random/geometric_distribution.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                                                                          -PrevUpHomeNext +PrevUpHomeNext
                                                                          @@ -47,53 +47,53 @@ typedef geometric_distribution distribution_type; // construct/copy/destruct - explicit param_type(RealType = 0.5); + explicit param_type(RealType = 0.5); - // public member functions - RealType p() const; + // public member functions + RealType p() const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); + operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, const param_type &); - friend bool operator==(const param_type &, const param_type &); - friend bool operator!=(const param_type &, const param_type &); + operator>>(std::basic_istream< CharT, Traits > &, const param_type &); + friend bool operator==(const param_type &, const param_type &); + friend bool operator!=(const param_type &, const param_type &); }; // construct/copy/destruct - explicit geometric_distribution(const RealType & = 0.5); - explicit geometric_distribution(const param_type &); + explicit geometric_distribution(const RealType & = 0.5); + explicit geometric_distribution(const param_type &); - // public member functions - RealType p() const; - IntType min() const; - IntType max() const; - param_type param() const; - void param(const param_type &); - void reset(); - template<typename Engine> result_type operator()(Engine &) const; + // public member functions + RealType p() const; + IntType min() const; + IntType max() const; + param_type param() const; + void param(const param_type &); + void reset(); + template<typename Engine> result_type operator()(Engine &) const; template<typename Engine> - result_type operator()(Engine &, const param_type &) const; + result_type operator()(Engine &, const param_type &) const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, + operator<<(std::basic_ostream< CharT, Traits > &, const geometric_distribution &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, + operator>>(std::basic_istream< CharT, Traits > &, const geometric_distribution &); - friend bool operator==(const geometric_distribution &, + friend bool operator==(const geometric_distribution &, const geometric_distribution &); - friend bool operator!=(const geometric_distribution &, + friend bool operator!=(const geometric_distribution &, const geometric_distribution &); };
                                                                          -

                                                                          Description

                                                                          +

                                                                          Description

                                                                          An instantiation of the class template geometric_distribution models a random distribution . The distribution produces positive integers which are the number of bernoulli trials with probability p required to get one that fails.

                                                                          For the geometric distribution, .

                                                                          @@ -106,86 +106,86 @@

                                                                          -

                                                                          +

                                                                          geometric_distribution public construct/copy/destruct

                                                                          1. -
                                                                            explicit geometric_distribution(const RealType & p = 0.5);
                                                                            +
                                                                            explicit geometric_distribution(const RealType & p = 0.5);

                                                                            Contructs a new geometric_distribution with the paramter p.

                                                                            Requires: 0 < p < 1

                                                                          2. -
                                                                            explicit geometric_distribution(const param_type & param);
                                                                            +
                                                                            explicit geometric_distribution(const param_type & param);

                                                                            Constructs a new geometric_distribution from its parameters.

                                                                          -

                                                                          -geometric_distribution public member functions

                                                                          +

                                                                          +geometric_distribution public member functions

                                                                          1. -
                                                                            RealType p() const;
                                                                            +
                                                                            RealType p() const;

                                                                            Returns: the distribution parameter p

                                                                          2. -
                                                                            IntType min() const;
                                                                            +
                                                                            IntType min() const;

                                                                            Returns the smallest value that the distribution can produce.

                                                                          3. -
                                                                            IntType max() const;
                                                                            +
                                                                            IntType max() const;

                                                                            Returns the largest value that the distribution can produce.

                                                                          4. -
                                                                            param_type param() const;
                                                                            +
                                                                            param_type param() const;

                                                                            Returns the parameters of the distribution.

                                                                          5. -
                                                                            void param(const param_type & param);
                                                                            +
                                                                            void param(const param_type & param);

                                                                            Sets the parameters of the distribution.

                                                                          6. -
                                                                            void reset();
                                                                            +
                                                                            void reset();

                                                                            Effects: Subsequent uses of the distribution do not depend on values produced by any engine prior to invoking reset.

                                                                          7. -
                                                                            template<typename Engine> result_type operator()(Engine & eng) const;
                                                                            +
                                                                            template<typename Engine> result_type operator()(Engine & eng) const;

                                                                            Returns a random variate distributed according to the geometric_distribution. 

                                                                          8. template<typename Engine> 
-  result_type operator()(Engine & eng, const param_type & param) const;
                                                                            + result_type operator()(Engine & eng, const param_type & param) const;

                                                                            Returns a random variate distributed according to the geometric distribution with parameters specified by param.

                                                                          -

                                                                          -geometric_distribution friend functions

                                                                          +

                                                                          +geometric_distribution friend functions

                                                                          1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const geometric_distribution & gd);

                                                                            Writes the distribution to a std::ostream. 

                                                                          2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
              const geometric_distribution & gd);

                                                                            Reads the distribution from a std::istream.

                                                                          3. -
                                                                            friend bool operator==(const geometric_distribution & lhs, 
+
                                                                            friend bool operator==(const geometric_distribution & lhs, 
                        const geometric_distribution & rhs);
                                                                            
 
                                                                            Returns true if the two distributions will produce identical sequences of values given equal generators.
                                                                          4. -
                                                                            friend bool operator!=(const geometric_distribution & lhs, 
+
                                                                            friend bool operator!=(const geometric_distribution & lhs, 
                        const geometric_distribution & rhs);
                                                                            
 
                                                                            Returns true if the two distributions may produce different sequences of values given equal generators.
                                                                            5. @@ -203,7 +203,7 @@
                                                                            -PrevUpHomeNext +PrevUpHomeNext
                                                                            diff --git a/doc/html/boost/random/geometric_distribution/param_type.html b/doc/html/boost/random/geometric_distribution/param_type.html index 2e6356e48d..f4301756d8 100644 --- a/doc/html/boost/random/geometric_distribution/param_type.html +++ b/doc/html/boost/random/geometric_distribution/param_type.html @@ -6,9 +6,9 @@ - + - + @@ -21,7 +21,7 @@
                                                                            -PrevUpHomeNext +PrevUpHomeNext
                                                                            @@ -40,65 +40,65 @@ typedef geometric_distribution distribution_type; // construct/copy/destruct - explicit param_type(RealType = 0.5); + explicit param_type(RealType = 0.5); - // public member functions - RealType p() const; + // public member functions + RealType p() const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); + operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, const param_type &); - friend bool operator==(const param_type &, const param_type &); - friend bool operator!=(const param_type &, const param_type &); + operator>>(std::basic_istream< CharT, Traits > &, const param_type &); + friend bool operator==(const param_type &, const param_type &); + friend bool operator!=(const param_type &, const param_type &); };
                                                                            -

                                                                            Description

                                                                            +

                                                                            Description

                                                                            -

                                                                            +

                                                                            param_type public construct/copy/destruct

                                                                            1. -
                                                                              explicit param_type(RealType p = 0.5);
                                                                              +
                                                                              explicit param_type(RealType p = 0.5);

                                                                              Constructs the parameters with p.

                                                                            -

                                                                            -param_type public member functions

                                                                            +

                                                                            +param_type public member functions

                                                                            1. -
                                                                              RealType p() const;
                                                                              +
                                                                              RealType p() const;

                                                                              Returns the p parameter of the distribution.

                                                                            -

                                                                            -param_type friend functions

                                                                            +

                                                                            +param_type friend functions

                                                                            1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const param_type & param);

                                                                              Writes the parameters to a std::ostream. 

                                                                            2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
              const param_type & param);

                                                                              Reads the parameters from a std::istream.

                                                                            3. -
                                                                              friend bool operator==(const param_type & lhs, const param_type & rhs);
                                                                              +
                                                                              friend bool operator==(const param_type & lhs, const param_type & rhs);

                                                                              Returns true if the two sets of parameters are equal.

                                                                            4. -
                                                                              friend bool operator!=(const param_type & lhs, const param_type & rhs);
                                                                              +
                                                                              friend bool operator!=(const param_type & lhs, const param_type & rhs);

                                                                              Returns true if the two sets of parameters are different.

                                                                            @@ -115,7 +115,7 @@
                                                                            -PrevUpHomeNext +PrevUpHomeNext
                                                                            diff --git a/doc/html/boost/random/hellekalek1995.html b/doc/html/boost/random/hellekalek1995.html index bb2774d1e5..3f29784ba8 100644 --- a/doc/html/boost/random/hellekalek1995.html +++ b/doc/html/boost/random/hellekalek1995.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                                                                            -PrevUpHomeNext +PrevUpHomeNext
                                                                            @@ -33,9 +33,9 @@ 
                                                                            // In header: <boost/random/inversive_congruential.hpp>
 
 
-typedef inversive_congruential_engine< uint32_t, 9102, 2147483647-36884165, 2147483647 > hellekalek1995;
                                                                            +typedef inversive_congruential_engine< uint32_t, 9102, 2147483647-36884165, 2147483647 > hellekalek1995;
                                                                            -

                                                                            Description

                                                                            +

                                                                            Description

                                                                            The specialization hellekalek1995 was suggested in

                                                                            "Inversive pseudorandom number generators: concepts, results and links", Peter Hellekalek, In: "Proceedings of the 1995 Winter Simulation @@ -53,7 +53,7 @@

                                                                            -PrevUpHomeNext +PrevUpHomeNext
                                                                            diff --git a/doc/html/boost/random/hyperexp_idm45507086672304.html b/doc/html/boost/random/hyperexp_idm45507086672304.html new file mode 100644 index 0000000000..a06aa82e8a --- /dev/null +++ b/doc/html/boost/random/hyperexp_idm45507086672304.html @@ -0,0 +1,690 @@ + + + + +Class template hyperexponential_distribution + + + + + + + + + + + + + + + +
                                                                            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                            +
                                                                            +
                                                                            +PrevUpHomeNext +
                                                                            +
                                                                            +
                                                                            +
                                                                            +

                                                                            Class template hyperexponential_distribution

                                                                            +

                                                                            boost::random::hyperexponential_distribution

                                                                            +
                                                                            +

                                                                            Synopsis

                                                                            +
                                                                            // In header: <boost/random/hyperexponential_distribution.hpp>
+
+template<typename RealT = double> 
+class hyperexponential_distribution {
+public:
+  // types
+  typedef RealT result_type;
+  typedef RealT input_type; 
+
+  // member classes/structs/unions
+
+  class param_type {
+  public:
+    // types
+    typedef hyperexponential_distribution distribution_type;
+
+    // construct/copy/destruct
+    param_type();
+    template<typename ProbIterT, typename RateIterT> 
+      param_type(ProbIterT, ProbIterT, RateIterT, RateIterT);
+    template<typename ProbRangeT, typename RateRangeT> 
+      param_type(ProbRangeT const &, RateRangeT const &, 
+                 typename boost::disable_if_c< boost::has_pre_increment< ProbRangeT >::value||boost::has_pre_increment< RateRangeT >::value >::type * = 0);
+    template<typename RateIterT> 
+      param_type(RateIterT, RateIterT, 
+                 typename boost::enable_if_c< boost::has_pre_increment< RateIterT >::value >::type * = 0);
+    template<typename RateRangeT> param_type(RateRangeT const &);
+    param_type(std::initializer_list< RealT >, std::initializer_list< RealT >);
+    param_type(std::initializer_list< RealT >);
+
+    // public member functions
+    std::vector< RealT > probabilities() const;
+    std::vector< RealT > rates() const;
+
+    // friend functions
+    template<typename CharT, typename Traits> 
+      friend std::basic_ostream< CharT, Traits > & 
+      operator<<(std::basic_ostream< CharT, Traits > &, const param_type &);
+    template<typename CharT, typename Traits> 
+      friend std::basic_istream< CharT, Traits > & 
+      operator>>(std::basic_istream< CharT, Traits > &, const param_type &);
+    friend bool operator==(const param_type &, const param_type &);
+    friend bool operator!=(const param_type &, const param_type &);
+  };
+
+  // construct/copy/destruct
+  hyperexponential_distribution();
+  template<typename ProbIterT, typename RateIterT> 
+    hyperexponential_distribution(ProbIterT, ProbIterT, RateIterT, RateIterT);
+  template<typename ProbRangeT, typename RateRangeT> 
+    hyperexponential_distribution(ProbRangeT const &, RateRangeT const &, 
+                                  typename boost::disable_if_c< boost::has_pre_increment< ProbRangeT >::value||boost::has_pre_increment< RateRangeT >::value >::type * = 0);
+  template<typename RateIterT> 
+    hyperexponential_distribution(RateIterT, RateIterT, 
+                                  typename boost::enable_if_c< boost::has_pre_increment< RateIterT >::value >::type * = 0);
+  template<typename RateRangeT> 
+    hyperexponential_distribution(RateRangeT const &);
+  explicit hyperexponential_distribution(param_type const &);
+  hyperexponential_distribution(std::initializer_list< RealT > const &, 
+                                std::initializer_list< RealT > const &);
+  hyperexponential_distribution(std::initializer_list< RealT > const &);
+
+  // public member functions
+  template<typename URNG> RealT operator()(URNG &) const;
+  template<typename URNG> RealT operator()(URNG &, const param_type &) const;
+  std::size_t num_phases() const;
+  std::vector< RealT > probabilities() const;
+  std::vector< RealT > rates() const;
+  RealT min() const;
+  RealT max() const;
+  param_type param() const;
+  void param(param_type const &);
+  void reset();
+
+  // friend functions
+  template<typename CharT, typename Traits> 
+    friend std::basic_ostream< CharT, Traits > & 
+    operator<<(std::basic_ostream< CharT, Traits > &, 
+               const hyperexponential_distribution &);
+  template<typename CharT, typename Traits> 
+    friend std::basic_istream< CharT, Traits > & 
+    operator>>(std::basic_istream< CharT, Traits > &, 
+               const hyperexponential_distribution &);
+  friend bool operator==(const hyperexponential_distribution &, 
+                         const hyperexponential_distribution &);
+  friend bool operator!=(const hyperexponential_distribution &, 
+                         const hyperexponential_distribution &);
+};
                                                                            +
                                                                            +

                                                                            Description

                                                                            +

                                                                            The hyperexponential distribution is a real-valued continuous distribution with two parameters, the phase probability vector probs and the rate vector rates.

                                                                            +

                                                                            A -phase hyperexponential distribution is a mixture of exponential distributions. For this reason, it is also referred to as mixed exponential distribution or parallel -phase exponential distribution.

                                                                            +

                                                                            A -phase hyperexponential distribution is characterized by two parameters, namely a phase probability vector and a rate vector .

                                                                            +

                                                                            A -phase hyperexponential distribution is frequently used in queueing theory to model the distribution of the superposition of independent events, like, for instance, the service time distribution of a queueing station with servers in parallel where the -th server is chosen with probability and its service time distribution is an exponential distribution with rate (Allen,1990; Papadopolous et al.,1993; Trivedi,2002).

                                                                            +

                                                                            For instance, CPUs service-time distribution in a computing system has often been observed to possess such a distribution (Rosin,1965). Also, the arrival of different types of customer to a single queueing station is often modeled as a hyperexponential distribution (Papadopolous et al.,1993). Similarly, if a product manufactured in several parallel assemply lines and the outputs are merged, the failure density of the overall product is likely to be hyperexponential (Trivedi,2002).

                                                                            +

                                                                            Finally, since the hyperexponential distribution exhibits a high Coefficient of Variation (CoV), that is a CoV > 1, it is especially suited to fit empirical data with large CoV (Feitelson,2014; Wolski et al.,2013) and to approximate long-tail probability distributions (Feldmann et al.,1998).

                                                                            +

                                                                            See (Boost,2014) for more information and examples.

                                                                            +

                                                                            A -phase hyperexponential distribution has a probability density function

                                                                            +
                                                                            +

                                                                            Equation 25.1. 

                                                                            +
                                                                            +
                                                                            +


                                                                            where:

                                                                            +
                                                                              +

                                                                            • is the number of phases and also the size of the input vector parameters,

                                                                              • +

                                                                            • is the phase probability vector parameter, and

                                                                              • +

                                                                            • is the rate vector parameter.

                                                                              • +
                                                                            +

                                                                            +Given a -phase hyperexponential distribution with phase probability vector and rate vector , the random variate generation algorithm consists of the following steps (Tyszer,1999):

                                                                            +
                                                                              +

                                                                            1. Generate a random variable uniformly distribution on the interval .

                                                                              2. +

                                                                            2. Use to select the appropriate (e.g., the alias method can possibly be used for this step).

                                                                              3. +

                                                                            3. Generate an exponentially distributed random variable with rate parameter .

                                                                              4. +

                                                                            4. Return .

                                                                              5. +
                                                                            +

                                                                            +References:

                                                                            +
                                                                              +

                                                                            1. A.O. Allen, Probability, Statistics, and Queuing Theory with Computer Science Applications, Second Edition, Academic Press, 1990.

                                                                              2. +

                                                                            2. Boost C++ Libraries, Boost.Math / Statistical Distributions: Hyperexponential Distribution, Online: http://www.boost.org/doc/libs/release/libs/math/doc/html/dist.html , 2014.

                                                                              3. +

                                                                            3. D.G. Feitelson, Workload Modeling for Computer Systems Performance Evaluation, Cambridge University Press, 2014

                                                                              4. +

                                                                            4. A. Feldmann and W. Whitt, Fitting mixtures of exponentials to long-tail distributions to analyze network performance models, Performance Evaluation 31(3-4):245, doi:10.1016/S0166-5316(97)00003-5, 1998.

                                                                              5. +

                                                                            5. H.T. Papadopolous, C. Heavey and J. Browne, Queueing Theory in Manufacturing Systems Analysis and Design, Chapman & Hall/CRC, 1993, p. 35.

                                                                              6. +

                                                                            6. R.F. Rosin, Determining a computing center environment, Communications of the ACM 8(7):463-468, 1965.

                                                                              7. +

                                                                            7. K.S. Trivedi, Probability and Statistics with Reliability, Queueing, and Computer Science Applications, John Wiley & Sons, Inc., 2002.

                                                                              8. +

                                                                            8. J. Tyszer, Object-Oriented Computer Simulation of Discrete-Event Systems, Springer, 1999.

                                                                              9. +

                                                                            9. Wikipedia, Hyperexponential Distribution, Online: http://en.wikipedia.org/wiki/Hyperexponential_distribution , 2014.

                                                                              10. +

                                                                            10. Wolfram Mathematica, Hyperexponential Distribution, Online: http://reference.wolfram.com/language/ref/HyperexponentialDistribution.html , 2014.

                                                                              11. +
                                                                            +

                                                                            +

                                                                            +

                                                                            Marco Guazzone (marco.guazzone@gmail.com)

                                                                            +

                                                                            +

                                                                            +
                                                                            +

                                                                            +hyperexponential_distribution + public + construct/copy/destruct

                                                                            +
                                                                              +
                                                                            1. +
                                                                              hyperexponential_distribution();
                                                                              +

                                                                              Constructs a 1-phase hyperexponential_distribution (i.e., an exponential distribution) with rate 1.

                                                                              +
                                                                              2. +
                                                                            2. +
                                                                              template<typename ProbIterT, typename RateIterT> 
+  hyperexponential_distribution(ProbIterT prob_first, ProbIterT prob_last, 
+                                RateIterT rate_first, RateIterT rate_last);
                                                                              +

                                                                              Constructs a hyperexponential_distribution from the phase probability vector and rate vector parameters of the distribution.

                                                                              +

                                                                              The phase probability vector parameter is given by the range defined by [prob_first, prob_last) iterator pair, and the rate vector parameter is given by the range defined by [rate_first, rate_last) iterator pair.

                                                                              +

                                                                              + +References:

                                                                              +

                                                                              1. ISO, ISO/IEC 14882-2014: Information technology - Programming languages - C++, 2014

                                                                              +

                                                                              +

                                                                              +
                                                                              ++++ + + + + + + + + + + +

                                                                              Parameters:

                                                                              ++++ + + + + + + + + + + + + + + + + + + +

                                                                              prob_first

                                                                              The iterator to the beginning of the range of non-negative real elements representing the phase probabilities; if elements don't sum to 1, they are normalized.

                                                                              prob_last

                                                                              The iterator to the ending of the range of non-negative real elements representing the phase probabilities; if elements don't sum to 1, they are normalized.

                                                                              rate_first

                                                                              The iterator to the beginning of the range of non-negative real elements representing the rates.

                                                                              rate_last

                                                                              The iterator to the ending of the range of non-negative real elements representing the rates.

                                                                              Template Parameters:

                                                                              ++++ + + + + + + + + + + +

                                                                              ProbIterT

                                                                              Must meet the requirements of InputIterator concept (ISO,2014,sec. 24.2.3 [input.iterators]).

                                                                              RateIterT

                                                                              Must meet the requirements of InputIterator concept (ISO,2014,sec. 24.2.3 [input.iterators]).

                                                                              +
                                                                              3. +
                                                                            3. +
                                                                              template<typename ProbRangeT, typename RateRangeT> 
+  hyperexponential_distribution(ProbRangeT const & prob_range, 
+                                RateRangeT const & rate_range, 
+                                typename boost::disable_if_c< boost::has_pre_increment< ProbRangeT >::value||boost::has_pre_increment< RateRangeT >::value >::type * = 0);
                                                                              +

                                                                              Constructs a hyperexponential_distribution from the phase probability vector and rate vector parameters of the distribution.

                                                                              +

                                                                              The phase probability vector parameter is given by the range defined by prob_range, and the rate vector parameter is given by the range defined by rate_range.

                                                                              +

                                                                              + +

                                                                              +
                                                                              + + + + + +
                                                                              [Note]Note

                                                                              The final disable_if parameter is an implementation detail that differentiates between this two argument constructor and the iterator-based two argument constructor described below.

                                                                              +

                                                                              +

                                                                              +
                                                                              ++++ + + + + + + + + + + +

                                                                              Parameters:

                                                                              ++++ + + + + + + + + + + +

                                                                              prob_range

                                                                              The range of non-negative real elements representing the phase probabilities; if elements don't sum to 1, they are normalized.

                                                                              rate_range

                                                                              The range of positive real elements representing the rates.

                                                                              Template Parameters:

                                                                              ++++ + + + + + + + + + + +

                                                                              ProbRangeT

                                                                              Must meet the requirements of Range concept.

                                                                              RateRangeT

                                                                              Must meet the requirements of Range concept.

                                                                              +
                                                                              4. +
                                                                            4. +
                                                                              template<typename RateIterT> 
+  hyperexponential_distribution(RateIterT rate_first, RateIterT rate_last, 
+                                typename boost::enable_if_c< boost::has_pre_increment< RateIterT >::value >::type * = 0);
                                                                              +

                                                                              Constructs a hyperexponential_distribution from the rate vector parameter of the distribution and with equal phase probabilities.

                                                                              +

                                                                              The rate vector parameter is given by the range defined by [rate_first, rate_last) iterator pair, and the phase probability vector parameter is set to the equal phase probabilities (i.e., to a vector of the same length of the rate vector and with each element set to ).

                                                                              +

                                                                              + +

                                                                              +
                                                                              + + + + + +
                                                                              [Note]Note

                                                                              The final disable_if parameter is an implementation detail that differentiates between this two argument constructor and the range-based two argument constructor described above.

                                                                              +

                                                                              +References:

                                                                              +

                                                                              1. ISO, ISO/IEC 14882-2014: Information technology - Programming languages - C++, 2014

                                                                              +

                                                                              +

                                                                              +
                                                                              ++++ + + + + + + + + + + +

                                                                              Parameters:

                                                                              ++++ + + + + + + + + + + +

                                                                              rate_first

                                                                              The iterator to the beginning of the range of non-negative real elements representing the rates.

                                                                              rate_last

                                                                              The iterator to the ending of the range of non-negative real elements representing the rates.

                                                                              Template Parameters:

                                                                              ++++ + + + + +

                                                                              RateIterT

                                                                              Must meet the requirements of InputIterator concept (ISO,2014,sec. 24.2.3 [input.iterators]).

                                                                              +
                                                                              5. +
                                                                            5. +
                                                                              template<typename RateRangeT> 
+  hyperexponential_distribution(RateRangeT const & rate_range);
                                                                              +

                                                                              Constructs a param_type from the "rates" parameters of the distribution and with equal phase probabilities.

                                                                              +

                                                                              The rate vector parameter is given by the range defined by rate_range, and the phase probability vector parameter is set to the equal phase probabilities (i.e., to a vector of the same length of the rate vector and with each element set to ).

                                                                              +

                                                                              + +

                                                                              +
                                                                              ++++ + + + + + + + + + + +

                                                                              Parameters:

                                                                              ++++ + + + + +

                                                                              rate_range

                                                                              The range of positive real elements representing the rates.

                                                                              Template Parameters:

                                                                              ++++ + + + + +

                                                                              RateRangeT

                                                                              Must meet the requirements of Range concept.

                                                                              +
                                                                              6. +
                                                                            6. +
                                                                              explicit hyperexponential_distribution(param_type const & param);
                                                                              +

                                                                              Constructs a hyperexponential_distribution from its parameters.

                                                                              +

                                                                              +

                                                                              +
                                                                              ++++ + + + + +

                                                                              Parameters:

                                                                              ++++ + + + + +

                                                                              param

                                                                              The parameters of the distribution.

                                                                              +
                                                                              7. +
                                                                            7. +
                                                                              hyperexponential_distribution(std::initializer_list< RealT > const & l1, 
+                              std::initializer_list< RealT > const & l2);
                                                                              +

                                                                              Constructs a hyperexponential_distribution from the phase probability vector and rate vector parameters of the distribution.

                                                                              +

                                                                              The phase probability vector parameter is given by the brace-init-list (ISO,2014,sec. 8.5.4 [dcl.init.list]) defined by l1, and the rate vector parameter is given by the brace-init-list (ISO,2014,sec. 8.5.4 [dcl.init.list]) defined by l2.

                                                                              +

                                                                              +References:

                                                                              +

                                                                              1. ISO, ISO/IEC 14882-2014: Information technology - Programming languages - C++, 2014

                                                                              +

                                                                              +

                                                                              +
                                                                              ++++ + + + + +

                                                                              Parameters:

                                                                              ++++ + + + + + + + + + + +

                                                                              l1

                                                                              The initializer list for inizializing the phase probability vector.

                                                                              l2

                                                                              The initializer list for inizializing the rate vector.

                                                                              +
                                                                              8. +
                                                                            8. +
                                                                              hyperexponential_distribution(std::initializer_list< RealT > const & l1);
                                                                              +

                                                                              Constructs a hyperexponential_distribution from the rate vector parameter of the distribution and with equal phase probabilities.

                                                                              +

                                                                              The rate vector parameter is given by the brace-init-list (ISO,2014,sec. 8.5.4 [dcl.init.list]) defined by l1, and the phase probability vector parameter is set to the equal phase probabilities (i.e., to a vector of the same length of the rate vector and with each element set to ).

                                                                              +

                                                                              +References:

                                                                              +

                                                                              1. ISO, ISO/IEC 14882-2014: Information technology - Programming languages - C++, 2014

                                                                              +

                                                                              +

                                                                              +
                                                                              ++++ + + + + +

                                                                              Parameters:

                                                                              ++++ + + + + +

                                                                              l1

                                                                              The initializer list for inizializing the rate vector.

                                                                              +
                                                                              9. +
                                                                            +
                                                                            +
                                                                            +

                                                                            +hyperexponential_distribution public member functions

                                                                            +
                                                                              +
                                                                            1. +
                                                                              template<typename URNG> RealT operator()(URNG & urng) const;
                                                                              +

                                                                              Gets a random variate distributed according to the hyperexponential distribution.

                                                                              +

                                                                              + + +

                                                                              +
                                                                              ++++ + + + + + + + + + + + + + + +

                                                                              Parameters:

                                                                              ++++ + + + + +

                                                                              urng

                                                                              A uniform random number generator object.

                                                                              Template Parameters:

                                                                              ++++ + + + + +

                                                                              URNG

                                                                              Must meet the requirements of uniform random number generator .

                                                                              Returns:

                                                                              A random variate distributed according to the hyperexponential distribution.

                                                                              +
                                                                              2. +
                                                                            2. +
                                                                              template<typename URNG> 
+  RealT operator()(URNG & urng, const param_type & param) const;
                                                                              +

                                                                              Gets a random variate distributed according to the hyperexponential distribution with parameters specified by param.

                                                                              +

                                                                              + + +

                                                                              +
                                                                              ++++ + + + + + + + + + + + + + + +

                                                                              Parameters:

                                                                              ++++ + + + + + + + + + + +

                                                                              param

                                                                              A distribution parameter object.

                                                                              urng

                                                                              A uniform random number generator object.

                                                                              Template Parameters:

                                                                              ++++ + + + + +

                                                                              URNG

                                                                              Must meet the requirements of uniform random number generator .

                                                                              Returns:

                                                                              A random variate distributed according to the hyperexponential distribution. distribution with parameters specified by param.

                                                                              +
                                                                              3. +
                                                                            3. +
                                                                              std::size_t num_phases() const;
                                                                              +

                                                                              Returns the number of phases of the distribution.

                                                                              +
                                                                              4. +
                                                                            4. +
                                                                              std::vector< RealT > probabilities() const;
                                                                              +

                                                                              Returns the phase probability vector parameter of the distribution.

                                                                              +
                                                                              5. +
                                                                            5. +
                                                                              std::vector< RealT > rates() const;
                                                                              +

                                                                              Returns the rate vector parameter of the distribution.

                                                                              +
                                                                              6. +
                                                                            6. +
                                                                              RealT min() const;
                                                                              +

                                                                              Returns the smallest value that the distribution can produce.

                                                                              +
                                                                              7. +
                                                                            7. +
                                                                              RealT max() const;
                                                                              +

                                                                              Returns the largest value that the distribution can produce.

                                                                              +
                                                                              8. +
                                                                            8. +
                                                                              param_type param() const;
                                                                              +

                                                                              Returns the parameters of the distribution.

                                                                              +
                                                                              9. +
                                                                            9. +
                                                                              void param(param_type const & param);
                                                                              +

                                                                              Sets the parameters of the distribution.

                                                                              +
                                                                              10. +
                                                                            10. +
                                                                              void reset();
                                                                              +

                                                                              Effects: Subsequent uses of the distribution do not depend on values produced by any engine prior to invoking reset.

                                                                              +
                                                                              11. +
                                                                            +
                                                                            +
                                                                            +

                                                                            +hyperexponential_distribution friend functions

                                                                            +
                                                                              +
                                                                            1. +
                                                                              template<typename CharT, typename Traits> 
+  friend std::basic_ostream< CharT, Traits > & 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
+             const hyperexponential_distribution & hd);
                                                                              +

                                                                              Writes an hyperexponential_distribution to a std::ostream.

                                                                              +
                                                                              2. +
                                                                            2. +
                                                                              template<typename CharT, typename Traits> 
+  friend std::basic_istream< CharT, Traits > & 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
+             const hyperexponential_distribution & hd);
                                                                              +

                                                                              Reads an hyperexponential_distribution from a std::istream.

                                                                              +
                                                                              3. +
                                                                            3. +
                                                                              friend bool operator==(const hyperexponential_distribution & lhs, 
+                       const hyperexponential_distribution & rhs);
                                                                              +

                                                                              Returns true if the two instances of hyperexponential_distribution will return identical sequences of values given equal generators.

                                                                              +
                                                                              4. +
                                                                            4. +
                                                                              friend bool operator!=(const hyperexponential_distribution & lhs, 
+                       const hyperexponential_distribution & rhs);
                                                                              +

                                                                              Returns true if the two instances of hyperexponential_distribution will return different sequences of values given equal generators.

                                                                              +
                                                                              5. +
                                                                            +
                                                                            +
                                                                            +
                                                                            + + + +
                                                                            Copyright © 2000-2005 Jens Maurer
                                                                            Copyright © 2009, 2010 Steven Watanabe

                                                                            + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                            +
                                                                            +
                                                                            +
                                                                            +PrevUpHomeNext +
                                                                            + + diff --git a/doc/html/boost/random/hyperexp_idm45507086672304/param_type.html b/doc/html/boost/random/hyperexp_idm45507086672304/param_type.html new file mode 100644 index 0000000000..c5162caeac --- /dev/null +++ b/doc/html/boost/random/hyperexp_idm45507086672304/param_type.html @@ -0,0 +1,480 @@ + + + + +Class param_type + + + + + + + + + + + + + + + +
                                                                            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                            +
                                                                            +
                                                                            +PrevUpHomeNext +
                                                                            +
                                                                            +
                                                                            +
                                                                            +

                                                                            Class param_type

                                                                            +

                                                                            boost::random::hyperexponential_distribution::param_type

                                                                            +
                                                                            +

                                                                            Synopsis

                                                                            +
                                                                            // In header: <boost/random/hyperexponential_distribution.hpp>
+
+
+
+class param_type {
+public:
+  // types
+  typedef hyperexponential_distribution distribution_type;
+
+  // construct/copy/destruct
+  param_type();
+  template<typename ProbIterT, typename RateIterT> 
+    param_type(ProbIterT, ProbIterT, RateIterT, RateIterT);
+  template<typename ProbRangeT, typename RateRangeT> 
+    param_type(ProbRangeT const &, RateRangeT const &, 
+               typename boost::disable_if_c< boost::has_pre_increment< ProbRangeT >::value||boost::has_pre_increment< RateRangeT >::value >::type * = 0);
+  template<typename RateIterT> 
+    param_type(RateIterT, RateIterT, 
+               typename boost::enable_if_c< boost::has_pre_increment< RateIterT >::value >::type * = 0);
+  template<typename RateRangeT> param_type(RateRangeT const &);
+  param_type(std::initializer_list< RealT >, std::initializer_list< RealT >);
+  param_type(std::initializer_list< RealT >);
+
+  // public member functions
+  std::vector< RealT > probabilities() const;
+  std::vector< RealT > rates() const;
+
+  // friend functions
+  template<typename CharT, typename Traits> 
+    friend std::basic_ostream< CharT, Traits > & 
+    operator<<(std::basic_ostream< CharT, Traits > &, const param_type &);
+  template<typename CharT, typename Traits> 
+    friend std::basic_istream< CharT, Traits > & 
+    operator>>(std::basic_istream< CharT, Traits > &, const param_type &);
+  friend bool operator==(const param_type &, const param_type &);
+  friend bool operator!=(const param_type &, const param_type &);
+};
                                                                            +
                                                                            +

                                                                            Description

                                                                            +

                                                                            The parameters of a hyperexponential distribution.

                                                                            +

                                                                            Stores the phase probability vector and the rate vector of the hyperexponential distribution.

                                                                            +

                                                                            Marco Guazzone (marco.guazzone@gmail.com)

                                                                            +

                                                                            +

                                                                            +
                                                                            +

                                                                            +param_type + public + construct/copy/destruct

                                                                            +
                                                                              +
                                                                            1. +
                                                                              param_type();
                                                                              +

                                                                              Constructs a param_type with the default parameters of the distribution.

                                                                              +
                                                                              2. +
                                                                            2. +
                                                                              template<typename ProbIterT, typename RateIterT> 
+  param_type(ProbIterT prob_first, ProbIterT prob_last, RateIterT rate_first, 
+             RateIterT rate_last);
                                                                              +

                                                                              Constructs a param_type from the phase probability vector and rate vector parameters of the distribution.

                                                                              +

                                                                              The phase probability vector parameter is given by the range defined by [prob_first, prob_last) iterator pair, and the rate vector parameter is given by the range defined by [rate_first, rate_last) iterator pair.

                                                                              +

                                                                              + +References:

                                                                              +

                                                                              1. ISO, ISO/IEC 14882-2014: Information technology - Programming languages - C++, 2014

                                                                              +

                                                                              +

                                                                              +
                                                                              ++++ + + + + + + + + + + +

                                                                              Parameters:

                                                                              ++++ + + + + + + + + + + + + + + + + + + +

                                                                              prob_first

                                                                              The iterator to the beginning of the range of non-negative real elements representing the phase probabilities; if elements don't sum to 1, they are normalized.

                                                                              prob_last

                                                                              The iterator to the ending of the range of non-negative real elements representing the phase probabilities; if elements don't sum to 1, they are normalized.

                                                                              rate_first

                                                                              The iterator to the beginning of the range of non-negative real elements representing the rates.

                                                                              rate_last

                                                                              The iterator to the ending of the range of non-negative real elements representing the rates.

                                                                              Template Parameters:

                                                                              ++++ + + + + + + + + + + +

                                                                              ProbIterT

                                                                              Must meet the requirements of InputIterator concept (ISO,2014,sec. 24.2.3 [input.iterators]).

                                                                              RateIterT

                                                                              Must meet the requirements of InputIterator concept (ISO,2014,sec. 24.2.3 [input.iterators]).

                                                                              +
                                                                              3. +
                                                                            3. +
                                                                              template<typename ProbRangeT, typename RateRangeT> 
+  param_type(ProbRangeT const & prob_range, RateRangeT const & rate_range, 
+             typename boost::disable_if_c< boost::has_pre_increment< ProbRangeT >::value||boost::has_pre_increment< RateRangeT >::value >::type * = 0);
                                                                              +

                                                                              Constructs a param_type from the phase probability vector and rate vector parameters of the distribution.

                                                                              +

                                                                              The phase probability vector parameter is given by the range defined by prob_range, and the rate vector parameter is given by the range defined by rate_range.

                                                                              +

                                                                              + +

                                                                              +
                                                                              + + + + + +
                                                                              [Note]Note

                                                                              The final disable_if parameter is an implementation detail that differentiates between this two argument constructor and the iterator-based two argument constructor described below.

                                                                              +

                                                                              +

                                                                              +
                                                                              ++++ + + + + + + + + + + +

                                                                              Parameters:

                                                                              ++++ + + + + + + + + + + +

                                                                              prob_range

                                                                              The range of non-negative real elements representing the phase probabilities; if elements don't sum to 1, they are normalized.

                                                                              rate_range

                                                                              The range of positive real elements representing the rates.

                                                                              Template Parameters:

                                                                              ++++ + + + + + + + + + + +

                                                                              ProbRangeT

                                                                              Must meet the requirements of Range concept.

                                                                              RateRangeT

                                                                              Must meet the requirements of Range concept.

                                                                              +
                                                                              4. +
                                                                            4. +
                                                                              template<typename RateIterT> 
+  param_type(RateIterT rate_first, RateIterT rate_last, 
+             typename boost::enable_if_c< boost::has_pre_increment< RateIterT >::value >::type * = 0);
                                                                              +

                                                                              Constructs a param_type from the rate vector parameter of the distribution and with equal phase probabilities.

                                                                              +

                                                                              The rate vector parameter is given by the range defined by [rate_first, rate_last) iterator pair, and the phase probability vector parameter is set to the equal phase probabilities (i.e., to a vector of the same length of the rate vector and with each element set to ).

                                                                              +

                                                                              + +

                                                                              +
                                                                              + + + + + +
                                                                              [Note]Note

                                                                              The final disable_if parameter is an implementation detail that differentiates between this two argument constructor and the range-based two argument constructor described above.

                                                                              +

                                                                              +References:

                                                                              +

                                                                              1. ISO, ISO/IEC 14882-2014: Information technology - Programming languages - C++, 2014

                                                                              +

                                                                              +

                                                                              +
                                                                              ++++ + + + + + + + + + + +

                                                                              Parameters:

                                                                              ++++ + + + + + + + + + + +

                                                                              rate_first

                                                                              The iterator to the beginning of the range of non-negative real elements representing the rates.

                                                                              rate_last

                                                                              The iterator to the ending of the range of non-negative real elements representing the rates.

                                                                              Template Parameters:

                                                                              ++++ + + + + +

                                                                              RateIterT

                                                                              Must meet the requirements of InputIterator concept (ISO,2014,sec. 24.2.3 [input.iterators]).

                                                                              +
                                                                              5. +
                                                                            5. +
                                                                              template<typename RateRangeT> param_type(RateRangeT const & rate_range);
                                                                              +

                                                                              Constructs a param_type from the "rates" parameters of the distribution and with equal phase probabilities.

                                                                              +

                                                                              The rate vector parameter is given by the range defined by rate_range, and the phase probability vector parameter is set to the equal phase probabilities (i.e., to a vector of the same length of the rate vector and with each element set to ).

                                                                              +

                                                                              + +

                                                                              +
                                                                              ++++ + + + + + + + + + + +

                                                                              Parameters:

                                                                              ++++ + + + + +

                                                                              rate_range

                                                                              The range of positive real elements representing the rates.

                                                                              Template Parameters:

                                                                              ++++ + + + + +

                                                                              RateRangeT

                                                                              Must meet the requirements of Range concept.

                                                                              +
                                                                              6. +
                                                                            6. +
                                                                              param_type(std::initializer_list< RealT > l1, 
+           std::initializer_list< RealT > l2);
                                                                              +

                                                                              Constructs a param_type from the phase probability vector and rate vector parameters of the distribution.

                                                                              +

                                                                              The phase probability vector parameter is given by the brace-init-list (ISO,2014,sec. 8.5.4 [dcl.init.list]) defined by l1, and the rate vector parameter is given by the brace-init-list (ISO,2014,sec. 8.5.4 [dcl.init.list]) defined by l2.

                                                                              +

                                                                              +References:

                                                                              +

                                                                              1. ISO, ISO/IEC 14882-2014: Information technology - Programming languages - C++, 2014

                                                                              +

                                                                              +

                                                                              +
                                                                              ++++ + + + + +

                                                                              Parameters:

                                                                              ++++ + + + + + + + + + + +

                                                                              l1

                                                                              The initializer list for inizializing the phase probability vector.

                                                                              l2

                                                                              The initializer list for inizializing the rate vector.

                                                                              +
                                                                              7. +
                                                                            7. +
                                                                              param_type(std::initializer_list< RealT > l1);
                                                                              +

                                                                              Constructs a param_type from the rate vector parameter of the distribution and with equal phase probabilities.

                                                                              +

                                                                              The rate vector parameter is given by the brace-init-list (ISO,2014,sec. 8.5.4 [dcl.init.list]) defined by l1, and the phase probability vector parameter is set to the equal phase probabilities (i.e., to a vector of the same length of the rate vector and with each element set to ).

                                                                              +

                                                                              +References:

                                                                              +

                                                                              1. ISO, ISO/IEC 14882-2014: Information technology - Programming languages - C++, 2014

                                                                              +

                                                                              +

                                                                              +
                                                                              ++++ + + + + +

                                                                              Parameters:

                                                                              ++++ + + + + +

                                                                              l1

                                                                              The initializer list for inizializing the rate vector.

                                                                              +
                                                                              8. +
                                                                            +
                                                                            +
                                                                            +

                                                                            +param_type public member functions

                                                                            +
                                                                              +
                                                                            1. +
                                                                              std::vector< RealT > probabilities() const;
                                                                              +

                                                                              Gets the phase probability vector parameter of the distribtuion.

                                                                              +

                                                                              +

                                                                              +
                                                                              + + + + + +
                                                                              [Note]Note

                                                                              The returned probabilities are the normalized version of the ones passed at construction time.

                                                                              +

                                                                              +

                                                                              +
                                                                              ++++ + + + + +

                                                                              Returns:

                                                                              The phase probability vector parameter of the distribution.

                                                                              +
                                                                              2. +
                                                                            2. +
                                                                              std::vector< RealT > rates() const;
                                                                              +

                                                                              Gets the rate vector parameter of the distribtuion.

                                                                              +

                                                                              +

                                                                              +
                                                                              ++++ + + + + +

                                                                              Returns:

                                                                              The rate vector parameter of the distribution.

                                                                              +
                                                                              3. +
                                                                            +
                                                                            +
                                                                            +

                                                                            +param_type friend functions

                                                                            +
                                                                              +
                                                                            1. +
                                                                              template<typename CharT, typename Traits> 
+  friend std::basic_ostream< CharT, Traits > & 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
+             const param_type & param);
                                                                              +

                                                                              Writes a param_type to a std::ostream.

                                                                              +
                                                                              2. +
                                                                            2. +
                                                                              template<typename CharT, typename Traits> 
+  friend std::basic_istream< CharT, Traits > & 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
+             const param_type & param);
                                                                              +

                                                                              Reads a param_type from a std::istream.

                                                                              +
                                                                              3. +
                                                                            3. +
                                                                              friend bool operator==(const param_type & lhs, const param_type & rhs);
                                                                              +

                                                                              Returns true if the two sets of parameters are the same.

                                                                              +
                                                                              4. +
                                                                            4. +
                                                                              friend bool operator!=(const param_type & lhs, const param_type & rhs);
                                                                              +

                                                                              Returns true if the two sets of parameters are the different.

                                                                              +
                                                                              5. +
                                                                            +
                                                                            +
                                                                            +
                                                                            + + + +
                                                                            Copyright © 2000-2005 Jens Maurer
                                                                            Copyright © 2009, 2010 Steven Watanabe

                                                                            + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                            +
                                                                            +
                                                                            +
                                                                            +PrevUpHomeNext +
                                                                            + + diff --git a/doc/html/boost/random/independent_bits_engine.html b/doc/html/boost/random/independent_bits_engine.html index 0681a6b4ae..d30d4415d8 100644 --- a/doc/html/boost/random/independent_bits_engine.html +++ b/doc/html/boost/random/independent_bits_engine.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
                                                                            -PrevUpHomeNext +PrevUpHomeNext
                                                                            @@ -36,75 +36,76 @@ class independent_bits_engine { public: // types - typedef Engine base_type; - typedef UIntType result_type; + typedef Engine base_type; + typedef UIntType result_type; + typedef Engine::result_type base_result_type; // construct/copy/destruct - independent_bits_engine(); - explicit independent_bits_engine(result_type); - template<typename SeedSeq> explicit independent_bits_engine(SeedSeq &); - independent_bits_engine(const base_type &); - template<typename It> independent_bits_engine(It &, It); + independent_bits_engine(); + explicit independent_bits_engine(base_result_type); + template<typename SeedSeq> explicit independent_bits_engine(SeedSeq &); + independent_bits_engine(const base_type &); + template<typename It> independent_bits_engine(It &, It); - // public static functions - static result_type min(); - static result_type max(); + // public static functions + static result_type min(); + static result_type max(); - // public member functions - void seed(); - void seed(result_type); - template<typename SeedSeq> void seed(SeedSeq &); - template<typename It> void seed(It &, It); - result_type operator()(); - template<typename Iter> void generate(Iter, Iter); - void discard(boost::uintmax_t); - const base_type & base() const; + // public member functions + void seed(); + void seed(base_result_type); + template<typename SeedSeq> void seed(SeedSeq &); + template<typename It> void seed(It &, It); + result_type operator()(); + template<typename Iter> void generate(Iter, Iter); + void discard(boost::uintmax_t); + const base_type & base() const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, + operator<<(std::basic_ostream< CharT, Traits > &, const independent_bits_engine &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, + operator>>(std::basic_istream< CharT, Traits > &, const independent_bits_engine &); - friend bool operator==(const independent_bits_engine &, + friend bool operator==(const independent_bits_engine &, const independent_bits_engine &); - friend bool operator!=(const independent_bits_engine &, + friend bool operator!=(const independent_bits_engine &, const independent_bits_engine &); // public data members static const bool has_fixed_range; };
                                                                            -

                                                                            Description

                                                                            +

                                                                            Description

                                                                            An instantiation of class template independent_bits_engine model a pseudo-random number generator . It generates random numbers distributed between [0, 2^w) by combining one or more invocations of the base engine.

                                                                            Requires: 0 < w <= std::numeric_limits<UIntType>::digits

                                                                            -

                                                                            +

                                                                            independent_bits_engine public construct/copy/destruct

                                                                            1. -
                                                                              independent_bits_engine();
                                                                              +
                                                                              independent_bits_engine();

                                                                              Constructs an independent_bits_engine using the default constructor of the base generator.

                                                                            2. -
                                                                              explicit independent_bits_engine(result_type seed);
                                                                              +
                                                                              explicit independent_bits_engine(base_result_type seed);

                                                                              Constructs an independent_bits_engine, using seed as the constructor argument for both base generators.

                                                                            3. -
                                                                              template<typename SeedSeq> explicit independent_bits_engine(SeedSeq & seq);
                                                                              +
                                                                              template<typename SeedSeq> explicit independent_bits_engine(SeedSeq & seq);

                                                                              Constructs an independent_bits_engine, using seq as the constructor argument for the base generator.

                                                                            4. -
                                                                              independent_bits_engine(const base_type & base_arg);
                                                                              +
                                                                              independent_bits_engine(const base_type & base_arg);

                                                                              Constructs an independent_bits_engine by copying base.

                                                                            5. -
                                                                              template<typename It> independent_bits_engine(It & first, It last);
                                                                              +
                                                                              template<typename It> independent_bits_engine(It & first, It last);

                                                                              Contructs an independent_bits_engine with values from the range defined by the input iterators first and last. first will be modified to point to the element after the last one used.

                                                                              Throws: std::invalid_argument if the input range is too small.

                                                                              Exception Safety: Basic

                                                                              @@ -112,81 +113,81 @@
                                                                            -

                                                                            -independent_bits_engine public static functions

                                                                            +

                                                                            +independent_bits_engine public static functions

                                                                            1. -
                                                                              static result_type min();
                                                                              +
                                                                              static result_type min();

                                                                              Returns the smallest value that the generator can produce.

                                                                            2. -
                                                                              static result_type max();
                                                                              +
                                                                              static result_type max();

                                                                              Returns the largest value that the generator can produce.

                                                                            -

                                                                            -independent_bits_engine public member functions

                                                                            +

                                                                            +independent_bits_engine public member functions

                                                                            1. -
                                                                              void seed();
                                                                              +
                                                                              void seed();

                                                                              Seeds an independent_bits_engine using the default seed of the base generator.

                                                                            2. -
                                                                              void seed(result_type seed);
                                                                              +
                                                                              void seed(base_result_type seed);

                                                                              Seeds an independent_bits_engine, using seed as the seed for the base generator.

                                                                            3. -
                                                                              template<typename SeedSeq> void seed(SeedSeq & seq);
                                                                              +
                                                                              template<typename SeedSeq> void seed(SeedSeq & seq);

                                                                              Seeds an independent_bits_engine, using seq to seed the base generator.

                                                                            4. -
                                                                              template<typename It> void seed(It & first, It last);
                                                                              +
                                                                              template<typename It> void seed(It & first, It last);

                                                                              Seeds an independent_bits_engine with values from the range defined by the input iterators first and last. first will be modified to point to the element after the last one used.

                                                                              Throws: std::invalid_argument if the input range is too small.

                                                                              Exception Safety: Basic

                                                                            5. -
                                                                              result_type operator()();
                                                                              +
                                                                              result_type operator()();

                                                                              Returns the next value of the generator.

                                                                            6. -
                                                                              template<typename Iter> void generate(Iter first, Iter last);
                                                                              +
                                                                              template<typename Iter> void generate(Iter first, Iter last);

                                                                              Fills a range with random values

                                                                            7. -
                                                                              void discard(boost::uintmax_t z);
                                                                              +
                                                                              void discard(boost::uintmax_t z);

                                                                              Advances the state of the generator by z.

                                                                              8. -
                                                                            8. const base_type & base() const;
                                                                              9. +
                                                                            9. const base_type & base() const;
                                                                            -

                                                                            -independent_bits_engine friend functions

                                                                            +

                                                                            +independent_bits_engine friend functions

                                                                            1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const independent_bits_engine & r);

                                                                              Writes the textual representation if the generator to a std::ostream. The textual representation of the engine is the textual representation of the base engine. 

                                                                            2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
              const independent_bits_engine & r);

                                                                              Reads the state of an independent_bits_engine from a std::istream.

                                                                            3. -
                                                                              friend bool operator==(const independent_bits_engine & x, 
+
                                                                              friend bool operator==(const independent_bits_engine & x, 
                        const independent_bits_engine & y);
                                                                              
 
                                                                              Returns: true iff the two independent_bits_engines will produce the same sequence of values.
                                                                            4. -
                                                                              friend bool operator!=(const independent_bits_engine & lhs, 
+
                                                                              friend bool operator!=(const independent_bits_engine & lhs, 
                        const independent_bits_engine & rhs);
                                                                              
 
                                                                              Returns: true iff the two independent_bits_engines will produce different sequences of values.
                                                                              5. @@ -204,7 +205,7 @@
                                                                              -PrevUpHomeNext +PrevUpHomeNext
                                                                              diff --git a/doc/html/boost/random/inversiv_idm45507090852608.html b/doc/html/boost/random/inversiv_idm45507090852608.html new file mode 100644 index 0000000000..1e14ef41a2 --- /dev/null +++ b/doc/html/boost/random/inversiv_idm45507090852608.html @@ -0,0 +1,213 @@ + + + + +Class template inversive_congruential_engine + + + + + + + + + + + + + + + +
                                                                              Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                              +
                                                                              +
                                                                              +PrevUpHomeNext +
                                                                              +
                                                                              +
                                                                              +
                                                                              +

                                                                              Class template inversive_congruential_engine

                                                                              +

                                                                              boost::random::inversive_congruential_engine

                                                                              +
                                                                              +

                                                                              Synopsis

                                                                              +
                                                                              // In header: <boost/random/inversive_congruential.hpp>
+
+template<typename IntType, IntType a, IntType b, IntType p> 
+class inversive_congruential_engine {
+public:
+  // types
+  typedef IntType result_type;
+
+  // construct/copy/destruct
+  inversive_congruential_engine();
+  explicit inversive_congruential_engine(IntType);
+  template<typename SeedSeq> explicit inversive_congruential_engine(SeedSeq &);
+  template<typename It> inversive_congruential_engine(It &, It);
+
+  // public static functions
+  static result_type min();
+  static result_type max();
+
+  // public member functions
+  void seed();
+  void seed(IntType);
+  template<typename SeedSeq> void seed(SeedSeq &);
+  template<typename It> void seed(It &, It);
+  IntType operator()();
+  template<typename Iter> void generate(Iter, Iter);
+  void discard(boost::uintmax_t);
+
+  // friend functions
+  template<typename CharT, typename Traits> 
+    friend std::basic_ostream< CharT, Traits > & 
+    operator<<(std::basic_ostream< CharT, Traits > &, 
+               const inversive_congruential_engine &);
+  template<typename CharT, typename Traits> 
+    friend std::basic_istream< CharT, Traits > & 
+    operator>>(std::basic_istream< CharT, Traits > &, 
+               const inversive_congruential_engine &);
+  friend bool operator==(const inversive_congruential_engine &, 
+                         const inversive_congruential_engine &);
+  friend bool operator!=(const inversive_congruential_engine &, 
+                         const inversive_congruential_engine &);
+
+  // public data members
+  static const bool has_fixed_range;
+  static const result_type multiplier;
+  static const result_type increment;
+  static const result_type modulus;
+  static const IntType default_seed;
+};
                                                                              +
                                                                              +

                                                                              Description

                                                                              +

                                                                              Instantiations of class template inversive_congruential_engine model a pseudo-random number generator . It uses the inversive congruential algorithm (ICG) described in

                                                                              +

                                                                              +

                                                                              "Inversive pseudorandom number generators: concepts, results and links", Peter Hellekalek, In: "Proceedings of the 1995 Winter Simulation + Conference", C. Alexopoulos, K. Kang, W.R. Lilegdon, and D. Goldsman (editors), 1995, pp. 255-262. ftp://random.mat.sbg.ac.at/pub/data/wsc95.ps

                                                                              +

                                                                              +

                                                                              The output sequence is defined by x(n+1) = (a*inv(x(n)) - b) (mod p), where x(0), a, b, and the prime number p are parameters of the generator. The expression inv(k) denotes the multiplicative inverse of k in the field of integer numbers modulo p, with inv(0) := 0.

                                                                              +

                                                                              The template parameter IntType shall denote a signed integral type large enough to hold p; a, b, and p are the parameters of the generators. The template parameter val is the validation value checked by validation.

                                                                              +

                                                                              +
                                                                              + + + + + +
                                                                              [Note]Note

                                                                              The implementation currently uses the Euclidian Algorithm to compute the multiplicative inverse. Therefore, the inversive generators are about 10-20 times slower than the others (see section"performance"). However, the paper talks of only 3x slowdown, so the Euclidian Algorithm is probably not optimal for calculating the multiplicative inverse.

                                                                              +

                                                                              +
                                                                              +

                                                                              +inversive_congruential_engine + public + construct/copy/destruct

                                                                              +
                                                                                +
                                                                              1. +
                                                                                inversive_congruential_engine();
                                                                                +

                                                                                Constructs an inversive_congruential_engine, seeding it with the default seed.

                                                                                +
                                                                                2. +
                                                                              2. +
                                                                                explicit inversive_congruential_engine(IntType x0);
                                                                                +

                                                                                Constructs an inversive_congruential_engine, seeding it with x0.

                                                                                +
                                                                                3. +
                                                                              3. +
                                                                                template<typename SeedSeq> 
+  explicit inversive_congruential_engine(SeedSeq & seq);
                                                                                +

                                                                                Constructs an inversive_congruential_engine, seeding it with values produced by a call to seq.generate().

                                                                                +
                                                                                4. +
                                                                              4. +
                                                                                template<typename It> inversive_congruential_engine(It & first, It last);
                                                                                +

                                                                                Constructs an inversive_congruential_engine, seeds it with values taken from the itrator range [first, last), and adjusts first to point to the element after the last one used. If there are not enough elements, throws std::invalid_argument.

                                                                                +

                                                                                first and last must be input iterators.

                                                                                +
                                                                                5. +
                                                                              +
                                                                              +
                                                                              +

                                                                              +inversive_congruential_engine public static functions

                                                                              +
                                                                                +
                                                                              1. static result_type min();
                                                                                2. +
                                                                              2. static result_type max();
                                                                                3. +
                                                                              +
                                                                              +
                                                                              +

                                                                              +inversive_congruential_engine public member functions

                                                                              +
                                                                                +
                                                                              1. +
                                                                                void seed();
                                                                                +

                                                                                Calls seed(default_seed)

                                                                                +
                                                                                2. +
                                                                              2. +
                                                                                void seed(IntType x0);
                                                                                +

                                                                                If c mod m is zero and x0 mod m is zero, changes the current value of the generator to 1. Otherwise, changes it to x0 mod m. If c is zero, distinct seeds in the range [1,m) will leave the generator in distinct states. If c is not zero, the range is [0,m).

                                                                                +
                                                                                3. +
                                                                              3. +
                                                                                template<typename SeedSeq> void seed(SeedSeq & seq);
                                                                                +

                                                                                Seeds an inversive_congruential_engine using values from a SeedSeq.

                                                                                +
                                                                                4. +
                                                                              4. +
                                                                                template<typename It> void seed(It & first, It last);
                                                                                +

                                                                                seeds an inversive_congruential_engine with values taken from the itrator range [first, last) and adjusts first to point to the element after the last one used. If there are not enough elements, throws std::invalid_argument.

                                                                                +

                                                                                first and last must be input iterators.

                                                                                +
                                                                                5. +
                                                                              5. +
                                                                                IntType operator()();
                                                                                +

                                                                                Returns the next output of the generator.

                                                                                +
                                                                                6. +
                                                                              6. +
                                                                                template<typename Iter> void generate(Iter first, Iter last);
                                                                                +

                                                                                Fills a range with random values

                                                                                +
                                                                                7. +
                                                                              7. +
                                                                                void discard(boost::uintmax_t z);
                                                                                +

                                                                                Advances the state of the generator by z.

                                                                                +
                                                                                8. +
                                                                              +
                                                                              +
                                                                              +

                                                                              +inversive_congruential_engine friend functions

                                                                              +
                                                                                +
                                                                              1. +
                                                                                template<typename CharT, typename Traits> 
+  friend std::basic_ostream< CharT, Traits > & 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
+             const inversive_congruential_engine & x);
                                                                                +

                                                                                Writes the textual representation of the generator to a std::ostream.

                                                                                +
                                                                                2. +
                                                                              2. +
                                                                                template<typename CharT, typename Traits> 
+  friend std::basic_istream< CharT, Traits > & 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
+             const inversive_congruential_engine & x);
                                                                                +

                                                                                Reads the textual representation of the generator from a std::istream.

                                                                                +
                                                                                3. +
                                                                              3. +
                                                                                friend bool operator==(const inversive_congruential_engine & x, 
+                       const inversive_congruential_engine & y);
                                                                                +

                                                                                Returns true if the two generators will produce identical sequences of outputs.

                                                                                +
                                                                                4. +
                                                                              4. +
                                                                                friend bool operator!=(const inversive_congruential_engine & lhs, 
+                       const inversive_congruential_engine & rhs);
                                                                                +

                                                                                Returns true if the two generators will produce different sequences of outputs.

                                                                                +
                                                                                5. +
                                                                              +
                                                                              +
                                                                              +
                                                                              + + + +
                                                                              Copyright © 2000-2005 Jens Maurer
                                                                              Copyright © 2009, 2010 Steven Watanabe

                                                                              + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                              +
                                                                              +
                                                                              +
                                                                              +PrevUpHomeNext +
                                                                              + + diff --git a/doc/html/boost/random/inversive_con_idp161302576.html b/doc/html/boost/random/inversive_con_idp161302576.html deleted file mode 100644 index 03c60da706..0000000000 --- a/doc/html/boost/random/inversive_con_idp161302576.html +++ /dev/null @@ -1,213 +0,0 @@ - - - - -Class template inversive_congruential_engine - - - - - - - - - - - - - - - -
                                                                              Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                              -
                                                                              -
                                                                              -PrevUpHomeNext -
                                                                              -
                                                                              -
                                                                              -
                                                                              -

                                                                              Class template inversive_congruential_engine

                                                                              -

                                                                              boost::random::inversive_congruential_engine

                                                                              -
                                                                              -

                                                                              Synopsis

                                                                              -
                                                                              // In header: <boost/random/inversive_congruential.hpp>
-
-template<typename IntType, IntType a, IntType b, IntType p> 
-class inversive_congruential_engine {
-public:
-  // types
-  typedef IntType result_type;
-
-  // construct/copy/destruct
-  inversive_congruential_engine();
-  explicit inversive_congruential_engine(IntType);
-  template<typename SeedSeq> explicit inversive_congruential_engine(SeedSeq &);
-  template<typename It> inversive_congruential_engine(It &, It);
-
-  // public static functions
-  static result_type min();
-  static result_type max();
-
-  // public member functions
-  void seed();
-  void seed(IntType);
-  template<typename SeedSeq> void seed(SeedSeq &);
-  template<typename It> void seed(It &, It);
-  IntType operator()();
-  template<typename Iter> void generate(Iter, Iter);
-  void discard(boost::uintmax_t);
-
-  // friend functions
-  template<typename CharT, typename Traits> 
-    friend std::basic_ostream< CharT, Traits > & 
-    operator<<(std::basic_ostream< CharT, Traits > &, 
-               const inversive_congruential_engine &);
-  template<typename CharT, typename Traits> 
-    friend std::basic_istream< CharT, Traits > & 
-    operator>>(std::basic_istream< CharT, Traits > &, 
-               const inversive_congruential_engine &);
-  friend bool operator==(const inversive_congruential_engine &, 
-                         const inversive_congruential_engine &);
-  friend bool operator!=(const inversive_congruential_engine &, 
-                         const inversive_congruential_engine &);
-
-  // public data members
-  static const bool has_fixed_range;
-  static const result_type multiplier;
-  static const result_type increment;
-  static const result_type modulus;
-  static const IntType default_seed;
-};
                                                                              -
                                                                              -

                                                                              Description

                                                                              -

                                                                              Instantiations of class template inversive_congruential_engine model a pseudo-random number generator . It uses the inversive congruential algorithm (ICG) described in

                                                                              -

                                                                              -

                                                                              "Inversive pseudorandom number generators: concepts, results and links", Peter Hellekalek, In: "Proceedings of the 1995 Winter Simulation - Conference", C. Alexopoulos, K. Kang, W.R. Lilegdon, and D. Goldsman (editors), 1995, pp. 255-262. ftp://random.mat.sbg.ac.at/pub/data/wsc95.ps

                                                                              -

                                                                              -

                                                                              The output sequence is defined by x(n+1) = (a*inv(x(n)) - b) (mod p), where x(0), a, b, and the prime number p are parameters of the generator. The expression inv(k) denotes the multiplicative inverse of k in the field of integer numbers modulo p, with inv(0) := 0.

                                                                              -

                                                                              The template parameter IntType shall denote a signed integral type large enough to hold p; a, b, and p are the parameters of the generators. The template parameter val is the validation value checked by validation.

                                                                              -

                                                                              -
                                                                              - - - - - -
                                                                              [Note]Note

                                                                              The implementation currently uses the Euclidian Algorithm to compute the multiplicative inverse. Therefore, the inversive generators are about 10-20 times slower than the others (see section"performance"). However, the paper talks of only 3x slowdown, so the Euclidian Algorithm is probably not optimal for calculating the multiplicative inverse.

                                                                              -

                                                                              -
                                                                              -

                                                                              -inversive_congruential_engine - public - construct/copy/destruct

                                                                              -
                                                                                -
                                                                              1. -
                                                                                inversive_congruential_engine();
                                                                                -

                                                                                Constructs an inversive_congruential_engine, seeding it with the default seed.

                                                                                -
                                                                                2. -
                                                                              2. -
                                                                                explicit inversive_congruential_engine(IntType x0);
                                                                                -

                                                                                Constructs an inversive_congruential_engine, seeding it with x0.

                                                                                -
                                                                                3. -
                                                                              3. -
                                                                                template<typename SeedSeq> 
-  explicit inversive_congruential_engine(SeedSeq & seq);
                                                                                -

                                                                                Constructs an inversive_congruential_engine, seeding it with values produced by a call to seq.generate().

                                                                                -
                                                                                4. -
                                                                              4. -
                                                                                template<typename It> inversive_congruential_engine(It & first, It last);
                                                                                -

                                                                                Constructs an inversive_congruential_engine, seeds it with values taken from the itrator range [first, last), and adjusts first to point to the element after the last one used. If there are not enough elements, throws std::invalid_argument.

                                                                                -

                                                                                first and last must be input iterators.

                                                                                -
                                                                                5. -
                                                                              -
                                                                              -
                                                                              -

                                                                              -inversive_congruential_engine public static functions

                                                                              -
                                                                                -
                                                                              1. static result_type min();
                                                                                2. -
                                                                              2. static result_type max();
                                                                                3. -
                                                                              -
                                                                              -
                                                                              -

                                                                              -inversive_congruential_engine public member functions

                                                                              -
                                                                                -
                                                                              1. -
                                                                                void seed();
                                                                                -

                                                                                Calls seed(default_seed)

                                                                                -
                                                                                2. -
                                                                              2. -
                                                                                void seed(IntType x0);
                                                                                -

                                                                                If c mod m is zero and x0 mod m is zero, changes the current value of the generator to 1. Otherwise, changes it to x0 mod m. If c is zero, distinct seeds in the range [1,m) will leave the generator in distinct states. If c is not zero, the range is [0,m).

                                                                                -
                                                                                3. -
                                                                              3. -
                                                                                template<typename SeedSeq> void seed(SeedSeq & seq);
                                                                                -

                                                                                Seeds an inversive_congruential_engine using values from a SeedSeq.

                                                                                -
                                                                                4. -
                                                                              4. -
                                                                                template<typename It> void seed(It & first, It last);
                                                                                -

                                                                                seeds an inversive_congruential_engine with values taken from the itrator range [first, last) and adjusts first to point to the element after the last one used. If there are not enough elements, throws std::invalid_argument.

                                                                                -

                                                                                first and last must be input iterators.

                                                                                -
                                                                                5. -
                                                                              5. -
                                                                                IntType operator()();
                                                                                -

                                                                                Returns the next output of the generator.

                                                                                -
                                                                                6. -
                                                                              6. -
                                                                                template<typename Iter> void generate(Iter first, Iter last);
                                                                                -

                                                                                Fills a range with random values

                                                                                -
                                                                                7. -
                                                                              7. -
                                                                                void discard(boost::uintmax_t z);
                                                                                -

                                                                                Advances the state of the generator by z.

                                                                                -
                                                                                8. -
                                                                              -
                                                                              -
                                                                              -

                                                                              -inversive_congruential_engine friend functions

                                                                              -
                                                                                -
                                                                              1. -
                                                                                template<typename CharT, typename Traits> 
-  friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
-             const inversive_congruential_engine & x);
                                                                                -

                                                                                Writes the textual representation of the generator to a std::ostream.

                                                                                -
                                                                                2. -
                                                                              2. -
                                                                                template<typename CharT, typename Traits> 
-  friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
-             const inversive_congruential_engine & x);
                                                                                -

                                                                                Reads the textual representation of the generator from a std::istream.

                                                                                -
                                                                                3. -
                                                                              3. -
                                                                                friend bool operator==(const inversive_congruential_engine & x, 
-                       const inversive_congruential_engine & y);
                                                                                -

                                                                                Returns true if the two generators will produce identical sequences of outputs.

                                                                                -
                                                                                4. -
                                                                              4. -
                                                                                friend bool operator!=(const inversive_congruential_engine & lhs, 
-                       const inversive_congruential_engine & rhs);
                                                                                -

                                                                                Returns true if the two generators will produce different sequences of outputs.

                                                                                -
                                                                                5. -
                                                                              -
                                                                              -
                                                                              -
                                                                              - - - -
                                                                              Copyright © 2000-2005 Jens Maurer
                                                                              Copyright © 2009, 2010 Steven Watanabe

                                                                              - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                              -
                                                                              -
                                                                              -
                                                                              -PrevUpHomeNext -
                                                                              - - diff --git a/doc/html/boost/random/knuth_b.html b/doc/html/boost/random/knuth_b.html index 262a484f36..5c2a8d8f24 100644 --- a/doc/html/boost/random/knuth_b.html +++ b/doc/html/boost/random/knuth_b.html @@ -35,7 +35,7 @@ typedef shuffle_order_engine< minstd_rand0, 256 > knuth_b;
                                                                            -

                                                                            Description

                                                                            +

                                                                            Description

                                                                            The specialization knuth_b is specified by the C++ standard. It is described in

                                                                            "The Art of Computer Programming, Second Edition, Volume 2, diff --git a/doc/html/boost/random/kreutzer1986.html b/doc/html/boost/random/kreutzer1986.html index b488a9a8c6..840b56f3f7 100644 --- a/doc/html/boost/random/kreutzer1986.html +++ b/doc/html/boost/random/kreutzer1986.html @@ -35,7 +35,7 @@ typedef shuffle_order_engine< linear_congruential_engine< uint32_t, 1366, 150889, 714025 >, 97 > kreutzer1986;

                                                                            -

                                                                            Description

                                                                            +

                                                                            Description

                                                                            According to Harry Erwin (private e-mail), the specialization kreutzer1986 was suggested in:

                                                                            "System Simulation: Programming Styles and Languages (International diff --git a/doc/html/boost/random/lagged_fibonacci1279.html b/doc/html/boost/random/lagged_fibonacci1279.html index 0210b59866..de41d912c5 100644 --- a/doc/html/boost/random/lagged_fibonacci1279.html +++ b/doc/html/boost/random/lagged_fibonacci1279.html @@ -35,7 +35,7 @@ typedef lagged_fibonacci_01_engine< double, 48, 1279, 418 > lagged_fibonacci1279;

                                                                            -

                                                                            Description

                                                                            +

                                                                            Description

                                                                            The specializations lagged_fibonacci607 ... lagged_fibonacci44497 use well tested lags.

                                                                            See

                                                                            diff --git a/doc/html/boost/random/lagged_fibonacci19937.html b/doc/html/boost/random/lagged_fibonacci19937.html index 80acbb52d4..7402ffbcf3 100644 --- a/doc/html/boost/random/lagged_fibonacci19937.html +++ b/doc/html/boost/random/lagged_fibonacci19937.html @@ -35,7 +35,7 @@ typedef lagged_fibonacci_01_engine< double, 48, 19937, 9842 > lagged_fibonacci19937;
                                                                            -

                                                                            Description

                                                                            +

                                                                            Description

                                                                            The specializations lagged_fibonacci607 ... lagged_fibonacci44497 use well tested lags.

                                                                            See

                                                                            diff --git a/doc/html/boost/random/lagged_fibonacci2281.html b/doc/html/boost/random/lagged_fibonacci2281.html index a86adab376..19935dbab7 100644 --- a/doc/html/boost/random/lagged_fibonacci2281.html +++ b/doc/html/boost/random/lagged_fibonacci2281.html @@ -35,7 +35,7 @@ typedef lagged_fibonacci_01_engine< double, 48, 2281, 1252 > lagged_fibonacci2281;
                                                                            -

                                                                            Description

                                                                            +

                                                                            Description

                                                                            The specializations lagged_fibonacci607 ... lagged_fibonacci44497 use well tested lags.

                                                                            See

                                                                            diff --git a/doc/html/boost/random/lagged_fibonacci23209.html b/doc/html/boost/random/lagged_fibonacci23209.html index 98089f85b9..4ce303143b 100644 --- a/doc/html/boost/random/lagged_fibonacci23209.html +++ b/doc/html/boost/random/lagged_fibonacci23209.html @@ -35,7 +35,7 @@ typedef lagged_fibonacci_01_engine< double, 48, 23209, 13470 > lagged_fibonacci23209;
                                                                            -

                                                                            Description

                                                                            +

                                                                            Description

                                                                            The specializations lagged_fibonacci607 ... lagged_fibonacci44497 use well tested lags.

                                                                            See

                                                                            diff --git a/doc/html/boost/random/lagged_fibonacci3217.html b/doc/html/boost/random/lagged_fibonacci3217.html index f0aff67747..b63617743b 100644 --- a/doc/html/boost/random/lagged_fibonacci3217.html +++ b/doc/html/boost/random/lagged_fibonacci3217.html @@ -35,7 +35,7 @@ typedef lagged_fibonacci_01_engine< double, 48, 3217, 576 > lagged_fibonacci3217;
                                                                            -

                                                                            Description

                                                                            +

                                                                            Description

                                                                            The specializations lagged_fibonacci607 ... lagged_fibonacci44497 use well tested lags.

                                                                            See

                                                                            diff --git a/doc/html/boost/random/lagged_fibonacci4423.html b/doc/html/boost/random/lagged_fibonacci4423.html index 2a3637b9aa..aa7e4cc131 100644 --- a/doc/html/boost/random/lagged_fibonacci4423.html +++ b/doc/html/boost/random/lagged_fibonacci4423.html @@ -35,7 +35,7 @@ typedef lagged_fibonacci_01_engine< double, 48, 4423, 2098 > lagged_fibonacci4423;
                                                                            -

                                                                            Description

                                                                            +

                                                                            Description

                                                                            The specializations lagged_fibonacci607 ... lagged_fibonacci44497 use well tested lags.

                                                                            See

                                                                            diff --git a/doc/html/boost/random/lagged_fibonacci44497.html b/doc/html/boost/random/lagged_fibonacci44497.html index 9bc9162ed7..14abfd0d42 100644 --- a/doc/html/boost/random/lagged_fibonacci44497.html +++ b/doc/html/boost/random/lagged_fibonacci44497.html @@ -35,7 +35,7 @@ typedef lagged_fibonacci_01_engine< double, 48, 44497, 21034 > lagged_fibonacci44497;
                                                                            -

                                                                            Description

                                                                            +

                                                                            Description

                                                                            The specializations lagged_fibonacci607 ... lagged_fibonacci44497 use well tested lags.

                                                                            See

                                                                            diff --git a/doc/html/boost/random/lagged_fibonacci607.html b/doc/html/boost/random/lagged_fibonacci607.html index 715ce71987..e4a25092c1 100644 --- a/doc/html/boost/random/lagged_fibonacci607.html +++ b/doc/html/boost/random/lagged_fibonacci607.html @@ -35,7 +35,7 @@ typedef lagged_fibonacci_01_engine< double, 48, 607, 273 > lagged_fibonacci607;
                                                                            -

                                                                            Description

                                                                            +

                                                                            Description

                                                                            The specializations lagged_fibonacci607 ... lagged_fibonacci44497 use well tested lags.

                                                                            See

                                                                            diff --git a/doc/html/boost/random/lagged_fibonacci9689.html b/doc/html/boost/random/lagged_fibonacci9689.html index 33f3b8a58d..49e880bcef 100644 --- a/doc/html/boost/random/lagged_fibonacci9689.html +++ b/doc/html/boost/random/lagged_fibonacci9689.html @@ -35,7 +35,7 @@ typedef lagged_fibonacci_01_engine< double, 48, 9689, 5502 > lagged_fibonacci9689;
                                                                            -

                                                                            Description

                                                                            +

                                                                            Description

                                                                            The specializations lagged_fibonacci607 ... lagged_fibonacci44497 use well tested lags.

                                                                            See

                                                                            diff --git a/doc/html/boost/random/lagged_fibonacci_01_engine.html b/doc/html/boost/random/lagged_fibonacci_01_engine.html index a6971aae32..a784430f1e 100644 --- a/doc/html/boost/random/lagged_fibonacci_01_engine.html +++ b/doc/html/boost/random/lagged_fibonacci_01_engine.html @@ -39,36 +39,36 @@ typedef RealType result_type; // construct/copy/destruct - lagged_fibonacci_01_engine(); - explicit lagged_fibonacci_01_engine(uint32_t); - template<typename SeedSeq> explicit lagged_fibonacci_01_engine(SeedSeq &); - template<typename It> lagged_fibonacci_01_engine(It &, It); + lagged_fibonacci_01_engine(); + explicit lagged_fibonacci_01_engine(uint32_t); + template<typename SeedSeq> explicit lagged_fibonacci_01_engine(SeedSeq &); + template<typename It> lagged_fibonacci_01_engine(It &, It); - // public member functions - void seed(); - void seed(boost::uint32_t); - template<typename SeedSeq> void seed(SeedSeq &); - template<typename It> void seed(It &, It); - result_type operator()(); - template<typename Iter> void generate(Iter, Iter); - void discard(boost::uintmax_t); + // public member functions + void seed(); + void seed(boost::uint32_t); + template<typename SeedSeq> void seed(SeedSeq &); + template<typename It> void seed(It &, It); + result_type operator()(); + template<typename Iter> void generate(Iter, Iter); + void discard(boost::uintmax_t); - // public static functions - static result_type min(); - static result_type max(); + // public static functions + static result_type min(); + static result_type max(); - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, + operator<<(std::basic_ostream< CharT, Traits > &, const lagged_fibonacci_01_engine &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, + operator>>(std::basic_istream< CharT, Traits > &, const lagged_fibonacci_01_engine &); - friend bool operator==(const lagged_fibonacci_01_engine &, + friend bool operator==(const lagged_fibonacci_01_engine &, const lagged_fibonacci_01_engine &); - friend bool operator!=(const lagged_fibonacci_01_engine &, + friend bool operator!=(const lagged_fibonacci_01_engine &, const lagged_fibonacci_01_engine &); // public data members @@ -79,7 +79,7 @@ static const boost::uint32_t default_seed; };
                                                                            -

                                                                            Description

                                                                            +

                                                                            Description

                                                                            Instantiations of class template lagged_fibonacci_01 model a pseudo-random number generator . It uses a lagged Fibonacci algorithm with two lags p and q, evaluated in floating-point arithmetic: x(i) = x(i-p) + x(i-q) (mod 1) with p > q. See

                                                                            "Uniform random number generators for supercomputers", Richard Brent, Proc. of Fifth Australian Supercomputer Conference, Melbourne, Dec. 1992, pp. 704-706.

                                                                            @@ -95,99 +95,99 @@

                                                                            The generator requires considerable amounts of memory for the storage of its state array. For example, lagged_fibonacci607 requires about 4856 bytes and lagged_fibonacci44497 requires about 350 KBytes.

                                                                            -

                                                                            +

                                                                            lagged_fibonacci_01_engine public construct/copy/destruct

                                                                            1. -
                                                                              lagged_fibonacci_01_engine();
                                                                              +
                                                                              lagged_fibonacci_01_engine();

                                                                              Constructs a lagged_fibonacci_01 generator and calls seed().

                                                                            2. -
                                                                              explicit lagged_fibonacci_01_engine(uint32_t value);
                                                                              +
                                                                              explicit lagged_fibonacci_01_engine(uint32_t value);

                                                                              Constructs a lagged_fibonacci_01 generator and calls seed(value).

                                                                            3. -
                                                                              template<typename SeedSeq> explicit lagged_fibonacci_01_engine(SeedSeq & seq);
                                                                              +
                                                                              template<typename SeedSeq> explicit lagged_fibonacci_01_engine(SeedSeq & seq);

                                                                              Constructs a lagged_fibonacci_01 generator and calls seed(gen).

                                                                              4. -
                                                                            4. template<typename It> lagged_fibonacci_01_engine(It & first, It last);
                                                                              5. +
                                                                            5. template<typename It> lagged_fibonacci_01_engine(It & first, It last);
                                                                            -

                                                                            -lagged_fibonacci_01_engine public member functions

                                                                            +

                                                                            +lagged_fibonacci_01_engine public member functions

                                                                            1. -
                                                                              void seed();
                                                                              +
                                                                              void seed();

                                                                              Calls seed(default_seed).

                                                                            2. -
                                                                              void seed(boost::uint32_t value);
                                                                              +
                                                                              void seed(boost::uint32_t value);

                                                                              Constructs a minstd_rand0 generator with the constructor parameter value and calls seed with it. Distinct seeds in the range [1, 2147483647) will produce generators with different states. Other seeds will be equivalent to some seed within this range. See linear_congruential_engine for details.

                                                                            3. -
                                                                              template<typename SeedSeq> void seed(SeedSeq & seq);
                                                                              +
                                                                              template<typename SeedSeq> void seed(SeedSeq & seq);

                                                                              Seeds this lagged_fibonacci_01_engine using values produced by seq.generate.

                                                                            4. -
                                                                              template<typename It> void seed(It & first, It last);
                                                                              +
                                                                              template<typename It> void seed(It & first, It last);

                                                                              Seeds this lagged_fibonacci_01_engine using values from the iterator range [first, last). If there are not enough elements in the range, throws std::invalid_argument.

                                                                            5. -
                                                                              result_type operator()();
                                                                              +
                                                                              result_type operator()();

                                                                              Returns the next value of the generator.

                                                                            6. -
                                                                              template<typename Iter> void generate(Iter first, Iter last);
                                                                              +
                                                                              template<typename Iter> void generate(Iter first, Iter last);

                                                                              Fills a range with random values

                                                                            7. -
                                                                              void discard(boost::uintmax_t z);
                                                                              +
                                                                              void discard(boost::uintmax_t z);

                                                                              Advances the state of the generator by z.

                                                                            -

                                                                            -lagged_fibonacci_01_engine public static functions

                                                                            +

                                                                            +lagged_fibonacci_01_engine public static functions

                                                                            1. -
                                                                              static result_type min();
                                                                              +
                                                                              static result_type min();

                                                                              Returns the smallest value that the generator can produce.

                                                                            2. -
                                                                              static result_type max();
                                                                              +
                                                                              static result_type max();

                                                                              Returns the upper bound of the generators outputs.

                                                                            -

                                                                            -lagged_fibonacci_01_engine friend functions

                                                                            +

                                                                            +lagged_fibonacci_01_engine friend functions

                                                                            1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const lagged_fibonacci_01_engine & f);

                                                                              Writes the textual representation of the generator to a std::ostream. 

                                                                            2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
              const lagged_fibonacci_01_engine & f);

                                                                              Reads the textual representation of the generator from a std::istream.

                                                                            3. -
                                                                              friend bool operator==(const lagged_fibonacci_01_engine & x_, 
+
                                                                              friend bool operator==(const lagged_fibonacci_01_engine & x_, 
                        const lagged_fibonacci_01_engine & y_);
                                                                              
 
                                                                              Returns true if the two generators will produce identical sequences of outputs.
                                                                            4. -
                                                                              friend bool operator!=(const lagged_fibonacci_01_engine & lhs, 
+
                                                                              friend bool operator!=(const lagged_fibonacci_01_engine & lhs, 
                        const lagged_fibonacci_01_engine & rhs);
                                                                              
 
                                                                              Returns true if the two generators will produce different sequences of outputs.
                                                                              5. diff --git a/doc/html/boost/random/lagged_fibonacci_engine.html b/doc/html/boost/random/lagged_fibonacci_engine.html index a1145dd52a..05be9161cb 100644 --- a/doc/html/boost/random/lagged_fibonacci_engine.html +++ b/doc/html/boost/random/lagged_fibonacci_engine.html @@ -39,36 +39,36 @@ typedef UIntType result_type; // construct/copy/destruct - lagged_fibonacci_engine(); - explicit lagged_fibonacci_engine(UIntType); - template<typename SeedSeq> explicit lagged_fibonacci_engine(SeedSeq &); - template<typename It> lagged_fibonacci_engine(It &, It); + lagged_fibonacci_engine(); + explicit lagged_fibonacci_engine(UIntType); + template<typename SeedSeq> explicit lagged_fibonacci_engine(SeedSeq &); + template<typename It> lagged_fibonacci_engine(It &, It); - // public static functions - static result_type min(); - static result_type max(); + // public static functions + static result_type min(); + static result_type max(); - // public member functions - void seed(); - void seed(UIntType); - template<typename SeedSeq> void seed(SeedSeq &); - template<typename It> void seed(It &, It); - result_type operator()(); - template<typename Iter> void generate(Iter, Iter); - void discard(boost::uintmax_t); + // public member functions + void seed(); + void seed(UIntType); + template<typename SeedSeq> void seed(SeedSeq &); + template<typename It> void seed(It &, It); + result_type operator()(); + template<typename Iter> void generate(Iter, Iter); + void discard(boost::uintmax_t); - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, + operator<<(std::basic_ostream< CharT, Traits > &, const lagged_fibonacci_engine &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, + operator>>(std::basic_istream< CharT, Traits > &, const lagged_fibonacci_engine &); - friend bool operator==(const lagged_fibonacci_engine &, + friend bool operator==(const lagged_fibonacci_engine &, const lagged_fibonacci_engine &); - friend bool operator!=(const lagged_fibonacci_engine &, + friend bool operator!=(const lagged_fibonacci_engine &, const lagged_fibonacci_engine &); // public data members @@ -79,105 +79,105 @@ static const UIntType default_seed; };
                                                                            -

                                                                            Description

                                                                            +

                                                                            Description

                                                                            Instantiations of class template lagged_fibonacci_engine model a pseudo-random number generator . It uses a lagged Fibonacci algorithm with two lags p and q: x(i) = x(i-p) + x(i-q) (mod 2w) with p > q.

                                                                            -

                                                                            +

                                                                            lagged_fibonacci_engine public construct/copy/destruct

                                                                            1. -
                                                                              lagged_fibonacci_engine();
                                                                              +
                                                                              lagged_fibonacci_engine();

                                                                              Creates a new lagged_fibonacci_engine and calls seed().

                                                                            2. -
                                                                              explicit lagged_fibonacci_engine(UIntType value);
                                                                              +
                                                                              explicit lagged_fibonacci_engine(UIntType value);

                                                                              Creates a new lagged_fibonacci_engine and calls seed(value).

                                                                            3. -
                                                                              template<typename SeedSeq> explicit lagged_fibonacci_engine(SeedSeq & seq);
                                                                              +
                                                                              template<typename SeedSeq> explicit lagged_fibonacci_engine(SeedSeq & seq);

                                                                              Creates a new lagged_fibonacci_engine and calls seed(seq).

                                                                            4. -
                                                                              template<typename It> lagged_fibonacci_engine(It & first, It last);
                                                                              +
                                                                              template<typename It> lagged_fibonacci_engine(It & first, It last);

                                                                              Creates a new lagged_fibonacci_engine and calls seed(first, last).

                                                                            -

                                                                            -lagged_fibonacci_engine public static functions

                                                                            +

                                                                            +lagged_fibonacci_engine public static functions

                                                                            1. -
                                                                              static result_type min();
                                                                              +
                                                                              static result_type min();

                                                                              Returns the smallest value that the generator can produce.

                                                                            2. -
                                                                              static result_type max();
                                                                              +
                                                                              static result_type max();

                                                                              Returns the largest value that the generator can produce.

                                                                            -

                                                                            -lagged_fibonacci_engine public member functions

                                                                            +

                                                                            +lagged_fibonacci_engine public member functions

                                                                            1. -
                                                                              void seed();
                                                                              +
                                                                              void seed();

                                                                              Calls seed(default_seed).

                                                                            2. -
                                                                              void seed(UIntType value);
                                                                              +
                                                                              void seed(UIntType value);

                                                                              Sets the state of the generator to values produced by a minstd_rand0 generator.

                                                                            3. -
                                                                              template<typename SeedSeq> void seed(SeedSeq & seq);
                                                                              +
                                                                              template<typename SeedSeq> void seed(SeedSeq & seq);

                                                                              Sets the state of the generator using values produced by seq.

                                                                            4. -
                                                                              template<typename It> void seed(It & first, It last);
                                                                              +
                                                                              template<typename It> void seed(It & first, It last);

                                                                              Sets the state of the generator to values from the iterator range [first, last). If there are not enough elements in the range [first, last) throws std::invalid_argument.

                                                                            5. -
                                                                              result_type operator()();
                                                                              +
                                                                              result_type operator()();

                                                                              Returns the next value of the generator.

                                                                            6. -
                                                                              template<typename Iter> void generate(Iter first, Iter last);
                                                                              +
                                                                              template<typename Iter> void generate(Iter first, Iter last);

                                                                              Fills a range with random values

                                                                            7. -
                                                                              void discard(boost::uintmax_t z);
                                                                              +
                                                                              void discard(boost::uintmax_t z);

                                                                              Advances the state of the generator by z.

                                                                            -

                                                                            -lagged_fibonacci_engine friend functions

                                                                            +

                                                                            +lagged_fibonacci_engine friend functions

                                                                            1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const lagged_fibonacci_engine & f);

                                                                              Writes the textual representation of the generator to a std::ostream. 

                                                                            2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
              const lagged_fibonacci_engine & f);

                                                                              Reads the textual representation of the generator from a std::istream.

                                                                            3. -
                                                                              friend bool operator==(const lagged_fibonacci_engine & x_, 
+
                                                                              friend bool operator==(const lagged_fibonacci_engine & x_, 
                        const lagged_fibonacci_engine & y_);
                                                                              
 
                                                                              Returns true if the two generators will produce identical sequences of outputs.
                                                                            4. -
                                                                              friend bool operator!=(const lagged_fibonacci_engine & lhs, 
+
                                                                              friend bool operator!=(const lagged_fibonacci_engine & lhs, 
                        const lagged_fibonacci_engine & rhs);
                                                                              
 
                                                                              Returns true if the two generators will produce different sequences of outputs.
                                                                              5. diff --git a/doc/html/boost/random/laplace_distribution.html b/doc/html/boost/random/laplace_distribution.html index 753784bc50..929e051042 100644 --- a/doc/html/boost/random/laplace_distribution.html +++ b/doc/html/boost/random/laplace_distribution.html @@ -47,141 +47,141 @@ typedef laplace_distribution distribution_type; // construct/copy/destruct - explicit param_type(RealType = 0.0, RealType = 1.0); + explicit param_type(RealType = 0.0, RealType = 1.0); - // public member functions - RealType mean() const; - RealType beta() const; + // public member functions + RealType mean() const; + RealType beta() const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); + operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, const param_type &); - friend bool operator==(const param_type &, const param_type &); - friend bool operator!=(const param_type &, const param_type &); + operator>>(std::basic_istream< CharT, Traits > &, const param_type &); + friend bool operator==(const param_type &, const param_type &); + friend bool operator!=(const param_type &, const param_type &); }; // construct/copy/destruct - explicit laplace_distribution(RealType = 0.0, RealType = 1.0); - explicit laplace_distribution(const param_type &); + explicit laplace_distribution(RealType = 0.0, RealType = 1.0); + explicit laplace_distribution(const param_type &); - // public member functions - template<typename URNG> RealType operator()(URNG &) const; + // public member functions + template<typename URNG> RealType operator()(URNG &) const; template<typename URNG> - RealType operator()(URNG &, const param_type &) const; - RealType mean() const; - RealType beta() const; - RealType min() const; - RealType max() const; - param_type param() const; - void param(const param_type &); - void reset(); + RealType operator()(URNG &, const param_type &) const; + RealType mean() const; + RealType beta() const; + RealType min() const; + RealType max() const; + param_type param() const; + void param(const param_type &); + void reset(); - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, + operator<<(std::basic_ostream< CharT, Traits > &, const laplace_distribution &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, + operator>>(std::basic_istream< CharT, Traits > &, const laplace_distribution &); - friend bool operator==(const laplace_distribution &, + friend bool operator==(const laplace_distribution &, const laplace_distribution &); - friend bool operator!=(const laplace_distribution &, + friend bool operator!=(const laplace_distribution &, const laplace_distribution &); };
                                                                            -

                                                                            Description

                                                                            +

                                                                            Description

                                                                            The laplace distribution is a real-valued distribution with two parameters, mean and beta.

                                                                            -

                                                                            It has .

                                                                            +

                                                                            It has .

                                                                            -

                                                                            +

                                                                            laplace_distribution public construct/copy/destruct

                                                                            1. -
                                                                              explicit laplace_distribution(RealType mean = 0.0, RealType beta = 1.0);
                                                                              +
                                                                              explicit laplace_distribution(RealType mean = 0.0, RealType beta = 1.0);

                                                                              Constructs an laplace_distribution from its "mean" and "beta" parameters.

                                                                            2. -
                                                                              explicit laplace_distribution(const param_type & param);
                                                                              +
                                                                              explicit laplace_distribution(const param_type & param);

                                                                              Constructs an laplace_distribution from its parameters.

                                                                            -

                                                                            -laplace_distribution public member functions

                                                                            +

                                                                            +laplace_distribution public member functions

                                                                            1. -
                                                                              template<typename URNG> RealType operator()(URNG & urng) const;
                                                                              +
                                                                              template<typename URNG> RealType operator()(URNG & urng) const;

                                                                              Returns a random variate distributed according to the laplace distribution. 

                                                                            2. template<typename URNG> 
-  RealType operator()(URNG & urng, const param_type & param) const;
                                                                              + RealType operator()(URNG & urng, const param_type & param) const;

                                                                              Returns a random variate distributed accordint to the laplace distribution with parameters specified by param.

                                                                            3. -
                                                                              RealType mean() const;
                                                                              +
                                                                              RealType mean() const;

                                                                              Returns the "mean" parameter of the distribution.

                                                                            4. -
                                                                              RealType beta() const;
                                                                              +
                                                                              RealType beta() const;

                                                                              Returns the "beta" parameter of the distribution.

                                                                            5. -
                                                                              RealType min() const;
                                                                              +
                                                                              RealType min() const;

                                                                              Returns the smallest value that the distribution can produce.

                                                                            6. -
                                                                              RealType max() const;
                                                                              +
                                                                              RealType max() const;

                                                                              Returns the largest value that the distribution can produce.

                                                                            7. -
                                                                              param_type param() const;
                                                                              +
                                                                              param_type param() const;

                                                                              Returns the parameters of the distribution.

                                                                            8. -
                                                                              void param(const param_type & param);
                                                                              +
                                                                              void param(const param_type & param);

                                                                              Sets the parameters of the distribution.

                                                                            9. -
                                                                              void reset();
                                                                              +
                                                                              void reset();

                                                                              Effects: Subsequent uses of the distribution do not depend on values produced by any engine prior to invoking reset.

                                                                            -

                                                                            -laplace_distribution friend functions

                                                                            +

                                                                            +laplace_distribution friend functions

                                                                            1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const laplace_distribution & wd);

                                                                              Writes an laplace_distribution to a std::ostream. 

                                                                            2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
              const laplace_distribution & wd);

                                                                              Reads an laplace_distribution from a std::istream.

                                                                            3. -
                                                                              friend bool operator==(const laplace_distribution & lhs, 
+
                                                                              friend bool operator==(const laplace_distribution & lhs, 
                        const laplace_distribution & rhs);
                                                                              
 
                                                                              Returns true if the two instances of laplace_distribution will return identical sequences of values given equal generators.
                                                                            4. -
                                                                              friend bool operator!=(const laplace_distribution & lhs, 
+
                                                                              friend bool operator!=(const laplace_distribution & lhs, 
                        const laplace_distribution & rhs);
                                                                              
 
                                                                              Returns true if the two instances of laplace_distribution will return different sequences of values given equal generators.
                                                                              5. diff --git a/doc/html/boost/random/laplace_distribution/param_type.html b/doc/html/boost/random/laplace_distribution/param_type.html index 49866b7ea8..04503bd586 100644 --- a/doc/html/boost/random/laplace_distribution/param_type.html +++ b/doc/html/boost/random/laplace_distribution/param_type.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                                                              -PrevUpHomeNext +PrevUpHomeNext
                                                                              @@ -40,72 +40,72 @@ typedef laplace_distribution distribution_type; // construct/copy/destruct - explicit param_type(RealType = 0.0, RealType = 1.0); + explicit param_type(RealType = 0.0, RealType = 1.0); - // public member functions - RealType mean() const; - RealType beta() const; + // public member functions + RealType mean() const; + RealType beta() const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); + operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, const param_type &); - friend bool operator==(const param_type &, const param_type &); - friend bool operator!=(const param_type &, const param_type &); + operator>>(std::basic_istream< CharT, Traits > &, const param_type &); + friend bool operator==(const param_type &, const param_type &); + friend bool operator!=(const param_type &, const param_type &); };
                                                                              -

                                                                              Description

                                                                              +

                                                                              Description

                                                                              -

                                                                              +

                                                                              param_type public construct/copy/destruct

                                                                              1. -
                                                                                explicit param_type(RealType mean = 0.0, RealType beta = 1.0);
                                                                                +
                                                                                explicit param_type(RealType mean = 0.0, RealType beta = 1.0);

                                                                                Constructs a param_type from the "mean" and "beta" parameters of the distribution.

                                                                              -

                                                                              -param_type public member functions

                                                                              +

                                                                              +param_type public member functions

                                                                              1. -
                                                                                RealType mean() const;
                                                                                +
                                                                                RealType mean() const;

                                                                                Returns the "mean" parameter of the distribtuion.

                                                                              2. -
                                                                                RealType beta() const;
                                                                                +
                                                                                RealType beta() const;

                                                                                Returns the "beta" parameter of the distribution.

                                                                              -

                                                                              -param_type friend functions

                                                                              +

                                                                              +param_type friend functions

                                                                              1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const param_type & param);

                                                                                Writes a param_type to a std::ostream. 

                                                                              2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
              const param_type & param);

                                                                                Reads a param_type from a std::istream.

                                                                              3. -
                                                                                friend bool operator==(const param_type & lhs, const param_type & rhs);
                                                                                +
                                                                                friend bool operator==(const param_type & lhs, const param_type & rhs);

                                                                                Returns true if the two sets of parameters are the same.

                                                                              4. -
                                                                                friend bool operator!=(const param_type & lhs, const param_type & rhs);
                                                                                +
                                                                                friend bool operator!=(const param_type & lhs, const param_type & rhs);

                                                                                Returns true if the two sets of parameters are the different.

                                                                              @@ -122,7 +122,7 @@
                                                                              -PrevUpHomeNext +PrevUpHomeNext
                                                                              diff --git a/doc/html/boost/random/linear_congruential_engine.html b/doc/html/boost/random/linear_congruential_engine.html index 34668d0d7f..37affdfd39 100644 --- a/doc/html/boost/random/linear_congruential_engine.html +++ b/doc/html/boost/random/linear_congruential_engine.html @@ -39,32 +39,32 @@ typedef IntType result_type; // construct/copy/destruct - linear_congruential_engine(); - explicit linear_congruential_engine(IntType); - template<typename SeedSeq> explicit linear_congruential_engine(SeedSeq &); - template<typename It> linear_congruential_engine(It &, It); + linear_congruential_engine(); + explicit linear_congruential_engine(IntType); + template<typename SeedSeq> explicit linear_congruential_engine(SeedSeq &); + template<typename It> linear_congruential_engine(It &, It); - // public member functions - void seed(); - void seed(IntType); - template<typename SeedSeq> void seed(SeedSeq &); - template<typename It> void seed(It &, It); - IntType operator()(); - template<typename Iter> void generate(Iter, Iter); - void discard(boost::uintmax_t); + // public member functions + void seed(); + void seed(IntType); + template<typename SeedSeq> void seed(SeedSeq &); + template<typename It> void seed(It &, It); + IntType operator()(); + template<typename Iter> void generate(Iter, Iter); + void discard(boost::uintmax_t); - // public static functions - static result_type min(); - static result_type max(); + // public static functions + static result_type min(); + static result_type max(); - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, + operator<<(std::basic_ostream< CharT, Traits > &, const linear_congruential_engine &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, + operator>>(std::basic_istream< CharT, Traits > &, linear_congruential_engine &); // public data members @@ -75,7 +75,7 @@ static const IntType default_seed; };
                                                                              -

                                                                              Description

                                                                              +

                                                                              Description

                                                                              Instantiations of class template linear_congruential_engine model a pseudo-random number generator . Linear congruential pseudo-random number generators are described in:

                                                                              "Mathematical methods in large-scale computing units", D. H. Lehmer, Proc. 2nd Symposium on Large-Scale Digital Calculating Machines, Harvard University Press, 1951, pp. 141-146

                                                                              @@ -83,94 +83,94 @@

                                                                              Let x(n) denote the sequence of numbers returned by some pseudo-random number generator. Then for the linear congruential generator, x(n+1) := (a * x(n) + c) mod m. Parameters for the generator are x(0), a, c, m. The template parameter IntType shall denote an integral type. It must be large enough to hold values a, c, and m. The template parameters a and c must be smaller than m.

                                                                              Note: The quality of the generator crucially depends on the choice of the parameters. User code should use one of the sensibly parameterized generators such as minstd_rand instead.

                                                                              -

                                                                              +

                                                                              linear_congruential_engine public construct/copy/destruct

                                                                              1. -
                                                                                linear_congruential_engine();
                                                                                +
                                                                                linear_congruential_engine();

                                                                                Constructs a linear_congruential_engine, using the default seed

                                                                              2. -
                                                                                explicit linear_congruential_engine(IntType x0);
                                                                                +
                                                                                explicit linear_congruential_engine(IntType x0);

                                                                                Constructs a linear_congruential_engine, seeding it with x0.

                                                                              3. -
                                                                                template<typename SeedSeq> explicit linear_congruential_engine(SeedSeq & seq);
                                                                                +
                                                                                template<typename SeedSeq> explicit linear_congruential_engine(SeedSeq & seq);

                                                                                Constructs a linear_congruential_engine, seeding it with values produced by a call to seq.generate().

                                                                              4. -
                                                                                template<typename It> linear_congruential_engine(It & first, It last);
                                                                                +
                                                                                template<typename It> linear_congruential_engine(It & first, It last);

                                                                                Constructs a linear_congruential_engine and seeds it with values taken from the itrator range [first, last) and adjusts first to point to the element after the last one used. If there are not enough elements, throws std::invalid_argument.

                                                                                first and last must be input iterators.

                                                                              -

                                                                              -linear_congruential_engine public member functions

                                                                              +

                                                                              +linear_congruential_engine public member functions

                                                                              1. -
                                                                                void seed();
                                                                                +
                                                                                void seed();

                                                                                Calls seed(default_seed)

                                                                              2. -
                                                                                void seed(IntType x0);
                                                                                +
                                                                                void seed(IntType x0);

                                                                                If c mod m is zero and x0 mod m is zero, changes the current value of the generator to 1. Otherwise, changes it to x0 mod m. If c is zero, distinct seeds in the range [1,m) will leave the generator in distinct states. If c is not zero, the range is [0,m).

                                                                              3. -
                                                                                template<typename SeedSeq> void seed(SeedSeq & seq);
                                                                                +
                                                                                template<typename SeedSeq> void seed(SeedSeq & seq);

                                                                                Seeds a linear_congruential_engine using values from a SeedSeq.

                                                                              4. -
                                                                                template<typename It> void seed(It & first, It last);
                                                                                +
                                                                                template<typename It> void seed(It & first, It last);

                                                                                seeds a linear_congruential_engine with values taken from the itrator range [first, last) and adjusts first to point to the element after the last one used. If there are not enough elements, throws std::invalid_argument.

                                                                                first and last must be input iterators.

                                                                              5. -
                                                                                IntType operator()();
                                                                                +
                                                                                IntType operator()();

                                                                                Returns the next value of the linear_congruential_engine.

                                                                              6. -
                                                                                template<typename Iter> void generate(Iter first, Iter last);
                                                                                +
                                                                                template<typename Iter> void generate(Iter first, Iter last);

                                                                                Fills a range with random values

                                                                              7. -
                                                                                void discard(boost::uintmax_t z);
                                                                                +
                                                                                void discard(boost::uintmax_t z);

                                                                                Advances the state of the generator by z.

                                                                              -

                                                                              -linear_congruential_engine public static functions

                                                                              +

                                                                              +linear_congruential_engine public static functions

                                                                              1. -
                                                                                static result_type min();
                                                                                +
                                                                                static result_type min();

                                                                                Returns the smallest value that the linear_congruential_engine can produce.

                                                                              2. -
                                                                                static result_type max();
                                                                                +
                                                                                static result_type max();

                                                                                Returns the largest value that the linear_congruential_engine can produce.

                                                                              -

                                                                              -linear_congruential_engine friend functions

                                                                              +

                                                                              +linear_congruential_engine friend functions

                                                                              1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const linear_congruential_engine & lcg);

                                                                                Writes a linear_congruential_engine to a std::ostream. 

                                                                              2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
              linear_congruential_engine & lcg);

                                                                                Reads a linear_congruential_engine from a std::istream.

                                                                                3. diff --git a/doc/html/boost/random/linear_f_idm45507041557328.html b/doc/html/boost/random/linear_f_idm45507041557328.html new file mode 100644 index 0000000000..aa63ce4e4c --- /dev/null +++ b/doc/html/boost/random/linear_f_idm45507041557328.html @@ -0,0 +1,206 @@ + + + + +Class template linear_feedback_shift_engine + + + + + + + + + + + + + + + +
                                                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                +
                                                                                +
                                                                                +PrevUpHomeNext +
                                                                                +
                                                                                +
                                                                                +
                                                                                +

                                                                                Class template linear_feedback_shift_engine

                                                                                +

                                                                                boost::random::linear_feedback_shift_engine

                                                                                +
                                                                                +

                                                                                Synopsis

                                                                                +
                                                                                // In header: <boost/random/linear_feedback_shift.hpp>
+
+template<typename UIntType, int w, int k, int q, int s> 
+class linear_feedback_shift_engine {
+public:
+  // types
+  typedef UIntType result_type;
+
+  // construct/copy/destruct
+  linear_feedback_shift_engine();
+  explicit linear_feedback_shift_engine(UIntType);
+  template<typename SeedSeq> explicit linear_feedback_shift_engine(SeedSeq &);
+  template<typename It> linear_feedback_shift_engine(It &, It);
+
+  // public static functions
+  static result_type min();
+  static result_type max();
+
+  // public member functions
+  void seed();
+  void seed(UIntType);
+  template<typename SeedSeq> void seed(SeedSeq &);
+  template<typename It> void seed(It &, It);
+  result_type operator()();
+  template<typename Iter> void generate(Iter, Iter);
+  void discard(boost::uintmax_t);
+
+  // friend functions
+  template<typename CharT, typename Traits> 
+    friend std::basic_ostream< CharT, Traits > & 
+    operator<<(std::basic_ostream< CharT, Traits > &, 
+               const linear_feedback_shift_engine &);
+  template<typename CharT, typename Traits> 
+    friend std::basic_istream< CharT, Traits > & 
+    operator>>(std::basic_istream< CharT, Traits > &, 
+               const linear_feedback_shift_engine &);
+  friend bool operator==(const linear_feedback_shift_engine &, 
+                         const linear_feedback_shift_engine &);
+  friend bool operator!=(const linear_feedback_shift_engine &, 
+                         const linear_feedback_shift_engine &);
+
+  // public data members
+  static const bool has_fixed_range;
+  static const int word_size;
+  static const int exponent1;
+  static const int exponent2;
+  static const int step_size;
+  static const UIntType default_seed;
+};
                                                                                +
                                                                                +

                                                                                Description

                                                                                +

                                                                                Instatiations of linear_feedback_shift model a pseudo-random number generator . It was originally proposed in

                                                                                +

                                                                                +

                                                                                "Random numbers generated by linear recurrence modulo two.", Tausworthe, R. C.(1965), Mathematics of Computation 19, 201-209.

                                                                                +

                                                                                +
                                                                                +

                                                                                +linear_feedback_shift_engine + public + construct/copy/destruct

                                                                                +
                                                                                  +
                                                                                1. +
                                                                                  linear_feedback_shift_engine();
                                                                                  +

                                                                                  Constructs a linear_feedback_shift_engine, using the default seed.

                                                                                  +
                                                                                  2. +
                                                                                2. +
                                                                                  explicit linear_feedback_shift_engine(UIntType s0);
                                                                                  +

                                                                                  Constructs a linear_feedback_shift_engine, seeding it with s0.

                                                                                  +
                                                                                  3. +
                                                                                3. +
                                                                                  template<typename SeedSeq> 
+  explicit linear_feedback_shift_engine(SeedSeq & seq);
                                                                                  +

                                                                                  Constructs a linear_feedback_shift_engine, seeding it with seq.

                                                                                  +
                                                                                  4. +
                                                                                4. +
                                                                                  template<typename It> linear_feedback_shift_engine(It & first, It last);
                                                                                  +

                                                                                  Constructs a linear_feedback_shift_engine, seeding it with values from the range [first, last).

                                                                                  +
                                                                                  5. +
                                                                                +
                                                                                +
                                                                                +

                                                                                +linear_feedback_shift_engine public static functions

                                                                                +
                                                                                  +
                                                                                1. +
                                                                                  static result_type min();
                                                                                  +

                                                                                  Returns the smallest value that the generator can produce.

                                                                                  +
                                                                                  2. +
                                                                                2. +
                                                                                  static result_type max();
                                                                                  +

                                                                                  Returns the largest value that the generator can produce.

                                                                                  +
                                                                                  3. +
                                                                                +
                                                                                +
                                                                                +

                                                                                +linear_feedback_shift_engine public member functions

                                                                                +
                                                                                  +
                                                                                1. +
                                                                                  void seed();
                                                                                  +

                                                                                  Seeds a linear_feedback_shift_engine with the default seed.

                                                                                  +
                                                                                  2. +
                                                                                2. +
                                                                                  void seed(UIntType s0);
                                                                                  +

                                                                                  Seeds a linear_feedback_shift_engine with s0.

                                                                                  +
                                                                                  3. +
                                                                                3. +
                                                                                  template<typename SeedSeq> void seed(SeedSeq & seq);
                                                                                  +

                                                                                  Seeds a linear_feedback_shift_engine with values produced by seq.generate().

                                                                                  +
                                                                                  4. +
                                                                                4. +
                                                                                  template<typename It> void seed(It & first, It last);
                                                                                  +

                                                                                  Seeds a linear_feedback_shift_engine with values from the range [first, last).

                                                                                  +
                                                                                  5. +
                                                                                5. +
                                                                                  result_type operator()();
                                                                                  +

                                                                                  Returns the next value of the generator.

                                                                                  +
                                                                                  6. +
                                                                                6. +
                                                                                  template<typename Iter> void generate(Iter first, Iter last);
                                                                                  +

                                                                                  Fills a range with random values

                                                                                  +
                                                                                  7. +
                                                                                7. +
                                                                                  void discard(boost::uintmax_t z);
                                                                                  +

                                                                                  Advances the state of the generator by z.

                                                                                  +
                                                                                  8. +
                                                                                +
                                                                                +
                                                                                +

                                                                                +linear_feedback_shift_engine friend functions

                                                                                +
                                                                                  +
                                                                                1. +
                                                                                  template<typename CharT, typename Traits> 
+  friend std::basic_ostream< CharT, Traits > & 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
+             const linear_feedback_shift_engine & x);
                                                                                  +

                                                                                  Writes the textual representation of the generator to a std::ostream.

                                                                                  +
                                                                                  2. +
                                                                                2. +
                                                                                  template<typename CharT, typename Traits> 
+  friend std::basic_istream< CharT, Traits > & 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
+             const linear_feedback_shift_engine & x);
                                                                                  +

                                                                                  Reads the textual representation of the generator from a std::istream.

                                                                                  +
                                                                                  3. +
                                                                                3. +
                                                                                  friend bool operator==(const linear_feedback_shift_engine & x, 
+                       const linear_feedback_shift_engine & y);
                                                                                  +

                                                                                  Returns true if the two generators will produce identical sequences of outputs.

                                                                                  +
                                                                                  4. +
                                                                                4. +
                                                                                  friend bool operator!=(const linear_feedback_shift_engine & lhs, 
+                       const linear_feedback_shift_engine & rhs);
                                                                                  +

                                                                                  Returns true if the two generators will produce different sequences of outputs.

                                                                                  +
                                                                                  5. +
                                                                                +
                                                                                +
                                                                                +
                                                                                + + + +
                                                                                Copyright © 2000-2005 Jens Maurer
                                                                                Copyright © 2009, 2010 Steven Watanabe

                                                                                + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                +
                                                                                +
                                                                                +
                                                                                +PrevUpHomeNext +
                                                                                + + diff --git a/doc/html/boost/random/linear_feedba_idp109235664.html b/doc/html/boost/random/linear_feedba_idp109235664.html deleted file mode 100644 index 65addbb116..0000000000 --- a/doc/html/boost/random/linear_feedba_idp109235664.html +++ /dev/null @@ -1,206 +0,0 @@ - - - - -Class template linear_feedback_shift_engine - - - - - - - - - - - - - - - -
                                                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                -
                                                                                -
                                                                                -PrevUpHomeNext -
                                                                                -
                                                                                -
                                                                                -
                                                                                -

                                                                                Class template linear_feedback_shift_engine

                                                                                -

                                                                                boost::random::linear_feedback_shift_engine

                                                                                -
                                                                                -

                                                                                Synopsis

                                                                                -
                                                                                // In header: <boost/random/linear_feedback_shift.hpp>
-
-template<typename UIntType, int w, int k, int q, int s> 
-class linear_feedback_shift_engine {
-public:
-  // types
-  typedef UIntType result_type;
-
-  // construct/copy/destruct
-  linear_feedback_shift_engine();
-  explicit linear_feedback_shift_engine(UIntType);
-  template<typename SeedSeq> explicit linear_feedback_shift_engine(SeedSeq &);
-  template<typename It> linear_feedback_shift_engine(It &, It);
-
-  // public static functions
-  static result_type min();
-  static result_type max();
-
-  // public member functions
-  void seed();
-  void seed(UIntType);
-  template<typename SeedSeq> void seed(SeedSeq &);
-  template<typename It> void seed(It &, It);
-  result_type operator()();
-  template<typename Iter> void generate(Iter, Iter);
-  void discard(boost::uintmax_t);
-
-  // friend functions
-  template<typename CharT, typename Traits> 
-    friend std::basic_ostream< CharT, Traits > & 
-    operator<<(std::basic_ostream< CharT, Traits > &, 
-               const linear_feedback_shift_engine &);
-  template<typename CharT, typename Traits> 
-    friend std::basic_istream< CharT, Traits > & 
-    operator>>(std::basic_istream< CharT, Traits > &, 
-               const linear_feedback_shift_engine &);
-  friend bool operator==(const linear_feedback_shift_engine &, 
-                         const linear_feedback_shift_engine &);
-  friend bool operator!=(const linear_feedback_shift_engine &, 
-                         const linear_feedback_shift_engine &);
-
-  // public data members
-  static const bool has_fixed_range;
-  static const int word_size;
-  static const int exponent1;
-  static const int exponent2;
-  static const int step_size;
-  static const UIntType default_seed;
-};
                                                                                -
                                                                                -

                                                                                Description

                                                                                -

                                                                                Instatiations of linear_feedback_shift model a pseudo-random number generator . It was originally proposed in

                                                                                -

                                                                                -

                                                                                "Random numbers generated by linear recurrence modulo two.", Tausworthe, R. C.(1965), Mathematics of Computation 19, 201-209.

                                                                                -

                                                                                -
                                                                                -

                                                                                -linear_feedback_shift_engine - public - construct/copy/destruct

                                                                                -
                                                                                  -
                                                                                1. -
                                                                                  linear_feedback_shift_engine();
                                                                                  -

                                                                                  Constructs a linear_feedback_shift_engine, using the default seed.

                                                                                  -
                                                                                  2. -
                                                                                2. -
                                                                                  explicit linear_feedback_shift_engine(UIntType s0);
                                                                                  -

                                                                                  Constructs a linear_feedback_shift_engine, seeding it with s0.

                                                                                  -
                                                                                  3. -
                                                                                3. -
                                                                                  template<typename SeedSeq> 
-  explicit linear_feedback_shift_engine(SeedSeq & seq);
                                                                                  -

                                                                                  Constructs a linear_feedback_shift_engine, seeding it with seq.

                                                                                  -
                                                                                  4. -
                                                                                4. -
                                                                                  template<typename It> linear_feedback_shift_engine(It & first, It last);
                                                                                  -

                                                                                  Constructs a linear_feedback_shift_engine, seeding it with values from the range [first, last).

                                                                                  -
                                                                                  5. -
                                                                                -
                                                                                -
                                                                                -

                                                                                -linear_feedback_shift_engine public static functions

                                                                                -
                                                                                  -
                                                                                1. -
                                                                                  static result_type min();
                                                                                  -

                                                                                  Returns the smallest value that the generator can produce.

                                                                                  -
                                                                                  2. -
                                                                                2. -
                                                                                  static result_type max();
                                                                                  -

                                                                                  Returns the largest value that the generator can produce.

                                                                                  -
                                                                                  3. -
                                                                                -
                                                                                -
                                                                                -

                                                                                -linear_feedback_shift_engine public member functions

                                                                                -
                                                                                  -
                                                                                1. -
                                                                                  void seed();
                                                                                  -

                                                                                  Seeds a linear_feedback_shift_engine with the default seed.

                                                                                  -
                                                                                  2. -
                                                                                2. -
                                                                                  void seed(UIntType s0);
                                                                                  -

                                                                                  Seeds a linear_feedback_shift_engine with s0.

                                                                                  -
                                                                                  3. -
                                                                                3. -
                                                                                  template<typename SeedSeq> void seed(SeedSeq & seq);
                                                                                  -

                                                                                  Seeds a linear_feedback_shift_engine with values produced by seq.generate().

                                                                                  -
                                                                                  4. -
                                                                                4. -
                                                                                  template<typename It> void seed(It & first, It last);
                                                                                  -

                                                                                  Seeds a linear_feedback_shift_engine with values from the range [first, last).

                                                                                  -
                                                                                  5. -
                                                                                5. -
                                                                                  result_type operator()();
                                                                                  -

                                                                                  Returns the next value of the generator.

                                                                                  -
                                                                                  6. -
                                                                                6. -
                                                                                  template<typename Iter> void generate(Iter first, Iter last);
                                                                                  -

                                                                                  Fills a range with random values

                                                                                  -
                                                                                  7. -
                                                                                7. -
                                                                                  void discard(boost::uintmax_t z);
                                                                                  -

                                                                                  Advances the state of the generator by z.

                                                                                  -
                                                                                  8. -
                                                                                -
                                                                                -
                                                                                -

                                                                                -linear_feedback_shift_engine friend functions

                                                                                -
                                                                                  -
                                                                                1. -
                                                                                  template<typename CharT, typename Traits> 
-  friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
-             const linear_feedback_shift_engine & x);
                                                                                  -

                                                                                  Writes the textual representation of the generator to a std::ostream.

                                                                                  -
                                                                                  2. -
                                                                                2. -
                                                                                  template<typename CharT, typename Traits> 
-  friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
-             const linear_feedback_shift_engine & x);
                                                                                  -

                                                                                  Reads the textual representation of the generator from a std::istream.

                                                                                  -
                                                                                  3. -
                                                                                3. -
                                                                                  friend bool operator==(const linear_feedback_shift_engine & x, 
-                       const linear_feedback_shift_engine & y);
                                                                                  -

                                                                                  Returns true if the two generators will produce identical sequences of outputs.

                                                                                  -
                                                                                  4. -
                                                                                4. -
                                                                                  friend bool operator!=(const linear_feedback_shift_engine & lhs, 
-                       const linear_feedback_shift_engine & rhs);
                                                                                  -

                                                                                  Returns true if the two generators will produce different sequences of outputs.

                                                                                  -
                                                                                  5. -
                                                                                -
                                                                                -
                                                                                -
                                                                                - - - -
                                                                                Copyright © 2000-2005 Jens Maurer
                                                                                Copyright © 2009, 2010 Steven Watanabe

                                                                                - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                -
                                                                                -
                                                                                -
                                                                                -PrevUpHomeNext -
                                                                                - - diff --git a/doc/html/boost/random/lognormal_distribution.html b/doc/html/boost/random/lognormal_distribution.html index 06f791119c..d5dfc30c95 100644 --- a/doc/html/boost/random/lognormal_distribution.html +++ b/doc/html/boost/random/lognormal_distribution.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                                                                                -PrevUpHomeNext +PrevUpHomeNext
                                                                                @@ -47,56 +47,56 @@ typedef lognormal_distribution distribution_type; // construct/copy/destruct - explicit param_type(RealType = 0.0, RealType = 1.0); + explicit param_type(RealType = 0.0, RealType = 1.0); - // public member functions - RealType m() const; - RealType s() const; + // public member functions + RealType m() const; + RealType s() const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); + operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, const param_type &); - friend bool operator==(const param_type &, const param_type &); - friend bool operator!=(const param_type &, const param_type &); + operator>>(std::basic_istream< CharT, Traits > &, const param_type &); + friend bool operator==(const param_type &, const param_type &); + friend bool operator!=(const param_type &, const param_type &); }; // construct/copy/destruct - explicit lognormal_distribution(RealType = 0.0, RealType = 1.0); - explicit lognormal_distribution(const param_type &); + explicit lognormal_distribution(RealType = 0.0, RealType = 1.0); + explicit lognormal_distribution(const param_type &); - // public member functions - RealType m() const; - RealType s() const; - RealType min() const; - RealType max() const; - param_type param() const; - void param(const param_type &); - void reset(); - template<typename Engine> result_type operator()(Engine &); + // public member functions + RealType m() const; + RealType s() const; + RealType min() const; + RealType max() const; + param_type param() const; + void param(const param_type &); + void reset(); + template<typename Engine> result_type operator()(Engine &); template<typename Engine> - result_type operator()(Engine &, const param_type &); + result_type operator()(Engine &, const param_type &); - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, + operator<<(std::basic_ostream< CharT, Traits > &, const lognormal_distribution &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, + operator>>(std::basic_istream< CharT, Traits > &, const lognormal_distribution &); - friend bool operator==(const lognormal_distribution &, + friend bool operator==(const lognormal_distribution &, const lognormal_distribution &); - friend bool operator!=(const lognormal_distribution &, + friend bool operator!=(const lognormal_distribution &, const lognormal_distribution &); };
                                                                                -

                                                                                Description

                                                                                -

                                                                                Instantiations of class template lognormal_distribution model a random distribution . Such a distribution produces random numbers with for x > 0.

                                                                                +

                                                                                Description

                                                                                +

                                                                                Instantiations of class template lognormal_distribution model a random distribution . Such a distribution produces random numbers with for x > 0.

                                                                                @@ -107,89 +107,89 @@

                                                                                -

                                                                                +

                                                                                lognormal_distribution public construct/copy/destruct

                                                                                1. -
                                                                                  explicit lognormal_distribution(RealType m = 0.0, RealType s = 1.0);
                                                                                  +
                                                                                  explicit lognormal_distribution(RealType m = 0.0, RealType s = 1.0);

                                                                                  Constructs a lognormal_distribution. m and s are the parameters of the distribution.

                                                                                2. -
                                                                                  explicit lognormal_distribution(const param_type & param);
                                                                                  +
                                                                                  explicit lognormal_distribution(const param_type & param);

                                                                                  Constructs a lognormal_distribution from its parameters.

                                                                                -

                                                                                -lognormal_distribution public member functions

                                                                                +

                                                                                +lognormal_distribution public member functions

                                                                                1. -
                                                                                  RealType m() const;
                                                                                  +
                                                                                  RealType m() const;

                                                                                  Returns the m parameter of the distribution.

                                                                                2. -
                                                                                  RealType s() const;
                                                                                  +
                                                                                  RealType s() const;

                                                                                  Returns the s parameter of the distribution.

                                                                                3. -
                                                                                  RealType min() const;
                                                                                  +
                                                                                  RealType min() const;

                                                                                  Returns the smallest value that the distribution can produce.

                                                                                4. -
                                                                                  RealType max() const;
                                                                                  +
                                                                                  RealType max() const;

                                                                                  Returns the largest value that the distribution can produce.

                                                                                5. -
                                                                                  param_type param() const;
                                                                                  +
                                                                                  param_type param() const;

                                                                                  Returns the parameters of the distribution.

                                                                                6. -
                                                                                  void param(const param_type & param);
                                                                                  +
                                                                                  void param(const param_type & param);

                                                                                  Sets the parameters of the distribution.

                                                                                7. -
                                                                                  void reset();
                                                                                  +
                                                                                  void reset();

                                                                                  Effects: Subsequent uses of the distribution do not depend on values produced by any engine prior to invoking reset.

                                                                                8. -
                                                                                  template<typename Engine> result_type operator()(Engine & eng);
                                                                                  +
                                                                                  template<typename Engine> result_type operator()(Engine & eng);

                                                                                  Returns a random variate distributed according to the lognormal distribution. 

                                                                                9. template<typename Engine> 
-  result_type operator()(Engine & eng, const param_type & param);
                                                                                  + result_type operator()(Engine & eng, const param_type & param);

                                                                                  Returns a random variate distributed according to the lognormal distribution with parameters specified by param.

                                                                                -

                                                                                -lognormal_distribution friend functions

                                                                                +

                                                                                +lognormal_distribution friend functions

                                                                                1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const lognormal_distribution & ld);

                                                                                  Writes the distribution to a std::ostream. 

                                                                                2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
              const lognormal_distribution & ld);

                                                                                  Reads the distribution from a std::istream.

                                                                                3. -
                                                                                  friend bool operator==(const lognormal_distribution & lhs, 
+
                                                                                  friend bool operator==(const lognormal_distribution & lhs, 
                        const lognormal_distribution & rhs);
                                                                                  
 
                                                                                  Returns true if the two distributions will produce identical sequences of values given equal generators.
                                                                                4. -
                                                                                  friend bool operator!=(const lognormal_distribution & lhs, 
+
                                                                                  friend bool operator!=(const lognormal_distribution & lhs, 
                        const lognormal_distribution & rhs);
                                                                                  
 
                                                                                  Returns true if the two distributions may produce different sequences of values given equal generators.
                                                                                  5. @@ -207,7 +207,7 @@
                                                                                  -PrevUpHomeNext +PrevUpHomeNext
                                                                                  diff --git a/doc/html/boost/random/lognormal_distribution/param_type.html b/doc/html/boost/random/lognormal_distribution/param_type.html index 1550ed1f4e..fcfca07088 100644 --- a/doc/html/boost/random/lognormal_distribution/param_type.html +++ b/doc/html/boost/random/lognormal_distribution/param_type.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                                                                  -PrevUpHomeNext +PrevUpHomeNext
                                                                                  @@ -40,72 +40,72 @@ typedef lognormal_distribution distribution_type; // construct/copy/destruct - explicit param_type(RealType = 0.0, RealType = 1.0); + explicit param_type(RealType = 0.0, RealType = 1.0); - // public member functions - RealType m() const; - RealType s() const; + // public member functions + RealType m() const; + RealType s() const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); + operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, const param_type &); - friend bool operator==(const param_type &, const param_type &); - friend bool operator!=(const param_type &, const param_type &); + operator>>(std::basic_istream< CharT, Traits > &, const param_type &); + friend bool operator==(const param_type &, const param_type &); + friend bool operator!=(const param_type &, const param_type &); };
                                                                                  -

                                                                                  Description

                                                                                  +

                                                                                  Description

                                                                                  -

                                                                                  +

                                                                                  param_type public construct/copy/destruct

                                                                                  1. -
                                                                                    explicit param_type(RealType m = 0.0, RealType s = 1.0);
                                                                                    +
                                                                                    explicit param_type(RealType m = 0.0, RealType s = 1.0);

                                                                                    Constructs the parameters of a lognormal_distribution.

                                                                                  -

                                                                                  -param_type public member functions

                                                                                  +

                                                                                  +param_type public member functions

                                                                                  1. -
                                                                                    RealType m() const;
                                                                                    +
                                                                                    RealType m() const;

                                                                                    Returns the "m" parameter of the distribution.

                                                                                  2. -
                                                                                    RealType s() const;
                                                                                    +
                                                                                    RealType s() const;

                                                                                    Returns the "s" parameter of the distribution.

                                                                                  -

                                                                                  -param_type friend functions

                                                                                  +

                                                                                  +param_type friend functions

                                                                                  1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const param_type & param);

                                                                                    Writes the parameters to a std::ostream. 

                                                                                  2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
              const param_type & param);

                                                                                    Reads the parameters from a std::istream.

                                                                                  3. -
                                                                                    friend bool operator==(const param_type & lhs, const param_type & rhs);
                                                                                    +
                                                                                    friend bool operator==(const param_type & lhs, const param_type & rhs);

                                                                                    Returns true if the two sets of parameters are equal.

                                                                                  4. -
                                                                                    friend bool operator!=(const param_type & lhs, const param_type & rhs);
                                                                                    +
                                                                                    friend bool operator!=(const param_type & lhs, const param_type & rhs);

                                                                                    Returns true if the two sets of parameters are different.

                                                                                  @@ -122,7 +122,7 @@
                                                                                  -PrevUpHomeNext +PrevUpHomeNext
                                                                                  diff --git a/doc/html/boost/random/mersenne_twister_engine.html b/doc/html/boost/random/mersenne_twister_engine.html index 238867961f..f998c71eca 100644 --- a/doc/html/boost/random/mersenne_twister_engine.html +++ b/doc/html/boost/random/mersenne_twister_engine.html @@ -41,36 +41,36 @@ typedef UIntType result_type; // construct/copy/destruct - mersenne_twister_engine(); - explicit mersenne_twister_engine(UIntType); - template<typename It> mersenne_twister_engine(It &, It); - template<typename SeedSeq> explicit mersenne_twister_engine(SeedSeq &); + mersenne_twister_engine(); + explicit mersenne_twister_engine(UIntType); + template<typename It> mersenne_twister_engine(It &, It); + template<typename SeedSeq> explicit mersenne_twister_engine(SeedSeq &); - // public member functions - void seed(); - void seed(UIntType); - template<typename SeeqSeq> void seed(SeeqSeq &); - template<typename It> void seed(It &, It); - result_type operator()(); - template<typename Iter> void generate(Iter, Iter); - void discard(boost::uintmax_t); + // public member functions + void seed(); + void seed(UIntType); + template<typename SeeqSeq> void seed(SeeqSeq &); + template<typename It> void seed(It &, It); + result_type operator()(); + template<typename Iter> void generate(Iter, Iter); + void discard(boost::uintmax_t); - // public static functions - static result_type min(); - static result_type max(); + // public static functions + static result_type min(); + static result_type max(); - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, + operator<<(std::basic_ostream< CharT, Traits > &, const mersenne_twister_engine &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, + operator>>(std::basic_istream< CharT, Traits > &, mersenne_twister_engine &); - friend bool operator==(const mersenne_twister_engine &, + friend bool operator==(const mersenne_twister_engine &, const mersenne_twister_engine &); - friend bool operator!=(const mersenne_twister_engine &, + friend bool operator!=(const mersenne_twister_engine &, const mersenne_twister_engine &); // public data members @@ -98,7 +98,7 @@ static const bool has_fixed_range; };
                                                                                  -

                                                                                  Description

                                                                                  +

                                                                                  Description

                                                                                  Instantiations of class template mersenne_twister_engine model a pseudo-random number generator . It uses the algorithm described in

                                                                                  "Mersenne Twister: A 623-dimensionally equidistributed uniform @@ -117,22 +117,22 @@

                                                                                  The quality of the generator crucially depends on the choice of the parameters. User code should employ one of the sensibly parameterized generators such as mt19937 instead.

                                                                                  The generator requires considerable amounts of memory for the storage of its state array. For example, mt11213b requires about 1408 bytes and mt19937 requires about 2496 bytes.

                                                                                  -

                                                                                  +

                                                                                  mersenne_twister_engine public construct/copy/destruct

                                                                                  1. -
                                                                                    mersenne_twister_engine();
                                                                                    +
                                                                                    mersenne_twister_engine();

                                                                                    Constructs a mersenne_twister_engine and calls seed().

                                                                                  2. -
                                                                                    explicit mersenne_twister_engine(UIntType value);
                                                                                    +
                                                                                    explicit mersenne_twister_engine(UIntType value);

                                                                                    Constructs a mersenne_twister_engine and calls seed(value).

                                                                                    3. -
                                                                                  3. template<typename It> mersenne_twister_engine(It & first, It last);
                                                                                    4. +
                                                                                  4. template<typename It> mersenne_twister_engine(It & first, It last);
                                                                                  5. -
                                                                                    template<typename SeedSeq> explicit mersenne_twister_engine(SeedSeq & seq);
                                                                                    +
                                                                                    template<typename SeedSeq> explicit mersenne_twister_engine(SeedSeq & seq);

                                                                                    Constructs a mersenne_twister_engine and calls seed(gen).

                                                                                    @@ -147,35 +147,35 @@
                                                                                    -

                                                                                    -mersenne_twister_engine public member functions

                                                                                    +

                                                                                    +mersenne_twister_engine public member functions

                                                                                    1. -
                                                                                      void seed();
                                                                                      +
                                                                                      void seed();

                                                                                      Calls seed(default_seed).

                                                                                    2. -
                                                                                      void seed(UIntType value);
                                                                                      +
                                                                                      void seed(UIntType value);

                                                                                      Sets the state x(0) to v mod 2w. Then, iteratively, sets x(i) to (i + f * (x(i-1) xor (x(i-1) rshift w-2))) mod 2w for i = 1 .. n-1. x(n) is the first value to be returned by operator().

                                                                                    3. -
                                                                                      template<typename SeeqSeq> void seed(SeeqSeq & seq);
                                                                                      +
                                                                                      template<typename SeeqSeq> void seed(SeeqSeq & seq);

                                                                                      Seeds a mersenne_twister_engine using values produced by seq.generate().

                                                                                    4. -
                                                                                      template<typename It> void seed(It & first, It last);
                                                                                      +
                                                                                      template<typename It> void seed(It & first, It last);

                                                                                      Sets the state of the generator using values from an iterator range.

                                                                                    5. -
                                                                                      result_type operator()();
                                                                                      +
                                                                                      result_type operator()();

                                                                                      Produces the next value of the generator.

                                                                                    6. -
                                                                                      template<typename Iter> void generate(Iter first, Iter last);
                                                                                      +
                                                                                      template<typename Iter> void generate(Iter first, Iter last);

                                                                                      Fills a range with random values

                                                                                    7. -
                                                                                      void discard(boost::uintmax_t z);
                                                                                      +
                                                                                      void discard(boost::uintmax_t z);

                                                                                      Advances the state of the generator by z steps. Equivalent to

                                                                                      for(unsigned long long i = 0; i < z; ++i) {
     gen();
@@ -186,44 +186,44 @@
                                                                                    -

                                                                                    -mersenne_twister_engine public static functions

                                                                                    +

                                                                                    +mersenne_twister_engine public static functions

                                                                                    1. -
                                                                                      static result_type min();
                                                                                      +
                                                                                      static result_type min();

                                                                                      Returns the smallest value that the generator can produce.

                                                                                    2. -
                                                                                      static result_type max();
                                                                                      +
                                                                                      static result_type max();

                                                                                      Returns the largest value that the generator can produce.

                                                                                    -

                                                                                    -mersenne_twister_engine friend functions

                                                                                    +

                                                                                    +mersenne_twister_engine friend functions

                                                                                    1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const mersenne_twister_engine & mt);

                                                                                      Writes a mersenne_twister_engine to a std::ostream 

                                                                                    2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
              mersenne_twister_engine & mt);

                                                                                      Reads a mersenne_twister_engine from a std::istream

                                                                                    3. -
                                                                                      friend bool operator==(const mersenne_twister_engine & x_, 
+
                                                                                      friend bool operator==(const mersenne_twister_engine & x_, 
                        const mersenne_twister_engine & y_);
                                                                                      
 
                                                                                      Returns true if the two generators are in the same state, and will thus produce identical sequences.
                                                                                    4. -
                                                                                      friend bool operator!=(const mersenne_twister_engine & x_, 
+
                                                                                      friend bool operator!=(const mersenne_twister_engine & x_, 
                        const mersenne_twister_engine & y_);
                                                                                      
 
                                                                                      Returns true if the two generators are in different states.
                                                                                      5. diff --git a/doc/html/boost/random/minstd_rand.html b/doc/html/boost/random/minstd_rand.html index 84f1b8dc5f..058f2224a3 100644 --- a/doc/html/boost/random/minstd_rand.html +++ b/doc/html/boost/random/minstd_rand.html @@ -8,7 +8,7 @@ - +
                                                                                    @@ -21,7 +21,7 @@
                                                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                                                    @@ -35,7 +35,7 @@ typedef linear_congruential_engine< uint32_t, 48271, 0, 2147483647 > minstd_rand;
                                                                                    -

                                                                                    Description

                                                                                    +

                                                                                    Description

                                                                                    The specialization minstd_rand was suggested in

                                                                                    "Random Number Generators: Good ones are hard to find", Stephen K. Park and Keith W. Miller, Communications of the ACM, Vol. 31, No. 10, October 1988, pp. 1192-1201

                                                                                    @@ -52,7 +52,7 @@
                                                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                                                    diff --git a/doc/html/boost/random/minstd_rand0.html b/doc/html/boost/random/minstd_rand0.html index c173f873a4..70f1bfab73 100644 --- a/doc/html/boost/random/minstd_rand0.html +++ b/doc/html/boost/random/minstd_rand0.html @@ -35,7 +35,7 @@ typedef linear_congruential_engine< uint32_t, 16807, 0, 2147483647 > minstd_rand0;
                                                                                    -

                                                                                    Description

                                                                                    +

                                                                                    Description

                                                                                    The specialization minstd_rand0 was originally suggested in

                                                                                    A pseudo-random number generator for the System/360, P.A. Lewis, A.S. Goodman, J.M. Miller, IBM Systems Journal, Vol. 8, No. 2, 1969, pp. 136-146

                                                                                    diff --git a/doc/html/boost/random/mt11213b.html b/doc/html/boost/random/mt11213b.html index f5fc7bff10..9d8b427a25 100644 --- a/doc/html/boost/random/mt11213b.html +++ b/doc/html/boost/random/mt11213b.html @@ -35,7 +35,7 @@ typedef mersenne_twister_engine< uint32_t, 32, 351, 175, 19, 0xccab8ee7, 11, 0xffffffff, 7, 0x31b6ab00, 15, 0xffe50000, 17, 1812433253 > mt11213b;
                                                                                    -

                                                                                    Description

                                                                                    +

                                                                                    Description

                                                                                    The specializations mt11213b and mt19937 are from

                                                                                    "Mersenne Twister: A 623-dimensionally equidistributed diff --git a/doc/html/boost/random/mt19937.html b/doc/html/boost/random/mt19937.html index 21c382caa6..f6a62b6f29 100644 --- a/doc/html/boost/random/mt19937.html +++ b/doc/html/boost/random/mt19937.html @@ -35,7 +35,7 @@ typedef mersenne_twister_engine< uint32_t, 32, 624, 397, 31, 0x9908b0df, 11, 0xffffffff, 7, 0x9d2c5680, 15, 0xefc60000, 18, 1812433253 > mt19937;

                                                                                    -

                                                                                    Description

                                                                                    +

                                                                                    Description

                                                                                    The specializations mt11213b and mt19937 are from

                                                                                    "Mersenne Twister: A 623-dimensionally equidistributed diff --git a/doc/html/boost/random/negative_binom_idp94123888.html b/doc/html/boost/random/negative_binom_idp94123888.html deleted file mode 100644 index aaf2c70c55..0000000000 --- a/doc/html/boost/random/negative_binom_idp94123888.html +++ /dev/null @@ -1,206 +0,0 @@ - - - - -Class template negative_binomial_distribution - - - - - - - - - - - - - - - -
                                                                                    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                    -

                                                                                    -
                                                                                    -PrevUpHomeNext -
                                                                                    -
                                                                                    -
                                                                                    -
                                                                                    -

                                                                                    Class template negative_binomial_distribution

                                                                                    -

                                                                                    boost::random::negative_binomial_distribution

                                                                                    -
                                                                                    -

                                                                                    Synopsis

                                                                                    -
                                                                                    // In header: <boost/random/negative_binomial_distribution.hpp>
-
-template<typename IntType = int, typename RealType = double> 
-class negative_binomial_distribution {
-public:
-  // types
-  typedef IntType  result_type;
-  typedef RealType input_type; 
-
-  // member classes/structs/unions
-
-  class param_type {
-  public:
-    // types
-    typedef negative_binomial_distribution distribution_type;
-
-    // construct/copy/destruct
-    explicit param_type(IntType = 1, RealType = 0.5);
-
-    // public member functions
-    IntType k() const;
-    RealType p() const;
-
-    // friend functions
-    template<typename CharT, typename Traits> 
-      friend std::basic_ostream< CharT, Traits > & 
-      operator<<(std::basic_ostream< CharT, Traits > &, const param_type &);
-    template<typename CharT, typename Traits> 
-      friend std::basic_istream< CharT, Traits > & 
-      operator>>(std::basic_istream< CharT, Traits > &, param_type &);
-    friend bool operator==(const param_type &, const param_type &);
-    friend bool operator!=(const param_type &, const param_type &);
-  };
-
-  // construct/copy/destruct
-  explicit negative_binomial_distribution(IntType = 1, RealType = 0.5);
-  explicit negative_binomial_distribution(const param_type &);
-
-  // public member functions
-  template<typename URNG> IntType operator()(URNG &) const;
-  template<typename URNG> IntType operator()(URNG &, const param_type &) const;
-  IntType k() const;
-  RealType p() const;
-  IntType min() const;
-  IntType max() const;
-  param_type param() const;
-  void param(const param_type &);
-  void reset();
-
-  // friend functions
-  template<typename CharT, typename Traits> 
-    friend std::basic_ostream< CharT, Traits > & 
-    operator<<(std::basic_ostream< CharT, Traits > &, 
-               const negative_binomial_distribution &);
-  template<typename CharT, typename Traits> 
-    friend std::basic_istream< CharT, Traits > & 
-    operator>>(std::basic_istream< CharT, Traits > &, 
-               negative_binomial_distribution &);
-  friend bool operator==(const negative_binomial_distribution &, 
-                         const negative_binomial_distribution &);
-  friend bool operator!=(const negative_binomial_distribution &, 
-                         const negative_binomial_distribution &);
-};
                                                                                    -
                                                                                    -

                                                                                    Description

                                                                                    -

                                                                                    The negative binomial distribution is an integer valued distribution with two parameters, k and p. The distribution produces non-negative values.

                                                                                    -

                                                                                    The distribution function is .

                                                                                    -

                                                                                    This implementation uses a gamma-poisson mixture.

                                                                                    -
                                                                                    -

                                                                                    -negative_binomial_distribution - public - construct/copy/destruct

                                                                                    -
                                                                                      -
                                                                                    1. -
                                                                                      explicit negative_binomial_distribution(IntType k = 1, RealType p = 0.5);
                                                                                      -

                                                                                      Construct a negative_binomial_distribution object. k and p are the parameters of the distribution.

                                                                                      -

                                                                                      Requires: k >=0 && 0 <= p <= 1

                                                                                      -
                                                                                      2. -
                                                                                    2. -
                                                                                      explicit negative_binomial_distribution(const param_type & param);
                                                                                      -

                                                                                      Construct an negative_binomial_distribution object from the parameters.

                                                                                      -
                                                                                      3. -
                                                                                    -
                                                                                    -
                                                                                    -

                                                                                    -negative_binomial_distribution public member functions

                                                                                    -
                                                                                      -
                                                                                    1. -
                                                                                      template<typename URNG> IntType operator()(URNG & urng) const;
                                                                                      -

                                                                                      Returns a random variate distributed according to the negative binomial distribution.

                                                                                      -
                                                                                      2. -
                                                                                    2. -
                                                                                      template<typename URNG> 
-  IntType operator()(URNG & urng, const param_type & param) const;
                                                                                      -

                                                                                      Returns a random variate distributed according to the negative binomial distribution with parameters specified by param.

                                                                                      -
                                                                                      3. -
                                                                                    3. -
                                                                                      IntType k() const;
                                                                                      -

                                                                                      Returns the k parameter of the distribution.

                                                                                      -
                                                                                      4. -
                                                                                    4. -
                                                                                      RealType p() const;
                                                                                      -

                                                                                      Returns the p parameter of the distribution.

                                                                                      -
                                                                                      5. -
                                                                                    5. -
                                                                                      IntType min() const;
                                                                                      -

                                                                                      Returns the smallest value that the distribution can produce.

                                                                                      -
                                                                                      6. -
                                                                                    6. -
                                                                                      IntType max() const;
                                                                                      -

                                                                                      Returns the largest value that the distribution can produce.

                                                                                      -
                                                                                      7. -
                                                                                    7. -
                                                                                      param_type param() const;
                                                                                      -

                                                                                      Returns the parameters of the distribution.

                                                                                      -
                                                                                      8. -
                                                                                    8. -
                                                                                      void param(const param_type & param);
                                                                                      -

                                                                                      Sets parameters of the distribution.

                                                                                      -
                                                                                      9. -
                                                                                    9. -
                                                                                      void reset();
                                                                                      -

                                                                                      Effects: Subsequent uses of the distribution do not depend on values produced by any engine prior to invoking reset.

                                                                                      -
                                                                                      10. -
                                                                                    -
                                                                                    -
                                                                                    -

                                                                                    -negative_binomial_distribution friend functions

                                                                                    -
                                                                                      -
                                                                                    1. -
                                                                                      template<typename CharT, typename Traits> 
-  friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
-             const negative_binomial_distribution & bd);
                                                                                      -

                                                                                      Writes the parameters of the distribution to a std::ostream.

                                                                                      -
                                                                                      2. -
                                                                                    2. -
                                                                                      template<typename CharT, typename Traits> 
-  friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
-             negative_binomial_distribution & bd);
                                                                                      -

                                                                                      Reads the parameters of the distribution from a std::istream.

                                                                                      -
                                                                                      3. -
                                                                                    3. -
                                                                                      friend bool operator==(const negative_binomial_distribution & lhs, 
-                       const negative_binomial_distribution & rhs);
                                                                                      -

                                                                                      Returns true if the two distributions will produce the same sequence of values, given equal generators.

                                                                                      -
                                                                                      4. -
                                                                                    4. -
                                                                                      friend bool operator!=(const negative_binomial_distribution & lhs, 
-                       const negative_binomial_distribution & rhs);
                                                                                      -

                                                                                      Returns true if the two distributions could produce different sequences of values, given equal generators.

                                                                                      -
                                                                                      5. -
                                                                                    -
                                                                                    -
                                                                                    -
                                                                                    - - - -
                                                                                    Copyright © 2000-2005 Jens Maurer
                                                                                    Copyright © 2009, 2010 Steven Watanabe

                                                                                    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                    -
                                                                                    -
                                                                                    -
                                                                                    -PrevUpHomeNext -
                                                                                    - - diff --git a/doc/html/boost/random/negative_binom_idp94123888/param_type.html b/doc/html/boost/random/negative_binom_idp94123888/param_type.html deleted file mode 100644 index 86e2cee2ba..0000000000 --- a/doc/html/boost/random/negative_binom_idp94123888/param_type.html +++ /dev/null @@ -1,128 +0,0 @@ - - - - -Class param_type - - - - - - - - - - - - - - - -
                                                                                    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                    -
                                                                                    -
                                                                                    -PrevUpHomeNext -
                                                                                    -
                                                                                    -
                                                                                    -
                                                                                    -

                                                                                    Class param_type

                                                                                    -

                                                                                    boost::random::negative_binomial_distribution::param_type

                                                                                    -
                                                                                    -

                                                                                    Synopsis

                                                                                    -
                                                                                    // In header: <boost/random/negative_binomial_distribution.hpp>
-
-
-
-class param_type {
-public:
-  // types
-  typedef negative_binomial_distribution distribution_type;
-
-  // construct/copy/destruct
-  explicit param_type(IntType = 1, RealType = 0.5);
-
-  // public member functions
-  IntType k() const;
-  RealType p() const;
-
-  // friend functions
-  template<typename CharT, typename Traits> 
-    friend std::basic_ostream< CharT, Traits > & 
-    operator<<(std::basic_ostream< CharT, Traits > &, const param_type &);
-  template<typename CharT, typename Traits> 
-    friend std::basic_istream< CharT, Traits > & 
-    operator>>(std::basic_istream< CharT, Traits > &, param_type &);
-  friend bool operator==(const param_type &, const param_type &);
-  friend bool operator!=(const param_type &, const param_type &);
-};
                                                                                    -
                                                                                    -

                                                                                    Description

                                                                                    -
                                                                                    -

                                                                                    -param_type - public - construct/copy/destruct

                                                                                    -
                                                                                    1. -
                                                                                      explicit param_type(IntType k = 1, RealType p = 0.5);
                                                                                      -

                                                                                      Construct a param_type object. k and p are the parameters of the distribution.

                                                                                      -

                                                                                      Requires: k >=0 && 0 <= p <= 1

                                                                                      -
                                                                                    -
                                                                                    -
                                                                                    -

                                                                                    -param_type public member functions

                                                                                    -
                                                                                      -
                                                                                    1. -
                                                                                      IntType k() const;
                                                                                      -

                                                                                      Returns the k parameter of the distribution.

                                                                                      -
                                                                                      2. -
                                                                                    2. -
                                                                                      RealType p() const;
                                                                                      -

                                                                                      Returns the p parameter of the distribution.

                                                                                      -
                                                                                      3. -
                                                                                    -
                                                                                    -
                                                                                    -

                                                                                    -param_type friend functions

                                                                                    -
                                                                                      -
                                                                                    1. -
                                                                                      template<typename CharT, typename Traits> 
-  friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
-             const param_type & param);
                                                                                      -

                                                                                      Writes the parameters of the distribution to a std::ostream.

                                                                                      -
                                                                                      2. -
                                                                                    2. -
                                                                                      template<typename CharT, typename Traits> 
-  friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, param_type & param);
                                                                                      -

                                                                                      Reads the parameters of the distribution from a std::istream.

                                                                                      -
                                                                                      3. -
                                                                                    3. -
                                                                                      friend bool operator==(const param_type & lhs, const param_type & rhs);
                                                                                      -

                                                                                      Returns true if the parameters have the same values.

                                                                                      -
                                                                                      4. -
                                                                                    4. -
                                                                                      friend bool operator!=(const param_type & lhs, const param_type & rhs);
                                                                                      -

                                                                                      Returns true if the parameters have different values.

                                                                                      -
                                                                                      5. -
                                                                                    -
                                                                                    -
                                                                                    -
                                                                                    - - - -
                                                                                    Copyright © 2000-2005 Jens Maurer
                                                                                    Copyright © 2009, 2010 Steven Watanabe

                                                                                    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                    -
                                                                                    -
                                                                                    -
                                                                                    -PrevUpHomeNext -
                                                                                    - - diff --git a/doc/html/boost/random/negative_idm45506979396656.html b/doc/html/boost/random/negative_idm45506979396656.html new file mode 100644 index 0000000000..4303761796 --- /dev/null +++ b/doc/html/boost/random/negative_idm45506979396656.html @@ -0,0 +1,206 @@ + + + + +Class template negative_binomial_distribution + + + + + + + + + + + + + + + +
                                                                                    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                    +
                                                                                    +
                                                                                    +PrevUpHomeNext +
                                                                                    +
                                                                                    +
                                                                                    +
                                                                                    +

                                                                                    Class template negative_binomial_distribution

                                                                                    +

                                                                                    boost::random::negative_binomial_distribution

                                                                                    +
                                                                                    +

                                                                                    Synopsis

                                                                                    +
                                                                                    // In header: <boost/random/negative_binomial_distribution.hpp>
+
+template<typename IntType = int, typename RealType = double> 
+class negative_binomial_distribution {
+public:
+  // types
+  typedef IntType  result_type;
+  typedef RealType input_type; 
+
+  // member classes/structs/unions
+
+  class param_type {
+  public:
+    // types
+    typedef negative_binomial_distribution distribution_type;
+
+    // construct/copy/destruct
+    explicit param_type(IntType = 1, RealType = 0.5);
+
+    // public member functions
+    IntType k() const;
+    RealType p() const;
+
+    // friend functions
+    template<typename CharT, typename Traits> 
+      friend std::basic_ostream< CharT, Traits > & 
+      operator<<(std::basic_ostream< CharT, Traits > &, const param_type &);
+    template<typename CharT, typename Traits> 
+      friend std::basic_istream< CharT, Traits > & 
+      operator>>(std::basic_istream< CharT, Traits > &, param_type &);
+    friend bool operator==(const param_type &, const param_type &);
+    friend bool operator!=(const param_type &, const param_type &);
+  };
+
+  // construct/copy/destruct
+  explicit negative_binomial_distribution(IntType = 1, RealType = 0.5);
+  explicit negative_binomial_distribution(const param_type &);
+
+  // public member functions
+  template<typename URNG> IntType operator()(URNG &) const;
+  template<typename URNG> IntType operator()(URNG &, const param_type &) const;
+  IntType k() const;
+  RealType p() const;
+  IntType min() const;
+  IntType max() const;
+  param_type param() const;
+  void param(const param_type &);
+  void reset();
+
+  // friend functions
+  template<typename CharT, typename Traits> 
+    friend std::basic_ostream< CharT, Traits > & 
+    operator<<(std::basic_ostream< CharT, Traits > &, 
+               const negative_binomial_distribution &);
+  template<typename CharT, typename Traits> 
+    friend std::basic_istream< CharT, Traits > & 
+    operator>>(std::basic_istream< CharT, Traits > &, 
+               negative_binomial_distribution &);
+  friend bool operator==(const negative_binomial_distribution &, 
+                         const negative_binomial_distribution &);
+  friend bool operator!=(const negative_binomial_distribution &, 
+                         const negative_binomial_distribution &);
+};
                                                                                    +
                                                                                    +

                                                                                    Description

                                                                                    +

                                                                                    The negative binomial distribution is an integer valued distribution with two parameters, k and p. The distribution produces non-negative values.

                                                                                    +

                                                                                    The distribution function is .

                                                                                    +

                                                                                    This implementation uses a gamma-poisson mixture.

                                                                                    +
                                                                                    +

                                                                                    +negative_binomial_distribution + public + construct/copy/destruct

                                                                                    +
                                                                                      +
                                                                                    1. +
                                                                                      explicit negative_binomial_distribution(IntType k = 1, RealType p = 0.5);
                                                                                      +

                                                                                      Construct a negative_binomial_distribution object. k and p are the parameters of the distribution.

                                                                                      +

                                                                                      Requires: k >=0 && 0 <= p <= 1

                                                                                      +
                                                                                      2. +
                                                                                    2. +
                                                                                      explicit negative_binomial_distribution(const param_type & param);
                                                                                      +

                                                                                      Construct an negative_binomial_distribution object from the parameters.

                                                                                      +
                                                                                      3. +
                                                                                    +
                                                                                    +
                                                                                    +

                                                                                    +negative_binomial_distribution public member functions

                                                                                    +
                                                                                      +
                                                                                    1. +
                                                                                      template<typename URNG> IntType operator()(URNG & urng) const;
                                                                                      +

                                                                                      Returns a random variate distributed according to the negative binomial distribution.

                                                                                      +
                                                                                      2. +
                                                                                    2. +
                                                                                      template<typename URNG> 
+  IntType operator()(URNG & urng, const param_type & param) const;
                                                                                      +

                                                                                      Returns a random variate distributed according to the negative binomial distribution with parameters specified by param.

                                                                                      +
                                                                                      3. +
                                                                                    3. +
                                                                                      IntType k() const;
                                                                                      +

                                                                                      Returns the k parameter of the distribution.

                                                                                      +
                                                                                      4. +
                                                                                    4. +
                                                                                      RealType p() const;
                                                                                      +

                                                                                      Returns the p parameter of the distribution.

                                                                                      +
                                                                                      5. +
                                                                                    5. +
                                                                                      IntType min() const;
                                                                                      +

                                                                                      Returns the smallest value that the distribution can produce.

                                                                                      +
                                                                                      6. +
                                                                                    6. +
                                                                                      IntType max() const;
                                                                                      +

                                                                                      Returns the largest value that the distribution can produce.

                                                                                      +
                                                                                      7. +
                                                                                    7. +
                                                                                      param_type param() const;
                                                                                      +

                                                                                      Returns the parameters of the distribution.

                                                                                      +
                                                                                      8. +
                                                                                    8. +
                                                                                      void param(const param_type & param);
                                                                                      +

                                                                                      Sets parameters of the distribution.

                                                                                      +
                                                                                      9. +
                                                                                    9. +
                                                                                      void reset();
                                                                                      +

                                                                                      Effects: Subsequent uses of the distribution do not depend on values produced by any engine prior to invoking reset.

                                                                                      +
                                                                                      10. +
                                                                                    +
                                                                                    +
                                                                                    +

                                                                                    +negative_binomial_distribution friend functions

                                                                                    +
                                                                                      +
                                                                                    1. +
                                                                                      template<typename CharT, typename Traits> 
+  friend std::basic_ostream< CharT, Traits > & 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
+             const negative_binomial_distribution & bd);
                                                                                      +

                                                                                      Writes the parameters of the distribution to a std::ostream.

                                                                                      +
                                                                                      2. +
                                                                                    2. +
                                                                                      template<typename CharT, typename Traits> 
+  friend std::basic_istream< CharT, Traits > & 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
+             negative_binomial_distribution & bd);
                                                                                      +

                                                                                      Reads the parameters of the distribution from a std::istream.

                                                                                      +
                                                                                      3. +
                                                                                    3. +
                                                                                      friend bool operator==(const negative_binomial_distribution & lhs, 
+                       const negative_binomial_distribution & rhs);
                                                                                      +

                                                                                      Returns true if the two distributions will produce the same sequence of values, given equal generators.

                                                                                      +
                                                                                      4. +
                                                                                    4. +
                                                                                      friend bool operator!=(const negative_binomial_distribution & lhs, 
+                       const negative_binomial_distribution & rhs);
                                                                                      +

                                                                                      Returns true if the two distributions could produce different sequences of values, given equal generators.

                                                                                      +
                                                                                      5. +
                                                                                    +
                                                                                    +
                                                                                    +
                                                                                    + + + +
                                                                                    Copyright © 2000-2005 Jens Maurer
                                                                                    Copyright © 2009, 2010 Steven Watanabe

                                                                                    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                    +
                                                                                    +
                                                                                    +
                                                                                    +PrevUpHomeNext +
                                                                                    + + diff --git a/doc/html/boost/random/negative_idm45506979396656/param_type.html b/doc/html/boost/random/negative_idm45506979396656/param_type.html new file mode 100644 index 0000000000..e09439ded9 --- /dev/null +++ b/doc/html/boost/random/negative_idm45506979396656/param_type.html @@ -0,0 +1,128 @@ + + + + +Class param_type + + + + + + + + + + + + + + + +
                                                                                    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                    +
                                                                                    +
                                                                                    +PrevUpHomeNext +
                                                                                    +
                                                                                    +
                                                                                    +
                                                                                    +

                                                                                    Class param_type

                                                                                    +

                                                                                    boost::random::negative_binomial_distribution::param_type

                                                                                    +
                                                                                    +

                                                                                    Synopsis

                                                                                    +
                                                                                    // In header: <boost/random/negative_binomial_distribution.hpp>
+
+
+
+class param_type {
+public:
+  // types
+  typedef negative_binomial_distribution distribution_type;
+
+  // construct/copy/destruct
+  explicit param_type(IntType = 1, RealType = 0.5);
+
+  // public member functions
+  IntType k() const;
+  RealType p() const;
+
+  // friend functions
+  template<typename CharT, typename Traits> 
+    friend std::basic_ostream< CharT, Traits > & 
+    operator<<(std::basic_ostream< CharT, Traits > &, const param_type &);
+  template<typename CharT, typename Traits> 
+    friend std::basic_istream< CharT, Traits > & 
+    operator>>(std::basic_istream< CharT, Traits > &, param_type &);
+  friend bool operator==(const param_type &, const param_type &);
+  friend bool operator!=(const param_type &, const param_type &);
+};
                                                                                    +
                                                                                    +

                                                                                    Description

                                                                                    +
                                                                                    +

                                                                                    +param_type + public + construct/copy/destruct

                                                                                    +
                                                                                    1. +
                                                                                      explicit param_type(IntType k = 1, RealType p = 0.5);
                                                                                      +

                                                                                      Construct a param_type object. k and p are the parameters of the distribution.

                                                                                      +

                                                                                      Requires: k >=0 && 0 <= p <= 1

                                                                                      +
                                                                                    +
                                                                                    +
                                                                                    +

                                                                                    +param_type public member functions

                                                                                    +
                                                                                      +
                                                                                    1. +
                                                                                      IntType k() const;
                                                                                      +

                                                                                      Returns the k parameter of the distribution.

                                                                                      +
                                                                                      2. +
                                                                                    2. +
                                                                                      RealType p() const;
                                                                                      +

                                                                                      Returns the p parameter of the distribution.

                                                                                      +
                                                                                      3. +
                                                                                    +
                                                                                    +
                                                                                    +

                                                                                    +param_type friend functions

                                                                                    +
                                                                                      +
                                                                                    1. +
                                                                                      template<typename CharT, typename Traits> 
+  friend std::basic_ostream< CharT, Traits > & 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
+             const param_type & param);
                                                                                      +

                                                                                      Writes the parameters of the distribution to a std::ostream.

                                                                                      +
                                                                                      2. +
                                                                                    2. +
                                                                                      template<typename CharT, typename Traits> 
+  friend std::basic_istream< CharT, Traits > & 
+  operator>>(std::basic_istream< CharT, Traits > & is, param_type & param);
                                                                                      +

                                                                                      Reads the parameters of the distribution from a std::istream.

                                                                                      +
                                                                                      3. +
                                                                                    3. +
                                                                                      friend bool operator==(const param_type & lhs, const param_type & rhs);
                                                                                      +

                                                                                      Returns true if the parameters have the same values.

                                                                                      +
                                                                                      4. +
                                                                                    4. +
                                                                                      friend bool operator!=(const param_type & lhs, const param_type & rhs);
                                                                                      +

                                                                                      Returns true if the parameters have different values.

                                                                                      +
                                                                                      5. +
                                                                                    +
                                                                                    +
                                                                                    +
                                                                                    + + + +
                                                                                    Copyright © 2000-2005 Jens Maurer
                                                                                    Copyright © 2009, 2010 Steven Watanabe

                                                                                    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                    +
                                                                                    +
                                                                                    +
                                                                                    +PrevUpHomeNext +
                                                                                    + + diff --git a/doc/html/boost/random/non_cent_idm45506980906800.html b/doc/html/boost/random/non_cent_idm45506980906800.html new file mode 100644 index 0000000000..aa935befd6 --- /dev/null +++ b/doc/html/boost/random/non_cent_idm45506980906800.html @@ -0,0 +1,212 @@ + + + + +Class template non_central_chi_squared_distribution + + + + + + + + + + + + + + + +
                                                                                    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                    +
                                                                                    +
                                                                                    +PrevUpHomeNext +
                                                                                    +
                                                                                    +
                                                                                    +
                                                                                    +

                                                                                    Class template non_central_chi_squared_distribution

                                                                                    +

                                                                                    boost::random::non_central_chi_squared_distribution

                                                                                    +
                                                                                    +

                                                                                    Synopsis

                                                                                    +
                                                                                    // In header: <boost/random/non_central_chi_squared_distribution.hpp>
+
+template<typename RealType = double> 
+class non_central_chi_squared_distribution {
+public:
+  // types
+  typedef RealType result_type;
+  typedef RealType input_type; 
+
+  // member classes/structs/unions
+
+  class param_type {
+  public:
+    // types
+    typedef non_central_chi_squared_distribution distribution_type;
+
+    // construct/copy/destruct
+    explicit param_type(RealType = 1, RealType = 1);
+
+    // public member functions
+    RealType k() const;
+    RealType lambda() const;
+
+    // friend functions
+    template<typename CharT, typename Traits> 
+      friend std::basic_ostream< CharT, Traits > & 
+      operator<<(std::basic_ostream< CharT, Traits > &, const param_type &);
+    template<typename CharT, typename Traits> 
+      friend std::basic_istream< CharT, Traits > & 
+      operator>>(std::basic_istream< CharT, Traits > &, const param_type &);
+    friend bool operator==(const param_type &, const param_type &);
+    friend bool operator!=(const param_type &, const param_type &);
+  };
+
+  // construct/copy/destruct
+  explicit non_central_chi_squared_distribution(RealType = 1, RealType = 1);
+  explicit non_central_chi_squared_distribution(const param_type &);
+
+  // public member functions
+  template<typename URNG> 
+    RealType operator()(URNG &, const param_type &) const;
+  template<typename URNG> RealType operator()(URNG &);
+  RealType k() const;
+  RealType lambda() const;
+  param_type param() const;
+  void param(const param_type &);
+  void reset();
+  RealType min() const;
+  RealType max() const;
+
+  // friend functions
+  template<typename CharT, typename Traits> 
+    friend std::basic_ostream< CharT, Traits > & 
+    operator<<(std::basic_ostream< CharT, Traits > &, 
+               const non_central_chi_squared_distribution &);
+  template<typename CharT, typename Traits> 
+    friend std::basic_istream< CharT, Traits > & 
+    operator>>(std::basic_istream< CharT, Traits > &, 
+               const non_central_chi_squared_distribution &);
+  friend bool operator==(const non_central_chi_squared_distribution &, 
+                         const non_central_chi_squared_distribution &);
+  friend bool operator!=(const non_central_chi_squared_distribution &, 
+                         const non_central_chi_squared_distribution &);
+};
                                                                                    +
                                                                                    +

                                                                                    Description

                                                                                    +

                                                                                    The noncentral chi-squared distribution is a real valued distribution with two parameter, k and lambda. The distribution produces values > 0.

                                                                                    +

                                                                                    This is the distribution of the sum of squares of k Normal distributed variates each with variance one and the sum of squares of the normal means.

                                                                                    +

                                                                                    The distribution function is . where is a modified Bessel function of the first kind.

                                                                                    +

                                                                                    The algorithm is taken from

                                                                                    +

                                                                                    +

                                                                                    "Monte Carlo Methods in Financial Engineering", Paul Glasserman, 2003, XIII, 596 p, Stochastic Modelling and Applied Probability, Vol. 53, ISBN 978-0-387-21617-1, p 124, Fig. 3.5.

                                                                                    +

                                                                                    +
                                                                                    +

                                                                                    +non_central_chi_squared_distribution + public + construct/copy/destruct

                                                                                    +
                                                                                      +
                                                                                    1. +
                                                                                      explicit non_central_chi_squared_distribution(RealType k = 1, 
+                                              RealType lambda = 1);
                                                                                      +

                                                                                      Construct a non_central_chi_squared_distribution object. k and lambda are the parameter of the distribution.

                                                                                      +

                                                                                      Requires: k > 0 && lambda > 0

                                                                                      +
                                                                                      2. +
                                                                                    2. +
                                                                                      explicit non_central_chi_squared_distribution(const param_type & param);
                                                                                      +

                                                                                      Construct a non_central_chi_squared_distribution object from the parameter.

                                                                                      +
                                                                                      3. +
                                                                                    +
                                                                                    +
                                                                                    +

                                                                                    +non_central_chi_squared_distribution public member functions

                                                                                    +
                                                                                      +
                                                                                    1. +
                                                                                      template<typename URNG> 
+  RealType operator()(URNG & eng, const param_type & param) const;
                                                                                      +

                                                                                      Returns a random variate distributed according to the non central chi squared distribution specified by param.

                                                                                      +
                                                                                      2. +
                                                                                    2. +
                                                                                      template<typename URNG> RealType operator()(URNG & eng);
                                                                                      +

                                                                                      Returns a random variate distributed according to the non central chi squared distribution.

                                                                                      +
                                                                                      3. +
                                                                                    3. +
                                                                                      RealType k() const;
                                                                                      +

                                                                                      Returns the k parameter of the distribution.

                                                                                      +
                                                                                      4. +
                                                                                    4. +
                                                                                      RealType lambda() const;
                                                                                      +

                                                                                      Returns the lambda parameter of the distribution.

                                                                                      +
                                                                                      5. +
                                                                                    5. +
                                                                                      param_type param() const;
                                                                                      +

                                                                                      Returns the parameters of the distribution.

                                                                                      +
                                                                                      6. +
                                                                                    6. +
                                                                                      void param(const param_type & param);
                                                                                      +

                                                                                      Sets parameters of the distribution.

                                                                                      +
                                                                                      7. +
                                                                                    7. +
                                                                                      void reset();
                                                                                      +

                                                                                      Resets the distribution, so that subsequent uses does not depend on values already produced by it.

                                                                                      +
                                                                                      8. +
                                                                                    8. +
                                                                                      RealType min() const;
                                                                                      +

                                                                                      Returns the smallest value that the distribution can produce.

                                                                                      +
                                                                                      9. +
                                                                                    9. +
                                                                                      RealType max() const;
                                                                                      +

                                                                                      Returns the largest value that the distribution can produce.

                                                                                      +
                                                                                      10. +
                                                                                    +
                                                                                    +
                                                                                    +

                                                                                    +non_central_chi_squared_distribution friend functions

                                                                                    +
                                                                                      +
                                                                                    1. +
                                                                                      template<typename CharT, typename Traits> 
+  friend std::basic_ostream< CharT, Traits > & 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
+             const non_central_chi_squared_distribution & dist);
                                                                                      +

                                                                                      Writes the parameters of the distribution to a std::ostream.

                                                                                      +
                                                                                      2. +
                                                                                    2. +
                                                                                      template<typename CharT, typename Traits> 
+  friend std::basic_istream< CharT, Traits > & 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
+             const non_central_chi_squared_distribution & dist);
                                                                                      +

                                                                                      reads the parameters of the distribution from a std::istream.

                                                                                      +
                                                                                      3. +
                                                                                    3. +
                                                                                      friend bool operator==(const non_central_chi_squared_distribution & lhs, 
+                       const non_central_chi_squared_distribution & rhs);
                                                                                      +

                                                                                      Returns true if two distributions have the same parameters and produce the same sequence of random numbers given equal generators.

                                                                                      +
                                                                                      4. +
                                                                                    4. +
                                                                                      friend bool operator!=(const non_central_chi_squared_distribution & lhs, 
+                       const non_central_chi_squared_distribution & rhs);
                                                                                      +

                                                                                      Returns true if two distributions have different parameters and/or can produce different sequences of random numbers given equal generators.

                                                                                      +
                                                                                      5. +
                                                                                    +
                                                                                    +
                                                                                    +
                                                                                    + + + +
                                                                                    Copyright © 2000-2005 Jens Maurer
                                                                                    Copyright © 2009, 2010 Steven Watanabe

                                                                                    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                    +
                                                                                    +
                                                                                    +
                                                                                    +PrevUpHomeNext +
                                                                                    + + diff --git a/doc/html/boost/random/non_cent_idm45506980906800/param_type.html b/doc/html/boost/random/non_cent_idm45506980906800/param_type.html new file mode 100644 index 0000000000..f8c7fa5bfa --- /dev/null +++ b/doc/html/boost/random/non_cent_idm45506980906800/param_type.html @@ -0,0 +1,129 @@ + + + + +Class param_type + + + + + + + + + + + + + + + +
                                                                                    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                    +
                                                                                    +
                                                                                    +PrevUpHomeNext +
                                                                                    +
                                                                                    +
                                                                                    +
                                                                                    +

                                                                                    Class param_type

                                                                                    +

                                                                                    boost::random::non_central_chi_squared_distribution::param_type

                                                                                    +
                                                                                    +

                                                                                    Synopsis

                                                                                    +
                                                                                    // In header: <boost/random/non_central_chi_squared_distribution.hpp>
+
+
+
+class param_type {
+public:
+  // types
+  typedef non_central_chi_squared_distribution distribution_type;
+
+  // construct/copy/destruct
+  explicit param_type(RealType = 1, RealType = 1);
+
+  // public member functions
+  RealType k() const;
+  RealType lambda() const;
+
+  // friend functions
+  template<typename CharT, typename Traits> 
+    friend std::basic_ostream< CharT, Traits > & 
+    operator<<(std::basic_ostream< CharT, Traits > &, const param_type &);
+  template<typename CharT, typename Traits> 
+    friend std::basic_istream< CharT, Traits > & 
+    operator>>(std::basic_istream< CharT, Traits > &, const param_type &);
+  friend bool operator==(const param_type &, const param_type &);
+  friend bool operator!=(const param_type &, const param_type &);
+};
                                                                                    +
                                                                                    +

                                                                                    Description

                                                                                    +
                                                                                    +

                                                                                    +param_type + public + construct/copy/destruct

                                                                                    +
                                                                                    1. +
                                                                                      explicit param_type(RealType k = 1, RealType lambda = 1);
                                                                                      +

                                                                                      Constructs the parameters of a non_central_chi_squared_distribution. k and lambda are the parameter of the distribution.

                                                                                      +

                                                                                      Requires: k > 0 && lambda > 0

                                                                                      +
                                                                                    +
                                                                                    +
                                                                                    +

                                                                                    +param_type public member functions

                                                                                    +
                                                                                      +
                                                                                    1. +
                                                                                      RealType k() const;
                                                                                      +

                                                                                      Returns the k parameter of the distribution

                                                                                      +
                                                                                      2. +
                                                                                    2. +
                                                                                      RealType lambda() const;
                                                                                      +

                                                                                      Returns the lambda parameter of the distribution

                                                                                      +
                                                                                      3. +
                                                                                    +
                                                                                    +
                                                                                    +

                                                                                    +param_type friend functions

                                                                                    +
                                                                                      +
                                                                                    1. +
                                                                                      template<typename CharT, typename Traits> 
+  friend std::basic_ostream< CharT, Traits > & 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
+             const param_type & param);
                                                                                      +

                                                                                      Writes the parameters of the distribution to a std::ostream.

                                                                                      +
                                                                                      2. +
                                                                                    2. +
                                                                                      template<typename CharT, typename Traits> 
+  friend std::basic_istream< CharT, Traits > & 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
+             const param_type & param);
                                                                                      +

                                                                                      Reads the parameters of the distribution from a std::istream.

                                                                                      +
                                                                                      3. +
                                                                                    3. +
                                                                                      friend bool operator==(const param_type & lhs, const param_type & rhs);
                                                                                      +

                                                                                      Returns true if the parameters have the same values.

                                                                                      +
                                                                                      4. +
                                                                                    4. +
                                                                                      friend bool operator!=(const param_type & lhs, const param_type & rhs);
                                                                                      +

                                                                                      Returns true if the parameters have different values.

                                                                                      +
                                                                                      5. +
                                                                                    +
                                                                                    +
                                                                                    +
                                                                                    + + + +
                                                                                    Copyright © 2000-2005 Jens Maurer
                                                                                    Copyright © 2009, 2010 Steven Watanabe

                                                                                    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                    +
                                                                                    +
                                                                                    +
                                                                                    +PrevUpHomeNext +
                                                                                    + + diff --git a/doc/html/boost/random/non_central_c_idp150001424.html b/doc/html/boost/random/non_central_c_idp150001424.html deleted file mode 100644 index 171c9e0436..0000000000 --- a/doc/html/boost/random/non_central_c_idp150001424.html +++ /dev/null @@ -1,212 +0,0 @@ - - - - -Class template non_central_chi_squared_distribution - - - - - - - - - - - - - - - -
                                                                                    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                    -
                                                                                    -
                                                                                    -PrevUpHomeNext -
                                                                                    -
                                                                                    -
                                                                                    -
                                                                                    -

                                                                                    Class template non_central_chi_squared_distribution

                                                                                    -

                                                                                    boost::random::non_central_chi_squared_distribution

                                                                                    -
                                                                                    -

                                                                                    Synopsis

                                                                                    -
                                                                                    // In header: <boost/random/non_central_chi_squared_distribution.hpp>
-
-template<typename RealType = double> 
-class non_central_chi_squared_distribution {
-public:
-  // types
-  typedef RealType result_type;
-  typedef RealType input_type; 
-
-  // member classes/structs/unions
-
-  class param_type {
-  public:
-    // types
-    typedef non_central_chi_squared_distribution distribution_type;
-
-    // construct/copy/destruct
-    explicit param_type(RealType = 1, RealType = 1);
-
-    // public member functions
-    RealType k() const;
-    RealType lambda() const;
-
-    // friend functions
-    template<typename CharT, typename Traits> 
-      friend std::basic_ostream< CharT, Traits > & 
-      operator<<(std::basic_ostream< CharT, Traits > &, const param_type &);
-    template<typename CharT, typename Traits> 
-      friend std::basic_istream< CharT, Traits > & 
-      operator>>(std::basic_istream< CharT, Traits > &, const param_type &);
-    friend bool operator==(const param_type &, const param_type &);
-    friend bool operator!=(const param_type &, const param_type &);
-  };
-
-  // construct/copy/destruct
-  explicit non_central_chi_squared_distribution(RealType = 1, RealType = 1);
-  explicit non_central_chi_squared_distribution(const param_type &);
-
-  // public member functions
-  template<typename URNG> 
-    RealType operator()(URNG &, const param_type &) const;
-  template<typename URNG> RealType operator()(URNG &);
-  RealType k() const;
-  RealType lambda() const;
-  param_type param() const;
-  void param(const param_type &);
-  void reset();
-  RealType min() const;
-  RealType max() const;
-
-  // friend functions
-  template<typename CharT, typename Traits> 
-    friend std::basic_ostream< CharT, Traits > & 
-    operator<<(std::basic_ostream< CharT, Traits > &, 
-               const non_central_chi_squared_distribution &);
-  template<typename CharT, typename Traits> 
-    friend std::basic_istream< CharT, Traits > & 
-    operator>>(std::basic_istream< CharT, Traits > &, 
-               const non_central_chi_squared_distribution &);
-  friend bool operator==(const non_central_chi_squared_distribution &, 
-                         const non_central_chi_squared_distribution &);
-  friend bool operator!=(const non_central_chi_squared_distribution &, 
-                         const non_central_chi_squared_distribution &);
-};
                                                                                    -
                                                                                    -

                                                                                    Description

                                                                                    -

                                                                                    The noncentral chi-squared distribution is a real valued distribution with two parameter, k and lambda. The distribution produces values > 0.

                                                                                    -

                                                                                    This is the distribution of the sum of squares of k Normal distributed variates each with variance one and the sum of squares of the normal means.

                                                                                    -

                                                                                    The distribution function is . where is a modified Bessel function of the first kind.

                                                                                    -

                                                                                    The algorithm is taken from

                                                                                    -

                                                                                    -

                                                                                    "Monte Carlo Methods in Financial Engineering", Paul Glasserman, 2003, XIII, 596 p, Stochastic Modelling and Applied Probability, Vol. 53, ISBN 978-0-387-21617-1, p 124, Fig. 3.5.

                                                                                    -

                                                                                    -
                                                                                    -

                                                                                    -non_central_chi_squared_distribution - public - construct/copy/destruct

                                                                                    -
                                                                                      -
                                                                                    1. -
                                                                                      explicit non_central_chi_squared_distribution(RealType k = 1, 
-                                              RealType lambda = 1);
                                                                                      -

                                                                                      Construct a non_central_chi_squared_distribution object. k and lambda are the parameter of the distribution.

                                                                                      -

                                                                                      Requires: k > 0 && lambda > 0

                                                                                      -
                                                                                      2. -
                                                                                    2. -
                                                                                      explicit non_central_chi_squared_distribution(const param_type & param);
                                                                                      -

                                                                                      Construct a non_central_chi_squared_distribution object from the parameter.

                                                                                      -
                                                                                      3. -
                                                                                    -
                                                                                    -
                                                                                    -

                                                                                    -non_central_chi_squared_distribution public member functions

                                                                                    -
                                                                                      -
                                                                                    1. -
                                                                                      template<typename URNG> 
-  RealType operator()(URNG & eng, const param_type & param) const;
                                                                                      -

                                                                                      Returns a random variate distributed according to the non central chi squared distribution specified by param.

                                                                                      -
                                                                                      2. -
                                                                                    2. -
                                                                                      template<typename URNG> RealType operator()(URNG & eng);
                                                                                      -

                                                                                      Returns a random variate distributed according to the non central chi squared distribution.

                                                                                      -
                                                                                      3. -
                                                                                    3. -
                                                                                      RealType k() const;
                                                                                      -

                                                                                      Returns the k parameter of the distribution.

                                                                                      -
                                                                                      4. -
                                                                                    4. -
                                                                                      RealType lambda() const;
                                                                                      -

                                                                                      Returns the lambda parameter of the distribution.

                                                                                      -
                                                                                      5. -
                                                                                    5. -
                                                                                      param_type param() const;
                                                                                      -

                                                                                      Returns the parameters of the distribution.

                                                                                      -
                                                                                      6. -
                                                                                    6. -
                                                                                      void param(const param_type & param);
                                                                                      -

                                                                                      Sets parameters of the distribution.

                                                                                      -
                                                                                      7. -
                                                                                    7. -
                                                                                      void reset();
                                                                                      -

                                                                                      Resets the distribution, so that subsequent uses does not depend on values already produced by it.

                                                                                      -
                                                                                      8. -
                                                                                    8. -
                                                                                      RealType min() const;
                                                                                      -

                                                                                      Returns the smallest value that the distribution can produce.

                                                                                      -
                                                                                      9. -
                                                                                    9. -
                                                                                      RealType max() const;
                                                                                      -

                                                                                      Returns the largest value that the distribution can produce.

                                                                                      -
                                                                                      10. -
                                                                                    -
                                                                                    -
                                                                                    -

                                                                                    -non_central_chi_squared_distribution friend functions

                                                                                    -
                                                                                      -
                                                                                    1. -
                                                                                      template<typename CharT, typename Traits> 
-  friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
-             const non_central_chi_squared_distribution & dist);
                                                                                      -

                                                                                      Writes the parameters of the distribution to a std::ostream.

                                                                                      -
                                                                                      2. -
                                                                                    2. -
                                                                                      template<typename CharT, typename Traits> 
-  friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
-             const non_central_chi_squared_distribution & dist);
                                                                                      -

                                                                                      reads the parameters of the distribution from a std::istream.

                                                                                      -
                                                                                      3. -
                                                                                    3. -
                                                                                      friend bool operator==(const non_central_chi_squared_distribution & lhs, 
-                       const non_central_chi_squared_distribution & rhs);
                                                                                      -

                                                                                      Returns true if two distributions have the same parameters and produce the same sequence of random numbers given equal generators.

                                                                                      -
                                                                                      4. -
                                                                                    4. -
                                                                                      friend bool operator!=(const non_central_chi_squared_distribution & lhs, 
-                       const non_central_chi_squared_distribution & rhs);
                                                                                      -

                                                                                      Returns true if two distributions have different parameters and/or can produce different sequences of random numbers given equal generators.

                                                                                      -
                                                                                      5. -
                                                                                    -
                                                                                    -
                                                                                    -
                                                                                    - - - -
                                                                                    Copyright © 2000-2005 Jens Maurer
                                                                                    Copyright © 2009, 2010 Steven Watanabe

                                                                                    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                    -
                                                                                    -
                                                                                    -
                                                                                    -PrevUpHomeNext -
                                                                                    - - diff --git a/doc/html/boost/random/non_central_c_idp150001424/param_type.html b/doc/html/boost/random/non_central_c_idp150001424/param_type.html deleted file mode 100644 index ea4a05e55d..0000000000 --- a/doc/html/boost/random/non_central_c_idp150001424/param_type.html +++ /dev/null @@ -1,129 +0,0 @@ - - - - -Class param_type - - - - - - - - - - - - - - - -
                                                                                    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                    -
                                                                                    -
                                                                                    -PrevUpHomeNext -
                                                                                    -
                                                                                    -
                                                                                    -
                                                                                    -

                                                                                    Class param_type

                                                                                    -

                                                                                    boost::random::non_central_chi_squared_distribution::param_type

                                                                                    -
                                                                                    -

                                                                                    Synopsis

                                                                                    -
                                                                                    // In header: <boost/random/non_central_chi_squared_distribution.hpp>
-
-
-
-class param_type {
-public:
-  // types
-  typedef non_central_chi_squared_distribution distribution_type;
-
-  // construct/copy/destruct
-  explicit param_type(RealType = 1, RealType = 1);
-
-  // public member functions
-  RealType k() const;
-  RealType lambda() const;
-
-  // friend functions
-  template<typename CharT, typename Traits> 
-    friend std::basic_ostream< CharT, Traits > & 
-    operator<<(std::basic_ostream< CharT, Traits > &, const param_type &);
-  template<typename CharT, typename Traits> 
-    friend std::basic_istream< CharT, Traits > & 
-    operator>>(std::basic_istream< CharT, Traits > &, const param_type &);
-  friend bool operator==(const param_type &, const param_type &);
-  friend bool operator!=(const param_type &, const param_type &);
-};
                                                                                    -
                                                                                    -

                                                                                    Description

                                                                                    -
                                                                                    -

                                                                                    -param_type - public - construct/copy/destruct

                                                                                    -
                                                                                    1. -
                                                                                      explicit param_type(RealType k = 1, RealType lambda = 1);
                                                                                      -

                                                                                      Constructs the parameters of a non_central_chi_squared_distribution. k and lambda are the parameter of the distribution.

                                                                                      -

                                                                                      Requires: k > 0 && lambda > 0

                                                                                      -
                                                                                    -
                                                                                    -
                                                                                    -

                                                                                    -param_type public member functions

                                                                                    -
                                                                                      -
                                                                                    1. -
                                                                                      RealType k() const;
                                                                                      -

                                                                                      Returns the k parameter of the distribution

                                                                                      -
                                                                                      2. -
                                                                                    2. -
                                                                                      RealType lambda() const;
                                                                                      -

                                                                                      Returns the lambda parameter of the distribution

                                                                                      -
                                                                                      3. -
                                                                                    -
                                                                                    -
                                                                                    -

                                                                                    -param_type friend functions

                                                                                    -
                                                                                      -
                                                                                    1. -
                                                                                      template<typename CharT, typename Traits> 
-  friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
-             const param_type & param);
                                                                                      -

                                                                                      Writes the parameters of the distribution to a std::ostream.

                                                                                      -
                                                                                      2. -
                                                                                    2. -
                                                                                      template<typename CharT, typename Traits> 
-  friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
-             const param_type & param);
                                                                                      -

                                                                                      Reads the parameters of the distribution from a std::istream.

                                                                                      -
                                                                                      3. -
                                                                                    3. -
                                                                                      friend bool operator==(const param_type & lhs, const param_type & rhs);
                                                                                      -

                                                                                      Returns true if the parameters have the same values.

                                                                                      -
                                                                                      4. -
                                                                                    4. -
                                                                                      friend bool operator!=(const param_type & lhs, const param_type & rhs);
                                                                                      -

                                                                                      Returns true if the parameters have different values.

                                                                                      -
                                                                                      5. -
                                                                                    -
                                                                                    -
                                                                                    -
                                                                                    - - - -
                                                                                    Copyright © 2000-2005 Jens Maurer
                                                                                    Copyright © 2009, 2010 Steven Watanabe

                                                                                    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                    -
                                                                                    -
                                                                                    -
                                                                                    -PrevUpHomeNext -
                                                                                    - - diff --git a/doc/html/boost/random/normal_distribution.html b/doc/html/boost/random/normal_distribution.html index 2adf80d2fa..d581d5409d 100644 --- a/doc/html/boost/random/normal_distribution.html +++ b/doc/html/boost/random/normal_distribution.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                                                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                                                    @@ -47,141 +47,141 @@ typedef normal_distribution distribution_type; // construct/copy/destruct - explicit param_type(RealType = 0.0, RealType = 1.0); + explicit param_type(RealType = 0.0, RealType = 1.0); - // public member functions - RealType mean() const; - RealType sigma() const; + // public member functions + RealType mean() const; + RealType sigma() const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); + operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, const param_type &); - friend bool operator==(const param_type &, const param_type &); - friend bool operator!=(const param_type &, const param_type &); + operator>>(std::basic_istream< CharT, Traits > &, const param_type &); + friend bool operator==(const param_type &, const param_type &); + friend bool operator!=(const param_type &, const param_type &); }; // construct/copy/destruct - explicit normal_distribution(const RealType & = 0.0, const RealType & = 1.0); - explicit normal_distribution(const param_type &); + explicit normal_distribution(const RealType & = 0.0, const RealType & = 1.0); + explicit normal_distribution(const param_type &); - // public member functions - RealType mean() const; - RealType sigma() const; - RealType min() const; - RealType max() const; - param_type param() const; - void param(const param_type &); - void reset(); - template<typename Engine> result_type operator()(Engine &); - template<typename URNG> result_type operator()(URNG &, const param_type &); + // public member functions + RealType mean() const; + RealType sigma() const; + RealType min() const; + RealType max() const; + param_type param() const; + void param(const param_type &); + void reset(); + template<typename Engine> result_type operator()(Engine &); + template<typename URNG> result_type operator()(URNG &, const param_type &); - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, + operator<<(std::basic_ostream< CharT, Traits > &, const normal_distribution &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, + operator>>(std::basic_istream< CharT, Traits > &, const normal_distribution &); - friend bool operator==(const normal_distribution &, + friend bool operator==(const normal_distribution &, const normal_distribution &); - friend bool operator!=(const normal_distribution &, + friend bool operator!=(const normal_distribution &, const normal_distribution &); };
                                                                                    -

                                                                                    Description

                                                                                    -

                                                                                    Instantiations of class template normal_distribution model a random distribution . Such a distribution produces random numbers x distributed with probability density function , where mean and sigma are the parameters of the distribution.

                                                                                    +

                                                                                    Description

                                                                                    +

                                                                                    Instantiations of class template normal_distribution model a random distribution . Such a distribution produces random numbers x distributed with probability density function , where mean and sigma are the parameters of the distribution.

                                                                                    -

                                                                                    +

                                                                                    normal_distribution public construct/copy/destruct

                                                                                    1. -
                                                                                      explicit normal_distribution(const RealType & mean = 0.0, 
+
                                                                                      explicit normal_distribution(const RealType & mean = 0.0, 
                              const RealType & sigma = 1.0);
                                                                                      
 
                                                                                      Constructs a normal_distribution object. mean and sigma are the parameters for the distribution.
                                                                                      
 
                                                                                      Requires: sigma >= 0
                                                                                    2. -
                                                                                      explicit normal_distribution(const param_type & param);
                                                                                      +
                                                                                      explicit normal_distribution(const param_type & param);

                                                                                      Constructs a normal_distribution object from its parameters.

                                                                                    -

                                                                                    -normal_distribution public member functions

                                                                                    +

                                                                                    +normal_distribution public member functions

                                                                                    1. -
                                                                                      RealType mean() const;
                                                                                      +
                                                                                      RealType mean() const;

                                                                                      Returns the mean of the distribution.

                                                                                    2. -
                                                                                      RealType sigma() const;
                                                                                      +
                                                                                      RealType sigma() const;

                                                                                      Returns the standard deviation of the distribution.

                                                                                    3. -
                                                                                      RealType min() const;
                                                                                      +
                                                                                      RealType min() const;

                                                                                      Returns the smallest value that the distribution can produce.

                                                                                    4. -
                                                                                      RealType max() const;
                                                                                      +
                                                                                      RealType max() const;

                                                                                      Returns the largest value that the distribution can produce.

                                                                                    5. -
                                                                                      param_type param() const;
                                                                                      +
                                                                                      param_type param() const;

                                                                                      Returns the parameters of the distribution.

                                                                                    6. -
                                                                                      void param(const param_type & param);
                                                                                      +
                                                                                      void param(const param_type & param);

                                                                                      Sets the parameters of the distribution.

                                                                                    7. -
                                                                                      void reset();
                                                                                      +
                                                                                      void reset();

                                                                                      Effects: Subsequent uses of the distribution do not depend on values produced by any engine prior to invoking reset.

                                                                                    8. -
                                                                                      template<typename Engine> result_type operator()(Engine & eng);
                                                                                      +
                                                                                      template<typename Engine> result_type operator()(Engine & eng);

                                                                                      Returns a normal variate. 

                                                                                    9. template<typename URNG> 
-  result_type operator()(URNG & urng, const param_type & param);
                                                                                      + result_type operator()(URNG & urng, const param_type & param);

                                                                                      Returns a normal variate with parameters specified by param.

                                                                                    -

                                                                                    -normal_distribution friend functions

                                                                                    +

                                                                                    +normal_distribution friend functions

                                                                                    1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const normal_distribution & nd);

                                                                                      Writes a normal_distribution to a std::ostream. 

                                                                                    2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
              const normal_distribution & nd);

                                                                                      Reads a normal_distribution from a std::istream.

                                                                                    3. -
                                                                                      friend bool operator==(const normal_distribution & lhs, 
+
                                                                                      friend bool operator==(const normal_distribution & lhs, 
                        const normal_distribution & rhs);
                                                                                      
 
                                                                                      Returns true if the two instances of normal_distribution will return identical sequences of values given equal generators.
                                                                                    4. -
                                                                                      friend bool operator!=(const normal_distribution & lhs, 
+
                                                                                      friend bool operator!=(const normal_distribution & lhs, 
                        const normal_distribution & rhs);
                                                                                      
 
                                                                                      Returns true if the two instances of normal_distribution will return different sequences of values given equal generators.
                                                                                      5. @@ -199,7 +199,7 @@
                                                                                      -PrevUpHomeNext +PrevUpHomeNext
                                                                                      diff --git a/doc/html/boost/random/normal_distribution/param_type.html b/doc/html/boost/random/normal_distribution/param_type.html index add4a1376c..c0ffc8f8a1 100644 --- a/doc/html/boost/random/normal_distribution/param_type.html +++ b/doc/html/boost/random/normal_distribution/param_type.html @@ -6,9 +6,9 @@ - + - + @@ -21,7 +21,7 @@
                                                                                      -PrevUpHomeNext +PrevUpHomeNext
                                                                                      @@ -40,73 +40,73 @@ typedef normal_distribution distribution_type; // construct/copy/destruct - explicit param_type(RealType = 0.0, RealType = 1.0); + explicit param_type(RealType = 0.0, RealType = 1.0); - // public member functions - RealType mean() const; - RealType sigma() const; + // public member functions + RealType mean() const; + RealType sigma() const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); + operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, const param_type &); - friend bool operator==(const param_type &, const param_type &); - friend bool operator!=(const param_type &, const param_type &); + operator>>(std::basic_istream< CharT, Traits > &, const param_type &); + friend bool operator==(const param_type &, const param_type &); + friend bool operator!=(const param_type &, const param_type &); };
                                                                                      -

                                                                                      Description

                                                                                      +

                                                                                      Description

                                                                                      -

                                                                                      +

                                                                                      param_type public construct/copy/destruct

                                                                                      1. -
                                                                                        explicit param_type(RealType mean = 0.0, RealType sigma = 1.0);
                                                                                        +
                                                                                        explicit param_type(RealType mean = 0.0, RealType sigma = 1.0);

                                                                                        Constructs a param_type with a given mean and standard deviation.

                                                                                        Requires: sigma >= 0

                                                                                      -

                                                                                      -param_type public member functions

                                                                                      +

                                                                                      +param_type public member functions

                                                                                      1. -
                                                                                        RealType mean() const;
                                                                                        +
                                                                                        RealType mean() const;

                                                                                        Returns the mean of the distribution.

                                                                                      2. -
                                                                                        RealType sigma() const;
                                                                                        +
                                                                                        RealType sigma() const;

                                                                                        Returns the standand deviation of the distribution.

                                                                                      -

                                                                                      -param_type friend functions

                                                                                      +

                                                                                      +param_type friend functions

                                                                                      1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const param_type & param);

                                                                                        Writes a param_type to a std::ostream. 

                                                                                      2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
              const param_type & param);

                                                                                        Reads a param_type from a std::istream.

                                                                                      3. -
                                                                                        friend bool operator==(const param_type & lhs, const param_type & rhs);
                                                                                        +
                                                                                        friend bool operator==(const param_type & lhs, const param_type & rhs);

                                                                                        Returns true if the two sets of parameters are the same.

                                                                                      4. -
                                                                                        friend bool operator!=(const param_type & lhs, const param_type & rhs);
                                                                                        +
                                                                                        friend bool operator!=(const param_type & lhs, const param_type & rhs);

                                                                                        Returns true if the two sets of parameters are the different.

                                                                                      @@ -123,7 +123,7 @@
                                                                                      -PrevUpHomeNext +PrevUpHomeNext
                                                                                      diff --git a/doc/html/boost/random/piecewis_idm45506986764736.html b/doc/html/boost/random/piecewis_idm45506986764736.html new file mode 100644 index 0000000000..3e4903b5a5 --- /dev/null +++ b/doc/html/boost/random/piecewis_idm45506986764736.html @@ -0,0 +1,253 @@ + + + + +Class template piecewise_linear_distribution + + + + + + + + + + + + + + + +
                                                                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                      +
                                                                                      +
                                                                                      +PrevUpHomeNext +
                                                                                      +
                                                                                      +
                                                                                      +
                                                                                      +

                                                                                      Class template piecewise_linear_distribution

                                                                                      +

                                                                                      boost::random::piecewise_linear_distribution

                                                                                      +
                                                                                      +

                                                                                      Synopsis

                                                                                      +
                                                                                      // In header: <boost/random/piecewise_linear_distribution.hpp>
+
+template<typename RealType = double> 
+class piecewise_linear_distribution {
+public:
+  // types
+  typedef std::size_t input_type; 
+  typedef RealType    result_type;
+
+  // member classes/structs/unions
+
+  class param_type {
+  public:
+    // types
+    typedef piecewise_linear_distribution distribution_type;
+
+    // construct/copy/destruct
+    param_type();
+    template<typename IntervalIter, typename WeightIter> 
+      param_type(IntervalIter, IntervalIter, WeightIter);
+    template<typename T, typename F> 
+      param_type(const std::initializer_list< T > &, F);
+    template<typename IntervalRange, typename WeightRange> 
+      param_type(const IntervalRange &, const WeightRange &);
+    template<typename F> param_type(std::size_t, RealType, RealType, F);
+
+    // friend functions
+    template<typename CharT, typename Traits> 
+      friend std::basic_ostream< CharT, Traits > & 
+      operator<<(std::basic_ostream< CharT, Traits > &, const param_type &);
+    template<typename CharT, typename Traits> 
+      friend std::basic_istream< CharT, Traits > & 
+      operator>>(std::basic_istream< CharT, Traits > &, const param_type &);
+    friend bool operator==(const param_type &, const param_type &);
+    friend bool operator!=(const param_type &, const param_type &);
+
+    // public member functions
+    std::vector< RealType > intervals() const;
+    std::vector< RealType > densities() const;
+  };
+
+  // construct/copy/destruct
+  piecewise_linear_distribution();
+  template<typename IntervalIter, typename WeightIter> 
+    piecewise_linear_distribution(IntervalIter, IntervalIter, WeightIter);
+  template<typename T, typename F> 
+    piecewise_linear_distribution(std::initializer_list< T >, F);
+  template<typename IntervalsRange, typename WeightsRange> 
+    piecewise_linear_distribution(const IntervalsRange &, 
+                                  const WeightsRange &);
+  template<typename F> 
+    piecewise_linear_distribution(std::size_t, RealType, RealType, F);
+  explicit piecewise_linear_distribution(const param_type &);
+
+  // public member functions
+  template<typename URNG> RealType operator()(URNG &) const;
+  template<typename URNG> 
+    RealType operator()(URNG &, const param_type &) const;
+  result_type min() const;
+  result_type max() const;
+  std::vector< RealType > densities() const;
+  std::vector< RealType > intervals() const;
+  param_type param() const;
+  void param(const param_type &);
+  void reset();
+
+  // friend functions
+  template<typename CharT, typename Traits> 
+    friend std::basic_ostream< CharT, Traits > & 
+    operator<<(std::basic_ostream< CharT, Traits > &, 
+               const piecewise_linear_distribution &);
+  template<typename CharT, typename Traits> 
+    friend std::basic_istream< CharT, Traits > & 
+    operator>>(std::basic_istream< CharT, Traits > &, 
+               const piecewise_linear_distribution &);
+  friend bool operator==(const piecewise_linear_distribution &, 
+                         const piecewise_linear_distribution &);
+  friend bool operator!=(const piecewise_linear_distribution &, 
+                         const piecewise_linear_distribution &);
+};
                                                                                      +
                                                                                      +

                                                                                      Description

                                                                                      +

                                                                                      The class piecewise_linear_distribution models a random distribution .

                                                                                      +
                                                                                      +

                                                                                      +piecewise_linear_distribution + public + construct/copy/destruct

                                                                                      +
                                                                                        +
                                                                                      1. +
                                                                                        piecewise_linear_distribution();
                                                                                        +

                                                                                        Creates a new piecewise_linear_distribution that produces values uniformly distributed in the range [0, 1).

                                                                                        +
                                                                                        2. +
                                                                                      2. +
                                                                                        template<typename IntervalIter, typename WeightIter> 
+  piecewise_linear_distribution(IntervalIter first_interval, 
+                                IntervalIter last_interval, 
+                                WeightIter first_weight);
                                                                                        +

                                                                                        Constructs a piecewise_linear_distribution from two iterator ranges containing the interval boundaries and the weights at the boundaries. If there are fewer than two boundaries, then this is equivalent to the default constructor and creates a distribution that produces values uniformly distributed in the range [0, 1).

                                                                                        +

                                                                                        The values of the interval boundaries must be strictly increasing, and the number of weights must be equal to the number of interval boundaries. If there are extra weights, they are ignored.

                                                                                        +

                                                                                        For example,

                                                                                        +
                                                                                        double intervals[] = { 0.0, 1.0, 2.0 };
+double weights[] = { 0.0, 1.0, 0.0 };
+piecewise_constant_distribution<> dist(
+    &intervals[0], &intervals[0] + 3, &weights[0]);
+
                                                                                        +

                                                                                        produces a triangle distribution.

                                                                                        +
                                                                                        3. +
                                                                                      3. +
                                                                                        template<typename T, typename F> 
+  piecewise_linear_distribution(std::initializer_list< T > il, F f);
                                                                                        +

                                                                                        Constructs a piecewise_linear_distribution from an initializer_list containing the interval boundaries and a unary function specifying the weights. Each weight is determined by calling the function at the corresponding interval boundary.

                                                                                        +

                                                                                        If the initializer_list contains fewer than two elements, this is equivalent to the default constructor and the distribution will produce values uniformly distributed in the range [0, 1).

                                                                                        +
                                                                                        4. +
                                                                                      4. +
                                                                                        template<typename IntervalsRange, typename WeightsRange> 
+  piecewise_linear_distribution(const IntervalsRange & intervals_arg, 
+                                const WeightsRange & weights_arg);
                                                                                        +

                                                                                        Constructs a piecewise_linear_distribution from Boost.Range ranges holding the interval boundaries and the weights. If there are fewer than two interval boundaries, this is equivalent to the default constructor and the distribution will produce values uniformly distributed in the range [0, 1). The number of weights must be equal to the number of interval boundaries.

                                                                                        +
                                                                                        5. +
                                                                                      5. +
                                                                                        template<typename F> 
+  piecewise_linear_distribution(std::size_t nw, RealType xmin, RealType xmax, 
+                                F f);
                                                                                        +

                                                                                        Constructs a piecewise_linear_distribution that approximates a function. The range of the distribution is [xmin, xmax). This range is divided into nw equally sized intervals and the weights are found by calling the unary function f on the interval boundaries.

                                                                                        +
                                                                                        6. +
                                                                                      6. +
                                                                                        explicit piecewise_linear_distribution(const param_type & param);
                                                                                        +

                                                                                        Constructs a piecewise_linear_distribution from its parameters.

                                                                                        +
                                                                                        7. +
                                                                                      +
                                                                                      +
                                                                                      +

                                                                                      +piecewise_linear_distribution public member functions

                                                                                      +
                                                                                        +
                                                                                      1. +
                                                                                        template<typename URNG> RealType operator()(URNG & urng) const;
                                                                                        +

                                                                                        Returns a value distributed according to the parameters of the piecewise_linear_distribution.

                                                                                        +
                                                                                        2. +
                                                                                      2. +
                                                                                        template<typename URNG> 
+  RealType operator()(URNG & urng, const param_type & param) const;
                                                                                        +

                                                                                        Returns a value distributed according to the parameters specified by param.

                                                                                        +
                                                                                        3. +
                                                                                      3. +
                                                                                        result_type min() const;
                                                                                        +

                                                                                        Returns the smallest value that the distribution can produce.

                                                                                        +
                                                                                        4. +
                                                                                      4. +
                                                                                        result_type max() const;
                                                                                        +

                                                                                        Returns the largest value that the distribution can produce.

                                                                                        +
                                                                                        5. +
                                                                                      5. +
                                                                                        std::vector< RealType > densities() const;
                                                                                        +

                                                                                        Returns a vector containing the probability densities at the interval boundaries.

                                                                                        +
                                                                                        6. +
                                                                                      6. +
                                                                                        std::vector< RealType > intervals() const;
                                                                                        +

                                                                                        Returns a vector containing the interval boundaries.

                                                                                        +
                                                                                        7. +
                                                                                      7. +
                                                                                        param_type param() const;
                                                                                        +

                                                                                        Returns the parameters of the distribution.

                                                                                        +
                                                                                        8. +
                                                                                      8. +
                                                                                        void param(const param_type & param);
                                                                                        +

                                                                                        Sets the parameters of the distribution.

                                                                                        +
                                                                                        9. +
                                                                                      9. +
                                                                                        void reset();
                                                                                        +

                                                                                        Effects: Subsequent uses of the distribution do not depend on values produced by any engine prior to invoking reset.

                                                                                        +
                                                                                        10. +
                                                                                      +
                                                                                      +
                                                                                      +

                                                                                      +piecewise_linear_distribution friend functions

                                                                                      +
                                                                                        +
                                                                                      1. +
                                                                                        template<typename CharT, typename Traits> 
+  friend std::basic_ostream< CharT, Traits > & 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
+             const piecewise_linear_distribution & pld);
                                                                                        +

                                                                                        Writes a distribution to a std::ostream.

                                                                                        +
                                                                                        2. +
                                                                                      2. +
                                                                                        template<typename CharT, typename Traits> 
+  friend std::basic_istream< CharT, Traits > & 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
+             const piecewise_linear_distribution & pld);
                                                                                        +

                                                                                        Reads a distribution from a std::istream

                                                                                        +
                                                                                        3. +
                                                                                      3. +
                                                                                        friend bool operator==(const piecewise_linear_distribution & lhs, 
+                       const piecewise_linear_distribution & rhs);
                                                                                        +

                                                                                        Returns true if the two distributions will return the same sequence of values, when passed equal generators.

                                                                                        +
                                                                                        4. +
                                                                                      4. +
                                                                                        friend bool operator!=(const piecewise_linear_distribution & lhs, 
+                       const piecewise_linear_distribution & rhs);
                                                                                        +

                                                                                        Returns true if the two distributions may return different sequences of values, when passed equal generators.

                                                                                        +
                                                                                        5. +
                                                                                      +
                                                                                      +
                                                                                      +
                                                                                      + + + +
                                                                                      Copyright © 2000-2005 Jens Maurer
                                                                                      Copyright © 2009, 2010 Steven Watanabe

                                                                                      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                      +
                                                                                      +
                                                                                      +
                                                                                      +PrevUpHomeNext +
                                                                                      + + diff --git a/doc/html/boost/random/piecewis_idm45506986764736/param_type.html b/doc/html/boost/random/piecewis_idm45506986764736/param_type.html new file mode 100644 index 0000000000..cef5947278 --- /dev/null +++ b/doc/html/boost/random/piecewis_idm45506986764736/param_type.html @@ -0,0 +1,161 @@ + + + + +Class param_type + + + + + + + + + + + + + + + +
                                                                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                      +
                                                                                      +
                                                                                      +PrevUpHomeNext +
                                                                                      +
                                                                                      +
                                                                                      +
                                                                                      +

                                                                                      Class param_type

                                                                                      +

                                                                                      boost::random::piecewise_linear_distribution::param_type

                                                                                      +
                                                                                      +

                                                                                      Synopsis

                                                                                      +
                                                                                      // In header: <boost/random/piecewise_linear_distribution.hpp>
+
+
+
+class param_type {
+public:
+  // types
+  typedef piecewise_linear_distribution distribution_type;
+
+  // construct/copy/destruct
+  param_type();
+  template<typename IntervalIter, typename WeightIter> 
+    param_type(IntervalIter, IntervalIter, WeightIter);
+  template<typename T, typename F> 
+    param_type(const std::initializer_list< T > &, F);
+  template<typename IntervalRange, typename WeightRange> 
+    param_type(const IntervalRange &, const WeightRange &);
+  template<typename F> param_type(std::size_t, RealType, RealType, F);
+
+  // friend functions
+  template<typename CharT, typename Traits> 
+    friend std::basic_ostream< CharT, Traits > & 
+    operator<<(std::basic_ostream< CharT, Traits > &, const param_type &);
+  template<typename CharT, typename Traits> 
+    friend std::basic_istream< CharT, Traits > & 
+    operator>>(std::basic_istream< CharT, Traits > &, const param_type &);
+  friend bool operator==(const param_type &, const param_type &);
+  friend bool operator!=(const param_type &, const param_type &);
+
+  // public member functions
+  std::vector< RealType > intervals() const;
+  std::vector< RealType > densities() const;
+};
                                                                                      +
                                                                                      +

                                                                                      Description

                                                                                      +
                                                                                      +

                                                                                      +param_type + public + construct/copy/destruct

                                                                                      +
                                                                                        +
                                                                                      1. +
                                                                                        param_type();
                                                                                        +

                                                                                        Constructs a param_type object, representing a distribution that produces values uniformly distributed in the range [0, 1).

                                                                                        +
                                                                                        2. +
                                                                                      2. +
                                                                                        template<typename IntervalIter, typename WeightIter> 
+  param_type(IntervalIter intervals_first, IntervalIter intervals_last, 
+             WeightIter weight_first);
                                                                                        +

                                                                                        Constructs a param_type object from two iterator ranges containing the interval boundaries and weights at the boundaries. If there are fewer than two boundaries, then this is equivalent to the default constructor and the distribution will produce values uniformly distributed in the range [0, 1).

                                                                                        +

                                                                                        The values of the interval boundaries must be strictly increasing, and the number of weights must be the same as the number of interval boundaries. If there are extra weights, they are ignored.

                                                                                        +
                                                                                        3. +
                                                                                      3. +
                                                                                        template<typename T, typename F> 
+  param_type(const std::initializer_list< T > & il, F f);
                                                                                        +

                                                                                        Constructs a param_type object from an initializer_list containing the interval boundaries and a unary function specifying the weights at the boundaries. Each weight is determined by calling the function at the corresponding point.

                                                                                        +

                                                                                        If the initializer_list contains fewer than two elements, this is equivalent to the default constructor and the distribution will produce values uniformly distributed in the range [0, 1).

                                                                                        +
                                                                                        4. +
                                                                                      4. +
                                                                                        template<typename IntervalRange, typename WeightRange> 
+  param_type(const IntervalRange & intervals_arg, 
+             const WeightRange & weights_arg);
                                                                                        +

                                                                                        Constructs a param_type object from Boost.Range ranges holding the interval boundaries and the weights at the boundaries. If there are fewer than two interval boundaries, this is equivalent to the default constructor and the distribution will produce values uniformly distributed in the range [0, 1). The number of weights must be equal to the number of interval boundaries.

                                                                                        +
                                                                                        5. +
                                                                                      5. +
                                                                                        template<typename F> 
+  param_type(std::size_t nw, RealType xmin, RealType xmax, F f);
                                                                                        +

                                                                                        Constructs the parameters for a distribution that approximates a function. The range of the distribution is [xmin, xmax). This range is divided into nw equally sized intervals and the weights are found by calling the unary function f on the boundaries of the intervals.

                                                                                        +
                                                                                        6. +
                                                                                      +
                                                                                      +
                                                                                      +

                                                                                      +param_type friend functions

                                                                                      +
                                                                                        +
                                                                                      1. +
                                                                                        template<typename CharT, typename Traits> 
+  friend std::basic_ostream< CharT, Traits > & 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
+             const param_type & param);
                                                                                        +

                                                                                        Writes the parameters to a std::ostream.

                                                                                        +
                                                                                        2. +
                                                                                      2. +
                                                                                        template<typename CharT, typename Traits> 
+  friend std::basic_istream< CharT, Traits > & 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
+             const param_type & param);
                                                                                        +

                                                                                        Reads the parameters from a std::istream.

                                                                                        +
                                                                                        3. +
                                                                                      3. +
                                                                                        friend bool operator==(const param_type & lhs, const param_type & rhs);
                                                                                        +

                                                                                        Returns true if the two sets of parameters are the same.

                                                                                        +
                                                                                        4. +
                                                                                      4. +
                                                                                        friend bool operator!=(const param_type & lhs, const param_type & rhs);
                                                                                        +

                                                                                        Returns true if the two sets of parameters are different.

                                                                                        +
                                                                                        5. +
                                                                                      +
                                                                                      +
                                                                                      +

                                                                                      +param_type public member functions

                                                                                      +
                                                                                        +
                                                                                      1. +
                                                                                        std::vector< RealType > intervals() const;
                                                                                        +

                                                                                        Returns a vector containing the interval boundaries.

                                                                                        +
                                                                                        2. +
                                                                                      2. +
                                                                                        std::vector< RealType > densities() const;
                                                                                        +

                                                                                        Returns a vector containing the probability densities at all the interval boundaries.

                                                                                        +
                                                                                        3. +
                                                                                      +
                                                                                      +
                                                                                      +
                                                                                      + + + +
                                                                                      Copyright © 2000-2005 Jens Maurer
                                                                                      Copyright © 2009, 2010 Steven Watanabe

                                                                                      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                      +
                                                                                      +
                                                                                      +
                                                                                      +PrevUpHomeNext +
                                                                                      + + diff --git a/doc/html/boost/random/piecewis_idm45507043304112.html b/doc/html/boost/random/piecewis_idm45507043304112.html new file mode 100644 index 0000000000..c7fba4b586 --- /dev/null +++ b/doc/html/boost/random/piecewis_idm45507043304112.html @@ -0,0 +1,253 @@ + + + + +Class template piecewise_constant_distribution + + + + + + + + + + + + + + + +
                                                                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                      +
                                                                                      +
                                                                                      +PrevUpHomeNext +
                                                                                      +
                                                                                      +
                                                                                      +
                                                                                      +

                                                                                      Class template piecewise_constant_distribution

                                                                                      +

                                                                                      boost::random::piecewise_constant_distribution

                                                                                      +
                                                                                      +

                                                                                      Synopsis

                                                                                      +
                                                                                      // In header: <boost/random/piecewise_constant_distribution.hpp>
+
+template<typename RealType = double, typename WeightType = double> 
+class piecewise_constant_distribution {
+public:
+  // types
+  typedef std::size_t input_type; 
+  typedef RealType    result_type;
+
+  // member classes/structs/unions
+
+  class param_type {
+  public:
+    // types
+    typedef piecewise_constant_distribution distribution_type;
+
+    // construct/copy/destruct
+    param_type();
+    template<typename IntervalIter, typename WeightIter> 
+      param_type(IntervalIter, IntervalIter, WeightIter);
+    template<typename T, typename F> 
+      param_type(const std::initializer_list< T > &, F);
+    template<typename IntervalRange, typename WeightRange> 
+      param_type(const IntervalRange &, const WeightRange &);
+    template<typename F> param_type(std::size_t, RealType, RealType, F);
+
+    // friend functions
+    template<typename CharT, typename Traits> 
+      friend std::basic_ostream< CharT, Traits > & 
+      operator<<(std::basic_ostream< CharT, Traits > &, const param_type &);
+    template<typename CharT, typename Traits> 
+      friend std::basic_istream< CharT, Traits > & 
+      operator>>(std::basic_istream< CharT, Traits > &, const param_type &);
+    friend bool operator==(const param_type &, const param_type &);
+    friend bool operator!=(const param_type &, const param_type &);
+
+    // public member functions
+    std::vector< RealType > intervals() const;
+    std::vector< RealType > densities() const;
+  };
+
+  // construct/copy/destruct
+  piecewise_constant_distribution();
+  template<typename IntervalIter, typename WeightIter> 
+    piecewise_constant_distribution(IntervalIter, IntervalIter, WeightIter);
+  template<typename T, typename F> 
+    piecewise_constant_distribution(std::initializer_list< T >, F);
+  template<typename IntervalsRange, typename WeightsRange> 
+    piecewise_constant_distribution(const IntervalsRange &, 
+                                    const WeightsRange &);
+  template<typename F> 
+    piecewise_constant_distribution(std::size_t, RealType, RealType, F);
+  explicit piecewise_constant_distribution(const param_type &);
+
+  // public member functions
+  template<typename URNG> RealType operator()(URNG &) const;
+  template<typename URNG> 
+    RealType operator()(URNG &, const param_type &) const;
+  result_type min() const;
+  result_type max() const;
+  std::vector< RealType > densities() const;
+  std::vector< RealType > intervals() const;
+  param_type param() const;
+  void param(const param_type &);
+  void reset();
+
+  // friend functions
+  template<typename CharT, typename Traits> 
+    friend std::basic_ostream< CharT, Traits > & 
+    operator<<(std::basic_ostream< CharT, Traits > &, 
+               const piecewise_constant_distribution &);
+  template<typename CharT, typename Traits> 
+    friend std::basic_istream< CharT, Traits > & 
+    operator>>(std::basic_istream< CharT, Traits > &, 
+               const piecewise_constant_distribution &);
+  friend bool operator==(const piecewise_constant_distribution &, 
+                         const piecewise_constant_distribution &);
+  friend bool operator!=(const piecewise_constant_distribution &, 
+                         const piecewise_constant_distribution &);
+};
                                                                                      +
                                                                                      +

                                                                                      Description

                                                                                      +

                                                                                      The class piecewise_constant_distribution models a random distribution .

                                                                                      +
                                                                                      +

                                                                                      +piecewise_constant_distribution + public + construct/copy/destruct

                                                                                      +
                                                                                        +
                                                                                      1. +
                                                                                        piecewise_constant_distribution();
                                                                                        +

                                                                                        Creates a new piecewise_constant_distribution with a single interval, [0, 1).

                                                                                        +
                                                                                        2. +
                                                                                      2. +
                                                                                        template<typename IntervalIter, typename WeightIter> 
+  piecewise_constant_distribution(IntervalIter first_interval, 
+                                  IntervalIter last_interval, 
+                                  WeightIter first_weight);
                                                                                        +

                                                                                        Constructs a piecewise_constant_distribution from two iterator ranges containing the interval boundaries and the interval weights. If there are less than two boundaries, then this is equivalent to the default constructor and creates a single interval, [0, 1).

                                                                                        +

                                                                                        The values of the interval boundaries must be strictly increasing, and the number of weights must be one less than the number of interval boundaries. If there are extra weights, they are ignored.

                                                                                        +

                                                                                        For example,

                                                                                        +
                                                                                        double intervals[] = { 0.0, 1.0, 4.0 };
+double weights[] = { 1.0, 1.0 };
+piecewise_constant_distribution<> dist(
+    &intervals[0], &intervals[0] + 3, &weights[0]);
+
                                                                                        +

                                                                                        The distribution has a 50% chance of producing a value between 0 and 1 and a 50% chance of producing a value between 1 and 4.

                                                                                        +
                                                                                        3. +
                                                                                      3. +
                                                                                        template<typename T, typename F> 
+  piecewise_constant_distribution(std::initializer_list< T > il, F f);
                                                                                        +

                                                                                        Constructs a piecewise_constant_distribution from an initializer_list containing the interval boundaries and a unary function specifying the weights. Each weight is determined by calling the function at the midpoint of the corresponding interval.

                                                                                        +

                                                                                        If the initializer_list contains less than two elements, this is equivalent to the default constructor and the distribution will produce values uniformly distributed in the range [0, 1).

                                                                                        +
                                                                                        4. +
                                                                                      4. +
                                                                                        template<typename IntervalsRange, typename WeightsRange> 
+  piecewise_constant_distribution(const IntervalsRange & intervals_arg, 
+                                  const WeightsRange & weights_arg);
                                                                                        +

                                                                                        Constructs a piecewise_constant_distribution from Boost.Range ranges holding the interval boundaries and the weights. If there are less than two interval boundaries, this is equivalent to the default constructor and the distribution will produce values uniformly distributed in the range [0, 1). The number of weights must be one less than the number of interval boundaries.

                                                                                        +
                                                                                        5. +
                                                                                      5. +
                                                                                        template<typename F> 
+  piecewise_constant_distribution(std::size_t nw, RealType xmin, 
+                                  RealType xmax, F f);
                                                                                        +

                                                                                        Constructs a piecewise_constant_distribution that approximates a function. The range of the distribution is [xmin, xmax). This range is divided into nw equally sized intervals and the weights are found by calling the unary function f on the midpoints of the intervals.

                                                                                        +
                                                                                        6. +
                                                                                      6. +
                                                                                        explicit piecewise_constant_distribution(const param_type & param);
                                                                                        +

                                                                                        Constructs a piecewise_constant_distribution from its parameters.

                                                                                        +
                                                                                        7. +
                                                                                      +
                                                                                      +
                                                                                      +

                                                                                      +piecewise_constant_distribution public member functions

                                                                                      +
                                                                                        +
                                                                                      1. +
                                                                                        template<typename URNG> RealType operator()(URNG & urng) const;
                                                                                        +

                                                                                        Returns a value distributed according to the parameters of the piecewist_constant_distribution.

                                                                                        +
                                                                                        2. +
                                                                                      2. +
                                                                                        template<typename URNG> 
+  RealType operator()(URNG & urng, const param_type & param) const;
                                                                                        +

                                                                                        Returns a value distributed according to the parameters specified by param.

                                                                                        +
                                                                                        3. +
                                                                                      3. +
                                                                                        result_type min() const;
                                                                                        +

                                                                                        Returns the smallest value that the distribution can produce.

                                                                                        +
                                                                                        4. +
                                                                                      4. +
                                                                                        result_type max() const;
                                                                                        +

                                                                                        Returns the largest value that the distribution can produce.

                                                                                        +
                                                                                        5. +
                                                                                      5. +
                                                                                        std::vector< RealType > densities() const;
                                                                                        +

                                                                                        Returns a vector containing the probability density over each interval.

                                                                                        +
                                                                                        6. +
                                                                                      6. +
                                                                                        std::vector< RealType > intervals() const;
                                                                                        +

                                                                                        Returns a vector containing the interval boundaries.

                                                                                        +
                                                                                        7. +
                                                                                      7. +
                                                                                        param_type param() const;
                                                                                        +

                                                                                        Returns the parameters of the distribution.

                                                                                        +
                                                                                        8. +
                                                                                      8. +
                                                                                        void param(const param_type & param);
                                                                                        +

                                                                                        Sets the parameters of the distribution.

                                                                                        +
                                                                                        9. +
                                                                                      9. +
                                                                                        void reset();
                                                                                        +

                                                                                        Effects: Subsequent uses of the distribution do not depend on values produced by any engine prior to invoking reset.

                                                                                        +
                                                                                        10. +
                                                                                      +
                                                                                      +
                                                                                      +

                                                                                      +piecewise_constant_distribution friend functions

                                                                                      +
                                                                                        +
                                                                                      1. +
                                                                                        template<typename CharT, typename Traits> 
+  friend std::basic_ostream< CharT, Traits > & 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
+             const piecewise_constant_distribution & pcd);
                                                                                        +

                                                                                        Writes a distribution to a std::ostream.

                                                                                        +
                                                                                        2. +
                                                                                      2. +
                                                                                        template<typename CharT, typename Traits> 
+  friend std::basic_istream< CharT, Traits > & 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
+             const piecewise_constant_distribution & pcd);
                                                                                        +

                                                                                        Reads a distribution from a std::istream

                                                                                        +
                                                                                        3. +
                                                                                      3. +
                                                                                        friend bool operator==(const piecewise_constant_distribution & lhs, 
+                       const piecewise_constant_distribution & rhs);
                                                                                        +

                                                                                        Returns true if the two distributions will return the same sequence of values, when passed equal generators.

                                                                                        +
                                                                                        4. +
                                                                                      4. +
                                                                                        friend bool operator!=(const piecewise_constant_distribution & lhs, 
+                       const piecewise_constant_distribution & rhs);
                                                                                        +

                                                                                        Returns true if the two distributions may return different sequences of values, when passed equal generators.

                                                                                        +
                                                                                        5. +
                                                                                      +
                                                                                      +
                                                                                      +
                                                                                      + + + +
                                                                                      Copyright © 2000-2005 Jens Maurer
                                                                                      Copyright © 2009, 2010 Steven Watanabe

                                                                                      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                      +
                                                                                      +
                                                                                      +
                                                                                      +PrevUpHomeNext +
                                                                                      + + diff --git a/doc/html/boost/random/piecewis_idm45507043304112/param_type.html b/doc/html/boost/random/piecewis_idm45507043304112/param_type.html new file mode 100644 index 0000000000..446035e69d --- /dev/null +++ b/doc/html/boost/random/piecewis_idm45507043304112/param_type.html @@ -0,0 +1,161 @@ + + + + +Class param_type + + + + + + + + + + + + + + + +
                                                                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                      +
                                                                                      +
                                                                                      +PrevUpHomeNext +
                                                                                      +
                                                                                      +
                                                                                      +
                                                                                      +

                                                                                      Class param_type

                                                                                      +

                                                                                      boost::random::piecewise_constant_distribution::param_type

                                                                                      +
                                                                                      +

                                                                                      Synopsis

                                                                                      +
                                                                                      // In header: <boost/random/piecewise_constant_distribution.hpp>
+
+
+
+class param_type {
+public:
+  // types
+  typedef piecewise_constant_distribution distribution_type;
+
+  // construct/copy/destruct
+  param_type();
+  template<typename IntervalIter, typename WeightIter> 
+    param_type(IntervalIter, IntervalIter, WeightIter);
+  template<typename T, typename F> 
+    param_type(const std::initializer_list< T > &, F);
+  template<typename IntervalRange, typename WeightRange> 
+    param_type(const IntervalRange &, const WeightRange &);
+  template<typename F> param_type(std::size_t, RealType, RealType, F);
+
+  // friend functions
+  template<typename CharT, typename Traits> 
+    friend std::basic_ostream< CharT, Traits > & 
+    operator<<(std::basic_ostream< CharT, Traits > &, const param_type &);
+  template<typename CharT, typename Traits> 
+    friend std::basic_istream< CharT, Traits > & 
+    operator>>(std::basic_istream< CharT, Traits > &, const param_type &);
+  friend bool operator==(const param_type &, const param_type &);
+  friend bool operator!=(const param_type &, const param_type &);
+
+  // public member functions
+  std::vector< RealType > intervals() const;
+  std::vector< RealType > densities() const;
+};
                                                                                      +
                                                                                      +

                                                                                      Description

                                                                                      +
                                                                                      +

                                                                                      +param_type + public + construct/copy/destruct

                                                                                      +
                                                                                        +
                                                                                      1. +
                                                                                        param_type();
                                                                                        +

                                                                                        Constructs a param_type object, representing a distribution that produces values uniformly distributed in the range [0, 1).

                                                                                        +
                                                                                        2. +
                                                                                      2. +
                                                                                        template<typename IntervalIter, typename WeightIter> 
+  param_type(IntervalIter intervals_first, IntervalIter intervals_last, 
+             WeightIter weight_first);
                                                                                        +

                                                                                        Constructs a param_type object from two iterator ranges containing the interval boundaries and the interval weights. If there are less than two boundaries, then this is equivalent to the default constructor and creates a single interval, [0, 1).

                                                                                        +

                                                                                        The values of the interval boundaries must be strictly increasing, and the number of weights must be one less than the number of interval boundaries. If there are extra weights, they are ignored.

                                                                                        +
                                                                                        3. +
                                                                                      3. +
                                                                                        template<typename T, typename F> 
+  param_type(const std::initializer_list< T > & il, F f);
                                                                                        +

                                                                                        Constructs a param_type object from an initializer_list containing the interval boundaries and a unary function specifying the weights. Each weight is determined by calling the function at the midpoint of the corresponding interval.

                                                                                        +

                                                                                        If the initializer_list contains less than two elements, this is equivalent to the default constructor and the distribution will produce values uniformly distributed in the range [0, 1).

                                                                                        +
                                                                                        4. +
                                                                                      4. +
                                                                                        template<typename IntervalRange, typename WeightRange> 
+  param_type(const IntervalRange & intervals_arg, 
+             const WeightRange & weights_arg);
                                                                                        +

                                                                                        Constructs a param_type object from Boost.Range ranges holding the interval boundaries and the weights. If there are less than two interval boundaries, this is equivalent to the default constructor and the distribution will produce values uniformly distributed in the range [0, 1). The number of weights must be one less than the number of interval boundaries.

                                                                                        +
                                                                                        5. +
                                                                                      5. +
                                                                                        template<typename F> 
+  param_type(std::size_t nw, RealType xmin, RealType xmax, F f);
                                                                                        +

                                                                                        Constructs the parameters for a distribution that approximates a function. The range of the distribution is [xmin, xmax). This range is divided into nw equally sized intervals and the weights are found by calling the unary function f on the midpoints of the intervals.

                                                                                        +
                                                                                        6. +
                                                                                      +
                                                                                      +
                                                                                      +

                                                                                      +param_type friend functions

                                                                                      +
                                                                                        +
                                                                                      1. +
                                                                                        template<typename CharT, typename Traits> 
+  friend std::basic_ostream< CharT, Traits > & 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
+             const param_type & param);
                                                                                        +

                                                                                        Writes the parameters to a std::ostream.

                                                                                        +
                                                                                        2. +
                                                                                      2. +
                                                                                        template<typename CharT, typename Traits> 
+  friend std::basic_istream< CharT, Traits > & 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
+             const param_type & param);
                                                                                        +

                                                                                        Reads the parameters from a std::istream.

                                                                                        +
                                                                                        3. +
                                                                                      3. +
                                                                                        friend bool operator==(const param_type & lhs, const param_type & rhs);
                                                                                        +

                                                                                        Returns true if the two sets of parameters are the same.

                                                                                        +
                                                                                        4. +
                                                                                      4. +
                                                                                        friend bool operator!=(const param_type & lhs, const param_type & rhs);
                                                                                        +

                                                                                        Returns true if the two sets of parameters are different.

                                                                                        +
                                                                                        5. +
                                                                                      +
                                                                                      +
                                                                                      +

                                                                                      +param_type public member functions

                                                                                      +
                                                                                        +
                                                                                      1. +
                                                                                        std::vector< RealType > intervals() const;
                                                                                        +

                                                                                        Returns a vector containing the interval boundaries.

                                                                                        +
                                                                                        2. +
                                                                                      2. +
                                                                                        std::vector< RealType > densities() const;
                                                                                        +

                                                                                        Returns a vector containing the probability densities over all the intervals of the distribution.

                                                                                        +
                                                                                        3. +
                                                                                      +
                                                                                      +
                                                                                      +
                                                                                      + + + +
                                                                                      Copyright © 2000-2005 Jens Maurer
                                                                                      Copyright © 2009, 2010 Steven Watanabe

                                                                                      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                      +
                                                                                      +
                                                                                      +
                                                                                      +PrevUpHomeNext +
                                                                                      + + diff --git a/doc/html/boost/random/piecewise_cons_idp94191504.html b/doc/html/boost/random/piecewise_cons_idp94191504.html deleted file mode 100644 index febe67319e..0000000000 --- a/doc/html/boost/random/piecewise_cons_idp94191504.html +++ /dev/null @@ -1,253 +0,0 @@ - - - - -Class template piecewise_constant_distribution - - - - - - - - - - - - - - - -
                                                                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                      -
                                                                                      -
                                                                                      -PrevUpHomeNext -
                                                                                      -
                                                                                      -
                                                                                      -
                                                                                      -

                                                                                      Class template piecewise_constant_distribution

                                                                                      -

                                                                                      boost::random::piecewise_constant_distribution

                                                                                      -
                                                                                      -

                                                                                      Synopsis

                                                                                      -
                                                                                      // In header: <boost/random/piecewise_constant_distribution.hpp>
-
-template<typename RealType = double, typename WeightType = double> 
-class piecewise_constant_distribution {
-public:
-  // types
-  typedef std::size_t input_type; 
-  typedef RealType    result_type;
-
-  // member classes/structs/unions
-
-  class param_type {
-  public:
-    // types
-    typedef piecewise_constant_distribution distribution_type;
-
-    // construct/copy/destruct
-    param_type();
-    template<typename IntervalIter, typename WeightIter> 
-      param_type(IntervalIter, IntervalIter, WeightIter);
-    template<typename T, typename F> 
-      param_type(const std::initializer_list< T > &, F);
-    template<typename IntervalRange, typename WeightRange> 
-      param_type(const IntervalRange &, const WeightRange &);
-    template<typename F> param_type(std::size_t, RealType, RealType, F);
-
-    // friend functions
-    template<typename CharT, typename Traits> 
-      friend std::basic_ostream< CharT, Traits > & 
-      operator<<(std::basic_ostream< CharT, Traits > &, const param_type &);
-    template<typename CharT, typename Traits> 
-      friend std::basic_istream< CharT, Traits > & 
-      operator>>(std::basic_istream< CharT, Traits > &, const param_type &);
-    friend bool operator==(const param_type &, const param_type &);
-    friend bool operator!=(const param_type &, const param_type &);
-
-    // public member functions
-    std::vector< RealType > intervals() const;
-    std::vector< RealType > densities() const;
-  };
-
-  // construct/copy/destruct
-  piecewise_constant_distribution();
-  template<typename IntervalIter, typename WeightIter> 
-    piecewise_constant_distribution(IntervalIter, IntervalIter, WeightIter);
-  template<typename T, typename F> 
-    piecewise_constant_distribution(std::initializer_list< T >, F);
-  template<typename IntervalsRange, typename WeightsRange> 
-    piecewise_constant_distribution(const IntervalsRange &, 
-                                    const WeightsRange &);
-  template<typename F> 
-    piecewise_constant_distribution(std::size_t, RealType, RealType, F);
-  explicit piecewise_constant_distribution(const param_type &);
-
-  // public member functions
-  template<typename URNG> RealType operator()(URNG &) const;
-  template<typename URNG> 
-    RealType operator()(URNG &, const param_type &) const;
-  result_type min() const;
-  result_type max() const;
-  std::vector< RealType > densities() const;
-  std::vector< RealType > intervals() const;
-  param_type param() const;
-  void param(const param_type &);
-  void reset();
-
-  // friend functions
-  template<typename CharT, typename Traits> 
-    friend std::basic_ostream< CharT, Traits > & 
-    operator<<(std::basic_ostream< CharT, Traits > &, 
-               const piecewise_constant_distribution &);
-  template<typename CharT, typename Traits> 
-    friend std::basic_istream< CharT, Traits > & 
-    operator>>(std::basic_istream< CharT, Traits > &, 
-               const piecewise_constant_distribution &);
-  friend bool operator==(const piecewise_constant_distribution &, 
-                         const piecewise_constant_distribution &);
-  friend bool operator!=(const piecewise_constant_distribution &, 
-                         const piecewise_constant_distribution &);
-};
                                                                                      -
                                                                                      -

                                                                                      Description

                                                                                      -

                                                                                      The class piecewise_constant_distribution models a random distribution .

                                                                                      -
                                                                                      -

                                                                                      -piecewise_constant_distribution - public - construct/copy/destruct

                                                                                      -
                                                                                        -
                                                                                      1. -
                                                                                        piecewise_constant_distribution();
                                                                                        -

                                                                                        Creates a new piecewise_constant_distribution with a single interval, [0, 1).

                                                                                        -
                                                                                        2. -
                                                                                      2. -
                                                                                        template<typename IntervalIter, typename WeightIter> 
-  piecewise_constant_distribution(IntervalIter first_interval, 
-                                  IntervalIter last_interval, 
-                                  WeightIter first_weight);
                                                                                        -

                                                                                        Constructs a piecewise_constant_distribution from two iterator ranges containing the interval boundaries and the interval weights. If there are less than two boundaries, then this is equivalent to the default constructor and creates a single interval, [0, 1).

                                                                                        -

                                                                                        The values of the interval boundaries must be strictly increasing, and the number of weights must be one less than the number of interval boundaries. If there are extra weights, they are ignored.

                                                                                        -

                                                                                        For example,

                                                                                        -
                                                                                        double intervals[] = { 0.0, 1.0, 4.0 };
-double weights[] = { 1.0, 1.0 };
-piecewise_constant_distribution<> dist(
-    &intervals[0], &intervals[0] + 3, &weights[0]);
-
                                                                                        -

                                                                                        The distribution has a 50% chance of producing a value between 0 and 1 and a 50% chance of producing a value between 1 and 4.

                                                                                        -
                                                                                        3. -
                                                                                      3. -
                                                                                        template<typename T, typename F> 
-  piecewise_constant_distribution(std::initializer_list< T > il, F f);
                                                                                        -

                                                                                        Constructs a piecewise_constant_distribution from an initializer_list containing the interval boundaries and a unary function specifying the weights. Each weight is determined by calling the function at the midpoint of the corresponding interval.

                                                                                        -

                                                                                        If the initializer_list contains less than two elements, this is equivalent to the default constructor and the distribution will produce values uniformly distributed in the range [0, 1).

                                                                                        -
                                                                                        4. -
                                                                                      4. -
                                                                                        template<typename IntervalsRange, typename WeightsRange> 
-  piecewise_constant_distribution(const IntervalsRange & intervals_arg, 
-                                  const WeightsRange & weights_arg);
                                                                                        -

                                                                                        Constructs a piecewise_constant_distribution from Boost.Range ranges holding the interval boundaries and the weights. If there are less than two interval boundaries, this is equivalent to the default constructor and the distribution will produce values uniformly distributed in the range [0, 1). The number of weights must be one less than the number of interval boundaries.

                                                                                        -
                                                                                        5. -
                                                                                      5. -
                                                                                        template<typename F> 
-  piecewise_constant_distribution(std::size_t nw, RealType xmin, 
-                                  RealType xmax, F f);
                                                                                        -

                                                                                        Constructs a piecewise_constant_distribution that approximates a function. The range of the distribution is [xmin, xmax). This range is divided into nw equally sized intervals and the weights are found by calling the unary function f on the midpoints of the intervals.

                                                                                        -
                                                                                        6. -
                                                                                      6. -
                                                                                        explicit piecewise_constant_distribution(const param_type & param);
                                                                                        -

                                                                                        Constructs a piecewise_constant_distribution from its parameters.

                                                                                        -
                                                                                        7. -
                                                                                      -
                                                                                      -
                                                                                      -

                                                                                      -piecewise_constant_distribution public member functions

                                                                                      -
                                                                                        -
                                                                                      1. -
                                                                                        template<typename URNG> RealType operator()(URNG & urng) const;
                                                                                        -

                                                                                        Returns a value distributed according to the parameters of the piecewist_constant_distribution.

                                                                                        -
                                                                                        2. -
                                                                                      2. -
                                                                                        template<typename URNG> 
-  RealType operator()(URNG & urng, const param_type & param) const;
                                                                                        -

                                                                                        Returns a value distributed according to the parameters specified by param.

                                                                                        -
                                                                                        3. -
                                                                                      3. -
                                                                                        result_type min() const;
                                                                                        -

                                                                                        Returns the smallest value that the distribution can produce.

                                                                                        -
                                                                                        4. -
                                                                                      4. -
                                                                                        result_type max() const;
                                                                                        -

                                                                                        Returns the largest value that the distribution can produce.

                                                                                        -
                                                                                        5. -
                                                                                      5. -
                                                                                        std::vector< RealType > densities() const;
                                                                                        -

                                                                                        Returns a vector containing the probability density over each interval.

                                                                                        -
                                                                                        6. -
                                                                                      6. -
                                                                                        std::vector< RealType > intervals() const;
                                                                                        -

                                                                                        Returns a vector containing the interval boundaries.

                                                                                        -
                                                                                        7. -
                                                                                      7. -
                                                                                        param_type param() const;
                                                                                        -

                                                                                        Returns the parameters of the distribution.

                                                                                        -
                                                                                        8. -
                                                                                      8. -
                                                                                        void param(const param_type & param);
                                                                                        -

                                                                                        Sets the parameters of the distribution.

                                                                                        -
                                                                                        9. -
                                                                                      9. -
                                                                                        void reset();
                                                                                        -

                                                                                        Effects: Subsequent uses of the distribution do not depend on values produced by any engine prior to invoking reset.

                                                                                        -
                                                                                        10. -
                                                                                      -
                                                                                      -
                                                                                      -

                                                                                      -piecewise_constant_distribution friend functions

                                                                                      -
                                                                                        -
                                                                                      1. -
                                                                                        template<typename CharT, typename Traits> 
-  friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
-             const piecewise_constant_distribution & pcd);
                                                                                        -

                                                                                        Writes a distribution to a std::ostream.

                                                                                        -
                                                                                        2. -
                                                                                      2. -
                                                                                        template<typename CharT, typename Traits> 
-  friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
-             const piecewise_constant_distribution & pcd);
                                                                                        -

                                                                                        Reads a distribution from a std::istream

                                                                                        -
                                                                                        3. -
                                                                                      3. -
                                                                                        friend bool operator==(const piecewise_constant_distribution & lhs, 
-                       const piecewise_constant_distribution & rhs);
                                                                                        -

                                                                                        Returns true if the two distributions will return the same sequence of values, when passed equal generators.

                                                                                        -
                                                                                        4. -
                                                                                      4. -
                                                                                        friend bool operator!=(const piecewise_constant_distribution & lhs, 
-                       const piecewise_constant_distribution & rhs);
                                                                                        -

                                                                                        Returns true if the two distributions may return different sequences of values, when passed equal generators.

                                                                                        -
                                                                                        5. -
                                                                                      -
                                                                                      -
                                                                                      -
                                                                                      - - - -
                                                                                      Copyright © 2000-2005 Jens Maurer
                                                                                      Copyright © 2009, 2010 Steven Watanabe

                                                                                      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                      -
                                                                                      -
                                                                                      -
                                                                                      -PrevUpHomeNext -
                                                                                      - - diff --git a/doc/html/boost/random/piecewise_cons_idp94191504/param_type.html b/doc/html/boost/random/piecewise_cons_idp94191504/param_type.html deleted file mode 100644 index ee32ed575a..0000000000 --- a/doc/html/boost/random/piecewise_cons_idp94191504/param_type.html +++ /dev/null @@ -1,161 +0,0 @@ - - - - -Class param_type - - - - - - - - - - - - - - - -
                                                                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                      -
                                                                                      -
                                                                                      -PrevUpHomeNext -
                                                                                      -
                                                                                      -
                                                                                      -
                                                                                      -

                                                                                      Class param_type

                                                                                      -

                                                                                      boost::random::piecewise_constant_distribution::param_type

                                                                                      -
                                                                                      -

                                                                                      Synopsis

                                                                                      -
                                                                                      // In header: <boost/random/piecewise_constant_distribution.hpp>
-
-
-
-class param_type {
-public:
-  // types
-  typedef piecewise_constant_distribution distribution_type;
-
-  // construct/copy/destruct
-  param_type();
-  template<typename IntervalIter, typename WeightIter> 
-    param_type(IntervalIter, IntervalIter, WeightIter);
-  template<typename T, typename F> 
-    param_type(const std::initializer_list< T > &, F);
-  template<typename IntervalRange, typename WeightRange> 
-    param_type(const IntervalRange &, const WeightRange &);
-  template<typename F> param_type(std::size_t, RealType, RealType, F);
-
-  // friend functions
-  template<typename CharT, typename Traits> 
-    friend std::basic_ostream< CharT, Traits > & 
-    operator<<(std::basic_ostream< CharT, Traits > &, const param_type &);
-  template<typename CharT, typename Traits> 
-    friend std::basic_istream< CharT, Traits > & 
-    operator>>(std::basic_istream< CharT, Traits > &, const param_type &);
-  friend bool operator==(const param_type &, const param_type &);
-  friend bool operator!=(const param_type &, const param_type &);
-
-  // public member functions
-  std::vector< RealType > intervals() const;
-  std::vector< RealType > densities() const;
-};
                                                                                      -
                                                                                      -

                                                                                      Description

                                                                                      -
                                                                                      -

                                                                                      -param_type - public - construct/copy/destruct

                                                                                      -
                                                                                        -
                                                                                      1. -
                                                                                        param_type();
                                                                                        -

                                                                                        Constructs a param_type object, representing a distribution that produces values uniformly distributed in the range [0, 1).

                                                                                        -
                                                                                        2. -
                                                                                      2. -
                                                                                        template<typename IntervalIter, typename WeightIter> 
-  param_type(IntervalIter intervals_first, IntervalIter intervals_last, 
-             WeightIter weight_first);
                                                                                        -

                                                                                        Constructs a param_type object from two iterator ranges containing the interval boundaries and the interval weights. If there are less than two boundaries, then this is equivalent to the default constructor and creates a single interval, [0, 1).

                                                                                        -

                                                                                        The values of the interval boundaries must be strictly increasing, and the number of weights must be one less than the number of interval boundaries. If there are extra weights, they are ignored.

                                                                                        -
                                                                                        3. -
                                                                                      3. -
                                                                                        template<typename T, typename F> 
-  param_type(const std::initializer_list< T > & il, F f);
                                                                                        -

                                                                                        Constructs a param_type object from an initializer_list containing the interval boundaries and a unary function specifying the weights. Each weight is determined by calling the function at the midpoint of the corresponding interval.

                                                                                        -

                                                                                        If the initializer_list contains less than two elements, this is equivalent to the default constructor and the distribution will produce values uniformly distributed in the range [0, 1).

                                                                                        -
                                                                                        4. -
                                                                                      4. -
                                                                                        template<typename IntervalRange, typename WeightRange> 
-  param_type(const IntervalRange & intervals_arg, 
-             const WeightRange & weights_arg);
                                                                                        -

                                                                                        Constructs a param_type object from Boost.Range ranges holding the interval boundaries and the weights. If there are less than two interval boundaries, this is equivalent to the default constructor and the distribution will produce values uniformly distributed in the range [0, 1). The number of weights must be one less than the number of interval boundaries.

                                                                                        -
                                                                                        5. -
                                                                                      5. -
                                                                                        template<typename F> 
-  param_type(std::size_t nw, RealType xmin, RealType xmax, F f);
                                                                                        -

                                                                                        Constructs the parameters for a distribution that approximates a function. The range of the distribution is [xmin, xmax). This range is divided into nw equally sized intervals and the weights are found by calling the unary function f on the midpoints of the intervals.

                                                                                        -
                                                                                        6. -
                                                                                      -
                                                                                      -
                                                                                      -

                                                                                      -param_type friend functions

                                                                                      -
                                                                                        -
                                                                                      1. -
                                                                                        template<typename CharT, typename Traits> 
-  friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
-             const param_type & param);
                                                                                        -

                                                                                        Writes the parameters to a std::ostream.

                                                                                        -
                                                                                        2. -
                                                                                      2. -
                                                                                        template<typename CharT, typename Traits> 
-  friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
-             const param_type & param);
                                                                                        -

                                                                                        Reads the parameters from a std::istream.

                                                                                        -
                                                                                        3. -
                                                                                      3. -
                                                                                        friend bool operator==(const param_type & lhs, const param_type & rhs);
                                                                                        -

                                                                                        Returns true if the two sets of parameters are the same.

                                                                                        -
                                                                                        4. -
                                                                                      4. -
                                                                                        friend bool operator!=(const param_type & lhs, const param_type & rhs);
                                                                                        -

                                                                                        Returns true if the two sets of parameters are different.

                                                                                        -
                                                                                        5. -
                                                                                      -
                                                                                      -
                                                                                      -

                                                                                      -param_type public member functions

                                                                                      -
                                                                                        -
                                                                                      1. -
                                                                                        std::vector< RealType > intervals() const;
                                                                                        -

                                                                                        Returns a vector containing the interval boundaries.

                                                                                        -
                                                                                        2. -
                                                                                      2. -
                                                                                        std::vector< RealType > densities() const;
                                                                                        -

                                                                                        Returns a vector containing the probability densities over all the intervals of the distribution.

                                                                                        -
                                                                                        3. -
                                                                                      -
                                                                                      -
                                                                                      -
                                                                                      - - - -
                                                                                      Copyright © 2000-2005 Jens Maurer
                                                                                      Copyright © 2009, 2010 Steven Watanabe

                                                                                      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                      -
                                                                                      -
                                                                                      -
                                                                                      -PrevUpHomeNext -
                                                                                      - - diff --git a/doc/html/boost/random/piecewise_lin_idp226179472.html b/doc/html/boost/random/piecewise_lin_idp226179472.html deleted file mode 100644 index 7f642698ec..0000000000 --- a/doc/html/boost/random/piecewise_lin_idp226179472.html +++ /dev/null @@ -1,253 +0,0 @@ - - - - -Class template piecewise_linear_distribution - - - - - - - - - - - - - - - -
                                                                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                      -
                                                                                      -
                                                                                      -PrevUpHomeNext -
                                                                                      -
                                                                                      -
                                                                                      -
                                                                                      -

                                                                                      Class template piecewise_linear_distribution

                                                                                      -

                                                                                      boost::random::piecewise_linear_distribution

                                                                                      -
                                                                                      -

                                                                                      Synopsis

                                                                                      -
                                                                                      // In header: <boost/random/piecewise_linear_distribution.hpp>
-
-template<typename RealType = double> 
-class piecewise_linear_distribution {
-public:
-  // types
-  typedef std::size_t input_type; 
-  typedef RealType    result_type;
-
-  // member classes/structs/unions
-
-  class param_type {
-  public:
-    // types
-    typedef piecewise_linear_distribution distribution_type;
-
-    // construct/copy/destruct
-    param_type();
-    template<typename IntervalIter, typename WeightIter> 
-      param_type(IntervalIter, IntervalIter, WeightIter);
-    template<typename T, typename F> 
-      param_type(const std::initializer_list< T > &, F);
-    template<typename IntervalRange, typename WeightRange> 
-      param_type(const IntervalRange &, const WeightRange &);
-    template<typename F> param_type(std::size_t, RealType, RealType, F);
-
-    // friend functions
-    template<typename CharT, typename Traits> 
-      friend std::basic_ostream< CharT, Traits > & 
-      operator<<(std::basic_ostream< CharT, Traits > &, const param_type &);
-    template<typename CharT, typename Traits> 
-      friend std::basic_istream< CharT, Traits > & 
-      operator>>(std::basic_istream< CharT, Traits > &, const param_type &);
-    friend bool operator==(const param_type &, const param_type &);
-    friend bool operator!=(const param_type &, const param_type &);
-
-    // public member functions
-    std::vector< RealType > intervals() const;
-    std::vector< RealType > densities() const;
-  };
-
-  // construct/copy/destruct
-  piecewise_linear_distribution();
-  template<typename IntervalIter, typename WeightIter> 
-    piecewise_linear_distribution(IntervalIter, IntervalIter, WeightIter);
-  template<typename T, typename F> 
-    piecewise_linear_distribution(std::initializer_list< T >, F);
-  template<typename IntervalsRange, typename WeightsRange> 
-    piecewise_linear_distribution(const IntervalsRange &, 
-                                  const WeightsRange &);
-  template<typename F> 
-    piecewise_linear_distribution(std::size_t, RealType, RealType, F);
-  explicit piecewise_linear_distribution(const param_type &);
-
-  // public member functions
-  template<typename URNG> RealType operator()(URNG &) const;
-  template<typename URNG> 
-    RealType operator()(URNG &, const param_type &) const;
-  result_type min() const;
-  result_type max() const;
-  std::vector< RealType > densities() const;
-  std::vector< RealType > intervals() const;
-  param_type param() const;
-  void param(const param_type &);
-  void reset();
-
-  // friend functions
-  template<typename CharT, typename Traits> 
-    friend std::basic_ostream< CharT, Traits > & 
-    operator<<(std::basic_ostream< CharT, Traits > &, 
-               const piecewise_linear_distribution &);
-  template<typename CharT, typename Traits> 
-    friend std::basic_istream< CharT, Traits > & 
-    operator>>(std::basic_istream< CharT, Traits > &, 
-               const piecewise_linear_distribution &);
-  friend bool operator==(const piecewise_linear_distribution &, 
-                         const piecewise_linear_distribution &);
-  friend bool operator!=(const piecewise_linear_distribution &, 
-                         const piecewise_linear_distribution &);
-};
                                                                                      -
                                                                                      -

                                                                                      Description

                                                                                      -

                                                                                      The class piecewise_linear_distribution models a random distribution .

                                                                                      -
                                                                                      -

                                                                                      -piecewise_linear_distribution - public - construct/copy/destruct

                                                                                      -
                                                                                        -
                                                                                      1. -
                                                                                        piecewise_linear_distribution();
                                                                                        -

                                                                                        Creates a new piecewise_linear_distribution that produces values uniformly distributed in the range [0, 1).

                                                                                        -
                                                                                        2. -
                                                                                      2. -
                                                                                        template<typename IntervalIter, typename WeightIter> 
-  piecewise_linear_distribution(IntervalIter first_interval, 
-                                IntervalIter last_interval, 
-                                WeightIter first_weight);
                                                                                        -

                                                                                        Constructs a piecewise_linear_distribution from two iterator ranges containing the interval boundaries and the weights at the boundaries. If there are fewer than two boundaries, then this is equivalent to the default constructor and creates a distribution that produces values uniformly distributed in the range [0, 1).

                                                                                        -

                                                                                        The values of the interval boundaries must be strictly increasing, and the number of weights must be equal to the number of interval boundaries. If there are extra weights, they are ignored.

                                                                                        -

                                                                                        For example,

                                                                                        -
                                                                                        double intervals[] = { 0.0, 1.0, 2.0 };
-double weights[] = { 0.0, 1.0, 0.0 };
-piecewise_constant_distribution<> dist(
-    &intervals[0], &intervals[0] + 3, &weights[0]);
-
                                                                                        -

                                                                                        produces a triangle distribution.

                                                                                        -
                                                                                        3. -
                                                                                      3. -
                                                                                        template<typename T, typename F> 
-  piecewise_linear_distribution(std::initializer_list< T > il, F f);
                                                                                        -

                                                                                        Constructs a piecewise_linear_distribution from an initializer_list containing the interval boundaries and a unary function specifying the weights. Each weight is determined by calling the function at the corresponding interval boundary.

                                                                                        -

                                                                                        If the initializer_list contains fewer than two elements, this is equivalent to the default constructor and the distribution will produce values uniformly distributed in the range [0, 1).

                                                                                        -
                                                                                        4. -
                                                                                      4. -
                                                                                        template<typename IntervalsRange, typename WeightsRange> 
-  piecewise_linear_distribution(const IntervalsRange & intervals_arg, 
-                                const WeightsRange & weights_arg);
                                                                                        -

                                                                                        Constructs a piecewise_linear_distribution from Boost.Range ranges holding the interval boundaries and the weights. If there are fewer than two interval boundaries, this is equivalent to the default constructor and the distribution will produce values uniformly distributed in the range [0, 1). The number of weights must be equal to the number of interval boundaries.

                                                                                        -
                                                                                        5. -
                                                                                      5. -
                                                                                        template<typename F> 
-  piecewise_linear_distribution(std::size_t nw, RealType xmin, RealType xmax, 
-                                F f);
                                                                                        -

                                                                                        Constructs a piecewise_linear_distribution that approximates a function. The range of the distribution is [xmin, xmax). This range is divided into nw equally sized intervals and the weights are found by calling the unary function f on the interval boundaries.

                                                                                        -
                                                                                        6. -
                                                                                      6. -
                                                                                        explicit piecewise_linear_distribution(const param_type & param);
                                                                                        -

                                                                                        Constructs a piecewise_linear_distribution from its parameters.

                                                                                        -
                                                                                        7. -
                                                                                      -
                                                                                      -
                                                                                      -

                                                                                      -piecewise_linear_distribution public member functions

                                                                                      -
                                                                                        -
                                                                                      1. -
                                                                                        template<typename URNG> RealType operator()(URNG & urng) const;
                                                                                        -

                                                                                        Returns a value distributed according to the parameters of the piecewise_linear_distribution.

                                                                                        -
                                                                                        2. -
                                                                                      2. -
                                                                                        template<typename URNG> 
-  RealType operator()(URNG & urng, const param_type & param) const;
                                                                                        -

                                                                                        Returns a value distributed according to the parameters specified by param.

                                                                                        -
                                                                                        3. -
                                                                                      3. -
                                                                                        result_type min() const;
                                                                                        -

                                                                                        Returns the smallest value that the distribution can produce.

                                                                                        -
                                                                                        4. -
                                                                                      4. -
                                                                                        result_type max() const;
                                                                                        -

                                                                                        Returns the largest value that the distribution can produce.

                                                                                        -
                                                                                        5. -
                                                                                      5. -
                                                                                        std::vector< RealType > densities() const;
                                                                                        -

                                                                                        Returns a vector containing the probability densities at the interval boundaries.

                                                                                        -
                                                                                        6. -
                                                                                      6. -
                                                                                        std::vector< RealType > intervals() const;
                                                                                        -

                                                                                        Returns a vector containing the interval boundaries.

                                                                                        -
                                                                                        7. -
                                                                                      7. -
                                                                                        param_type param() const;
                                                                                        -

                                                                                        Returns the parameters of the distribution.

                                                                                        -
                                                                                        8. -
                                                                                      8. -
                                                                                        void param(const param_type & param);
                                                                                        -

                                                                                        Sets the parameters of the distribution.

                                                                                        -
                                                                                        9. -
                                                                                      9. -
                                                                                        void reset();
                                                                                        -

                                                                                        Effects: Subsequent uses of the distribution do not depend on values produced by any engine prior to invoking reset.

                                                                                        -
                                                                                        10. -
                                                                                      -
                                                                                      -
                                                                                      -

                                                                                      -piecewise_linear_distribution friend functions

                                                                                      -
                                                                                        -
                                                                                      1. -
                                                                                        template<typename CharT, typename Traits> 
-  friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
-             const piecewise_linear_distribution & pld);
                                                                                        -

                                                                                        Writes a distribution to a std::ostream.

                                                                                        -
                                                                                        2. -
                                                                                      2. -
                                                                                        template<typename CharT, typename Traits> 
-  friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
-             const piecewise_linear_distribution & pld);
                                                                                        -

                                                                                        Reads a distribution from a std::istream

                                                                                        -
                                                                                        3. -
                                                                                      3. -
                                                                                        friend bool operator==(const piecewise_linear_distribution & lhs, 
-                       const piecewise_linear_distribution & rhs);
                                                                                        -

                                                                                        Returns true if the two distributions will return the same sequence of values, when passed equal generators.

                                                                                        -
                                                                                        4. -
                                                                                      4. -
                                                                                        friend bool operator!=(const piecewise_linear_distribution & lhs, 
-                       const piecewise_linear_distribution & rhs);
                                                                                        -

                                                                                        Returns true if the two distributions may return different sequences of values, when passed equal generators.

                                                                                        -
                                                                                        5. -
                                                                                      -
                                                                                      -
                                                                                      -
                                                                                      - - - -
                                                                                      Copyright © 2000-2005 Jens Maurer
                                                                                      Copyright © 2009, 2010 Steven Watanabe

                                                                                      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                      -
                                                                                      -
                                                                                      -
                                                                                      -PrevUpHomeNext -
                                                                                      - - diff --git a/doc/html/boost/random/piecewise_lin_idp226179472/param_type.html b/doc/html/boost/random/piecewise_lin_idp226179472/param_type.html deleted file mode 100644 index 563793b25c..0000000000 --- a/doc/html/boost/random/piecewise_lin_idp226179472/param_type.html +++ /dev/null @@ -1,161 +0,0 @@ - - - - -Class param_type - - - - - - - - - - - - - - - -
                                                                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                      -
                                                                                      -
                                                                                      -PrevUpHomeNext -
                                                                                      -
                                                                                      -
                                                                                      -
                                                                                      -

                                                                                      Class param_type

                                                                                      -

                                                                                      boost::random::piecewise_linear_distribution::param_type

                                                                                      -
                                                                                      -

                                                                                      Synopsis

                                                                                      -
                                                                                      // In header: <boost/random/piecewise_linear_distribution.hpp>
-
-
-
-class param_type {
-public:
-  // types
-  typedef piecewise_linear_distribution distribution_type;
-
-  // construct/copy/destruct
-  param_type();
-  template<typename IntervalIter, typename WeightIter> 
-    param_type(IntervalIter, IntervalIter, WeightIter);
-  template<typename T, typename F> 
-    param_type(const std::initializer_list< T > &, F);
-  template<typename IntervalRange, typename WeightRange> 
-    param_type(const IntervalRange &, const WeightRange &);
-  template<typename F> param_type(std::size_t, RealType, RealType, F);
-
-  // friend functions
-  template<typename CharT, typename Traits> 
-    friend std::basic_ostream< CharT, Traits > & 
-    operator<<(std::basic_ostream< CharT, Traits > &, const param_type &);
-  template<typename CharT, typename Traits> 
-    friend std::basic_istream< CharT, Traits > & 
-    operator>>(std::basic_istream< CharT, Traits > &, const param_type &);
-  friend bool operator==(const param_type &, const param_type &);
-  friend bool operator!=(const param_type &, const param_type &);
-
-  // public member functions
-  std::vector< RealType > intervals() const;
-  std::vector< RealType > densities() const;
-};
                                                                                      -
                                                                                      -

                                                                                      Description

                                                                                      -
                                                                                      -

                                                                                      -param_type - public - construct/copy/destruct

                                                                                      -
                                                                                        -
                                                                                      1. -
                                                                                        param_type();
                                                                                        -

                                                                                        Constructs a param_type object, representing a distribution that produces values uniformly distributed in the range [0, 1).

                                                                                        -
                                                                                        2. -
                                                                                      2. -
                                                                                        template<typename IntervalIter, typename WeightIter> 
-  param_type(IntervalIter intervals_first, IntervalIter intervals_last, 
-             WeightIter weight_first);
                                                                                        -

                                                                                        Constructs a param_type object from two iterator ranges containing the interval boundaries and weights at the boundaries. If there are fewer than two boundaries, then this is equivalent to the default constructor and the distribution will produce values uniformly distributed in the range [0, 1).

                                                                                        -

                                                                                        The values of the interval boundaries must be strictly increasing, and the number of weights must be the same as the number of interval boundaries. If there are extra weights, they are ignored.

                                                                                        -
                                                                                        3. -
                                                                                      3. -
                                                                                        template<typename T, typename F> 
-  param_type(const std::initializer_list< T > & il, F f);
                                                                                        -

                                                                                        Constructs a param_type object from an initializer_list containing the interval boundaries and a unary function specifying the weights at the boundaries. Each weight is determined by calling the function at the corresponding point.

                                                                                        -

                                                                                        If the initializer_list contains fewer than two elements, this is equivalent to the default constructor and the distribution will produce values uniformly distributed in the range [0, 1).

                                                                                        -
                                                                                        4. -
                                                                                      4. -
                                                                                        template<typename IntervalRange, typename WeightRange> 
-  param_type(const IntervalRange & intervals_arg, 
-             const WeightRange & weights_arg);
                                                                                        -

                                                                                        Constructs a param_type object from Boost.Range ranges holding the interval boundaries and the weights at the boundaries. If there are fewer than two interval boundaries, this is equivalent to the default constructor and the distribution will produce values uniformly distributed in the range [0, 1). The number of weights must be equal to the number of interval boundaries.

                                                                                        -
                                                                                        5. -
                                                                                      5. -
                                                                                        template<typename F> 
-  param_type(std::size_t nw, RealType xmin, RealType xmax, F f);
                                                                                        -

                                                                                        Constructs the parameters for a distribution that approximates a function. The range of the distribution is [xmin, xmax). This range is divided into nw equally sized intervals and the weights are found by calling the unary function f on the boundaries of the intervals.

                                                                                        -
                                                                                        6. -
                                                                                      -
                                                                                      -
                                                                                      -

                                                                                      -param_type friend functions

                                                                                      -
                                                                                        -
                                                                                      1. -
                                                                                        template<typename CharT, typename Traits> 
-  friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
-             const param_type & param);
                                                                                        -

                                                                                        Writes the parameters to a std::ostream.

                                                                                        -
                                                                                        2. -
                                                                                      2. -
                                                                                        template<typename CharT, typename Traits> 
-  friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
-             const param_type & param);
                                                                                        -

                                                                                        Reads the parameters from a std::istream.

                                                                                        -
                                                                                        3. -
                                                                                      3. -
                                                                                        friend bool operator==(const param_type & lhs, const param_type & rhs);
                                                                                        -

                                                                                        Returns true if the two sets of parameters are the same.

                                                                                        -
                                                                                        4. -
                                                                                      4. -
                                                                                        friend bool operator!=(const param_type & lhs, const param_type & rhs);
                                                                                        -

                                                                                        Returns true if the two sets of parameters are different.

                                                                                        -
                                                                                        5. -
                                                                                      -
                                                                                      -
                                                                                      -

                                                                                      -param_type public member functions

                                                                                      -
                                                                                        -
                                                                                      1. -
                                                                                        std::vector< RealType > intervals() const;
                                                                                        -

                                                                                        Returns a vector containing the interval boundaries.

                                                                                        -
                                                                                        2. -
                                                                                      2. -
                                                                                        std::vector< RealType > densities() const;
                                                                                        -

                                                                                        Returns a vector containing the probability densities at all the interval boundaries.

                                                                                        -
                                                                                        3. -
                                                                                      -
                                                                                      -
                                                                                      -
                                                                                      - - - -
                                                                                      Copyright © 2000-2005 Jens Maurer
                                                                                      Copyright © 2009, 2010 Steven Watanabe

                                                                                      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                      -
                                                                                      -
                                                                                      -
                                                                                      -PrevUpHomeNext -
                                                                                      - - diff --git a/doc/html/boost/random/poisson_distribution.html b/doc/html/boost/random/poisson_distribution.html index 6be48a39a5..537ca3999c 100644 --- a/doc/html/boost/random/poisson_distribution.html +++ b/doc/html/boost/random/poisson_distribution.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                                                                                      -PrevUpHomeNext +PrevUpHomeNext
                                                                                      @@ -47,137 +47,137 @@ typedef poisson_distribution distribution_type; // construct/copy/destruct - explicit param_type(RealType = 1); + explicit param_type(RealType = 1); - // public member functions - RealType mean() const; + // public member functions + RealType mean() const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); + operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, param_type &); - friend bool operator==(const param_type &, const param_type &); - friend bool operator!=(const param_type &, const param_type &); + operator>>(std::basic_istream< CharT, Traits > &, param_type &); + friend bool operator==(const param_type &, const param_type &); + friend bool operator!=(const param_type &, const param_type &); }; // construct/copy/destruct - explicit poisson_distribution(RealType = 1); - explicit poisson_distribution(const param_type &); + explicit poisson_distribution(RealType = 1); + explicit poisson_distribution(const param_type &); - // public member functions - template<typename URNG> IntType operator()(URNG &) const; - template<typename URNG> IntType operator()(URNG &, const param_type &) const; - RealType mean() const; - IntType min() const; - IntType max() const; - param_type param() const; - void param(const param_type &); - void reset(); + // public member functions + template<typename URNG> IntType operator()(URNG &) const; + template<typename URNG> IntType operator()(URNG &, const param_type &) const; + RealType mean() const; + IntType min() const; + IntType max() const; + param_type param() const; + void param(const param_type &); + void reset(); - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, + operator<<(std::basic_ostream< CharT, Traits > &, const poisson_distribution &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, poisson_distribution &); - friend bool operator==(const poisson_distribution &, + operator>>(std::basic_istream< CharT, Traits > &, poisson_distribution &); + friend bool operator==(const poisson_distribution &, const poisson_distribution &); - friend bool operator!=(const poisson_distribution &, + friend bool operator!=(const poisson_distribution &, const poisson_distribution &); };
                                                                                      -

                                                                                      Description

                                                                                      -

                                                                                      An instantiation of the class template poisson_distribution is a model of random distribution . The poisson distribution has

                                                                                      +

                                                                                      Description

                                                                                      +

                                                                                      An instantiation of the class template poisson_distribution is a model of random distribution . The poisson distribution has

                                                                                      This implementation is based on the PTRD algorithm described

                                                                                      "The transformed rejection method for generating Poisson random variables", Wolfgang Hormann, Insurance: Mathematics and Economics Volume 12, Issue 1, February 1993, Pages 39-45

                                                                                      -

                                                                                      +

                                                                                      poisson_distribution public construct/copy/destruct

                                                                                      1. -
                                                                                        explicit poisson_distribution(RealType mean = 1);
                                                                                        +
                                                                                        explicit poisson_distribution(RealType mean = 1);

                                                                                        Constructs a poisson_distribution with the parameter mean.

                                                                                        Requires: mean > 0

                                                                                      2. -
                                                                                        explicit poisson_distribution(const param_type & param);
                                                                                        +
                                                                                        explicit poisson_distribution(const param_type & param);

                                                                                        Construct an poisson_distribution object from the parameters.

                                                                                      -

                                                                                      -poisson_distribution public member functions

                                                                                      +

                                                                                      +poisson_distribution public member functions

                                                                                      1. -
                                                                                        template<typename URNG> IntType operator()(URNG & urng) const;
                                                                                        +
                                                                                        template<typename URNG> IntType operator()(URNG & urng) const;

                                                                                        Returns a random variate distributed according to the poisson distribution. 

                                                                                      2. template<typename URNG> 
-  IntType operator()(URNG & urng, const param_type & param) const;
                                                                                        + IntType operator()(URNG & urng, const param_type & param) const;

                                                                                        Returns a random variate distributed according to the poisson distribution with parameters specified by param.

                                                                                      3. -
                                                                                        RealType mean() const;
                                                                                        +
                                                                                        RealType mean() const;

                                                                                        Returns the "mean" parameter of the distribution.

                                                                                      4. -
                                                                                        IntType min() const;
                                                                                        +
                                                                                        IntType min() const;

                                                                                        Returns the smallest value that the distribution can produce.

                                                                                      5. -
                                                                                        IntType max() const;
                                                                                        +
                                                                                        IntType max() const;

                                                                                        Returns the largest value that the distribution can produce.

                                                                                      6. -
                                                                                        param_type param() const;
                                                                                        +
                                                                                        param_type param() const;

                                                                                        Returns the parameters of the distribution.

                                                                                      7. -
                                                                                        void param(const param_type & param);
                                                                                        +
                                                                                        void param(const param_type & param);

                                                                                        Sets parameters of the distribution.

                                                                                      8. -
                                                                                        void reset();
                                                                                        +
                                                                                        void reset();

                                                                                        Effects: Subsequent uses of the distribution do not depend on values produced by any engine prior to invoking reset.

                                                                                      -

                                                                                      -poisson_distribution friend functions

                                                                                      +

                                                                                      +poisson_distribution friend functions

                                                                                      1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const poisson_distribution & pd);

                                                                                        Writes the parameters of the distribution to a std::ostream. 

                                                                                      2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
              poisson_distribution & pd);

                                                                                        Reads the parameters of the distribution from a std::istream.

                                                                                      3. -
                                                                                        friend bool operator==(const poisson_distribution & lhs, 
+
                                                                                        friend bool operator==(const poisson_distribution & lhs, 
                        const poisson_distribution & rhs);
                                                                                        
 
                                                                                        Returns true if the two distributions will produce the same sequence of values, given equal generators.
                                                                                      4. -
                                                                                        friend bool operator!=(const poisson_distribution & lhs, 
+
                                                                                        friend bool operator!=(const poisson_distribution & lhs, 
                        const poisson_distribution & rhs);
                                                                                        
 
                                                                                        Returns true if the two distributions could produce different sequences of values, given equal generators.
                                                                                        5. @@ -195,7 +195,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        diff --git a/doc/html/boost/random/poisson_distribution/param_type.html b/doc/html/boost/random/poisson_distribution/param_type.html index ef5cfad51c..81e0813282 100644 --- a/doc/html/boost/random/poisson_distribution/param_type.html +++ b/doc/html/boost/random/poisson_distribution/param_type.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        @@ -40,62 +40,62 @@ typedef poisson_distribution distribution_type; // construct/copy/destruct - explicit param_type(RealType = 1); + explicit param_type(RealType = 1); - // public member functions - RealType mean() const; + // public member functions + RealType mean() const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); + operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, param_type &); - friend bool operator==(const param_type &, const param_type &); - friend bool operator!=(const param_type &, const param_type &); + operator>>(std::basic_istream< CharT, Traits > &, param_type &); + friend bool operator==(const param_type &, const param_type &); + friend bool operator!=(const param_type &, const param_type &); };
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        -

                                                                                        +

                                                                                        param_type public construct/copy/destruct

                                                                                        1. -
                                                                                          explicit param_type(RealType mean = 1);
                                                                                          +
                                                                                          explicit param_type(RealType mean = 1);

                                                                                          Construct a param_type object with the parameter "mean"

                                                                                          Requires: mean > 0

                                                                                        -

                                                                                        -param_type public member functions

                                                                                        -
                                                                                        1. RealType mean() const;
                                                                                        +

                                                                                        +param_type public member functions

                                                                                        +
                                                                                        1. RealType mean() const;
                                                                                        -

                                                                                        -param_type friend functions

                                                                                        +

                                                                                        +param_type friend functions

                                                                                        1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const param_type & param);

                                                                                          Writes the parameters of the distribution to a std::ostream. 

                                                                                        2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, param_type & param);
                                                                                          + operator>>(std::basic_istream< CharT, Traits > & is, param_type & param);

                                                                                          Reads the parameters of the distribution from a std::istream.

                                                                                        3. -
                                                                                          friend bool operator==(const param_type & lhs, const param_type & rhs);
                                                                                          +
                                                                                          friend bool operator==(const param_type & lhs, const param_type & rhs);

                                                                                          Returns true if the parameters have the same values.

                                                                                        4. -
                                                                                          friend bool operator!=(const param_type & lhs, const param_type & rhs);
                                                                                          +
                                                                                          friend bool operator!=(const param_type & lhs, const param_type & rhs);

                                                                                          Returns true if the parameters have different values.

                                                                                        @@ -112,7 +112,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        diff --git a/doc/html/boost/random/rand48.html b/doc/html/boost/random/rand48.html index 8db9b24e21..c4a46772b8 100644 --- a/doc/html/boost/random/rand48.html +++ b/doc/html/boost/random/rand48.html @@ -39,135 +39,135 @@ typedef boost::uint32_t result_type; // construct/copy/destruct - rand48(); - explicit rand48(result_type); - template<typename SeedSeq> explicit rand48(SeedSeq &); - template<typename It> rand48(It &, It); + rand48(); + explicit rand48(result_type); + template<typename SeedSeq> explicit rand48(SeedSeq &); + template<typename It> rand48(It &, It); - // public static functions - static uint32_t min(); - static uint32_t max(); + // public static functions + static uint32_t min(); + static uint32_t max(); - // public member functions - void seed(); - void seed(result_type); - template<typename It> void seed(It &, It); - template<typename SeedSeq> void seed(SeedSeq &); - uint32_t operator()(); - void discard(boost::uintmax_t); - template<typename Iter> void generate(Iter, Iter); + // public member functions + void seed(); + void seed(result_type); + template<typename It> void seed(It &, It); + template<typename SeedSeq> void seed(SeedSeq &); + uint32_t operator()(); + void discard(boost::uintmax_t); + template<typename Iter> void generate(Iter, Iter); - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, const rand48 &); + operator<<(std::basic_ostream< CharT, Traits > &, const rand48 &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, rand48 &); - friend bool operator==(const rand48 &, const rand48 &); - friend bool operator!=(const rand48 &, const rand48 &); + operator>>(std::basic_istream< CharT, Traits > &, rand48 &); + friend bool operator==(const rand48 &, const rand48 &); + friend bool operator!=(const rand48 &, const rand48 &); // public data members static const bool has_fixed_range; };
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        Class rand48 models a pseudo-random number generator . It uses the linear congruential algorithm with the parameters a = 0x5DEECE66D, c = 0xB, m = 2**48. It delivers identical results to the lrand48() function available on some systems (assuming lcong48 has not been called).

                                                                                        It is only available on systems where uint64_t is provided as an integral type, so that for example static in-class constants and/or enum definitions with large uint64_t numbers work.

                                                                                        -

                                                                                        +

                                                                                        rand48 public construct/copy/destruct

                                                                                        1. -
                                                                                          rand48();
                                                                                          +
                                                                                          rand48();

                                                                                          Seeds the generator with the default seed.

                                                                                        2. -
                                                                                          explicit rand48(result_type x0);
                                                                                          +
                                                                                          explicit rand48(result_type x0);

                                                                                          Constructs a rand48 generator with x(0) := (x0 << 16) | 0x330e.

                                                                                        3. -
                                                                                          template<typename SeedSeq> explicit rand48(SeedSeq & seq);
                                                                                          +
                                                                                          template<typename SeedSeq> explicit rand48(SeedSeq & seq);

                                                                                          Seeds the generator with values produced by seq.generate().

                                                                                        4. -
                                                                                          template<typename It> rand48(It & first, It last);
                                                                                          +
                                                                                          template<typename It> rand48(It & first, It last);

                                                                                          Seeds the generator using values from an iterator range, and updates first to point one past the last value consumed.

                                                                                        -

                                                                                        -rand48 public static functions

                                                                                        +

                                                                                        +rand48 public static functions

                                                                                        1. -
                                                                                          static uint32_t min();
                                                                                          +
                                                                                          static uint32_t min();

                                                                                          Returns the smallest value that the generator can produce

                                                                                        2. -
                                                                                          static uint32_t max();
                                                                                          +
                                                                                          static uint32_t max();

                                                                                          Returns the largest value that the generator can produce

                                                                                        -

                                                                                        -rand48 public member functions

                                                                                        +

                                                                                        +rand48 public member functions

                                                                                        1. -
                                                                                          void seed();
                                                                                          +
                                                                                          void seed();

                                                                                          Seeds the generator with the default seed.

                                                                                        2. -
                                                                                          void seed(result_type x0);
                                                                                          +
                                                                                          void seed(result_type x0);

                                                                                          Changes the current value x(n) of the generator to (x0 << 16) | 0x330e.

                                                                                        3. -
                                                                                          template<typename It> void seed(It & first, It last);
                                                                                          +
                                                                                          template<typename It> void seed(It & first, It last);

                                                                                          Seeds the generator using values from an iterator range, and updates first to point one past the last value consumed.

                                                                                        4. -
                                                                                          template<typename SeedSeq> void seed(SeedSeq & seq);
                                                                                          +
                                                                                          template<typename SeedSeq> void seed(SeedSeq & seq);

                                                                                          Seeds the generator with values produced by seq.generate().

                                                                                        5. -
                                                                                          uint32_t operator()();
                                                                                          +
                                                                                          uint32_t operator()();

                                                                                          Returns the next value of the generator.

                                                                                        6. -
                                                                                          void discard(boost::uintmax_t z);
                                                                                          +
                                                                                          void discard(boost::uintmax_t z);

                                                                                          Advances the state of the generator by z.

                                                                                        7. -
                                                                                          template<typename Iter> void generate(Iter first, Iter last);
                                                                                          +
                                                                                          template<typename Iter> void generate(Iter first, Iter last);

                                                                                          Fills a range with random values

                                                                                        -

                                                                                        -rand48 friend functions

                                                                                        +

                                                                                        +rand48 friend functions

                                                                                        1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, const rand48 & r);
                                                                                          + operator<<(std::basic_ostream< CharT, Traits > & os, const rand48 & r);

                                                                                          Writes a rand48 to a std::ostream. 

                                                                                        2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, rand48 & r);
                                                                                          + operator>>(std::basic_istream< CharT, Traits > & is, rand48 & r);

                                                                                          Reads a rand48 from a std::istream.

                                                                                        3. -
                                                                                          friend bool operator==(const rand48 & x, const rand48 & y);
                                                                                          +
                                                                                          friend bool operator==(const rand48 & x, const rand48 & y);

                                                                                          Returns true if the two generators will produce identical sequences of values.

                                                                                        4. -
                                                                                          friend bool operator!=(const rand48 & x, const rand48 & y);
                                                                                          +
                                                                                          friend bool operator!=(const rand48 & x, const rand48 & y);

                                                                                          Returns true if the two generators will produce different sequences of values.

                                                                                        diff --git a/doc/html/boost/random/random_device.html b/doc/html/boost/random/random_device.html index e2fc945d43..5ce33b24f3 100644 --- a/doc/html/boost/random/random_device.html +++ b/doc/html/boost/random/random_device.html @@ -39,24 +39,24 @@ typedef unsigned int result_type; // construct/copy/destruct - random_device(); - explicit random_device(const std::string &); - ~random_device(); + random_device(); + explicit random_device(const std::string &); + ~random_device(); - // public static functions - static result_type min(); - static result_type max(); + // public static functions + static result_type min(); + static result_type max(); - // public member functions - double entropy() const; - unsigned int operator()(); - template<typename Iter> void generate(Iter, Iter); + // public member functions + double entropy() const; + unsigned int operator()(); + template<typename Iter> void generate(Iter, Iter); // public data members static const bool has_fixed_range; };
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        Class random_device models a non-deterministic random number generator . It uses one or more implementation-defined stochastic processes to generate a sequence of uniformly distributed non-deterministic random numbers. For those environments where a non-deterministic random number generator is not available, class random_device must not be implemented. See

                                                                                        "Randomness Recommendations for Security", D. Eastlake, S. Crocker, J. Schiller, Network Working Group, RFC 1750, December 1994

                                                                                        @@ -101,51 +101,51 @@

                                                                                        The measurement error is estimated at +/- 1 usec.

                                                                                        -

                                                                                        +

                                                                                        random_device public construct/copy/destruct

                                                                                        1. -
                                                                                          random_device();
                                                                                          +
                                                                                          random_device();

                                                                                          Constructs a random_device, optionally using the default device.

                                                                                        2. -
                                                                                          explicit random_device(const std::string & token);
                                                                                          +
                                                                                          explicit random_device(const std::string & token);

                                                                                          Constructs a random_device, optionally using the given token as an access specification (for example, a URL) to some implementation-defined service for monitoring a stochastic process.

                                                                                          3. -
                                                                                        3. ~random_device();
                                                                                          4. +
                                                                                        4. ~random_device();
                                                                                        -

                                                                                        -random_device public static functions

                                                                                        +

                                                                                        +random_device public static functions

                                                                                        1. -
                                                                                          static result_type min();
                                                                                          +
                                                                                          static result_type min();

                                                                                          Returns the smallest value that the random_device can produce.

                                                                                        2. -
                                                                                          static result_type max();
                                                                                          +
                                                                                          static result_type max();

                                                                                          Returns the largest value that the random_device can produce.

                                                                                        -

                                                                                        -random_device public member functions

                                                                                        +

                                                                                        +random_device public member functions

                                                                                        1. -
                                                                                          double entropy() const;
                                                                                          +
                                                                                          double entropy() const;

                                                                                          Returns: An entropy estimate for the random numbers returned by operator(), in the range min() to log2( max()+1). A deterministic random number generator (e.g. a pseudo-random number engine) has entropy 0.

                                                                                          Throws: Nothing.

                                                                                        2. -
                                                                                          unsigned int operator()();
                                                                                          +
                                                                                          unsigned int operator()();

                                                                                          Returns a random value in the range [min, max].

                                                                                        3. -
                                                                                          template<typename Iter> void generate(Iter begin, Iter end);
                                                                                          +
                                                                                          template<typename Iter> void generate(Iter begin, Iter end);

                                                                                          Fills a range with random 32-bit values.

                                                                                        diff --git a/doc/html/boost/random/random_number_generator.html b/doc/html/boost/random/random_number_generator.html index 87539c5aa8..21ac2dc78e 100644 --- a/doc/html/boost/random/random_number_generator.html +++ b/doc/html/boost/random/random_number_generator.html @@ -41,30 +41,30 @@ typedef IntType result_type; // construct/copy/destruct - random_number_generator(base_type &); + random_number_generator(base_type &); - // public member functions - result_type operator()(argument_type); + // public member functions + result_type operator()(argument_type); };
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        Instantiations of class template random_number_generator model a RandomNumberGenerator (std:25.2.11 [lib.alg.random.shuffle]). On each invocation, it returns a uniformly distributed integer in the range [0..n).

                                                                                        The template parameter IntType shall denote some integer-like value type.

                                                                                        -

                                                                                        +

                                                                                        random_number_generator public construct/copy/destruct

                                                                                        1. -
                                                                                          random_number_generator(base_type & rng);
                                                                                          +
                                                                                          random_number_generator(base_type & rng);

                                                                                          Constructs a random_number_generator functor with the given uniform random number generator as the underlying source of random numbers.

                                                                                        -

                                                                                        -random_number_generator public member functions

                                                                                        +

                                                                                        +random_number_generator public member functions

                                                                                        1. -
                                                                                          result_type operator()(argument_type n);
                                                                                          +
                                                                                          result_type operator()(argument_type n);

                                                                                          Returns a value in the range [0, n)

                                                                                        diff --git a/doc/html/boost/random/ranlux3.html b/doc/html/boost/random/ranlux3.html index 70ada33dd1..6fa28dfdcb 100644 --- a/doc/html/boost/random/ranlux3.html +++ b/doc/html/boost/random/ranlux3.html @@ -35,7 +35,7 @@ typedef discard_block_engine< ranlux_base, 223, 24 > ranlux3;
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        The ranlux family of generators are described in

                                                                                        "A portable high-quality random number generator for lattice field theory diff --git a/doc/html/boost/random/ranlux3_01.html b/doc/html/boost/random/ranlux3_01.html index 34c68ea0fd..ee84b71c62 100644 --- a/doc/html/boost/random/ranlux3_01.html +++ b/doc/html/boost/random/ranlux3_01.html @@ -35,7 +35,7 @@ typedef discard_block_engine< ranlux_base_01, 223, 24 > ranlux3_01;

                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        The ranlux family of generators are described in

                                                                                        "A portable high-quality random number generator for lattice field theory diff --git a/doc/html/boost/random/ranlux4.html b/doc/html/boost/random/ranlux4.html index 8b5cb53485..e5b5e0b6c3 100644 --- a/doc/html/boost/random/ranlux4.html +++ b/doc/html/boost/random/ranlux4.html @@ -35,7 +35,7 @@ typedef discard_block_engine< ranlux_base, 389, 24 > ranlux4;

                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        The ranlux family of generators are described in

                                                                                        "A portable high-quality random number generator for lattice field theory diff --git a/doc/html/boost/random/ranlux4_01.html b/doc/html/boost/random/ranlux4_01.html index e8bca2017f..f3f218c104 100644 --- a/doc/html/boost/random/ranlux4_01.html +++ b/doc/html/boost/random/ranlux4_01.html @@ -35,7 +35,7 @@ typedef discard_block_engine< ranlux_base_01, 389, 24 > ranlux4_01;

                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        The ranlux family of generators are described in

                                                                                        "A portable high-quality random number generator for lattice field theory diff --git a/doc/html/boost/random/ranlux64_3.html b/doc/html/boost/random/ranlux64_3.html index e3b24ae5f7..f46c9e6cfc 100644 --- a/doc/html/boost/random/ranlux64_3.html +++ b/doc/html/boost/random/ranlux64_3.html @@ -35,7 +35,7 @@ typedef discard_block_engine< ranlux64_base, 223, 24 > ranlux64_3;

                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        The ranlux family of generators are described in

                                                                                        "A portable high-quality random number generator for lattice field theory diff --git a/doc/html/boost/random/ranlux64_3_01.html b/doc/html/boost/random/ranlux64_3_01.html index 56a255cb5f..41d052671f 100644 --- a/doc/html/boost/random/ranlux64_3_01.html +++ b/doc/html/boost/random/ranlux64_3_01.html @@ -35,7 +35,7 @@ typedef discard_block_engine< ranlux64_base_01, 223, 24 > ranlux64_3_01;

                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        The ranlux family of generators are described in

                                                                                        "A portable high-quality random number generator for lattice field theory diff --git a/doc/html/boost/random/ranlux64_4.html b/doc/html/boost/random/ranlux64_4.html index 66e94eca40..c4cdc06b5a 100644 --- a/doc/html/boost/random/ranlux64_4.html +++ b/doc/html/boost/random/ranlux64_4.html @@ -35,7 +35,7 @@ typedef discard_block_engine< ranlux64_base, 389, 24 > ranlux64_4;

                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        The ranlux family of generators are described in

                                                                                        "A portable high-quality random number generator for lattice field theory diff --git a/doc/html/boost/random/ranlux64_4_01.html b/doc/html/boost/random/ranlux64_4_01.html index 39d66930e6..f46cff7747 100644 --- a/doc/html/boost/random/ranlux64_4_01.html +++ b/doc/html/boost/random/ranlux64_4_01.html @@ -35,7 +35,7 @@ typedef discard_block_engine< ranlux64_base_01, 389, 24 > ranlux64_4_01;

                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        The ranlux family of generators are described in

                                                                                        "A portable high-quality random number generator for lattice field theory diff --git a/doc/html/boost/random/seed_seq.html b/doc/html/boost/random/seed_seq.html index 9560897a66..50e1086ef7 100644 --- a/doc/html/boost/random/seed_seq.html +++ b/doc/html/boost/random/seed_seq.html @@ -39,58 +39,58 @@ typedef boost::uint_least32_t result_type; // construct/copy/destruct - seed_seq(); - template<typename T> seed_seq(const std::initializer_list< T > &); - template<typename Iter> seed_seq(Iter, Iter); - template<typename Range> explicit seed_seq(const Range &); + seed_seq(); + template<typename T> seed_seq(const std::initializer_list< T > &); + template<typename Iter> seed_seq(Iter, Iter); + template<typename Range> explicit seed_seq(const Range &); - // public member functions - template<typename Iter> void generate(Iter, Iter) const; - std::size_t size() const; - template<typename Iter> void param(Iter); + // public member functions + template<typename Iter> void generate(Iter, Iter) const; + std::size_t size() const; + template<typename Iter> void param(Iter); };

                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        The class seed_seq stores a sequence of 32-bit words for seeding a pseudo-random number generator . These words will be combined to fill the entire state of the generator.

                                                                                        -

                                                                                        +

                                                                                        seed_seq public construct/copy/destruct

                                                                                        1. -
                                                                                          seed_seq();
                                                                                          +
                                                                                          seed_seq();

                                                                                          Initializes a seed_seq to hold an empty sequence.

                                                                                        2. -
                                                                                          template<typename T> seed_seq(const std::initializer_list< T > & il);
                                                                                          +
                                                                                          template<typename T> seed_seq(const std::initializer_list< T > & il);

                                                                                          Initializes the sequence from an initializer_list.

                                                                                        3. -
                                                                                          template<typename Iter> seed_seq(Iter first, Iter last);
                                                                                          +
                                                                                          template<typename Iter> seed_seq(Iter first, Iter last);

                                                                                          Initializes the sequence from an iterator range.

                                                                                        4. -
                                                                                          template<typename Range> explicit seed_seq(const Range & range);
                                                                                          +
                                                                                          template<typename Range> explicit seed_seq(const Range & range);

                                                                                          Initializes the sequence from Boost.Range range.

                                                                                        -

                                                                                        -seed_seq public member functions

                                                                                        +

                                                                                        +seed_seq public member functions

                                                                                        1. -
                                                                                          template<typename Iter> void generate(Iter first, Iter last) const;
                                                                                          +
                                                                                          template<typename Iter> void generate(Iter first, Iter last) const;

                                                                                          Fills a range with 32-bit values based on the stored sequence.

                                                                                          Requires: Iter must be a Random Access Iterator whose value type is an unsigned integral type at least 32 bits wide.

                                                                                        2. -
                                                                                          std::size_t size() const;
                                                                                          +
                                                                                          std::size_t size() const;

                                                                                          Returns the size of the sequence.

                                                                                        3. -
                                                                                          template<typename Iter> void param(Iter out);
                                                                                          +
                                                                                          template<typename Iter> void param(Iter out);

                                                                                          Writes the stored sequence to iter.

                                                                                        diff --git a/doc/html/boost/random/shuffle_order_engine.html b/doc/html/boost/random/shuffle_order_engine.html index ceb99b6219..daf739621f 100644 --- a/doc/html/boost/random/shuffle_order_engine.html +++ b/doc/html/boost/random/shuffle_order_engine.html @@ -40,39 +40,39 @@ typedef base_type::result_type result_type; // construct/copy/destruct - shuffle_order_engine(); - explicit shuffle_order_engine(result_type); - template<typename SeedSeq> explicit shuffle_order_engine(SeedSeq &); - explicit shuffle_order_engine(const base_type &); - explicit shuffle_order_engine(base_type &&); - template<typename It> shuffle_order_engine(It &, It); + shuffle_order_engine(); + explicit shuffle_order_engine(result_type); + template<typename SeedSeq> explicit shuffle_order_engine(SeedSeq &); + explicit shuffle_order_engine(const base_type &); + explicit shuffle_order_engine(base_type &&); + template<typename It> shuffle_order_engine(It &, It); - // public member functions - void seed(); - void seed(result_type); - template<typename SeedSeq> void seed(SeedSeq &); - template<typename It> void seed(It &, It); - const base_type & base() const; - result_type operator()(); - void discard(boost::uintmax_t); - template<typename Iter> void generate(Iter, Iter); + // public member functions + void seed(); + void seed(result_type); + template<typename SeedSeq> void seed(SeedSeq &); + template<typename It> void seed(It &, It); + const base_type & base() const; + result_type operator()(); + void discard(boost::uintmax_t); + template<typename Iter> void generate(Iter, Iter); - // public static functions - static result_type min(); - static result_type max(); + // public static functions + static result_type min(); + static result_type max(); - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, + operator<<(std::basic_ostream< CharT, Traits > &, const shuffle_order_engine &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, + operator>>(std::basic_istream< CharT, Traits > &, const shuffle_order_engine &); - friend bool operator==(const shuffle_order_engine &, + friend bool operator==(const shuffle_order_engine &, const shuffle_order_engine &); - friend bool operator!=(const shuffle_order_engine &, + friend bool operator!=(const shuffle_order_engine &, const shuffle_order_engine &); // public data members @@ -81,7 +81,7 @@ static const std::size_t table_size; };
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        Instatiations of class template shuffle_order_engine model a pseudo-random number generator . It mixes the output of some (usually linear_congruential_engine) uniform random number generator to get better statistical properties. The algorithm is described in

                                                                                        "Improving a poor random number generator", Carter Bays and S.D. Durham, ACM Transactions on Mathematical Software, Vol 2, No. 1, March 1976, pp. 59-64. http://doi.acm.org/10.1145/355666.355670

                                                                                        @@ -89,99 +89,99 @@

                                                                                        The output of the base generator is buffered in an array of length k. Every output X(n) has a second role: It gives an index into the array where X(n+1) will be retrieved. Used array elements are replaced with fresh output from the base generator.

                                                                                        Template parameters are the base generator and the array length k, which should be around 100.

                                                                                        -

                                                                                        +

                                                                                        shuffle_order_engine public construct/copy/destruct

                                                                                        1. -
                                                                                          shuffle_order_engine();
                                                                                          +
                                                                                          shuffle_order_engine();

                                                                                          Constructs a shuffle_order_engine by invoking the default constructor of the base generator.

                                                                                          Complexity: Exactly k+1 invocations of the base generator.

                                                                                        2. -
                                                                                          explicit shuffle_order_engine(result_type s);
                                                                                          +
                                                                                          explicit shuffle_order_engine(result_type s);

                                                                                          Constructs a shuffle_output_engine by invoking the one-argument constructor of the base generator with the parameter seed.

                                                                                          Complexity: Exactly k+1 invocations of the base generator.

                                                                                          3. -
                                                                                        3. template<typename SeedSeq> explicit shuffle_order_engine(SeedSeq & seq);
                                                                                          4. +
                                                                                        4. template<typename SeedSeq> explicit shuffle_order_engine(SeedSeq & seq);
                                                                                        5. -
                                                                                          explicit shuffle_order_engine(const base_type & rng);
                                                                                          +
                                                                                          explicit shuffle_order_engine(const base_type & rng);

                                                                                          Constructs a shuffle_output_engine by using a copy of the provided generator.

                                                                                          Precondition: The template argument UniformRandomNumberGenerator shall denote a CopyConstructible type.

                                                                                          Complexity: Exactly k+1 invocations of the base generator.

                                                                                          6. -
                                                                                        6. explicit shuffle_order_engine(base_type && rng);
                                                                                          7. -
                                                                                        7. template<typename It> shuffle_order_engine(It & first, It last);
                                                                                          8. +
                                                                                        8. explicit shuffle_order_engine(base_type && rng);
                                                                                          9. +
                                                                                        9. template<typename It> shuffle_order_engine(It & first, It last);
                                                                                        -

                                                                                        -shuffle_order_engine public member functions

                                                                                        +

                                                                                        +shuffle_order_engine public member functions

                                                                                          -
                                                                                        1. void seed();
                                                                                          2. +
                                                                                        2. void seed();
                                                                                        3. -
                                                                                          void seed(result_type seed);
                                                                                          +
                                                                                          void seed(result_type seed);

                                                                                          Invokes the one-argument seed method of the base generator with the parameter seed and re-initializes the internal buffer array.

                                                                                          Complexity: Exactly k+1 invocations of the base generator.

                                                                                        4. -
                                                                                          template<typename SeedSeq> void seed(SeedSeq & seq);
                                                                                          +
                                                                                          template<typename SeedSeq> void seed(SeedSeq & seq);

                                                                                          Invokes the one-argument seed method of the base generator with the parameter seq and re-initializes the internal buffer array.

                                                                                          Complexity: Exactly k+1 invocations of the base generator.

                                                                                          5. -
                                                                                        5. template<typename It> void seed(It & first, It last);
                                                                                          6. -
                                                                                        6. const base_type & base() const;
                                                                                          7. -
                                                                                        7. result_type operator()();
                                                                                          8. +
                                                                                        8. template<typename It> void seed(It & first, It last);
                                                                                          9. +
                                                                                        9. const base_type & base() const;
                                                                                          10. +
                                                                                        10. result_type operator()();
                                                                                        11. -
                                                                                          void discard(boost::uintmax_t z);
                                                                                          +
                                                                                          void discard(boost::uintmax_t z);

                                                                                          Advances the generator by z steps.

                                                                                        12. -
                                                                                          template<typename Iter> void generate(Iter first, Iter last);
                                                                                          +
                                                                                          template<typename Iter> void generate(Iter first, Iter last);

                                                                                          Fills a range with pseudo-random values.

                                                                                        -

                                                                                        -shuffle_order_engine public static functions

                                                                                        +

                                                                                        +shuffle_order_engine public static functions

                                                                                        1. -
                                                                                          static result_type min();
                                                                                          +
                                                                                          static result_type min();

                                                                                          Returns the smallest value that the generator can produce.

                                                                                        2. -
                                                                                          static result_type max();
                                                                                          +
                                                                                          static result_type max();

                                                                                          Returns the largest value that the generator can produce.

                                                                                        -

                                                                                        -shuffle_order_engine friend functions

                                                                                        +

                                                                                        +shuffle_order_engine friend functions

                                                                                        1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const shuffle_order_engine & s);

                                                                                          Writes a shuffle_order_engine to a std::ostream. 

                                                                                        2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
              const shuffle_order_engine & s);

                                                                                          Reads a shuffle_order_engine from a std::istream.

                                                                                        3. -
                                                                                          friend bool operator==(const shuffle_order_engine & x, 
+
                                                                                          friend bool operator==(const shuffle_order_engine & x, 
                        const shuffle_order_engine & y);
                                                                                          
 
                                                                                          Returns true if the two generators will produce identical sequences.
                                                                                        4. -
                                                                                          friend bool operator!=(const shuffle_order_engine & lhs, 
+
                                                                                          friend bool operator!=(const shuffle_order_engine & lhs, 
                        const shuffle_order_engine & rhs);
                                                                                          
 
                                                                                          Returns true if the two generators will produce different sequences.
                                                                                          5. diff --git a/doc/html/boost/random/student_t_distribution.html b/doc/html/boost/random/student_t_distribution.html index 0495f09553..70ce5bc6b1 100644 --- a/doc/html/boost/random/student_t_distribution.html +++ b/doc/html/boost/random/student_t_distribution.html @@ -47,136 +47,136 @@ typedef student_t_distribution distribution_type; // construct/copy/destruct - explicit param_type(RealType = 1.0); + explicit param_type(RealType = 1.0); - // public member functions - RealType n() const; + // public member functions + RealType n() const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); + operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, const param_type &); - friend bool operator==(const param_type &, const param_type &); - friend bool operator!=(const param_type &, const param_type &); + operator>>(std::basic_istream< CharT, Traits > &, const param_type &); + friend bool operator==(const param_type &, const param_type &); + friend bool operator!=(const param_type &, const param_type &); }; // construct/copy/destruct - explicit student_t_distribution(RealType = 1.0); - explicit student_t_distribution(const param_type &); + explicit student_t_distribution(RealType = 1.0); + explicit student_t_distribution(const param_type &); - // public member functions - template<typename URNG> RealType operator()(URNG &); + // public member functions + template<typename URNG> RealType operator()(URNG &); template<typename URNG> - RealType operator()(URNG &, const param_type &) const; - RealType n() const; - RealType min() const; - RealType max() const; - param_type param() const; - void param(const param_type &); - void reset(); + RealType operator()(URNG &, const param_type &) const; + RealType n() const; + RealType min() const; + RealType max() const; + param_type param() const; + void param(const param_type &); + void reset(); - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, + operator<<(std::basic_ostream< CharT, Traits > &, const student_t_distribution &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, + operator>>(std::basic_istream< CharT, Traits > &, const student_t_distribution &); - friend bool operator==(const student_t_distribution &, + friend bool operator==(const student_t_distribution &, const student_t_distribution &); - friend bool operator!=(const student_t_distribution &, + friend bool operator!=(const student_t_distribution &, const student_t_distribution &); };
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        The Student t distribution is a real valued distribution with one parameter n, the number of degrees of freedom.

                                                                                        -

                                                                                        It has .

                                                                                        +

                                                                                        It has .

                                                                                        -

                                                                                        +

                                                                                        student_t_distribution public construct/copy/destruct

                                                                                        1. -
                                                                                          explicit student_t_distribution(RealType n = 1.0);
                                                                                          +
                                                                                          explicit student_t_distribution(RealType n = 1.0);

                                                                                          Constructs an student_t_distribution with "n" degrees of freedom.

                                                                                          Requires: n > 0

                                                                                        2. -
                                                                                          explicit student_t_distribution(const param_type & param);
                                                                                          +
                                                                                          explicit student_t_distribution(const param_type & param);

                                                                                          Constructs an student_t_distribution from its parameters.

                                                                                        -

                                                                                        -student_t_distribution public member functions

                                                                                        +

                                                                                        +student_t_distribution public member functions

                                                                                        1. -
                                                                                          template<typename URNG> RealType operator()(URNG & urng);
                                                                                          +
                                                                                          template<typename URNG> RealType operator()(URNG & urng);

                                                                                          Returns a random variate distributed according to the Student t distribution. 

                                                                                        2. template<typename URNG> 
-  RealType operator()(URNG & urng, const param_type & param) const;
                                                                                          + RealType operator()(URNG & urng, const param_type & param) const;

                                                                                          Returns a random variate distributed accordint to the Student t distribution with parameters specified by param.

                                                                                        3. -
                                                                                          RealType n() const;
                                                                                          +
                                                                                          RealType n() const;

                                                                                          Returns the number of degrees of freedom.

                                                                                        4. -
                                                                                          RealType min() const;
                                                                                          +
                                                                                          RealType min() const;

                                                                                          Returns the smallest value that the distribution can produce.

                                                                                        5. -
                                                                                          RealType max() const;
                                                                                          +
                                                                                          RealType max() const;

                                                                                          Returns the largest value that the distribution can produce.

                                                                                        6. -
                                                                                          param_type param() const;
                                                                                          +
                                                                                          param_type param() const;

                                                                                          Returns the parameters of the distribution.

                                                                                        7. -
                                                                                          void param(const param_type & param);
                                                                                          +
                                                                                          void param(const param_type & param);

                                                                                          Sets the parameters of the distribution.

                                                                                        8. -
                                                                                          void reset();
                                                                                          +
                                                                                          void reset();

                                                                                          Effects: Subsequent uses of the distribution do not depend on values produced by any engine prior to invoking reset.

                                                                                        -

                                                                                        -student_t_distribution friend functions

                                                                                        +

                                                                                        +student_t_distribution friend functions

                                                                                        1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const student_t_distribution & td);

                                                                                          Writes a student_t_distribution to a std::ostream. 

                                                                                        2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
              const student_t_distribution & td);

                                                                                          Reads a student_t_distribution from a std::istream.

                                                                                        3. -
                                                                                          friend bool operator==(const student_t_distribution & lhs, 
+
                                                                                          friend bool operator==(const student_t_distribution & lhs, 
                        const student_t_distribution & rhs);
                                                                                          
 
                                                                                          Returns true if the two instances of student_t_distribution will return identical sequences of values given equal generators.
                                                                                        4. -
                                                                                          friend bool operator!=(const student_t_distribution & lhs, 
+
                                                                                          friend bool operator!=(const student_t_distribution & lhs, 
                        const student_t_distribution & rhs);
                                                                                          
 
                                                                                          Returns true if the two instances of student_t_distribution will return different sequences of values given equal generators.
                                                                                          5. diff --git a/doc/html/boost/random/student_t_distribution/param_type.html b/doc/html/boost/random/student_t_distribution/param_type.html index c84f01858a..c0ec669564 100644 --- a/doc/html/boost/random/student_t_distribution/param_type.html +++ b/doc/html/boost/random/student_t_distribution/param_type.html @@ -6,9 +6,9 @@ - + - + @@ -21,7 +21,7 @@
                                                                                          -PrevUpHomeNext +PrevUpHomeNext
                                                                                          @@ -40,66 +40,66 @@ typedef student_t_distribution distribution_type; // construct/copy/destruct - explicit param_type(RealType = 1.0); + explicit param_type(RealType = 1.0); - // public member functions - RealType n() const; + // public member functions + RealType n() const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); + operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, const param_type &); - friend bool operator==(const param_type &, const param_type &); - friend bool operator!=(const param_type &, const param_type &); + operator>>(std::basic_istream< CharT, Traits > &, const param_type &); + friend bool operator==(const param_type &, const param_type &); + friend bool operator!=(const param_type &, const param_type &); };
                                                                                          -

                                                                                          Description

                                                                                          +

                                                                                          Description

                                                                                          -

                                                                                          +

                                                                                          param_type public construct/copy/destruct

                                                                                          1. -
                                                                                            explicit param_type(RealType n = 1.0);
                                                                                            +
                                                                                            explicit param_type(RealType n = 1.0);

                                                                                            Constructs a param_type with "n" degrees of freedom.

                                                                                            Requires: n > 0

                                                                                          -

                                                                                          -param_type public member functions

                                                                                          +

                                                                                          +param_type public member functions

                                                                                          1. -
                                                                                            RealType n() const;
                                                                                            +
                                                                                            RealType n() const;

                                                                                            Returns the number of degrees of freedom of the distribution.

                                                                                          -

                                                                                          -param_type friend functions

                                                                                          +

                                                                                          +param_type friend functions

                                                                                          1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const param_type & param);

                                                                                            Writes a param_type to a std::ostream. 

                                                                                          2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
              const param_type & param);

                                                                                            Reads a param_type from a std::istream.

                                                                                          3. -
                                                                                            friend bool operator==(const param_type & lhs, const param_type & rhs);
                                                                                            +
                                                                                            friend bool operator==(const param_type & lhs, const param_type & rhs);

                                                                                            Returns true if the two sets of parameters are the same.

                                                                                          4. -
                                                                                            friend bool operator!=(const param_type & lhs, const param_type & rhs);
                                                                                            +
                                                                                            friend bool operator!=(const param_type & lhs, const param_type & rhs);

                                                                                            Returns true if the two sets of parameters are the different.

                                                                                          @@ -116,7 +116,7 @@
                                                                                          -PrevUpHomeNext +PrevUpHomeNext
                                                                                          diff --git a/doc/html/boost/random/subtract_idm45507048596384.html b/doc/html/boost/random/subtract_idm45507048596384.html new file mode 100644 index 0000000000..2edc06bce8 --- /dev/null +++ b/doc/html/boost/random/subtract_idm45507048596384.html @@ -0,0 +1,205 @@ + + + + +Class template subtract_with_carry_01_engine + + + + + + + + + + + + + + + +
                                                                                          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                          +
                                                                                          +
                                                                                          +PrevUpHomeNext +
                                                                                          +
                                                                                          +
                                                                                          +
                                                                                          +

                                                                                          Class template subtract_with_carry_01_engine

                                                                                          +

                                                                                          boost::random::subtract_with_carry_01_engine

                                                                                          +
                                                                                          +

                                                                                          Synopsis

                                                                                          +
                                                                                          // In header: <boost/random/subtract_with_carry.hpp>
+
+template<typename RealType, std::size_t w, std::size_t s, std::size_t r> 
+class subtract_with_carry_01_engine {
+public:
+  // types
+  typedef RealType result_type;
+
+  // construct/copy/destruct
+  subtract_with_carry_01_engine();
+  explicit subtract_with_carry_01_engine(boost::uint32_t);
+  template<typename SeedSeq> explicit subtract_with_carry_01_engine(SeedSeq &);
+  template<typename It> subtract_with_carry_01_engine(It &, It);
+
+  // public member functions
+  void seed();
+  void seed(boost::uint32_t);
+  template<typename SeedSeq> void seed(SeedSeq &);
+  template<typename It> void seed(It &, It);
+  result_type operator()();
+  void discard(boost::uintmax_t);
+  template<typename Iter> void generate(Iter, Iter);
+
+  // public static functions
+  static result_type min();
+  static result_type max();
+
+  // friend functions
+  template<typename CharT, typename Traits> 
+    friend std::basic_ostream< CharT, Traits > & 
+    operator<<(std::basic_ostream< CharT, Traits > &, 
+               const subtract_with_carry_01_engine &);
+  template<typename CharT, typename Traits> 
+    friend std::basic_istream< CharT, Traits > & 
+    operator>>(std::basic_istream< CharT, Traits > &, 
+               const subtract_with_carry_01_engine &);
+  friend bool operator==(const subtract_with_carry_01_engine &, 
+                         const subtract_with_carry_01_engine &);
+  friend bool operator!=(const subtract_with_carry_01_engine &, 
+                         const subtract_with_carry_01_engine &);
+
+  // public data members
+  static const bool has_fixed_range;
+  static const std::size_t word_size;
+  static const std::size_t long_lag;
+  static const std::size_t short_lag;
+  static const boost::uint32_t default_seed;
+};
                                                                                          +
                                                                                          +

                                                                                          Description

                                                                                          +

                                                                                          Instantiations of subtract_with_carry_01_engine model a pseudo-random number generator . The algorithm is described in

                                                                                          +

                                                                                          +

                                                                                          "A New Class of Random Number Generators", George Marsaglia and Arif Zaman, Annals of Applied Probability, Volume 1, Number 3 (1991), 462-480.

                                                                                          +

                                                                                          +
                                                                                          +

                                                                                          +subtract_with_carry_01_engine + public + construct/copy/destruct

                                                                                          +
                                                                                            +
                                                                                          1. +
                                                                                            subtract_with_carry_01_engine();
                                                                                            +

                                                                                            Creates a new subtract_with_carry_01_engine using the default seed.

                                                                                            +
                                                                                            2. +
                                                                                          2. +
                                                                                            explicit subtract_with_carry_01_engine(boost::uint32_t value);
                                                                                            +

                                                                                            Creates a new subtract_with_carry_01_engine and seeds it with value.

                                                                                            +
                                                                                            3. +
                                                                                          3. +
                                                                                            template<typename SeedSeq> 
+  explicit subtract_with_carry_01_engine(SeedSeq & seq);
                                                                                            +

                                                                                            Creates a new subtract_with_carry_01_engine and seeds with values produced by seq.generate().

                                                                                            +
                                                                                            4. +
                                                                                          4. +
                                                                                            template<typename It> subtract_with_carry_01_engine(It & first, It last);
                                                                                            +

                                                                                            Creates a new subtract_with_carry_01_engine and seeds it with values from a range. Advances first to point one past the last consumed value. If the range does not contain enough elements to fill the entire state, throws std::invalid_argument.

                                                                                            +
                                                                                            5. +
                                                                                          +
                                                                                          +
                                                                                          +

                                                                                          +subtract_with_carry_01_engine public member functions

                                                                                          +
                                                                                            +
                                                                                          1. +
                                                                                            void seed();
                                                                                            +

                                                                                            Seeds the generator with the default seed.

                                                                                            +
                                                                                            2. +
                                                                                          2. +
                                                                                            void seed(boost::uint32_t value);
                                                                                            +

                                                                                            Seeds the generator with value.

                                                                                            +
                                                                                            3. +
                                                                                          3. +
                                                                                            template<typename SeedSeq> void seed(SeedSeq & seq);
                                                                                            +

                                                                                            Seeds the generator with values produced by seq.generate().

                                                                                            +
                                                                                            4. +
                                                                                          4. +
                                                                                            template<typename It> void seed(It & first, It last);
                                                                                            +

                                                                                            Seeds the generator with values from a range. Updates first to point one past the last consumed element. If there are not enough elements in the range to fill the entire state, throws std::invalid_argument.

                                                                                            +
                                                                                            5. +
                                                                                          5. +
                                                                                            result_type operator()();
                                                                                            +

                                                                                            Returns the next value of the generator.

                                                                                            +
                                                                                            6. +
                                                                                          6. +
                                                                                            void discard(boost::uintmax_t z);
                                                                                            +

                                                                                            Advances the state of the generator by z.

                                                                                            +
                                                                                            7. +
                                                                                          7. +
                                                                                            template<typename Iter> void generate(Iter first, Iter last);
                                                                                            +

                                                                                            Fills a range with random values.

                                                                                            +
                                                                                            8. +
                                                                                          +
                                                                                          +
                                                                                          +

                                                                                          +subtract_with_carry_01_engine public static functions

                                                                                          +
                                                                                            +
                                                                                          1. +
                                                                                            static result_type min();
                                                                                            +

                                                                                            Returns the smallest value that the generator can produce.

                                                                                            +
                                                                                            2. +
                                                                                          2. +
                                                                                            static result_type max();
                                                                                            +

                                                                                            Returns the largest value that the generator can produce.

                                                                                            +
                                                                                            3. +
                                                                                          +
                                                                                          +
                                                                                          +

                                                                                          +subtract_with_carry_01_engine friend functions

                                                                                          +
                                                                                            +
                                                                                          1. +
                                                                                            template<typename CharT, typename Traits> 
+  friend std::basic_ostream< CharT, Traits > & 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
+             const subtract_with_carry_01_engine & f);
                                                                                            +

                                                                                            Writes a subtract_with_carry_01_engine to a std::ostream.

                                                                                            +
                                                                                            2. +
                                                                                          2. +
                                                                                            template<typename CharT, typename Traits> 
+  friend std::basic_istream< CharT, Traits > & 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
+             const subtract_with_carry_01_engine & f);
                                                                                            +

                                                                                            Reads a subtract_with_carry_01_engine from a std::istream.

                                                                                            +
                                                                                            3. +
                                                                                          3. +
                                                                                            friend bool operator==(const subtract_with_carry_01_engine & x, 
+                       const subtract_with_carry_01_engine & y);
                                                                                            +

                                                                                            Returns true if the two generators will produce identical sequences.

                                                                                            +
                                                                                            4. +
                                                                                          4. +
                                                                                            friend bool operator!=(const subtract_with_carry_01_engine & lhs, 
+                       const subtract_with_carry_01_engine & rhs);
                                                                                            +

                                                                                            Returns true if the two generators will produce different sequences.

                                                                                            +
                                                                                            5. +
                                                                                          +
                                                                                          +
                                                                                          +
                                                                                          + + + +
                                                                                          Copyright © 2000-2005 Jens Maurer
                                                                                          Copyright © 2009, 2010 Steven Watanabe

                                                                                          + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                          +
                                                                                          +
                                                                                          +
                                                                                          +PrevUpHomeNext +
                                                                                          + + diff --git a/doc/html/boost/random/subtract_with_carry_engine.html b/doc/html/boost/random/subtract_with_carry_engine.html index e86922a5d3..8d1193d978 100644 --- a/doc/html/boost/random/subtract_with_carry_engine.html +++ b/doc/html/boost/random/subtract_with_carry_engine.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                                                                                          -PrevUpHomeNext +PrevUpHomeNext
                                                                                          @@ -39,36 +39,36 @@ typedef IntType result_type; // construct/copy/destruct - subtract_with_carry_engine(); - explicit subtract_with_carry_engine(IntType); - template<typename SeedSeq> explicit subtract_with_carry_engine(SeedSeq &); - template<typename It> subtract_with_carry_engine(It &, It); + subtract_with_carry_engine(); + explicit subtract_with_carry_engine(IntType); + template<typename SeedSeq> explicit subtract_with_carry_engine(SeedSeq &); + template<typename It> subtract_with_carry_engine(It &, It); - // public member functions - void seed(); - void seed(IntType); - template<typename SeedSeq> void seed(SeedSeq &); - template<typename It> void seed(It &, It); - result_type operator()(); - void discard(boost::uintmax_t); - template<typename It> void generate(It, It); + // public member functions + void seed(); + void seed(IntType); + template<typename SeedSeq> void seed(SeedSeq &); + template<typename It> void seed(It &, It); + result_type operator()(); + void discard(boost::uintmax_t); + template<typename It> void generate(It, It); - // public static functions - static result_type min(); - static result_type max(); + // public static functions + static result_type min(); + static result_type max(); - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, + operator<<(std::basic_ostream< CharT, Traits > &, const subtract_with_carry_engine &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, + operator>>(std::basic_istream< CharT, Traits > &, const subtract_with_carry_engine &); - friend bool operator==(const subtract_with_carry_engine &, + friend bool operator==(const subtract_with_carry_engine &, const subtract_with_carry_engine &); - friend bool operator!=(const subtract_with_carry_engine &, + friend bool operator!=(const subtract_with_carry_engine &, const subtract_with_carry_engine &); // public data members @@ -80,105 +80,105 @@ static const result_type modulus; };
                                                                                          -

                                                                                          Description

                                                                                          +

                                                                                          Description

                                                                                          Instantiations of subtract_with_carry_engine model a pseudo-random number generator . The algorithm is described in

                                                                                          "A New Class of Random Number Generators", George Marsaglia and Arif Zaman, Annals of Applied Probability, Volume 1, Number 3 (1991), 462-480.

                                                                                          -

                                                                                          +

                                                                                          subtract_with_carry_engine public construct/copy/destruct

                                                                                          1. -
                                                                                            subtract_with_carry_engine();
                                                                                            +
                                                                                            subtract_with_carry_engine();

                                                                                            Constructs a new subtract_with_carry_engine and seeds it with the default seed.

                                                                                          2. -
                                                                                            explicit subtract_with_carry_engine(IntType value);
                                                                                            +
                                                                                            explicit subtract_with_carry_engine(IntType value);

                                                                                            Constructs a new subtract_with_carry_engine and seeds it with value.

                                                                                          3. -
                                                                                            template<typename SeedSeq> explicit subtract_with_carry_engine(SeedSeq & seq);
                                                                                            +
                                                                                            template<typename SeedSeq> explicit subtract_with_carry_engine(SeedSeq & seq);

                                                                                            Constructs a new subtract_with_carry_engine and seeds it with values produced by seq.generate().

                                                                                          4. -
                                                                                            template<typename It> subtract_with_carry_engine(It & first, It last);
                                                                                            +
                                                                                            template<typename It> subtract_with_carry_engine(It & first, It last);

                                                                                            Constructs a new subtract_with_carry_engine and seeds it with values from a range. first is updated to point one past the last value consumed. If there are not enough elements in the range to fill the entire state of the generator, throws std::invalid_argument.

                                                                                          -

                                                                                          -subtract_with_carry_engine public member functions

                                                                                          +

                                                                                          +subtract_with_carry_engine public member functions

                                                                                          1. -
                                                                                            void seed();
                                                                                            +
                                                                                            void seed();

                                                                                            Seeds the generator with the default seed.

                                                                                            2. -
                                                                                          2. void seed(IntType value);
                                                                                            3. +
                                                                                          3. void seed(IntType value);
                                                                                          4. -
                                                                                            template<typename SeedSeq> void seed(SeedSeq & seq);
                                                                                            +
                                                                                            template<typename SeedSeq> void seed(SeedSeq & seq);

                                                                                            Seeds the generator with values produced by seq.generate().

                                                                                          5. -
                                                                                            template<typename It> void seed(It & first, It last);
                                                                                            +
                                                                                            template<typename It> void seed(It & first, It last);

                                                                                            Seeds the generator with values from a range. Updates first to point one past the last consumed value. If the range does not contain enough elements to fill the entire state of the generator, throws std::invalid_argument.

                                                                                          6. -
                                                                                            result_type operator()();
                                                                                            +
                                                                                            result_type operator()();

                                                                                            Returns the next value of the generator.

                                                                                          7. -
                                                                                            void discard(boost::uintmax_t z);
                                                                                            +
                                                                                            void discard(boost::uintmax_t z);

                                                                                            Advances the state of the generator by z.

                                                                                          8. -
                                                                                            template<typename It> void generate(It first, It last);
                                                                                            +
                                                                                            template<typename It> void generate(It first, It last);

                                                                                            Fills a range with random values.

                                                                                          -

                                                                                          -subtract_with_carry_engine public static functions

                                                                                          +

                                                                                          +subtract_with_carry_engine public static functions

                                                                                          1. -
                                                                                            static result_type min();
                                                                                            +
                                                                                            static result_type min();

                                                                                            Returns the smallest value that the generator can produce.

                                                                                          2. -
                                                                                            static result_type max();
                                                                                            +
                                                                                            static result_type max();

                                                                                            Returns the largest value that the generator can produce.

                                                                                          -

                                                                                          -subtract_with_carry_engine friend functions

                                                                                          +

                                                                                          +subtract_with_carry_engine friend functions

                                                                                          1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const subtract_with_carry_engine & f);

                                                                                            Writes a subtract_with_carry_engine to a std::ostream. 

                                                                                          2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
              const subtract_with_carry_engine & f);

                                                                                            Reads a subtract_with_carry_engine from a std::istream.

                                                                                          3. -
                                                                                            friend bool operator==(const subtract_with_carry_engine & x, 
+
                                                                                            friend bool operator==(const subtract_with_carry_engine & x, 
                        const subtract_with_carry_engine & y);
                                                                                            
 
                                                                                            Returns true if the two generators will produce identical sequences of values.
                                                                                          4. -
                                                                                            friend bool operator!=(const subtract_with_carry_engine & lhs, 
+
                                                                                            friend bool operator!=(const subtract_with_carry_engine & lhs, 
                        const subtract_with_carry_engine & rhs);
                                                                                            
 
                                                                                            Returns true if the two generators will produce different sequences of values.
                                                                                            5. @@ -196,7 +196,7 @@
                                                                                            -PrevUpHomeNext +PrevUpHomeNext
                                                                                            diff --git a/doc/html/boost/random/subtract_with_idp162145280.html b/doc/html/boost/random/subtract_with_idp162145280.html deleted file mode 100644 index 01deaace2c..0000000000 --- a/doc/html/boost/random/subtract_with_idp162145280.html +++ /dev/null @@ -1,205 +0,0 @@ - - - - -Class template subtract_with_carry_01_engine - - - - - - - - - - - - - - - -
                                                                                            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                            -
                                                                                            -
                                                                                            -PrevUpHomeNext -
                                                                                            -
                                                                                            -
                                                                                            -
                                                                                            -

                                                                                            Class template subtract_with_carry_01_engine

                                                                                            -

                                                                                            boost::random::subtract_with_carry_01_engine

                                                                                            -
                                                                                            -

                                                                                            Synopsis

                                                                                            -
                                                                                            // In header: <boost/random/subtract_with_carry.hpp>
-
-template<typename RealType, std::size_t w, std::size_t s, std::size_t r> 
-class subtract_with_carry_01_engine {
-public:
-  // types
-  typedef RealType result_type;
-
-  // construct/copy/destruct
-  subtract_with_carry_01_engine();
-  explicit subtract_with_carry_01_engine(boost::uint32_t);
-  template<typename SeedSeq> explicit subtract_with_carry_01_engine(SeedSeq &);
-  template<typename It> subtract_with_carry_01_engine(It &, It);
-
-  // public member functions
-  void seed();
-  void seed(boost::uint32_t);
-  template<typename SeedSeq> void seed(SeedSeq &);
-  template<typename It> void seed(It &, It);
-  result_type operator()();
-  void discard(boost::uintmax_t);
-  template<typename Iter> void generate(Iter, Iter);
-
-  // public static functions
-  static result_type min();
-  static result_type max();
-
-  // friend functions
-  template<typename CharT, typename Traits> 
-    friend std::basic_ostream< CharT, Traits > & 
-    operator<<(std::basic_ostream< CharT, Traits > &, 
-               const subtract_with_carry_01_engine &);
-  template<typename CharT, typename Traits> 
-    friend std::basic_istream< CharT, Traits > & 
-    operator>>(std::basic_istream< CharT, Traits > &, 
-               const subtract_with_carry_01_engine &);
-  friend bool operator==(const subtract_with_carry_01_engine &, 
-                         const subtract_with_carry_01_engine &);
-  friend bool operator!=(const subtract_with_carry_01_engine &, 
-                         const subtract_with_carry_01_engine &);
-
-  // public data members
-  static const bool has_fixed_range;
-  static const std::size_t word_size;
-  static const std::size_t long_lag;
-  static const std::size_t short_lag;
-  static const boost::uint32_t default_seed;
-};
                                                                                            -
                                                                                            -

                                                                                            Description

                                                                                            -

                                                                                            Instantiations of subtract_with_carry_01_engine model a pseudo-random number generator . The algorithm is described in

                                                                                            -

                                                                                            -

                                                                                            "A New Class of Random Number Generators", George Marsaglia and Arif Zaman, Annals of Applied Probability, Volume 1, Number 3 (1991), 462-480.

                                                                                            -

                                                                                            -
                                                                                            -

                                                                                            -subtract_with_carry_01_engine - public - construct/copy/destruct

                                                                                            -
                                                                                              -
                                                                                            1. -
                                                                                              subtract_with_carry_01_engine();
                                                                                              -

                                                                                              Creates a new subtract_with_carry_01_engine using the default seed.

                                                                                              -
                                                                                              2. -
                                                                                            2. -
                                                                                              explicit subtract_with_carry_01_engine(boost::uint32_t value);
                                                                                              -

                                                                                              Creates a new subtract_with_carry_01_engine and seeds it with value.

                                                                                              -
                                                                                              3. -
                                                                                            3. -
                                                                                              template<typename SeedSeq> 
-  explicit subtract_with_carry_01_engine(SeedSeq & seq);
                                                                                              -

                                                                                              Creates a new subtract_with_carry_01_engine and seeds with values produced by seq.generate().

                                                                                              -
                                                                                              4. -
                                                                                            4. -
                                                                                              template<typename It> subtract_with_carry_01_engine(It & first, It last);
                                                                                              -

                                                                                              Creates a new subtract_with_carry_01_engine and seeds it with values from a range. Advances first to point one past the last consumed value. If the range does not contain enough elements to fill the entire state, throws std::invalid_argument.

                                                                                              -
                                                                                              5. -
                                                                                            -
                                                                                            -
                                                                                            -

                                                                                            -subtract_with_carry_01_engine public member functions

                                                                                            -
                                                                                              -
                                                                                            1. -
                                                                                              void seed();
                                                                                              -

                                                                                              Seeds the generator with the default seed.

                                                                                              -
                                                                                              2. -
                                                                                            2. -
                                                                                              void seed(boost::uint32_t value);
                                                                                              -

                                                                                              Seeds the generator with value.

                                                                                              -
                                                                                              3. -
                                                                                            3. -
                                                                                              template<typename SeedSeq> void seed(SeedSeq & seq);
                                                                                              -

                                                                                              Seeds the generator with values produced by seq.generate().

                                                                                              -
                                                                                              4. -
                                                                                            4. -
                                                                                              template<typename It> void seed(It & first, It last);
                                                                                              -

                                                                                              Seeds the generator with values from a range. Updates first to point one past the last consumed element. If there are not enough elements in the range to fill the entire state, throws std::invalid_argument.

                                                                                              -
                                                                                              5. -
                                                                                            5. -
                                                                                              result_type operator()();
                                                                                              -

                                                                                              Returns the next value of the generator.

                                                                                              -
                                                                                              6. -
                                                                                            6. -
                                                                                              void discard(boost::uintmax_t z);
                                                                                              -

                                                                                              Advances the state of the generator by z.

                                                                                              -
                                                                                              7. -
                                                                                            7. -
                                                                                              template<typename Iter> void generate(Iter first, Iter last);
                                                                                              -

                                                                                              Fills a range with random values.

                                                                                              -
                                                                                              8. -
                                                                                            -
                                                                                            -
                                                                                            -

                                                                                            -subtract_with_carry_01_engine public static functions

                                                                                            -
                                                                                              -
                                                                                            1. -
                                                                                              static result_type min();
                                                                                              -

                                                                                              Returns the smallest value that the generator can produce.

                                                                                              -
                                                                                              2. -
                                                                                            2. -
                                                                                              static result_type max();
                                                                                              -

                                                                                              Returns the largest value that the generator can produce.

                                                                                              -
                                                                                              3. -
                                                                                            -
                                                                                            -
                                                                                            -

                                                                                            -subtract_with_carry_01_engine friend functions

                                                                                            -
                                                                                              -
                                                                                            1. -
                                                                                              template<typename CharT, typename Traits> 
-  friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
-             const subtract_with_carry_01_engine & f);
                                                                                              -

                                                                                              Writes a subtract_with_carry_01_engine to a std::ostream.

                                                                                              -
                                                                                              2. -
                                                                                            2. -
                                                                                              template<typename CharT, typename Traits> 
-  friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
-             const subtract_with_carry_01_engine & f);
                                                                                              -

                                                                                              Reads a subtract_with_carry_01_engine from a std::istream.

                                                                                              -
                                                                                              3. -
                                                                                            3. -
                                                                                              friend bool operator==(const subtract_with_carry_01_engine & x, 
-                       const subtract_with_carry_01_engine & y);
                                                                                              -

                                                                                              Returns true if the two generators will produce identical sequences.

                                                                                              -
                                                                                              4. -
                                                                                            4. -
                                                                                              friend bool operator!=(const subtract_with_carry_01_engine & lhs, 
-                       const subtract_with_carry_01_engine & rhs);
                                                                                              -

                                                                                              Returns true if the two generators will produce different sequences.

                                                                                              -
                                                                                              5. -
                                                                                            -
                                                                                            -
                                                                                            -
                                                                                            - - - -
                                                                                            Copyright © 2000-2005 Jens Maurer
                                                                                            Copyright © 2009, 2010 Steven Watanabe

                                                                                            - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                            -
                                                                                            -
                                                                                            -
                                                                                            -PrevUpHomeNext -
                                                                                            - - diff --git a/doc/html/boost/random/taus88.html b/doc/html/boost/random/taus88.html index 64cb083a5b..e9dc0d05de 100644 --- a/doc/html/boost/random/taus88.html +++ b/doc/html/boost/random/taus88.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
                                                                                            -PrevUpHomeNext +PrevUpHomeNext
                                                                                            @@ -33,9 +33,9 @@ 
                                                                                            // In header: <boost/random/taus88.hpp>
 
 
-typedef xor_combine_engine< xor_combine_engine< linear_feedback_shift_engine< uint32_t, 32, 31, 13, 12 >, 0, linear_feedback_shift_engine< uint32_t, 32, 29, 2, 4 >, 0 >, 0, linear_feedback_shift_engine< uint32_t, 32, 28, 3, 17 >, 0 > taus88;
                                                                                            +typedef xor_combine_engine< xor_combine_engine< linear_feedback_shift_engine< uint32_t, 32, 31, 13, 12 >, 0, linear_feedback_shift_engine< uint32_t, 32, 29, 2, 4 >, 0 >, 0, linear_feedback_shift_engine< uint32_t, 32, 28, 3, 17 >, 0 > taus88;
                                                                                            -

                                                                                            Description

                                                                                            +

                                                                                            Description

                                                                                            The specialization taus88 was suggested in

                                                                                            "Maximally Equidistributed Combined Tausworthe Generators", Pierre L'Ecuyer, Mathematics of Computation, Volume 65, Number 213, January 1996, Pages 203-213

                                                                                            @@ -52,7 +52,7 @@
                                                                                            -PrevUpHomeNext +PrevUpHomeNext
                                                                                            diff --git a/doc/html/boost/random/traits/is_integral.html b/doc/html/boost/random/traits/is_integral.html new file mode 100644 index 0000000000..87ef8a2424 --- /dev/null +++ b/doc/html/boost/random/traits/is_integral.html @@ -0,0 +1,53 @@ + + + + +Struct template is_integral + + + + + + + + + + + + + + + +
                                                                                            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                            +
                                                                                            +
                                                                                            +PrevUpHomeNext +
                                                                                            +
                                                                                            +
                                                                                            +
                                                                                            +

                                                                                            Struct template is_integral

                                                                                            +

                                                                                            boost::random::traits::is_integral — Traits class that indicates whether type T is an integer.

                                                                                            +
                                                                                            +

                                                                                            Synopsis

                                                                                            +
                                                                                            // In header: <boost/random/traits.hpp>
+
+template<typename T> 
+struct is_integral : public mpl::bool_< boost::is_integral< T >::value||(std::numeric_limits< T >::is_integer)>
+{
+};
                                                                                            +
                                                                                            + + + +
                                                                                            Copyright © 2000-2005 Jens Maurer
                                                                                            Copyright © 2009, 2010 Steven Watanabe

                                                                                            + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                            +
                                                                                            +
                                                                                            +
                                                                                            +PrevUpHomeNext +
                                                                                            + + diff --git a/doc/html/boost/random/traits/is_signed.html b/doc/html/boost/random/traits/is_signed.html new file mode 100644 index 0000000000..2e3f604223 --- /dev/null +++ b/doc/html/boost/random/traits/is_signed.html @@ -0,0 +1,53 @@ + + + + +Struct template is_signed + + + + + + + + + + + + + + + +
                                                                                            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                            +
                                                                                            +
                                                                                            +PrevUpHomeNext +
                                                                                            +
                                                                                            +
                                                                                            +
                                                                                            +

                                                                                            Struct template is_signed

                                                                                            +

                                                                                            boost::random::traits::is_signed — Traits class that indicates whether type T is a signed integer.

                                                                                            +
                                                                                            +

                                                                                            Synopsis

                                                                                            +
                                                                                            // In header: <boost/random/traits.hpp>
+
+template<typename T> 
+struct is_signed : public mpl::bool_< boost::is_signed< T >::value||(std::numeric_limits< T >::is_specialized &&std::numeric_limits< T >::is_integer &&std::numeric_limits< T >::is_signed)>
+{
+};
                                                                                            +
                                                                                            + + + +
                                                                                            Copyright © 2000-2005 Jens Maurer
                                                                                            Copyright © 2009, 2010 Steven Watanabe

                                                                                            + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                            +
                                                                                            +
                                                                                            +
                                                                                            +PrevUpHomeNext +
                                                                                            + + diff --git a/doc/html/boost/random/traits/make_unsigned.html b/doc/html/boost/random/traits/make_unsigned.html new file mode 100644 index 0000000000..9325b6bd57 --- /dev/null +++ b/doc/html/boost/random/traits/make_unsigned.html @@ -0,0 +1,56 @@ + + + + +Struct template make_unsigned + + + + + + + + + + + + + + + +
                                                                                            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                            +
                                                                                            +
                                                                                            +PrevUpHomeNext +
                                                                                            +
                                                                                            +
                                                                                            +
                                                                                            +

                                                                                            Struct template make_unsigned

                                                                                            +

                                                                                            boost::random::traits::make_unsigned — Converts the argument type T to an unsigned type.

                                                                                            +
                                                                                            +

                                                                                            Synopsis

                                                                                            +
                                                                                            // In header: <boost/random/traits.hpp>
+
+template<typename T> 
+struct make_unsigned {
+};
                                                                                            +
                                                                                            +

                                                                                            Description

                                                                                            +

                                                                                            This trait has a single member type which is the unsigned type corresponding to T. Note that if T is signed, then member type should define a type with one more bit precision than T. For built-in types this trait defaults to boost::make_unsigned<T>::type. For user defined types it simply asserts that the argument type T is an unsigned integer (using std::numeric_limits). User defined specializations may be provided for other cases.

                                                                                            +
                                                                                            +
                                                                                            + + + +
                                                                                            Copyright © 2000-2005 Jens Maurer
                                                                                            Copyright © 2009, 2010 Steven Watanabe

                                                                                            + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                            +
                                                                                            +
                                                                                            +
                                                                                            +PrevUpHomeNext +
                                                                                            + + diff --git a/doc/html/boost/random/traits/make_unsigned_or_unbounded.html b/doc/html/boost/random/traits/make_unsigned_or_unbounded.html new file mode 100644 index 0000000000..de758089b2 --- /dev/null +++ b/doc/html/boost/random/traits/make_unsigned_or_unbounded.html @@ -0,0 +1,56 @@ + + + + +Struct template make_unsigned_or_unbounded + + + + + + + + + + + + + + + +
                                                                                            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                            +
                                                                                            +
                                                                                            +PrevUpHomeNext +
                                                                                            +
                                                                                            +
                                                                                            +
                                                                                            +

                                                                                            Struct template make_unsigned_or_unbounded

                                                                                            +

                                                                                            boost::random::traits::make_unsigned_or_unbounded — Converts the argument type T to either an unsigned type or an unbounded integer type.

                                                                                            +
                                                                                            +

                                                                                            Synopsis

                                                                                            +
                                                                                            // In header: <boost/random/traits.hpp>
+
+template<typename T> 
+struct make_unsigned_or_unbounded {
+};
                                                                                            +
                                                                                            +

                                                                                            Description

                                                                                            +

                                                                                            This trait has a single member type which is either the unsigned type corresponding to T or an unbounded integer type. This trait is used to generate types suitable for the calculation of a range: as a result if T is signed, then member type should define a type with one more bit precision than T. For built-in types this trait defaults to boost::make_unsigned<T>::type. For user defined types it simply asserts that the argument type T is either an unbounded integer, or an unsigned one (using std::numeric_limits). User defined specializations may be provided for other cases.

                                                                                            +
                                                                                            +
                                                                                            + + + +
                                                                                            Copyright © 2000-2005 Jens Maurer
                                                                                            Copyright © 2009, 2010 Steven Watanabe

                                                                                            + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                            +
                                                                                            +
                                                                                            +
                                                                                            +PrevUpHomeNext +
                                                                                            + + diff --git a/doc/html/boost/random/triangle_distribution.html b/doc/html/boost/random/triangle_distribution.html index 179f621fcd..67ffa42b54 100644 --- a/doc/html/boost/random/triangle_distribution.html +++ b/doc/html/boost/random/triangle_distribution.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                                                                                            -PrevUpHomeNext +PrevUpHomeNext
                                                                                            @@ -47,149 +47,149 @@ typedef triangle_distribution distribution_type; // construct/copy/destruct - explicit param_type(RealType = 0.0, RealType = 0.5, RealType = 1.0); + explicit param_type(RealType = 0.0, RealType = 0.5, RealType = 1.0); - // public member functions - RealType a() const; - RealType b() const; - RealType c() const; + // public member functions + RealType a() const; + RealType b() const; + RealType c() const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); + operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, const param_type &); - friend bool operator==(const param_type &, const param_type &); - friend bool operator!=(const param_type &, const param_type &); + operator>>(std::basic_istream< CharT, Traits > &, const param_type &); + friend bool operator==(const param_type &, const param_type &); + friend bool operator!=(const param_type &, const param_type &); }; // construct/copy/destruct - explicit triangle_distribution(RealType = 0.0, RealType = 0.5, + explicit triangle_distribution(RealType = 0.0, RealType = 0.5, RealType = 1.0); - explicit triangle_distribution(const param_type &); + explicit triangle_distribution(const param_type &); - // public member functions - result_type a() const; - result_type b() const; - result_type c() const; - RealType min() const; - RealType max() const; - param_type param() const; - void param(const param_type &); - void reset(); - template<typename Engine> result_type operator()(Engine &); + // public member functions + result_type a() const; + result_type b() const; + result_type c() const; + RealType min() const; + RealType max() const; + param_type param() const; + void param(const param_type &); + void reset(); + template<typename Engine> result_type operator()(Engine &); template<typename Engine> - result_type operator()(Engine &, const param_type &); + result_type operator()(Engine &, const param_type &); - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, + operator<<(std::basic_ostream< CharT, Traits > &, const triangle_distribution &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, + operator>>(std::basic_istream< CharT, Traits > &, const triangle_distribution &); - friend bool operator==(const triangle_distribution &, + friend bool operator==(const triangle_distribution &, const triangle_distribution &); - friend bool operator!=(const triangle_distribution &, + friend bool operator!=(const triangle_distribution &, const triangle_distribution &); };
                                                                                            -

                                                                                            Description

                                                                                            +

                                                                                            Description

                                                                                            Instantiations of triangle_distribution model a random distribution . A triangle_distribution has three parameters, a, b, and c, which are the smallest, the most probable and the largest values of the distribution respectively.

                                                                                            -

                                                                                            +

                                                                                            triangle_distribution public construct/copy/destruct

                                                                                            1. -
                                                                                              explicit triangle_distribution(RealType a = 0.0, RealType b = 0.5, 
+
                                                                                              explicit triangle_distribution(RealType a = 0.0, RealType b = 0.5, 
                                RealType c = 1.0);
                                                                                              
 
                                                                                              Constructs a triangle_distribution with the parameters a, b, and c.
                                                                                              
 
                                                                                              Preconditions: a <= b <= c.
                                                                                            2. -
                                                                                              explicit triangle_distribution(const param_type & param);
                                                                                              +
                                                                                              explicit triangle_distribution(const param_type & param);

                                                                                              Constructs a triangle_distribution from its parameters.

                                                                                            -

                                                                                            -triangle_distribution public member functions

                                                                                            +

                                                                                            +triangle_distribution public member functions

                                                                                            1. -
                                                                                              result_type a() const;
                                                                                              +
                                                                                              result_type a() const;

                                                                                              Returns the a parameter of the distribution

                                                                                            2. -
                                                                                              result_type b() const;
                                                                                              +
                                                                                              result_type b() const;

                                                                                              Returns the b parameter of the distribution

                                                                                            3. -
                                                                                              result_type c() const;
                                                                                              +
                                                                                              result_type c() const;

                                                                                              Returns the c parameter of the distribution

                                                                                            4. -
                                                                                              RealType min() const;
                                                                                              +
                                                                                              RealType min() const;

                                                                                              Returns the smallest value that the distribution can produce.

                                                                                            5. -
                                                                                              RealType max() const;
                                                                                              +
                                                                                              RealType max() const;

                                                                                              Returns the largest value that the distribution can produce.

                                                                                            6. -
                                                                                              param_type param() const;
                                                                                              +
                                                                                              param_type param() const;

                                                                                              Returns the parameters of the distribution.

                                                                                            7. -
                                                                                              void param(const param_type & param);
                                                                                              +
                                                                                              void param(const param_type & param);

                                                                                              Sets the parameters of the distribution.

                                                                                            8. -
                                                                                              void reset();
                                                                                              +
                                                                                              void reset();

                                                                                              Effects: Subsequent uses of the distribution do not depend on values produced by any engine prior to invoking reset.

                                                                                            9. -
                                                                                              template<typename Engine> result_type operator()(Engine & eng);
                                                                                              +
                                                                                              template<typename Engine> result_type operator()(Engine & eng);

                                                                                              Returns a random variate distributed according to the triangle distribution. 

                                                                                            10. template<typename Engine> 
-  result_type operator()(Engine & eng, const param_type & param);
                                                                                              + result_type operator()(Engine & eng, const param_type & param);

                                                                                              Returns a random variate distributed according to the triangle distribution with parameters specified by param.

                                                                                            -

                                                                                            -triangle_distribution friend functions

                                                                                            +

                                                                                            +triangle_distribution friend functions

                                                                                            1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const triangle_distribution & td);

                                                                                              Writes the distribution to a std::ostream. 

                                                                                            2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
              const triangle_distribution & td);

                                                                                              Reads the distribution from a std::istream.

                                                                                            3. -
                                                                                              friend bool operator==(const triangle_distribution & lhs, 
+
                                                                                              friend bool operator==(const triangle_distribution & lhs, 
                        const triangle_distribution & rhs);
                                                                                              
 
                                                                                              Returns true if the two distributions will produce identical sequences of values given equal generators.
                                                                                            4. -
                                                                                              friend bool operator!=(const triangle_distribution & lhs, 
+
                                                                                              friend bool operator!=(const triangle_distribution & lhs, 
                        const triangle_distribution & rhs);
                                                                                              
 
                                                                                              Returns true if the two distributions may produce different sequences of values given equal generators.
                                                                                              5. @@ -207,7 +207,7 @@
                                                                                              -PrevUpHomeNext +PrevUpHomeNext
                                                                                              diff --git a/doc/html/boost/random/triangle_distribution/param_type.html b/doc/html/boost/random/triangle_distribution/param_type.html index caf9eca07d..0d101095cd 100644 --- a/doc/html/boost/random/triangle_distribution/param_type.html +++ b/doc/html/boost/random/triangle_distribution/param_type.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                                                                              -PrevUpHomeNext +PrevUpHomeNext
                                                                                              @@ -40,77 +40,77 @@ typedef triangle_distribution distribution_type; // construct/copy/destruct - explicit param_type(RealType = 0.0, RealType = 0.5, RealType = 1.0); + explicit param_type(RealType = 0.0, RealType = 0.5, RealType = 1.0); - // public member functions - RealType a() const; - RealType b() const; - RealType c() const; + // public member functions + RealType a() const; + RealType b() const; + RealType c() const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); + operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, const param_type &); - friend bool operator==(const param_type &, const param_type &); - friend bool operator!=(const param_type &, const param_type &); + operator>>(std::basic_istream< CharT, Traits > &, const param_type &); + friend bool operator==(const param_type &, const param_type &); + friend bool operator!=(const param_type &, const param_type &); };
                                                                                              -

                                                                                              Description

                                                                                              +

                                                                                              Description

                                                                                              -

                                                                                              +

                                                                                              param_type public construct/copy/destruct

                                                                                              1. -
                                                                                                explicit param_type(RealType a = 0.0, RealType b = 0.5, RealType c = 1.0);
                                                                                                +
                                                                                                explicit param_type(RealType a = 0.0, RealType b = 0.5, RealType c = 1.0);

                                                                                                Constructs the parameters of a triangle_distribution.

                                                                                              -

                                                                                              -param_type public member functions

                                                                                              +

                                                                                              +param_type public member functions

                                                                                              1. -
                                                                                                RealType a() const;
                                                                                                +
                                                                                                RealType a() const;

                                                                                                Returns the minimum value of the distribution.

                                                                                              2. -
                                                                                                RealType b() const;
                                                                                                +
                                                                                                RealType b() const;

                                                                                                Returns the mode of the distribution.

                                                                                              3. -
                                                                                                RealType c() const;
                                                                                                +
                                                                                                RealType c() const;

                                                                                                Returns the maximum value of the distribution.

                                                                                              -

                                                                                              -param_type friend functions

                                                                                              +

                                                                                              +param_type friend functions

                                                                                              1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const param_type & param);

                                                                                                Writes the parameters to a std::ostream. 

                                                                                              2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
              const param_type & param);

                                                                                                Reads the parameters from a std::istream.

                                                                                              3. -
                                                                                                friend bool operator==(const param_type & lhs, const param_type & rhs);
                                                                                                +
                                                                                                friend bool operator==(const param_type & lhs, const param_type & rhs);

                                                                                                Returns true if the two sets of parameters are equal.

                                                                                              4. -
                                                                                                friend bool operator!=(const param_type & lhs, const param_type & rhs);
                                                                                                +
                                                                                                friend bool operator!=(const param_type & lhs, const param_type & rhs);

                                                                                                Returns true if the two sets of parameters are different.

                                                                                              @@ -127,7 +127,7 @@
                                                                                              -PrevUpHomeNext +PrevUpHomeNext
                                                                                              diff --git a/doc/html/boost/random/uniform_01.html b/doc/html/boost/random/uniform_01.html index e87a95e6de..00a35c4373 100644 --- a/doc/html/boost/random/uniform_01.html +++ b/doc/html/boost/random/uniform_01.html @@ -39,25 +39,25 @@ typedef RealType input_type; typedef RealType result_type; - // public member functions - result_type min() const; - result_type max() const; - void reset(); - template<typename Engine> result_type operator()(Engine &); + // public member functions + result_type min() const; + result_type max() const; + void reset(); + template<typename Engine> result_type operator()(Engine &); };
                                                                                              -

                                                                                              Description

                                                                                              +

                                                                                              Description

                                                                                              The distribution function uniform_01 models a random distribution . On each invocation, it returns a random floating-point value uniformly distributed in the range [0..1).

                                                                                              The template parameter RealType shall denote a float-like value type with support for binary operators +, -, and /.

                                                                                              Note: The current implementation is buggy, because it may not fill all of the mantissa with random bits. I'm unsure how to fill a (to-be-invented) boost::bigfloat class with random bits efficiently. It's probably time for a traits class.

                                                                                              -

                                                                                              -uniform_01 public member functions

                                                                                              +

                                                                                              +uniform_01 public member functions

                                                                                                -
                                                                                              1. result_type min() const;
                                                                                                2. -
                                                                                              2. result_type max() const;
                                                                                                3. -
                                                                                              3. void reset();
                                                                                                4. -
                                                                                              4. template<typename Engine> result_type operator()(Engine & eng);
                                                                                                5. +
                                                                                              5. result_type min() const;
                                                                                                6. +
                                                                                              6. result_type max() const;
                                                                                                7. +
                                                                                              7. void reset();
                                                                                                8. +
                                                                                              8. template<typename Engine> result_type operator()(Engine & eng);
                                                                                              diff --git a/doc/html/boost/random/uniform_int_distribution.html b/doc/html/boost/random/uniform_int_distribution.html index a8188a7844..16e508b1ab 100644 --- a/doc/html/boost/random/uniform_int_distribution.html +++ b/doc/html/boost/random/uniform_int_distribution.html @@ -47,145 +47,145 @@ typedef uniform_int_distribution distribution_type; // construct/copy/destruct - explicit param_type(IntType = 0, + explicit param_type(IntType = 0, IntType = (std::numeric_limits< IntType >::max)()); - // public member functions - IntType a() const; - IntType b() const; + // public member functions + IntType a() const; + IntType b() const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); + operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, const param_type &); - friend bool operator==(const param_type &, const param_type &); - friend bool operator!=(const param_type &, const param_type &); + operator>>(std::basic_istream< CharT, Traits > &, const param_type &); + friend bool operator==(const param_type &, const param_type &); + friend bool operator!=(const param_type &, const param_type &); }; // construct/copy/destruct - explicit uniform_int_distribution(IntType = 0, + explicit uniform_int_distribution(IntType = 0, IntType = (std::numeric_limits< IntType >::max)()); - explicit uniform_int_distribution(const param_type &); + explicit uniform_int_distribution(const param_type &); - // public member functions - IntType min() const; - IntType max() const; - IntType a() const; - IntType b() const; - param_type param() const; - void param(const param_type &); - void reset(); - template<typename Engine> result_type operator()(Engine &) const; + // public member functions + IntType min() const; + IntType max() const; + IntType a() const; + IntType b() const; + param_type param() const; + void param(const param_type &); + void reset(); + template<typename Engine> result_type operator()(Engine &) const; template<typename Engine> - result_type operator()(Engine &, const param_type &) const; + result_type operator()(Engine &, const param_type &) const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, + operator<<(std::basic_ostream< CharT, Traits > &, const uniform_int_distribution &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, + operator>>(std::basic_istream< CharT, Traits > &, const uniform_int_distribution &); - friend bool operator==(const uniform_int_distribution &, + friend bool operator==(const uniform_int_distribution &, const uniform_int_distribution &); - friend bool operator!=(const uniform_int_distribution &, + friend bool operator!=(const uniform_int_distribution &, const uniform_int_distribution &); };
                                                                                              -

                                                                                              Description

                                                                                              +

                                                                                              Description

                                                                                              The class template uniform_int_distribution models a random distribution . On each invocation, it returns a random integer value uniformly distributed in the set of integers {min, min+1, min+2, ..., max}.

                                                                                              The template parameter IntType shall denote an integer-like value type.

                                                                                              -

                                                                                              +

                                                                                              uniform_int_distribution public construct/copy/destruct

                                                                                              1. -
                                                                                                explicit uniform_int_distribution(IntType min = 0, 
+
                                                                                                explicit uniform_int_distribution(IntType min = 0, 
                                   IntType max = (std::numeric_limits< IntType >::max)());
                                                                                                
 
                                                                                                Constructs a uniform_int_distribution. min and max are the parameters of the distribution.
                                                                                                
 
                                                                                                Requires: min <= max
                                                                                              2. -
                                                                                                explicit uniform_int_distribution(const param_type & param);
                                                                                                +
                                                                                                explicit uniform_int_distribution(const param_type & param);

                                                                                                Constructs a uniform_int_distribution from its parameters.

                                                                                              -

                                                                                              -uniform_int_distribution public member functions

                                                                                              +

                                                                                              +uniform_int_distribution public member functions

                                                                                              1. -
                                                                                                IntType min() const;
                                                                                                +
                                                                                                IntType min() const;

                                                                                                Returns the minimum value of the distribution

                                                                                              2. -
                                                                                                IntType max() const;
                                                                                                +
                                                                                                IntType max() const;

                                                                                                Returns the maximum value of the distribution

                                                                                              3. -
                                                                                                IntType a() const;
                                                                                                +
                                                                                                IntType a() const;

                                                                                                Returns the minimum value of the distribution

                                                                                              4. -
                                                                                                IntType b() const;
                                                                                                +
                                                                                                IntType b() const;

                                                                                                Returns the maximum value of the distribution

                                                                                              5. -
                                                                                                param_type param() const;
                                                                                                +
                                                                                                param_type param() const;

                                                                                                Returns the parameters of the distribution.

                                                                                              6. -
                                                                                                void param(const param_type & param);
                                                                                                +
                                                                                                void param(const param_type & param);

                                                                                                Sets the parameters of the distribution.

                                                                                              7. -
                                                                                                void reset();
                                                                                                +
                                                                                                void reset();

                                                                                                Effects: Subsequent uses of the distribution do not depend on values produced by any engine prior to invoking reset.

                                                                                              8. -
                                                                                                template<typename Engine> result_type operator()(Engine & eng) const;
                                                                                                +
                                                                                                template<typename Engine> result_type operator()(Engine & eng) const;

                                                                                                Returns an integer uniformly distributed in the range [min, max]. 

                                                                                              9. template<typename Engine> 
-  result_type operator()(Engine & eng, const param_type & param) const;
                                                                                                + result_type operator()(Engine & eng, const param_type & param) const;

                                                                                                Returns an integer uniformly distributed in the range [param.a(), param.b()].

                                                                                              -

                                                                                              -uniform_int_distribution friend functions

                                                                                              +

                                                                                              +uniform_int_distribution friend functions

                                                                                              1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const uniform_int_distribution & ud);

                                                                                                Writes the distribution to a std::ostream. 

                                                                                              2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
              const uniform_int_distribution & ud);

                                                                                                Reads the distribution from a std::istream.

                                                                                              3. -
                                                                                                friend bool operator==(const uniform_int_distribution & lhs, 
+
                                                                                                friend bool operator==(const uniform_int_distribution & lhs, 
                        const uniform_int_distribution & rhs);
                                                                                                
 
                                                                                                Returns true if the two distributions will produce identical sequences of values given equal generators.
                                                                                              4. -
                                                                                                friend bool operator!=(const uniform_int_distribution & lhs, 
+
                                                                                                friend bool operator!=(const uniform_int_distribution & lhs, 
                        const uniform_int_distribution & rhs);
                                                                                                
 
                                                                                                Returns true if the two distributions may produce different sequences of values given equal generators.
                                                                                                5. diff --git a/doc/html/boost/random/uniform_int_distribution/param_type.html b/doc/html/boost/random/uniform_int_distribution/param_type.html index 5ac7d2103e..a4179734f9 100644 --- a/doc/html/boost/random/uniform_int_distribution/param_type.html +++ b/doc/html/boost/random/uniform_int_distribution/param_type.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                                                                                -PrevUpHomeNext +PrevUpHomeNext
                                                                                                @@ -40,75 +40,75 @@ typedef uniform_int_distribution distribution_type; // construct/copy/destruct - explicit param_type(IntType = 0, + explicit param_type(IntType = 0, IntType = (std::numeric_limits< IntType >::max)()); - // public member functions - IntType a() const; - IntType b() const; + // public member functions + IntType a() const; + IntType b() const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); + operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, const param_type &); - friend bool operator==(const param_type &, const param_type &); - friend bool operator!=(const param_type &, const param_type &); + operator>>(std::basic_istream< CharT, Traits > &, const param_type &); + friend bool operator==(const param_type &, const param_type &); + friend bool operator!=(const param_type &, const param_type &); };
                                                                                                -

                                                                                                Description

                                                                                                +

                                                                                                Description

                                                                                                -

                                                                                                +

                                                                                                param_type public construct/copy/destruct

                                                                                                1. -
                                                                                                  explicit param_type(IntType min = 0, 
+
                                                                                                  explicit param_type(IntType min = 0, 
                     IntType max = (std::numeric_limits< IntType >::max)());
                                                                                                  
 
                                                                                                  Constructs the parameters of a uniform_int_distribution.
                                                                                                  
 
                                                                                                  Requires min <= max
                                                                                                -

                                                                                                -param_type public member functions

                                                                                                +

                                                                                                +param_type public member functions

                                                                                                1. -
                                                                                                  IntType a() const;
                                                                                                  +
                                                                                                  IntType a() const;

                                                                                                  Returns the minimum value of the distribution.

                                                                                                2. -
                                                                                                  IntType b() const;
                                                                                                  +
                                                                                                  IntType b() const;

                                                                                                  Returns the maximum value of the distribution.

                                                                                                -

                                                                                                -param_type friend functions

                                                                                                +

                                                                                                +param_type friend functions

                                                                                                1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const param_type & param);

                                                                                                  Writes the parameters to a std::ostream. 

                                                                                                2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
              const param_type & param);

                                                                                                  Reads the parameters from a std::istream.

                                                                                                3. -
                                                                                                  friend bool operator==(const param_type & lhs, const param_type & rhs);
                                                                                                  +
                                                                                                  friend bool operator==(const param_type & lhs, const param_type & rhs);

                                                                                                  Returns true if the two sets of parameters are equal.

                                                                                                4. -
                                                                                                  friend bool operator!=(const param_type & lhs, const param_type & rhs);
                                                                                                  +
                                                                                                  friend bool operator!=(const param_type & lhs, const param_type & rhs);

                                                                                                  Returns true if the two sets of parameters are different.

                                                                                                @@ -125,7 +125,7 @@
                                                                                                -PrevUpHomeNext +PrevUpHomeNext
                                                                                                diff --git a/doc/html/boost/random/uniform_on_sphere.html b/doc/html/boost/random/uniform_on_sphere.html index 0893391977..e983619ce2 100644 --- a/doc/html/boost/random/uniform_on_sphere.html +++ b/doc/html/boost/random/uniform_on_sphere.html @@ -47,133 +47,133 @@ typedef uniform_on_sphere distribution_type; // construct/copy/destruct - explicit param_type(int = 2); + explicit param_type(int = 2); - // public member functions - int dim() const; + // public member functions + int dim() const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); + operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, const param_type &); - friend bool operator==(const param_type &, const param_type &); - friend bool operator!=(const param_type &, const param_type &); + operator>>(std::basic_istream< CharT, Traits > &, const param_type &); + friend bool operator==(const param_type &, const param_type &); + friend bool operator!=(const param_type &, const param_type &); }; // construct/copy/destruct - explicit uniform_on_sphere(int = 2); - explicit uniform_on_sphere(const param_type &); + explicit uniform_on_sphere(int = 2); + explicit uniform_on_sphere(const param_type &); - // public member functions - int dim() const; - param_type param() const; - void param(const param_type &); - result_type min() const; - result_type max() const; - void reset(); - template<typename Engine> const result_type & operator()(Engine &); + // public member functions + int dim() const; + param_type param() const; + void param(const param_type &); + result_type min() const; + result_type max() const; + void reset(); + template<typename Engine> const result_type & operator()(Engine &); template<typename Engine> - result_type operator()(Engine &, const param_type &) const; + result_type operator()(Engine &, const param_type &) const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, + operator<<(std::basic_ostream< CharT, Traits > &, const uniform_on_sphere &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, + operator>>(std::basic_istream< CharT, Traits > &, const uniform_on_sphere &); - friend bool operator==(const uniform_on_sphere &, const uniform_on_sphere &); - friend bool operator!=(const uniform_on_sphere &, const uniform_on_sphere &); + friend bool operator==(const uniform_on_sphere &, const uniform_on_sphere &); + friend bool operator!=(const uniform_on_sphere &, const uniform_on_sphere &); };
                                                                                                -

                                                                                                Description

                                                                                                +

                                                                                                Description

                                                                                                Instantiations of class template uniform_on_sphere model a random distribution . Such a distribution produces random numbers uniformly distributed on the unit sphere of arbitrary dimension dim. The Cont template parameter must be a STL-like container type with begin and end operations returning non-const ForwardIterators of type Cont::iterator.

                                                                                                -

                                                                                                +

                                                                                                uniform_on_sphere public construct/copy/destruct

                                                                                                1. -
                                                                                                  explicit uniform_on_sphere(int dim = 2);
                                                                                                  +
                                                                                                  explicit uniform_on_sphere(int dim = 2);

                                                                                                  Constructs a uniform_on_sphere distribution. dim is the dimension of the sphere.

                                                                                                  Requires: dim >= 0

                                                                                                2. -
                                                                                                  explicit uniform_on_sphere(const param_type & param);
                                                                                                  +
                                                                                                  explicit uniform_on_sphere(const param_type & param);

                                                                                                  Constructs a uniform_on_sphere distribution from its parameters.

                                                                                                -

                                                                                                -uniform_on_sphere public member functions

                                                                                                +

                                                                                                +uniform_on_sphere public member functions

                                                                                                1. -
                                                                                                  int dim() const;
                                                                                                  +
                                                                                                  int dim() const;

                                                                                                  Returns the dimension of the sphere.

                                                                                                2. -
                                                                                                  param_type param() const;
                                                                                                  +
                                                                                                  param_type param() const;

                                                                                                  Returns the parameters of the distribution.

                                                                                                3. -
                                                                                                  void param(const param_type & param);
                                                                                                  +
                                                                                                  void param(const param_type & param);

                                                                                                  Sets the parameters of the distribution.

                                                                                                4. -
                                                                                                  result_type min() const;
                                                                                                  +
                                                                                                  result_type min() const;

                                                                                                  Returns the smallest value that the distribution can produce. Note that this is required to approximate the standard library's requirements. The behavior is defined according to lexicographical comparison so that for a container type of std::vector, dist.min() <= x <= dist.max() where x is any value produced by the distribution.

                                                                                                5. -
                                                                                                  result_type max() const;
                                                                                                  +
                                                                                                  result_type max() const;

                                                                                                  Returns the largest value that the distribution can produce. Note that this is required to approximate the standard library's requirements. The behavior is defined according to lexicographical comparison so that for a container type of std::vector, dist.min() <= x <= dist.max() where x is any value produced by the distribution.

                                                                                                6. -
                                                                                                  void reset();
                                                                                                  +
                                                                                                  void reset();

                                                                                                  Effects: Subsequent uses of the distribution do not depend on values produced by any engine prior to invoking reset.

                                                                                                7. -
                                                                                                  template<typename Engine> const result_type & operator()(Engine & eng);
                                                                                                  +
                                                                                                  template<typename Engine> const result_type & operator()(Engine & eng);

                                                                                                  Returns a point uniformly distributed over the surface of a sphere of dimension dim(). 

                                                                                                8. template<typename Engine> 
-  result_type operator()(Engine & eng, const param_type & param) const;
                                                                                                  + result_type operator()(Engine & eng, const param_type & param) const;

                                                                                                  Returns a point uniformly distributed over the surface of a sphere of dimension param.dim().

                                                                                                -

                                                                                                -uniform_on_sphere friend functions

                                                                                                +

                                                                                                +uniform_on_sphere friend functions

                                                                                                1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const uniform_on_sphere & sd);

                                                                                                  Writes the distribution to a std::ostream. 

                                                                                                2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
              const uniform_on_sphere & sd);

                                                                                                  Reads the distribution from a std::istream.

                                                                                                3. -
                                                                                                  friend bool operator==(const uniform_on_sphere & lhs, 
+
                                                                                                  friend bool operator==(const uniform_on_sphere & lhs, 
                        const uniform_on_sphere & rhs);
                                                                                                  
 
                                                                                                  Returns true if the two distributions will produce identical sequences of values, given equal generators.
                                                                                                4. -
                                                                                                  friend bool operator!=(const uniform_on_sphere & lhs, 
+
                                                                                                  friend bool operator!=(const uniform_on_sphere & lhs, 
                        const uniform_on_sphere & rhs);
                                                                                                  
 
                                                                                                  Returns true if the two distributions may produce different sequences of values, given equal generators.
                                                                                                  5. diff --git a/doc/html/boost/random/uniform_on_sphere/param_type.html b/doc/html/boost/random/uniform_on_sphere/param_type.html index a21abb6671..ac6f13033e 100644 --- a/doc/html/boost/random/uniform_on_sphere/param_type.html +++ b/doc/html/boost/random/uniform_on_sphere/param_type.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                                                                                  -PrevUpHomeNext +PrevUpHomeNext
                                                                                                  @@ -40,65 +40,65 @@ typedef uniform_on_sphere distribution_type; // construct/copy/destruct - explicit param_type(int = 2); + explicit param_type(int = 2); - // public member functions - int dim() const; + // public member functions + int dim() const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); + operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, const param_type &); - friend bool operator==(const param_type &, const param_type &); - friend bool operator!=(const param_type &, const param_type &); + operator>>(std::basic_istream< CharT, Traits > &, const param_type &); + friend bool operator==(const param_type &, const param_type &); + friend bool operator!=(const param_type &, const param_type &); };
                                                                                                  -

                                                                                                  Description

                                                                                                  +

                                                                                                  Description

                                                                                                  -

                                                                                                  +

                                                                                                  param_type public construct/copy/destruct

                                                                                                  1. -
                                                                                                    explicit param_type(int dim = 2);
                                                                                                    +
                                                                                                    explicit param_type(int dim = 2);

                                                                                                    Constructs the parameters of a uniform_on_sphere distribution, given the dimension of the sphere.

                                                                                                  -

                                                                                                  -param_type public member functions

                                                                                                  +

                                                                                                  +param_type public member functions

                                                                                                  1. -
                                                                                                    int dim() const;
                                                                                                    +
                                                                                                    int dim() const;

                                                                                                    Returns the dimension of the sphere.

                                                                                                  -

                                                                                                  -param_type friend functions

                                                                                                  +

                                                                                                  +param_type friend functions

                                                                                                  1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const param_type & param);

                                                                                                    Writes the parameters to a std::ostream. 

                                                                                                  2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
              const param_type & param);

                                                                                                    Reads the parameters from a std::istream.

                                                                                                  3. -
                                                                                                    friend bool operator==(const param_type & lhs, const param_type & rhs);
                                                                                                    +
                                                                                                    friend bool operator==(const param_type & lhs, const param_type & rhs);

                                                                                                    Returns true if the two sets of parameters are equal.

                                                                                                  4. -
                                                                                                    friend bool operator!=(const param_type & lhs, const param_type & rhs);
                                                                                                    +
                                                                                                    friend bool operator!=(const param_type & lhs, const param_type & rhs);

                                                                                                    Returns true if the two sets of parameters are different.

                                                                                                  @@ -115,7 +115,7 @@
                                                                                                  -PrevUpHomeNext +PrevUpHomeNext
                                                                                                  diff --git a/doc/html/boost/random/uniform_real_distribution.html b/doc/html/boost/random/uniform_real_distribution.html index 1fbf6b0304..9f789306b1 100644 --- a/doc/html/boost/random/uniform_real_distribution.html +++ b/doc/html/boost/random/uniform_real_distribution.html @@ -47,141 +47,141 @@ typedef uniform_real_distribution distribution_type; // construct/copy/destruct - explicit param_type(RealType = 0.0, RealType = 1.0); + explicit param_type(RealType = 0.0, RealType = 1.0); - // public member functions - RealType a() const; - RealType b() const; + // public member functions + RealType a() const; + RealType b() const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); + operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, const param_type &); - friend bool operator==(const param_type &, const param_type &); - friend bool operator!=(const param_type &, const param_type &); + operator>>(std::basic_istream< CharT, Traits > &, const param_type &); + friend bool operator==(const param_type &, const param_type &); + friend bool operator!=(const param_type &, const param_type &); }; // construct/copy/destruct - explicit uniform_real_distribution(RealType = 0.0, RealType = 1.0); - explicit uniform_real_distribution(const param_type &); + explicit uniform_real_distribution(RealType = 0.0, RealType = 1.0); + explicit uniform_real_distribution(const param_type &); - // public member functions - RealType min() const; - RealType max() const; - RealType a() const; - RealType b() const; - param_type param() const; - void param(const param_type &); - void reset(); - template<typename Engine> result_type operator()(Engine &) const; + // public member functions + RealType min() const; + RealType max() const; + RealType a() const; + RealType b() const; + param_type param() const; + void param(const param_type &); + void reset(); + template<typename Engine> result_type operator()(Engine &) const; template<typename Engine> - result_type operator()(Engine &, const param_type &) const; + result_type operator()(Engine &, const param_type &) const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, + operator<<(std::basic_ostream< CharT, Traits > &, const uniform_real_distribution &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, + operator>>(std::basic_istream< CharT, Traits > &, const uniform_real_distribution &); - friend bool operator==(const uniform_real_distribution &, + friend bool operator==(const uniform_real_distribution &, const uniform_real_distribution &); - friend bool operator!=(const uniform_real_distribution &, + friend bool operator!=(const uniform_real_distribution &, const uniform_real_distribution &); };
                                                                                                  -

                                                                                                  Description

                                                                                                  +

                                                                                                  Description

                                                                                                  The class template uniform_real_distribution models a random distribution . On each invocation, it returns a random floating-point value uniformly distributed in the range [min..max).

                                                                                                  -

                                                                                                  +

                                                                                                  uniform_real_distribution public construct/copy/destruct

                                                                                                  1. -
                                                                                                    explicit uniform_real_distribution(RealType min = 0.0, RealType max = 1.0);
                                                                                                    +
                                                                                                    explicit uniform_real_distribution(RealType min = 0.0, RealType max = 1.0);

                                                                                                    Constructs a uniform_real_distribution. min and max are the parameters of the distribution.

                                                                                                    Requires: min <= max

                                                                                                  2. -
                                                                                                    explicit uniform_real_distribution(const param_type & param);
                                                                                                    +
                                                                                                    explicit uniform_real_distribution(const param_type & param);

                                                                                                    Constructs a uniform_real_distribution from its parameters.

                                                                                                  -

                                                                                                  -uniform_real_distribution public member functions

                                                                                                  +

                                                                                                  +uniform_real_distribution public member functions

                                                                                                  1. -
                                                                                                    RealType min() const;
                                                                                                    +
                                                                                                    RealType min() const;

                                                                                                    Returns the minimum value of the distribution

                                                                                                  2. -
                                                                                                    RealType max() const;
                                                                                                    +
                                                                                                    RealType max() const;

                                                                                                    Returns the maximum value of the distribution

                                                                                                  3. -
                                                                                                    RealType a() const;
                                                                                                    +
                                                                                                    RealType a() const;

                                                                                                    Returns the minimum value of the distribution

                                                                                                  4. -
                                                                                                    RealType b() const;
                                                                                                    +
                                                                                                    RealType b() const;

                                                                                                    Returns the maximum value of the distribution

                                                                                                  5. -
                                                                                                    param_type param() const;
                                                                                                    +
                                                                                                    param_type param() const;

                                                                                                    Returns the parameters of the distribution.

                                                                                                  6. -
                                                                                                    void param(const param_type & param);
                                                                                                    +
                                                                                                    void param(const param_type & param);

                                                                                                    Sets the parameters of the distribution.

                                                                                                  7. -
                                                                                                    void reset();
                                                                                                    +
                                                                                                    void reset();

                                                                                                    Effects: Subsequent uses of the distribution do not depend on values produced by any engine prior to invoking reset.

                                                                                                  8. -
                                                                                                    template<typename Engine> result_type operator()(Engine & eng) const;
                                                                                                    +
                                                                                                    template<typename Engine> result_type operator()(Engine & eng) const;

                                                                                                    Returns a value uniformly distributed in the range [min, max). 

                                                                                                  9. template<typename Engine> 
-  result_type operator()(Engine & eng, const param_type & param) const;
                                                                                                    + result_type operator()(Engine & eng, const param_type & param) const;

                                                                                                    Returns a value uniformly distributed in the range [param.a(), param.b()).

                                                                                                  -

                                                                                                  -uniform_real_distribution friend functions

                                                                                                  +

                                                                                                  +uniform_real_distribution friend functions

                                                                                                  1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const uniform_real_distribution & ud);

                                                                                                    Writes the distribution to a std::ostream. 

                                                                                                  2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
              const uniform_real_distribution & ud);

                                                                                                    Reads the distribution from a std::istream.

                                                                                                  3. -
                                                                                                    friend bool operator==(const uniform_real_distribution & lhs, 
+
                                                                                                    friend bool operator==(const uniform_real_distribution & lhs, 
                        const uniform_real_distribution & rhs);
                                                                                                    
 
                                                                                                    Returns true if the two distributions will produce identical sequences of values given equal generators.
                                                                                                  4. -
                                                                                                    friend bool operator!=(const uniform_real_distribution & lhs, 
+
                                                                                                    friend bool operator!=(const uniform_real_distribution & lhs, 
                        const uniform_real_distribution & rhs);
                                                                                                    
 
                                                                                                    Returns true if the two distributions may produce different sequences of values given equal generators.
                                                                                                    5. diff --git a/doc/html/boost/random/uniform_real_distribution/param_type.html b/doc/html/boost/random/uniform_real_distribution/param_type.html index 5d4c3155be..9a868a2ea5 100644 --- a/doc/html/boost/random/uniform_real_distribution/param_type.html +++ b/doc/html/boost/random/uniform_real_distribution/param_type.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                                                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                                                                    @@ -40,73 +40,73 @@ typedef uniform_real_distribution distribution_type; // construct/copy/destruct - explicit param_type(RealType = 0.0, RealType = 1.0); + explicit param_type(RealType = 0.0, RealType = 1.0); - // public member functions - RealType a() const; - RealType b() const; + // public member functions + RealType a() const; + RealType b() const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); + operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, const param_type &); - friend bool operator==(const param_type &, const param_type &); - friend bool operator!=(const param_type &, const param_type &); + operator>>(std::basic_istream< CharT, Traits > &, const param_type &); + friend bool operator==(const param_type &, const param_type &); + friend bool operator!=(const param_type &, const param_type &); };
                                                                                                    -

                                                                                                    Description

                                                                                                    +

                                                                                                    Description

                                                                                                    -

                                                                                                    +

                                                                                                    param_type public construct/copy/destruct

                                                                                                    1. -
                                                                                                      explicit param_type(RealType min = 0.0, RealType max = 1.0);
                                                                                                      +
                                                                                                      explicit param_type(RealType min = 0.0, RealType max = 1.0);

                                                                                                      Constructs the parameters of a uniform_real_distribution.

                                                                                                      Requires min <= max

                                                                                                    -

                                                                                                    -param_type public member functions

                                                                                                    +

                                                                                                    +param_type public member functions

                                                                                                    1. -
                                                                                                      RealType a() const;
                                                                                                      +
                                                                                                      RealType a() const;

                                                                                                      Returns the minimum value of the distribution.

                                                                                                    2. -
                                                                                                      RealType b() const;
                                                                                                      +
                                                                                                      RealType b() const;

                                                                                                      Returns the maximum value of the distribution.

                                                                                                    -

                                                                                                    -param_type friend functions

                                                                                                    +

                                                                                                    +param_type friend functions

                                                                                                    1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const param_type & param);

                                                                                                      Writes the parameters to a std::ostream. 

                                                                                                    2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
              const param_type & param);

                                                                                                      Reads the parameters from a std::istream.

                                                                                                    3. -
                                                                                                      friend bool operator==(const param_type & lhs, const param_type & rhs);
                                                                                                      +
                                                                                                      friend bool operator==(const param_type & lhs, const param_type & rhs);

                                                                                                      Returns true if the two sets of parameters are equal.

                                                                                                    4. -
                                                                                                      friend bool operator!=(const param_type & lhs, const param_type & rhs);
                                                                                                      +
                                                                                                      friend bool operator!=(const param_type & lhs, const param_type & rhs);

                                                                                                      Returns true if the two sets of parameters are different.

                                                                                                    @@ -123,7 +123,7 @@
                                                                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                                                                    diff --git a/doc/html/boost/random/uniform_smallint.html b/doc/html/boost/random/uniform_smallint.html index 962fbcf2eb..a5d11141ee 100644 --- a/doc/html/boost/random/uniform_smallint.html +++ b/doc/html/boost/random/uniform_smallint.html @@ -47,55 +47,55 @@ typedef uniform_smallint distribution_type; // construct/copy/destruct - param_type(IntType = 0, IntType = 9); + param_type(IntType = 0, IntType = 9); - // public member functions - IntType a() const; - IntType b() const; + // public member functions + IntType a() const; + IntType b() const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); + operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, const param_type &); - friend bool operator==(const param_type &, const param_type &); - friend bool operator!=(const param_type &, const param_type &); + operator>>(std::basic_istream< CharT, Traits > &, const param_type &); + friend bool operator==(const param_type &, const param_type &); + friend bool operator!=(const param_type &, const param_type &); }; // construct/copy/destruct - explicit uniform_smallint(IntType = 0, IntType = 9); - explicit uniform_smallint(const param_type &); + explicit uniform_smallint(IntType = 0, IntType = 9); + explicit uniform_smallint(const param_type &); - // public member functions - result_type a() const; - result_type b() const; - result_type min() const; - result_type max() const; - param_type param() const; - void param(const param_type &); - void reset(); - template<typename Engine> result_type operator()(Engine &) const; + // public member functions + result_type a() const; + result_type b() const; + result_type min() const; + result_type max() const; + param_type param() const; + void param(const param_type &); + void reset(); + template<typename Engine> result_type operator()(Engine &) const; template<typename Engine> - result_type operator()(Engine &, const param_type &) const; + result_type operator()(Engine &, const param_type &) const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, + operator<<(std::basic_ostream< CharT, Traits > &, const uniform_smallint &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, + operator>>(std::basic_istream< CharT, Traits > &, const uniform_smallint &); - friend bool operator==(const uniform_smallint &, const uniform_smallint &); - friend bool operator!=(const uniform_smallint &, const uniform_smallint &); + friend bool operator==(const uniform_smallint &, const uniform_smallint &); + friend bool operator!=(const uniform_smallint &, const uniform_smallint &); };
                                                                                                    -

                                                                                                    Description

                                                                                                    +

                                                                                                    Description

                                                                                                    The distribution function uniform_smallint models a random distribution . On each invocation, it returns a random integer value uniformly distributed in the set of integer numbers {min, min+1, min+2, ..., max}. It assumes that the desired range (max-min+1) is small compared to the range of the underlying source of random numbers and thus makes no attempt to limit quantization errors.

                                                                                                    -

                                                                                                    Let the desired range of integer numbers, and let be the range of the underlying source of random numbers. Then, for the uniform distribution, the theoretical probability for any number i in the range will be . Likewise, assume a uniform distribution on for the underlying source of random numbers, i.e. . Let denote the random distribution generated by uniform_smallint. Then the sum over all i in of shall not exceed .

                                                                                                    +

                                                                                                    Let the desired range of integer numbers, and let be the range of the underlying source of random numbers. Then, for the uniform distribution, the theoretical probability for any number i in the range will be . Likewise, assume a uniform distribution on for the underlying source of random numbers, i.e. . Let denote the random distribution generated by uniform_smallint. Then the sum over all i in of shall not exceed .

                                                                                                    The template parameter IntType shall denote an integer-like value type.

                                                                                                    @@ -103,94 +103,94 @@ - +
                                                                                                    [Note] Note

                                                                                                    The property above is the square sum of the relative differences in probabilities between the desired uniform distribution and the generated distribution . The property can be fulfilled with the calculation , as follows: Let . The base distribution on is folded onto the range . The numbers i < r have assigned numbers of the base distribution, the rest has only . Therefore, for i < r and otherwise. Substituting this in the above sum formula leads to the desired result.

                                                                                                    The property above is the square sum of the relative differences in probabilities between the desired uniform distribution and the generated distribution . The property can be fulfilled with the calculation , as follows: Let . The base distribution on is folded onto the range . The numbers i < r have assigned numbers of the base distribution, the rest has only . Therefore, for i < r and otherwise. Substituting this in the above sum formula leads to the desired result.

                                                                                                    -

                                                                                                    Note: The upper bound for is . Regarding the upper bound for the square sum of the relative quantization error of , it seems wise to either choose so that or ensure that is divisible by .

                                                                                                    +

                                                                                                    Note: The upper bound for is . Regarding the upper bound for the square sum of the relative quantization error of , it seems wise to either choose so that or ensure that is divisible by .

                                                                                                    -

                                                                                                    +

                                                                                                    uniform_smallint public construct/copy/destruct

                                                                                                    1. -
                                                                                                      explicit uniform_smallint(IntType min = 0, IntType max = 9);
                                                                                                      +
                                                                                                      explicit uniform_smallint(IntType min = 0, IntType max = 9);

                                                                                                      Constructs a uniform_smallint. min and max are the lower and upper bounds of the output range, respectively.

                                                                                                    2. -
                                                                                                      explicit uniform_smallint(const param_type & param);
                                                                                                      +
                                                                                                      explicit uniform_smallint(const param_type & param);

                                                                                                      Constructs a uniform_smallint from its parameters.

                                                                                                    -

                                                                                                    -uniform_smallint public member functions

                                                                                                    +

                                                                                                    +uniform_smallint public member functions

                                                                                                    1. -
                                                                                                      result_type a() const;
                                                                                                      +
                                                                                                      result_type a() const;

                                                                                                      Returns the minimum value of the distribution.

                                                                                                    2. -
                                                                                                      result_type b() const;
                                                                                                      +
                                                                                                      result_type b() const;

                                                                                                      Returns the maximum value of the distribution.

                                                                                                    3. -
                                                                                                      result_type min() const;
                                                                                                      +
                                                                                                      result_type min() const;

                                                                                                      Returns the minimum value of the distribution.

                                                                                                    4. -
                                                                                                      result_type max() const;
                                                                                                      +
                                                                                                      result_type max() const;

                                                                                                      Returns the maximum value of the distribution.

                                                                                                    5. -
                                                                                                      param_type param() const;
                                                                                                      +
                                                                                                      param_type param() const;

                                                                                                      Returns the parameters of the distribution.

                                                                                                    6. -
                                                                                                      void param(const param_type & param);
                                                                                                      +
                                                                                                      void param(const param_type & param);

                                                                                                      Sets the parameters of the distribution.

                                                                                                    7. -
                                                                                                      void reset();
                                                                                                      +
                                                                                                      void reset();

                                                                                                      Effects: Subsequent uses of the distribution do not depend on values produced by any engine prior to invoking reset.

                                                                                                    8. -
                                                                                                      template<typename Engine> result_type operator()(Engine & eng) const;
                                                                                                      +
                                                                                                      template<typename Engine> result_type operator()(Engine & eng) const;

                                                                                                      Returns a value uniformly distributed in the range [min(), max()]. 

                                                                                                    9. template<typename Engine> 
-  result_type operator()(Engine & eng, const param_type & param) const;
                                                                                                      + result_type operator()(Engine & eng, const param_type & param) const;

                                                                                                      Returns a value uniformly distributed in the range [param.a(), param.b()].

                                                                                                    -

                                                                                                    -uniform_smallint friend functions

                                                                                                    +

                                                                                                    +uniform_smallint friend functions

                                                                                                    1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const uniform_smallint & ud);

                                                                                                      Writes the distribution to a std::ostream. 

                                                                                                    2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
              const uniform_smallint & ud);

                                                                                                      Reads the distribution from a std::istream.

                                                                                                    3. -
                                                                                                      friend bool operator==(const uniform_smallint & lhs, 
+
                                                                                                      friend bool operator==(const uniform_smallint & lhs, 
                        const uniform_smallint & rhs);
                                                                                                      
 
                                                                                                      Returns true if the two distributions will produce identical sequences of values given equal generators.
                                                                                                    4. -
                                                                                                      friend bool operator!=(const uniform_smallint & lhs, 
+
                                                                                                      friend bool operator!=(const uniform_smallint & lhs, 
                        const uniform_smallint & rhs);
                                                                                                      
 
                                                                                                      Returns true if the two distributions may produce different sequences of values given equal generators.
                                                                                                      5. diff --git a/doc/html/boost/random/uniform_smallint/param_type.html b/doc/html/boost/random/uniform_smallint/param_type.html index 4c43479f4f..80b1c148b4 100644 --- a/doc/html/boost/random/uniform_smallint/param_type.html +++ b/doc/html/boost/random/uniform_smallint/param_type.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                                                                                      -PrevUpHomeNext +PrevUpHomeNext
                                                                                                      @@ -40,72 +40,72 @@ typedef uniform_smallint distribution_type; // construct/copy/destruct - param_type(IntType = 0, IntType = 9); + param_type(IntType = 0, IntType = 9); - // public member functions - IntType a() const; - IntType b() const; + // public member functions + IntType a() const; + IntType b() const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); + operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, const param_type &); - friend bool operator==(const param_type &, const param_type &); - friend bool operator!=(const param_type &, const param_type &); + operator>>(std::basic_istream< CharT, Traits > &, const param_type &); + friend bool operator==(const param_type &, const param_type &); + friend bool operator!=(const param_type &, const param_type &); };
                                                                                                      -

                                                                                                      Description

                                                                                                      +

                                                                                                      Description

                                                                                                      -

                                                                                                      +

                                                                                                      param_type public construct/copy/destruct

                                                                                                      1. -
                                                                                                        param_type(IntType min = 0, IntType max = 9);
                                                                                                        +
                                                                                                        param_type(IntType min = 0, IntType max = 9);

                                                                                                        constructs the parameters of a uniform_smallint distribution.

                                                                                                      -

                                                                                                      -param_type public member functions

                                                                                                      +

                                                                                                      +param_type public member functions

                                                                                                      1. -
                                                                                                        IntType a() const;
                                                                                                        +
                                                                                                        IntType a() const;

                                                                                                        Returns the minimum value.

                                                                                                      2. -
                                                                                                        IntType b() const;
                                                                                                        +
                                                                                                        IntType b() const;

                                                                                                        Returns the maximum value.

                                                                                                      -

                                                                                                      -param_type friend functions

                                                                                                      +

                                                                                                      +param_type friend functions

                                                                                                      1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const param_type & param);

                                                                                                        Writes the parameters to a std::ostream. 

                                                                                                      2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
              const param_type & param);

                                                                                                        Reads the parameters from a std::istream.

                                                                                                      3. -
                                                                                                        friend bool operator==(const param_type & lhs, const param_type & rhs);
                                                                                                        +
                                                                                                        friend bool operator==(const param_type & lhs, const param_type & rhs);

                                                                                                        Returns true if the two sets of parameters are equal.

                                                                                                      4. -
                                                                                                        friend bool operator!=(const param_type & lhs, const param_type & rhs);
                                                                                                        +
                                                                                                        friend bool operator!=(const param_type & lhs, const param_type & rhs);

                                                                                                        Returns true if the two sets of parameters are different.

                                                                                                      @@ -122,7 +122,7 @@
                                                                                                      -PrevUpHomeNext +PrevUpHomeNext
                                                                                                      diff --git a/doc/html/boost/random/weibull_distribution.html b/doc/html/boost/random/weibull_distribution.html index 72e97c14f3..843f3b6519 100644 --- a/doc/html/boost/random/weibull_distribution.html +++ b/doc/html/boost/random/weibull_distribution.html @@ -47,142 +47,142 @@ typedef weibull_distribution distribution_type; // construct/copy/destruct - explicit param_type(RealType = 1.0, RealType = 1.0); + explicit param_type(RealType = 1.0, RealType = 1.0); - // public member functions - RealType a() const; - RealType b() const; + // public member functions + RealType a() const; + RealType b() const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); + operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, const param_type &); - friend bool operator==(const param_type &, const param_type &); - friend bool operator!=(const param_type &, const param_type &); + operator>>(std::basic_istream< CharT, Traits > &, const param_type &); + friend bool operator==(const param_type &, const param_type &); + friend bool operator!=(const param_type &, const param_type &); }; // construct/copy/destruct - explicit weibull_distribution(RealType = 1.0, RealType = 1.0); - explicit weibull_distribution(const param_type &); + explicit weibull_distribution(RealType = 1.0, RealType = 1.0); + explicit weibull_distribution(const param_type &); - // public member functions - template<typename URNG> RealType operator()(URNG &) const; + // public member functions + template<typename URNG> RealType operator()(URNG &) const; template<typename URNG> - RealType operator()(URNG &, const param_type &) const; - RealType a() const; - RealType b() const; - RealType min() const; - RealType max() const; - param_type param() const; - void param(const param_type &); - void reset(); + RealType operator()(URNG &, const param_type &) const; + RealType a() const; + RealType b() const; + RealType min() const; + RealType max() const; + param_type param() const; + void param(const param_type &); + void reset(); - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, + operator<<(std::basic_ostream< CharT, Traits > &, const weibull_distribution &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, + operator>>(std::basic_istream< CharT, Traits > &, const weibull_distribution &); - friend bool operator==(const weibull_distribution &, + friend bool operator==(const weibull_distribution &, const weibull_distribution &); - friend bool operator!=(const weibull_distribution &, + friend bool operator!=(const weibull_distribution &, const weibull_distribution &); };
                                                                                                      -

                                                                                                      Description

                                                                                                      +

                                                                                                      Description

                                                                                                      The Weibull distribution is a real valued distribution with two parameters a and b, producing values >= 0.

                                                                                                      -

                                                                                                      It has .

                                                                                                      +

                                                                                                      It has .

                                                                                                      -

                                                                                                      +

                                                                                                      weibull_distribution public construct/copy/destruct

                                                                                                      1. -
                                                                                                        explicit weibull_distribution(RealType a = 1.0, RealType b = 1.0);
                                                                                                        +
                                                                                                        explicit weibull_distribution(RealType a = 1.0, RealType b = 1.0);

                                                                                                        Constructs a weibull_distribution from its "a" and "b" parameters.

                                                                                                        Requires: a > 0 && b > 0

                                                                                                      2. -
                                                                                                        explicit weibull_distribution(const param_type & param);
                                                                                                        +
                                                                                                        explicit weibull_distribution(const param_type & param);

                                                                                                        Constructs a weibull_distribution from its parameters.

                                                                                                      -

                                                                                                      -weibull_distribution public member functions

                                                                                                      +

                                                                                                      +weibull_distribution public member functions

                                                                                                      1. -
                                                                                                        template<typename URNG> RealType operator()(URNG & urng) const;
                                                                                                        +
                                                                                                        template<typename URNG> RealType operator()(URNG & urng) const;

                                                                                                        Returns a random variate distributed according to the weibull_distribution. 

                                                                                                      2. template<typename URNG> 
-  RealType operator()(URNG & urng, const param_type & param) const;
                                                                                                        + RealType operator()(URNG & urng, const param_type & param) const;

                                                                                                        Returns a random variate distributed accordint to the Weibull distribution with parameters specified by param.

                                                                                                      3. -
                                                                                                        RealType a() const;
                                                                                                        +
                                                                                                        RealType a() const;

                                                                                                        Returns the "a" parameter of the distribution.

                                                                                                      4. -
                                                                                                        RealType b() const;
                                                                                                        +
                                                                                                        RealType b() const;

                                                                                                        Returns the "b" parameter of the distribution.

                                                                                                      5. -
                                                                                                        RealType min() const;
                                                                                                        +
                                                                                                        RealType min() const;

                                                                                                        Returns the smallest value that the distribution can produce.

                                                                                                      6. -
                                                                                                        RealType max() const;
                                                                                                        +
                                                                                                        RealType max() const;

                                                                                                        Returns the largest value that the distribution can produce.

                                                                                                      7. -
                                                                                                        param_type param() const;
                                                                                                        +
                                                                                                        param_type param() const;

                                                                                                        Returns the parameters of the distribution.

                                                                                                      8. -
                                                                                                        void param(const param_type & param);
                                                                                                        +
                                                                                                        void param(const param_type & param);

                                                                                                        Sets the parameters of the distribution.

                                                                                                      9. -
                                                                                                        void reset();
                                                                                                        +
                                                                                                        void reset();

                                                                                                        Effects: Subsequent uses of the distribution do not depend on values produced by any engine prior to invoking reset.

                                                                                                      -

                                                                                                      -weibull_distribution friend functions

                                                                                                      +

                                                                                                      +weibull_distribution friend functions

                                                                                                      1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const weibull_distribution & wd);

                                                                                                        Writes a weibull_distribution to a std::ostream. 

                                                                                                      2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
              const weibull_distribution & wd);

                                                                                                        Reads a weibull_distribution from a std::istream.

                                                                                                      3. -
                                                                                                        friend bool operator==(const weibull_distribution & lhs, 
+
                                                                                                        friend bool operator==(const weibull_distribution & lhs, 
                        const weibull_distribution & rhs);
                                                                                                        
 
                                                                                                        Returns true if the two instances of weibull_distribution will return identical sequences of values given equal generators.
                                                                                                      4. -
                                                                                                        friend bool operator!=(const weibull_distribution & lhs, 
+
                                                                                                        friend bool operator!=(const weibull_distribution & lhs, 
                        const weibull_distribution & rhs);
                                                                                                        
 
                                                                                                        Returns true if the two instances of weibull_distribution will return different sequences of values given equal generators.
                                                                                                        5. diff --git a/doc/html/boost/random/weibull_distribution/param_type.html b/doc/html/boost/random/weibull_distribution/param_type.html index 2ec822411b..befff843c1 100644 --- a/doc/html/boost/random/weibull_distribution/param_type.html +++ b/doc/html/boost/random/weibull_distribution/param_type.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                                        @@ -40,73 +40,73 @@ typedef weibull_distribution distribution_type; // construct/copy/destruct - explicit param_type(RealType = 1.0, RealType = 1.0); + explicit param_type(RealType = 1.0, RealType = 1.0); - // public member functions - RealType a() const; - RealType b() const; + // public member functions + RealType a() const; + RealType b() const; - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); + operator<<(std::basic_ostream< CharT, Traits > &, const param_type &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, const param_type &); - friend bool operator==(const param_type &, const param_type &); - friend bool operator!=(const param_type &, const param_type &); + operator>>(std::basic_istream< CharT, Traits > &, const param_type &); + friend bool operator==(const param_type &, const param_type &); + friend bool operator!=(const param_type &, const param_type &); };
                                                                                                        -

                                                                                                        Description

                                                                                                        +

                                                                                                        Description

                                                                                                        -

                                                                                                        +

                                                                                                        param_type public construct/copy/destruct

                                                                                                        1. -
                                                                                                          explicit param_type(RealType a = 1.0, RealType b = 1.0);
                                                                                                          +
                                                                                                          explicit param_type(RealType a = 1.0, RealType b = 1.0);

                                                                                                          Constructs a param_type from the "a" and "b" parameters of the distribution.

                                                                                                          Requires: a > 0 && b > 0

                                                                                                        -

                                                                                                        -param_type public member functions

                                                                                                        +

                                                                                                        +param_type public member functions

                                                                                                        1. -
                                                                                                          RealType a() const;
                                                                                                          +
                                                                                                          RealType a() const;

                                                                                                          Returns the "a" parameter of the distribtuion.

                                                                                                        2. -
                                                                                                          RealType b() const;
                                                                                                          +
                                                                                                          RealType b() const;

                                                                                                          Returns the "b" parameter of the distribution.

                                                                                                        -

                                                                                                        -param_type friend functions

                                                                                                        +

                                                                                                        +param_type friend functions

                                                                                                        1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const param_type & param);

                                                                                                          Writes a param_type to a std::ostream. 

                                                                                                        2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
              const param_type & param);

                                                                                                          Reads a param_type from a std::istream.

                                                                                                        3. -
                                                                                                          friend bool operator==(const param_type & lhs, const param_type & rhs);
                                                                                                          +
                                                                                                          friend bool operator==(const param_type & lhs, const param_type & rhs);

                                                                                                          Returns true if the two sets of parameters are the same.

                                                                                                        4. -
                                                                                                          friend bool operator!=(const param_type & lhs, const param_type & rhs);
                                                                                                          +
                                                                                                          friend bool operator!=(const param_type & lhs, const param_type & rhs);

                                                                                                          Returns true if the two sets of parameters are the different.

                                                                                                        @@ -123,7 +123,7 @@
                                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                                        diff --git a/doc/html/boost/random/xor_combine_engine.html b/doc/html/boost/random/xor_combine_engine.html index 8fa7d7893b..1ebe51e332 100644 --- a/doc/html/boost/random/xor_combine_engine.html +++ b/doc/html/boost/random/xor_combine_engine.html @@ -41,39 +41,39 @@ typedef base1_type::result_type result_type; // construct/copy/destruct - xor_combine_engine(); - xor_combine_engine(const base1_type &, const base2_type &); - explicit xor_combine_engine(result_type); - template<typename SeedSeq> explicit xor_combine_engine(SeedSeq &); - template<typename It> xor_combine_engine(It &, It); + xor_combine_engine(); + xor_combine_engine(const base1_type &, const base2_type &); + explicit xor_combine_engine(result_type); + template<typename SeedSeq> explicit xor_combine_engine(SeedSeq &); + template<typename It> xor_combine_engine(It &, It); - // public member functions - void seed(); - void seed(result_type); - template<typename SeedSeq> void seed(SeedSeq &); - template<typename It> void seed(It &, It); - const base1_type & base1() const; - const base2_type & base2() const; - result_type operator()(); - template<typename Iter> void generate(Iter, Iter); - void discard(boost::uintmax_t); + // public member functions + void seed(); + void seed(result_type); + template<typename SeedSeq> void seed(SeedSeq &); + template<typename It> void seed(It &, It); + const base1_type & base1() const; + const base2_type & base2() const; + result_type operator()(); + template<typename Iter> void generate(Iter, Iter); + void discard(boost::uintmax_t); - // public static functions - static result_type min(); - static result_type max(); + // public static functions + static result_type min(); + static result_type max(); - // friend functions + // friend functions template<typename CharT, typename Traits> friend std::basic_ostream< CharT, Traits > & - operator<<(std::basic_ostream< CharT, Traits > &, + operator<<(std::basic_ostream< CharT, Traits > &, const xor_combine_engine &); template<typename CharT, typename Traits> friend std::basic_istream< CharT, Traits > & - operator>>(std::basic_istream< CharT, Traits > &, + operator>>(std::basic_istream< CharT, Traits > &, const xor_combine_engine &); - friend bool operator==(const xor_combine_engine &, + friend bool operator==(const xor_combine_engine &, const xor_combine_engine &); - friend bool operator!=(const xor_combine_engine &, + friend bool operator!=(const xor_combine_engine &, const xor_combine_engine &); // public data members @@ -82,24 +82,24 @@ static const int shift2; };
                                                                                                        -

                                                                                                        Description

                                                                                                        +

                                                                                                        Description

                                                                                                        Instantiations of xor_combine_engine model a pseudo-random number generator . To produce its output it invokes each of the base generators, shifts their results and xors them together.

                                                                                                        -

                                                                                                        +

                                                                                                        xor_combine_engine public construct/copy/destruct

                                                                                                        1. -
                                                                                                          xor_combine_engine();
                                                                                                          +
                                                                                                          xor_combine_engine();

                                                                                                          Constructors a xor_combine_engine by default constructing both base generators.

                                                                                                        2. -
                                                                                                          xor_combine_engine(const base1_type & rng1, const base2_type & rng2);
                                                                                                          +
                                                                                                          xor_combine_engine(const base1_type & rng1, const base2_type & rng2);

                                                                                                          Constructs a xor_combine by copying two base generators.

                                                                                                        3. -
                                                                                                          explicit xor_combine_engine(result_type v);
                                                                                                          +
                                                                                                          explicit xor_combine_engine(result_type v);

                                                                                                          Constructs a xor_combine_engine, seeding both base generators with v.

                                                                                                          @@ -112,96 +112,96 @@

                                                                                                        4. -
                                                                                                          template<typename SeedSeq> explicit xor_combine_engine(SeedSeq & seq);
                                                                                                          +
                                                                                                          template<typename SeedSeq> explicit xor_combine_engine(SeedSeq & seq);

                                                                                                          Constructs a xor_combine_engine, seeding both base generators with values produced by seq.

                                                                                                        5. -
                                                                                                          template<typename It> xor_combine_engine(It & first, It last);
                                                                                                          +
                                                                                                          template<typename It> xor_combine_engine(It & first, It last);

                                                                                                          Constructs a xor_combine_engine, seeding both base generators with values from the iterator range [first, last) and changes first to point to the element after the last one used. If there are not enough elements in the range to seed both generators, throws std::invalid_argument.

                                                                                                          6. -

                                                                                                          -xor_combine_engine public member functions

                                                                                                          +

                                                                                                          +xor_combine_engine public member functions

                                                                                                          1. -
                                                                                                            void seed();
                                                                                                            +
                                                                                                            void seed();

                                                                                                            Calls seed() for both base generators.

                                                                                                          2. -
                                                                                                            void seed(result_type v);
                                                                                                            +
                                                                                                            void seed(result_type v);

                                                                                                            seeds both base generators with v.

                                                                                                          3. -
                                                                                                            template<typename SeedSeq> void seed(SeedSeq & seq);
                                                                                                            +
                                                                                                            template<typename SeedSeq> void seed(SeedSeq & seq);

                                                                                                            seeds both base generators with values produced by seq.

                                                                                                          4. -
                                                                                                            template<typename It> void seed(It & first, It last);
                                                                                                            +
                                                                                                            template<typename It> void seed(It & first, It last);

                                                                                                            seeds both base generators with values from the iterator range [first, last) and changes first to point to the element after the last one used. If there are not enough elements in the range to seed both generators, throws std::invalid_argument.

                                                                                                          5. -
                                                                                                            const base1_type & base1() const;
                                                                                                            +
                                                                                                            const base1_type & base1() const;

                                                                                                            Returns the first base generator.

                                                                                                          6. -
                                                                                                            const base2_type & base2() const;
                                                                                                            +
                                                                                                            const base2_type & base2() const;

                                                                                                            Returns the second base generator.

                                                                                                          7. -
                                                                                                            result_type operator()();
                                                                                                            +
                                                                                                            result_type operator()();

                                                                                                            Returns the next value of the generator.

                                                                                                          8. -
                                                                                                            template<typename Iter> void generate(Iter first, Iter last);
                                                                                                            +
                                                                                                            template<typename Iter> void generate(Iter first, Iter last);

                                                                                                            Fills a range with random values

                                                                                                          9. -
                                                                                                            void discard(boost::uintmax_t z);
                                                                                                            +
                                                                                                            void discard(boost::uintmax_t z);

                                                                                                            Advances the state of the generator by z.

                                                                                                          -

                                                                                                          -xor_combine_engine public static functions

                                                                                                          +

                                                                                                          +xor_combine_engine public static functions

                                                                                                          1. -
                                                                                                            static result_type min();
                                                                                                            +
                                                                                                            static result_type min();

                                                                                                            Returns the smallest value that the generator can produce.

                                                                                                          2. -
                                                                                                            static result_type max();
                                                                                                            +
                                                                                                            static result_type max();

                                                                                                            Returns the largest value that the generator can produce.

                                                                                                          -

                                                                                                          -xor_combine_engine friend functions

                                                                                                          +

                                                                                                          +xor_combine_engine friend functions

                                                                                                          1. template<typename CharT, typename Traits> 
   friend std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & os, 
+  operator<<(std::basic_ostream< CharT, Traits > & os, 
              const xor_combine_engine & s);

                                                                                                            Writes the textual representation of the generator to a std::ostream. 

                                                                                                          2. template<typename CharT, typename Traits> 
   friend std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & is, 
+  operator>>(std::basic_istream< CharT, Traits > & is, 
              const xor_combine_engine & s);

                                                                                                            Reads the textual representation of the generator from a std::istream.

                                                                                                          3. -
                                                                                                            friend bool operator==(const xor_combine_engine & x, 
+
                                                                                                            friend bool operator==(const xor_combine_engine & x, 
                        const xor_combine_engine & y);
                                                                                                            
 
                                                                                                            Returns true if the two generators will produce identical sequences.
                                                                                                          4. -
                                                                                                            friend bool operator!=(const xor_combine_engine & lhs, 
+
                                                                                                            friend bool operator!=(const xor_combine_engine & lhs, 
                        const xor_combine_engine & rhs);
                                                                                                            
 
                                                                                                            Returns true if the two generators will produce different sequences.
                                                                                                            5. diff --git a/doc/html/boost/recursive_wrapper.html b/doc/html/boost/recursive_wrapper.html index 2a641a97b3..d355e9cd04 100644 --- a/doc/html/boost/recursive_wrapper.html +++ b/doc/html/boost/recursive_wrapper.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                                                                                                          -PrevUpHomeNext +PrevUpHomeNext
                                                                                                          @@ -39,24 +39,24 @@ typedef T type; // construct/copy/destruct - recursive_wrapper(); - recursive_wrapper(const recursive_wrapper &); - recursive_wrapper(const T &); - ~recursive_wrapper(); + recursive_wrapper(); + recursive_wrapper(const recursive_wrapper &); + recursive_wrapper(const T &); + ~recursive_wrapper(); - // modifiers - void swap(recursive_wrapper &); - recursive_wrapper & operator=(const recursive_wrapper &); - recursive_wrapper & operator=(const T &); + // modifiers + void swap(recursive_wrapper &); + recursive_wrapper & operator=(const recursive_wrapper &); + recursive_wrapper & operator=(const T &); - // queries - T & get(); - const T & get() const; - T * get_pointer(); - const T * get_pointer() const; + // queries + T & get(); + const T & get() const; + T * get_pointer(); + const T * get_pointer() const; };
                                                                                                          -

                                                                                                          Description

                                                                                                          +

                                                                                                          Description

                                                                                                          The recursive_wrapper class template has an interface similar to a simple value container, but its content is allocated dynamically. This allows recursive_wrapper to @@ -73,13 +73,13 @@ operator new. Thus, for instance, references are not supported.

                                                                                                        -

                                                                                                        +

                                                                                                        recursive_wrapper public construct/copy/destruct

                                                                                                        1. -
                                                                                                          recursive_wrapper();
                                                                                                          Default constructor.

                                                                                                          Initializes *this by default construction of +

                                                                                                          recursive_wrapper();
                                                                                                          Default constructor.

                                                                                                          Initializes *this by default construction of T.

                                                                                                          @@ -104,7 +104,7 @@
                                                                                                        2. -
                                                                                                          recursive_wrapper(const recursive_wrapper & other);
                                                                                                          Copy constructor.

                                                                                                          Copies the content of other into +

                                                                                                          recursive_wrapper(const recursive_wrapper & other);
                                                                                                          Copy constructor.

                                                                                                          Copies the content of other into *this.

                                                                                                          @@ -120,7 +120,7 @@
                                                                                                        3. -
                                                                                                          recursive_wrapper(const T & operand);
                                                                                                          Value constructor.

                                                                                                          Copies operand into +

                                                                                                          recursive_wrapper(const T & operand);
                                                                                                          Value constructor.

                                                                                                          Copies operand into *this.

                                                                                                          @@ -136,7 +136,7 @@
                                                                                                        4. -
                                                                                                          ~recursive_wrapper();
                                                                                                          Destructor.

                                                                                                          Deletes the content of *this.

                                                                                                          +
                                                                                                          ~recursive_wrapper();
                                                                                                          Destructor.

                                                                                                          Deletes the content of *this.

                                                                                                          @@ -151,11 +151,11 @@
                                                                                                          -

                                                                                                          -recursive_wrapper modifiers

                                                                                                          +

                                                                                                          +recursive_wrapper modifiers

                                                                                                          1. -
                                                                                                            void swap(recursive_wrapper & other);
                                                                                                            +
                                                                                                            void swap(recursive_wrapper & other);

                                                                                                            Exchanges contents of *this and other.

                                                                                                          @@ -170,7 +170,7 @@
                                                                                                        5. -
                                                                                                          recursive_wrapper & operator=(const recursive_wrapper & rhs);
                                                                                                          Copy assignment operator.

                                                                                                          Assigns the content of rhs to the content of +

                                                                                                          recursive_wrapper & operator=(const recursive_wrapper & rhs);
                                                                                                          Copy assignment operator.

                                                                                                          Assigns the content of rhs to the content of *this.

                                                                                                          @@ -194,7 +194,7 @@
                                                                                                        6. -
                                                                                                          recursive_wrapper & operator=(const T & rhs);
                                                                                                          Value assignment operator.

                                                                                                          Assigns rhs into the content of +

                                                                                                          recursive_wrapper & operator=(const T & rhs);
                                                                                                          Value assignment operator.

                                                                                                          Assigns rhs into the content of *this.

                                                                                                          @@ -220,12 +220,12 @@
                                                                                                          -

                                                                                                          -recursive_wrapper queries

                                                                                                          +

                                                                                                          +recursive_wrapper queries

                                                                                                          1. -
                                                                                                            T & get();
-const T & get() const;
                                                                                                            +
                                                                                                            T & get();
+const T & get() const;

                                                                                                            Returns a reference to the content of *this.

                                                                                                          @@ -240,8 +240,8 @@
                                                                                                        7. -
                                                                                                          T * get_pointer();
-const T * get_pointer() const;
                                                                                                          +
                                                                                                          T * get_pointer();
+const T * get_pointer() const;

                                                                                                          Returns a pointer to the content of *this.

                                                                                                          @@ -269,7 +269,7 @@
                                                                                                          -PrevUpHomeNext +PrevUpHomeNext
                                                                                                          diff --git a/doc/html/boost/relaxed_get.html b/doc/html/boost/relaxed_get.html index 6fdd464c5b..9431214092 100644 --- a/doc/html/boost/relaxed_get.html +++ b/doc/html/boost/relaxed_get.html @@ -44,14 +44,14 @@ template<typename U, typename T1, typename T2, ..., typename TN> const U & relaxed_get(const variant<T1, T2, ..., TN> & operand);
                                                                                                          -

                                                                                                          Description

                                                                                                          +

                                                                                                          Description

                                                                                                          The get function allows run-time checked, type-safe retrieval of the content of the given variant. The function succeeds only if the content is of the specified type U, with failure indicated as described below.

                                                                                                          Recomendation: Use - get or strict_get in new code. + get or strict_get in new code. strict_get provides more compile time checks and it's behavior is closer to std::get from C++ Standard Library.

                                                                                                          diff --git a/doc/html/boost/signal.html b/doc/html/boost/signal.html index 3371cc4176..f3b5bfaab1 100644 --- a/doc/html/boost/signal.html +++ b/doc/html/boost/signal.html @@ -39,11 +39,11 @@ { public: // construct/copy/destruct - signal(const combiner_type& = combiner_type(), + signal(const combiner_type& = combiner_type(), const group_compare_type& = group_compare_type()); };
                                                                                                          -

                                                                                                          Description

                                                                                                          +

                                                                                                          Description

                                                                                                          Class template signal is a thin wrapper around the numbered class templates signal0, signal1, etc. It accepts a function type with N arguments instead of N separate arguments, and @@ -52,7 +52,7 @@

                                                                                                          All functionality of this class template is in its base class signalN.

                                                                                                          -

                                                                                                          Template Parameters

                                                                                                          +

                                                                                                          Template Parameters

                                                                                                          1. typename Signature
                                                                                                            @@ -65,12 +65,12 @@
                                                                                                          -

                                                                                                          +

                                                                                                          signal public construct/copy/destruct

                                                                                                          1. -
                                                                                                            signal(const combiner_type& combiner = combiner_type(), 
+
                                                                                                            signal(const combiner_type& combiner = combiner_type(), 
        const group_compare_type& compare = group_compare_type());
                                                                                                            
 
                                                                                                            diff --git a/doc/html/boost/signalN.html b/doc/html/boost/signalN.html
index e6a72a6e14..191f8c2e2a 100644
--- a/doc/html/boost/signalN.html
+++ b/doc/html/boost/signalN.html
@@ -63,32 +63,32 @@
   staticconstintarity = N;// construct/copy/destruct
-  signalN(constcombiner_type&=combiner_type(), 
+  signalN(constcombiner_type&=combiner_type(),constgroup_compare_type&=group_compare_type());
-  ~signalN();
+  ~signalN();
 
-  // connection management
+  // connection managementsignals::connection 
-  connect(constslot_type&,signals::connect_position=signals::at_back);
+  connect(constslot_type&,signals::connect_position=signals::at_back);signals::connection 
-  connect(constgroup_type&,constslot_type&, 
+  connect(constgroup_type&,constslot_type&,signals::connect_position=signals::at_back);
-  voiddisconnect(constgroup_type&);
-  template<typename Slot>voiddisconnect(constSlot&);
-  voiddisconnect_all_slots();
-  boolempty()const;
-  std::size_tnum_slots()const;
+  voiddisconnect(constgroup_type&);
+  template<typename Slot>voiddisconnect(constSlot&);
+  voiddisconnect_all_slots();
+  boolempty()const;
+  std::size_tnum_slots()const;
 
-  // invocation
-  result_typeoperator()(arg1_type,arg2_type,...,argN_type);
-  result_typeoperator()(arg1_type,arg2_type,...,argN_type)const;
+  // invocation
+  result_typeoperator()(arg1_type,arg2_type,...,argN_type);
+  result_typeoperator()(arg1_type,arg2_type,...,argN_type)const;
 
-  // combiner access
-  combiner_type&combiner();
-  constcombiner_type&combiner()const;
+  // combiner access
+  combiner_type&combiner();
+  constcombiner_type&combiner()const;};
                                                                                                            
-
                                                                                                            Description
                                                                                                            
+
                                                                                                            Description
                                                                                                            
 
                                                                                                            The class template signalN covers
          several related classes signal0, signal1, signal2, etc.,
          where the number suffix describes the number of function
@@ -97,13 +97,13 @@
          signalN will be described, where N
          represents the number of function parameters.
                                                                                                            
 
                                                                                                            
-
                                                                                                            
+
                                                                                                            
 signalN 
         public
        construct/copy/destruct
                                                                                                            
 
                                                                                                              
 
                                                                                                            1. 
-
                                                                                                              signalN(const combiner_type& combiner = combiner_type(), 
+
                                                                                                              signalN(const combiner_type& combiner = combiner_type(), 
         const group_compare_type& compare = group_compare_type());
                                                                                                              
 
                                                                                                            
 
   
 
          
              
           
          
                                                           
 
 
                                                                                                            @@ -117,13 +117,13 @@
 
-
+
                                                                                                            
 

 
                                                                                                            
 
                                                                                                            Postconditions:
                                                                                                            		this->empty()this->empty()
                                                                                                          2. -
                                                                                                            ~signalN();
                                                                                                            +
                                                                                                            ~signalN();
                                                                                                            @@ -138,15 +138,15 @@
                                                                                                            -

                                                                                                            -signalN connection management

                                                                                                            +

                                                                                                            +signalN connection management

                                                                                                            1. -
                                                                                                              signals::connection 
-connect(const slot_type& slot, 
+
                                                                                                              signals::connection 
+connect(const slot_type& slot, 
         signals::connect_position at = signals::at_back);
 signals::connection 
-connect(const group_type& group, const slot_type& slot, 
+connect(const group_type& group, const slot_type& slot, 
         signals::connect_position at = signals::at_back);
                                                                                                            @@ -200,8 +200,8 @@
                                                                                                          3. -
                                                                                                            void disconnect(const group_type& group);
-template<typename Slot> void disconnect(const Slot& slot);
                                                                                                            +
                                                                                                            void disconnect(const group_type& group);
+template<typename Slot> void disconnect(const Slot& slot);
                                                                                                            @@ -233,7 +233,7 @@
                                                                                                          4. -
                                                                                                            void disconnect_all_slots();
                                                                                                            +
                                                                                                            void disconnect_all_slots();
                                                                                                            @@ -247,7 +247,7 @@ +this->empty(). @@ -268,7 +268,7 @@

                                                                                                            Postconditions:

                                                                                                            		 -this->empty().

                                                                                                            Throws:

                                                                                                          5. -
                                                                                                            bool empty() const;
                                                                                                            +
                                                                                                            bool empty() const;
                                                                                                            @@ -303,7 +303,7 @@
                                                                                                          6. -
                                                                                                            std::size_t num_slots() const;
                                                                                                            +
                                                                                                            std::size_t num_slots() const;
                                                                                                            @@ -337,11 +337,11 @@
                                                                                                            -

                                                                                                            -signalN invocation

                                                                                                            +

                                                                                                            +signalN invocation

                                                                                                            1. -
                                                                                                              result_type operator()(arg1_type a1, arg2_type a2, ..., argN_type aN);
-result_type operator()(arg1_type a1, arg2_type a2, ..., argN_type aN) const;
                                                                                                              +
                                                                                                              result_type operator()(arg1_type a1, arg2_type a2, ..., argN_type aN);
+result_type operator()(arg1_type a1, arg2_type a2, ..., argN_type aN) const;
                                                                                                            @@ -398,11 +398,11 @@
                                                                                                            -

                                                                                                            -signalN combiner access

                                                                                                            +

                                                                                                            +signalN combiner access

                                                                                                            1. -
                                                                                                              combiner_type& combiner();
-const combiner_type& combiner() const;
                                                                                                              +
                                                                                                              combiner_type& combiner();
+const combiner_type& combiner() const;
                                                                                                            diff --git a/doc/html/boost/signals/connection.html b/doc/html/boost/signals/connection.html index 119919ccae..25a7f2fb02 100644 --- a/doc/html/boost/signals/connection.html +++ b/doc/html/boost/signals/connection.html @@ -36,31 +36,31 @@ classconnection{public:// construct/copy/destruct - connection(); - connection(constconnection&); - connection& operator=(constconnection&); + connection(); + connection(constconnection&); + connection& operator=(constconnection&); - // connection management - voiddisconnect()const; - boolconnected()const; + // connection management + voiddisconnect()const; + boolconnected()const; - // blocking - voidblock(bool=true); - voidunblock(); - boolblocked()const; + // blocking + voidblock(bool=true); + voidunblock(); + boolblocked()const; - // modifiers - voidswap(constconnection&); + // modifiers + voidswap(constconnection&); - // comparisons - booloperator==(constconnection&)const; - booloperator<(constconnection&)const; + // comparisons + booloperator==(constconnection&)const; + booloperator<(constconnection&)const;}; -// specialized algorithms -voidswap(connection&,connection&); +// specialized algorithms +voidswap(connection&,connection&);
                                                                                                            -

                                                                                                            Description

                                                                                                            +

                                                                                                            Description

                                                                                                            The connection class represents a connection between a Signal and a Slot. It is a lightweight object that has the ability to query whether the @@ -68,13 +68,13 @@ the signal and slot. It is always safe to query or disconnect a connection.

                                                                                                            -

                                                                                                            +

                                                                                                            connection public construct/copy/destruct

                                                                                                            1. -
                                                                                                              connection();
                                                                                                              +
                                                                                                              connection();
                                                                                                            @@ -88,7 +88,7 @@ - + @@ -98,7 +98,7 @@

                                                                                                            Postconditions:

                                                                                                            !this->connected().

                                                                                                            !this->connected().

                                                                                                            Throws:

                                                                                                          7. -
                                                                                                            connection(const connection& other);
                                                                                                            +
                                                                                                            connection(const connection& other);
                                                                                                            @@ -119,7 +119,7 @@
                                                                                                          8. -
                                                                                                            connection& operator=(const connection& other);
                                                                                                            +
                                                                                                            connection& operator=(const connection& other);
                                                                                                            @@ -142,11 +142,11 @@
                                                                                                            -

                                                                                                            -connection connection management

                                                                                                            +

                                                                                                            +connection connection management

                                                                                                            1. -
                                                                                                              void disconnect() const;
                                                                                                              +
                                                                                                              void disconnect() const;
                                                                                                            @@ -156,19 +156,19 @@ - +

                                                                                                            Effects:

                                                                                                            If - this->connected(), + this->connected(), disconnects the signal and slot referenced by this; otherwise, this operation is a no-op.

                                                                                                            Postconditions:

                                                                                                            !this->connected().

                                                                                                            !this->connected().
                                                                                                          9. -
                                                                                                            bool connected() const;
                                                                                                            +
                                                                                                            bool connected() const;
                                                                                                            @@ -192,11 +192,11 @@
                                                                                                            -

                                                                                                            -connection blocking

                                                                                                            +

                                                                                                            +connection blocking

                                                                                                            1. -
                                                                                                              void block(bool should_block = true);
                                                                                                              +
                                                                                                              void block(bool should_block = true);
                                                                                                            @@ -219,7 +219,7 @@
                                                                                                          10. -
                                                                                                            void unblock();
                                                                                                            +
                                                                                                            void unblock();
                                                                                                            @@ -242,7 +242,7 @@
                                                                                                          11. -
                                                                                                            bool blocked() const;
                                                                                                            +
                                                                                                            bool blocked() const;
                                                                                                            @@ -264,10 +264,10 @@
                                                                                                            -

                                                                                                            -connection modifiers

                                                                                                            +

                                                                                                            +connection modifiers

                                                                                                            1. -
                                                                                                              void swap(const connection& other);
                                                                                                              +
                                                                                                              void swap(const connection& other);
                                                                                                            @@ -289,11 +289,11 @@
                                                                                                            -

                                                                                                            -connection comparisons

                                                                                                            +

                                                                                                            +connection comparisons

                                                                                                            1. -
                                                                                                              bool operator==(const connection& other) const;
                                                                                                              +
                                                                                                              bool operator==(const connection& other) const;
                                                                                                            @@ -317,7 +317,7 @@
                                                                                                          12. -
                                                                                                            bool operator<(const connection& other) const;
                                                                                                            +
                                                                                                            bool operator<(const connection& other) const;
                                                                                                            @@ -345,10 +345,10 @@
                                                                                                            -

                                                                                                            -connection specialized algorithms

                                                                                                            +

                                                                                                            +connection specialized algorithms

                                                                                                            1. -
                                                                                                              void swap(connection& x, connection& y);
                                                                                                              +
                                                                                                              void swap(connection& x, connection& y);
                                                                                                            diff --git a/doc/html/boost/signals/scoped_connection.html b/doc/html/boost/signals/scoped_connection.html index c44ffd399a..f312eead92 100644 --- a/doc/html/boost/signals/scoped_connection.html +++ b/doc/html/boost/signals/scoped_connection.html @@ -37,23 +37,23 @@ {public:// construct/copy/destruct - scoped_connection(constconnection&); - ~scoped_connection(); + scoped_connection(constconnection&); + ~scoped_connection(); - // connection management - voiddisconnect()const; - boolconnected()const; + // connection management + voiddisconnect()const; + boolconnected()const;};
                                                                                                            -

                                                                                                            Description

                                                                                                            +

                                                                                                            Description

                                                                                                            -

                                                                                                            +

                                                                                                            scoped_connection public construct/copy/destruct

                                                                                                            1. -
                                                                                                              scoped_connection(const connection& other);
                                                                                                              +
                                                                                                              scoped_connection(const connection& other);
                                                                                                            @@ -74,7 +74,7 @@
                                                                                                          13. -
                                                                                                            ~scoped_connection();
                                                                                                            +
                                                                                                            ~scoped_connection();
                                                                                                            @@ -83,7 +83,7 @@

                                                                                                            Effects:

                                                                                                            If - this->connected(), + this->connected(), disconnects the signal-slot connection.
                                                                                                            @@ -91,11 +91,11 @@
                                                                                                          -

                                                                                                          -scoped_connection connection management

                                                                                                          +

                                                                                                          +scoped_connection connection management

                                                                                                          1. -
                                                                                                            void disconnect() const;
                                                                                                            +
                                                                                                            void disconnect() const;
                                                                                                            @@ -105,19 +105,19 @@ - +

                                                                                                            Effects:

                                                                                                            If - this->connected(), + this->connected(), disconnects the signal and slot referenced by this; otherwise, this operation is a no-op.

                                                                                                            Postconditions:

                                                                                                            !this->connected().

                                                                                                            !this->connected().
                                                                                                          2. -
                                                                                                            bool connected() const;
                                                                                                            +
                                                                                                            bool connected() const;
                                                                                                            diff --git a/doc/html/boost/signals/trackable.html b/doc/html/boost/signals/trackable.html index e7700e260d..d3e4ec6d6e 100644 --- a/doc/html/boost/signals/trackable.html +++ b/doc/html/boost/signals/trackable.html @@ -36,13 +36,13 @@ classtrackable{public:// construct/copy/destruct - trackable(); - trackable(consttrackable&); - trackable& operator=(consttrackable&); - ~trackable(); + trackable(); + trackable(consttrackable&); + trackable& operator=(consttrackable&); + ~trackable();};
                                                                                                            -

                                                                                                            Description

                                                                                                            +

                                                                                                            Description

                                                                                                            The trackable class provides automatic disconnection of signals and slots when objects bound in slots (via pointer or reference) are destroyed. The @@ -58,13 +58,13 @@ type that may contain pointers or references to trackable objects.

                                                                                                            -

                                                                                                            +

                                                                                                            trackable public construct/copy/destruct

                                                                                                            1. -
                                                                                                              trackable();
                                                                                                              +
                                                                                                              trackable();
                                                                                                            @@ -83,7 +83,7 @@
                                                                                                          3. -
                                                                                                            trackable(const trackable& other);
                                                                                                            +
                                                                                                            trackable(const trackable& other);
                                                                                                            @@ -106,7 +106,7 @@
                                                                                                          4. -
                                                                                                            trackable& operator=(const trackable& other);
                                                                                                            +
                                                                                                            trackable& operator=(const trackable& other);
                                                                                                            @@ -133,7 +133,7 @@
                                                                                                          5. -
                                                                                                            ~trackable();
                                                                                                            +
                                                                                                            ~trackable();
                                                                                                            diff --git a/doc/html/boost/signals2/connection.html b/doc/html/boost/signals2/connection.html index 4f01512050..6aa0b5651d 100644 --- a/doc/html/boost/signals2/connection.html +++ b/doc/html/boost/signals2/connection.html @@ -36,32 +36,32 @@ classconnection{public:// construct/copy/destruct - connection(); - connection(constconnection&); - connection(connection&&); - connection& operator=(constconnection&); - connection& operator=(connection&&); + connection(); + connection(constconnection&); + connection(connection&&); + connection& operator=(constconnection&); + connection& operator=(connection&&); - // connection management - voiddisconnect()const; - boolconnected()const; + // connection management + voiddisconnect()const; + boolconnected()const; - // blocking - boolblocked()const; + // blocking + boolblocked()const; - // modifiers - voidswap(connection&); + // modifiers + voidswap(connection&); - // comparisons - booloperator==(constconnection&)const; - booloperator!=(constconnection&)const; - booloperator<(constconnection&)const; + // comparisons + booloperator==(constconnection&)const; + booloperator!=(constconnection&)const; + booloperator<(constconnection&)const;}; -// specialized algorithms -voidswap(connection&,connection&); +// specialized algorithms +voidswap(connection&,connection&);
                                                                                                            -

                                                                                                            Description

                                                                                                            +

                                                                                                            Description

                                                                                                            The signals2::connection class represents a connection between a Signal and a Slot. It is a lightweight object that has the ability to query whether the @@ -70,9 +70,9 @@ disconnect a connection.

                                                                                                            -Thread Safety
                                                                                                            +Thread Safety

                                                                                                            The methods of the connection class are thread-safe with the exception - of swap and the assignment operator. A connection object + of swap and the assignment operator. A connection object should not be accessed concurrently when either of these operations is in progress. However, it is always safe to access a different connection object in another thread, even if the two connection objects are copies @@ -80,13 +80,13 @@

                                                                                                            -

                                                                                                            +

                                                                                                            connection public construct/copy/destruct

                                                                                                            1. -
                                                                                                              connection();
                                                                                                              +
                                                                                                              connection();
                                                                                                            @@ -100,7 +100,7 @@ - + @@ -110,7 +110,7 @@

                                                                                                            Postconditions:

                                                                                                            !this->connected().

                                                                                                            !this->connected().

                                                                                                            Throws:

                                                                                                          6. -
                                                                                                            connection(const connection& other);
                                                                                                            +
                                                                                                            connection(const connection& other);
                                                                                                            @@ -131,7 +131,7 @@
                                                                                                          7. -
                                                                                                            connection(connection&& other);
                                                                                                            +
                                                                                                            connection(connection&& other);

                                                                                                            Move constructor.

                                                                                                            @@ -154,7 +154,7 @@
                                                                                                          8. -
                                                                                                            connection& operator=(const connection& rhs);
                                                                                                            +
                                                                                                            connection& operator=(const connection& rhs);
                                                                                                            @@ -175,7 +175,7 @@
                                                                                                          9. -
                                                                                                            connection& operator=(connection&& rhs);
                                                                                                            +
                                                                                                            connection& operator=(connection&& rhs);

                                                                                                            Move assignment.

                                                                                                            @@ -200,11 +200,11 @@
                                                                                                            -

                                                                                                            -connection connection management

                                                                                                            +

                                                                                                            +connection connection management

                                                                                                            1. -
                                                                                                              void disconnect() const;
                                                                                                              +
                                                                                                              void disconnect() const;
                                                                                                            @@ -214,19 +214,19 @@ - +

                                                                                                            Effects:

                                                                                                            If - this->connected(), + this->connected(), disconnects the signal and slot referenced by this; otherwise, this operation is a no-op.

                                                                                                            Postconditions:

                                                                                                            !this->connected().

                                                                                                            !this->connected().
                                                                                                          10. -
                                                                                                            bool connected() const;
                                                                                                            +
                                                                                                            bool connected() const;
                                                                                                            @@ -250,10 +250,10 @@
                                                                                                            -

                                                                                                            -connection blocking

                                                                                                            +

                                                                                                            +connection blocking

                                                                                                            1. -
                                                                                                              bool blocked() const;
                                                                                                              +
                                                                                                              bool blocked() const;

                                                                                                              Queries if the connection is blocked. A connection may be blocked by creating a boost::signals2::shared_connection_block object. @@ -277,10 +277,10 @@

                                                                                                            -

                                                                                                            -connection modifiers

                                                                                                            +

                                                                                                            +connection modifiers

                                                                                                            1. -
                                                                                                              void swap(connection& other);
                                                                                                              +
                                                                                                              void swap(connection& other);
                                                                                                            @@ -302,11 +302,11 @@
                                                                                                            -

                                                                                                            -connection comparisons

                                                                                                            +

                                                                                                            +connection comparisons

                                                                                                            1. -
                                                                                                              bool operator==(const connection& other) const;
                                                                                                              +
                                                                                                              bool operator==(const connection& other) const;
                                                                                                            @@ -330,7 +330,7 @@
                                                                                                          11. -
                                                                                                            bool operator!=(const connection& other) const;
                                                                                                            +
                                                                                                            bool operator!=(const connection& other) const;
                                                                                                            @@ -349,7 +349,7 @@
                                                                                                          12. -
                                                                                                            bool operator<(const connection& other) const;
                                                                                                            +
                                                                                                            bool operator<(const connection& other) const;
                                                                                                            @@ -377,10 +377,10 @@
                                                                                                            -

                                                                                                            -connection specialized algorithms

                                                                                                            +

                                                                                                            +connection specialized algorithms

                                                                                                            1. -
                                                                                                              void swap(connection& x, connection& y);
                                                                                                              +
                                                                                                              void swap(connection& x, connection& y);
                                                                                                            diff --git a/doc/html/boost/signals2/deconstruct.html b/doc/html/boost/signals2/deconstruct.html index c9ebb92988..be4d5d514b 100644 --- a/doc/html/boost/signals2/deconstruct.html +++ b/doc/html/boost/signals2/deconstruct.html @@ -42,7 +42,7 @@ postconstructor_invoker<T>deconstruct(constA1& arg1,constA2& arg2,...,constAN& argN);
                                                                                                            -

                                                                                                            Description

                                                                                                            +

                                                                                                            Description

                                                                                                            Creates an object and its owning shared_ptr<T> (wrapped inside a postconstructor_invoker) using only a single allocation, @@ -85,7 +85,7 @@ template type T. Arguments may also be passed to the class' associated adl_postconstruct function by using the - postconstructor_invoker::postconstruct() methods. + postconstructor_invoker::postconstruct() methods.

                                                                                                            diff --git a/doc/html/boost/signals2/deconstruct_access.html b/doc/html/boost/signals2/deconstruct_access.html index aefa4fc2b1..2e7c782cd6 100644 --- a/doc/html/boost/signals2/deconstruct_access.html +++ b/doc/html/boost/signals2/deconstruct_access.html @@ -36,7 +36,7 @@ classdeconstruct_access{};
                                                                                                            -

                                                                                                            Description

                                                                                                            +

                                                                                                            Description

                                                                                                            Declaring deconstruct_access a friend to your class will give the deconstruct factory function access to your class' private and diff --git a/doc/html/boost/signals2/dummy_mutex.html b/doc/html/boost/signals2/dummy_mutex.html index cb75104e72..e43f74e63f 100644 --- a/doc/html/boost/signals2/dummy_mutex.html +++ b/doc/html/boost/signals2/dummy_mutex.html @@ -35,21 +35,21 @@ class dummy_mutex : public noncopyable { public: - void lock(); - bool try_lock(); - void unlock(); + void lock(); + bool try_lock(); + void unlock(); };

                                                                                                            -

                                                                                                            Description

                                                                                                            +

                                                                                                            Description

                                                                                                            You may wish to use the dummy_mutex class for the Mutex template type of your signals if you are not concerned about thread safety. This may give slightly faster performance, since dummy_mutex performs no actual locking.

                                                                                                            -
                                                                                                            void lock();
                                                                                                            +
                                                                                                            void lock();

                                                                                                            No effect.

                                                                                                            -
                                                                                                            bool try_lock();
                                                                                                            +
                                                                                                            bool try_lock();

                                                                                                            No effect.

                                                                                                            @@ -62,7 +62,7 @@

                                                                                                            true.
                                                                                                            -
                                                                                                            void unlock();
                                                                                                            +
                                                                                                            void unlock();

                                                                                                            No effect.

                                                                                                          diff --git a/doc/html/boost/signals2/expired_slot.html b/doc/html/boost/signals2/expired_slot.html index 87ad834cab..787382055e 100644 --- a/doc/html/boost/signals2/expired_slot.html +++ b/doc/html/boost/signals2/expired_slot.html @@ -35,12 +35,12 @@ class expired_slot : public bad_weak_ptr { public: - virtual const char * what() const; + virtual const char * what() const; };
                                                                                                          -

                                                                                                          Description

                                                                                                          The expired_slot exception is thrown to indicate at least one of +

                                                                                                          Description

                                                                                                          The expired_slot exception is thrown to indicate at least one of a slot's tracked objects has expired. - 
                                                                                                          virtual const char *  what() const;
                                                                                                          + 
                                                                                                          virtual const char *  what() const;
                                                                                                          diff --git a/doc/html/boost/signals2/keywords/combiner_type.html b/doc/html/boost/signals2/keywords/combiner_type.html index 1dc6c34819..e9e128d2a4 100644 --- a/doc/html/boost/signals2/keywords/combiner_type.html +++ b/doc/html/boost/signals2/keywords/combiner_type.html @@ -36,7 +36,7 @@ classcombiner_type:publicunspecified-type{};
                                                                                                          -

                                                                                                          Description

                                                                                                          +

                                                                                                          Description

                                                                                                          This class is a template keyword which may be used to pass the wrapped Combiner template type to the signal_type metafunction as a named parameter. diff --git a/doc/html/boost/signals2/keywords/extended_idm45506999542128.html b/doc/html/boost/signals2/keywords/extended_idm45506999542128.html new file mode 100644 index 0000000000..0e43d33fb9 --- /dev/null +++ b/doc/html/boost/signals2/keywords/extended_idm45506999542128.html @@ -0,0 +1,62 @@ + + + + +Class template extended_slot_function_type + + + + + + + + +

                                                                                                          + + + + + + +
                                                                                                          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                                          +
                                                                                                          +
                                                                                                          +PrevUpHomeNext +
                                                                                                          +
                                                                                                          +
                                                                                                          +
                                                                                                          +

                                                                                                          Class template extended_slot_function_type

                                                                                                          +

                                                                                                          boost::signals2::keywords::extended_slot_function_type — A template keyword for signal_type.

                                                                                                          +
                                                                                                          +

                                                                                                          Synopsis

                                                                                                          +
                                                                                                          // In header: <boost/signals2/signal_type.hpp>
+
+template<typename ExtendedSlotFunction> 
+class extended_slot_function_type : public unspecified-type {
+};
                                                                                                          +
                                                                                                          +

                                                                                                          Description

                                                                                                          +

                                                                                                          + This class is a template keyword which may be used to pass the wrapped ExtendedSlotFunction + template type to the signal_type metafunction as a named parameter. +

                                                                                                          +

                                                                                                          + The code for this class is generated by a calling a macro from the Boost.Parameter library: + BOOST_PARAMETER_TEMPLATE_KEYWORD(extended_slot_function_type) +

                                                                                                          +
                                                                                                          +
                                                                                                          + + + +
                                                                                                          Copyright © 2001-2004 Douglas Gregor
                                                                                                          Copyright © 2007-2009 Frank Mori Hess

                                                                                                          Distributed under the Boost + Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

                                                                                                          +
                                                                                                          +
                                                                                                          +
                                                                                                          +PrevUpHomeNext +
                                                                                                          + + diff --git a/doc/html/boost/signals2/keywords/extended_slot_idp156345840.html b/doc/html/boost/signals2/keywords/extended_slot_idp156345840.html deleted file mode 100644 index 5172090b0d..0000000000 --- a/doc/html/boost/signals2/keywords/extended_slot_idp156345840.html +++ /dev/null @@ -1,62 +0,0 @@ - - - - -Class template extended_slot_function_type - - - - - - - - - - - - - - - -
                                                                                                          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                                          -
                                                                                                          -
                                                                                                          -PrevUpHomeNext -
                                                                                                          -
                                                                                                          -
                                                                                                          -
                                                                                                          -

                                                                                                          Class template extended_slot_function_type

                                                                                                          -

                                                                                                          boost::signals2::keywords::extended_slot_function_type — A template keyword for signal_type.

                                                                                                          -
                                                                                                          -

                                                                                                          Synopsis

                                                                                                          -
                                                                                                          // In header: <boost/signals2/signal_type.hpp>
-
-template<typename ExtendedSlotFunction> 
-class extended_slot_function_type : public unspecified-type {
-};
                                                                                                          -
                                                                                                          -

                                                                                                          Description

                                                                                                          -

                                                                                                          - This class is a template keyword which may be used to pass the wrapped ExtendedSlotFunction - template type to the signal_type metafunction as a named parameter. -

                                                                                                          -

                                                                                                          - The code for this class is generated by a calling a macro from the Boost.Parameter library: - BOOST_PARAMETER_TEMPLATE_KEYWORD(extended_slot_function_type) -

                                                                                                          -
                                                                                                          -
                                                                                                          - - - -
                                                                                                          Copyright © 2001-2004 Douglas Gregor
                                                                                                          Copyright © 2007-2009 Frank Mori Hess

                                                                                                          Distributed under the Boost - Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

                                                                                                          -
                                                                                                          -
                                                                                                          -
                                                                                                          -PrevUpHomeNext -
                                                                                                          - - diff --git a/doc/html/boost/signals2/keywords/group_compare_type.html b/doc/html/boost/signals2/keywords/group_compare_type.html index 87ab73bcbd..9f2e4d764e 100644 --- a/doc/html/boost/signals2/keywords/group_compare_type.html +++ b/doc/html/boost/signals2/keywords/group_compare_type.html @@ -36,7 +36,7 @@ class group_compare_type : public unspecified-type { };
                                                                                                        -

                                                                                                        Description

                                                                                                        +

                                                                                                        Description

                                                                                                        This class is a template keyword which may be used to pass the wrapped GroupCompare template type to the signal_type metafunction as a named parameter. diff --git a/doc/html/boost/signals2/keywords/group_type.html b/doc/html/boost/signals2/keywords/group_type.html index 0410a62903..11ebd04316 100644 --- a/doc/html/boost/signals2/keywords/group_type.html +++ b/doc/html/boost/signals2/keywords/group_type.html @@ -36,7 +36,7 @@ class group_type : public unspecified-type { };

                                                                                                        -

                                                                                                        Description

                                                                                                        +

                                                                                                        Description

                                                                                                        This class is a template keyword which may be used to pass the wrapped Group template type to the signal_type metafunction as a named parameter. diff --git a/doc/html/boost/signals2/keywords/mutex_type.html b/doc/html/boost/signals2/keywords/mutex_type.html index 6c3b50fae1..30f7a8ccec 100644 --- a/doc/html/boost/signals2/keywords/mutex_type.html +++ b/doc/html/boost/signals2/keywords/mutex_type.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@

                                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                                        @@ -36,7 +36,7 @@ class mutex_type : public unspecified-type { };
                                                                                                        -

                                                                                                        Description

                                                                                                        +

                                                                                                        Description

                                                                                                        This class is a template keyword which may be used to pass the wrapped Mutex template type to the signal_type metafunction as a named parameter. @@ -56,7 +56,7 @@

                                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                                        diff --git a/doc/html/boost/signals2/keywords/signature_type.html b/doc/html/boost/signals2/keywords/signature_type.html index 71e4991be4..8b1215fcfa 100644 --- a/doc/html/boost/signals2/keywords/signature_type.html +++ b/doc/html/boost/signals2/keywords/signature_type.html @@ -36,7 +36,7 @@ class signature_type : public unspecified-type { };
                                                                                                        -

                                                                                                        Description

                                                                                                        +

                                                                                                        Description

                                                                                                        This class is a template keyword which may be used to pass the wrapped Signature template type to the signal_type metafunction as a named parameter. diff --git a/doc/html/boost/signals2/keywords/slot_function_type.html b/doc/html/boost/signals2/keywords/slot_function_type.html index 2aa62f037e..cda524e1ed 100644 --- a/doc/html/boost/signals2/keywords/slot_function_type.html +++ b/doc/html/boost/signals2/keywords/slot_function_type.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@

                                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                                        @@ -36,7 +36,7 @@ class slot_function_type : public unspecified-type { };
                                                                                                        -

                                                                                                        Description

                                                                                                        +

                                                                                                        Description

                                                                                                        This class is a template keyword which may be used to pass the wrapped SlotFunction template type to the signal_type metafunction as a named parameter. @@ -56,7 +56,7 @@

                                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                                        diff --git a/doc/html/boost/signals2/last_val_idm45507040057344.html b/doc/html/boost/signals2/last_val_idm45507040057344.html new file mode 100644 index 0000000000..a90e28a22e --- /dev/null +++ b/doc/html/boost/signals2/last_val_idm45507040057344.html @@ -0,0 +1,86 @@ + + + + +Class last_value<void> + + + + + + + + + + + + + + + +
                                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                                        +
                                                                                                        +
                                                                                                        +PrevUpHomeNext +
                                                                                                        +
                                                                                                        +
                                                                                                        +
                                                                                                        +

                                                                                                        Class last_value<void>

                                                                                                        +

                                                                                                        boost::signals2::last_value<void> — Evaluate an InputIterator sequence.

                                                                                                        +
                                                                                                        +

                                                                                                        Synopsis

                                                                                                        +
                                                                                                        // In header: <boost/signals2/last_value.hpp>
+
+
+class last_value<void> {
+public:
+  // types
+  typedef void result_type;
+
+  // invocation
+  template<typename InputIterator> 
+    result_type operator()(InputIterator, InputIterator) const;
+};
                                                                                                        +
                                                                                                        +

                                                                                                        Description

                                                                                                        +
                                                                                                        +

                                                                                                        +last_value invocation

                                                                                                        +
                                                                                                        1. +
                                                                                                          template<typename InputIterator> 
+  result_type operator()(InputIterator first, InputIterator last) const;
                                                                                                          +
                                                                                                          ++++ + + + + + + + + + + +

                                                                                                          Effects:

                                                                                                          Attempts to dereference every iterator in the sequence [first, last). +

                                                                                                          Throws:

                                                                                                          Unlike the non-void versions of last_value, the void specialization does not throw.

                                                                                                          +
                                                                                                        +
                                                                                                        +
                                                                                                        +
                                                                                                        + + + +
                                                                                                        Copyright © 2001-2004 Douglas Gregor
                                                                                                        Copyright © 2007-2009 Frank Mori Hess

                                                                                                        Distributed under the Boost + Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

                                                                                                        +
                                                                                                        +
                                                                                                        +
                                                                                                        +PrevUpHomeNext +
                                                                                                        + + diff --git a/doc/html/boost/signals2/last_value.html b/doc/html/boost/signals2/last_value.html index 848aa7b3aa..4901dccce8 100644 --- a/doc/html/boost/signals2/last_value.html +++ b/doc/html/boost/signals2/last_value.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
                                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                                        @@ -39,12 +39,12 @@ // types typedef T result_type; - // invocation + // invocation template<typename InputIterator> - result_type operator()(InputIterator, InputIterator) const; + result_type operator()(InputIterator, InputIterator) const; };
                                                                                                        -

                                                                                                        Description

                                                                                                        +

                                                                                                        Description

                                                                                                        The last_value class was the default Combiner template parameter type for signals in the original Signals library. @@ -52,11 +52,11 @@ does not throw.

                                                                                                        -

                                                                                                        -last_value invocation

                                                                                                        +

                                                                                                        +last_value invocation

                                                                                                        1. template<typename InputIterator> 
-  result_type operator()(InputIterator first, InputIterator last) const;
                                                                                                          + result_type operator()(InputIterator first, InputIterator last) const;
                                                                                                          @@ -82,8 +82,8 @@
                                                                                                          -

                                                                                                          Specializations

                                                                                                          -
                                                                                                          +

                                                                                                          Specializations

                                                                                                          +
                                                                                                          @@ -96,7 +96,7 @@
                                                                                                          -PrevUpHomeNext +PrevUpHomeNext
                                                                                                          diff --git a/doc/html/boost/signals2/last_value_vo_idp102752128.html b/doc/html/boost/signals2/last_value_vo_idp102752128.html deleted file mode 100644 index cd9a61e773..0000000000 --- a/doc/html/boost/signals2/last_value_vo_idp102752128.html +++ /dev/null @@ -1,86 +0,0 @@ - - - - -Class last_value<void> - - - - - - - - - - - - - - - -
                                                                                                          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                                          -
                                                                                                          -
                                                                                                          -PrevUpHomeNext -
                                                                                                          -
                                                                                                          -
                                                                                                          -
                                                                                                          -

                                                                                                          Class last_value<void>

                                                                                                          -

                                                                                                          boost::signals2::last_value<void> — Evaluate an InputIterator sequence.

                                                                                                          -
                                                                                                          -

                                                                                                          Synopsis

                                                                                                          -
                                                                                                          // In header: <boost/signals2/last_value.hpp>
-
-
-class last_value<void> {
-public:
-  // types
-  typedef void result_type;
-
-  // invocation
-  template<typename InputIterator> 
-    result_type operator()(InputIterator, InputIterator) const;
-};
                                                                                                          -
                                                                                                          -

                                                                                                          Description

                                                                                                          -
                                                                                                          -

                                                                                                          -last_value invocation

                                                                                                          -
                                                                                                          1. -
                                                                                                            template<typename InputIterator> 
-  result_type operator()(InputIterator first, InputIterator last) const;
                                                                                                            -
                                                                                                            ---- - - - - - - - - - - -

                                                                                                            Effects:

                                                                                                            Attempts to dereference every iterator in the sequence [first, last). -

                                                                                                            Throws:

                                                                                                            Unlike the non-void versions of last_value, the void specialization does not throw.

                                                                                                            -
                                                                                                          -
                                                                                                          -
                                                                                                          -
                                                                                                          - - - -
                                                                                                          Copyright © 2001-2004 Douglas Gregor
                                                                                                          Copyright © 2007-2009 Frank Mori Hess

                                                                                                          Distributed under the Boost - Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

                                                                                                          -
                                                                                                          -
                                                                                                          -
                                                                                                          -PrevUpHomeNext -
                                                                                                          - - diff --git a/doc/html/boost/signals2/mutex.html b/doc/html/boost/signals2/mutex.html index b437bcb361..a0dac6a9d1 100644 --- a/doc/html/boost/signals2/mutex.html +++ b/doc/html/boost/signals2/mutex.html @@ -35,12 +35,12 @@ class mutex { public: - void lock(); - bool try_lock(); - void unlock(); + void lock(); + bool try_lock(); + void unlock(); };
                                                                                                          -

                                                                                                          Description

                                                                                                          +

                                                                                                          Description

                                                                                                          The mutex class implements the Lockable concept of Boost.Thread, and is the default Mutex template parameter @@ -64,10 +64,10 @@ use the signals2::dummy_mutex class as the Mutex template type for your signal.

                                                                                                          -
                                                                                                          void lock();
                                                                                                          +
                                                                                                          void lock();

                                                                                                          Locks the mutex.

                                                                                                          -
                                                                                                          bool try_lock();
                                                                                                          +
                                                                                                          bool try_lock();

                                                                                                          Makes a non-blocking attempt to lock the mutex.

                                                                                                          @@ -80,7 +80,7 @@

                                                                                                          true on success.
                                                                                                          -
                                                                                                          void unlock();
                                                                                                          +
                                                                                                          void unlock();

                                                                                                          Unlocks the mutex.

                                                                                                          diff --git a/doc/html/boost/signals2/no_slots_error.html b/doc/html/boost/signals2/no_slots_error.html index ec0cdcf084..9a8ddd3234 100644 --- a/doc/html/boost/signals2/no_slots_error.html +++ b/doc/html/boost/signals2/no_slots_error.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                                                                                                          -PrevUpHomeNext +PrevUpHomeNext
                                                                                                          @@ -35,12 +35,12 @@ class no_slots_error : public std::exception { public: - virtual const char * what() const; + virtual const char * what() const; };
                                                                                                          -

                                                                                                          Description

                                                                                                          The no_slots_error exception may be thrown by signals2::last_value +

                                                                                                          Description

                                                                                                          The no_slots_error exception may be thrown by signals2::last_value when it is run but unable to obtain any results from its input iterators. - 
                                                                                                          virtual const char *  what() const;
                                                                                                          + 
                                                                                                          virtual const char *  what() const;
                                                                                                        @@ -52,7 +52,7 @@
                                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                                        diff --git a/doc/html/boost/signals2/optional_idm45507099693904.html b/doc/html/boost/signals2/optional_idm45507099693904.html new file mode 100644 index 0000000000..386c99c0ff --- /dev/null +++ b/doc/html/boost/signals2/optional_idm45507099693904.html @@ -0,0 +1,87 @@ + + + + +Class optional_last_value<void> + + + + + + + + + + + + + + + +
                                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                                        +
                                                                                                        +
                                                                                                        +PrevUpHomeNext +
                                                                                                        +
                                                                                                        +
                                                                                                        +
                                                                                                        +

                                                                                                        Class optional_last_value<void>

                                                                                                        +

                                                                                                        boost::signals2::optional_last_value<void> — Evaluate an InputIterator sequence.

                                                                                                        +
                                                                                                        +

                                                                                                        Synopsis

                                                                                                        +
                                                                                                        // In header: <boost/signals2/optional_last_value.hpp>
+
+
+class optional_last_value<void> {
+public:
+  // types
+  typedef void result_type;
+
+  // invocation
+  template<typename InputIterator> 
+    result_type operator()(InputIterator, InputIterator) const;
+};
                                                                                                        +
                                                                                                        +

                                                                                                        Description

                                                                                                        +

                                                                                                        This specialization of signals2::optional_last_value is provided + to cope with the fact that there is no such thing as an + optional<void>, which + optional_last_value would otherwise try to + use as its result_type. This specialization + instead sets the result_type to be void. +

                                                                                                        +
                                                                                                        +

                                                                                                        +optional_last_value invocation

                                                                                                        +
                                                                                                        1. +
                                                                                                          template<typename InputIterator> 
+  result_type operator()(InputIterator first, InputIterator last) const;
                                                                                                          +
                                                                                                          ++++ + + + + +

                                                                                                          Effects:

                                                                                                          Attempts to dereference every iterator in the sequence [first, last). +

                                                                                                          +
                                                                                                        +
                                                                                                        +
                                                                                                        +
                                                                                                        + + + +
                                                                                                        Copyright © 2001-2004 Douglas Gregor
                                                                                                        Copyright © 2007-2009 Frank Mori Hess

                                                                                                        Distributed under the Boost + Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

                                                                                                        +
                                                                                                        +
                                                                                                        +
                                                                                                        +PrevUpHomeNext +
                                                                                                        + + diff --git a/doc/html/boost/signals2/optional_last_idp219889824.html b/doc/html/boost/signals2/optional_last_idp219889824.html deleted file mode 100644 index d92c088a2e..0000000000 --- a/doc/html/boost/signals2/optional_last_idp219889824.html +++ /dev/null @@ -1,87 +0,0 @@ - - - - -Class optional_last_value<void> - - - - - - - - - - - - - - - -
                                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                                        -
                                                                                                        -
                                                                                                        -PrevUpHomeNext -
                                                                                                        -
                                                                                                        -
                                                                                                        -
                                                                                                        -

                                                                                                        Class optional_last_value<void>

                                                                                                        -

                                                                                                        boost::signals2::optional_last_value<void> — Evaluate an InputIterator sequence.

                                                                                                        -
                                                                                                        -

                                                                                                        Synopsis

                                                                                                        -
                                                                                                        // In header: <boost/signals2/optional_last_value.hpp>
-
-
-class optional_last_value<void> {
-public:
-  // types
-  typedef void result_type;
-
-  // invocation
-  template<typename InputIterator> 
-    result_type operator()(InputIterator, InputIterator) const;
-};
                                                                                                        -
                                                                                                        -

                                                                                                        Description

                                                                                                        -

                                                                                                        This specialization of signals2::optional_last_value is provided - to cope with the fact that there is no such thing as an - optional<void>, which - optional_last_value would otherwise try to - use as its result_type. This specialization - instead sets the result_type to be void. -

                                                                                                        -
                                                                                                        -

                                                                                                        -optional_last_value invocation

                                                                                                        -
                                                                                                        1. -
                                                                                                          template<typename InputIterator> 
-  result_type operator()(InputIterator first, InputIterator last) const;
                                                                                                          -
                                                                                                          ---- - - - - -

                                                                                                          Effects:

                                                                                                          Attempts to dereference every iterator in the sequence [first, last). -

                                                                                                          -
                                                                                                        -
                                                                                                        -
                                                                                                        -
                                                                                                        - - - -
                                                                                                        Copyright © 2001-2004 Douglas Gregor
                                                                                                        Copyright © 2007-2009 Frank Mori Hess

                                                                                                        Distributed under the Boost - Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

                                                                                                        -
                                                                                                        -
                                                                                                        -
                                                                                                        -PrevUpHomeNext -
                                                                                                        - - diff --git a/doc/html/boost/signals2/optional_last_value.html b/doc/html/boost/signals2/optional_last_value.html index 663b13aaf3..e5bf299e54 100644 --- a/doc/html/boost/signals2/optional_last_value.html +++ b/doc/html/boost/signals2/optional_last_value.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
                                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                                        @@ -40,12 +40,12 @@ // types typedef boost::optional<T> result_type; - // invocation + // invocation template<typename InputIterator> - result_type operator()(InputIterator, InputIterator) const; + result_type operator()(InputIterator, InputIterator) const; };
                                                                                                        -

                                                                                                        Description

                                                                                                        +

                                                                                                        Description

                                                                                                        optional_last_value is the default Combiner template type for signals in the Boost.Signals2 library. The advantage of optional_last_value over @@ -55,11 +55,11 @@ its InputIterator sequence is empty.

                                                                                                        -

                                                                                                        -optional_last_value invocation

                                                                                                        +

                                                                                                        +optional_last_value invocation

                                                                                                        1. template<typename InputIterator> 
-  result_type operator()(InputIterator first, InputIterator last) const;
                                                                                                          + result_type operator()(InputIterator first, InputIterator last) const;
                                                                                                          @@ -87,8 +87,8 @@
                                                                                                          -

                                                                                                          Specializations

                                                                                                          -
                                                                                                          +

                                                                                                          Specializations

                                                                                                          +
                                                                                                          @@ -101,7 +101,7 @@
                                                                                                          -PrevUpHomeNext +PrevUpHomeNext
                                                                                                          diff --git a/doc/html/boost/signals2/postconstructor_invoker.html b/doc/html/boost/signals2/postconstructor_invoker.html index 74f13eb925..de43a40a91 100644 --- a/doc/html/boost/signals2/postconstructor_invoker.html +++ b/doc/html/boost/signals2/postconstructor_invoker.html @@ -36,44 +36,44 @@ class postconstructor_invoker { public: - // public methods - operator const shared_ptr<T> &(); - const shared_ptr<T> & postconstruct(); - template<typename A1> const shared_ptr<T> & postconstruct(A1); + // public methods + operator const shared_ptr<T> &(); + const shared_ptr<T> & postconstruct(); + template<typename A1> const shared_ptr<T> & postconstruct(A1); template<typename A1, typename A2> - const shared_ptr<T> & postconstruct(A1, A1); + const shared_ptr<T> & postconstruct(A1, A1); template<typename A1, typename A2, ..., typename AN> - const shared_ptr<T> & postconstruct(A1, A1, ..., A1); + const shared_ptr<T> & postconstruct(A1, A1, ..., A1); };
                                                                                                          -

                                                                                                          Description

                                                                                                          +

                                                                                                          Description

                                                                                                          Objects of type postconstructor_invoker are returned by calls to the deconstruct() factory function. These objects are intended to either be immediately assigned to a shared_ptr (in which case the class' conversion operator will perform the conversion by calling the - postconstruct with no arguments), or to be converted + postconstruct with no arguments), or to be converted to shared_ptr explicitly by the user calling one of - the postconstruct methods. + the postconstruct methods.

                                                                                                          -

                                                                                                          -postconstructor_invoker public methods

                                                                                                          +

                                                                                                          +postconstructor_invoker public methods

                                                                                                          1. -
                                                                                                            operator const shared_ptr<T> &();
                                                                                                            +
                                                                                                            operator const shared_ptr<T> &();

                                                                                                            The conversion operator has the same effect as explicitly calling - the postconstruct method with no arguments. + the postconstruct method with no arguments.

                                                                                                          2. -
                                                                                                            const shared_ptr<T> & postconstruct();
-template<typename A1> const shared_ptr<T> & postconstruct(A1 a1);
+
                                                                                                            const shared_ptr<T> & postconstruct();
+template<typename A1> const shared_ptr<T> & postconstruct(A1 a1);
 template<typename A1, typename A2> 
-  const shared_ptr<T> & postconstruct(A1 a1, A1 a2);
+  const shared_ptr<T> & postconstruct(A1 a1, A1 a2);
 template<typename A1, typename A2, ..., typename AN> 
-  const shared_ptr<T> & postconstruct(A1 a1, A1 a2, ..., A1 aN);
                                                                                                            
+  const shared_ptr<T> & postconstruct(A1 a1, A1 a2, ..., A1 aN);

                                                                                                            The postconstruct methods make an unqualified call to adl_postconstruct() and then return the shared_ptr diff --git a/doc/html/boost/signals2/scoped_connection.html b/doc/html/boost/signals2/scoped_connection.html index 0511192eee..bdbb5c8b8e 100644 --- a/doc/html/boost/signals2/scoped_connection.html +++ b/doc/html/boost/signals2/scoped_connection.html @@ -35,32 +35,32 @@ class scoped_connection : public connection { public: - // construct/copy/destruct - scoped_connection(); - scoped_connection(const connection&); - scoped_connection(scoped_connection&&); - scoped_connection(connection&&); - scoped_connection& operator=(const connection&); - scoped_connection& operator=(scoped_connection&&); - scoped_connection& operator=(connection&&); - ~scoped_connection(); + // construct/copy/destruct + scoped_connection(); + scoped_connection(const connection&); + scoped_connection(scoped_connection&&); + scoped_connection(connection&&); + scoped_connection& operator=(const connection&); + scoped_connection& operator=(scoped_connection&&); + scoped_connection& operator=(connection&&); + ~scoped_connection(); - // public methods - connection release(); + // public methods + connection release(); private: - // construct/copy/destruct - scoped_connection(const scoped_connection&); - scoped_connection& operator=(const scoped_connection&); + // construct/copy/destruct + scoped_connection(const scoped_connection&); + scoped_connection& operator=(const scoped_connection&); };

                                                                                                          -

                                                                                                          Description

                                                                                                          +

                                                                                                          Description

                                                                                                          A connection which automatically disconnects on destruction.

                                                                                                          -Thread Safety
                                                                                                          +Thread Safety

                                                                                                          The methods of the scoped_connection class (including those inherited from its base connection class) are thread-safe with the exception - of signals2::connection::swap, release, and + of signals2::connection::swap, release, and the assignment operator. A scoped_connection object should not be accessed concurrently when any of these operations is in progress. However, it is always safe to access a different connection object @@ -68,11 +68,11 @@

                                                                                                          -

                                                                                                          -scoped_connection public construct/copy/destruct

                                                                                                          +

                                                                                                          +scoped_connection public construct/copy/destruct

                                                                                                          1. -
                                                                                                            scoped_connection();
                                                                                                            +
                                                                                                            scoped_connection();

                                                                                                            Default constructs an empty scoped_connection.

                                                                                                            @@ -82,7 +82,7 @@ - + @@ -92,7 +92,7 @@

                                                                                                            Postconditions:

                                                                                                            connected() == false

                                                                                                            connected() == false

                                                                                                            Throws:

                                                                                                          2. -
                                                                                                            scoped_connection(const connection& other);
                                                                                                            +
                                                                                                            scoped_connection(const connection& other);
                                                                                                            @@ -107,7 +107,7 @@ - + @@ -117,7 +117,7 @@

                                                                                                            Postconditions:

                                                                                                            connected() == other.connected()

                                                                                                            connected() == other.connected()

                                                                                                            Throws:

                                                                                                          3. -
                                                                                                            scoped_connection(scoped_connection&& other);
                                                                                                            +
                                                                                                            scoped_connection(scoped_connection&& other);

                                                                                                            Move constructor.

                                                                                                            @@ -140,7 +140,7 @@
                                                                                                          4. -
                                                                                                            scoped_connection(connection&& other);
                                                                                                            +
                                                                                                            scoped_connection(connection&& other);

                                                                                                            Move constructor.

                                                                                                            @@ -163,7 +163,7 @@
                                                                                                          5. -
                                                                                                            scoped_connection& operator=(const connection& rhs);
                                                                                                            +
                                                                                                            scoped_connection& operator=(const connection& rhs);

                                                                                                            Copy assignment from unscoped connection.

                                                                                                            @@ -180,7 +180,7 @@ - + @@ -190,7 +190,7 @@

                                                                                                            Postconditions:

                                                                                                            connected() == other.connected()

                                                                                                            connected() == other.connected()

                                                                                                            Throws:

                                                                                                          6. -
                                                                                                            scoped_connection& operator=(scoped_connection&& rhs);
                                                                                                            +
                                                                                                            scoped_connection& operator=(scoped_connection&& rhs);

                                                                                                            Move assignment.

                                                                                                            @@ -214,7 +214,7 @@
                                                                                                          7. -
                                                                                                            scoped_connection& operator=(connection&& rhs);
                                                                                                            +
                                                                                                            scoped_connection& operator=(connection&& rhs);

                                                                                                            Move assignment.

                                                                                                            @@ -238,7 +238,7 @@
                                                                                                          8. -
                                                                                                            ~scoped_connection();
                                                                                                            +
                                                                                                            ~scoped_connection();
                                                                                                            @@ -247,7 +247,7 @@

                                                                                                            Effects:

                                                                                                            If - this->connected(), + this->connected(), disconnects the signal-slot connection.
                                                                                                            @@ -255,10 +255,10 @@
                                                                                                          -

                                                                                                          -scoped_connection public methods

                                                                                                          +

                                                                                                          +scoped_connection public methods

                                                                                                          1. -
                                                                                                            connection release();
                                                                                                            +
                                                                                                            connection release();
                                                                                                            @@ -275,7 +275,7 @@ - + @@ -288,16 +288,16 @@
                                                                                                            -

                                                                                                            -scoped_connection private construct/copy/destruct

                                                                                                            +

                                                                                                            +scoped_connection private construct/copy/destruct

                                                                                                            1. -
                                                                                                              scoped_connection(const scoped_connection& other);
                                                                                                              +
                                                                                                              scoped_connection(const scoped_connection& other);

                                                                                                              The scoped_connection class is not copyable. It may only be copy constructed from an unscoped connection object.

                                                                                                            2. -
                                                                                                              scoped_connection& operator=(const scoped_connection& rhs);
                                                                                                              +
                                                                                                              scoped_connection& operator=(const scoped_connection& rhs);

                                                                                                              The scoped_connection class is not copyable. It may only be copy assigned from an unscoped connection object.

                                                                                                              3. diff --git a/doc/html/boost/signals2/shared_connection_block.html b/doc/html/boost/signals2/shared_connection_block.html index f5b00ff0c8..9b099b094c 100644 --- a/doc/html/boost/signals2/shared_connection_block.html +++ b/doc/html/boost/signals2/shared_connection_block.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@

                                                                                                            Postconditions:

                                                                                                            connected() == false

                                                                                                            connected() == false

                                                                                                            Returns:
                                                                                                            -PrevUpHomeNext +PrevUpHomeNext
                                                                                                            @@ -36,23 +36,23 @@ class shared_connection_block { public: // construct/copy/destruct - shared_connection_block(const boost::signals2::connection & = connection(), + shared_connection_block(const boost::signals2::connection & = connection(), bool = true); - shared_connection_block(const boost::signals2::shared_connection_block &); + shared_connection_block(const boost::signals2::shared_connection_block &); shared_connection_block& - operator=(const boost::signals2::shared_connection_block &); - ~shared_connection_block(); + operator=(const boost::signals2::shared_connection_block &); + ~shared_connection_block(); - // connection blocking - void unblock(); - void block(); - bool blocking() const; + // connection blocking + void unblock(); + void block(); + bool blocking() const; - // miscellaneous methods - boost::signals2::connection connection() const; + // miscellaneous methods + boost::signals2::connection connection() const; };
                                                                                                            -

                                                                                                            Description

                                                                                                            +

                                                                                                            Description

                                                                                                            A shared_connection_block object blocks a connection, preventing the associated slot from executing when the associated signal is invoked. The connection will remain @@ -60,7 +60,7 @@ the connection releases its block. A shared_connection_block releases its block when it is destroyed or its - unblock method is called.

                                                                                                            + unblock method is called.

                                                                                                            A shared_connection_block is safe to use even after the signals2::connection object it was constructed from has been destroyed, or the connection it references has been @@ -77,13 +77,13 @@ connection.

                                                                                                            -

                                                                                                            +

                                                                                                            shared_connection_block public construct/copy/destruct

                                                                                                            1. -
                                                                                                              shared_connection_block(const boost::signals2::connection & conn = connection(), 
+
                                                                                                              shared_connection_block(const boost::signals2::connection & conn = connection(), 
                         bool initially_blocking = true);
                                                                                                              
 
                                                                                                              @@ -99,7 +99,7 @@
             will initially block the connection if and only if the
             initially_blocking
             parameter is true.  The block on the connection may be released
-            by calling the unblock method,
+            by calling the unblock method,
             or destroying the shared_connection_block object.
                                                                                                              Default construction of a shared_connection_block results in a
               shared_connection_block which references the NULL connection.
@@ -117,7 +117,7 @@
                                                                                                            2. -
                                                                                                              shared_connection_block(const boost::signals2::shared_connection_block & other);
                                                                                                              +
                                                                                                              shared_connection_block(const boost::signals2::shared_connection_block & other);
                                                                                                              @@ -143,7 +143,7 @@ 
                                                                                                            3. shared_connection_block& 
-operator=(const boost::signals2::shared_connection_block & rhs);
                                                                                                              +operator=(const boost::signals2::shared_connection_block & rhs);
                                                                                                              4. @@ -171,7 +171,7 @@
                                                                                                            4. -
                                                                                                              ~shared_connection_block();
                                                                                                              +
                                                                                                              ~shared_connection_block();
                                                                                                              @@ -179,18 +179,18 @@ - +

                                                                                                              Effects:

                                                                                                              If blocking() is true, releases the connection block.

                                                                                                              If blocking() is true, releases the connection block.
                                                                                                            -

                                                                                                            -shared_connection_block connection blocking

                                                                                                            +

                                                                                                            +shared_connection_block connection blocking

                                                                                                            1. -
                                                                                                              void unblock();
                                                                                                              +
                                                                                                              void unblock();
                                                                                                              @@ -199,7 +199,7 @@ - @@ -211,7 +211,7 @@

                                                                                                              Effects:

                                                                                                              If blocking() is true, releases the connection block. +

                                                                                                              If blocking() is true, releases the connection block. Note, the connection may remain blocked due to other shared_connection_block objects.
                                                                                                            2. -
                                                                                                              void block();
                                                                                                              +
                                                                                                              void block();
                                                                                                              @@ -220,7 +220,7 @@ - @@ -231,7 +231,7 @@

                                                                                                              Effects:

                                                                                                              If blocking() is false, reasserts a block on +

                                                                                                              If blocking() is false, reasserts a block on the connection.
                                                                                                            3. -
                                                                                                              bool blocking() const;
                                                                                                              +
                                                                                                              bool blocking() const;
                                                                                                              @@ -244,7 +244,7 @@ - @@ -255,10 +255,10 @@
                                                                                                              -

                                                                                                              -shared_connection_block miscellaneous methods

                                                                                                              +

                                                                                                              +shared_connection_block miscellaneous methods

                                                                                                              1. -
                                                                                                                boost::signals2::connection connection() const;
                                                                                                                +
                                                                                                                boost::signals2::connection connection() const;

                                                                                                              Notes:

                                                                                                              this->blocking() == true implies connection::blocked() == true +

                                                                                                              this->blocking() == true implies connection::blocked() == true for the connection. However, this->blocking() == false does not necessarily imply connection::blocked() == false, since the connection may be blocked by another shared_connection_block object.
                                                                                                              @@ -282,7 +282,7 @@
                                                                                                              -PrevUpHomeNext +PrevUpHomeNext
                                                                                                              diff --git a/doc/html/boost/signals2/signal.html b/doc/html/boost/signals2/signal.html index ab9cb94bde..0c372c3421 100644 --- a/doc/html/boost/signals2/signal.html +++ b/doc/html/boost/signals2/signal.html @@ -48,7 +48,7 @@ typedef GroupCompare group_compare_type; typedef SlotFunction slot_function_type; typedef typename signals2::slot<Signature, SlotFunction> slot_type; - typedef ExtendedSlotFunction extended_slot_function_type; + typedef ExtendedSlotFunction extended_slot_function_type; typedef typename signals2::slot<R (const connection &, T1, ..., TN), ExtendedSlotFunction> extended_slot_type; typedef typename SlotFunction::result_type slot_result_type; typedef unspecified slot_call_iterator; @@ -68,51 +68,51 @@ }; // construct/copy/destruct - signal(const combiner_type& = combiner_type(), + signal(const combiner_type& = combiner_type(), const group_compare_type& = group_compare_type()); - signal(signal &&); - signal& operator=(signal &&); + signal(signal &&); + signal& operator=(signal &&); - // connection management - connection connect(const slot_type&, connect_position = at_back); - connection connect(const group_type&, const slot_type&, + // connection management + connection connect(const slot_type&, connect_position = at_back); + connection connect(const group_type&, const slot_type&, connect_position = at_back); - connection connect_extended(const extended_slot_type&, + connection connect_extended(const extended_slot_type&, connect_position = at_back); - connection connect_extended(const group_type&, const extended_slot_type&, + connection connect_extended(const group_type&, const extended_slot_type&, connect_position = at_back); - void disconnect(const group_type&); - template<typename S> void disconnect(const S&); - void disconnect_all_slots(); - bool empty() const; - std::size_t num_slots() const; + void disconnect(const group_type&); + template<typename S> void disconnect(const S&); + void disconnect_all_slots(); + bool empty() const; + std::size_t num_slots() const; - // invocation - result_type operator()(arg<0>::type, arg<1>::type, ..., arg<N-1>::type); - result_type operator()(arg<0>::type, arg<1>::type, ..., arg<N-1>::type) const; + // invocation + result_type operator()(arg<0>::type, arg<1>::type, ..., arg<N-1>::type); + result_type operator()(arg<0>::type, arg<1>::type, ..., arg<N-1>::type) const; - // combiner access - combiner_type combiner() const; - void set_combiner(const combiner_type&); + // combiner access + combiner_type combiner() const; + void set_combiner(const combiner_type&); - // modifiers - void swap(signal&); + // modifiers + void swap(signal&); }; -// specialized algorithms +// specialized algorithms template<typename Signature, typename Combiner, typename Group, typename GroupCompare, typename SlotFunction, typename ExtendedSlotFunction, typename Mutex> - void swap(signal<Signature, Combiner, Group, GroupCompare, SlotFunction, ExtendedSlotFunction, Mutex>&, + void swap(signal<Signature, Combiner, Group, GroupCompare, SlotFunction, ExtendedSlotFunction, Mutex>&, signal<Signature, Combiner, Group, GroupCompare, SlotFunction, ExtendedSlotFunction, Mutex>&);
                                                                                                              -

                                                                                                              Description

                                                                                                              +

                                                                                                              Description

                                                                                                              See the tutorial for more information on how to use the signal class.

                                                                                                              -

                                                                                                              Template Parameters

                                                                                                              +

                                                                                                              Template Parameters

                                                                                                              1. typename Signature
                                                                                                                @@ -127,7 +127,7 @@
                                                                                                              -

                                                                                                              +

                                                                                                              signal public types

                                                                                                              @@ -136,7 +136,7 @@

                                                                                                              typedef typename signals2::slot<R (const connection &, T1, ..., TN), ExtendedSlotFunction> extended_slot_type;

                                                                                                              Slots of the extended_slot_type may be connected to the signal using the - connect_extended methods. The extended_slot_type + connect_extended methods. The extended_slot_type has an additional signals2::connection argument in its signature, which gives slot functions access to their connection to the signal invoking them. @@ -160,13 +160,13 @@

                                                                                                            -

                                                                                                            +

                                                                                                            signal public construct/copy/destruct

                                                                                                            1. -
                                                                                                              signal(const combiner_type& combiner = combiner_type(), 
+
                                                                                                              signal(const combiner_type& combiner = combiner_type(), 
        const group_compare_type& compare = group_compare_type());
                                                                                                              
 
                                                                                                              @@ -180,13 +180,13 @@
 
-
+
                                                                                                              
 

 
                                                                                                              
 
                                                                                                              Postconditions:
                                                                                                              this->empty()
                                                                                                              this->empty()
                                                                                                            2. -
                                                                                                              signal(signal && other);
                                                                                                              +
                                                                                                              signal(signal && other);

                                                                                                              Move constructor.

                                                                                                              @@ -208,7 +208,7 @@
                                                                                                            3. -
                                                                                                              signal& operator=(signal && rhs);
                                                                                                              +
                                                                                                              signal& operator=(signal && rhs);

                                                                                                              Move assignment.

                                                                                                              @@ -232,12 +232,12 @@
                                                                                                              -

                                                                                                              -signal connection management

                                                                                                              +

                                                                                                              +signal connection management

                                                                                                              1. -
                                                                                                                connection connect(const slot_type& slot, connect_position at = at_back);
-connection connect(const group_type& group, const slot_type& slot, 
+
                                                                                                                connection connect(const slot_type& slot, connect_position at = at_back);
+connection connect(const group_type& group, const slot_type& slot, 
                    connect_position at = at_back);
                                                                                                              @@ -291,21 +291,21 @@
                                                                                                            4. -
                                                                                                              connection connect_extended(const extended_slot_type& slot, 
+
                                                                                                              connection connect_extended(const extended_slot_type& slot, 
                             connect_position at = at_back);
-connection connect_extended(const group_type& group, 
+connection connect_extended(const group_type& group, 
                             const extended_slot_type& slot, 
                             connect_position at = at_back);
                                                                                                              
 
                                                                                                              
-                The connect_extended methods work the same as the connect
+                The connect_extended methods work the same as the connect
                 methods, except they take slots of type extended_slot_type.
                 This is useful if a slot needs to access the connection between it and the
                 signal invoking it, for example if it wishes to disconnect or block its own connection.
                                                                                                            5. -
                                                                                                              void disconnect(const group_type& group);
-template<typename S> void disconnect(const S& slot_func);
                                                                                                              +
                                                                                                              void disconnect(const group_type& group);
+template<typename S> void disconnect(const S& slot_func);
                                                                                                              @@ -347,7 +347,7 @@
                                                                                                            6. -
                                                                                                              void disconnect_all_slots();
                                                                                                              +
                                                                                                              void disconnect_all_slots();
                                                                                                              @@ -360,7 +360,7 @@ - + @@ -381,7 +381,7 @@

                                                                                                              Postconditions:

                                                                                                              this->empty().

                                                                                                              this->empty().

                                                                                                              Throws:

                                                                                                            7. -
                                                                                                              bool empty() const;
                                                                                                              +
                                                                                                              bool empty() const;
                                                                                                              @@ -415,7 +415,7 @@
                                                                                                            8. -
                                                                                                              std::size_t num_slots() const;
                                                                                                              +
                                                                                                              std::size_t num_slots() const;
                                                                                                              @@ -449,12 +449,12 @@
                                                                                                              -

                                                                                                              -signal invocation

                                                                                                              +

                                                                                                              +signal invocation

                                                                                                              1. -
                                                                                                                result_type operator()(arg<0>::type a1, arg<1>::type a2, ..., 
+
                                                                                                                result_type operator()(arg<0>::type a1, arg<1>::type a2, ..., 
                        arg<N-1>::type aN);
-result_type operator()(arg<0>::type a1, arg<1>::type a2, ..., 
+result_type operator()(arg<0>::type a1, arg<1>::type a2, ..., 
                        arg<N-1>::type aN) const;
                                                                                                              @@ -506,11 +506,11 @@
                                                                                                              -

                                                                                                              -signal combiner access

                                                                                                              +

                                                                                                              +signal combiner access

                                                                                                              1. -
                                                                                                                combiner_type combiner() const;
                                                                                                                +
                                                                                                                combiner_type combiner() const;
                                                                                                              @@ -529,7 +529,7 @@
                                                                                                            9. -
                                                                                                              void set_combiner(const combiner_type& combiner);
                                                                                                              +
                                                                                                              void set_combiner(const combiner_type& combiner);
                                                                                                              @@ -551,10 +551,10 @@
                                                                                                              -

                                                                                                              -signal modifiers

                                                                                                              +

                                                                                                              +signal modifiers

                                                                                                              1. -
                                                                                                                void swap(signal& other);
                                                                                                                +
                                                                                                                void swap(signal& other);
                                                                                                              @@ -576,13 +576,13 @@
                                                                                                              -

                                                                                                              -signal specialized algorithms

                                                                                                              +

                                                                                                              +signal specialized algorithms

                                                                                                              1. template<typename Signature, typename Combiner, typename Group, 
          typename GroupCompare, typename SlotFunction, 
          typename ExtendedSlotFunction, typename Mutex> 
-  void swap(signal<Signature, Combiner, Group, GroupCompare, SlotFunction, ExtendedSlotFunction, Mutex>& x, 
+  void swap(signal<Signature, Combiner, Group, GroupCompare, SlotFunction, ExtendedSlotFunction, Mutex>& x, 
             signal<Signature, Combiner, Group, GroupCompare, SlotFunction, ExtendedSlotFunction, Mutex>& y);
                                                                                                              diff --git a/doc/html/boost/signals2/signal/arg.html b/doc/html/boost/signals2/signal/arg.html index e2ff1aac02..58dd69091d 100644 --- a/doc/html/boost/signals2/signal/arg.html +++ b/doc/html/boost/signals2/signal/arg.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                                                                                              -PrevUpHomeNext +PrevUpHomeNext
                                                                                                              @@ -49,7 +49,7 @@
                                                                                                              -PrevUpHomeNext +PrevUpHomeNext
                                                                                                              diff --git a/doc/html/boost/signals2/signal_base.html b/doc/html/boost/signals2/signal_base.html index c521fc2b89..790cba0970 100644 --- a/doc/html/boost/signals2/signal_base.html +++ b/doc/html/boost/signals2/signal_base.html @@ -36,17 +36,17 @@ class signal_base : public noncopyable { public: // construct/copy/destruct - virtual ~signal_base(); + virtual ~signal_base(); };
                                                                                                              -

                                                                                                              Description

                                                                                                              +

                                                                                                              Description

                                                                                                              -

                                                                                                              +

                                                                                                              signal_base public construct/copy/destruct

                                                                                                              1. -
                                                                                                                virtual ~signal_base();
                                                                                                                +
                                                                                                                virtual ~signal_base();

                                                                                                                Virtual destructor.

                                                                                                              diff --git a/doc/html/boost/signals2/signal_type.html b/doc/html/boost/signals2/signal_type.html index 89829b1aa7..be65e6f70b 100644 --- a/doc/html/boost/signals2/signal_type.html +++ b/doc/html/boost/signals2/signal_type.html @@ -46,12 +46,12 @@ typedef implementation-detail group_type; typedef implementation-detail group_compare_type; typedef implementation-detail slot_function_type; - typedef implementation-detail extended_slot_function_type; + typedef implementation-detail extended_slot_function_type; typedef implementation-detail mutex_type; typedef typename signal<signature_type, combiner_type, ..., mutex_type> type; };
                                                                                                              -

                                                                                                              Description

                                                                                                              +

                                                                                                              Description

                                                                                                              The signal_type metafunction employs the Boost.Parameter library to allow users to specify the template type parameters of a signals2::signal using named parameters. The resulting signal type is provided through the @@ -65,7 +65,7 @@ boost::signals2::keywords namespace. The supported template keywords are: keywords::signature_type, keywords::combiner_type, keywords::group_type, keywords::group_compare_type, - keywords::slot_function_type, keywords::extended_slot_function_type, + keywords::slot_function_type, keywords::extended_slot_function_type, and keywords::mutex_type.

                                                                                                              The default types for unspecified template type parameters are the same as those for the diff --git a/doc/html/boost/signals2/slot.html b/doc/html/boost/signals2/slot.html index 7ebf377121..15f342c668 100644 --- a/doc/html/boost/signals2/slot.html +++ b/doc/html/boost/signals2/slot.html @@ -56,33 +56,33 @@ }; // construct/copy/destruct - template<typename Slot> slot(const Slot &); + template<typename Slot> slot(const Slot &); template<typename OtherSignature, typename OtherSlotFunction> - slot(const slot<OtherSignature, OtherSlotFunction> &); + slot(const slot<OtherSignature, OtherSlotFunction> &); template<typename Func, typename Arg1, typename Arg2, ..., typename ArgN> - slot(const Func &, const Arg1 &, const Arg2 &, ..., const ArgN &); + slot(const Func &, const Arg1 &, const Arg2 &, ..., const ArgN &); - // invocation - result_type operator()(arg<0>::type, arg<1>::_type, ..., arg<N-1>::type); - result_type operator()(arg<0>::type, arg<1>::_type, ..., arg<N-1>::type) const; + // invocation + result_type operator()(arg<0>::type, arg<1>::_type, ..., arg<N-1>::type); + result_type operator()(arg<0>::type, arg<1>::_type, ..., arg<N-1>::type) const; - // tracking - slot & track(const weak_ptr<void> &); - slot & track(const signals2::signal_base &); - slot & track(const signals2::slot_base &); + // tracking + slot & track(const weak_ptr<void> &); + slot & track(const signals2::signal_base &); + slot & track(const signals2::slot_base &); template<typename ForeignWeakPtr> - slot & track_foreign(const ForeignWeakPtr &, + slot & track_foreign(const ForeignWeakPtr &, typename weak_ptr_traits<ForeignWeakPtr>::shared_type * = 0); template<typename ForeignSharedPtr> - slot & track_foreign(const ForeignSharedPtr &, + slot & track_foreign(const ForeignSharedPtr &, typename shared_ptr_traits<ForeignSharedPtr>::weak_type * = 0); - // slot function access - slot_function_type & slot_function(); - const slot_function_type & slot_function() const; + // slot function access + slot_function_type & slot_function(); + const slot_function_type & slot_function() const; };

                                                                                                              -

                                                                                                              Description

                                                                                                              +

                                                                                                              Description

                                                                                                              A slot consists of a polymorphic function wrapper (boost::function by default) plus a container of weak_ptrs which identify the slot's "tracked objects". If any of the tracked objects expire, the slot will automatically disable itself. That is, the slot's function @@ -98,7 +98,7 @@ to the incoming functors with boost::visit_each.

                                                                                                              -

                                                                                                              Template Parameters

                                                                                                              +

                                                                                                              Template Parameters

                                                                                                              1. typename Signature
                                                                                                                @@ -108,13 +108,13 @@
                                                                                                              -

                                                                                                              +

                                                                                                              slot public construct/copy/destruct

                                                                                                              1. -
                                                                                                                template<typename Slot> slot(const Slot & target);
                                                                                                                +
                                                                                                                template<typename Slot> slot(const Slot & target);
                                                                                                                @@ -140,7 +140,7 @@ 
                                                                                                              2. template<typename OtherSignature, typename OtherSlotFunction> 
-  slot(const slot<OtherSignature, OtherSlotFunction> & other_slot);
                                                                                                                + slot(const slot<OtherSignature, OtherSlotFunction> & other_slot);
                                                                                                                3. @@ -156,7 +156,7 @@ 
                                                                                                              3. template<typename Func, typename Arg1, typename Arg2, ..., typename ArgN> 
-  slot(const Func & f, const Arg1 & a1, const Arg2 & a2, ..., const ArgN & aN);
                                                                                                                + slot(const Func & f, const Arg1 & a1, const Arg2 & a2, ..., const ArgN & aN);
                                                                                                                4. @@ -174,12 +174,12 @@
                                                                                                                -

                                                                                                                -slot invocation

                                                                                                                +

                                                                                                                +slot invocation

                                                                                                                1. -
                                                                                                                  result_type operator()(arg<0>::type a1, arg<1>::_type a2, ..., 
+
                                                                                                                  result_type operator()(arg<0>::type a1, arg<1>::_type a2, ..., 
                        arg<N-1>::type aN);
-result_type operator()(arg<0>::type a1, arg<1>::_type a2, ..., 
+result_type operator()(arg<0>::type a1, arg<1>::_type a2, ..., 
                        arg<N-1>::type aN) const;
                                                                                                                @@ -204,9 +204,9 @@ - @@ -214,13 +214,13 @@
                                                                                                                -

                                                                                                                -slot tracking

                                                                                                                +

                                                                                                                +slot tracking

                                                                                                                1. -
                                                                                                                  slot & track(const weak_ptr<void> & tracked_object);
-slot & track(const signals2::signal_base & tracked_signal);
-slot & track(const signals2::slot_base & tracked_slot);
                                                                                                                  +
                                                                                                                  slot & track(const weak_ptr<void> & tracked_object);
+slot & track(const signals2::signal_base & tracked_signal);
+slot & track(const signals2::slot_base & tracked_slot);

                                                                                                                Notes:

                                                                                                                If you have already used lock to insure the +

                                                                                                                If you have already used lock to insure the tracked objects are valid, it is slightly more efficient to use the - slot_function() method + slot_function() method and call the slot's SlotFunction directly.
                                                                                                                @@ -255,11 +255,11 @@
                                                                                                              4. -
                                                                                                                template<typename ForeignWeakPtr> 
-  slot & track_foreign(const ForeignWeakPtr & tracked_object, 
+
                                                                                                                template<typename ForeignWeakPtr> 
+  slot & track_foreign(const ForeignWeakPtr & tracked_object, 
                        typename weak_ptr_traits<ForeignWeakPtr>::shared_type * SFINAE = 0);
 template<typename ForeignSharedPtr> 
-  slot & track_foreign(const ForeignSharedPtr & tracked_object, 
+  slot & track_foreign(const ForeignSharedPtr & tracked_object, 
                        typename shared_ptr_traits<ForeignSharedPtr>::weak_type * SFINAE = 0);
                                                                                                                
 
                                                                                                                @@ -271,7 +271,7 @@
 
                                                                                                                
 

                                                                                                                Effects:
                                                                                                                		
 
 
                                                                                                                
-                The track_foreign() method behaves similarly to calling the track() method
+                The track_foreign() method behaves similarly to calling the track() method
                 with a boost::shared_ptr or boost::weak_ptr argument.
                 However, track_foreign is more flexible in that it will accept shared_ptr
                 or weak_ptr classes from outside of boost (most significantly std::shared_ptr
@@ -306,11 +306,11 @@
 
 
 
                                                                                                                
-
                                                                                                                
-slot slot function access
                                                                                                                
+
                                                                                                                
+slot slot function access
                                                                                                                
 
                                                                                                                1. 
-
                                                                                                                  slot_function_type & slot_function();
-const slot_function_type & slot_function() const;
                                                                                                                  
+
                                                                                                                  slot_function_type & slot_function();
+const slot_function_type & slot_function() const;
                                                                                                                  
 
                                                                                                                  diff --git a/doc/html/boost/signals2/slot/arg.html b/doc/html/boost/signals2/slot/arg.html
index 601dde1b00..43a1c5c5c1 100644
--- a/doc/html/boost/signals2/slot/arg.html
+++ b/doc/html/boost/signals2/slot/arg.html
@@ -6,7 +6,7 @@
 
-
+
@@ -21,7 +21,7 @@
 
                                                                                                                  
 
 

 
 
 
 
 
                                                                                                                  
 
                                                                                                                  
 
                                                                                                                  
-PrevUpHomeNext
+PrevUpHomeNext
 
                                                                                                                  
 
                                                                                                                  
 
                                                                                                                  
@@ -49,7 +49,7 @@
 
                                                                                                                
 
                                                                                                                
 
                                                                                                                
-PrevUpHomeNext
+PrevUpHomeNext
 
                                                                                                                
 
 
diff --git a/doc/html/boost/signals2/slot_base.html b/doc/html/boost/signals2/slot_base.html
index daccacdafc..28ce10eb71 100644
--- a/doc/html/boost/signals2/slot_base.html
+++ b/doc/html/boost/signals2/slot_base.html
@@ -38,19 +38,19 @@
   // types
   typedef std::vector<implementation-detail> locked_container_type;
 
-  // tracking
-  bool expired() const;
-  locked_container_type lock() const;
+  // tracking
+  bool expired() const;
+  locked_container_type lock() const;
 };
                                                                                                              -

                                                                                                              Description

                                                                                                              +

                                                                                                              Description

                                                                                                              -

                                                                                                              -slot_base tracking

                                                                                                              +

                                                                                                              +slot_base tracking

                                                                                                              1. -
                                                                                                                bool expired() const;
                                                                                                                +
                                                                                                                bool expired() const;
                                                                                                                @@ -63,7 +63,7 @@
                                                                                                              2. -
                                                                                                                locked_container_type lock() const;
                                                                                                                +
                                                                                                                locked_container_type lock() const;
                                                                                                                diff --git a/doc/html/boost/signals2/trackable.html b/doc/html/boost/signals2/trackable.html index b77a1f24b6..4cf28c6d98 100644 --- a/doc/html/boost/signals2/trackable.html +++ b/doc/html/boost/signals2/trackable.html @@ -37,13 +37,13 @@ classtrackable{public:// construct/copy/destruct - trackable(); - trackable(consttrackable&); - trackable& operator=(consttrackable&); - ~trackable(); + trackable(); + trackable(consttrackable&); + trackable& operator=(consttrackable&); + ~trackable();};
                                                                                                                -

                                                                                                                Description

                                                                                                                +

                                                                                                                Description

                                                                                                                Use of the trackable class is not recommended for new code. The trackable class is not thread-safe since trackable objects disconnect their associated @@ -57,7 +57,7 @@ The preferred method of automatic connection management with Boost.Signals2 is to manage the lifetime of tracked objects with shared_ptrs and - to use the signals2::slot::track + to use the signals2::slot::track method to track their lifetimes.

                                                                                                                The trackable class provides automatic disconnection of signals and slots when objects bound in @@ -74,13 +74,13 @@ type that may contain pointers or references to trackable objects.

                                                                                                                -

                                                                                                                +

                                                                                                                trackable public construct/copy/destruct

                                                                                                                1. -
                                                                                                                  trackable();
                                                                                                                  +
                                                                                                                  trackable();
                                                                                                                @@ -99,7 +99,7 @@
                                                                                                              3. -
                                                                                                                trackable(const trackable& other);
                                                                                                                +
                                                                                                                trackable(const trackable& other);
                                                                                                                @@ -122,7 +122,7 @@
                                                                                                              4. -
                                                                                                                trackable& operator=(const trackable& other);
                                                                                                                +
                                                                                                                trackable& operator=(const trackable& other);
                                                                                                                @@ -149,7 +149,7 @@
                                                                                                              5. -
                                                                                                                ~trackable();
                                                                                                                +
                                                                                                                ~trackable();
                                                                                                                diff --git a/doc/html/boost/slot.html b/doc/html/boost/slot.html index dbb0ca6ebf..d8bebdbf51 100644 --- a/doc/html/boost/slot.html +++ b/doc/html/boost/slot.html @@ -36,17 +36,17 @@ classslot{public:// construct/copy/destruct - template<typename Slot>slot(Slot); + template<typename Slot>slot(Slot);};
                                                                                                                -

                                                                                                                Description

                                                                                                                +

                                                                                                                Description

                                                                                                                -

                                                                                                                +

                                                                                                                slot public construct/copy/destruct

                                                                                                                1. -
                                                                                                                  template<typename Slot> slot(Slot target);
                                                                                                                  +
                                                                                                                  template<typename Slot> slot(Slot target);
                                                                                                                diff --git a/doc/html/boost/static_visitor.html b/doc/html/boost/static_visitor.html index 1b79243ce2..be0e058fb5 100644 --- a/doc/html/boost/static_visitor.html +++ b/doc/html/boost/static_visitor.html @@ -39,7 +39,7 @@ typedefResultTyperesult_type;// Exposes result_type member as required by StaticVisitor concept.};
                                                                                                                -

                                                                                                                Description

                                                                                                                +

                                                                                                                Description

                                                                                                                Denotes the intent of the deriving class as meeting the requirements of a static visitor of some type. Also exposes the inner type result_type as required by the diff --git a/doc/html/boost/strict_get.html b/doc/html/boost/strict_get.html index 947a20863b..5c2b5a20bd 100644 --- a/doc/html/boost/strict_get.html +++ b/doc/html/boost/strict_get.html @@ -8,7 +8,7 @@ - +

                                                                                                                @@ -21,7 +21,7 @@
                                                                                                                -PrevUpHomeNext +PrevUpHomeNext
                                                                                                                @@ -43,7 +43,7 @@ template<typename U, typename T1, typename T2, ..., typename TN> const U & strict_get(const variant<T1, T2, ..., TN> & operand);
                                                                                                                -

                                                                                                                Description

                                                                                                                +

                                                                                                                Description

                                                                                                                Acts exactly like relaxed_get but does a compile time check that type U is one of the types that can be stored in variant.

                                                                                                                @@ -58,7 +58,7 @@
                                                                                                                -PrevUpHomeNext +PrevUpHomeNext
                                                                                                                diff --git a/doc/html/boost/swap_idm45506893508496.html b/doc/html/boost/swap_idm45506893508496.html new file mode 100644 index 0000000000..73fafd1414 --- /dev/null +++ b/doc/html/boost/swap_idm45506893508496.html @@ -0,0 +1,73 @@ + + + + +Function template swap + + + + + + + + + + + + + + + +
                                                                                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                                                +
                                                                                                                +
                                                                                                                +PrevUpHomeNext +
                                                                                                                +
                                                                                                                +
                                                                                                                +
                                                                                                                +

                                                                                                                Function template swap

                                                                                                                +

                                                                                                                boost::swap

                                                                                                                +
                                                                                                                +

                                                                                                                Synopsis

                                                                                                                +
                                                                                                                // In header: <boost/variant/variant.hpp>
+
+
+template<typename T1, typename T2, ..., typename TN> 
+  void swap(variant<T1, T2, ..., TN> & lhs, variant<T1, T2, ..., TN> & rhs);
                                                                                                                +
                                                                                                                +

                                                                                                                Description

                                                                                                                +
                                                                                                                ++++ + + + + + + + + + + +

                                                                                                                Effects:

                                                                                                                		Swaps lhs with rhs by application + of variant::swap.

                                                                                                                Throws:

                                                                                                                		May fail with any exception arising from + variant::swap.
                                                                                                                +
                                                                                                                +
                                                                                                                + + + +
                                                                                                                Copyright © 2002, 2003 Eric Friedman, Itay Maman

                                                                                                                Distributed under the Boost Software License, Version 1.0. + (See accompanying file LICENSE_1_0.txt or copy at + http://www.boost.org/LICENSE_1_0.txt) +

                                                                                                                +
                                                                                                                +
                                                                                                                +
                                                                                                                +PrevUpHomeNext +
                                                                                                                + + diff --git a/doc/html/boost/swap_idm45507162621920.html b/doc/html/boost/swap_idm45507162621920.html new file mode 100644 index 0000000000..0e4c9b4baa --- /dev/null +++ b/doc/html/boost/swap_idm45507162621920.html @@ -0,0 +1,72 @@ + + + + +Function swap + + + + + + + + + + + + + + + +
                                                                                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                                                +
                                                                                                                +
                                                                                                                +PrevUpHomeNext +
                                                                                                                +
                                                                                                                +
                                                                                                                +
                                                                                                                +

                                                                                                                Function swap

                                                                                                                +

                                                                                                                boost::swap

                                                                                                                +
                                                                                                                +

                                                                                                                Synopsis

                                                                                                                +
                                                                                                                // In header: <boost/any.hpp>
+
+
+void swap(any & lhs, any & rhs);
                                                                                                                +
                                                                                                                +

                                                                                                                Description

                                                                                                                +
                                                                                                                ++++ + + + + + + + + + + +

                                                                                                                Effects:

                                                                                                                		Exchange of the contents of + lhs and + rhs.

                                                                                                                Throws:

                                                                                                                		Nothing.
                                                                                                                +
                                                                                                                +
                                                                                                                + + + +
                                                                                                                Copyright © 2001 Kevlin Henney

                                                                                                                Distributed under the Boost Software License, Version 1.0. + (See accompanying file LICENSE_1_0.txt or copy at + http://www.boost.org/LICENSE_1_0.txt) +

                                                                                                                +
                                                                                                                +
                                                                                                                +
                                                                                                                +PrevUpHomeNext +
                                                                                                                + + diff --git a/doc/html/boost/swap_idm45713141975568.html b/doc/html/boost/swap_idm45713141975568.html new file mode 100644 index 0000000000..079a698442 --- /dev/null +++ b/doc/html/boost/swap_idm45713141975568.html @@ -0,0 +1,105 @@ + + + + +Function template swap + + + + + + + + + + + + + + + +
                                                                                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                                                +
                                                                                                                +
                                                                                                                +PrevUpHomeNext +
                                                                                                                +
                                                                                                                +
                                                                                                                +
                                                                                                                +

                                                                                                                Function template swap

                                                                                                                +

                                                                                                                boost::swap — Swap the contents of two circular_buffers.

                                                                                                                +
                                                                                                                +

                                                                                                                Synopsis

                                                                                                                +
                                                                                                                // In header: <boost/circular_buffer/base.hpp>
+
+
+template<typename T, typename Alloc> 
+  void swap(circular_buffer< T, Alloc > & lhs, 
+            circular_buffer< T, Alloc > & rhs);
                                                                                                                +
                                                                                                                +

                                                                                                                Description

                                                                                                                +

                                                                                                                + + +

                                                                                                                +

                                                                                                                Complexity. Constant (in the size of the circular_buffers).

                                                                                                                +

                                                                                                                +

                                                                                                                +

                                                                                                                Iterator Invalidation. Invalidates all iterators of both circular_buffers. (On the other hand the iterators still point to the same elements but within another container. If you want to rely on this feature you have to turn the Debug Support off otherwise an assertion will report an error if such invalidated iterator is used.)

                                                                                                                +

                                                                                                                +

                                                                                                                +

                                                                                                                See Also:

                                                                                                                +

                                                                                                                swap(circular_buffer<T, Alloc>&)

                                                                                                                +

                                                                                                                +

                                                                                                                +
                                                                                                                ++++ + + + + + + + + + + + + + + +

                                                                                                                Parameters:

                                                                                                                ++++ + + + + + + + + + + +

                                                                                                                lhs

                                                                                                                The circular_buffer whose content will be swapped with rhs.

                                                                                                                rhs

                                                                                                                The circular_buffer whose content will be swapped with lhs.

                                                                                                                Postconditions:

                                                                                                                lhs contains elements of rhs and vice versa.

                                                                                                                Throws:

                                                                                                                		Nothing.
                                                                                                                +
                                                                                                                +
                                                                                                                + + + +
                                                                                                                Copyright © 2003-2013 Jan Gaspar

                                                                                                                + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                                                +
                                                                                                                +
                                                                                                                +
                                                                                                                +PrevUpHomeNext +
                                                                                                                + + diff --git a/doc/html/boost/swap_idp24893216.html b/doc/html/boost/swap_idp24893216.html deleted file mode 100644 index f4012fd662..0000000000 --- a/doc/html/boost/swap_idp24893216.html +++ /dev/null @@ -1,105 +0,0 @@ - - - - -Function template swap - - - - - - - - - - - - - - - -
                                                                                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                                                -
                                                                                                                -
                                                                                                                -PrevUpHomeNext -
                                                                                                                -
                                                                                                                -
                                                                                                                -
                                                                                                                -

                                                                                                                Function template swap

                                                                                                                -

                                                                                                                boost::swap — Swap the contents of two circular_buffers.

                                                                                                                -
                                                                                                                -

                                                                                                                Synopsis

                                                                                                                -
                                                                                                                // In header: <boost/circular_buffer/base.hpp>
-
-
-template<typename T, typename Alloc> 
-  void swap(circular_buffer< T, Alloc > & lhs, 
-            circular_buffer< T, Alloc > & rhs);
                                                                                                                -
                                                                                                                -

                                                                                                                Description

                                                                                                                -

                                                                                                                - - -

                                                                                                                -

                                                                                                                Complexity. Constant (in the size of the circular_buffers).

                                                                                                                -

                                                                                                                -

                                                                                                                -

                                                                                                                Iterator Invalidation. Invalidates all iterators of both circular_buffers. (On the other hand the iterators still point to the same elements but within another container. If you want to rely on this feature you have to turn the Debug Support off otherwise an assertion will report an error if such invalidated iterator is used.)

                                                                                                                -

                                                                                                                -

                                                                                                                -

                                                                                                                See Also:

                                                                                                                -

                                                                                                                swap(circular_buffer<T, Alloc>&)

                                                                                                                -

                                                                                                                -

                                                                                                                -
                                                                                                                ---- - - - - - - - - - - - - - - -

                                                                                                                Parameters:

                                                                                                                ---- - - - - - - - - - - -

                                                                                                                lhs

                                                                                                                The circular_buffer whose content will be swapped with rhs.

                                                                                                                rhs

                                                                                                                The circular_buffer whose content will be swapped with lhs.

                                                                                                                Postconditions:

                                                                                                                lhs contains elements of rhs and vice versa.

                                                                                                                Throws:

                                                                                                                		Nothing.
                                                                                                                -
                                                                                                                -
                                                                                                                - - - -
                                                                                                                Copyright © 2003-2013 Jan Gaspar

                                                                                                                - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                                                -
                                                                                                                -
                                                                                                                -
                                                                                                                -PrevUpHomeNext -
                                                                                                                - - diff --git a/doc/html/boost/swap_idp312897248.html b/doc/html/boost/swap_idp312897248.html deleted file mode 100644 index 2c32616dd6..0000000000 --- a/doc/html/boost/swap_idp312897248.html +++ /dev/null @@ -1,73 +0,0 @@ - - - - -Function template swap - - - - - - - - - - - - - - - -
                                                                                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                                                -
                                                                                                                -
                                                                                                                -PrevUpHomeNext -
                                                                                                                -
                                                                                                                -
                                                                                                                -
                                                                                                                -

                                                                                                                Function template swap

                                                                                                                -

                                                                                                                boost::swap

                                                                                                                -
                                                                                                                -

                                                                                                                Synopsis

                                                                                                                -
                                                                                                                // In header: <boost/variant/variant.hpp>
-
-
-template<typename T1, typename T2, ..., typename TN> 
-  void swap(variant<T1, T2, ..., TN> & lhs, variant<T1, T2, ..., TN> & rhs);
                                                                                                                -
                                                                                                                -

                                                                                                                Description

                                                                                                                -
                                                                                                                ---- - - - - - - - - - - -

                                                                                                                Effects:

                                                                                                                		Swaps lhs with rhs by application - of variant::swap.

                                                                                                                Throws:

                                                                                                                		May fail with any exception arising from - variant::swap.
                                                                                                                -
                                                                                                                -
                                                                                                                - - - -
                                                                                                                Copyright © 2002, 2003 Eric Friedman, Itay Maman

                                                                                                                Distributed under the Boost Software License, Version 1.0. - (See accompanying file LICENSE_1_0.txt or copy at - http://www.boost.org/LICENSE_1_0.txt) -

                                                                                                                -
                                                                                                                -
                                                                                                                -
                                                                                                                -PrevUpHomeNext -
                                                                                                                - - diff --git a/doc/html/boost/swap_idp45208528.html b/doc/html/boost/swap_idp45208528.html deleted file mode 100644 index 6de58cd295..0000000000 --- a/doc/html/boost/swap_idp45208528.html +++ /dev/null @@ -1,72 +0,0 @@ - - - - -Function swap - - - - - - - - - - - - - - - -
                                                                                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                                                -
                                                                                                                -
                                                                                                                -PrevUpHomeNext -
                                                                                                                -
                                                                                                                -
                                                                                                                -
                                                                                                                -

                                                                                                                Function swap

                                                                                                                -

                                                                                                                boost::swap

                                                                                                                -
                                                                                                                -

                                                                                                                Synopsis

                                                                                                                -
                                                                                                                // In header: <boost/any.hpp>
-
-
-void swap(any & lhs, any & rhs);
                                                                                                                -
                                                                                                                -

                                                                                                                Description

                                                                                                                -
                                                                                                                ---- - - - - - - - - - - -

                                                                                                                Effects:

                                                                                                                		Exchange of the contents of - lhs and - rhs.

                                                                                                                Throws:

                                                                                                                		Nothing.
                                                                                                                -
                                                                                                                -
                                                                                                                - - - -
                                                                                                                Copyright © 2001 Kevlin Henney

                                                                                                                Distributed under the Boost Software License, Version 1.0. - (See accompanying file LICENSE_1_0.txt or copy at - http://www.boost.org/LICENSE_1_0.txt) -

                                                                                                                -
                                                                                                                -
                                                                                                                -
                                                                                                                -PrevUpHomeNext -
                                                                                                                - - diff --git a/doc/html/boost/type_erasure/_a.html b/doc/html/boost/type_erasure/_a.html index 4acbbec1e3..a046d75204 100644 --- a/doc/html/boost/type_erasure/_a.html +++ b/doc/html/boost/type_erasure/_a.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                                                                                                                -PrevUpHomeNext +PrevUpHomeNext
                                                                                                                @@ -46,7 +46,7 @@
                                                                                                                -PrevUpHomeNext +PrevUpHomeNext
                                                                                                                diff --git a/doc/html/boost/type_erasure/_self.html b/doc/html/boost/type_erasure/_self.html index ccb1bb7f7a..8bb074f53b 100644 --- a/doc/html/boost/type_erasure/_self.html +++ b/doc/html/boost/type_erasure/_self.html @@ -36,8 +36,8 @@ struct _self : public boost::type_erasure::placeholder { };
                                                                                                                -

                                                                                                                Description

                                                                                                                -

                                                                                                                _self is the default placeholder used by any. It should be used as a default by most concepts, so using concepts with no explicit arguments will "just work" as much as possible.

                                                                                                                +

                                                                                                                Description

                                                                                                                +

                                                                                                                _self is the default placeholder used by any. It should be used as a default by most concepts, so using concepts with no explicit arguments will "just work" as much as possible.

                                                                                                                diff --git a/doc/html/boost/type_erasure/add_assignable.html b/doc/html/boost/type_erasure/add_assignable.html index 3c44da2173..fc296a0632 100644 --- a/doc/html/boost/type_erasure/add_assignable.html +++ b/doc/html/boost/type_erasure/add_assignable.html @@ -35,15 +35,15 @@ template<typename T =_self,typename U =T>structadd_assignable{ - // public static functions - staticvoidapply(T&,constU&); + // public static functions + staticvoidapply(T&,constU&);};
                                                                                                                -

                                                                                                                Description

                                                                                                                +

                                                                                                                Description

                                                                                                                -

                                                                                                                -add_assignable public static functions

                                                                                                                -
                                                                                                                1. static void apply(T &, const U &);
                                                                                                                +

                                                                                                                +add_assignable public static functions

                                                                                                                +
                                                                                                                1. static void apply(T &, const U &);
                                                                                                                diff --git a/doc/html/boost/type_erasure/addable.html b/doc/html/boost/type_erasure/addable.html index d9faf6696b..dcc31fa054 100644 --- a/doc/html/boost/type_erasure/addable.html +++ b/doc/html/boost/type_erasure/addable.html @@ -35,15 +35,15 @@ template<typename T =_self,typename U =T,typename R =T>structaddable{ - // public static functions - staticRapply(constT&,constU&); + // public static functions + staticRapply(constT&,constU&);};
                                                                                                                -

                                                                                                                Description

                                                                                                                +

                                                                                                                Description

                                                                                                                -

                                                                                                                -addable public static functions

                                                                                                                -
                                                                                                                1. static R apply(const T &, const U &);
                                                                                                                +

                                                                                                                +addable public static functions

                                                                                                                +
                                                                                                                1. static R apply(const T &, const U &);
                                                                                                                diff --git a/doc/html/boost/type_erasure/any.html b/doc/html/boost/type_erasure/any.html new file mode 100644 index 0000000000..3d4284190f --- /dev/null +++ b/doc/html/boost/type_erasure/any.html @@ -0,0 +1,615 @@ + + + + +Class template any + + + + + + + + +
                                                                                                                + + + + + + +
                                                                                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                                                +
                                                                                                                +
                                                                                                                +PrevUpHomeNext +
                                                                                                                +
                                                                                                                +
                                                                                                                +
                                                                                                                +

                                                                                                                Class template any

                                                                                                                +

                                                                                                                boost::type_erasure::any

                                                                                                                +
                                                                                                                +

                                                                                                                Synopsis

                                                                                                                +
                                                                                                                // In header: <boost/type_erasure/param.hpp>
+
+template<typename Concept, typename T = _self> 
+class any {
+public:
+  // construct/copy/destruct
+  any();
+  template<typename U> any(U &&);
+  template<typename U, typename Map> any(U &&, const static_binding< Map > &);
+  any(const any &);
+  template<typename Concept2, typename Tag2> 
+    any(const any< Concept2, Tag2 > &);
+  template<typename Concept2, typename Tag2, typename Map> 
+    any(const any< Concept2, Tag2 > &, const static_binding< Map > &);
+  template<typename Concept2, typename Tag2> 
+    any(const any< Concept2, Tag2 > &, const binding< Concept > &);
+  template<class... U> explicit any(U &&...);
+  template<class... U> explicit any(const binding< Concept > &, U &&...);
+  any & operator=(const any &);
+  template<typename U> any & operator=(const U &);
+  ~any();
+};
                                                                                                                +
                                                                                                                +

                                                                                                                Description

                                                                                                                +

                                                                                                                The class template any can store any object that models a specific Concept. It dispatches all the functions defined by the Concept to the contained type at runtime.

                                                                                                                +

                                                                                                                +

                                                                                                                +

                                                                                                                See Also:

                                                                                                                +

                                                                                                                concept_of, placeholder_of, any_cast, is_empty, binding_of, typeid_of

                                                                                                                +

                                                                                                                +

                                                                                                                +
                                                                                                                +

                                                                                                                Template Parameters

                                                                                                                +
                                                                                                                  +
                                                                                                                1. +
                                                                                                                  typename Concept
                                                                                                                  +

                                                                                                                  The Concept that the stored type should model.

                                                                                                                  +
                                                                                                                  2. +
                                                                                                                2. +
                                                                                                                  typename T = _self
                                                                                                                  +

                                                                                                                  A placeholder specifying which type this is.

                                                                                                                  +
                                                                                                                  3. +
                                                                                                                +
                                                                                                                +
                                                                                                                +

                                                                                                                +any + public + construct/copy/destruct

                                                                                                                +
                                                                                                                  +
                                                                                                                1. +
                                                                                                                  any();
                                                                                                                  +

                                                                                                                  Constructs an empty any.

                                                                                                                  +

                                                                                                                  Except as otherwise noted, all operations on an empty any result in a bad_function_call exception. The copy-constructor of an empty any creates another null any. The destructor of an empty any is a no-op. Comparison operators treat all empty anys as equal. typeid_of applied to an empty any returns typeid(void).

                                                                                                                  +

                                                                                                                  An any which does not include relaxed in its Concept can never be null.

                                                                                                                  +

                                                                                                                  + +

                                                                                                                  +

                                                                                                                  See Also:

                                                                                                                  +

                                                                                                                  is_empty

                                                                                                                  +

                                                                                                                  +

                                                                                                                  +
                                                                                                                  ++++ + + + + + + + + + + +

                                                                                                                  Requires:

                                                                                                                  relaxed must be in Concept.

                                                                                                                  Throws:

                                                                                                                  		Nothing.
                                                                                                                  +
                                                                                                                  2. +
                                                                                                                2. +
                                                                                                                  template<typename U> any(U && data);
                                                                                                                  +

                                                                                                                  Constructs an any to hold a copy of data. The Concept will be instantiated with the placeholder T bound to U.

                                                                                                                  +

                                                                                                                  + + + + +

                                                                                                                  +
                                                                                                                  + + + + + +
                                                                                                                  [Note]Note

                                                                                                                  This constructor never matches if the argument is an any, binding, or static_binding.

                                                                                                                  +

                                                                                                                  +

                                                                                                                  +
                                                                                                                  ++++ + + + + + + + + + + + + + + + + + + + + + + +

                                                                                                                  Parameters:

                                                                                                                  ++++ + + + + +

                                                                                                                  data

                                                                                                                  The object to store in the any.

                                                                                                                  Requires:

                                                                                                                  U is a model of Concept.

                                                                                                                  Requires:

                                                                                                                  U must be CopyConstructible.

                                                                                                                  Requires:

                                                                                                                  Concept must not refer to any non-deduced placeholder besides T.

                                                                                                                  Throws:

                                                                                                                  		std::bad_alloc or whatever that the copy constructor of U throws.
                                                                                                                  +
                                                                                                                  3. +
                                                                                                                3. +
                                                                                                                  template<typename U, typename Map> 
+  any(U && data, const static_binding< Map > & binding);
                                                                                                                  +

                                                                                                                  Constructs an any to hold a copy of data with explicitly specified placeholder bindings.

                                                                                                                  +

                                                                                                                  + + + + + +

                                                                                                                  +
                                                                                                                  + + + + + +
                                                                                                                  [Note]Note

                                                                                                                  This constructor never matches if the argument is an any.

                                                                                                                  +

                                                                                                                  +

                                                                                                                  +
                                                                                                                  ++++ + + + + + + + + + + + + + + + + + + + + + + + + + + +

                                                                                                                  Parameters:

                                                                                                                  ++++ + + + + + + + + + + +

                                                                                                                  binding

                                                                                                                  Specifies the types that all the placeholders should bind to.

                                                                                                                  data

                                                                                                                  The object to store in the any.

                                                                                                                  Requires:

                                                                                                                  U is a model of Concept.

                                                                                                                  Requires:

                                                                                                                  U must be CopyConstructible.

                                                                                                                  Requires:

                                                                                                                  Map is an MPL map with an entry for every non-deduced placeholder referred to by Concept.

                                                                                                                  Requires:

                                                                                                                  T must map to U in Map.

                                                                                                                  Throws:

                                                                                                                  		std::bad_alloc or whatever that the copy constructor of U throws.
                                                                                                                  +
                                                                                                                  4. +
                                                                                                                4. +
                                                                                                                  any(const any & other);
                                                                                                                  +

                                                                                                                  Copies an any.

                                                                                                                  +

                                                                                                                  + + +

                                                                                                                  +
                                                                                                                  ++++ + + + + + + + + + + + + + + +

                                                                                                                  Parameters:

                                                                                                                  ++++ + + + + +

                                                                                                                  other

                                                                                                                  The object to make a copy of.

                                                                                                                  Requires:

                                                                                                                  Concept must contain constructible<T(const T&)>. (This is included in copy_constructible<T>)

                                                                                                                  Throws:

                                                                                                                  		std::bad_alloc or whatever that the copy constructor of the contained type throws.
                                                                                                                  +
                                                                                                                  5. +
                                                                                                                5. +
                                                                                                                  template<typename Concept2, typename Tag2> 
+  any(const any< Concept2, Tag2 > & other);
                                                                                                                  +

                                                                                                                  Upcasts from an any with stricter requirements to an any with weaker requirements.

                                                                                                                  +

                                                                                                                  + + + + +

                                                                                                                  +
                                                                                                                  ++++ + + + + + + + + + + + + + + + + + + + + + + +

                                                                                                                  Parameters:

                                                                                                                  ++++ + + + + +

                                                                                                                  other

                                                                                                                  The object to make a copy of.

                                                                                                                  Requires:

                                                                                                                  Concept must contain constructible<T(const T&)>.

                                                                                                                  Requires:

                                                                                                                  Concept must not refer to any non-deduced placeholder besides T.

                                                                                                                  Requires:

                                                                                                                  After substituting T for Tag2, the requirements of Concept2 must be a superset of the requirements of Concept.

                                                                                                                  Throws:

                                                                                                                  		std::bad_alloc or whatever that the copy constructor of the contained type throws.
                                                                                                                  +
                                                                                                                  6. +
                                                                                                                6. +
                                                                                                                  template<typename Concept2, typename Tag2, typename Map> 
+  any(const any< Concept2, Tag2 > & other, 
+      const static_binding< Map > & binding);
                                                                                                                  +

                                                                                                                  Constructs an any from another any.

                                                                                                                  +

                                                                                                                  + + + + +

                                                                                                                  +
                                                                                                                  ++++ + + + + + + + + + + + + + + + + + + + + + + +

                                                                                                                  Parameters:

                                                                                                                  ++++ + + + + + + + + + + +

                                                                                                                  binding

                                                                                                                  Specifies the mapping between the placeholders used by the two concepts.

                                                                                                                  other

                                                                                                                  The object to make a copy of.

                                                                                                                  Requires:

                                                                                                                  Concept must contain constructible<T(const T&)>.

                                                                                                                  Requires:

                                                                                                                  Map must be an MPL map with keys for all the non-deduced placeholders used by Concept and values for the corresponding placeholders in Concept2.

                                                                                                                  Requires:

                                                                                                                  After substituting placeholders according to Map, the requirements of Concept2 must be a superset of the requirements of Concept.

                                                                                                                  Throws:

                                                                                                                  		std::bad_alloc or whatever that the copy constructor of the contained type throws.
                                                                                                                  +
                                                                                                                  7. +
                                                                                                                7. +
                                                                                                                  template<typename Concept2, typename Tag2> 
+  any(const any< Concept2, Tag2 > & other, const binding< Concept > & binding);
                                                                                                                  +

                                                                                                                  Constructs an any from another any.

                                                                                                                  +

                                                                                                                  + + + + +

                                                                                                                  +
                                                                                                                  + + + + + +
                                                                                                                  [Warning]Warning

                                                                                                                  This constructor is potentially dangerous, as it cannot check at compile time whether the arguments match.

                                                                                                                  +

                                                                                                                  +

                                                                                                                  +
                                                                                                                  ++++ + + + + + + + + + + + + + + + + + + + + + + +

                                                                                                                  Parameters:

                                                                                                                  ++++ + + + + + + + + + + +

                                                                                                                  binding

                                                                                                                  Specifies the bindings of placeholders to actual types.

                                                                                                                  other

                                                                                                                  The object to make a copy of.

                                                                                                                  Requires:

                                                                                                                  Concept must contain constructible<T(const T&)>.

                                                                                                                  Requires:

                                                                                                                  The type stored in other must match the type expected by binding.

                                                                                                                  Postconditions:

                                                                                                                  binding_of(*this) == binding

                                                                                                                  Throws:

                                                                                                                  		std::bad_alloc or whatever that the copy constructor of the contained type throws.
                                                                                                                  +
                                                                                                                  8. +
                                                                                                                8. +
                                                                                                                  template<class... U> explicit any(U &&... arg);
                                                                                                                  +

                                                                                                                  Calls a constructor of the contained type. The bindings will be deduced from the arguments.

                                                                                                                  +

                                                                                                                  + + + + +

                                                                                                                  +
                                                                                                                  + + + + + +
                                                                                                                  [Note]Note

                                                                                                                  This constructor is never chosen if any other constructor can be called instead.

                                                                                                                  +

                                                                                                                  +

                                                                                                                  +
                                                                                                                  ++++ + + + + + + + + + + + + + + + + + + + + + + +

                                                                                                                  Parameters:

                                                                                                                  ++++ + + + + +

                                                                                                                  arg

                                                                                                                  The arguments to be passed to the underlying constructor.

                                                                                                                  Requires:

                                                                                                                  Concept must contain an instance of constructible which can be called with these arguments.

                                                                                                                  Requires:

                                                                                                                  At least one of the arguments must by an any with the same Concept as this.

                                                                                                                  Requires:

                                                                                                                  The bindings of all the arguments that are any's, must be the same.

                                                                                                                  Throws:

                                                                                                                  		std::bad_alloc or whatever that the constructor of the contained type throws.
                                                                                                                  +
                                                                                                                  9. +
                                                                                                                9. +
                                                                                                                  template<class... U> 
+  explicit any(const binding< Concept > & binding, U &&... arg);
                                                                                                                  +

                                                                                                                  Calls a constructor of the contained type.

                                                                                                                  +

                                                                                                                  + + + + +

                                                                                                                  +
                                                                                                                  ++++ + + + + + + + + + + + + + + + + + + + + + + +

                                                                                                                  Parameters:

                                                                                                                  ++++ + + + + + + + + + + +

                                                                                                                  arg

                                                                                                                  The arguments to be passed to the underlying constructor.

                                                                                                                  binding

                                                                                                                  Specifies the bindings of placeholders to actual types.

                                                                                                                  Requires:

                                                                                                                  Concept must contain a matching instance of constructible.

                                                                                                                  Requires:

                                                                                                                  The contained type of every argument that is an any, must be the same as that specified by binding.

                                                                                                                  Postconditions:

                                                                                                                  binding_of(*this) == binding

                                                                                                                  Throws:

                                                                                                                  		std::bad_alloc or whatever that the constructor of the contained type throws.
                                                                                                                  +
                                                                                                                  10. +
                                                                                                                10. +
                                                                                                                  any & operator=(const any & other);
                                                                                                                  +

                                                                                                                  Assigns to an any.

                                                                                                                  +

                                                                                                                  If an appropriate overload of assignable is not available and relaxed is in Concept, falls back on constructing from other.

                                                                                                                  +

                                                                                                                  +

                                                                                                                  +
                                                                                                                  ++++ + + + + +

                                                                                                                  Throws:

                                                                                                                  		Whatever the assignment operator of the contained type throws. When falling back on construction, throws std::bad_alloc or whatever the copy constructor of the contained type throws. In this case assignment provides the strong exception guarantee. When calling the assignment operator of the contained type, the exception guarantee is whatever the contained type provides.
                                                                                                                  +
                                                                                                                  11. +
                                                                                                                11. +
                                                                                                                  template<typename U> any & operator=(const U & other);
                                                                                                                  +

                                                                                                                  Assigns to an any.

                                                                                                                  +

                                                                                                                  If an appropriate overload of assignable is not available and relaxed is in Concept, falls back on constructing from other.

                                                                                                                  +

                                                                                                                  +

                                                                                                                  +
                                                                                                                  ++++ + + + + +

                                                                                                                  Throws:

                                                                                                                  		Whatever the assignment operator of the contained type throws. When falling back on construction, throws std::bad_alloc or whatever the copy constructor of the contained type throws. In this case assignment provides the strong exception guarantee. When calling an assignment operator of the contained type, the exception guarantee is whatever the contained type provides.
                                                                                                                  +
                                                                                                                  12. +
                                                                                                                12. +
                                                                                                                  ~any();
                                                                                                                  +

                                                                                                                  +

                                                                                                                  +
                                                                                                                  ++++ + + + + +

                                                                                                                  Requires:

                                                                                                                  Concept includes destructible<T>.

                                                                                                                  +
                                                                                                                  13. +
                                                                                                                +
                                                                                                                +
                                                                                                                +
                                                                                                                + + + +
                                                                                                                Copyright © 2011-2013 Steven Watanabe

                                                                                                                + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                                                +
                                                                                                                +
                                                                                                                +
                                                                                                                +PrevUpHomeNext +
                                                                                                                + + diff --git a/doc/html/boost/type_erasure/any_Conc_idm45506890943856.html b/doc/html/boost/type_erasure/any_Conc_idm45506890943856.html new file mode 100644 index 0000000000..4fddcae331 --- /dev/null +++ b/doc/html/boost/type_erasure/any_Conc_idm45506890943856.html @@ -0,0 +1,572 @@ + + + + +Class template any<Concept, T &> + + + + + + + + + + + + + + + +
                                                                                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                                                +
                                                                                                                +
                                                                                                                +PrevUpHomeNext +
                                                                                                                +
                                                                                                                +
                                                                                                                +
                                                                                                                +

                                                                                                                Class template any<Concept, T &>

                                                                                                                +

                                                                                                                boost::type_erasure::any<Concept, T &>

                                                                                                                +
                                                                                                                +

                                                                                                                Synopsis

                                                                                                                +
                                                                                                                // In header: <boost/type_erasure/any.hpp>
+
+template<typename Concept, typename T> 
+class any<Concept, T &> {
+public:
+  // construct/copy/destruct
+  template<typename U> any(U &);
+  template<typename U, typename Map> any(U &, const static_binding< Map > &);
+  any(const any &);
+  any(any< Concept, T > &);
+  template<typename Concept2, typename Tag2> 
+    any(const any< Concept2, Tag2 & > &);
+  template<typename Concept2, typename Tag2> any(any< Concept2, Tag2 > &);
+  template<typename Concept2, typename Tag2, typename Map> 
+    any(const any< Concept2, Tag2 & > &, const static_binding< Map > &);
+  template<typename Concept2, typename Tag2, typename Map> 
+    any(any< Concept2, Tag2 > &, const static_binding< Map > &);
+  template<typename Concept2, typename Tag2> 
+    any(const any< Concept2, Tag2 & > &, const binding< Concept > &);
+  template<typename Concept2, typename Tag2> 
+    any(any< Concept2, Tag2 > &, const binding< Concept > &);
+  any & operator=(const any &);
+  template<typename U> any & operator=(U &);
+  template<typename U> any & operator=(const U &);
+};
                                                                                                                +
                                                                                                                +

                                                                                                                Description

                                                                                                                +
                                                                                                                +

                                                                                                                +any + public + construct/copy/destruct

                                                                                                                +
                                                                                                                  +
                                                                                                                1. +
                                                                                                                  template<typename U> any(U & arg);
                                                                                                                  +

                                                                                                                  Constructs an any from a reference.

                                                                                                                  +

                                                                                                                  + + + +

                                                                                                                  +
                                                                                                                  ++++ + + + + + + + + + + + + + + + + + + +

                                                                                                                  Parameters:

                                                                                                                  ++++ + + + + +

                                                                                                                  arg

                                                                                                                  The object to bind the reference to.

                                                                                                                  Requires:

                                                                                                                  U is a model of Concept.

                                                                                                                  Requires:

                                                                                                                  Concept must not refer to any non-deduced placeholder besides T.

                                                                                                                  Throws:

                                                                                                                  		Nothing.
                                                                                                                  +
                                                                                                                  2. +
                                                                                                                2. +
                                                                                                                  template<typename U, typename Map> 
+  any(U & arg, const static_binding< Map > & binding);
                                                                                                                  +

                                                                                                                  Constructs an any from a reference.

                                                                                                                  +

                                                                                                                  + + + +

                                                                                                                  +
                                                                                                                  ++++ + + + + + + + + + + + + + + + + + + +

                                                                                                                  Parameters:

                                                                                                                  ++++ + + + + + + + + + + +

                                                                                                                  arg

                                                                                                                  The object to bind the reference to.

                                                                                                                  binding

                                                                                                                  Specifies the actual types that all the placeholders should bind to.

                                                                                                                  Requires:

                                                                                                                  U is a model of Concept.

                                                                                                                  Requires:

                                                                                                                  Map is an MPL map with an entry for every non-deduced placeholder referred to by Concept.

                                                                                                                  Throws:

                                                                                                                  		Nothing.
                                                                                                                  +
                                                                                                                  3. +
                                                                                                                3. +
                                                                                                                  any(const any & other);
                                                                                                                  +

                                                                                                                  Constructs an any from another reference.

                                                                                                                  +

                                                                                                                  + +

                                                                                                                  +
                                                                                                                  ++++ + + + + + + + + + + +

                                                                                                                  Parameters:

                                                                                                                  ++++ + + + + +

                                                                                                                  other

                                                                                                                  The reference to copy.

                                                                                                                  Throws:

                                                                                                                  		Nothing.
                                                                                                                  +
                                                                                                                  4. +
                                                                                                                4. +
                                                                                                                  any(any< Concept, T > & other);
                                                                                                                  +

                                                                                                                  Constructs an any from another any.

                                                                                                                  +

                                                                                                                  + +

                                                                                                                  +
                                                                                                                  ++++ + + + + + + + + + + +

                                                                                                                  Parameters:

                                                                                                                  ++++ + + + + +

                                                                                                                  other

                                                                                                                  The object to bind the reference to.

                                                                                                                  Throws:

                                                                                                                  		Nothing.
                                                                                                                  +
                                                                                                                  5. +
                                                                                                                5. +
                                                                                                                  template<typename Concept2, typename Tag2> 
+  any(const any< Concept2, Tag2 & > & other);
                                                                                                                  +

                                                                                                                  Constructs an any from another reference.

                                                                                                                  +

                                                                                                                  + + + +

                                                                                                                  +
                                                                                                                  ++++ + + + + + + + + + + + + + + + + + + +

                                                                                                                  Parameters:

                                                                                                                  ++++ + + + + +

                                                                                                                  other

                                                                                                                  The reference to copy.

                                                                                                                  Requires:

                                                                                                                  Concept must not refer to any non-deduced placeholder besides T.

                                                                                                                  Requires:

                                                                                                                  After substituting T for Tag2, the requirements of Concept2 must be a superset of the requirements of Concept.

                                                                                                                  Throws:

                                                                                                                  		std::bad_alloc
                                                                                                                  +
                                                                                                                  6. +
                                                                                                                6. +
                                                                                                                  template<typename Concept2, typename Tag2> any(any< Concept2, Tag2 > & other);
                                                                                                                  +

                                                                                                                  Constructs an any from another any.

                                                                                                                  +

                                                                                                                  + + + +

                                                                                                                  +
                                                                                                                  ++++ + + + + + + + + + + + + + + + + + + +

                                                                                                                  Parameters:

                                                                                                                  ++++ + + + + +

                                                                                                                  other

                                                                                                                  The object to bind the reference to.

                                                                                                                  Requires:

                                                                                                                  Concept must not refer to any non-deduced placeholder besides T.

                                                                                                                  Requires:

                                                                                                                  After substituting T for Tag2, the requirements of Concept2 must be a superset of the requirements of Concept.

                                                                                                                  Throws:

                                                                                                                  		std::bad_alloc
                                                                                                                  +
                                                                                                                  7. +
                                                                                                                7. +
                                                                                                                  template<typename Concept2, typename Tag2, typename Map> 
+  any(const any< Concept2, Tag2 & > & other, 
+      const static_binding< Map > & binding);
                                                                                                                  +

                                                                                                                  Constructs an any from another reference.

                                                                                                                  +

                                                                                                                  + + + +

                                                                                                                  +
                                                                                                                  ++++ + + + + + + + + + + + + + + + + + + +

                                                                                                                  Parameters:

                                                                                                                  ++++ + + + + + + + + + + +

                                                                                                                  binding

                                                                                                                  Specifies the mapping between the two concepts.

                                                                                                                  other

                                                                                                                  The reference to copy.

                                                                                                                  Requires:

                                                                                                                  Map must be an MPL map with keys for all the non-deduced placeholders used by Concept and values for the corresponding placeholders in Concept2.

                                                                                                                  Requires:

                                                                                                                  After substituting placeholders according to Map, the requirements of Concept2 must be a superset of the requirements of Concept.

                                                                                                                  Throws:

                                                                                                                  		std::bad_alloc
                                                                                                                  +
                                                                                                                  8. +
                                                                                                                8. +
                                                                                                                  template<typename Concept2, typename Tag2, typename Map> 
+  any(any< Concept2, Tag2 > & other, const static_binding< Map > & binding);
                                                                                                                  +

                                                                                                                  Constructs an any from another any.

                                                                                                                  +

                                                                                                                  + + + +

                                                                                                                  +
                                                                                                                  ++++ + + + + + + + + + + + + + + + + + + +

                                                                                                                  Parameters:

                                                                                                                  ++++ + + + + + + + + + + +

                                                                                                                  binding

                                                                                                                  Specifies the mapping between the two concepts.

                                                                                                                  other

                                                                                                                  The object to bind the reference to.

                                                                                                                  Requires:

                                                                                                                  Map must be an MPL map with keys for all the non-deduced placeholders used by Concept and values for the corresponding placeholders in Concept2.

                                                                                                                  Requires:

                                                                                                                  After substituting placeholders according to Map, the requirements of Concept2 must be a superset of the requirements of Concept.

                                                                                                                  Throws:

                                                                                                                  		std::bad_alloc
                                                                                                                  +
                                                                                                                  9. +
                                                                                                                9. +
                                                                                                                  template<typename Concept2, typename Tag2> 
+  any(const any< Concept2, Tag2 & > & other, 
+      const binding< Concept > & binding);
                                                                                                                  +

                                                                                                                  Constructs an any from another reference.

                                                                                                                  +

                                                                                                                  + + + +

                                                                                                                  +
                                                                                                                  ++++ + + + + + + + + + + + + + + + + + + +

                                                                                                                  Parameters:

                                                                                                                  ++++ + + + + + + + + + + +

                                                                                                                  binding

                                                                                                                  Specifies the bindings of placeholders to actual types.

                                                                                                                  other

                                                                                                                  The reference to copy.

                                                                                                                  Requires:

                                                                                                                  The type stored in other must match the type expected by binding.

                                                                                                                  Postconditions:

                                                                                                                  binding_of(*this) == binding

                                                                                                                  Throws:

                                                                                                                  		Nothing.
                                                                                                                  +
                                                                                                                  10. +
                                                                                                                10. +
                                                                                                                  template<typename Concept2, typename Tag2> 
+  any(any< Concept2, Tag2 > & other, const binding< Concept > & binding);
                                                                                                                  +

                                                                                                                  Constructs an any from another any.

                                                                                                                  +

                                                                                                                  + + + +

                                                                                                                  +
                                                                                                                  ++++ + + + + + + + + + + + + + + + + + + +

                                                                                                                  Parameters:

                                                                                                                  ++++ + + + + + + + + + + +

                                                                                                                  binding

                                                                                                                  Specifies the bindings of placeholders to actual types.

                                                                                                                  other

                                                                                                                  The object to bind the reference to.

                                                                                                                  Requires:

                                                                                                                  The type stored in other must match the type expected by binding.

                                                                                                                  Postconditions:

                                                                                                                  binding_of(*this) == binding

                                                                                                                  Throws:

                                                                                                                  		Nothing.
                                                                                                                  +
                                                                                                                  11. +
                                                                                                                11. +
                                                                                                                  any & operator=(const any & other);
                                                                                                                  +

                                                                                                                  Assigns to an any.

                                                                                                                  +

                                                                                                                  If an appropriate overload of assignable is not available and relaxed is in Concept, falls back on constructing from other.

                                                                                                                  +

                                                                                                                  +

                                                                                                                  +
                                                                                                                  ++++ + + + + +

                                                                                                                  Throws:

                                                                                                                  		Whatever the assignment operator of the contained type throws. When falling back on construction, throws std::bad_alloc. In this case assignment provides the strong exception guarantee. When calling the assignment operator of the contained type, the exception guarantee is whatever the contained type provides.
                                                                                                                  +
                                                                                                                  12. +
                                                                                                                12. +
                                                                                                                  template<typename U> any & operator=(U & other);
                                                                                                                  +

                                                                                                                  Assigns to an any.

                                                                                                                  +

                                                                                                                  If an appropriate overload of assignable is not available and relaxed is in Concept, falls back on constructing from other.

                                                                                                                  +

                                                                                                                  +

                                                                                                                  +
                                                                                                                  ++++ + + + + +

                                                                                                                  Throws:

                                                                                                                  		Whatever the assignment operator of the contained type throws. When falling back on construction, throws std::bad_alloc. In this case assignment provides the strong exception guarantee. When calling the assignment operator of the contained type, the exception guarantee is whatever the contained type provides.
                                                                                                                  +
                                                                                                                  13. +
                                                                                                                13. +
                                                                                                                  template<typename U> any & operator=(const U & other);
                                                                                                                  +

                                                                                                                  Assigns to an any.

                                                                                                                  +

                                                                                                                  If an appropriate overload of assignable is not available and relaxed is in Concept, falls back on constructing from other.

                                                                                                                  +

                                                                                                                  +

                                                                                                                  +
                                                                                                                  ++++ + + + + +

                                                                                                                  Throws:

                                                                                                                  		Whatever the assignment operator of the contained type throws. When falling back on construction, throws std::bad_alloc. In this case assignment provides the strong exception guarantee. When calling the assignment operator of the contained type, the exception guarantee is whatever the contained type provides.
                                                                                                                  +
                                                                                                                  14. +
                                                                                                                +
                                                                                                                +
                                                                                                                +
                                                                                                                + + + +
                                                                                                                Copyright © 2011-2013 Steven Watanabe

                                                                                                                + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                                                +
                                                                                                                +
                                                                                                                +
                                                                                                                +PrevUpHomeNext +
                                                                                                                + + diff --git a/doc/html/boost/type_erasure/any_Conc_idm45506978000544.html b/doc/html/boost/type_erasure/any_Conc_idm45506978000544.html new file mode 100644 index 0000000000..1dba67e4ba --- /dev/null +++ b/doc/html/boost/type_erasure/any_Conc_idm45506978000544.html @@ -0,0 +1,546 @@ + + + + +Class template any<Concept, T &&> + + + + + + + + + + + + + + + +
                                                                                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                                                +
                                                                                                                +
                                                                                                                +PrevUpHomeNext +
                                                                                                                +
                                                                                                                +
                                                                                                                +
                                                                                                                +

                                                                                                                Class template any<Concept, T &&>

                                                                                                                +

                                                                                                                boost::type_erasure::any<Concept, T &&>

                                                                                                                +
                                                                                                                +

                                                                                                                Synopsis

                                                                                                                +
                                                                                                                // In header: <boost/type_erasure/any.hpp>
+
+template<typename Concept, typename T> 
+class any<Concept, T &&> {
+public:
+  // construct/copy/destruct
+  template<typename U> any(U &&);
+  template<typename U, typename Map> any(U &&, const static_binding< Map > &);
+  any(any< Concept, T > &&);
+  template<typename Concept2, typename Tag2> any(any< Concept2, Tag2 && > &&);
+  template<typename Concept2, typename Tag2> any(any< Concept2, Tag2 > &&);
+  template<typename Concept2, typename Tag2, typename Map> 
+    any(const any< Concept2, Tag2 && > &, const static_binding< Map > &);
+  template<typename Concept2, typename Tag2, typename Map> 
+    any(any< Concept2, Tag2 > &&, const static_binding< Map > &);
+  template<typename Concept2, typename Tag2> 
+    any(const any< Concept2, Tag2 && > &, const binding< Concept > &);
+  template<typename Concept2, typename Tag2> 
+    any(any< Concept2, Tag2 > &&, const binding< Concept > &);
+  any & operator=(const any &);
+  template<typename U> any & operator=(U &);
+  template<typename U> any & operator=(const U &);
+};
                                                                                                                +
                                                                                                                +

                                                                                                                Description

                                                                                                                +
                                                                                                                +

                                                                                                                +any + public + construct/copy/destruct

                                                                                                                +
                                                                                                                  +
                                                                                                                1. +
                                                                                                                  template<typename U> any(U && arg);
                                                                                                                  +

                                                                                                                  Constructs an any from a reference.

                                                                                                                  +

                                                                                                                  + + + +

                                                                                                                  +
                                                                                                                  ++++ + + + + + + + + + + + + + + + + + + +

                                                                                                                  Parameters:

                                                                                                                  ++++ + + + + +

                                                                                                                  arg

                                                                                                                  The object to bind the reference to.

                                                                                                                  Requires:

                                                                                                                  U is a model of Concept.

                                                                                                                  Requires:

                                                                                                                  Concept must not refer to any non-deduced placeholder besides T.

                                                                                                                  Throws:

                                                                                                                  		Nothing.
                                                                                                                  +
                                                                                                                  2. +
                                                                                                                2. +
                                                                                                                  template<typename U, typename Map> 
+  any(U && arg, const static_binding< Map > & binding);
                                                                                                                  +

                                                                                                                  Constructs an any from a reference.

                                                                                                                  +

                                                                                                                  + + + +

                                                                                                                  +
                                                                                                                  ++++ + + + + + + + + + + + + + + + + + + +

                                                                                                                  Parameters:

                                                                                                                  ++++ + + + + + + + + + + +

                                                                                                                  arg

                                                                                                                  The object to bind the reference to.

                                                                                                                  binding

                                                                                                                  Specifies the actual types that all the placeholders should bind to.

                                                                                                                  Requires:

                                                                                                                  U is a model of Concept.

                                                                                                                  Requires:

                                                                                                                  Map is an MPL map with an entry for every non-deduced placeholder referred to by Concept.

                                                                                                                  Throws:

                                                                                                                  		Nothing.
                                                                                                                  +
                                                                                                                  3. +
                                                                                                                3. +
                                                                                                                  any(any< Concept, T > && other);
                                                                                                                  +

                                                                                                                  Constructs an any from another rvalue reference.

                                                                                                                  +

                                                                                                                  + + + +

                                                                                                                  +
                                                                                                                  ++++ + + + + + + + + + + +

                                                                                                                  Parameters:

                                                                                                                  ++++ + + + + +

                                                                                                                  other

                                                                                                                  		 +

                                                                                                                  The reference to copy.

                                                                                                                  +

                                                                                                                  The object to bind the reference to.

                                                                                                                  +

                                                                                                                  Throws:

                                                                                                                  		 +

                                                                                                                  Nothing. Constructs an any from another any.

                                                                                                                  +

                                                                                                                  Nothing.

                                                                                                                  +
                                                                                                                  +
                                                                                                                  4. +
                                                                                                                4. +
                                                                                                                  template<typename Concept2, typename Tag2> 
+  any(any< Concept2, Tag2 && > && other);
                                                                                                                  +

                                                                                                                  Constructs an any from another rvalue reference.

                                                                                                                  +

                                                                                                                  + + + +

                                                                                                                  +
                                                                                                                  ++++ + + + + + + + + + + + + + + + + + + +

                                                                                                                  Parameters:

                                                                                                                  ++++ + + + + +

                                                                                                                  other

                                                                                                                  The reference to copy.

                                                                                                                  Requires:

                                                                                                                  Concept must not refer to any non-deduced placeholder besides T.

                                                                                                                  Requires:

                                                                                                                  After substituting T for Tag2, the requirements of Concept2 must be a superset of the requirements of Concept.

                                                                                                                  Throws:

                                                                                                                  		std::bad_alloc
                                                                                                                  +
                                                                                                                  5. +
                                                                                                                5. +
                                                                                                                  template<typename Concept2, typename Tag2> any(any< Concept2, Tag2 > && other);
                                                                                                                  +

                                                                                                                  Constructs an any from another any.

                                                                                                                  +

                                                                                                                  + + + +

                                                                                                                  +
                                                                                                                  ++++ + + + + + + + + + + + + + + + + + + +

                                                                                                                  Parameters:

                                                                                                                  ++++ + + + + +

                                                                                                                  other

                                                                                                                  The object to bind the reference to.

                                                                                                                  Requires:

                                                                                                                  Concept must not refer to any non-deduced placeholder besides T.

                                                                                                                  Requires:

                                                                                                                  After substituting T for Tag2, the requirements of Concept2 must be a superset of the requirements of Concept.

                                                                                                                  Throws:

                                                                                                                  		std::bad_alloc
                                                                                                                  +
                                                                                                                  6. +
                                                                                                                6. +
                                                                                                                  template<typename Concept2, typename Tag2, typename Map> 
+  any(const any< Concept2, Tag2 && > & other, 
+      const static_binding< Map > & binding);
                                                                                                                  +

                                                                                                                  Constructs an any from another reference.

                                                                                                                  +

                                                                                                                  + + + +

                                                                                                                  +
                                                                                                                  ++++ + + + + + + + + + + + + + + + + + + +

                                                                                                                  Parameters:

                                                                                                                  ++++ + + + + + + + + + + +

                                                                                                                  binding

                                                                                                                  Specifies the mapping between the two concepts.

                                                                                                                  other

                                                                                                                  The reference to copy.

                                                                                                                  Requires:

                                                                                                                  Map must be an MPL map with keys for all the non-deduced placeholders used by Concept and values for the corresponding placeholders in Concept2.

                                                                                                                  Requires:

                                                                                                                  After substituting placeholders according to Map, the requirements of Concept2 must be a superset of the requirements of Concept.

                                                                                                                  Throws:

                                                                                                                  		std::bad_alloc
                                                                                                                  +
                                                                                                                  7. +
                                                                                                                7. +
                                                                                                                  template<typename Concept2, typename Tag2, typename Map> 
+  any(any< Concept2, Tag2 > && other, const static_binding< Map > & binding);
                                                                                                                  +

                                                                                                                  Constructs an any from another any.

                                                                                                                  +

                                                                                                                  + + + +

                                                                                                                  +
                                                                                                                  ++++ + + + + + + + + + + + + + + + + + + +

                                                                                                                  Parameters:

                                                                                                                  ++++ + + + + + + + + + + +

                                                                                                                  binding

                                                                                                                  Specifies the mapping between the two concepts.

                                                                                                                  other

                                                                                                                  The object to bind the reference to.

                                                                                                                  Requires:

                                                                                                                  Map must be an MPL map with keys for all the non-deduced placeholders used by Concept and values for the corresponding placeholders in Concept2.

                                                                                                                  Requires:

                                                                                                                  After substituting placeholders according to Map, the requirements of Concept2 must be a superset of the requirements of Concept.

                                                                                                                  Throws:

                                                                                                                  		std::bad_alloc
                                                                                                                  +
                                                                                                                  8. +
                                                                                                                8. +
                                                                                                                  template<typename Concept2, typename Tag2> 
+  any(const any< Concept2, Tag2 && > & other, 
+      const binding< Concept > & binding);
                                                                                                                  +

                                                                                                                  Constructs an any from another rvalue reference.

                                                                                                                  +

                                                                                                                  + + + +

                                                                                                                  +
                                                                                                                  ++++ + + + + + + + + + + + + + + + + + + +

                                                                                                                  Parameters:

                                                                                                                  ++++ + + + + + + + + + + +

                                                                                                                  binding

                                                                                                                  Specifies the bindings of placeholders to actual types.

                                                                                                                  other

                                                                                                                  The reference to copy.

                                                                                                                  Requires:

                                                                                                                  The type stored in other must match the type expected by binding.

                                                                                                                  Postconditions:

                                                                                                                  binding_of(*this) == binding

                                                                                                                  Throws:

                                                                                                                  		Nothing.
                                                                                                                  +
                                                                                                                  9. +
                                                                                                                9. +
                                                                                                                  template<typename Concept2, typename Tag2> 
+  any(any< Concept2, Tag2 > && other, const binding< Concept > & binding);
                                                                                                                  +

                                                                                                                  Constructs an any from another any.

                                                                                                                  +

                                                                                                                  + + + +

                                                                                                                  +
                                                                                                                  ++++ + + + + + + + + + + + + + + + + + + +

                                                                                                                  Parameters:

                                                                                                                  ++++ + + + + + + + + + + +

                                                                                                                  binding

                                                                                                                  Specifies the bindings of placeholders to actual types.

                                                                                                                  other

                                                                                                                  The object to bind the reference to.

                                                                                                                  Requires:

                                                                                                                  The type stored in other must match the type expected by binding.

                                                                                                                  Postconditions:

                                                                                                                  binding_of(*this) == binding

                                                                                                                  Throws:

                                                                                                                  		Nothing.
                                                                                                                  +
                                                                                                                  10. +
                                                                                                                10. +
                                                                                                                  any & operator=(const any & other);
                                                                                                                  +

                                                                                                                  Assigns to an any.

                                                                                                                  +

                                                                                                                  If an appropriate overload of assignable is not available and relaxed is in Concept, falls back on constructing from other.

                                                                                                                  +

                                                                                                                  +

                                                                                                                  +
                                                                                                                  ++++ + + + + +

                                                                                                                  Throws:

                                                                                                                  		Whatever the assignment operator of the contained type throws. When falling back on construction, throws std::bad_alloc. In this case assignment provides the strong exception guarantee. When calling the assignment operator of the contained type, the exception guarantee is whatever the contained type provides.
                                                                                                                  +
                                                                                                                  11. +
                                                                                                                11. +
                                                                                                                  template<typename U> any & operator=(U & other);
                                                                                                                  +

                                                                                                                  Assigns to an any.

                                                                                                                  +

                                                                                                                  If an appropriate overload of assignable is not available and relaxed is in Concept, falls back on constructing from other.

                                                                                                                  +

                                                                                                                  +

                                                                                                                  +
                                                                                                                  ++++ + + + + +

                                                                                                                  Throws:

                                                                                                                  		Whatever the assignment operator of the contained type throws. When falling back on construction, throws std::bad_alloc. In this case assignment provides the strong exception guarantee. When calling the assignment operator of the contained type, the exception guarantee is whatever the contained type provides.
                                                                                                                  +
                                                                                                                  12. +
                                                                                                                12. +
                                                                                                                  template<typename U> any & operator=(const U & other);
                                                                                                                  +

                                                                                                                  Assigns to an any.

                                                                                                                  +

                                                                                                                  If an appropriate overload of assignable is not available and relaxed is in Concept, falls back on constructing from other.

                                                                                                                  +

                                                                                                                  +

                                                                                                                  +
                                                                                                                  ++++ + + + + +

                                                                                                                  Throws:

                                                                                                                  		Whatever the assignment operator of the contained type throws. When falling back on construction, throws std::bad_alloc. In this case assignment provides the strong exception guarantee. When calling the assignment operator of the contained type, the exception guarantee is whatever the contained type provides.
                                                                                                                  +
                                                                                                                  13. +
                                                                                                                +
                                                                                                                +
                                                                                                                +
                                                                                                                + + + +
                                                                                                                Copyright © 2011-2013 Steven Watanabe

                                                                                                                + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                                                +
                                                                                                                +
                                                                                                                +
                                                                                                                +PrevUpHomeNext +
                                                                                                                + + diff --git a/doc/html/boost/type_erasure/any_Conc_idm45506987109008.html b/doc/html/boost/type_erasure/any_Conc_idm45506987109008.html new file mode 100644 index 0000000000..0965d4aa99 --- /dev/null +++ b/doc/html/boost/type_erasure/any_Conc_idm45506987109008.html @@ -0,0 +1,487 @@ + + + + +Class template any<Concept, const T &> + + + + + + + + + + + + + + + +
                                                                                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                                                +
                                                                                                                +
                                                                                                                +PrevUpHomeNext +
                                                                                                                +
                                                                                                                +
                                                                                                                +
                                                                                                                +

                                                                                                                Class template any<Concept, const T &>

                                                                                                                +

                                                                                                                boost::type_erasure::any<Concept, const T &>

                                                                                                                +
                                                                                                                +

                                                                                                                Synopsis

                                                                                                                +
                                                                                                                // In header: <boost/type_erasure/any.hpp>
+
+template<typename Concept, typename T> 
+class any<Concept, const T &> {
+public:
+  // construct/copy/destruct
+  template<typename U> any(const U &);
+  template<typename U, typename Map> 
+    any(const U &, const static_binding< Map > &);
+  any(const any &);
+  any(const any< Concept, T & > &);
+  any(const any< Concept, T > &);
+  any(const any< Concept, T && > &);
+  template<typename Concept2, typename Tag2> 
+    any(const any< Concept2, Tag2 > &);
+  template<typename Concept2, typename Tag2, typename Map> 
+    any(const any< Concept2, Tag2 > &, const static_binding< Map > &);
+  template<typename Concept2, typename Tag2> 
+    any(const any< Concept2, Tag2 > &, const binding< Concept > &);
+  any & operator=(const any &);
+  template<typename U> any & operator=(const U &);
+};
                                                                                                                +
                                                                                                                +

                                                                                                                Description

                                                                                                                +
                                                                                                                +

                                                                                                                +any + public + construct/copy/destruct

                                                                                                                +
                                                                                                                  +
                                                                                                                1. +
                                                                                                                  template<typename U> any(const U & arg);
                                                                                                                  +

                                                                                                                  Constructs an any from a reference.

                                                                                                                  +

                                                                                                                  + + + +

                                                                                                                  +
                                                                                                                  ++++ + + + + + + + + + + + + + + + + + + +

                                                                                                                  Parameters:

                                                                                                                  ++++ + + + + +

                                                                                                                  arg

                                                                                                                  The object to bind the reference to.

                                                                                                                  Requires:

                                                                                                                  U is a model of Concept.

                                                                                                                  Requires:

                                                                                                                  Concept must not refer to any non-deduced placeholder besides T.

                                                                                                                  Throws:

                                                                                                                  		Nothing.
                                                                                                                  +
                                                                                                                  2. +
                                                                                                                2. +
                                                                                                                  template<typename U, typename Map> 
+  any(const U & arg, const static_binding< Map > & binding);
                                                                                                                  +

                                                                                                                  Constructs an any from a reference.

                                                                                                                  +

                                                                                                                  + + + +

                                                                                                                  +
                                                                                                                  ++++ + + + + + + + + + + + + + + + + + + +

                                                                                                                  Parameters:

                                                                                                                  ++++ + + + + + + + + + + +

                                                                                                                  arg

                                                                                                                  The object to bind the reference to.

                                                                                                                  binding

                                                                                                                  Specifies the actual types that all the placeholders should bind to.

                                                                                                                  Requires:

                                                                                                                  U is a model of Concept.

                                                                                                                  Requires:

                                                                                                                  Map is an MPL map with an entry for every non-deduced placeholder referred to by Concept.

                                                                                                                  Throws:

                                                                                                                  		Nothing.
                                                                                                                  +
                                                                                                                  3. +
                                                                                                                3. +
                                                                                                                  any(const any & other);
                                                                                                                  +

                                                                                                                  Constructs an any from another any.

                                                                                                                  +

                                                                                                                  + +

                                                                                                                  +
                                                                                                                  ++++ + + + + + + + + + + +

                                                                                                                  Parameters:

                                                                                                                  ++++ + + + + +

                                                                                                                  other

                                                                                                                  The reference to copy.

                                                                                                                  Throws:

                                                                                                                  		Nothing.
                                                                                                                  +
                                                                                                                  4. +
                                                                                                                4. +
                                                                                                                  any(const any< Concept, T & > & other);
                                                                                                                  +

                                                                                                                  Constructs an any from another any.

                                                                                                                  +

                                                                                                                  + +

                                                                                                                  +
                                                                                                                  ++++ + + + + + + + + + + +

                                                                                                                  Parameters:

                                                                                                                  ++++ + + + + +

                                                                                                                  other

                                                                                                                  The reference to copy.

                                                                                                                  Throws:

                                                                                                                  		Nothing.
                                                                                                                  +
                                                                                                                  5. +
                                                                                                                5. +
                                                                                                                  any(const any< Concept, T > & other);
                                                                                                                  +

                                                                                                                  Constructs an any from another any.

                                                                                                                  +

                                                                                                                  + +

                                                                                                                  +
                                                                                                                  ++++ + + + + + + + + + + +

                                                                                                                  Parameters:

                                                                                                                  ++++ + + + + +

                                                                                                                  other

                                                                                                                  The object to bind the reference to.

                                                                                                                  Throws:

                                                                                                                  		Nothing.
                                                                                                                  +
                                                                                                                  6. +
                                                                                                                6. +
                                                                                                                  any(const any< Concept, T && > & other);
                                                                                                                  +

                                                                                                                  Constructs an any from another any.

                                                                                                                  +

                                                                                                                  + +

                                                                                                                  +
                                                                                                                  ++++ + + + + + + + + + + +

                                                                                                                  Parameters:

                                                                                                                  ++++ + + + + +

                                                                                                                  other

                                                                                                                  The object to bind the reference to.

                                                                                                                  Throws:

                                                                                                                  		Nothing.
                                                                                                                  +
                                                                                                                  7. +
                                                                                                                7. +
                                                                                                                  template<typename Concept2, typename Tag2> 
+  any(const any< Concept2, Tag2 > & other);
                                                                                                                  +

                                                                                                                  Constructs an any from another any.

                                                                                                                  +

                                                                                                                  + + + +

                                                                                                                  +
                                                                                                                  ++++ + + + + + + + + + + + + + + + + + + +

                                                                                                                  Parameters:

                                                                                                                  ++++ + + + + +

                                                                                                                  other

                                                                                                                  The object to bind the reference to.

                                                                                                                  Requires:

                                                                                                                  Concept must not refer to any non-deduced placeholder besides T.

                                                                                                                  Requires:

                                                                                                                  After substituting T for Tag2, the requirements of Concept2 must be a superset of the requirements of Concept.

                                                                                                                  Throws:

                                                                                                                  		std::bad_alloc
                                                                                                                  +
                                                                                                                  8. +
                                                                                                                8. +
                                                                                                                  template<typename Concept2, typename Tag2, typename Map> 
+  any(const any< Concept2, Tag2 > & other, 
+      const static_binding< Map > & binding);
                                                                                                                  +

                                                                                                                  Constructs an any from another any.

                                                                                                                  +

                                                                                                                  + + + +

                                                                                                                  +
                                                                                                                  ++++ + + + + + + + + + + + + + + + + + + +

                                                                                                                  Parameters:

                                                                                                                  ++++ + + + + + + + + + + +

                                                                                                                  binding

                                                                                                                  Specifies the mapping between the two concepts.

                                                                                                                  other

                                                                                                                  The object to bind the reference to.

                                                                                                                  Requires:

                                                                                                                  Map must be an MPL map with keys for all the non-deduced placeholders used by Concept and values for the corresponding placeholders in Concept2.

                                                                                                                  Requires:

                                                                                                                  After substituting placeholders according to Map, the requirements of Concept2 must be a superset of the requirements of Concept.

                                                                                                                  Throws:

                                                                                                                  		std::bad_alloc
                                                                                                                  +
                                                                                                                  9. +
                                                                                                                9. +
                                                                                                                  template<typename Concept2, typename Tag2> 
+  any(const any< Concept2, Tag2 > & other, const binding< Concept > & binding);
                                                                                                                  +

                                                                                                                  Constructs an any from another any.

                                                                                                                  +

                                                                                                                  + + + +

                                                                                                                  +
                                                                                                                  ++++ + + + + + + + + + + + + + + + + + + +

                                                                                                                  Parameters:

                                                                                                                  ++++ + + + + + + + + + + +

                                                                                                                  binding

                                                                                                                  Specifies the bindings of placeholders to actual types.

                                                                                                                  other

                                                                                                                  The object to bind the reference to.

                                                                                                                  Requires:

                                                                                                                  The type stored in other must match the type expected by binding.

                                                                                                                  Postconditions:

                                                                                                                  binding_of(*this) == binding

                                                                                                                  Throws:

                                                                                                                  		Nothing.
                                                                                                                  +
                                                                                                                  10. +
                                                                                                                10. +
                                                                                                                  any & operator=(const any & other);
                                                                                                                  +

                                                                                                                  Assigns to an any.

                                                                                                                  +

                                                                                                                  + +

                                                                                                                  +
                                                                                                                  ++++ + + + + + + + + + + +

                                                                                                                  Requires:

                                                                                                                  relaxed is in Concept.

                                                                                                                  Throws:

                                                                                                                  		Nothing.
                                                                                                                  +
                                                                                                                  11. +
                                                                                                                11. +
                                                                                                                  template<typename U> any & operator=(const U & other);
                                                                                                                  +

                                                                                                                  Assigns to an any.

                                                                                                                  +

                                                                                                                  + +

                                                                                                                  +
                                                                                                                  ++++ + + + + + + + + + + +

                                                                                                                  Requires:

                                                                                                                  relaxed is in Concept.

                                                                                                                  Throws:

                                                                                                                  		std::bad_alloc. Provides the strong exception guarantee.
                                                                                                                  +
                                                                                                                  12. +
                                                                                                                +
                                                                                                                +
                                                                                                                +
                                                                                                                + + + +
                                                                                                                Copyright © 2011-2013 Steven Watanabe

                                                                                                                + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                                                +
                                                                                                                +
                                                                                                                +
                                                                                                                +PrevUpHomeNext +
                                                                                                                + + diff --git a/doc/html/boost/type_erasure/any_Concept___idp199875792.html b/doc/html/boost/type_erasure/any_Concept___idp199875792.html deleted file mode 100644 index 37437f7ac9..0000000000 --- a/doc/html/boost/type_erasure/any_Concept___idp199875792.html +++ /dev/null @@ -1,546 +0,0 @@ - - - - -Class template any<Concept, T &&> - - - - - - - - - - - - - - - -
                                                                                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                                                -
                                                                                                                -
                                                                                                                -PrevUpHomeNext -
                                                                                                                -
                                                                                                                -
                                                                                                                -
                                                                                                                -

                                                                                                                Class template any<Concept, T &&>

                                                                                                                -

                                                                                                                boost::type_erasure::any<Concept, T &&>

                                                                                                                -
                                                                                                                -

                                                                                                                Synopsis

                                                                                                                -
                                                                                                                // In header: <boost/type_erasure/any.hpp>
-
-template<typename Concept, typename T> 
-class any<Concept, T &&> {
-public:
-  // construct/copy/destruct
-  template<typename U> any(U &&);
-  template<typename U, typename Map> any(U &&, const static_binding< Map > &);
-  any(any< Concept, T > &&);
-  template<typename Concept2, typename Tag2> any(any< Concept2, Tag2 && > &&);
-  template<typename Concept2, typename Tag2> any(any< Concept2, Tag2 > &&);
-  template<typename Concept2, typename Tag2, typename Map> 
-    any(const any< Concept2, Tag2 && > &, const static_binding< Map > &);
-  template<typename Concept2, typename Tag2, typename Map> 
-    any(any< Concept2, Tag2 > &&, const static_binding< Map > &);
-  template<typename Concept2, typename Tag2> 
-    any(const any< Concept2, Tag2 && > &, const binding< Concept > &);
-  template<typename Concept2, typename Tag2> 
-    any(any< Concept2, Tag2 > &&, const binding< Concept > &);
-  any & operator=(const any &);
-  template<typename U> any & operator=(U &);
-  template<typename U> any & operator=(const U &);
-};
                                                                                                                -
                                                                                                                -

                                                                                                                Description

                                                                                                                -
                                                                                                                -

                                                                                                                -any - public - construct/copy/destruct

                                                                                                                -
                                                                                                                  -
                                                                                                                1. -
                                                                                                                  template<typename U> any(U && arg);
                                                                                                                  -

                                                                                                                  Constructs an any from a reference.

                                                                                                                  -

                                                                                                                  - - - -

                                                                                                                  -
                                                                                                                  ---- - - - - - - - - - - - - - - - - - - -

                                                                                                                  Parameters:

                                                                                                                  ---- - - - - -

                                                                                                                  arg

                                                                                                                  The object to bind the reference to.

                                                                                                                  Requires:

                                                                                                                  U is a model of Concept.

                                                                                                                  Requires:

                                                                                                                  Concept must not refer to any non-deduced placeholder besides T.

                                                                                                                  Throws:

                                                                                                                  		Nothing.
                                                                                                                  -
                                                                                                                  2. -
                                                                                                                2. -
                                                                                                                  template<typename U, typename Map> 
-  any(U && arg, const static_binding< Map > & binding);
                                                                                                                  -

                                                                                                                  Constructs an any from a reference.

                                                                                                                  -

                                                                                                                  - - - -

                                                                                                                  -
                                                                                                                  ---- - - - - - - - - - - - - - - - - - - -

                                                                                                                  Parameters:

                                                                                                                  ---- - - - - - - - - - - -

                                                                                                                  arg

                                                                                                                  The object to bind the reference to.

                                                                                                                  binding

                                                                                                                  Specifies the actual types that all the placeholders should bind to.

                                                                                                                  Requires:

                                                                                                                  U is a model of Concept.

                                                                                                                  Requires:

                                                                                                                  Map is an MPL map with an entry for every non-deduced placeholder referred to by Concept.

                                                                                                                  Throws:

                                                                                                                  		Nothing.
                                                                                                                  -
                                                                                                                  3. -
                                                                                                                3. -
                                                                                                                  any(any< Concept, T > && other);
                                                                                                                  -

                                                                                                                  Constructs an any from another rvalue reference.

                                                                                                                  -

                                                                                                                  - - - -

                                                                                                                  -
                                                                                                                  ---- - - - - - - - - - - -

                                                                                                                  Parameters:

                                                                                                                  ---- - - - - -

                                                                                                                  other

                                                                                                                  		 -

                                                                                                                  The reference to copy.

                                                                                                                  -

                                                                                                                  The object to bind the reference to.

                                                                                                                  -

                                                                                                                  Throws:

                                                                                                                  		 -

                                                                                                                  Nothing. Constructs an any from another any.

                                                                                                                  -

                                                                                                                  Nothing.

                                                                                                                  -
                                                                                                                  -
                                                                                                                  4. -
                                                                                                                4. -
                                                                                                                  template<typename Concept2, typename Tag2> 
-  any(any< Concept2, Tag2 && > && other);
                                                                                                                  -

                                                                                                                  Constructs an any from another rvalue reference.

                                                                                                                  -

                                                                                                                  - - - -

                                                                                                                  -
                                                                                                                  ---- - - - - - - - - - - - - - - - - - - -

                                                                                                                  Parameters:

                                                                                                                  ---- - - - - -

                                                                                                                  other

                                                                                                                  The reference to copy.

                                                                                                                  Requires:

                                                                                                                  Concept must not refer to any non-deduced placeholder besides T.

                                                                                                                  Requires:

                                                                                                                  After substituting T for Tag2, the requirements of Concept2 must be a superset of the requirements of Concept.

                                                                                                                  Throws:

                                                                                                                  		std::bad_alloc
                                                                                                                  -
                                                                                                                  5. -
                                                                                                                5. -
                                                                                                                  template<typename Concept2, typename Tag2> any(any< Concept2, Tag2 > && other);
                                                                                                                  -

                                                                                                                  Constructs an any from another any.

                                                                                                                  -

                                                                                                                  - - - -

                                                                                                                  -
                                                                                                                  ---- - - - - - - - - - - - - - - - - - - -

                                                                                                                  Parameters:

                                                                                                                  ---- - - - - -

                                                                                                                  other

                                                                                                                  The object to bind the reference to.

                                                                                                                  Requires:

                                                                                                                  Concept must not refer to any non-deduced placeholder besides T.

                                                                                                                  Requires:

                                                                                                                  After substituting T for Tag2, the requirements of Concept2 must be a superset of the requirements of Concept.

                                                                                                                  Throws:

                                                                                                                  		std::bad_alloc
                                                                                                                  -
                                                                                                                  6. -
                                                                                                                6. -
                                                                                                                  template<typename Concept2, typename Tag2, typename Map> 
-  any(const any< Concept2, Tag2 && > & other, 
-      const static_binding< Map > & binding);
                                                                                                                  -

                                                                                                                  Constructs an any from another reference.

                                                                                                                  -

                                                                                                                  - - - -

                                                                                                                  -
                                                                                                                  ---- - - - - - - - - - - - - - - - - - - -

                                                                                                                  Parameters:

                                                                                                                  ---- - - - - - - - - - - -

                                                                                                                  binding

                                                                                                                  Specifies the mapping between the two concepts.

                                                                                                                  other

                                                                                                                  The reference to copy.

                                                                                                                  Requires:

                                                                                                                  Map must be an MPL map with keys for all the non-deduced placeholders used by Concept and values for the corresponding placeholders in Concept2.

                                                                                                                  Requires:

                                                                                                                  After substituting placeholders according to Map, the requirements of Concept2 must be a superset of the requirements of Concept.

                                                                                                                  Throws:

                                                                                                                  		std::bad_alloc
                                                                                                                  -
                                                                                                                  7. -
                                                                                                                7. -
                                                                                                                  template<typename Concept2, typename Tag2, typename Map> 
-  any(any< Concept2, Tag2 > && other, const static_binding< Map > & binding);
                                                                                                                  -

                                                                                                                  Constructs an any from another any.

                                                                                                                  -

                                                                                                                  - - - -

                                                                                                                  -
                                                                                                                  ---- - - - - - - - - - - - - - - - - - - -

                                                                                                                  Parameters:

                                                                                                                  ---- - - - - - - - - - - -

                                                                                                                  binding

                                                                                                                  Specifies the mapping between the two concepts.

                                                                                                                  other

                                                                                                                  The object to bind the reference to.

                                                                                                                  Requires:

                                                                                                                  Map must be an MPL map with keys for all the non-deduced placeholders used by Concept and values for the corresponding placeholders in Concept2.

                                                                                                                  Requires:

                                                                                                                  After substituting placeholders according to Map, the requirements of Concept2 must be a superset of the requirements of Concept.

                                                                                                                  Throws:

                                                                                                                  		std::bad_alloc
                                                                                                                  -
                                                                                                                  8. -
                                                                                                                8. -
                                                                                                                  template<typename Concept2, typename Tag2> 
-  any(const any< Concept2, Tag2 && > & other, 
-      const binding< Concept > & binding);
                                                                                                                  -

                                                                                                                  Constructs an any from another rvalue reference.

                                                                                                                  -

                                                                                                                  - - - -

                                                                                                                  -
                                                                                                                  ---- - - - - - - - - - - - - - - - - - - -

                                                                                                                  Parameters:

                                                                                                                  ---- - - - - - - - - - - -

                                                                                                                  binding

                                                                                                                  Specifies the bindings of placeholders to actual types.

                                                                                                                  other

                                                                                                                  The reference to copy.

                                                                                                                  Requires:

                                                                                                                  The type stored in other must match the type expected by binding.

                                                                                                                  Postconditions:

                                                                                                                  binding_of(*this) == binding

                                                                                                                  Throws:

                                                                                                                  		Nothing.
                                                                                                                  -
                                                                                                                  9. -
                                                                                                                9. -
                                                                                                                  template<typename Concept2, typename Tag2> 
-  any(any< Concept2, Tag2 > && other, const binding< Concept > & binding);
                                                                                                                  -

                                                                                                                  Constructs an any from another any.

                                                                                                                  -

                                                                                                                  - - - -

                                                                                                                  -
                                                                                                                  ---- - - - - - - - - - - - - - - - - - - -

                                                                                                                  Parameters:

                                                                                                                  ---- - - - - - - - - - - -

                                                                                                                  binding

                                                                                                                  Specifies the bindings of placeholders to actual types.

                                                                                                                  other

                                                                                                                  The object to bind the reference to.

                                                                                                                  Requires:

                                                                                                                  The type stored in other must match the type expected by binding.

                                                                                                                  Postconditions:

                                                                                                                  binding_of(*this) == binding

                                                                                                                  Throws:

                                                                                                                  		Nothing.
                                                                                                                  -
                                                                                                                  10. -
                                                                                                                10. -
                                                                                                                  any & operator=(const any & other);
                                                                                                                  -

                                                                                                                  Assigns to an any.

                                                                                                                  -

                                                                                                                  If an appropriate overload of assignable is not available and relaxed is in Concept, falls back on constructing from other.

                                                                                                                  -

                                                                                                                  -

                                                                                                                  -
                                                                                                                  ---- - - - - -

                                                                                                                  Throws:

                                                                                                                  		Whatever the assignment operator of the contained type throws. When falling back on construction, throws std::bad_alloc. In this case assignment provides the strong exception guarantee. When calling the assignment operator of the contained type, the exception guarantee is whatever the contained type provides.
                                                                                                                  -
                                                                                                                  11. -
                                                                                                                11. -
                                                                                                                  template<typename U> any & operator=(U & other);
                                                                                                                  -

                                                                                                                  Assigns to an any.

                                                                                                                  -

                                                                                                                  If an appropriate overload of assignable is not available and relaxed is in Concept, falls back on constructing from other.

                                                                                                                  -

                                                                                                                  -

                                                                                                                  -
                                                                                                                  ---- - - - - -

                                                                                                                  Throws:

                                                                                                                  		Whatever the assignment operator of the contained type throws. When falling back on construction, throws std::bad_alloc. In this case assignment provides the strong exception guarantee. When calling the assignment operator of the contained type, the exception guarantee is whatever the contained type provides.
                                                                                                                  -
                                                                                                                  12. -
                                                                                                                12. -
                                                                                                                  template<typename U> any & operator=(const U & other);
                                                                                                                  -

                                                                                                                  Assigns to an any.

                                                                                                                  -

                                                                                                                  If an appropriate overload of assignable is not available and relaxed is in Concept, falls back on constructing from other.

                                                                                                                  -

                                                                                                                  -

                                                                                                                  -
                                                                                                                  ---- - - - - -

                                                                                                                  Throws:

                                                                                                                  		Whatever the assignment operator of the contained type throws. When falling back on construction, throws std::bad_alloc. In this case assignment provides the strong exception guarantee. When calling the assignment operator of the contained type, the exception guarantee is whatever the contained type provides.
                                                                                                                  -
                                                                                                                  13. -
                                                                                                                -
                                                                                                                -
                                                                                                                -
                                                                                                                - - - -
                                                                                                                Copyright © 2011-2013 Steven Watanabe

                                                                                                                - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                                                -
                                                                                                                -
                                                                                                                -
                                                                                                                -PrevUpHomeNext -
                                                                                                                - - diff --git a/doc/html/boost/type_erasure/any_Concept___idp305335072.html b/doc/html/boost/type_erasure/any_Concept___idp305335072.html deleted file mode 100644 index 79c03a89bc..0000000000 --- a/doc/html/boost/type_erasure/any_Concept___idp305335072.html +++ /dev/null @@ -1,487 +0,0 @@ - - - - -Class template any<Concept, const T &> - - - - - - - - - - - - - - - -
                                                                                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                                                -
                                                                                                                -
                                                                                                                -PrevUpHomeNext -
                                                                                                                -
                                                                                                                -
                                                                                                                -
                                                                                                                -

                                                                                                                Class template any<Concept, const T &>

                                                                                                                -

                                                                                                                boost::type_erasure::any<Concept, const T &>

                                                                                                                -
                                                                                                                -

                                                                                                                Synopsis

                                                                                                                -
                                                                                                                // In header: <boost/type_erasure/any.hpp>
-
-template<typename Concept, typename T> 
-class any<Concept, const T &> {
-public:
-  // construct/copy/destruct
-  template<typename U> any(const U &);
-  template<typename U, typename Map> 
-    any(const U &, const static_binding< Map > &);
-  any(const any &);
-  any(const any< Concept, T & > &);
-  any(const any< Concept, T > &);
-  any(const any< Concept, T && > &);
-  template<typename Concept2, typename Tag2> 
-    any(const any< Concept2, Tag2 > &);
-  template<typename Concept2, typename Tag2, typename Map> 
-    any(const any< Concept2, Tag2 > &, const static_binding< Map > &);
-  template<typename Concept2, typename Tag2> 
-    any(const any< Concept2, Tag2 > &, const binding< Concept > &);
-  any & operator=(const any &);
-  template<typename U> any & operator=(const U &);
-};
                                                                                                                -
                                                                                                                -

                                                                                                                Description

                                                                                                                -
                                                                                                                -

                                                                                                                -any - public - construct/copy/destruct

                                                                                                                -
                                                                                                                  -
                                                                                                                1. -
                                                                                                                  template<typename U> any(const U & arg);
                                                                                                                  -

                                                                                                                  Constructs an any from a reference.

                                                                                                                  -

                                                                                                                  - - - -

                                                                                                                  -
                                                                                                                  ---- - - - - - - - - - - - - - - - - - - -

                                                                                                                  Parameters:

                                                                                                                  ---- - - - - -

                                                                                                                  arg

                                                                                                                  The object to bind the reference to.

                                                                                                                  Requires:

                                                                                                                  U is a model of Concept.

                                                                                                                  Requires:

                                                                                                                  Concept must not refer to any non-deduced placeholder besides T.

                                                                                                                  Throws:

                                                                                                                  		Nothing.
                                                                                                                  -
                                                                                                                  2. -
                                                                                                                2. -
                                                                                                                  template<typename U, typename Map> 
-  any(const U & arg, const static_binding< Map > & binding);
                                                                                                                  -

                                                                                                                  Constructs an any from a reference.

                                                                                                                  -

                                                                                                                  - - - -

                                                                                                                  -
                                                                                                                  ---- - - - - - - - - - - - - - - - - - - -

                                                                                                                  Parameters:

                                                                                                                  ---- - - - - - - - - - - -

                                                                                                                  arg

                                                                                                                  The object to bind the reference to.

                                                                                                                  binding

                                                                                                                  Specifies the actual types that all the placeholders should bind to.

                                                                                                                  Requires:

                                                                                                                  U is a model of Concept.

                                                                                                                  Requires:

                                                                                                                  Map is an MPL map with an entry for every non-deduced placeholder referred to by Concept.

                                                                                                                  Throws:

                                                                                                                  		Nothing.
                                                                                                                  -
                                                                                                                  3. -
                                                                                                                3. -
                                                                                                                  any(const any & other);
                                                                                                                  -

                                                                                                                  Constructs an any from another any.

                                                                                                                  -

                                                                                                                  - -

                                                                                                                  -
                                                                                                                  ---- - - - - - - - - - - -

                                                                                                                  Parameters:

                                                                                                                  ---- - - - - -

                                                                                                                  other

                                                                                                                  The reference to copy.

                                                                                                                  Throws:

                                                                                                                  		Nothing.
                                                                                                                  -
                                                                                                                  4. -
                                                                                                                4. -
                                                                                                                  any(const any< Concept, T & > & other);
                                                                                                                  -

                                                                                                                  Constructs an any from another any.

                                                                                                                  -

                                                                                                                  - -

                                                                                                                  -
                                                                                                                  ---- - - - - - - - - - - -

                                                                                                                  Parameters:

                                                                                                                  ---- - - - - -

                                                                                                                  other

                                                                                                                  The reference to copy.

                                                                                                                  Throws:

                                                                                                                  		Nothing.
                                                                                                                  -
                                                                                                                  5. -
                                                                                                                5. -
                                                                                                                  any(const any< Concept, T > & other);
                                                                                                                  -

                                                                                                                  Constructs an any from another any.

                                                                                                                  -

                                                                                                                  - -

                                                                                                                  -
                                                                                                                  ---- - - - - - - - - - - -

                                                                                                                  Parameters:

                                                                                                                  ---- - - - - -

                                                                                                                  other

                                                                                                                  The object to bind the reference to.

                                                                                                                  Throws:

                                                                                                                  		Nothing.
                                                                                                                  -
                                                                                                                  6. -
                                                                                                                6. -
                                                                                                                  any(const any< Concept, T && > & other);
                                                                                                                  -

                                                                                                                  Constructs an any from another any.

                                                                                                                  -

                                                                                                                  - -

                                                                                                                  -
                                                                                                                  ---- - - - - - - - - - - -

                                                                                                                  Parameters:

                                                                                                                  ---- - - - - -

                                                                                                                  other

                                                                                                                  The object to bind the reference to.

                                                                                                                  Throws:

                                                                                                                  		Nothing.
                                                                                                                  -
                                                                                                                  7. -
                                                                                                                7. -
                                                                                                                  template<typename Concept2, typename Tag2> 
-  any(const any< Concept2, Tag2 > & other);
                                                                                                                  -

                                                                                                                  Constructs an any from another any.

                                                                                                                  -

                                                                                                                  - - - -

                                                                                                                  -
                                                                                                                  ---- - - - - - - - - - - - - - - - - - - -

                                                                                                                  Parameters:

                                                                                                                  ---- - - - - -

                                                                                                                  other

                                                                                                                  The object to bind the reference to.

                                                                                                                  Requires:

                                                                                                                  Concept must not refer to any non-deduced placeholder besides T.

                                                                                                                  Requires:

                                                                                                                  After substituting T for Tag2, the requirements of Concept2 must be a superset of the requirements of Concept.

                                                                                                                  Throws:

                                                                                                                  		std::bad_alloc
                                                                                                                  -
                                                                                                                  8. -
                                                                                                                8. -
                                                                                                                  template<typename Concept2, typename Tag2, typename Map> 
-  any(const any< Concept2, Tag2 > & other, 
-      const static_binding< Map > & binding);
                                                                                                                  -

                                                                                                                  Constructs an any from another any.

                                                                                                                  -

                                                                                                                  - - - -

                                                                                                                  -
                                                                                                                  ---- - - - - - - - - - - - - - - - - - - -

                                                                                                                  Parameters:

                                                                                                                  ---- - - - - - - - - - - -

                                                                                                                  binding

                                                                                                                  Specifies the mapping between the two concepts.

                                                                                                                  other

                                                                                                                  The object to bind the reference to.

                                                                                                                  Requires:

                                                                                                                  Map must be an MPL map with keys for all the non-deduced placeholders used by Concept and values for the corresponding placeholders in Concept2.

                                                                                                                  Requires:

                                                                                                                  After substituting placeholders according to Map, the requirements of Concept2 must be a superset of the requirements of Concept.

                                                                                                                  Throws:

                                                                                                                  		std::bad_alloc
                                                                                                                  -
                                                                                                                  9. -
                                                                                                                9. -
                                                                                                                  template<typename Concept2, typename Tag2> 
-  any(const any< Concept2, Tag2 > & other, const binding< Concept > & binding);
                                                                                                                  -

                                                                                                                  Constructs an any from another any.

                                                                                                                  -

                                                                                                                  - - - -

                                                                                                                  -
                                                                                                                  ---- - - - - - - - - - - - - - - - - - - -

                                                                                                                  Parameters:

                                                                                                                  ---- - - - - - - - - - - -

                                                                                                                  binding

                                                                                                                  Specifies the bindings of placeholders to actual types.

                                                                                                                  other

                                                                                                                  The object to bind the reference to.

                                                                                                                  Requires:

                                                                                                                  The type stored in other must match the type expected by binding.

                                                                                                                  Postconditions:

                                                                                                                  binding_of(*this) == binding

                                                                                                                  Throws:

                                                                                                                  		Nothing.
                                                                                                                  -
                                                                                                                  10. -
                                                                                                                10. -
                                                                                                                  any & operator=(const any & other);
                                                                                                                  -

                                                                                                                  Assigns to an any.

                                                                                                                  -

                                                                                                                  - -

                                                                                                                  -
                                                                                                                  ---- - - - - - - - - - - -

                                                                                                                  Requires:

                                                                                                                  relaxed is in Concept.

                                                                                                                  Throws:

                                                                                                                  		Nothing.
                                                                                                                  -
                                                                                                                  11. -
                                                                                                                11. -
                                                                                                                  template<typename U> any & operator=(const U & other);
                                                                                                                  -

                                                                                                                  Assigns to an any.

                                                                                                                  -

                                                                                                                  - -

                                                                                                                  -
                                                                                                                  ---- - - - - - - - - - - -

                                                                                                                  Requires:

                                                                                                                  relaxed is in Concept.

                                                                                                                  Throws:

                                                                                                                  		std::bad_alloc. Provides the strong exception guarantee.
                                                                                                                  -
                                                                                                                  12. -
                                                                                                                -
                                                                                                                -
                                                                                                                -
                                                                                                                - - - -
                                                                                                                Copyright © 2011-2013 Steven Watanabe

                                                                                                                - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                                                -
                                                                                                                -
                                                                                                                -
                                                                                                                -PrevUpHomeNext -
                                                                                                                - - diff --git a/doc/html/boost/type_erasure/any_Concept___idp307465440.html b/doc/html/boost/type_erasure/any_Concept___idp307465440.html deleted file mode 100644 index 625dc3be9a..0000000000 --- a/doc/html/boost/type_erasure/any_Concept___idp307465440.html +++ /dev/null @@ -1,572 +0,0 @@ - - - - -Class template any<Concept, T &> - - - - - - - - - - - - - - - -
                                                                                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                                                -
                                                                                                                -
                                                                                                                -PrevUpHomeNext -
                                                                                                                -
                                                                                                                -
                                                                                                                -
                                                                                                                -

                                                                                                                Class template any<Concept, T &>

                                                                                                                -

                                                                                                                boost::type_erasure::any<Concept, T &>

                                                                                                                -
                                                                                                                -

                                                                                                                Synopsis

                                                                                                                -
                                                                                                                // In header: <boost/type_erasure/any.hpp>
-
-template<typename Concept, typename T> 
-class any<Concept, T &> {
-public:
-  // construct/copy/destruct
-  template<typename U> any(U &);
-  template<typename U, typename Map> any(U &, const static_binding< Map > &);
-  any(const any &);
-  any(any< Concept, T > &);
-  template<typename Concept2, typename Tag2> 
-    any(const any< Concept2, Tag2 & > &);
-  template<typename Concept2, typename Tag2> any(any< Concept2, Tag2 > &);
-  template<typename Concept2, typename Tag2, typename Map> 
-    any(const any< Concept2, Tag2 & > &, const static_binding< Map > &);
-  template<typename Concept2, typename Tag2, typename Map> 
-    any(any< Concept2, Tag2 > &, const static_binding< Map > &);
-  template<typename Concept2, typename Tag2> 
-    any(const any< Concept2, Tag2 & > &, const binding< Concept > &);
-  template<typename Concept2, typename Tag2> 
-    any(any< Concept2, Tag2 > &, const binding< Concept > &);
-  any & operator=(const any &);
-  template<typename U> any & operator=(U &);
-  template<typename U> any & operator=(const U &);
-};
                                                                                                                -
                                                                                                                -

                                                                                                                Description

                                                                                                                -
                                                                                                                -

                                                                                                                -any - public - construct/copy/destruct

                                                                                                                -
                                                                                                                  -
                                                                                                                1. -
                                                                                                                  template<typename U> any(U & arg);
                                                                                                                  -

                                                                                                                  Constructs an any from a reference.

                                                                                                                  -

                                                                                                                  - - - -

                                                                                                                  -
                                                                                                                  ---- - - - - - - - - - - - - - - - - - - -

                                                                                                                  Parameters:

                                                                                                                  ---- - - - - -

                                                                                                                  arg

                                                                                                                  The object to bind the reference to.

                                                                                                                  Requires:

                                                                                                                  U is a model of Concept.

                                                                                                                  Requires:

                                                                                                                  Concept must not refer to any non-deduced placeholder besides T.

                                                                                                                  Throws:

                                                                                                                  		Nothing.
                                                                                                                  -
                                                                                                                  2. -
                                                                                                                2. -
                                                                                                                  template<typename U, typename Map> 
-  any(U & arg, const static_binding< Map > & binding);
                                                                                                                  -

                                                                                                                  Constructs an any from a reference.

                                                                                                                  -

                                                                                                                  - - - -

                                                                                                                  -
                                                                                                                  ---- - - - - - - - - - - - - - - - - - - -

                                                                                                                  Parameters:

                                                                                                                  ---- - - - - - - - - - - -

                                                                                                                  arg

                                                                                                                  The object to bind the reference to.

                                                                                                                  binding

                                                                                                                  Specifies the actual types that all the placeholders should bind to.

                                                                                                                  Requires:

                                                                                                                  U is a model of Concept.

                                                                                                                  Requires:

                                                                                                                  Map is an MPL map with an entry for every non-deduced placeholder referred to by Concept.

                                                                                                                  Throws:

                                                                                                                  		Nothing.
                                                                                                                  -
                                                                                                                  3. -
                                                                                                                3. -
                                                                                                                  any(const any & other);
                                                                                                                  -

                                                                                                                  Constructs an any from another reference.

                                                                                                                  -

                                                                                                                  - -

                                                                                                                  -
                                                                                                                  ---- - - - - - - - - - - -

                                                                                                                  Parameters:

                                                                                                                  ---- - - - - -

                                                                                                                  other

                                                                                                                  The reference to copy.

                                                                                                                  Throws:

                                                                                                                  		Nothing.
                                                                                                                  -
                                                                                                                  4. -
                                                                                                                4. -
                                                                                                                  any(any< Concept, T > & other);
                                                                                                                  -

                                                                                                                  Constructs an any from another any.

                                                                                                                  -

                                                                                                                  - -

                                                                                                                  -
                                                                                                                  ---- - - - - - - - - - - -

                                                                                                                  Parameters:

                                                                                                                  ---- - - - - -

                                                                                                                  other

                                                                                                                  The object to bind the reference to.

                                                                                                                  Throws:

                                                                                                                  		Nothing.
                                                                                                                  -
                                                                                                                  5. -
                                                                                                                5. -
                                                                                                                  template<typename Concept2, typename Tag2> 
-  any(const any< Concept2, Tag2 & > & other);
                                                                                                                  -

                                                                                                                  Constructs an any from another reference.

                                                                                                                  -

                                                                                                                  - - - -

                                                                                                                  -
                                                                                                                  ---- - - - - - - - - - - - - - - - - - - -

                                                                                                                  Parameters:

                                                                                                                  ---- - - - - -

                                                                                                                  other

                                                                                                                  The reference to copy.

                                                                                                                  Requires:

                                                                                                                  Concept must not refer to any non-deduced placeholder besides T.

                                                                                                                  Requires:

                                                                                                                  After substituting T for Tag2, the requirements of Concept2 must be a superset of the requirements of Concept.

                                                                                                                  Throws:

                                                                                                                  		std::bad_alloc
                                                                                                                  -
                                                                                                                  6. -
                                                                                                                6. -
                                                                                                                  template<typename Concept2, typename Tag2> any(any< Concept2, Tag2 > & other);
                                                                                                                  -

                                                                                                                  Constructs an any from another any.

                                                                                                                  -

                                                                                                                  - - - -

                                                                                                                  -
                                                                                                                  ---- - - - - - - - - - - - - - - - - - - -

                                                                                                                  Parameters:

                                                                                                                  ---- - - - - -

                                                                                                                  other

                                                                                                                  The object to bind the reference to.

                                                                                                                  Requires:

                                                                                                                  Concept must not refer to any non-deduced placeholder besides T.

                                                                                                                  Requires:

                                                                                                                  After substituting T for Tag2, the requirements of Concept2 must be a superset of the requirements of Concept.

                                                                                                                  Throws:

                                                                                                                  		std::bad_alloc
                                                                                                                  -
                                                                                                                  7. -
                                                                                                                7. -
                                                                                                                  template<typename Concept2, typename Tag2, typename Map> 
-  any(const any< Concept2, Tag2 & > & other, 
-      const static_binding< Map > & binding);
                                                                                                                  -

                                                                                                                  Constructs an any from another reference.

                                                                                                                  -

                                                                                                                  - - - -

                                                                                                                  -
                                                                                                                  ---- - - - - - - - - - - - - - - - - - - -

                                                                                                                  Parameters:

                                                                                                                  ---- - - - - - - - - - - -

                                                                                                                  binding

                                                                                                                  Specifies the mapping between the two concepts.

                                                                                                                  other

                                                                                                                  The reference to copy.

                                                                                                                  Requires:

                                                                                                                  Map must be an MPL map with keys for all the non-deduced placeholders used by Concept and values for the corresponding placeholders in Concept2.

                                                                                                                  Requires:

                                                                                                                  After substituting placeholders according to Map, the requirements of Concept2 must be a superset of the requirements of Concept.

                                                                                                                  Throws:

                                                                                                                  		std::bad_alloc
                                                                                                                  -
                                                                                                                  8. -
                                                                                                                8. -
                                                                                                                  template<typename Concept2, typename Tag2, typename Map> 
-  any(any< Concept2, Tag2 > & other, const static_binding< Map > & binding);
                                                                                                                  -

                                                                                                                  Constructs an any from another any.

                                                                                                                  -

                                                                                                                  - - - -

                                                                                                                  -
                                                                                                                  ---- - - - - - - - - - - - - - - - - - - -

                                                                                                                  Parameters:

                                                                                                                  ---- - - - - - - - - - - -

                                                                                                                  binding

                                                                                                                  Specifies the mapping between the two concepts.

                                                                                                                  other

                                                                                                                  The object to bind the reference to.

                                                                                                                  Requires:

                                                                                                                  Map must be an MPL map with keys for all the non-deduced placeholders used by Concept and values for the corresponding placeholders in Concept2.

                                                                                                                  Requires:

                                                                                                                  After substituting placeholders according to Map, the requirements of Concept2 must be a superset of the requirements of Concept.

                                                                                                                  Throws:

                                                                                                                  		std::bad_alloc
                                                                                                                  -
                                                                                                                  9. -
                                                                                                                9. -
                                                                                                                  template<typename Concept2, typename Tag2> 
-  any(const any< Concept2, Tag2 & > & other, 
-      const binding< Concept > & binding);
                                                                                                                  -

                                                                                                                  Constructs an any from another reference.

                                                                                                                  -

                                                                                                                  - - - -

                                                                                                                  -
                                                                                                                  ---- - - - - - - - - - - - - - - - - - - -

                                                                                                                  Parameters:

                                                                                                                  ---- - - - - - - - - - - -

                                                                                                                  binding

                                                                                                                  Specifies the bindings of placeholders to actual types.

                                                                                                                  other

                                                                                                                  The reference to copy.

                                                                                                                  Requires:

                                                                                                                  The type stored in other must match the type expected by binding.

                                                                                                                  Postconditions:

                                                                                                                  binding_of(*this) == binding

                                                                                                                  Throws:

                                                                                                                  		Nothing.
                                                                                                                  -
                                                                                                                  10. -
                                                                                                                10. -
                                                                                                                  template<typename Concept2, typename Tag2> 
-  any(any< Concept2, Tag2 > & other, const binding< Concept > & binding);
                                                                                                                  -

                                                                                                                  Constructs an any from another any.

                                                                                                                  -

                                                                                                                  - - - -

                                                                                                                  -
                                                                                                                  ---- - - - - - - - - - - - - - - - - - - -

                                                                                                                  Parameters:

                                                                                                                  ---- - - - - - - - - - - -

                                                                                                                  binding

                                                                                                                  Specifies the bindings of placeholders to actual types.

                                                                                                                  other

                                                                                                                  The object to bind the reference to.

                                                                                                                  Requires:

                                                                                                                  The type stored in other must match the type expected by binding.

                                                                                                                  Postconditions:

                                                                                                                  binding_of(*this) == binding

                                                                                                                  Throws:

                                                                                                                  		Nothing.
                                                                                                                  -
                                                                                                                  11. -
                                                                                                                11. -
                                                                                                                  any & operator=(const any & other);
                                                                                                                  -

                                                                                                                  Assigns to an any.

                                                                                                                  -

                                                                                                                  If an appropriate overload of assignable is not available and relaxed is in Concept, falls back on constructing from other.

                                                                                                                  -

                                                                                                                  -

                                                                                                                  -
                                                                                                                  ---- - - - - -

                                                                                                                  Throws:

                                                                                                                  		Whatever the assignment operator of the contained type throws. When falling back on construction, throws std::bad_alloc. In this case assignment provides the strong exception guarantee. When calling the assignment operator of the contained type, the exception guarantee is whatever the contained type provides.
                                                                                                                  -
                                                                                                                  12. -
                                                                                                                12. -
                                                                                                                  template<typename U> any & operator=(U & other);
                                                                                                                  -

                                                                                                                  Assigns to an any.

                                                                                                                  -

                                                                                                                  If an appropriate overload of assignable is not available and relaxed is in Concept, falls back on constructing from other.

                                                                                                                  -

                                                                                                                  -

                                                                                                                  -
                                                                                                                  ---- - - - - -

                                                                                                                  Throws:

                                                                                                                  		Whatever the assignment operator of the contained type throws. When falling back on construction, throws std::bad_alloc. In this case assignment provides the strong exception guarantee. When calling the assignment operator of the contained type, the exception guarantee is whatever the contained type provides.
                                                                                                                  -
                                                                                                                  13. -
                                                                                                                13. -
                                                                                                                  template<typename U> any & operator=(const U & other);
                                                                                                                  -

                                                                                                                  Assigns to an any.

                                                                                                                  -

                                                                                                                  If an appropriate overload of assignable is not available and relaxed is in Concept, falls back on constructing from other.

                                                                                                                  -

                                                                                                                  -

                                                                                                                  -
                                                                                                                  ---- - - - - -

                                                                                                                  Throws:

                                                                                                                  		Whatever the assignment operator of the contained type throws. When falling back on construction, throws std::bad_alloc. In this case assignment provides the strong exception guarantee. When calling the assignment operator of the contained type, the exception guarantee is whatever the contained type provides.
                                                                                                                  -
                                                                                                                  14. -
                                                                                                                -
                                                                                                                -
                                                                                                                -
                                                                                                                - - - -
                                                                                                                Copyright © 2011-2013 Steven Watanabe

                                                                                                                - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                                                -
                                                                                                                -
                                                                                                                -
                                                                                                                -PrevUpHomeNext -
                                                                                                                - - diff --git a/doc/html/boost/type_erasure/any_cast_idm45506900398752.html b/doc/html/boost/type_erasure/any_cast_idm45506900398752.html new file mode 100644 index 0000000000..710339c01d --- /dev/null +++ b/doc/html/boost/type_erasure/any_cast_idm45506900398752.html @@ -0,0 +1,95 @@ + + + + +Function any_cast + + + + + + + + + + + + + + + +
                                                                                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                                                +
                                                                                                                +
                                                                                                                +PrevUpHomeNext +
                                                                                                                +
                                                                                                                +
                                                                                                                +
                                                                                                                +

                                                                                                                Function any_cast

                                                                                                                +

                                                                                                                boost::type_erasure::any_cast

                                                                                                                +
                                                                                                                +

                                                                                                                Synopsis

                                                                                                                +
                                                                                                                // In header: <boost/type_erasure/any_cast.hpp>
+
+
+template<typename T, typename Concept, typename Tag> 
+  T any_cast(any< Concept, Tag > & arg);
+template<typename T, typename Concept, typename Tag> 
+  T any_cast(const any< Concept, Tag > & arg);
+template<typename T, typename Concept, typename Tag> 
+  T any_cast(any< Concept, Tag > * arg);
+template<typename T, typename Concept, typename Tag> 
+  T any_cast(const any< Concept, Tag > * arg);
                                                                                                                +
                                                                                                                +

                                                                                                                Description

                                                                                                                +

                                                                                                                Attempts to extract the object that arg holds. If casting to a pointer fails, any_cast returns a null pointer. Casting to void* always succeeds and returns the address of stored object.

                                                                                                                +
                                                                                                                any<mpl::vector<typeid_<>, copy_constructible<> > > x(1);
+any_cast<int>(x);      // returns 1
+any_cast<int&>(x);     // returns a reference to the contents of x
+any_cast<double>(x);   // throws bad_any_cast
+any_cast<int*>(&x);    // returns a pointer to the contents of x
+any_cast<void*>(&x);   // returns a pointer to the contents of x
+any_cast<double*>(&x); // returns NULL
+
                                                                                                                +

                                                                                                                + + +

                                                                                                                +
                                                                                                                ++++ + + + + + + + + + + + + + + +

                                                                                                                Requires:

                                                                                                                if arg is a pointer, T must be a pointer type.

                                                                                                                Requires:

                                                                                                                Concept must contain typeid_<Tag>.

                                                                                                                Throws:

                                                                                                                		 +bad_any_cast if arg doesn't contain an object of type T and we're casting to a value or reference.
                                                                                                                +
                                                                                                                +
                                                                                                                + + + +
                                                                                                                Copyright © 2011-2013 Steven Watanabe

                                                                                                                + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                                                +
                                                                                                                +
                                                                                                                +
                                                                                                                +PrevUpHomeNext +
                                                                                                                + + diff --git a/doc/html/boost/type_erasure/any_cast_idp99227696.html b/doc/html/boost/type_erasure/any_cast_idp99227696.html deleted file mode 100644 index f2f68d2f47..0000000000 --- a/doc/html/boost/type_erasure/any_cast_idp99227696.html +++ /dev/null @@ -1,95 +0,0 @@ - - - - -Function any_cast - - - - - - - - - - - - - - - -
                                                                                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                                                -
                                                                                                                -
                                                                                                                -PrevUpHomeNext -
                                                                                                                -
                                                                                                                -
                                                                                                                -
                                                                                                                -

                                                                                                                Function any_cast

                                                                                                                -

                                                                                                                boost::type_erasure::any_cast

                                                                                                                -
                                                                                                                -

                                                                                                                Synopsis

                                                                                                                -
                                                                                                                // In header: <boost/type_erasure/any_cast.hpp>
-
-
-template<typename T, typename Concept, typename Tag> 
-  T any_cast(any< Concept, Tag > & arg);
-template<typename T, typename Concept, typename Tag> 
-  T any_cast(const any< Concept, Tag > & arg);
-template<typename T, typename Concept, typename Tag> 
-  T any_cast(any< Concept, Tag > * arg);
-template<typename T, typename Concept, typename Tag> 
-  T any_cast(const any< Concept, Tag > * arg);
                                                                                                                -
                                                                                                                -

                                                                                                                Description

                                                                                                                -

                                                                                                                Attempts to extract the object that arg holds. If casting to a pointer fails, any_cast returns a null pointer. Casting to void* always succeeds and returns the address of stored object.

                                                                                                                -
                                                                                                                any<mpl::vector<typeid_<>, copy_constructible<> > > x(1);
-any_cast<int>(x);      // returns 1
-any_cast<int&>(x);     // returns a reference to the contents of x
-any_cast<double>(x);   // throws bad_any_cast
-any_cast<int*>(&x);    // returns a pointer to the contents of x
-any_cast<void*>(&x);   // returns a pointer to the contents of x
-any_cast<double*>(&x); // returns NULL
-
                                                                                                                -

                                                                                                                - - -

                                                                                                                -
                                                                                                                ---- - - - - - - - - - - - - - - -

                                                                                                                Requires:

                                                                                                                if arg is a pointer, T must be a pointer type.

                                                                                                                Requires:

                                                                                                                Concept must contain typeid_<Tag>.

                                                                                                                Throws:

                                                                                                                		 -bad_any_cast if arg doesn't contain an object of type T and we're casting to a value or reference.
                                                                                                                -
                                                                                                                -
                                                                                                                - - - -
                                                                                                                Copyright © 2011-2013 Steven Watanabe

                                                                                                                - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                                                -
                                                                                                                -
                                                                                                                -
                                                                                                                -PrevUpHomeNext -
                                                                                                                - - diff --git a/doc/html/boost/type_erasure/as_param.html b/doc/html/boost/type_erasure/as_param.html index f83da932d7..4df2e8f5ed 100644 --- a/doc/html/boost/type_erasure/as_param.html +++ b/doc/html/boost/type_erasure/as_param.html @@ -7,8 +7,8 @@ - - + + @@ -21,13 +21,13 @@
                                                                                                                -PrevUpHomeNext +PrevUpHomeNext

                                                                                                                Struct template as_param

                                                                                                                -

                                                                                                                boost::type_erasure::as_param — Metafunction that creates a param.

                                                                                                                +

                                                                                                                boost::type_erasure::as_param — Metafunction that creates a param.

                                                                                                                Synopsis

                                                                                                                // In header: <boost/type_erasure/param.hpp>
@@ -38,8 +38,8 @@
   typedef unspecified type;
 };
                                                                                                                -

                                                                                                                Description

                                                                                                                -

                                                                                                                If T is a (cv/reference qualifed) placeholder, returns param<concept_of<Any>::type, T>, otherwise, returns T. This metafunction is intended to be used for function arguments in specializations of concept_interface.

                                                                                                                +

                                                                                                                Description

                                                                                                                +

                                                                                                                If T is a (cv/reference qualifed) placeholder, returns param<concept_of<Any>::type, T>, otherwise, returns T. This metafunction is intended to be used for function arguments in specializations of concept_interface.

                                                                                                                See Also:

                                                                                                                derived, rebind_any

                                                                                                                @@ -56,7 +56,7 @@

                                                                                                                -PrevUpHomeNext +PrevUpHomeNext
                                                                                                                diff --git a/doc/html/boost/type_erasure/assignable.html b/doc/html/boost/type_erasure/assignable.html index 3e4887d026..bb48c34ee0 100644 --- a/doc/html/boost/type_erasure/assignable.html +++ b/doc/html/boost/type_erasure/assignable.html @@ -35,16 +35,16 @@ template<typename T = _self, typename U = T> struct assignable { - // public static functions - static void apply(T &, const U &); + // public static functions + static void apply(T &, const U &); };
                                                                                                                -

                                                                                                                Description

                                                                                                                -

                                                                                                                Enables assignment of any types.

                                                                                                                +

                                                                                                                Description

                                                                                                                +

                                                                                                                Enables assignment of any types.

                                                                                                                -

                                                                                                                -assignable public static functions

                                                                                                                -
                                                                                                                1. static void apply(T & dst, const U & src);
                                                                                                                +

                                                                                                                +assignable public static functions

                                                                                                                +
                                                                                                                1. static void apply(T & dst, const U & src);
                                                                                                                diff --git a/doc/html/boost/type_erasure/bad_any_cast.html b/doc/html/boost/type_erasure/bad_any_cast.html index a44c0533d8..a2d154199c 100644 --- a/doc/html/boost/type_erasure/bad_any_cast.html +++ b/doc/html/boost/type_erasure/bad_any_cast.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                                                                                                                -PrevUpHomeNext +PrevUpHomeNext
                                                                                                                @@ -36,8 +36,8 @@ class bad_any_cast : public bad_cast { };
                                                                                                                -

                                                                                                                Description

                                                                                                                -

                                                                                                                Exception thrown when an any_cast to a reference or value fails.

                                                                                                                +

                                                                                                                Description

                                                                                                                +

                                                                                                                Exception thrown when an any_cast to a reference or value fails.

                                                                                                              @@ -50,7 +50,7 @@
                                                                                                              -PrevUpHomeNext +PrevUpHomeNext
                                                                                                              diff --git a/doc/html/boost/type_erasure/bad_function_call.html b/doc/html/boost/type_erasure/bad_function_call.html index 20d93797f9..2056bed49d 100644 --- a/doc/html/boost/type_erasure/bad_function_call.html +++ b/doc/html/boost/type_erasure/bad_function_call.html @@ -36,21 +36,21 @@ class bad_function_call : public invalid_argument { public: // construct/copy/destruct - bad_function_call(); + bad_function_call(); };
                                                                                                              -

                                                                                                              Description

                                                                                                              +

                                                                                                              Description

                                                                                                              Exception thrown when the arguments to a primitive concept are incorrect.

                                                                                                              See Also:

                                                                                                              -

                                                                                                              call, require_match

                                                                                                              +

                                                                                                              call, require_match

                                                                                                              -

                                                                                                              +

                                                                                                              bad_function_call public construct/copy/destruct

                                                                                                              -
                                                                                                              1. bad_function_call();
                                                                                                              +
                                                                                                              1. bad_function_call();
                                                                                                              diff --git a/doc/html/boost/type_erasure/binding.html b/doc/html/boost/type_erasure/binding.html new file mode 100644 index 0000000000..ef62745fec --- /dev/null +++ b/doc/html/boost/type_erasure/binding.html @@ -0,0 +1,269 @@ + + + + +Class template binding + + + + + + + + + + + + + + + +
                                                                                                              Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                                              +
                                                                                                              +
                                                                                                              +PrevUpHomeNext +
                                                                                                              +
                                                                                                              +
                                                                                                              +
                                                                                                              +

                                                                                                              Class template binding

                                                                                                              +

                                                                                                              boost::type_erasure::binding

                                                                                                              +
                                                                                                              +

                                                                                                              Synopsis

                                                                                                              +
                                                                                                              // In header: <boost/type_erasure/param.hpp>
+
+template<typename Concept> 
+class binding {
+public:
+  // construct/copy/destruct
+  binding();
+  template<typename Map> explicit binding(const Map &);
+  template<typename Map> binding(const static_binding< Map > &);
+  template<typename Concept2, typename Map> 
+    binding(const binding< Concept2 > &, const Map &);
+  template<typename Concept2, typename Map> 
+    binding(const binding< Concept2 > &, const static_binding< Map > &);
+  template<typename Placeholders, typename Map> 
+    binding(const dynamic_binding< Placeholders > &, 
+            const static_binding< Map > &);
+
+  // friend functions
+  friend bool operator==(const binding &, const binding &);
+  friend bool operator!=(const binding &, const binding &);
+};
                                                                                                              +
                                                                                                              +

                                                                                                              Description

                                                                                                              +

                                                                                                              Stores the binding of a Concept to a set of actual types. Concept is interpreted in the same way as with any.

                                                                                                              +
                                                                                                              +

                                                                                                              +binding + public + construct/copy/destruct

                                                                                                              +
                                                                                                                +
                                                                                                              1. +
                                                                                                                binding();
                                                                                                                +

                                                                                                                + +

                                                                                                                +
                                                                                                                ++++ + + + + + + + + + + +

                                                                                                                Requires:

                                                                                                                relaxed must be in Concept.

                                                                                                                Throws:

                                                                                                                		Nothing.
                                                                                                                +
                                                                                                                2. +
                                                                                                              2. +
                                                                                                                template<typename Map> explicit binding(const Map &);
                                                                                                                +

                                                                                                                + +

                                                                                                                +
                                                                                                                ++++ + + + + + + + + + + +

                                                                                                                Requires:

                                                                                                                Map must be an MPL map with an entry for each placeholder referred to by Concept.

                                                                                                                Throws:

                                                                                                                		Nothing.
                                                                                                                +
                                                                                                                3. +
                                                                                                              3. +
                                                                                                                template<typename Map> binding(const static_binding< Map > &);
                                                                                                                +

                                                                                                                + +

                                                                                                                +
                                                                                                                ++++ + + + + + + + + + + +

                                                                                                                Requires:

                                                                                                                Map must be an MPL map with an entry for each placeholder referred to by Concept.

                                                                                                                Throws:

                                                                                                                		Nothing.
                                                                                                                +
                                                                                                                4. +
                                                                                                              4. +
                                                                                                                template<typename Concept2, typename Map> 
+  binding(const binding< Concept2 > & other, const Map &);
                                                                                                                +

                                                                                                                Converts from another set of bindings.

                                                                                                                +

                                                                                                                + +

                                                                                                                +
                                                                                                                ++++ + + + + + + + + + + +

                                                                                                                Requires:

                                                                                                                Map must be an MPL map with an entry for each placeholder referred to by Concept. The mapped type should be the corresponding placeholder in Concept2.

                                                                                                                Throws:

                                                                                                                		std::bad_alloc
                                                                                                                +
                                                                                                                5. +
                                                                                                              5. +
                                                                                                                template<typename Concept2, typename Map> 
+  binding(const binding< Concept2 > & other, const static_binding< Map > &);
                                                                                                                +

                                                                                                                Converts from another set of bindings.

                                                                                                                +

                                                                                                                + +

                                                                                                                +
                                                                                                                ++++ + + + + + + + + + + +

                                                                                                                Requires:

                                                                                                                Map must be an MPL map with an entry for each placeholder referred to by Concept. The mapped type should be the corresponding placeholder in Concept2.

                                                                                                                Throws:

                                                                                                                		std::bad_alloc
                                                                                                                +
                                                                                                                6. +
                                                                                                              6. +
                                                                                                                template<typename Placeholders, typename Map> 
+  binding(const dynamic_binding< Placeholders > & other, 
+          const static_binding< Map > &);
                                                                                                                +

                                                                                                                Converts from another set of bindings.

                                                                                                                +

                                                                                                                + +

                                                                                                                +
                                                                                                                ++++ + + + + + + + + + + +

                                                                                                                Requires:

                                                                                                                Map must be an MPL map with an entry for each placeholder referred to by Concept. The mapped type should be the corresponding placeholder in Concept2.

                                                                                                                Throws:

                                                                                                                		std::bad_alloc
                                                                                                                +
                                                                                                                7. +
                                                                                                              +
                                                                                                              +
                                                                                                              +

                                                                                                              +binding friend functions

                                                                                                              +
                                                                                                                +
                                                                                                              1. +
                                                                                                                friend bool operator==(const binding & lhs, const binding & rhs);
                                                                                                                +

                                                                                                                + +

                                                                                                                +
                                                                                                                ++++ + + + + + + + + + + +

                                                                                                                Returns:

                                                                                                                true iff the sets of types that the placeholders bind to are the same for both arguments.

                                                                                                                Throws:

                                                                                                                		Nothing.
                                                                                                                +
                                                                                                                2. +
                                                                                                              2. +
                                                                                                                friend bool operator!=(const binding & lhs, const binding & rhs);
                                                                                                                +

                                                                                                                + +

                                                                                                                +
                                                                                                                ++++ + + + + + + + + + + +

                                                                                                                Returns:

                                                                                                                true iff the arguments do not map to identical sets of types.

                                                                                                                Throws:

                                                                                                                		Nothing.
                                                                                                                +
                                                                                                                3. +
                                                                                                              +
                                                                                                              +
                                                                                                              +
                                                                                                              + + + +
                                                                                                              Copyright © 2011-2013 Steven Watanabe

                                                                                                              + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                                              +
                                                                                                              +
                                                                                                              +
                                                                                                              +PrevUpHomeNext +
                                                                                                              + + diff --git a/doc/html/boost/type_erasure/binding_of.html b/doc/html/boost/type_erasure/binding_of.html index 01d34c9d0d..263482b5f5 100644 --- a/doc/html/boost/type_erasure/binding_of.html +++ b/doc/html/boost/type_erasure/binding_of.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                                                                                                              -PrevUpHomeNext +PrevUpHomeNext
                                                                                                              @@ -34,9 +34,9 @@ template<typename Concept, typename T> - const binding< Concept > & binding_of(const any< Concept, T > & arg);
                                                                                                              + const binding< Concept > & binding_of(const any< Concept, T > & arg);
                                                                                                              -

                                                                                                              Description

                                                                                                              +

                                                                                                              Description

                                                                                                              @@ -48,7 +48,7 @@

                                                                                                              Returns:

                                                                                                              -

                                                                                                              The type bindings of an any.

                                                                                                              +

                                                                                                              The type bindings of an any.

                                                                                                              Throws:

                                                                                                              @@ -68,7 +68,7 @@
                                                                                                              -PrevUpHomeNext +PrevUpHomeNext
                                                                                                              diff --git a/doc/html/boost/type_erasure/bitand_assignable.html b/doc/html/boost/type_erasure/bitand_assignable.html index c79d820992..77c2c5deff 100644 --- a/doc/html/boost/type_erasure/bitand_assignable.html +++ b/doc/html/boost/type_erasure/bitand_assignable.html @@ -35,15 +35,15 @@ template<typename T = _self, typename U = T> struct bitand_assignable { - // public static functions - static void apply(T &, const U &); + // public static functions + static void apply(T &, const U &); };
                                                                                                              -

                                                                                                              Description

                                                                                                              +

                                                                                                              Description

                                                                                                              -

                                                                                                              -bitand_assignable public static functions

                                                                                                              -
                                                                                                              1. static void apply(T &, const U &);
                                                                                                              +

                                                                                                              +bitand_assignable public static functions

                                                                                                              +
                                                                                                              1. static void apply(T &, const U &);
                                                                                                              diff --git a/doc/html/boost/type_erasure/bitandable.html b/doc/html/boost/type_erasure/bitandable.html index b0600c29d2..1e1a04bb6c 100644 --- a/doc/html/boost/type_erasure/bitandable.html +++ b/doc/html/boost/type_erasure/bitandable.html @@ -35,15 +35,15 @@ template<typename T = _self, typename U = T, typename R = T> struct bitandable { - // public static functions - static R apply(const T &, const U &); + // public static functions + static R apply(const T &, const U &); };
                                                                                                              -

                                                                                                              Description

                                                                                                              +

                                                                                                              Description

                                                                                                              -

                                                                                                              -bitandable public static functions

                                                                                                              -
                                                                                                              1. static R apply(const T &, const U &);
                                                                                                              +

                                                                                                              +bitandable public static functions

                                                                                                              +
                                                                                                              1. static R apply(const T &, const U &);
                                                                                                            diff --git a/doc/html/boost/type_erasure/bitor_assignable.html b/doc/html/boost/type_erasure/bitor_assignable.html index 2a3e16dab8..172f387bb6 100644 --- a/doc/html/boost/type_erasure/bitor_assignable.html +++ b/doc/html/boost/type_erasure/bitor_assignable.html @@ -35,15 +35,15 @@ template<typename T = _self, typename U = T> struct bitor_assignable { - // public static functions - static void apply(T &, const U &); + // public static functions + static void apply(T &, const U &); };
                                                                                                            -

                                                                                                            Description

                                                                                                            +

                                                                                                            Description

                                                                                                            -

                                                                                                            -bitor_assignable public static functions

                                                                                                            -
                                                                                                            1. static void apply(T &, const U &);
                                                                                                            +

                                                                                                            +bitor_assignable public static functions

                                                                                                            +
                                                                                                            1. static void apply(T &, const U &);
                                                                                                            diff --git a/doc/html/boost/type_erasure/bitorable.html b/doc/html/boost/type_erasure/bitorable.html index b6bf77df0d..5129a45a5f 100644 --- a/doc/html/boost/type_erasure/bitorable.html +++ b/doc/html/boost/type_erasure/bitorable.html @@ -35,15 +35,15 @@ template<typename T = _self, typename U = T, typename R = T> struct bitorable { - // public static functions - static R apply(const T &, const U &); + // public static functions + static R apply(const T &, const U &); };
                                                                                                            -

                                                                                                            Description

                                                                                                            +

                                                                                                            Description

                                                                                                            -

                                                                                                            -bitorable public static functions

                                                                                                            -
                                                                                                            1. static R apply(const T &, const U &);
                                                                                                            +

                                                                                                            +bitorable public static functions

                                                                                                            +
                                                                                                            1. static R apply(const T &, const U &);
                                                                                                          diff --git a/doc/html/boost/type_erasure/bitxor_assignable.html b/doc/html/boost/type_erasure/bitxor_assignable.html index ccbe1e196c..65f5188402 100644 --- a/doc/html/boost/type_erasure/bitxor_assignable.html +++ b/doc/html/boost/type_erasure/bitxor_assignable.html @@ -35,15 +35,15 @@ template<typename T = _self, typename U = T> struct bitxor_assignable { - // public static functions - static void apply(T &, const U &); + // public static functions + static void apply(T &, const U &); };
                                                                                                          -

                                                                                                          Description

                                                                                                          +

                                                                                                          Description

                                                                                                          -

                                                                                                          -bitxor_assignable public static functions

                                                                                                          -
                                                                                                          1. static void apply(T &, const U &);
                                                                                                          +

                                                                                                          +bitxor_assignable public static functions

                                                                                                          +
                                                                                                          1. static void apply(T &, const U &);
                                                                                                        diff --git a/doc/html/boost/type_erasure/bitxorable.html b/doc/html/boost/type_erasure/bitxorable.html index 4015a1e162..2ca0b977f7 100644 --- a/doc/html/boost/type_erasure/bitxorable.html +++ b/doc/html/boost/type_erasure/bitxorable.html @@ -35,15 +35,15 @@ template<typename T = _self, typename U = T, typename R = T> struct bitxorable { - // public static functions - static R apply(const T &, const U &); + // public static functions + static R apply(const T &, const U &); };
                                                                                                        -

                                                                                                        Description

                                                                                                        +

                                                                                                        Description

                                                                                                        -

                                                                                                        -bitxorable public static functions

                                                                                                        -
                                                                                                        1. static R apply(const T &, const U &);
                                                                                                        +

                                                                                                        +bitxorable public static functions

                                                                                                        +
                                                                                                        1. static R apply(const T &, const U &);
                                                                                                        diff --git a/doc/html/boost/type_erasure/call_idm45506884907840.html b/doc/html/boost/type_erasure/call_idm45506884907840.html new file mode 100644 index 0000000000..a71bed9d5b --- /dev/null +++ b/doc/html/boost/type_erasure/call_idm45506884907840.html @@ -0,0 +1,87 @@ + + + + +Function call + + + + + + + + + + + + + + + +
                                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                                        +
                                                                                                        +
                                                                                                        +PrevUpHomeNext +
                                                                                                        +
                                                                                                        +
                                                                                                        +
                                                                                                        +

                                                                                                        Function call

                                                                                                        +

                                                                                                        boost::type_erasure::call

                                                                                                        +
                                                                                                        +

                                                                                                        Synopsis

                                                                                                        +
                                                                                                        // In header: <boost/type_erasure/call.hpp>
+
+
+template<typename Concept, typename Op, class... U> 
+  unspecified call(const binding< Concept > & binding, const Op &, 
+                   U &&... args);
+template<typename Op, class... U> unspecified call(const Op &, U &&... args);
                                                                                                        +
                                                                                                        +

                                                                                                        Description

                                                                                                        +

                                                                                                        Dispatches a type erased function.

                                                                                                        +

                                                                                                        Op must be a primitive concept which is present in Concept. Its signature determines how the arguments of call are handled. If the argument is a placeholder, call expects an any using that placeholder. This any is unwrapped by call. The type that it stores must be the same type specified by binding. Any arguments that are not placeholders in the signature of Op are passed through unchanged.

                                                                                                        +

                                                                                                        If binding is not specified, it will be deduced from the arguments. Naturally this requires at least one argument to be an any. In this case, all any arguments must have the same binding.

                                                                                                        +

                                                                                                        + +Example:

                                                                                                        +
                                                                                                        typedef mpl::vector<
+  copy_constructible<_b>,
+  addable<_a, int, _b> > concept;
+any<concept, _a> a = ...;
+any<concept, _b> b(call(addable<_a, int, _b>(), a, 10));
+
                                                                                                        +

                                                                                                        The signature of addable is _b(const _a&, const int&)

                                                                                                        +
                                                                                                        ++++ + + + + + + + + + + +

                                                                                                        Returns:

                                                                                                        The result of the operation. If the result type of the signature of Op is a placeholder, the result will be converted to the appropriate any type.

                                                                                                        Throws:

                                                                                                        		 +bad_function_call if relaxed is in Concept and there is a type mismatch.
                                                                                                        +
                                                                                                        +
                                                                                                        + + + +
                                                                                                        Copyright © 2011-2013 Steven Watanabe

                                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                                        +
                                                                                                        +
                                                                                                        +
                                                                                                        +PrevUpHomeNext +
                                                                                                        + + diff --git a/doc/html/boost/type_erasure/call_idp314765536.html b/doc/html/boost/type_erasure/call_idp314765536.html deleted file mode 100644 index a5a3e3c030..0000000000 --- a/doc/html/boost/type_erasure/call_idp314765536.html +++ /dev/null @@ -1,87 +0,0 @@ - - - - -Function call - - - - - - - - - - - - - - - -
                                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                                        -
                                                                                                        -
                                                                                                        -PrevUpHomeNext -
                                                                                                        -
                                                                                                        -
                                                                                                        -
                                                                                                        -

                                                                                                        Function call

                                                                                                        -

                                                                                                        boost::type_erasure::call

                                                                                                        -
                                                                                                        -

                                                                                                        Synopsis

                                                                                                        -
                                                                                                        // In header: <boost/type_erasure/call.hpp>
-
-
-template<typename Concept, typename Op, class... U> 
-  unspecified call(const binding< Concept > & binding, const Op &, 
-                   U &&... args);
-template<typename Op, class... U> unspecified call(const Op &, U &&... args);
                                                                                                        -
                                                                                                        -

                                                                                                        Description

                                                                                                        -

                                                                                                        Dispatches a type erased function.

                                                                                                        -

                                                                                                        Op must be a primitive concept which is present in Concept. Its signature determines how the arguments of call are handled. If the argument is a placeholder, call expects an any using that placeholder. This any is unwrapped by call. The type that it stores must be the same type specified by binding. Any arguments that are not placeholders in the signature of Op are passed through unchanged.

                                                                                                        -

                                                                                                        If binding is not specified, it will be deduced from the arguments. Naturally this requires at least one argument to be an any. In this case, all any arguments must have the same binding.

                                                                                                        -

                                                                                                        - -Example:

                                                                                                        -
                                                                                                        typedef mpl::vector<
-  copy_constructible<_b>,
-  addable<_a, int, _b> > concept;
-any<concept, _a> a = ...;
-any<concept, _b> b(call(addable<_a, int, _b>(), a, 10));
-
                                                                                                        -

                                                                                                        The signature of addable is _b(const _a&, const int&)

                                                                                                        -
                                                                                                        ---- - - - - - - - - - - -

                                                                                                        Returns:

                                                                                                        The result of the operation. If the result type of the signature of Op is a placeholder, the result will be converted to the appropriate any type.

                                                                                                        Throws:

                                                                                                        		 -bad_function_call if relaxed is in Concept and there is a type mismatch.
                                                                                                        -
                                                                                                        -
                                                                                                        - - - -
                                                                                                        Copyright © 2011-2013 Steven Watanabe

                                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                                        -
                                                                                                        -
                                                                                                        -
                                                                                                        -PrevUpHomeNext -
                                                                                                        - - diff --git a/doc/html/boost/type_erasure/callable.html b/doc/html/boost/type_erasure/callable.html index 3c84816507..5d5431f8d1 100644 --- a/doc/html/boost/type_erasure/callable.html +++ b/doc/html/boost/type_erasure/callable.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                                        @@ -35,18 +35,18 @@ template<typename Sig, typename F = _self> struct callable { - // public static functions - static R apply(F &, T...); + // public static functions + static R apply(F &, T...); };
                                                                                                        -

                                                                                                        Description

                                                                                                        -

                                                                                                        The callable concept allows an any to hold function objects. Sig is interpreted in the same way as for Boost.Function, except that the arguments and return type are allowed to be placeholders. F must be a placeholder.

                                                                                                        +

                                                                                                        Description

                                                                                                        +

                                                                                                        The callable concept allows an any to hold function objects. Sig is interpreted in the same way as for Boost.Function, except that the arguments and return type are allowed to be placeholders. F must be a placeholder.

                                                                                                        Multiple instances of callable can be used simultaneously. Overload resolution works normally. Note that unlike Boost.Function, callable does not provide result_type. It does, however, support boost::result_of.

                                                                                                        -

                                                                                                        -callable public static functions

                                                                                                        +

                                                                                                        +callable public static functions

                                                                                                        1. -
                                                                                                          static R apply(F & f, T... arg);
                                                                                                          +
                                                                                                          static R apply(F & f, T... arg);

                                                                                                          R is the result type of Sig and T is the argument types of Sig.

                                                                                                        @@ -62,7 +62,7 @@
                                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                                        diff --git a/doc/html/boost/type_erasure/check_match.html b/doc/html/boost/type_erasure/check_match.html index 78709bebca..56b3f6e497 100644 --- a/doc/html/boost/type_erasure/check_match.html +++ b/doc/html/boost/type_erasure/check_match.html @@ -34,11 +34,11 @@ template<typename Concept, typename Op, class... U> - bool check_match(const binding< Concept > & binding, const Op & f, + bool check_match(const binding< Concept > & binding, const Op & f, U &&... args); template<typename Op, class... U> bool check_match(const Op & f, U &&... args);
                                                                                                        -

                                                                                                        Description

                                                                                                        +

                                                                                                        Description

                                                                                                        If relaxed is in Concept, checks whether the arguments to f match the types specified by binding. If relaxed is not in Concept, returns true. If binding is not specified, it will be deduced from the arguments.

                                                                                                        diff --git a/doc/html/boost/type_erasure/complementable.html b/doc/html/boost/type_erasure/complementable.html index 564c1ca6f0..9cc6402e7a 100644 --- a/doc/html/boost/type_erasure/complementable.html +++ b/doc/html/boost/type_erasure/complementable.html @@ -35,16 +35,16 @@ template<typename T = _self, typename R = T> struct complementable { - // public static functions - static R apply(const T &); + // public static functions + static R apply(const T &); };
                                                                                                        -

                                                                                                        Description

                                                                                                        -

                                                                                                        The complementable concept allow use of the bitwise complement operator on an any.

                                                                                                        +

                                                                                                        Description

                                                                                                        +

                                                                                                        The complementable concept allow use of the bitwise complement operator on an any.

                                                                                                        -

                                                                                                        -complementable public static functions

                                                                                                        -
                                                                                                        1. static R apply(const T &);
                                                                                                        +

                                                                                                        +complementable public static functions

                                                                                                        +
                                                                                                        1. static R apply(const T &);
                                                                                                        diff --git a/doc/html/boost/type_erasure/concept_interface.html b/doc/html/boost/type_erasure/concept_interface.html index 725495d421..a78aee2aea 100644 --- a/doc/html/boost/type_erasure/concept_interface.html +++ b/doc/html/boost/type_erasure/concept_interface.html @@ -36,15 +36,15 @@ struct concept_interface : public Base { };
                                                                                                        -

                                                                                                        Description

                                                                                                        -

                                                                                                        The concept_interface class can be specialized to add behavior to an any. An any inherits from all the relevant specializations of concept_interface.

                                                                                                        +

                                                                                                        Description

                                                                                                        +

                                                                                                        The concept_interface class can be specialized to add behavior to an any. An any inherits from all the relevant specializations of concept_interface.

                                                                                                        concept_interface can be specialized for either primitive or composite concepts. If a concept C1 contains another concept C2, then the library guarantees that the specialization of concept_interface for C2 is a base class of the specialization for C1. This means that C1 can safely override members of C2.

                                                                                                        concept_interface may only be specialized for user-defined concepts. The library owns the specializations of its own built in concepts.

                                                                                                        The metafunctions derived, rebind_any, and as_param (which can be applied to Base) are useful for determining the argument and return types of functions defined in concept_interface.

                                                                                                        -

                                                                                                        For dispatching the function use call.

                                                                                                        +

                                                                                                        For dispatching the function use call.

                                                                                                        -

                                                                                                        Template Parameters

                                                                                                        +

                                                                                                        Template Parameters

                                                                                                        1. typename Concept
                                                                                                          diff --git a/doc/html/boost/type_erasure/concept_of.html b/doc/html/boost/type_erasure/concept_of.html index 6e6bd118d2..5bc7ead97a 100644 --- a/doc/html/boost/type_erasure/concept_of.html +++ b/doc/html/boost/type_erasure/concept_of.html @@ -38,8 +38,8 @@ typedef unspecified type; };
                                                                                                        -

                                                                                                        Description

                                                                                                        -

                                                                                                        A metafunction returning the concept corresponding to an any. It will also work for all bases of any, so it can be applied to the Base parameter of concept_interface.

                                                                                                        +

                                                                                                        Description

                                                                                                        +

                                                                                                        A metafunction returning the concept corresponding to an any. It will also work for all bases of any, so it can be applied to the Base parameter of concept_interface.

                                                                                                        diff --git a/doc/html/boost/type_erasure/constructible.html b/doc/html/boost/type_erasure/constructible.html index d7847445c1..e67fd82d01 100644 --- a/doc/html/boost/type_erasure/constructible.html +++ b/doc/html/boost/type_erasure/constructible.html @@ -7,8 +7,8 @@ - - + +
                                                                                                        @@ -21,7 +21,7 @@
                                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                                        @@ -36,14 +36,14 @@ struct constructible { };
                                                                                                        -

                                                                                                        Description

                                                                                                        -

                                                                                                        The constructible concept enables calling the constructor of a type contained by an any. Sig should be a function signature. The return type is the placeholder specifying the type to be constructed. The arguments are the argument types of the constructor. The arguments of Sig may be placeholders.

                                                                                                        +

                                                                                                        Description

                                                                                                        +

                                                                                                        The constructible concept enables calling the constructor of a type contained by an any. Sig should be a function signature. The return type is the placeholder specifying the type to be constructed. The arguments are the argument types of the constructor. The arguments of Sig may be placeholders.

                                                                                                        - +
                                                                                                        [Note] Note

                                                                                                        constructible may not be specialized and may not be passed to call as it depends on the implementation details of any.

                                                                                                        constructible may not be specialized and may not be passed to call as it depends on the implementation details of any.

                                                                                                        @@ -59,7 +59,7 @@
                                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                                        diff --git a/doc/html/boost/type_erasure/copy_constructible.html b/doc/html/boost/type_erasure/copy_constructible.html index 256b54aeb4..9977f095fc 100644 --- a/doc/html/boost/type_erasure/copy_constructible.html +++ b/doc/html/boost/type_erasure/copy_constructible.html @@ -37,7 +37,7 @@ { };
                                                                                                        -

                                                                                                        Description

                                                                                                        +

                                                                                                        Description

                                                                                                        The copy_constructible concept allows objects to be copied and destroyed.

                                                                                                        diff --git a/doc/html/boost/type_erasure/decrementable.html b/doc/html/boost/type_erasure/decrementable.html index 4a63935261..435886dcf6 100644 --- a/doc/html/boost/type_erasure/decrementable.html +++ b/doc/html/boost/type_erasure/decrementable.html @@ -35,16 +35,16 @@ template<typename T =_self>structdecrementable{ - // public static functions - staticvoidapply(T&); + // public static functions + staticvoidapply(T&);};
                                                                                                        -

                                                                                                        Description

                                                                                                        -

                                                                                                        The decrementable concept allow pre and post decrement on an any. The contained type must provide a pre-decrement operator.

                                                                                                        +

                                                                                                        Description

                                                                                                        +

                                                                                                        The decrementable concept allow pre and post decrement on an any. The contained type must provide a pre-decrement operator.

                                                                                                        -

                                                                                                        -decrementable public static functions

                                                                                                        -
                                                                                                        1. static void apply(T &);
                                                                                                        +

                                                                                                        +decrementable public static functions

                                                                                                        +
                                                                                                        1. static void apply(T &);
                                                                                                        diff --git a/doc/html/boost/type_erasure/deduced.html b/doc/html/boost/type_erasure/deduced.html index 3704ee94e0..2bb0cc2c48 100644 --- a/doc/html/boost/type_erasure/deduced.html +++ b/doc/html/boost/type_erasure/deduced.html @@ -38,7 +38,7 @@ typedefunspecifiedtype;};
                                                                                                        -

                                                                                                        Description

                                                                                                        +

                                                                                                        Description

                                                                                                        A placeholder for an associated type. The type corresponding to this placeholder is deduced by substituting placeholders in the arguments of the metafunction and then evaluating it.

                                                                                                        When using deduced in a template context, if it is possible for Metafunction to contain no placeholders at all, use the nested type, to automatically evaluate it early as needed.

                                                                                                        diff --git a/doc/html/boost/type_erasure/dereferenceable.html b/doc/html/boost/type_erasure/dereferenceable.html index fa9115d2eb..033811e02f 100644 --- a/doc/html/boost/type_erasure/dereferenceable.html +++ b/doc/html/boost/type_erasure/dereferenceable.html @@ -35,15 +35,15 @@ template<typename R,typename T =_self>structdereferenceable{ - // public static functions - staticRapply(constT&); + // public static functions + staticRapply(constT&);};
                                                                                                        -

                                                                                                        Description

                                                                                                        +

                                                                                                        Description

                                                                                                        -

                                                                                                        -dereferenceable public static functions

                                                                                                        -
                                                                                                        1. static R apply(const T & arg);
                                                                                                        +

                                                                                                        +dereferenceable public static functions

                                                                                                        +
                                                                                                        1. static R apply(const T & arg);
                                                                                                        diff --git a/doc/html/boost/type_erasure/derived.html b/doc/html/boost/type_erasure/derived.html index 6d012902dc..7f972f4fad 100644 --- a/doc/html/boost/type_erasure/derived.html +++ b/doc/html/boost/type_erasure/derived.html @@ -8,7 +8,7 @@ - +
                                                                                                        @@ -21,7 +21,7 @@
                                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                                        @@ -38,8 +38,8 @@ typedef unspecified type; };
                                                                                                        -

                                                                                                        Description

                                                                                                        -

                                                                                                        A metafunction which returns the full any type, when given any of its base classes. This is primarily intended to be used when implementing concept_interface.

                                                                                                        +

                                                                                                        Description

                                                                                                        +

                                                                                                        A metafunction which returns the full any type, when given any of its base classes. This is primarily intended to be used when implementing concept_interface.

                                                                                                        See Also:

                                                                                                        rebind_any, as_param

                                                                                                        @@ -56,7 +56,7 @@

                                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                                        diff --git a/doc/html/boost/type_erasure/destructible.html b/doc/html/boost/type_erasure/destructible.html index 84616f3276..813868f8ef 100644 --- a/doc/html/boost/type_erasure/destructible.html +++ b/doc/html/boost/type_erasure/destructible.html @@ -36,8 +36,8 @@ struct destructible { };
                                                                                                        -

                                                                                                        Description

                                                                                                        -

                                                                                                        The destructible concept enables forwarding to the destructor of the contained type. This is required whenever an any is created by value.

                                                                                                        +

                                                                                                        Description

                                                                                                        +

                                                                                                        The destructible concept enables forwarding to the destructor of the contained type. This is required whenever an any is created by value.

                                                                                                        @@ -52,7 +52,7 @@ - +
                                                                                                        [Note][Note] Note

                                                                                                        destructible may not be specialized and may not be passed to call as it depends on the implementation details of any.

                                                                                                        destructible may not be specialized and may not be passed to call as it depends on the implementation details of any.

                                                                                                        diff --git a/doc/html/boost/type_erasure/dividable.html b/doc/html/boost/type_erasure/dividable.html index a477e5fa0c..d3a3c2968c 100644 --- a/doc/html/boost/type_erasure/dividable.html +++ b/doc/html/boost/type_erasure/dividable.html @@ -35,15 +35,15 @@ template<typename T = _self, typename U = T, typename R = T> struct dividable { - // public static functions - static R apply(const T &, const U &); + // public static functions + static R apply(const T &, const U &); };
                                                                                                        -

                                                                                                        Description

                                                                                                        +

                                                                                                        Description

                                                                                                        -

                                                                                                        -dividable public static functions

                                                                                                        -
                                                                                                        1. static R apply(const T &, const U &);
                                                                                                        +

                                                                                                        +dividable public static functions

                                                                                                        +
                                                                                                        1. static R apply(const T &, const U &);
                                                                                                        diff --git a/doc/html/boost/type_erasure/divide_assignable.html b/doc/html/boost/type_erasure/divide_assignable.html index f37cd22e10..bbb912e6a4 100644 --- a/doc/html/boost/type_erasure/divide_assignable.html +++ b/doc/html/boost/type_erasure/divide_assignable.html @@ -35,15 +35,15 @@ template<typename T = _self, typename U = T> struct divide_assignable { - // public static functions - static void apply(T &, const U &); + // public static functions + static void apply(T &, const U &); };
                                                                                                        -

                                                                                                        Description

                                                                                                        +

                                                                                                        Description

                                                                                                        -

                                                                                                        -divide_assignable public static functions

                                                                                                        -
                                                                                                        1. static void apply(T &, const U &);
                                                                                                        +

                                                                                                        +divide_assignable public static functions

                                                                                                        +
                                                                                                        1. static void apply(T &, const U &);
                                                                                                        diff --git a/doc/html/boost/type_erasure/dynamic_any_cast.html b/doc/html/boost/type_erasure/dynamic_any_cast.html new file mode 100644 index 0000000000..11d7dd84ef --- /dev/null +++ b/doc/html/boost/type_erasure/dynamic_any_cast.html @@ -0,0 +1,103 @@ + + + + +Function dynamic_any_cast + + + + + + + + + + + + + + + +
                                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                                        +
                                                                                                        +
                                                                                                        +PrevUpHomeNext +
                                                                                                        +
                                                                                                        +
                                                                                                        +
                                                                                                        +

                                                                                                        Function dynamic_any_cast

                                                                                                        +

                                                                                                        boost::type_erasure::dynamic_any_cast

                                                                                                        +
                                                                                                        +

                                                                                                        Synopsis

                                                                                                        +
                                                                                                        // In header: <boost/type_erasure/dynamic_any_cast.hpp>
+
+
+template<typename R, typename Any> R dynamic_any_cast(Any && arg);
+template<typename R, typename Any, typename Map> 
+  R dynamic_any_cast(Any && arg, const static_binding< Map > &);
                                                                                                        +
                                                                                                        +

                                                                                                        Description

                                                                                                        +

                                                                                                        Downcasts or crosscasts an any.

                                                                                                        +

                                                                                                        + + +The single argument form can only be used when R uses a single non-deduced placeholder.

                                                                                                        +

                                                                                                        +Example:

                                                                                                        +
                                                                                                        // Assume that typeid_<>, copy_constructible<>, and incrementable<>
+// have all been registered for int.
+any<mpl::vector<typeid_<>, copy_constructible<> > > x(1);
+typedef any<
+    mpl::vector<
+        typeid_<>,
+        copy_constructible<>,
+        incrementable<>
+    >
+> incrementable_any;
+auto y = dynamic_any_cast<incrementable_any>(x);
+++y;
+assert(any_cast<int>(y) == 2);
+
                                                                                                        +

                                                                                                        +
                                                                                                        ++++ + + + + + + + + + + + + + + + + + + +

                                                                                                        Requires:

                                                                                                        R and Any must both be specializations of any.

                                                                                                        Requires:

                                                                                                        PlaceholderMap must be an MPL map with a key for every non-deduced placeholder used by R. The value associated with each key should be the corresponding placeholder in Any.

                                                                                                        Requires:

                                                                                                        The concept of Any must include typeid_, for every placeholder which is used by R.

                                                                                                        Throws:

                                                                                                        		 +bad_any_cast if the concepts used by R were not previously registered via a call to register_binding.
                                                                                                        +
                                                                                                        +
                                                                                                        + + + +
                                                                                                        Copyright © 2011-2013 Steven Watanabe

                                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                                        +
                                                                                                        +
                                                                                                        +
                                                                                                        +PrevUpHomeNext +
                                                                                                        + + diff --git a/doc/html/boost/type_erasure/dynamic_binding.html b/doc/html/boost/type_erasure/dynamic_binding.html new file mode 100644 index 0000000000..81c856d48b --- /dev/null +++ b/doc/html/boost/type_erasure/dynamic_binding.html @@ -0,0 +1,73 @@ + + + + +Class template dynamic_binding + + + + + + + + + + + + + + + +
                                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                                        +
                                                                                                        +
                                                                                                        +PrevUpHomeNext +
                                                                                                        +
                                                                                                        +
                                                                                                        +
                                                                                                        +

                                                                                                        Class template dynamic_binding

                                                                                                        +

                                                                                                        boost::type_erasure::dynamic_binding

                                                                                                        +
                                                                                                        +

                                                                                                        Synopsis

                                                                                                        +
                                                                                                        // In header: <boost/type_erasure/binding.hpp>
+
+template<typename PlaceholderList> 
+class dynamic_binding {
+public:
+  // construct/copy/destruct
+  template<typename Map> dynamic_binding(const static_binding< Map > &);
+  template<typename Concept, typename Map> 
+    dynamic_binding(const binding< Concept > &, const static_binding< Map > &);
+};
                                                                                                        +
                                                                                                        +

                                                                                                        Description

                                                                                                        +

                                                                                                        Maps a set of placeholders to actual types.

                                                                                                        +
                                                                                                        +

                                                                                                        +dynamic_binding + public + construct/copy/destruct

                                                                                                        +
                                                                                                          +
                                                                                                        1. template<typename Map> dynamic_binding(const static_binding< Map > &);
                                                                                                          2. +
                                                                                                        2. template<typename Concept, typename Map> 
+  dynamic_binding(const binding< Concept > & other, 
+                  const static_binding< Map > &);
                                                                                                          3. +
                                                                                                        +
                                                                                                        +
                                                                                                        +
                                                                                                        + + + +
                                                                                                        Copyright © 2011-2013 Steven Watanabe

                                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                                        +
                                                                                                        +
                                                                                                        +
                                                                                                        +PrevUpHomeNext +
                                                                                                        + + diff --git a/doc/html/boost/type_erasure/equality_comparable.html b/doc/html/boost/type_erasure/equality_comparable.html index 45cc35f798..dbc8cb96c3 100644 --- a/doc/html/boost/type_erasure/equality_comparable.html +++ b/doc/html/boost/type_erasure/equality_comparable.html @@ -35,15 +35,15 @@ template<typename T = _self, typename U = T> struct equality_comparable { - // public static functions - static bool apply(const T &, const U &); + // public static functions + static bool apply(const T &, const U &); };
                                                                                                        -

                                                                                                        Description

                                                                                                        +

                                                                                                        Description

                                                                                                        -

                                                                                                        -equality_comparable public static functions

                                                                                                        -
                                                                                                        1. static bool apply(const T & lhs, const U & rhs);
                                                                                                        +

                                                                                                        +equality_comparable public static functions

                                                                                                        +
                                                                                                        1. static bool apply(const T & lhs, const U & rhs);
                                                                                                        diff --git a/doc/html/boost/type_erasure/get_idm45506890832112.html b/doc/html/boost/type_erasure/get_idm45506890832112.html new file mode 100644 index 0000000000..3da7e55706 --- /dev/null +++ b/doc/html/boost/type_erasure/get_idm45506890832112.html @@ -0,0 +1,58 @@ + + + + +Function get + + + + + + + + + + + + + + + +
                                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                                        +
                                                                                                        +
                                                                                                        +PrevUpHomeNext +
                                                                                                        +
                                                                                                        +
                                                                                                        +
                                                                                                        +

                                                                                                        Function get

                                                                                                        +

                                                                                                        boost::type_erasure::get

                                                                                                        +
                                                                                                        +

                                                                                                        Synopsis

                                                                                                        +
                                                                                                        // In header: <boost/type_erasure/tuple.hpp>
+
+
+template<int N, typename Concept, class... T> 
+  any< Concept, TN > & get(tuple< Concept, T...> & arg);
+template<int N, typename Concept, class... T> 
+  const any< Concept, TN > & get(const tuple< Concept, T...> & arg);
                                                                                                        +
                                                                                                        +

                                                                                                        Description

                                                                                                        +

                                                                                                        Returns the Nth any in the tuple.

                                                                                                        +
                                                                                                        +
                                                                                                        + + + +
                                                                                                        Copyright © 2011-2013 Steven Watanabe

                                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                                        +
                                                                                                        +
                                                                                                        +
                                                                                                        +PrevUpHomeNext +
                                                                                                        + + diff --git a/doc/html/boost/type_erasure/get_idp200238016.html b/doc/html/boost/type_erasure/get_idp200238016.html deleted file mode 100644 index 7ca93fb551..0000000000 --- a/doc/html/boost/type_erasure/get_idp200238016.html +++ /dev/null @@ -1,58 +0,0 @@ - - - - -Function get - - - - - - - - - - - - - - - -
                                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                                        -
                                                                                                        -
                                                                                                        -PrevUpHomeNext -
                                                                                                        -
                                                                                                        -
                                                                                                        -
                                                                                                        -

                                                                                                        Function get

                                                                                                        -

                                                                                                        boost::type_erasure::get

                                                                                                        -
                                                                                                        -

                                                                                                        Synopsis

                                                                                                        -
                                                                                                        // In header: <boost/type_erasure/tuple.hpp>
-
-
-template<int N, typename Concept, class... T> 
-  any< Concept, TN > & get(tuple< Concept, T...> & arg);
-template<int N, typename Concept, class... T> 
-  const any< Concept, TN > & get(const tuple< Concept, T...> & arg);
                                                                                                        -
                                                                                                        -

                                                                                                        Description

                                                                                                        -

                                                                                                        Returns the Nth any in the tuple.

                                                                                                        -
                                                                                                        -
                                                                                                        - - - -
                                                                                                        Copyright © 2011-2013 Steven Watanabe

                                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                                        -
                                                                                                        -
                                                                                                        -
                                                                                                        -PrevUpHomeNext -
                                                                                                        - - diff --git a/doc/html/boost/type_erasure/incrementable.html b/doc/html/boost/type_erasure/incrementable.html index 743881f9c1..29bf87b213 100644 --- a/doc/html/boost/type_erasure/incrementable.html +++ b/doc/html/boost/type_erasure/incrementable.html @@ -35,16 +35,16 @@ template<typename T = _self> struct incrementable { - // public static functions - static void apply(T &); + // public static functions + static void apply(T &); };
                                                                                                        -

                                                                                                        Description

                                                                                                        -

                                                                                                        The incrementable concept allow pre and post increment on an any. The contained type must provide a pre-increment operator.

                                                                                                        +

                                                                                                        Description

                                                                                                        +

                                                                                                        The incrementable concept allow pre and post increment on an any. The contained type must provide a pre-increment operator.

                                                                                                        -

                                                                                                        -incrementable public static functions

                                                                                                        -
                                                                                                        1. static void apply(T &);
                                                                                                        +

                                                                                                        +incrementable public static functions

                                                                                                        +
                                                                                                        1. static void apply(T &);
                                                                                                        diff --git a/doc/html/boost/type_erasure/is_empty.html b/doc/html/boost/type_erasure/is_empty.html index aa19b60f00..e37f83c56e 100644 --- a/doc/html/boost/type_erasure/is_empty.html +++ b/doc/html/boost/type_erasure/is_empty.html @@ -35,8 +35,8 @@ template<typename T> bool is_empty(const T & arg);
                                                                                                        -

                                                                                                        Description

                                                                                                        -

                                                                                                        Returns true for an empty any.

                                                                                                        +

                                                                                                        Description

                                                                                                        +

                                                                                                        Returns true for an empty any.

                                                                                                      diff --git a/doc/html/boost/type_erasure/is_placeholder.html b/doc/html/boost/type_erasure/is_placeholder.html index c064939ccb..f52f520737 100644 --- a/doc/html/boost/type_erasure/is_placeholder.html +++ b/doc/html/boost/type_erasure/is_placeholder.html @@ -36,7 +36,7 @@ structis_placeholder:publicboost::is_base_and_derived<placeholder,T>{};
                                                                                                      -

                                                                                                      Description

                                                                                                      +

                                                                                                      Description

                                                                                                      A metafunction that indicates whether a type is a placeholder.

                                                                                                      diff --git a/doc/html/boost/type_erasure/is_relaxed.html b/doc/html/boost/type_erasure/is_relaxed.html index 5ac8ad3b3c..840c1cf86e 100644 --- a/doc/html/boost/type_erasure/is_relaxed.html +++ b/doc/html/boost/type_erasure/is_relaxed.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                                                                                                      -PrevUpHomeNext +PrevUpHomeNext
                                                                                                      @@ -36,7 +36,7 @@ struct is_relaxed { };
                                                                                                      -

                                                                                                      Description

                                                                                                      +

                                                                                                      Description

                                                                                                      A metafunction indicating whether Concept includes relaxed.

                                                                                                      @@ -50,7 +50,7 @@
                                                                                                      -PrevUpHomeNext +PrevUpHomeNext
                                                                                                      diff --git a/doc/html/boost/type_erasure/is_subconcept.html b/doc/html/boost/type_erasure/is_subconcept.html index 95da5508ae..791d1df732 100644 --- a/doc/html/boost/type_erasure/is_subconcept.html +++ b/doc/html/boost/type_erasure/is_subconcept.html @@ -36,7 +36,7 @@ struct is_subconcept { };
                                                                                                      -

                                                                                                      Description

                                                                                                      +

                                                                                                      Description

                                                                                                      is_subconcept is a boolean metafunction that determines whether one concept is a sub-concept of another.

                                                                                                      is_subconcept<incrementable<>, incrementable<> >             -> true
 is_subconcept<incrementable<>, addable<> >                   -> false
@@ -46,7 +46,7 @@
 
                                                                                                      
 
                                                                                                      
 
                                                                                                      
-
                                                                                                      Template Parameters
                                                                                                      
+
                                                                                                      Template Parameters
                                                                                                      
 
                                                                                                        
 
                                                                                                      1. 
 
                                                                                                        typename Sub
                                                                                                        
diff --git a/doc/html/boost/type_erasure/istreamable.html b/doc/html/boost/type_erasure/istreamable.html
index 04a7404443..945baffd4b 100644
--- a/doc/html/boost/type_erasure/istreamable.html
+++ b/doc/html/boost/type_erasure/istreamable.html
@@ -35,16 +35,16 @@
 template<typename Is = std::istream, typename T = _self> 
 struct istreamable {
 
-  // public static functions
-  static void apply(Is &, T &);
+  // public static functions
+  static void apply(Is &, T &);
 };
                                                                                                      -

                                                                                                      Description

                                                                                                      -

                                                                                                      The istreamable concept allows an any to be read from a std::istream.

                                                                                                      +

                                                                                                      Description

                                                                                                      +

                                                                                                      The istreamable concept allows an any to be read from a std::istream.

                                                                                                      -

                                                                                                      -istreamable public static functions

                                                                                                      -
                                                                                                      1. static void apply(Is & out, T & arg);
                                                                                                      +

                                                                                                      +istreamable public static functions

                                                                                                      +
                                                                                                      1. static void apply(Is & out, T & arg);
                                                                                                      diff --git a/doc/html/boost/type_erasure/iterator.html b/doc/html/boost/type_erasure/iterator.html index c5288caad5..d9497d67aa 100644 --- a/doc/html/boost/type_erasure/iterator.html +++ b/doc/html/boost/type_erasure/iterator.html @@ -42,7 +42,7 @@ typedef DifferenceType difference_type; };
                                                                                                    -

                                                                                                    Description

                                                                                                    +

                                                                                                    Description

                                                                                                    The iterator concept can be used for any iterator category.

                                                                                                    The value_type of the iterator is deduced. To force it to be a specific type, use the same_type concept.

                                                                                                    @@ -53,7 +53,7 @@ The value_type of the iterator is deduced. To force it to be a specific type, us

                                                                                                    -

                                                                                                    Template Parameters

                                                                                                    +

                                                                                                    Template Parameters

                                                                                                    1. typename Traversal
                                                                                                      diff --git a/doc/html/boost/type_erasure/left_shift_assignable.html b/doc/html/boost/type_erasure/left_shift_assignable.html index 504015300a..c4c19ccd23 100644 --- a/doc/html/boost/type_erasure/left_shift_assignable.html +++ b/doc/html/boost/type_erasure/left_shift_assignable.html @@ -35,15 +35,15 @@ template<typename T = _self, typename U = T> struct left_shift_assignable { - // public static functions - static void apply(T &, const U &); + // public static functions + static void apply(T &, const U &); };
                                                                                                    -

                                                                                                    Description

                                                                                                    +

                                                                                                    Description

                                                                                                    -

                                                                                                    -left_shift_assignable public static functions

                                                                                                    -
                                                                                                    1. static void apply(T &, const U &);
                                                                                                    +

                                                                                                    +left_shift_assignable public static functions

                                                                                                    +
                                                                                                    1. static void apply(T &, const U &);
                                                                                                    diff --git a/doc/html/boost/type_erasure/left_shiftable.html b/doc/html/boost/type_erasure/left_shiftable.html index 8597ecdc03..5e6f9866a2 100644 --- a/doc/html/boost/type_erasure/left_shiftable.html +++ b/doc/html/boost/type_erasure/left_shiftable.html @@ -35,15 +35,15 @@ template<typename T = _self, typename U = T, typename R = T> struct left_shiftable { - // public static functions - static R apply(const T &, const U &); + // public static functions + static R apply(const T &, const U &); };
                                                                                                    -

                                                                                                    Description

                                                                                                    +

                                                                                                    Description

                                                                                                    -

                                                                                                    -left_shiftable public static functions

                                                                                                    -
                                                                                                    1. static R apply(const T &, const U &);
                                                                                                    +

                                                                                                    +left_shiftable public static functions

                                                                                                    +
                                                                                                    1. static R apply(const T &, const U &);
                                                                                                    diff --git a/doc/html/boost/type_erasure/less_than_comparable.html b/doc/html/boost/type_erasure/less_than_comparable.html index e53cadbb97..ff929c73ae 100644 --- a/doc/html/boost/type_erasure/less_than_comparable.html +++ b/doc/html/boost/type_erasure/less_than_comparable.html @@ -35,15 +35,15 @@ template<typename T = _self, typename U = T> struct less_than_comparable { - // public static functions - static bool apply(const T &, const U &); + // public static functions + static bool apply(const T &, const U &); };
                                                                                                    -

                                                                                                    Description

                                                                                                    +

                                                                                                    Description

                                                                                                    -

                                                                                                    -less_than_comparable public static functions

                                                                                                    -
                                                                                                    1. static bool apply(const T & lhs, const U & rhs);
                                                                                                    +

                                                                                                    +less_than_comparable public static functions

                                                                                                    +
                                                                                                    1. static bool apply(const T & lhs, const U & rhs);
                                                                                                    diff --git a/doc/html/boost/type_erasure/make_binding.html b/doc/html/boost/type_erasure/make_binding.html index 459d57cea2..01c5764bf4 100644 --- a/doc/html/boost/type_erasure/make_binding.html +++ b/doc/html/boost/type_erasure/make_binding.html @@ -35,7 +35,7 @@ template<typename Map> static_binding< Map > make_binding();
                                                                                                  -

                                                                                                  Description

                                                                                                  +

                                                                                                  Description

                                                                                                  A convenience function to prevent constructor calls from being parsed as function declarations.

                                                                                                  diff --git a/doc/html/boost/type_erasure/mod_assignable.html b/doc/html/boost/type_erasure/mod_assignable.html index 83e2f36810..bd64187b80 100644 --- a/doc/html/boost/type_erasure/mod_assignable.html +++ b/doc/html/boost/type_erasure/mod_assignable.html @@ -35,15 +35,15 @@ template<typename T = _self, typename U = T> struct mod_assignable { - // public static functions - static void apply(T &, const U &); + // public static functions + static void apply(T &, const U &); };
                                                                                                  -

                                                                                                  Description

                                                                                                  +

                                                                                                  Description

                                                                                                  -

                                                                                                  -mod_assignable public static functions

                                                                                                  -
                                                                                                  1. static void apply(T &, const U &);
                                                                                                  +

                                                                                                  +mod_assignable public static functions

                                                                                                  +
                                                                                                  1. static void apply(T &, const U &);
                                                                                                  diff --git a/doc/html/boost/type_erasure/modable.html b/doc/html/boost/type_erasure/modable.html index 0ddc4722e5..6490922f06 100644 --- a/doc/html/boost/type_erasure/modable.html +++ b/doc/html/boost/type_erasure/modable.html @@ -35,15 +35,15 @@ template<typename T = _self, typename U = T, typename R = T> struct modable { - // public static functions - static R apply(const T &, const U &); + // public static functions + static R apply(const T &, const U &); };
                                                                                                -

                                                                                                Description

                                                                                                +

                                                                                                Description

                                                                                                -

                                                                                                -modable public static functions

                                                                                                -
                                                                                                1. static R apply(const T &, const U &);
                                                                                                +

                                                                                                +modable public static functions

                                                                                                +
                                                                                                1. static R apply(const T &, const U &);
                                                                                                diff --git a/doc/html/boost/type_erasure/multipliable.html b/doc/html/boost/type_erasure/multipliable.html index 93053771f2..9bbd03f60a 100644 --- a/doc/html/boost/type_erasure/multipliable.html +++ b/doc/html/boost/type_erasure/multipliable.html @@ -35,15 +35,15 @@ template<typename T = _self, typename U = T, typename R = T> struct multipliable { - // public static functions - static R apply(const T &, const U &); + // public static functions + static R apply(const T &, const U &); };
                                                                                                -

                                                                                                Description

                                                                                                +

                                                                                                Description

                                                                                                -

                                                                                                -multipliable public static functions

                                                                                                -
                                                                                                1. static R apply(const T &, const U &);
                                                                                                +

                                                                                                +multipliable public static functions

                                                                                                +
                                                                                                1. static R apply(const T &, const U &);
                                                                                                diff --git a/doc/html/boost/type_erasure/multiply_assignable.html b/doc/html/boost/type_erasure/multiply_assignable.html index 51a1fd4be3..c71c2b1c1f 100644 --- a/doc/html/boost/type_erasure/multiply_assignable.html +++ b/doc/html/boost/type_erasure/multiply_assignable.html @@ -35,15 +35,15 @@ template<typename T = _self, typename U = T> struct multiply_assignable { - // public static functions - static void apply(T &, const U &); + // public static functions + static void apply(T &, const U &); };
                                                                                              -

                                                                                              Description

                                                                                              +

                                                                                              Description

                                                                                              -

                                                                                              -multiply_assignable public static functions

                                                                                              -
                                                                                              1. static void apply(T &, const U &);
                                                                                              +

                                                                                              +multiply_assignable public static functions

                                                                                              +
                                                                                              1. static void apply(T &, const U &);
                                                                                              diff --git a/doc/html/boost/type_erasure/negatable.html b/doc/html/boost/type_erasure/negatable.html index 305a743b4b..26b832e3ca 100644 --- a/doc/html/boost/type_erasure/negatable.html +++ b/doc/html/boost/type_erasure/negatable.html @@ -35,16 +35,16 @@ template<typename T = _self, typename R = T> struct negatable { - // public static functions - static R apply(const T &); + // public static functions + static R apply(const T &); };
                                                                                              -

                                                                                              Description

                                                                                              -

                                                                                              The negatable concept allow use of the unary minus operator on an any.

                                                                                              +

                                                                                              Description

                                                                                              +

                                                                                              The negatable concept allow use of the unary minus operator on an any.

                                                                                              -

                                                                                              -negatable public static functions

                                                                                              -
                                                                                              1. static R apply(const T &);
                                                                                              +

                                                                                              +negatable public static functions

                                                                                              +
                                                                                              1. static R apply(const T &);
                                                                                            diff --git a/doc/html/boost/type_erasure/ostreamable.html b/doc/html/boost/type_erasure/ostreamable.html index 3b8438f2b3..d95ccf60fc 100644 --- a/doc/html/boost/type_erasure/ostreamable.html +++ b/doc/html/boost/type_erasure/ostreamable.html @@ -35,16 +35,16 @@ template<typename Os = std::ostream, typename T = _self> struct ostreamable { - // public static functions - static void apply(Os &, const T &); + // public static functions + static void apply(Os &, const T &); };
                                                                                            -

                                                                                            Description

                                                                                            -

                                                                                            The ostreamable concept allows an any to be written to a std::ostream.

                                                                                            +

                                                                                            Description

                                                                                            +

                                                                                            The ostreamable concept allows an any to be written to a std::ostream.

                                                                                            -

                                                                                            -ostreamable public static functions

                                                                                            -
                                                                                            1. static void apply(Os & out, const T & arg);
                                                                                            +

                                                                                            +ostreamable public static functions

                                                                                            +
                                                                                            1. static void apply(Os & out, const T & arg);
                                                                                            diff --git a/doc/html/boost/type_erasure/param.html b/doc/html/boost/type_erasure/param.html new file mode 100644 index 0000000000..26d9d36561 --- /dev/null +++ b/doc/html/boost/type_erasure/param.html @@ -0,0 +1,105 @@ + + + + +Class template param + + + + + + + + + + + + + + + +
                                                                                            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                            +
                                                                                            +
                                                                                            +PrevUpHomeNext +
                                                                                            +
                                                                                            +
                                                                                            +
                                                                                            +

                                                                                            Class template param

                                                                                            +

                                                                                            boost::type_erasure::param — A wrapper to help with overload resolution for functions operating on an any.

                                                                                            +
                                                                                            +

                                                                                            Synopsis

                                                                                            +
                                                                                            // In header: <boost/type_erasure/param.hpp>
+
+template<typename Concept, typename T> 
+class param {
+public:
+  // construct/copy/destruct
+  template<typename U> param(any< Concept, U > &);
+  template<typename U> param(const any< Concept, U > &);
+  template<typename U> param(any< Concept, U > &&);
+
+  // public member functions
+  any< Concept, T > get() const;
+};
                                                                                            +
                                                                                            +

                                                                                            Description

                                                                                            +

                                                                                            The template arguments are interpreted in the same way as any.

                                                                                            +

                                                                                            A parameter of type param can be initialized with an any that has the same Concept and base placeholder when there exists a corresponding standard conversion for the placeholder. A conversion sequence from any<C, P> to param<C, P1> is a better conversion sequence than any<C, P> to param<C, P2> iff the corresponding placeholder standard conversion sequence from P to P1 is a better conversion sequence than P to P2.

                                                                                            +
                                                                                            + + + + + +
                                                                                            [Note]Note

                                                                                            Overloading based on cv-qualifiers and rvalue-ness is only supported in C++11. In C++03, all conversion sequences from any to param have the same rank.

                                                                                            +

                                                                                            +Example:

                                                                                            +
                                                                                            void f(param<C, _a&>);
+void f(param<C, const _a&>);
+void g(param<C, const _a&>);
+void g(param<C, _a&&>);
+
+any<C, _a> a;
+f(any<C, _a>()); // calls void f(param<C, const _a&>);
+f(a);            // calls void f(param<C, _a&>); (ambiguous in C++03)
+g(any<C, _a>()); // calls void g(param<C, _a&&>); (ambiguous in C++03)
+g(a);            // calls void g(param<C, const _a&>);
+
                                                                                            +

                                                                                            +
                                                                                            +

                                                                                            +param + public + construct/copy/destruct

                                                                                            +
                                                                                              +
                                                                                            1. template<typename U> param(any< Concept, U > & a);
                                                                                              2. +
                                                                                            2. template<typename U> param(const any< Concept, U > & a);
                                                                                              3. +
                                                                                            3. template<typename U> param(any< Concept, U > && a);
                                                                                              4. +
                                                                                            +
                                                                                            +
                                                                                            +

                                                                                            +param public member functions

                                                                                            +
                                                                                            1. +
                                                                                              any< Concept, T > get() const;
                                                                                              +

                                                                                              Returns the stored any.

                                                                                              +
                                                                                            +
                                                                                            +
                                                                                            +
                                                                                            + + + +
                                                                                            Copyright © 2011-2013 Steven Watanabe

                                                                                            + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                            +
                                                                                            +
                                                                                            +
                                                                                            +PrevUpHomeNext +
                                                                                            + + diff --git a/doc/html/boost/type_erasure/placeholder.html b/doc/html/boost/type_erasure/placeholder.html index 8a282dd368..ab2df72764 100644 --- a/doc/html/boost/type_erasure/placeholder.html +++ b/doc/html/boost/type_erasure/placeholder.html @@ -36,13 +36,13 @@ struct placeholder { };
                                                                                            -

                                                                                            Description

                                                                                            +

                                                                                            Description

                                                                                            Placeholders are used heavily throughout the library. Every placeholder must derive from placeholder. The library provides a number of placeholders, out of the box, but you are welcome to define your own, if you want more descriptive names. The placeholder _self is special in that it is used as the default wherever possible.

                                                                                            -

                                                                                            What exactly is a placeholder? Placeholders act as a substitute for template parameters in concepts. The library automatically replaces all the placeholders used in a concept with the actual types involved when it stores an object in an any.

                                                                                            +

                                                                                            What exactly is a placeholder? Placeholders act as a substitute for template parameters in concepts. The library automatically replaces all the placeholders used in a concept with the actual types involved when it stores an object in an any.

                                                                                            For example, in the following,

                                                                                            any<copy_constructible<_a>, _a> x(1);
                                                                                            -

                                                                                            The library sees that we're constructing an any that uses the _a placeholder with an int. Thus it binds _a to int and instantiates copy_constructible<int>.

                                                                                            +

                                                                                            The library sees that we're constructing an any that uses the _a placeholder with an int. Thus it binds _a to int and instantiates copy_constructible<int>.

                                                                                            When there are multiple placeholders involved, you will have to use tuple, or pass the bindings explicitly, but the substitution still works the same way.

                                                                                          diff --git a/doc/html/boost/type_erasure/placeholder_of.html b/doc/html/boost/type_erasure/placeholder_of.html index 750c1152d1..af541c1eb5 100644 --- a/doc/html/boost/type_erasure/placeholder_of.html +++ b/doc/html/boost/type_erasure/placeholder_of.html @@ -38,8 +38,8 @@ typedef unspecified type; };
                                                                                          -

                                                                                          Description

                                                                                          -

                                                                                          A metafunction returning the (const/reference qualified) placeholder corresponding to an any. It will also work for all bases of any, so it can be applied to the Base parameter of concept_interface.

                                                                                          +

                                                                                          Description

                                                                                          +

                                                                                          A metafunction returning the (const/reference qualified) placeholder corresponding to an any. It will also work for all bases of any, so it can be applied to the Base parameter of concept_interface.

                                                                                          diff --git a/doc/html/boost/type_erasure/rebind_any.html b/doc/html/boost/type_erasure/rebind_any.html index 2a4f2223d2..b128297557 100644 --- a/doc/html/boost/type_erasure/rebind_any.html +++ b/doc/html/boost/type_erasure/rebind_any.html @@ -8,7 +8,7 @@ - +
                                                                                          @@ -21,7 +21,7 @@
                                                                                          -PrevUpHomeNext +PrevUpHomeNext
                                                                                          @@ -38,8 +38,8 @@ typedef unspecified type; };
                                                                                          -

                                                                                          Description

                                                                                          -

                                                                                          A metafunction that changes the placeholder of an any. If T is not a placeholder, returns T unchanged. This class is intended to be used in concept_interface to deduce the argument types from the arguments of the concept.

                                                                                          +

                                                                                          Description

                                                                                          +

                                                                                          A metafunction that changes the placeholder of an any. If T is not a placeholder, returns T unchanged. This class is intended to be used in concept_interface to deduce the argument types from the arguments of the concept.

                                                                                          rebind_any<any<Concept>, _a>::type -> any<Concept, _a>
@@ -62,7 +62,7 @@
 
 
                                                                                          
 
                                                                                          
-PrevUpHomeNext
+PrevUpHomeNext
 
                                                                                          
 
 
diff --git a/doc/html/boost/type_erasure/register_binding.html b/doc/html/boost/type_erasure/register_binding.html
new file mode 100644
index 0000000000..f7aadaa29e
--- /dev/null
+++ b/doc/html/boost/type_erasure/register_binding.html
@@ -0,0 +1,57 @@
+
+
+
+
+Function register_binding
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
                                                                                          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                          
+
                                                                                          
+
                                                                                          
+PrevUpHomeNext
+
                                                                                          
+
                                                                                          
+
                                                                                          
+
                                                                                          
+
                                                                                          Function register_binding
                                                                                          
+
                                                                                          boost::type_erasure::register_binding
                                                                                          
+
                                                                                          
+
                                                                                          Synopsis
                                                                                          
+
                                                                                          // In header: <boost/type_erasure/register_binding.hpp>
+
+
+template<typename Concept, typename Map> 
+  void register_binding(const static_binding< Map > &);
+template<typename Concept, typename T> void register_binding();
                                                                                          
+
                                                                                          
+
                                                                                          Description
                                                                                          
+
                                                                                          Registers a model of a concept to allow downcasting any via dynamic_any_cast. 
                                                                                          
+
                                                                                          
+
                                                                                          
+
+
+
+
                                                                                          Copyright © 2011-2013 Steven Watanabe
                                                                                          
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      
                                                                                          
+
                                                                                          
+
                                                                                          
+
                                                                                          
+PrevUpHomeNext
+
                                                                                          
+
+
diff --git a/doc/html/boost/type_erasure/relaxed.html b/doc/html/boost/type_erasure/relaxed.html
index 74e9166bac..2645ab329a 100644
--- a/doc/html/boost/type_erasure/relaxed.html
+++ b/doc/html/boost/type_erasure/relaxed.html
@@ -36,13 +36,13 @@
 struct relaxed : public boost::mpl::vector0<> {
 };
                                                                                          -

                                                                                          Description

                                                                                          -

                                                                                          This special concept enables various useful default behavior that makes any act like an ordinary object. By default any forwards all operations to the underlying type, and provides only the operations that are specified in its Concept.

                                                                                          +

                                                                                          Description

                                                                                          +

                                                                                          This special concept enables various useful default behavior that makes any act like an ordinary object. By default any forwards all operations to the underlying type, and provides only the operations that are specified in its Concept.

                                                                                          In detail, relaxed enables the following:

                                                                                            -

                                                                                          • A raw value can be assigned to an any. This will replace the value stored by the any. (But note that if assignable is present, it takes priority.)

                                                                                            • -

                                                                                          • copy assignment of any uses the copy constructor if it can't use assignable (either because assignable is missing, or because the stored types do not match).

                                                                                            • -

                                                                                          • default construction of any is allowed and creates a null any.

                                                                                            • +

                                                                                          • A raw value can be assigned to an any. This will replace the value stored by the any. (But note that if assignable is present, it takes priority.)

                                                                                            • +

                                                                                          • copy assignment of any uses the copy constructor if it can't use assignable (either because assignable is missing, or because the stored types do not match).

                                                                                            • +

                                                                                          • default construction of any is allowed and creates a null any.

                                                                                          • equality_comparable: If the types do not match, it will return false.

                                                                                          • less_than_comparable: If the types do not match, the ordering will be according to std::type_info::before.

                                                                                          • if the arguments to any other function do not match, it will throw a bad_function_call exception instead of having undefined behavior.

                                                                                            • diff --git a/doc/html/boost/type_erasure/require_match.html b/doc/html/boost/type_erasure/require_match.html index 6604b24408..22b8dd29f0 100644 --- a/doc/html/boost/type_erasure/require_match.html +++ b/doc/html/boost/type_erasure/require_match.html @@ -34,13 +34,13 @@ template<typename Concept, typename Op, class... U> - void require_match(const binding< Concept > & binding, const Op & f, + void require_match(const binding< Concept > & binding, const Op & f, U &&... args); template<typename Op, class... U> void require_match(const Op & f, U &&... args);
                                                                                          -

                                                                                          Description

                                                                                          -

                                                                                          Checks that the actual types stored in all the any arguments match the types specified by binding. If they do not match then,

                                                                                          +

                                                                                          Description

                                                                                          +

                                                                                          Checks that the actual types stored in all the any arguments match the types specified by binding. If they do not match then,

                                                                                          • If relaxed is in Concept, throws bad_function_call.

                                                                                          • Otherwise the behavior is undefined.

                                                                                            • @@ -57,7 +57,7 @@

                                                                                            Postconditions:

                                                                                            -

                                                                                            call(binding, f, args...) is valid.

                                                                                            +

                                                                                            call(binding, f, args...) is valid.

                                                                                          diff --git a/doc/html/boost/type_erasure/right_shift_assignable.html b/doc/html/boost/type_erasure/right_shift_assignable.html index b923fc0c5d..bc0a4bf8aa 100644 --- a/doc/html/boost/type_erasure/right_shift_assignable.html +++ b/doc/html/boost/type_erasure/right_shift_assignable.html @@ -35,15 +35,15 @@ template<typename T = _self, typename U = T> struct right_shift_assignable { - // public static functions - static void apply(T &, const U &); + // public static functions + static void apply(T &, const U &); };
                                                                                          -

                                                                                          Description

                                                                                          +

                                                                                          Description

                                                                                          -

                                                                                          -right_shift_assignable public static functions

                                                                                          -
                                                                                          1. static void apply(T &, const U &);
                                                                                          +

                                                                                          +right_shift_assignable public static functions

                                                                                          +
                                                                                          1. static void apply(T &, const U &);
                                                                                          diff --git a/doc/html/boost/type_erasure/right_shiftable.html b/doc/html/boost/type_erasure/right_shiftable.html index 411ce35697..ed461024ed 100644 --- a/doc/html/boost/type_erasure/right_shiftable.html +++ b/doc/html/boost/type_erasure/right_shiftable.html @@ -35,15 +35,15 @@ template<typename T = _self, typename U = T, typename R = T> struct right_shiftable { - // public static functions - static R apply(const T &, const U &); + // public static functions + static R apply(const T &, const U &); };
                                                                                          -

                                                                                          Description

                                                                                          +

                                                                                          Description

                                                                                          -

                                                                                          -right_shiftable public static functions

                                                                                          -
                                                                                          1. static R apply(const T &, const U &);
                                                                                          +

                                                                                          +right_shiftable public static functions

                                                                                          +
                                                                                          1. static R apply(const T &, const U &);
                                                                                        diff --git a/doc/html/boost/type_erasure/same_type.html b/doc/html/boost/type_erasure/same_type.html index b88829ce7d..fb9d3a5ec3 100644 --- a/doc/html/boost/type_erasure/same_type.html +++ b/doc/html/boost/type_erasure/same_type.html @@ -36,7 +36,7 @@ struct same_type { };
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        A built in concept that indicates that two types are the same. Either T or U or both can be placeholders.

                                                                                        diff --git a/doc/html/boost/type_erasure/static_binding.html b/doc/html/boost/type_erasure/static_binding.html index 0f0780be8d..9a8e280897 100644 --- a/doc/html/boost/type_erasure/static_binding.html +++ b/doc/html/boost/type_erasure/static_binding.html @@ -36,7 +36,7 @@ structstatic_binding{};
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        Represents a mapping from placeholders to the actual types that they bind to.

                                                                                        diff --git a/doc/html/boost/type_erasure/subscriptable.html b/doc/html/boost/type_erasure/subscriptable.html index 4bfd24fa98..4b37107715 100644 --- a/doc/html/boost/type_erasure/subscriptable.html +++ b/doc/html/boost/type_erasure/subscriptable.html @@ -35,15 +35,15 @@ template<typename R, typename T = _self, typename N = std::ptrdiff_t> struct subscriptable { - // public static functions - static R apply(T &, const N &); + // public static functions + static R apply(T &, const N &); };
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        -

                                                                                        -subscriptable public static functions

                                                                                        -
                                                                                        1. static R apply(T & arg, const N & index);
                                                                                        +

                                                                                        +subscriptable public static functions

                                                                                        +
                                                                                        1. static R apply(T & arg, const N & index);
                                                                                        diff --git a/doc/html/boost/type_erasure/subtract_assignable.html b/doc/html/boost/type_erasure/subtract_assignable.html index b657111c5e..adaf4ad08b 100644 --- a/doc/html/boost/type_erasure/subtract_assignable.html +++ b/doc/html/boost/type_erasure/subtract_assignable.html @@ -35,15 +35,15 @@ template<typename T =_self,typename U =T>structsubtract_assignable{ - // public static functions - staticvoidapply(T&,constU&); + // public static functions + staticvoidapply(T&,constU&);};
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        -

                                                                                        -subtract_assignable public static functions

                                                                                        -
                                                                                        1. static void apply(T &, const U &);
                                                                                        +

                                                                                        +subtract_assignable public static functions

                                                                                        +
                                                                                        1. static void apply(T &, const U &);
                                                                                        diff --git a/doc/html/boost/type_erasure/subtractable.html b/doc/html/boost/type_erasure/subtractable.html index 47b80cfe01..852c9899a0 100644 --- a/doc/html/boost/type_erasure/subtractable.html +++ b/doc/html/boost/type_erasure/subtractable.html @@ -8,7 +8,7 @@ - +
                                                                                        @@ -21,7 +21,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        @@ -35,15 +35,15 @@ template<typename T = _self, typename U = T, typename R = T> struct subtractable { - // public static functions - static R apply(const T &, const U &); + // public static functions + static R apply(const T &, const U &); };
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        -

                                                                                        -subtractable public static functions

                                                                                        -
                                                                                        1. static R apply(const T &, const U &);
                                                                                        +

                                                                                        +subtractable public static functions

                                                                                        +
                                                                                        1. static R apply(const T &, const U &);
                                                                                        @@ -57,7 +57,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        diff --git a/doc/html/boost/type_erasure/tuple.html b/doc/html/boost/type_erasure/tuple.html index 917e8d3686..af4f81d91a 100644 --- a/doc/html/boost/type_erasure/tuple.html +++ b/doc/html/boost/type_erasure/tuple.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        @@ -36,19 +36,19 @@ class tuple { public: // construct/copy/destruct - template<class... U> explicit tuple(U &&...); + template<class... U> explicit tuple(U &&...); };
                                                                                        -

                                                                                        Description

                                                                                        -

                                                                                        tuple is a Boost.Fusion Random Access Sequence containing anys. Concept specifies the Concept for each of the elements. The remaining arguments must be (possibly const and/or reference qualified) placeholders, which are the placeholders of the elements.

                                                                                        +

                                                                                        Description

                                                                                        +

                                                                                        tuple is a Boost.Fusion Random Access Sequence containing anys. Concept specifies the Concept for each of the elements. The remaining arguments must be (possibly const and/or reference qualified) placeholders, which are the placeholders of the elements.

                                                                                        -

                                                                                        +

                                                                                        tuple public construct/copy/destruct

                                                                                        1. -
                                                                                          template<class... U> explicit tuple(U &&... args);
                                                                                          -

                                                                                          Constructs a tuple. Each element of args will be used to initialize the corresponding any member. The binding for the tuple elements is determined by mapping the placeholders in T to the corresponding types in U.

                                                                                          +
                                                                                          template<class... U> explicit tuple(U &&... args);
                                                                                          +

                                                                                          Constructs a tuple. Each element of args will be used to initialize the corresponding any member. The binding for the tuple elements is determined by mapping the placeholders in T to the corresponding types in U.

                                                                                        @@ -63,7 +63,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        diff --git a/doc/html/boost/type_erasure/typeid_.html b/doc/html/boost/type_erasure/typeid_.html index 9f4837d57b..0ab57e8f25 100644 --- a/doc/html/boost/type_erasure/typeid_.html +++ b/doc/html/boost/type_erasure/typeid_.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        @@ -36,14 +36,14 @@ struct typeid_ { };
                                                                                        -

                                                                                        Description

                                                                                        -

                                                                                        Enables runtime type information. This is required if you want to use any_cast or typeid_of.

                                                                                        +

                                                                                        Description

                                                                                        +

                                                                                        Enables runtime type information. This is required if you want to use any_cast or typeid_of.

                                                                                        - +
                                                                                        [Note] Note

                                                                                        typeid_ cannot be specialized because several library components including any_cast would not work correctly if its behavior changed. There is no need to specialize it anyway, since it works for all types. typeid_ also cannot be passed to call. To access it, use typeid_of.

                                                                                        typeid_ cannot be specialized because several library components including any_cast would not work correctly if its behavior changed. There is no need to specialize it anyway, since it works for all types. typeid_ also cannot be passed to call. To access it, use typeid_of.

                                                                                        @@ -59,7 +59,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        diff --git a/doc/html/boost/type_erasure/typeid_of.html b/doc/html/boost/type_erasure/typeid_of.html index 0d5f08f6b5..b097213c30 100644 --- a/doc/html/boost/type_erasure/typeid_of.html +++ b/doc/html/boost/type_erasure/typeid_of.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        @@ -36,10 +36,10 @@ template<typename Concept, typename T> const std::type_info & typeid_of(const any< Concept, T > & arg); template<typename T, typename Concept> - const std::type_info & typeid_of(const binding< Concept > & binding);
                                                                                        + const std::type_info & typeid_of(const binding< Concept > & binding);
                                                                                        -

                                                                                        Description

                                                                                        -

                                                                                        The first form returns the type currently stored in an any.

                                                                                        +

                                                                                        Description

                                                                                        +

                                                                                        The first form returns the type currently stored in an any.

                                                                                        The second form returns the type corresponding to a placeholder in binding.

                                                                                        @@ -72,7 +72,7 @@

                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        diff --git a/doc/html/boost/typeindex/ctti_type_index.html b/doc/html/boost/typeindex/ctti_type_index.html index 803f87c5db..10b0a88c47 100644 --- a/doc/html/boost/typeindex/ctti_type_index.html +++ b/doc/html/boost/typeindex/ctti_type_index.html @@ -39,61 +39,61 @@ typedef unspecified type_info_t; // construct/copy/destruct - ctti_type_index() noexcept; - ctti_type_index(const type_info_t &) noexcept; + ctti_type_index() noexcept; + ctti_type_index(const type_info_t &) noexcept; - // private member functions - std::size_t get_raw_name_length() const noexcept; + // private member functions + std::size_t get_raw_name_length() const noexcept; - // public member functions - const type_info_t & type_info() const noexcept; - const char * raw_name() const noexcept; - std::string pretty_name() const; - std::size_t hash_code() const noexcept; + // public member functions + const type_info_t & type_info() const noexcept; + const char * raw_name() const noexcept; + std::string pretty_name() const; + std::size_t hash_code() const noexcept; - // public static functions - template<typename T> static ctti_type_index type_id() noexcept; - template<typename T> static ctti_type_index type_id_with_cvr() noexcept; + // public static functions + template<typename T> static ctti_type_index type_id() noexcept; + template<typename T> static ctti_type_index type_id_with_cvr() noexcept; template<typename T> - static ctti_type_index type_id_runtime(const T &) noexcept; + static ctti_type_index type_id_runtime(const T &) noexcept; };
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        This class is a wrapper that pretends to work exactly like stl_type_index, but does not require RTTI support. For description of functions see type_index_facade.

                                                                                        This class produces slightly longer type names, so consider using stl_type_index in situations when typeid() is working.

                                                                                        -

                                                                                        +

                                                                                        ctti_type_index public construct/copy/destruct

                                                                                          -
                                                                                        1. ctti_type_index() noexcept;
                                                                                          2. -
                                                                                        2. ctti_type_index(const type_info_t & data) noexcept;
                                                                                          3. +
                                                                                        3. ctti_type_index() noexcept;
                                                                                          4. +
                                                                                        4. ctti_type_index(const type_info_t & data) noexcept;
                                                                                        -

                                                                                        -ctti_type_index private member functions

                                                                                        -
                                                                                        1. std::size_t get_raw_name_length() const noexcept;
                                                                                        +

                                                                                        +ctti_type_index private member functions

                                                                                        +
                                                                                        1. std::size_t get_raw_name_length() const noexcept;
                                                                                        -

                                                                                        -ctti_type_index public member functions

                                                                                        +

                                                                                        +ctti_type_index public member functions

                                                                                          -
                                                                                        1. const type_info_t & type_info() const noexcept;
                                                                                          2. -
                                                                                        2. const char * raw_name() const noexcept;
                                                                                          3. -
                                                                                        3. std::string pretty_name() const;
                                                                                          4. -
                                                                                        4. std::size_t hash_code() const noexcept;
                                                                                          5. +
                                                                                        5. const type_info_t & type_info() const noexcept;
                                                                                          6. +
                                                                                        6. const char * raw_name() const noexcept;
                                                                                          7. +
                                                                                        7. std::string pretty_name() const;
                                                                                          8. +
                                                                                        8. std::size_t hash_code() const noexcept;
                                                                                        -

                                                                                        -ctti_type_index public static functions

                                                                                        +

                                                                                        +ctti_type_index public static functions

                                                                                          -
                                                                                        1. template<typename T> static ctti_type_index type_id() noexcept;
                                                                                          2. -
                                                                                        2. template<typename T> static ctti_type_index type_id_with_cvr() noexcept;
                                                                                          3. +
                                                                                        3. template<typename T> static ctti_type_index type_id() noexcept;
                                                                                          4. +
                                                                                        4. template<typename T> static ctti_type_index type_id_with_cvr() noexcept;
                                                                                        5. template<typename T> 
-  static ctti_type_index type_id_runtime(const T & variable) noexcept;
                                                                                          6. + static ctti_type_index type_id_runtime(const T & variable) noexcept;
                                                                                        diff --git a/doc/html/boost/typeindex/hash_val_idm45506981463280.html b/doc/html/boost/typeindex/hash_val_idm45506981463280.html new file mode 100644 index 0000000000..d70d939014 --- /dev/null +++ b/doc/html/boost/typeindex/hash_val_idm45506981463280.html @@ -0,0 +1,65 @@ + + + + +Function template hash_value + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Function template hash_value

                                                                                        +

                                                                                        boost::typeindex::hash_value

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/type_index/type_index_facade.hpp>
+
+
+template<typename Derived, typename TypeInfo> 
+  std::size_t hash_value(const type_index_facade< Derived, TypeInfo > & lhs);
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +

                                                                                        This free function is used by Boost's unordered containers.

                                                                                        +
                                                                                        + + + + + +
                                                                                        [Note]Note

                                                                                        <boost/functional/hash.hpp> has to be included if this function is used.

                                                                                        +

                                                                                        +

                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2012-2014 Antony Polukhin

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/typeindex/hash_value_idp309934480.html b/doc/html/boost/typeindex/hash_value_idp309934480.html deleted file mode 100644 index 410e5f6f7f..0000000000 --- a/doc/html/boost/typeindex/hash_value_idp309934480.html +++ /dev/null @@ -1,65 +0,0 @@ - - - - -Function template hash_value - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Function template hash_value

                                                                                        -

                                                                                        boost::typeindex::hash_value

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/type_index/type_index_facade.hpp>
-
-
-template<typename Derived, typename TypeInfo> 
-  std::size_t hash_value(const type_index_facade< Derived, TypeInfo > & lhs);
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -

                                                                                        This free function is used by Boost's unordered containers.

                                                                                        -
                                                                                        - - - - - -
                                                                                        [Note]Note

                                                                                        <boost/functional/hash.hpp> has to be included if this function is used.

                                                                                        -

                                                                                        -

                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2012-2014 Antony Polukhin

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/typeindex/stl_type_index.html b/doc/html/boost/typeindex/stl_type_index.html index 3288c6e461..2a091926e4 100644 --- a/doc/html/boost/typeindex/stl_type_index.html +++ b/doc/html/boost/typeindex/stl_type_index.html @@ -40,59 +40,59 @@ typedef std::type_info type_info_t; // construct/copy/destruct - stl_type_index() noexcept; - stl_type_index(const type_info_t &) noexcept; + stl_type_index() noexcept; + stl_type_index(const type_info_t &) noexcept; - // public member functions - const type_info_t & type_info() const noexcept; - const char * raw_name() const noexcept; - const char * name() const noexcept; - std::string pretty_name() const; - std::size_t hash_code() const noexcept; - bool equal(const stl_type_index &) const noexcept; - bool before(const stl_type_index &) const noexcept; + // public member functions + const type_info_t & type_info() const noexcept; + const char * raw_name() const noexcept; + const char * name() const noexcept; + std::string pretty_name() const; + std::size_t hash_code() const noexcept; + bool equal(const stl_type_index &) const noexcept; + bool before(const stl_type_index &) const noexcept; - // public static functions - template<typename T> static stl_type_index type_id() noexcept; - template<typename T> static stl_type_index type_id_with_cvr() noexcept; + // public static functions + template<typename T> static stl_type_index type_id() noexcept; + template<typename T> static stl_type_index type_id_with_cvr() noexcept; template<typename T> - static stl_type_index type_id_runtime(const T &) noexcept; + static stl_type_index type_id_runtime(const T &) noexcept; };
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        This class is a wrapper around std::type_info, that workarounds issues and provides much more rich interface. For description of functions see type_index_facade.

                                                                                        This class requires typeid() to work. For cases when RTTI is disabled see ctti_type_index.

                                                                                        -

                                                                                        +

                                                                                        stl_type_index public construct/copy/destruct

                                                                                          -
                                                                                        1. stl_type_index() noexcept;
                                                                                          2. -
                                                                                        2. stl_type_index(const type_info_t & data) noexcept;
                                                                                          3. +
                                                                                        3. stl_type_index() noexcept;
                                                                                          4. +
                                                                                        4. stl_type_index(const type_info_t & data) noexcept;
                                                                                        -

                                                                                        -stl_type_index public member functions

                                                                                        +

                                                                                        +stl_type_index public member functions

                                                                                          -
                                                                                        1. const type_info_t & type_info() const noexcept;
                                                                                          2. -
                                                                                        2. const char * raw_name() const noexcept;
                                                                                          3. -
                                                                                        3. const char * name() const noexcept;
                                                                                          4. -
                                                                                        4. std::string pretty_name() const;
                                                                                          5. -
                                                                                        5. std::size_t hash_code() const noexcept;
                                                                                          6. -
                                                                                        6. bool equal(const stl_type_index & rhs) const noexcept;
                                                                                          7. -
                                                                                        7. bool before(const stl_type_index & rhs) const noexcept;
                                                                                          8. +
                                                                                        8. const type_info_t & type_info() const noexcept;
                                                                                          9. +
                                                                                        9. const char * raw_name() const noexcept;
                                                                                          10. +
                                                                                        10. const char * name() const noexcept;
                                                                                          11. +
                                                                                        11. std::string pretty_name() const;
                                                                                          12. +
                                                                                        12. std::size_t hash_code() const noexcept;
                                                                                          13. +
                                                                                        13. bool equal(const stl_type_index & rhs) const noexcept;
                                                                                          14. +
                                                                                        14. bool before(const stl_type_index & rhs) const noexcept;
                                                                                        -

                                                                                        -stl_type_index public static functions

                                                                                        +

                                                                                        +stl_type_index public static functions

                                                                                          -
                                                                                        1. template<typename T> static stl_type_index type_id() noexcept;
                                                                                          2. -
                                                                                        2. template<typename T> static stl_type_index type_id_with_cvr() noexcept;
                                                                                          3. +
                                                                                        3. template<typename T> static stl_type_index type_id() noexcept;
                                                                                          4. +
                                                                                        4. template<typename T> static stl_type_index type_id_with_cvr() noexcept;
                                                                                        5. template<typename T> 
-  static stl_type_index type_id_runtime(const T & value) noexcept;
                                                                                          6. + static stl_type_index type_id_runtime(const T & value) noexcept;
                                                                                        diff --git a/doc/html/boost/typeindex/type_id.html b/doc/html/boost/typeindex/type_id.html index 29ccdde82c..f7779e62df 100644 --- a/doc/html/boost/typeindex/type_id.html +++ b/doc/html/boost/typeindex/type_id.html @@ -35,7 +35,7 @@ template<typename T> type_index type_id();
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        Function to get boost::typeindex::type_index for a type T. Removes const, volatile && and & modifiers from T.

                                                                                        Example: 

                                                                                        type_index ti = type_id<int&>();
diff --git a/doc/html/boost/typeindex/type_id_runtime.html b/doc/html/boost/typeindex/type_id_runtime.html
index c734bf5081..043cf866c2 100644
--- a/doc/html/boost/typeindex/type_id_runtime.html
+++ b/doc/html/boost/typeindex/type_id_runtime.html
@@ -35,7 +35,7 @@
 
 template<typename T> type_index type_id_runtime(const T & runtime_val);
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        Function that works exactly like C++ typeid(rtti_val) call, but returns boost::type_index.

                                                                                        Retunrs runtime information about specified type.

                                                                                        Requirements: RTTI available or Base and Derived classes must be marked with BOOST_TYPE_INDEX_REGISTER_CLASS.

                                                                                        diff --git a/doc/html/boost/typeindex/type_id_with_cvr.html b/doc/html/boost/typeindex/type_id_with_cvr.html index 79aef2924f..29ab005076 100644 --- a/doc/html/boost/typeindex/type_id_with_cvr.html +++ b/doc/html/boost/typeindex/type_id_with_cvr.html @@ -35,7 +35,7 @@ template<typename T> type_index type_id_with_cvr();
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        Function for constructing boost::typeindex::type_index instance for type T. Does not remove const, volatile, & and && modifiers from T.

                                                                                        If T has no const, volatile, & and && modifiers, then returns exactly the same result as in case of calling type_id<T>().

                                                                                        Example:

                                                                                        diff --git a/doc/html/boost/typeindex/type_index.html b/doc/html/boost/typeindex/type_index.html index 63485a63f0..326283946d 100644 --- a/doc/html/boost/typeindex/type_index.html +++ b/doc/html/boost/typeindex/type_index.html @@ -35,7 +35,7 @@ typedef platform_specific type_index;
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        Depending on a compiler flags, optimal implementation of type_index will be used as a default boost::typeindex::type_index.

                                                                                        Could be a boost::typeindex::stl_type_index, boost::typeindex::ctti_type_index or user defined type_index class.

                                                                                        See boost::typeindex::type_index_facade for a full description of type_index functions.

                                                                                        diff --git a/doc/html/boost/typeindex/type_index_facade.html b/doc/html/boost/typeindex/type_index_facade.html index c7c44d9df9..35f5b8aba1 100644 --- a/doc/html/boost/typeindex/type_index_facade.html +++ b/doc/html/boost/typeindex/type_index_facade.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        @@ -38,24 +38,24 @@ // types typedef TypeInfo type_info_t; - // public member functions - const char * name() const noexcept; - std::string pretty_name() const; - bool equal(const Derived &) const noexcept; - bool before(const Derived &) const noexcept; - std::size_t hash_code() const noexcept; + // public member functions + const char * name() const noexcept; + std::string pretty_name() const; + bool equal(const Derived &) const noexcept; + bool before(const Derived &) const noexcept; + std::size_t hash_code() const noexcept; - // protected member functions - const char * raw_name() const noexcept; - const type_info_t & type_info() const noexcept; + // protected member functions + const char * raw_name() const noexcept; + const type_info_t & type_info() const noexcept; - // protected static functions - template<typename T> static Derived type_id() noexcept; - template<typename T> static Derived type_id_with_cvr() noexcept; - template<typename T> static Derived type_id_runtime(const T &) noexcept; + // protected static functions + template<typename T> static Derived type_id() noexcept; + template<typename T> static Derived type_id_with_cvr() noexcept; + template<typename T> static Derived type_id_runtime(const T &) noexcept; };
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        This class takes care about the comparison operators, hash functions and ostream operators. Use this class as a public base class for defining new type_info-conforming classes.

                                                                                        Example: 

                                                                                        class stl_type_index: public type_index_facade<stl_type_index, std::type_info> 
@@ -88,7 +88,7 @@
 
                                                                                        
 
                                                                                        
 
                                                                                        
-
                                                                                        Template Parameters
                                                                                        
+
                                                                                        Template Parameters
                                                                                        
 
                                                                                          
 
                                                                                        1. 
 
                                                                                          typename Derived
                                                                                          
@@ -101,11 +101,11 @@
 
                                                                                        
 
                                                                                        
 
                                                                                        
-
                                                                                        
-type_index_facade public member functions
                                                                                        
+
                                                                                        
+type_index_facade public member functions
                                                                                        
 
                                                                                          
 
                                                                                        1. 
-
                                                                                          const char * name() const noexcept;
                                                                                          
+
                                                                                          const char * name() const noexcept;
                                                                                          
 
                                                                                          Override: This function may be redefined in Derived class. Overrides must not throw. 
 
                                                                                          
 
                                                                                          
@@ -120,7 +120,7 @@
 
                                                                                          
 
                                                                                          2. 
 
                                                                                        2. 
-
                                                                                          std::string pretty_name() const;
                                                                                          
+
                                                                                          std::string pretty_name() const;
                                                                                          
 
                                                                                          Override: This function may be redefined in Derived class. Overrides may throw. 
 
                                                                                          
 
                                                                                          
@@ -135,7 +135,7 @@
 
                                                                                          
 
                                                                                          3. 
 
                                                                                        3. 
-
                                                                                          bool equal(const Derived & rhs) const noexcept;
                                                                                          
+
                                                                                          bool equal(const Derived & rhs) const noexcept;
                                                                                          
 
                                                                                          Override: This function may be redefined in Derived class. Overrides must not throw. 
 
                                                                                          
 
                                                                                          
@@ -150,7 +150,7 @@
 
                                                                                          
 
                                                                                          4. 
 
                                                                                        4. 
-
                                                                                          bool before(const Derived & rhs) const noexcept;
                                                                                          
+
                                                                                          bool before(const Derived & rhs) const noexcept;
                                                                                          
 
                                                                                          Override: This function may be redefined in Derived class. Overrides must not throw. 
 
                                                                                          
 
                                                                                          
@@ -165,7 +165,7 @@
 
                                                                                          
 
                                                                                          5. 
 
                                                                                        5. 
-
                                                                                          std::size_t hash_code() const noexcept;
                                                                                          
+
                                                                                          std::size_t hash_code() const noexcept;
                                                                                          
 
                                                                                          Override: This function may be redefined in Derived class. Overrides must not throw. 
 
                                                                                          
 
                                                                                          
@@ -191,11 +191,11 @@
 
                                                                                          
-
                                                                                          
-type_index_facade protected member functions
                                                                                          
+
                                                                                          
+type_index_facade protected member functions
                                                                                          
 
                                                                                            
 
                                                                                          1. 
-
                                                                                            const char * raw_name() const noexcept;
                                                                                            
+
                                                                                            const char * raw_name() const noexcept;
                                                                                            
 
                                                                                            Override: This function must be redefined in Derived class. Overrides must not throw. 
 
                                                                                            
 
                                                                                          
 
 
                                                                                          
@@ -210,7 +210,7 @@
 
                                                                                          
 
                                                                                          6. 
 
                                                                                        6. 
-
                                                                                          const type_info_t & type_info() const noexcept;
                                                                                          
+
                                                                                          const type_info_t & type_info() const noexcept;
                                                                                          
 
                                                                                          Override: This function may be redefined in Derived class. Overrides must not throw. 
 
                                                                                          
 
                                                                                          
@@ -227,11 +227,11 @@
 
                                                                                          
-
                                                                                          
-type_index_facade protected static functions
                                                                                          
+
                                                                                          
+type_index_facade protected static functions
                                                                                          
 
                                                                                            
 
                                                                                          1. 
-
                                                                                            template<typename T> static Derived type_id() noexcept;
                                                                                            
+
                                                                                            template<typename T> static Derived type_id() noexcept;
                                                                                            
 
                                                                                            This is a factory method that is used to create instances of Derived classes. boost::typeindex::type_id() will call this method, if Derived has same type as boost::typeindex::type_index.
                                                                                            
 
                                                                                            Override: This function may be redefined and made public in Derived class. Overrides must not throw. Overrides must remove const, volatile && and & modifiers from T. 
 
@@ -263,7 +263,7 @@
 
                                                                                          
 
 
                                                                                          
 
                                                                                          7. 
 
                                                                                        7. 
-
                                                                                          template<typename T> static Derived type_id_with_cvr() noexcept;
                                                                                          
+
                                                                                          template<typename T> static Derived type_id_with_cvr() noexcept;
                                                                                          
 
                                                                                          This is a factory method that is used to create instances of Derived classes. boost::typeindex::type_id_with_cvr() will call this method, if Derived has same type as boost::typeindex::type_index.
                                                                                          
 
                                                                                          Override: This function may be redefined and made public in Derived class. Overrides must not throw. Overrides must not remove const, volatile && and & modifiers from T. 
 
@@ -296,7 +296,7 @@
 
                                                                                          8. 
 
                                                                                        8. 
 
                                                                                          template<typename T> 
-  static Derived type_id_runtime(const T & variable) noexcept;
                                                                                          
+  static Derived type_id_runtime(const T & variable) noexcept;

                                                                                        This is a factory method that is used to create instances of Derived classes. boost::typeindex::type_id_runtime(const T&) will call this method, if Derived has same type as boost::typeindex::type_index.

                                                                                        Override: This function may be redefined and made public in Derived class. @@ -341,7 +341,7 @@

                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        diff --git a/doc/html/boost/typeindex/type_info.html b/doc/html/boost/typeindex/type_info.html index 6e3c1a7b68..43aba20d32 100644 --- a/doc/html/boost/typeindex/type_info.html +++ b/doc/html/boost/typeindex/type_info.html @@ -35,7 +35,7 @@ typedef type_index::type_info_t type_info;
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        Depending on a compiler flags, optimal implementation of type_info will be used as a default boost::typeindex::type_info.

                                                                                        Could be a std::type_info, boost::typeindex::detail::ctti_data or some user defined class.

                                                                                        type_info is not copyable or default constructible. It is not assignable too!

                                                                                        diff --git a/doc/html/boost/uninitialized_copy_or_move.html b/doc/html/boost/uninitialized_copy_or_move.html index 6db52c045c..3914ea96b9 100644 --- a/doc/html/boost/uninitialized_copy_or_move.html +++ b/doc/html/boost/uninitialized_copy_or_move.html @@ -35,7 +35,7 @@ template<typename I, typename F> F uninitialized_copy_or_move(I f, I l, F r);
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        Effects: 

                                                                                        for (; first != last; ++result, ++first)
    new (static_cast<void*>(&*result))
diff --git a/doc/html/boost/uninitialized_move.html b/doc/html/boost/uninitialized_move.html
index 00de03b1fa..769fd042ce 100644
--- a/doc/html/boost/uninitialized_move.html
+++ b/doc/html/boost/uninitialized_move.html
@@ -35,7 +35,7 @@
 
 template<typename I, typename F> F uninitialized_move(I f, I l, F r);
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        Effects: 

                                                                                        for (; first != last; ++result, ++first)
    new (static_cast<void*>(&*result))
diff --git a/doc/html/boost/units/absolute.html b/doc/html/boost/units/absolute.html
index 60d0e79b5b..60db644847 100644
--- a/doc/html/boost/units/absolute.html
+++ b/doc/html/boost/units/absolute.html
@@ -40,38 +40,38 @@
   typedef Y             value_type;
 
   // construct/copy/destruct
-  absolute();
-  absolute(const value_type &);
-  absolute(const this_type &);
-  this_type & operator=(const this_type &);
+  absolute();
+  absolute(const value_type &);
+  absolute(const this_type &);
+  this_type & operator=(const this_type &);
 
-  // public member functions
-  const value_type & value() const;
-  const this_type & operator+=(const value_type &);
-  const this_type & operator-=(const value_type &);
+  // public member functions
+  const value_type & value() const;
+  const this_type & operator+=(const value_type &);
+  const this_type & operator-=(const value_type &);
 };
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        A wrapper to represent absolute units (points rather than vectors). Intended originally for temperatures, this class implements operators for absolute units so that addition of a relative unit to an absolute unit results in another absolute unit : absolute<T> +/- T -> absolute<T> and subtraction of one absolute unit from another results in a relative unit : absolute<T> - absolute<T> -> T.

                                                                                        -

                                                                                        +

                                                                                        absolute public construct/copy/destruct

                                                                                          -
                                                                                        1. absolute();
                                                                                          2. -
                                                                                        2. absolute(const value_type & val);
                                                                                          3. -
                                                                                        3. absolute(const this_type & source);
                                                                                          4. -
                                                                                        4. this_type & operator=(const this_type & source);
                                                                                          5. +
                                                                                        5. absolute();
                                                                                          6. +
                                                                                        6. absolute(const value_type & val);
                                                                                          7. +
                                                                                        7. absolute(const this_type & source);
                                                                                          8. +
                                                                                        8. this_type & operator=(const this_type & source);
                                                                                        -

                                                                                        -absolute public member functions

                                                                                        +

                                                                                        +absolute public member functions

                                                                                          -
                                                                                        1. const value_type & value() const;
                                                                                          2. -
                                                                                        2. const this_type & operator+=(const value_type & val);
                                                                                          3. -
                                                                                        3. const this_type & operator-=(const value_type & val);
                                                                                          4. +
                                                                                        4. const value_type & value() const;
                                                                                          5. +
                                                                                        5. const this_type & operator+=(const value_type & val);
                                                                                          6. +
                                                                                        6. const this_type & operator-=(const value_type & val);
                                                                                        diff --git a/doc/html/boost/units/abstract/length_unit_tag.html b/doc/html/boost/units/abstract/length_unit_tag.html index 80622164b3..02185fb572 100644 --- a/doc/html/boost/units/abstract/length_unit_tag.html +++ b/doc/html/boost/units/abstract/length_unit_tag.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        @@ -49,7 +49,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        diff --git a/doc/html/boost/units/abstract/luminous_idm45506849409120.html b/doc/html/boost/units/abstract/luminous_idm45506849409120.html new file mode 100644 index 0000000000..0154668ad1 --- /dev/null +++ b/doc/html/boost/units/abstract/luminous_idm45506849409120.html @@ -0,0 +1,54 @@ + + + + +Struct luminous_intensity_unit_tag + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct luminous_intensity_unit_tag

                                                                                        +

                                                                                        boost::units::abstract::luminous_intensity_unit_tag

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/systems/abstract.hpp>
+
+
+struct luminous_intensity_unit_tag : public base_unit< luminous_intensity_unit_tag, luminous_intensity_dimension,-24 >
+{
+};
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/abstract/luminous_inte_idp349555136.html b/doc/html/boost/units/abstract/luminous_inte_idp349555136.html deleted file mode 100644 index a7a204ceb0..0000000000 --- a/doc/html/boost/units/abstract/luminous_inte_idp349555136.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct luminous_intensity_unit_tag - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct luminous_intensity_unit_tag

                                                                                        -

                                                                                        boost::units::abstract::luminous_intensity_unit_tag

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/systems/abstract.hpp>
-
-
-struct luminous_intensity_unit_tag : public base_unit< luminous_intensity_unit_tag, luminous_intensity_dimension,-24 >
-{
-};
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/abstract/mass_unit_tag.html b/doc/html/boost/units/abstract/mass_unit_tag.html index 0bff8434ab..700ba5d8ec 100644 --- a/doc/html/boost/units/abstract/mass_unit_tag.html +++ b/doc/html/boost/units/abstract/mass_unit_tag.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        @@ -47,7 +47,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        diff --git a/doc/html/boost/units/abstract/time_unit_tag.html b/doc/html/boost/units/abstract/time_unit_tag.html index 8a8a4c2dc1..43b3001de5 100644 --- a/doc/html/boost/units/abstract/time_unit_tag.html +++ b/doc/html/boost/units/abstract/time_unit_tag.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        @@ -47,7 +47,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        diff --git a/doc/html/boost/units/add_type_idm45506851507072.html b/doc/html/boost/units/add_type_idm45506851507072.html new file mode 100644 index 0000000000..63ac1ef678 --- /dev/null +++ b/doc/html/boost/units/add_type_idm45506851507072.html @@ -0,0 +1,58 @@ + + + + +Struct template add_typeof_helper<quantity< unit< Dim1, System1 >, X >, quantity< unit< Dim2, System2 >, Y >> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct template add_typeof_helper<quantity< unit< Dim1, System1 >, X >, quantity< unit< Dim2, System2 >, Y >>

                                                                                        +

                                                                                        boost::units::add_typeof_helper<quantity< unit< Dim1, System1 >, X >, quantity< unit< Dim2, System2 >, Y >>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/quantity.hpp>
+
+template<typename Dim1, typename System1, typename Dim2, typename System2, 
+         typename X, typename Y> 
+struct add_typeof_helper<quantity< unit< Dim1, System1 >, X >, quantity< unit< Dim2, System2 >, Y >> {
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +

                                                                                        for sun CC we need to invoke SFINAE at the top level, otherwise it will silently return int.

                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/add_type_idm45506851515280.html b/doc/html/boost/units/add_type_idm45506851515280.html new file mode 100644 index 0000000000..31d59ee57d --- /dev/null +++ b/doc/html/boost/units/add_type_idm45506851515280.html @@ -0,0 +1,57 @@ + + + + +Struct template add_typeof_helper<quantity< unit< Dim, System >, X >, quantity< unit< Dim, System >, Y >> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct template add_typeof_helper<quantity< unit< Dim, System >, X >, quantity< unit< Dim, System >, Y >>

                                                                                        +

                                                                                        boost::units::add_typeof_helper<quantity< unit< Dim, System >, X >, quantity< unit< Dim, System >, Y >>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/quantity.hpp>
+
+template<typename Dim, typename System, typename X, typename Y> 
+struct add_typeof_helper<quantity< unit< Dim, System >, X >, quantity< unit< Dim, System >, Y >> {
+  // types
+  typedef add_typeof_helper< X, Y >::type   value_type;
+  typedef unit< Dim, System >               unit_type; 
+  typedef quantity< unit_type, value_type > type;      
+};
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/add_typeof_he_idp347448976.html b/doc/html/boost/units/add_typeof_he_idp347448976.html deleted file mode 100644 index cd81d11055..0000000000 --- a/doc/html/boost/units/add_typeof_he_idp347448976.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Struct template add_typeof_helper<quantity< unit< Dim, System >, X >, quantity< unit< Dim, System >, Y >> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct template add_typeof_helper<quantity< unit< Dim, System >, X >, quantity< unit< Dim, System >, Y >>

                                                                                        -

                                                                                        boost::units::add_typeof_helper<quantity< unit< Dim, System >, X >, quantity< unit< Dim, System >, Y >>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/quantity.hpp>
-
-template<typename Dim, typename System, typename X, typename Y> 
-struct add_typeof_helper<quantity< unit< Dim, System >, X >, quantity< unit< Dim, System >, Y >> {
-  // types
-  typedef add_typeof_helper< X, Y >::type   value_type;
-  typedef unit< Dim, System >               unit_type; 
-  typedef quantity< unit_type, value_type > type;      
-};
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/add_typeof_he_idp347457184.html b/doc/html/boost/units/add_typeof_he_idp347457184.html deleted file mode 100644 index d60166f1b6..0000000000 --- a/doc/html/boost/units/add_typeof_he_idp347457184.html +++ /dev/null @@ -1,58 +0,0 @@ - - - - -Struct template add_typeof_helper<quantity< unit< Dim1, System1 >, X >, quantity< unit< Dim2, System2 >, Y >> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct template add_typeof_helper<quantity< unit< Dim1, System1 >, X >, quantity< unit< Dim2, System2 >, Y >>

                                                                                        -

                                                                                        boost::units::add_typeof_helper<quantity< unit< Dim1, System1 >, X >, quantity< unit< Dim2, System2 >, Y >>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/quantity.hpp>
-
-template<typename Dim1, typename System1, typename Dim2, typename System2, 
-         typename X, typename Y> 
-struct add_typeof_helper<quantity< unit< Dim1, System1 >, X >, quantity< unit< Dim2, System2 >, Y >> {
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -

                                                                                        for sun CC we need to invoke SFINAE at the top level, otherwise it will silently return int.

                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/add_typeof_helper.html b/doc/html/boost/units/add_typeof_helper.html index e03abaa634..1b12f92e48 100644 --- a/doc/html/boost/units/add_typeof_helper.html +++ b/doc/html/boost/units/add_typeof_helper.html @@ -35,15 +35,15 @@ template<typename X, typename Y> struct add_typeof_helper { - // public member functions - typedef typeof((typeof_::make< X >()+typeof_::make< Y >())); + // public member functions + typedef typeof((typeof_::make< X >()+typeof_::make< Y >())); };
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        -

                                                                                        -add_typeof_helper public member functions

                                                                                        -
                                                                                        1. typedef typeof((typeof_::make< X >()+typeof_::make< Y >()));
                                                                                        +

                                                                                        +add_typeof_helper public member functions

                                                                                        +
                                                                                        1. typedef typeof((typeof_::make< X >()+typeof_::make< Y >()));
                                                                                        diff --git a/doc/html/boost/units/angle/degree_base_unit.html b/doc/html/boost/units/angle/degree_base_unit.html index a143ba8dee..a902f813ed 100644 --- a/doc/html/boost/units/angle/degree_base_unit.html +++ b/doc/html/boost/units/angle/degree_base_unit.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        @@ -36,18 +36,18 @@ struct degree_base_unit : public boost::units::base_unit< degree_base_unit, boost::units::angle::radian_base_unit::dimension_type,-101 > { - // public static functions - static const char * name(); - static const char * symbol(); + // public static functions + static const char * name(); + static const char * symbol(); };
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        -

                                                                                        -degree_base_unit public static functions

                                                                                        +

                                                                                        +degree_base_unit public static functions

                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        3. static const char * name();
                                                                                          4. +
                                                                                        4. static const char * symbol();
                                                                                        @@ -63,7 +63,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        diff --git a/doc/html/boost/units/angle/gradian_base_unit.html b/doc/html/boost/units/angle/gradian_base_unit.html index c28278e483..97d2f6a833 100644 --- a/doc/html/boost/units/angle/gradian_base_unit.html +++ b/doc/html/boost/units/angle/gradian_base_unit.html @@ -36,18 +36,18 @@ struct gradian_base_unit : public boost::units::base_unit< gradian_base_unit, boost::units::angle::radian_base_unit::dimension_type,-102 > { - // public static functions - static const char * name(); - static const char * symbol(); + // public static functions + static const char * name(); + static const char * symbol(); };
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        -

                                                                                        -gradian_base_unit public static functions

                                                                                        +

                                                                                        +gradian_base_unit public static functions

                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        3. static const char * name();
                                                                                          4. +
                                                                                        4. static const char * symbol();
                                                                                        diff --git a/doc/html/boost/units/angle/radian_base_unit.html b/doc/html/boost/units/angle/radian_base_unit.html index c4a70daaf1..a75335c8cc 100644 --- a/doc/html/boost/units/angle/radian_base_unit.html +++ b/doc/html/boost/units/angle/radian_base_unit.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        @@ -37,18 +37,18 @@ public base_unit< radian_base_unit, plane_angle_dimension,-2 > { - // public static functions - static std::string name(); - static std::string symbol(); + // public static functions + static std::string name(); + static std::string symbol(); };
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        -

                                                                                        -radian_base_unit public static functions

                                                                                        +

                                                                                        +radian_base_unit public static functions

                                                                                          -
                                                                                        1. static std::string name();
                                                                                          2. -
                                                                                        2. static std::string symbol();
                                                                                          3. +
                                                                                        3. static std::string name();
                                                                                          4. +
                                                                                        4. static std::string symbol();
                                                                                        @@ -64,7 +64,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        diff --git a/doc/html/boost/units/angle/steradian_base_unit.html b/doc/html/boost/units/angle/steradian_base_unit.html index 418419b35a..eb1e8e2780 100644 --- a/doc/html/boost/units/angle/steradian_base_unit.html +++ b/doc/html/boost/units/angle/steradian_base_unit.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        @@ -37,18 +37,18 @@ public base_unit< steradian_base_unit, solid_angle_dimension,-1 > { - // public static functions - static std::string name(); - static std::string symbol(); + // public static functions + static std::string name(); + static std::string symbol(); };
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        -

                                                                                        -steradian_base_unit public static functions

                                                                                        +

                                                                                        +steradian_base_unit public static functions

                                                                                          -
                                                                                        1. static std::string name();
                                                                                          2. -
                                                                                        2. static std::string symbol();
                                                                                          3. +
                                                                                        3. static std::string name();
                                                                                          4. +
                                                                                        4. static std::string symbol();
                                                                                        @@ -64,7 +64,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        diff --git a/doc/html/boost/units/astronomical/astronom_idm45506849327696.html b/doc/html/boost/units/astronomical/astronom_idm45506849327696.html new file mode 100644 index 0000000000..50389e94af --- /dev/null +++ b/doc/html/boost/units/astronomical/astronom_idm45506849327696.html @@ -0,0 +1,69 @@ + + + + +Struct astronomical_unit_base_unit + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct astronomical_unit_base_unit

                                                                                        +

                                                                                        boost::units::astronomical::astronomical_unit_base_unit

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/astronomical/astronomical_unit.hpp>
+
+
+struct astronomical_unit_base_unit : public boost::units::base_unit< astronomical_unit_base_unit, boost::units::si::meter_base_unit::dimension_type,-207 >
+{
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +astronomical_unit_base_unit public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/astronomical/astronomical__idp349636496.html b/doc/html/boost/units/astronomical/astronomical__idp349636496.html deleted file mode 100644 index c5b9db4179..0000000000 --- a/doc/html/boost/units/astronomical/astronomical__idp349636496.html +++ /dev/null @@ -1,69 +0,0 @@ - - - - -Struct astronomical_unit_base_unit - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct astronomical_unit_base_unit

                                                                                        -

                                                                                        boost::units::astronomical::astronomical_unit_base_unit

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/astronomical/astronomical_unit.hpp>
-
-
-struct astronomical_unit_base_unit : public boost::units::base_unit< astronomical_unit_base_unit, boost::units::si::meter_base_unit::dimension_type,-207 >
-{
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -astronomical_unit_base_unit public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/astronomical/light_second_base_unit.html b/doc/html/boost/units/astronomical/light_second_base_unit.html index fbd50e14b2..58415c1de7 100644 --- a/doc/html/boost/units/astronomical/light_second_base_unit.html +++ b/doc/html/boost/units/astronomical/light_second_base_unit.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        @@ -36,18 +36,18 @@ struct light_second_base_unit : public boost::units::base_unit< light_second_base_unit, boost::units::si::meter_base_unit::dimension_type,-201 > { - // public static functions - static const char * name(); - static const char * symbol(); + // public static functions + static const char * name(); + static const char * symbol(); };
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        -

                                                                                        -light_second_base_unit public static functions

                                                                                        +

                                                                                        +light_second_base_unit public static functions

                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        3. static const char * name();
                                                                                          4. +
                                                                                        4. static const char * symbol();
                                                                                        @@ -63,7 +63,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        diff --git a/doc/html/boost/units/astronomical/parsec_base_unit.html b/doc/html/boost/units/astronomical/parsec_base_unit.html index 97e8a7ff1c..d9c66e5296 100644 --- a/doc/html/boost/units/astronomical/parsec_base_unit.html +++ b/doc/html/boost/units/astronomical/parsec_base_unit.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        @@ -36,18 +36,18 @@ struct parsec_base_unit : public boost::units::base_unit< parsec_base_unit, boost::units::si::meter_base_unit::dimension_type,-206 > { - // public static functions - static const char * name(); - static const char * symbol(); + // public static functions + static const char * name(); + static const char * symbol(); };
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        -

                                                                                        -parsec_base_unit public static functions

                                                                                        +

                                                                                        +parsec_base_unit public static functions

                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        3. static const char * name();
                                                                                          4. +
                                                                                        4. static const char * symbol();
                                                                                        @@ -63,7 +63,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        diff --git a/doc/html/boost/units/autoprefix_norm.html b/doc/html/boost/units/autoprefix_norm.html index 709ed5e1e9..24e66cf3e5 100644 --- a/doc/html/boost/units/autoprefix_norm.html +++ b/doc/html/boost/units/autoprefix_norm.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        @@ -35,7 +35,7 @@ template<typename T> double autoprefix_norm(const T & arg);
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        ADL customization point for automatic prefixing. Returns a non-negative value. Implemented as std::abs for built-in types.

                                                                                        @@ -50,7 +50,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        diff --git a/doc/html/boost/units/base_dimension.html b/doc/html/boost/units/base_dimension.html index 884866df15..cd4fd5f699 100644 --- a/doc/html/boost/units/base_dimension.html +++ b/doc/html/boost/units/base_dimension.html @@ -40,7 +40,7 @@ typedef Derived type; // Provided for mpl compatability. };
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        Defines a base dimension. To define a dimension you need to provide the derived class (CRTP) and a unique integer. 

                                                                                        struct my_dimension : boost::units::base_dimension<my_dimension, 1> {};
                                                                                        diff --git a/doc/html/boost/units/base_uni_idm45506848735920.html b/doc/html/boost/units/base_uni_idm45506848735920.html new file mode 100644 index 0000000000..512fcccfa4 --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506848735920.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<us::ton_base_unit> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<us::ton_base_unit>

                                                                                        +

                                                                                        boost::units::base_unit_info<us::ton_base_unit>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/us/ton.hpp>
+
+
+struct base_unit_info<us::ton_base_unit> {
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506848744192.html b/doc/html/boost/units/base_uni_idm45506848744192.html new file mode 100644 index 0000000000..45d9f934b1 --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506848744192.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<us::teaspoon_base_unit> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<us::teaspoon_base_unit>

                                                                                        +

                                                                                        boost::units::base_unit_info<us::teaspoon_base_unit>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/us/teaspoon.hpp>
+
+
+struct base_unit_info<us::teaspoon_base_unit> {
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506848752480.html b/doc/html/boost/units/base_uni_idm45506848752480.html new file mode 100644 index 0000000000..fd4e9cce15 --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506848752480.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<us::tablespoon_base_unit> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<us::tablespoon_base_unit>

                                                                                        +

                                                                                        boost::units::base_unit_info<us::tablespoon_base_unit>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/us/tablespoon.hpp>
+
+
+struct base_unit_info<us::tablespoon_base_unit> {
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506848760768.html b/doc/html/boost/units/base_uni_idm45506848760768.html new file mode 100644 index 0000000000..a53b5c0531 --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506848760768.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<us::quart_base_unit> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<us::quart_base_unit>

                                                                                        +

                                                                                        boost::units::base_unit_info<us::quart_base_unit>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/us/quart.hpp>
+
+
+struct base_unit_info<us::quart_base_unit> {
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506848789696.html b/doc/html/boost/units/base_uni_idm45506848789696.html new file mode 100644 index 0000000000..addc12a473 --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506848789696.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<us::ounce_base_unit> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<us::ounce_base_unit>

                                                                                        +

                                                                                        boost::units::base_unit_info<us::ounce_base_unit>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/us/ounce.hpp>
+
+
+struct base_unit_info<us::ounce_base_unit> {
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506848797968.html b/doc/html/boost/units/base_uni_idm45506848797968.html new file mode 100644 index 0000000000..a2a269675a --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506848797968.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<us::minim_base_unit> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<us::minim_base_unit>

                                                                                        +

                                                                                        boost::units::base_unit_info<us::minim_base_unit>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/us/minim.hpp>
+
+
+struct base_unit_info<us::minim_base_unit> {
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506848806240.html b/doc/html/boost/units/base_uni_idm45506848806240.html new file mode 100644 index 0000000000..cf7ee295c4 --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506848806240.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<us::mile_base_unit> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<us::mile_base_unit>

                                                                                        +

                                                                                        boost::units::base_unit_info<us::mile_base_unit>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/us/mile.hpp>
+
+
+struct base_unit_info<us::mile_base_unit> {
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506848814528.html b/doc/html/boost/units/base_uni_idm45506848814528.html new file mode 100644 index 0000000000..793197fd6a --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506848814528.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<us::mil_base_unit> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<us::mil_base_unit>

                                                                                        +

                                                                                        boost::units::base_unit_info<us::mil_base_unit>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/us/mil.hpp>
+
+
+struct base_unit_info<us::mil_base_unit> {
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506848822800.html b/doc/html/boost/units/base_uni_idm45506848822800.html new file mode 100644 index 0000000000..5a81a2c0cd --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506848822800.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<us::inch_base_unit> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<us::inch_base_unit>

                                                                                        +

                                                                                        boost::units::base_unit_info<us::inch_base_unit>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/us/inch.hpp>
+
+
+struct base_unit_info<us::inch_base_unit> {
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506848831088.html b/doc/html/boost/units/base_uni_idm45506848831088.html new file mode 100644 index 0000000000..707f9fe876 --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506848831088.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<us::hundredweight_base_unit> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<us::hundredweight_base_unit>

                                                                                        +

                                                                                        boost::units::base_unit_info<us::hundredweight_base_unit>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/us/hundredweight.hpp>
+
+
+struct base_unit_info<us::hundredweight_base_unit> {
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506848839376.html b/doc/html/boost/units/base_uni_idm45506848839376.html new file mode 100644 index 0000000000..d2ad941971 --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506848839376.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<us::grain_base_unit> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<us::grain_base_unit>

                                                                                        +

                                                                                        boost::units::base_unit_info<us::grain_base_unit>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/us/grain.hpp>
+
+
+struct base_unit_info<us::grain_base_unit> {
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506848847648.html b/doc/html/boost/units/base_uni_idm45506848847648.html new file mode 100644 index 0000000000..a56d8b218f --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506848847648.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<us::gill_base_unit> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<us::gill_base_unit>

                                                                                        +

                                                                                        boost::units::base_unit_info<us::gill_base_unit>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/us/gill.hpp>
+
+
+struct base_unit_info<us::gill_base_unit> {
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506848855920.html b/doc/html/boost/units/base_uni_idm45506848855920.html new file mode 100644 index 0000000000..ef4780fd46 --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506848855920.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<us::gallon_base_unit> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<us::gallon_base_unit>

                                                                                        +

                                                                                        boost::units::base_unit_info<us::gallon_base_unit>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/us/gallon.hpp>
+
+
+struct base_unit_info<us::gallon_base_unit> {
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506848864192.html b/doc/html/boost/units/base_uni_idm45506848864192.html new file mode 100644 index 0000000000..863a83b87d --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506848864192.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<us::foot_base_unit> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<us::foot_base_unit>

                                                                                        +

                                                                                        boost::units::base_unit_info<us::foot_base_unit>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/us/foot.hpp>
+
+
+struct base_unit_info<us::foot_base_unit> {
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506848872480.html b/doc/html/boost/units/base_uni_idm45506848872480.html new file mode 100644 index 0000000000..3ba69dce3d --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506848872480.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<us::fluid_ounce_base_unit> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<us::fluid_ounce_base_unit>

                                                                                        +

                                                                                        boost::units::base_unit_info<us::fluid_ounce_base_unit>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/us/fluid_ounce.hpp>
+
+
+struct base_unit_info<us::fluid_ounce_base_unit> {
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506848880784.html b/doc/html/boost/units/base_uni_idm45506848880784.html new file mode 100644 index 0000000000..23c6047b44 --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506848880784.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<us::fluid_dram_base_unit> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<us::fluid_dram_base_unit>

                                                                                        +

                                                                                        boost::units::base_unit_info<us::fluid_dram_base_unit>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/us/fluid_dram.hpp>
+
+
+struct base_unit_info<us::fluid_dram_base_unit> {
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506848889072.html b/doc/html/boost/units/base_uni_idm45506848889072.html new file mode 100644 index 0000000000..707853d787 --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506848889072.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<us::dram_base_unit> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<us::dram_base_unit>

                                                                                        +

                                                                                        boost::units::base_unit_info<us::dram_base_unit>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/us/dram.hpp>
+
+
+struct base_unit_info<us::dram_base_unit> {
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506848897344.html b/doc/html/boost/units/base_uni_idm45506848897344.html new file mode 100644 index 0000000000..689a9673ea --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506848897344.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<us::cup_base_unit> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<us::cup_base_unit>

                                                                                        +

                                                                                        boost::units::base_unit_info<us::cup_base_unit>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/us/cup.hpp>
+
+
+struct base_unit_info<us::cup_base_unit> {
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506848968224.html b/doc/html/boost/units/base_uni_idm45506848968224.html new file mode 100644 index 0000000000..8c9a4b0338 --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506848968224.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<metric::year_base_unit> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<metric::year_base_unit>

                                                                                        +

                                                                                        boost::units::base_unit_info<metric::year_base_unit>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/metric/year.hpp>
+
+
+struct base_unit_info<metric::year_base_unit> {
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506848982992.html b/doc/html/boost/units/base_uni_idm45506848982992.html new file mode 100644 index 0000000000..fe06fb84d9 --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506848982992.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<metric::ton_base_unit> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<metric::ton_base_unit>

                                                                                        +

                                                                                        boost::units::base_unit_info<metric::ton_base_unit>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/metric/ton.hpp>
+
+
+struct base_unit_info<metric::ton_base_unit> {
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506848990896.html b/doc/html/boost/units/base_uni_idm45506848990896.html new file mode 100644 index 0000000000..9634010692 --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506848990896.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<metric::nautical_mile_base_unit> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<metric::nautical_mile_base_unit>

                                                                                        +

                                                                                        boost::units::base_unit_info<metric::nautical_mile_base_unit>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/metric/nautical_mile.hpp>
+
+
+struct base_unit_info<metric::nautical_mile_base_unit> {
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506849005696.html b/doc/html/boost/units/base_uni_idm45506849005696.html new file mode 100644 index 0000000000..baac942235 --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506849005696.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<metric::minute_base_unit> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<metric::minute_base_unit>

                                                                                        +

                                                                                        boost::units::base_unit_info<metric::minute_base_unit>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/metric/minute.hpp>
+
+
+struct base_unit_info<metric::minute_base_unit> {
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506849013616.html b/doc/html/boost/units/base_uni_idm45506849013616.html new file mode 100644 index 0000000000..84c41d3dfe --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506849013616.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<metric::micron_base_unit> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<metric::micron_base_unit>

                                                                                        +

                                                                                        boost::units::base_unit_info<metric::micron_base_unit>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/metric/micron.hpp>
+
+
+struct base_unit_info<metric::micron_base_unit> {
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506849035296.html b/doc/html/boost/units/base_uni_idm45506849035296.html new file mode 100644 index 0000000000..a91e2327f2 --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506849035296.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<metric::hour_base_unit> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<metric::hour_base_unit>

                                                                                        +

                                                                                        boost::units::base_unit_info<metric::hour_base_unit>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/metric/hour.hpp>
+
+
+struct base_unit_info<metric::hour_base_unit> {
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506849050080.html b/doc/html/boost/units/base_uni_idm45506849050080.html new file mode 100644 index 0000000000..1b4a05ac72 --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506849050080.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<metric::fermi_base_unit> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<metric::fermi_base_unit>

                                                                                        +

                                                                                        boost::units::base_unit_info<metric::fermi_base_unit>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/metric/fermi.hpp>
+
+
+struct base_unit_info<metric::fermi_base_unit> {
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506849057968.html b/doc/html/boost/units/base_uni_idm45506849057968.html new file mode 100644 index 0000000000..ed2dc1436b --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506849057968.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<metric::day_base_unit> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<metric::day_base_unit>

                                                                                        +

                                                                                        boost::units::base_unit_info<metric::day_base_unit>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/metric/day.hpp>
+
+
+struct base_unit_info<metric::day_base_unit> {
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506849093376.html b/doc/html/boost/units/base_uni_idm45506849093376.html new file mode 100644 index 0000000000..136b3ae2a1 --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506849093376.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<metric::angstrom_base_unit> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<metric::angstrom_base_unit>

                                                                                        +

                                                                                        boost::units::base_unit_info<metric::angstrom_base_unit>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/metric/angstrom.hpp>
+
+
+struct base_unit_info<metric::angstrom_base_unit> {
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506849110016.html b/doc/html/boost/units/base_uni_idm45506849110016.html new file mode 100644 index 0000000000..e6dfa344df --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506849110016.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<imperial::ton_base_unit> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<imperial::ton_base_unit>

                                                                                        +

                                                                                        boost::units::base_unit_info<imperial::ton_base_unit>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/imperial/ton.hpp>
+
+
+struct base_unit_info<imperial::ton_base_unit> {
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506849118320.html b/doc/html/boost/units/base_uni_idm45506849118320.html new file mode 100644 index 0000000000..819aa60336 --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506849118320.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<imperial::thou_base_unit> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<imperial::thou_base_unit>

                                                                                        +

                                                                                        boost::units::base_unit_info<imperial::thou_base_unit>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/imperial/thou.hpp>
+
+
+struct base_unit_info<imperial::thou_base_unit> {
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506849126624.html b/doc/html/boost/units/base_uni_idm45506849126624.html new file mode 100644 index 0000000000..e1bc27ebcc --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506849126624.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<imperial::stone_base_unit> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<imperial::stone_base_unit>

                                                                                        +

                                                                                        boost::units::base_unit_info<imperial::stone_base_unit>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/imperial/stone.hpp>
+
+
+struct base_unit_info<imperial::stone_base_unit> {
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506849134928.html b/doc/html/boost/units/base_uni_idm45506849134928.html new file mode 100644 index 0000000000..76cdd63641 --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506849134928.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<imperial::quarter_base_unit> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<imperial::quarter_base_unit>

                                                                                        +

                                                                                        boost::units::base_unit_info<imperial::quarter_base_unit>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/imperial/quarter.hpp>
+
+
+struct base_unit_info<imperial::quarter_base_unit> {
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506849143232.html b/doc/html/boost/units/base_uni_idm45506849143232.html new file mode 100644 index 0000000000..58b9d83539 --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506849143232.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<imperial::quart_base_unit> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<imperial::quart_base_unit>

                                                                                        +

                                                                                        boost::units::base_unit_info<imperial::quart_base_unit>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/imperial/quart.hpp>
+
+
+struct base_unit_info<imperial::quart_base_unit> {
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506849165328.html b/doc/html/boost/units/base_uni_idm45506849165328.html new file mode 100644 index 0000000000..5fbf91a87f --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506849165328.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<imperial::ounce_base_unit> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<imperial::ounce_base_unit>

                                                                                        +

                                                                                        boost::units::base_unit_info<imperial::ounce_base_unit>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/imperial/ounce.hpp>
+
+
+struct base_unit_info<imperial::ounce_base_unit> {
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506849173632.html b/doc/html/boost/units/base_uni_idm45506849173632.html new file mode 100644 index 0000000000..5c9f95fa26 --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506849173632.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<imperial::mile_base_unit> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<imperial::mile_base_unit>

                                                                                        +

                                                                                        boost::units::base_unit_info<imperial::mile_base_unit>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/imperial/mile.hpp>
+
+
+struct base_unit_info<imperial::mile_base_unit> {
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506849181936.html b/doc/html/boost/units/base_uni_idm45506849181936.html new file mode 100644 index 0000000000..1c93a1bfcf --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506849181936.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<imperial::league_base_unit> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<imperial::league_base_unit>

                                                                                        +

                                                                                        boost::units::base_unit_info<imperial::league_base_unit>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/imperial/league.hpp>
+
+
+struct base_unit_info<imperial::league_base_unit> {
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506849190240.html b/doc/html/boost/units/base_uni_idm45506849190240.html new file mode 100644 index 0000000000..fc9602f1d3 --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506849190240.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<imperial::inch_base_unit> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<imperial::inch_base_unit>

                                                                                        +

                                                                                        boost::units::base_unit_info<imperial::inch_base_unit>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/imperial/inch.hpp>
+
+
+struct base_unit_info<imperial::inch_base_unit> {
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506849198544.html b/doc/html/boost/units/base_uni_idm45506849198544.html new file mode 100644 index 0000000000..e8f61f0114 --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506849198544.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<imperial::hundredweight_base_unit> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<imperial::hundredweight_base_unit>

                                                                                        +

                                                                                        boost::units::base_unit_info<imperial::hundredweight_base_unit>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/imperial/hundredweight.hpp>
+
+
+struct base_unit_info<imperial::hundredweight_base_unit> {
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506849206848.html b/doc/html/boost/units/base_uni_idm45506849206848.html new file mode 100644 index 0000000000..459792bdab --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506849206848.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<imperial::grain_base_unit> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<imperial::grain_base_unit>

                                                                                        +

                                                                                        boost::units::base_unit_info<imperial::grain_base_unit>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/imperial/grain.hpp>
+
+
+struct base_unit_info<imperial::grain_base_unit> {
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506849215152.html b/doc/html/boost/units/base_uni_idm45506849215152.html new file mode 100644 index 0000000000..785e02cddc --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506849215152.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<imperial::gill_base_unit> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<imperial::gill_base_unit>

                                                                                        +

                                                                                        boost::units::base_unit_info<imperial::gill_base_unit>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/imperial/gill.hpp>
+
+
+struct base_unit_info<imperial::gill_base_unit> {
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506849223456.html b/doc/html/boost/units/base_uni_idm45506849223456.html new file mode 100644 index 0000000000..2499592776 --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506849223456.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<imperial::gallon_base_unit> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<imperial::gallon_base_unit>

                                                                                        +

                                                                                        boost::units::base_unit_info<imperial::gallon_base_unit>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/imperial/gallon.hpp>
+
+
+struct base_unit_info<imperial::gallon_base_unit> {
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506849231760.html b/doc/html/boost/units/base_uni_idm45506849231760.html new file mode 100644 index 0000000000..2e521a231e --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506849231760.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<imperial::furlong_base_unit> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<imperial::furlong_base_unit>

                                                                                        +

                                                                                        boost::units::base_unit_info<imperial::furlong_base_unit>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/imperial/furlong.hpp>
+
+
+struct base_unit_info<imperial::furlong_base_unit> {
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506849240064.html b/doc/html/boost/units/base_uni_idm45506849240064.html new file mode 100644 index 0000000000..a662a75141 --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506849240064.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<imperial::foot_base_unit> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<imperial::foot_base_unit>

                                                                                        +

                                                                                        boost::units::base_unit_info<imperial::foot_base_unit>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/imperial/foot.hpp>
+
+
+struct base_unit_info<imperial::foot_base_unit> {
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506849248368.html b/doc/html/boost/units/base_uni_idm45506849248368.html new file mode 100644 index 0000000000..14236b555f --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506849248368.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<imperial::fluid_ounce_base_unit> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<imperial::fluid_ounce_base_unit>

                                                                                        +

                                                                                        boost::units::base_unit_info<imperial::fluid_ounce_base_unit>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/imperial/fluid_ounce.hpp>
+
+
+struct base_unit_info<imperial::fluid_ounce_base_unit> {
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506849256672.html b/doc/html/boost/units/base_uni_idm45506849256672.html new file mode 100644 index 0000000000..f5ce375803 --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506849256672.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<imperial::drachm_base_unit> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<imperial::drachm_base_unit>

                                                                                        +

                                                                                        boost::units::base_unit_info<imperial::drachm_base_unit>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/imperial/drachm.hpp>
+
+
+struct base_unit_info<imperial::drachm_base_unit> {
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506849289360.html b/doc/html/boost/units/base_uni_idm45506849289360.html new file mode 100644 index 0000000000..1ff6d6478e --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506849289360.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<astronomical::light_year_base_unit> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<astronomical::light_year_base_unit>

                                                                                        +

                                                                                        boost::units::base_unit_info<astronomical::light_year_base_unit>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/astronomical/light_year.hpp>
+
+
+struct base_unit_info<astronomical::light_year_base_unit> {
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506849304624.html b/doc/html/boost/units/base_uni_idm45506849304624.html new file mode 100644 index 0000000000..21085dae78 --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506849304624.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<astronomical::light_minute_base_unit> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<astronomical::light_minute_base_unit>

                                                                                        +

                                                                                        boost::units::base_unit_info<astronomical::light_minute_base_unit>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/astronomical/light_minute.hpp>
+
+
+struct base_unit_info<astronomical::light_minute_base_unit> {
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506849312960.html b/doc/html/boost/units/base_uni_idm45506849312960.html new file mode 100644 index 0000000000..b1efef34aa --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506849312960.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<astronomical::light_hour_base_unit> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<astronomical::light_hour_base_unit>

                                                                                        +

                                                                                        boost::units::base_unit_info<astronomical::light_hour_base_unit>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/astronomical/light_hour.hpp>
+
+
+struct base_unit_info<astronomical::light_hour_base_unit> {
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506849321312.html b/doc/html/boost/units/base_uni_idm45506849321312.html new file mode 100644 index 0000000000..231bc83d3b --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506849321312.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<astronomical::light_day_base_unit> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<astronomical::light_day_base_unit>

                                                                                        +

                                                                                        boost::units::base_unit_info<astronomical::light_day_base_unit>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/astronomical/light_day.hpp>
+
+
+struct base_unit_info<astronomical::light_day_base_unit> {
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506849344912.html b/doc/html/boost/units/base_uni_idm45506849344912.html new file mode 100644 index 0000000000..5c1aee2913 --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506849344912.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<angle::revolution_base_unit> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<angle::revolution_base_unit>

                                                                                        +

                                                                                        boost::units::base_unit_info<angle::revolution_base_unit>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/angle/revolution.hpp>
+
+
+struct base_unit_info<angle::revolution_base_unit> {
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506849373888.html b/doc/html/boost/units/base_uni_idm45506849373888.html new file mode 100644 index 0000000000..bc8de3e7cb --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506849373888.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<angle::arcsecond_base_unit> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<angle::arcsecond_base_unit>

                                                                                        +

                                                                                        boost::units::base_unit_info<angle::arcsecond_base_unit>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/angle/arcsecond.hpp>
+
+
+struct base_unit_info<angle::arcsecond_base_unit> {
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506849382192.html b/doc/html/boost/units/base_uni_idm45506849382192.html new file mode 100644 index 0000000000..861bb50845 --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506849382192.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<angle::arcminute_base_unit> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<angle::arcminute_base_unit>

                                                                                        +

                                                                                        boost::units::base_unit_info<angle::arcminute_base_unit>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/base_units/angle/arcminute.hpp>
+
+
+struct base_unit_info<angle::arcminute_base_unit> {
+
+  // public static functions
+  static const char * name();
+  static const char * symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static const char * name();
                                                                                          2. +
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506849416720.html b/doc/html/boost/units/base_uni_idm45506849416720.html new file mode 100644 index 0000000000..92dee3366b --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506849416720.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<abstract::time_unit_tag> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<abstract::time_unit_tag>

                                                                                        +

                                                                                        boost::units::base_unit_info<abstract::time_unit_tag>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/systems/abstract.hpp>
+
+
+struct base_unit_info<abstract::time_unit_tag> {
+
+  // public static functions
+  static std::string name();
+  static std::string symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static std::string name();
                                                                                          2. +
                                                                                        2. static std::string symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506849420800.html b/doc/html/boost/units/base_uni_idm45506849420800.html new file mode 100644 index 0000000000..737bd1f7ea --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506849420800.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<abstract::temperature_unit_tag> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<abstract::temperature_unit_tag>

                                                                                        +

                                                                                        boost::units::base_unit_info<abstract::temperature_unit_tag>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/systems/abstract.hpp>
+
+
+struct base_unit_info<abstract::temperature_unit_tag> {
+
+  // public static functions
+  static std::string name();
+  static std::string symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static std::string name();
                                                                                          2. +
                                                                                        2. static std::string symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506849424880.html b/doc/html/boost/units/base_uni_idm45506849424880.html new file mode 100644 index 0000000000..6591c87ac2 --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506849424880.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<abstract::solid_angle_unit_tag> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<abstract::solid_angle_unit_tag>

                                                                                        +

                                                                                        boost::units::base_unit_info<abstract::solid_angle_unit_tag>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/systems/abstract.hpp>
+
+
+struct base_unit_info<abstract::solid_angle_unit_tag> {
+
+  // public static functions
+  static std::string name();
+  static std::string symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static std::string name();
                                                                                          2. +
                                                                                        2. static std::string symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506849428960.html b/doc/html/boost/units/base_uni_idm45506849428960.html new file mode 100644 index 0000000000..5dd5159478 --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506849428960.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<abstract::plane_angle_unit_tag> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<abstract::plane_angle_unit_tag>

                                                                                        +

                                                                                        boost::units::base_unit_info<abstract::plane_angle_unit_tag>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/systems/abstract.hpp>
+
+
+struct base_unit_info<abstract::plane_angle_unit_tag> {
+
+  // public static functions
+  static std::string name();
+  static std::string symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static std::string name();
                                                                                          2. +
                                                                                        2. static std::string symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506849433024.html b/doc/html/boost/units/base_uni_idm45506849433024.html new file mode 100644 index 0000000000..4a0830f385 --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506849433024.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<abstract::mass_unit_tag> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<abstract::mass_unit_tag>

                                                                                        +

                                                                                        boost::units::base_unit_info<abstract::mass_unit_tag>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/systems/abstract.hpp>
+
+
+struct base_unit_info<abstract::mass_unit_tag> {
+
+  // public static functions
+  static std::string name();
+  static std::string symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static std::string name();
                                                                                          2. +
                                                                                        2. static std::string symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506849437104.html b/doc/html/boost/units/base_uni_idm45506849437104.html new file mode 100644 index 0000000000..68bd14b7d4 --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506849437104.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<abstract::luminous_intensity_unit_tag> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<abstract::luminous_intensity_unit_tag>

                                                                                        +

                                                                                        boost::units::base_unit_info<abstract::luminous_intensity_unit_tag>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/systems/abstract.hpp>
+
+
+struct base_unit_info<abstract::luminous_intensity_unit_tag> {
+
+  // public static functions
+  static std::string name();
+  static std::string symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static std::string name();
                                                                                          2. +
                                                                                        2. static std::string symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506849441184.html b/doc/html/boost/units/base_uni_idm45506849441184.html new file mode 100644 index 0000000000..1b6979df11 --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506849441184.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<abstract::length_unit_tag> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<abstract::length_unit_tag>

                                                                                        +

                                                                                        boost::units::base_unit_info<abstract::length_unit_tag>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/systems/abstract.hpp>
+
+
+struct base_unit_info<abstract::length_unit_tag> {
+
+  // public static functions
+  static std::string name();
+  static std::string symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static std::string name();
                                                                                          2. +
                                                                                        2. static std::string symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506849445264.html b/doc/html/boost/units/base_uni_idm45506849445264.html new file mode 100644 index 0000000000..b219f2c554 --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506849445264.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<abstract::current_unit_tag> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<abstract::current_unit_tag>

                                                                                        +

                                                                                        boost::units::base_unit_info<abstract::current_unit_tag>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/systems/abstract.hpp>
+
+
+struct base_unit_info<abstract::current_unit_tag> {
+
+  // public static functions
+  static std::string name();
+  static std::string symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static std::string name();
                                                                                          2. +
                                                                                        2. static std::string symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_uni_idm45506849449344.html b/doc/html/boost/units/base_uni_idm45506849449344.html new file mode 100644 index 0000000000..45f154b8b5 --- /dev/null +++ b/doc/html/boost/units/base_uni_idm45506849449344.html @@ -0,0 +1,68 @@ + + + + +Struct base_unit_info<abstract::amount_unit_tag> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct base_unit_info<abstract::amount_unit_tag>

                                                                                        +

                                                                                        boost::units::base_unit_info<abstract::amount_unit_tag>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/systems/abstract.hpp>
+
+
+struct base_unit_info<abstract::amount_unit_tag> {
+
+  // public static functions
+  static std::string name();
+  static std::string symbol();
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        +
                                                                                          +
                                                                                        1. static std::string name();
                                                                                          2. +
                                                                                        2. static std::string symbol();
                                                                                          3. +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/base_unit.html b/doc/html/boost/units/base_unit.html index 36f68c5d73..0d4d6ff30e 100644 --- a/doc/html/boost/units/base_unit.html +++ b/doc/html/boost/units/base_unit.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        @@ -41,7 +41,7 @@ typedef unspecified unit_type; // The unit corresponding to this base unit. };
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        Defines a base unit. To define a unit you need to provide the derived class (CRTP), a dimension list and a unique integer. 

                                                                                        struct my_unit : boost::units::base_unit<my_unit, length_dimension, 1> {};
                                                                                        @@ -59,7 +59,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        diff --git a/doc/html/boost/units/base_unit_inf_idp349514912.html b/doc/html/boost/units/base_unit_inf_idp349514912.html deleted file mode 100644 index 5eaadb9a61..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp349514912.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<abstract::amount_unit_tag> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<abstract::amount_unit_tag>

                                                                                        -

                                                                                        boost::units::base_unit_info<abstract::amount_unit_tag>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/systems/abstract.hpp>
-
-
-struct base_unit_info<abstract::amount_unit_tag> {
-
-  // public static functions
-  static std::string name();
-  static std::string symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static std::string name();
                                                                                          2. -
                                                                                        2. static std::string symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp349518992.html b/doc/html/boost/units/base_unit_inf_idp349518992.html deleted file mode 100644 index c89ec6c64b..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp349518992.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<abstract::current_unit_tag> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<abstract::current_unit_tag>

                                                                                        -

                                                                                        boost::units::base_unit_info<abstract::current_unit_tag>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/systems/abstract.hpp>
-
-
-struct base_unit_info<abstract::current_unit_tag> {
-
-  // public static functions
-  static std::string name();
-  static std::string symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static std::string name();
                                                                                          2. -
                                                                                        2. static std::string symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp349523072.html b/doc/html/boost/units/base_unit_inf_idp349523072.html deleted file mode 100644 index cbd82b5a4c..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp349523072.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<abstract::length_unit_tag> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<abstract::length_unit_tag>

                                                                                        -

                                                                                        boost::units::base_unit_info<abstract::length_unit_tag>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/systems/abstract.hpp>
-
-
-struct base_unit_info<abstract::length_unit_tag> {
-
-  // public static functions
-  static std::string name();
-  static std::string symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static std::string name();
                                                                                          2. -
                                                                                        2. static std::string symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp349527152.html b/doc/html/boost/units/base_unit_inf_idp349527152.html deleted file mode 100644 index f9d7e6c0bc..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp349527152.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<abstract::luminous_intensity_unit_tag> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<abstract::luminous_intensity_unit_tag>

                                                                                        -

                                                                                        boost::units::base_unit_info<abstract::luminous_intensity_unit_tag>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/systems/abstract.hpp>
-
-
-struct base_unit_info<abstract::luminous_intensity_unit_tag> {
-
-  // public static functions
-  static std::string name();
-  static std::string symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static std::string name();
                                                                                          2. -
                                                                                        2. static std::string symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp349531232.html b/doc/html/boost/units/base_unit_inf_idp349531232.html deleted file mode 100644 index d3ac01468b..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp349531232.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<abstract::mass_unit_tag> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<abstract::mass_unit_tag>

                                                                                        -

                                                                                        boost::units::base_unit_info<abstract::mass_unit_tag>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/systems/abstract.hpp>
-
-
-struct base_unit_info<abstract::mass_unit_tag> {
-
-  // public static functions
-  static std::string name();
-  static std::string symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static std::string name();
                                                                                          2. -
                                                                                        2. static std::string symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp349535296.html b/doc/html/boost/units/base_unit_inf_idp349535296.html deleted file mode 100644 index 9e21d0a860..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp349535296.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<abstract::plane_angle_unit_tag> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<abstract::plane_angle_unit_tag>

                                                                                        -

                                                                                        boost::units::base_unit_info<abstract::plane_angle_unit_tag>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/systems/abstract.hpp>
-
-
-struct base_unit_info<abstract::plane_angle_unit_tag> {
-
-  // public static functions
-  static std::string name();
-  static std::string symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static std::string name();
                                                                                          2. -
                                                                                        2. static std::string symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp349539376.html b/doc/html/boost/units/base_unit_inf_idp349539376.html deleted file mode 100644 index 2d4f9da570..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp349539376.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<abstract::solid_angle_unit_tag> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<abstract::solid_angle_unit_tag>

                                                                                        -

                                                                                        boost::units::base_unit_info<abstract::solid_angle_unit_tag>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/systems/abstract.hpp>
-
-
-struct base_unit_info<abstract::solid_angle_unit_tag> {
-
-  // public static functions
-  static std::string name();
-  static std::string symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static std::string name();
                                                                                          2. -
                                                                                        2. static std::string symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp349543456.html b/doc/html/boost/units/base_unit_inf_idp349543456.html deleted file mode 100644 index ef82cc18b8..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp349543456.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<abstract::temperature_unit_tag> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<abstract::temperature_unit_tag>

                                                                                        -

                                                                                        boost::units::base_unit_info<abstract::temperature_unit_tag>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/systems/abstract.hpp>
-
-
-struct base_unit_info<abstract::temperature_unit_tag> {
-
-  // public static functions
-  static std::string name();
-  static std::string symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static std::string name();
                                                                                          2. -
                                                                                        2. static std::string symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp349547536.html b/doc/html/boost/units/base_unit_inf_idp349547536.html deleted file mode 100644 index 40c058de40..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp349547536.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<abstract::time_unit_tag> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<abstract::time_unit_tag>

                                                                                        -

                                                                                        boost::units::base_unit_info<abstract::time_unit_tag>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/systems/abstract.hpp>
-
-
-struct base_unit_info<abstract::time_unit_tag> {
-
-  // public static functions
-  static std::string name();
-  static std::string symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static std::string name();
                                                                                          2. -
                                                                                        2. static std::string symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp349582000.html b/doc/html/boost/units/base_unit_inf_idp349582000.html deleted file mode 100644 index 2617a4fff0..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp349582000.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<angle::arcminute_base_unit> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<angle::arcminute_base_unit>

                                                                                        -

                                                                                        boost::units::base_unit_info<angle::arcminute_base_unit>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/angle/arcminute.hpp>
-
-
-struct base_unit_info<angle::arcminute_base_unit> {
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp349590304.html b/doc/html/boost/units/base_unit_inf_idp349590304.html deleted file mode 100644 index 87984d59e9..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp349590304.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<angle::arcsecond_base_unit> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<angle::arcsecond_base_unit>

                                                                                        -

                                                                                        boost::units::base_unit_info<angle::arcsecond_base_unit>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/angle/arcsecond.hpp>
-
-
-struct base_unit_info<angle::arcsecond_base_unit> {
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp349619280.html b/doc/html/boost/units/base_unit_inf_idp349619280.html deleted file mode 100644 index e8acff49f4..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp349619280.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<angle::revolution_base_unit> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<angle::revolution_base_unit>

                                                                                        -

                                                                                        boost::units::base_unit_info<angle::revolution_base_unit>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/angle/revolution.hpp>
-
-
-struct base_unit_info<angle::revolution_base_unit> {
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp349642880.html b/doc/html/boost/units/base_unit_inf_idp349642880.html deleted file mode 100644 index 1046cbf375..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp349642880.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<astronomical::light_day_base_unit> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<astronomical::light_day_base_unit>

                                                                                        -

                                                                                        boost::units::base_unit_info<astronomical::light_day_base_unit>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/astronomical/light_day.hpp>
-
-
-struct base_unit_info<astronomical::light_day_base_unit> {
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp349651232.html b/doc/html/boost/units/base_unit_inf_idp349651232.html deleted file mode 100644 index 030229703d..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp349651232.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<astronomical::light_hour_base_unit> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<astronomical::light_hour_base_unit>

                                                                                        -

                                                                                        boost::units::base_unit_info<astronomical::light_hour_base_unit>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/astronomical/light_hour.hpp>
-
-
-struct base_unit_info<astronomical::light_hour_base_unit> {
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp349659568.html b/doc/html/boost/units/base_unit_inf_idp349659568.html deleted file mode 100644 index 692c178c80..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp349659568.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<astronomical::light_minute_base_unit> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<astronomical::light_minute_base_unit>

                                                                                        -

                                                                                        boost::units::base_unit_info<astronomical::light_minute_base_unit>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/astronomical/light_minute.hpp>
-
-
-struct base_unit_info<astronomical::light_minute_base_unit> {
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp349674832.html b/doc/html/boost/units/base_unit_inf_idp349674832.html deleted file mode 100644 index 10e32b5a90..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp349674832.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<astronomical::light_year_base_unit> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<astronomical::light_year_base_unit>

                                                                                        -

                                                                                        boost::units::base_unit_info<astronomical::light_year_base_unit>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/astronomical/light_year.hpp>
-
-
-struct base_unit_info<astronomical::light_year_base_unit> {
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp349707520.html b/doc/html/boost/units/base_unit_inf_idp349707520.html deleted file mode 100644 index 2c5493f078..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp349707520.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<imperial::drachm_base_unit> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<imperial::drachm_base_unit>

                                                                                        -

                                                                                        boost::units::base_unit_info<imperial::drachm_base_unit>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/imperial/drachm.hpp>
-
-
-struct base_unit_info<imperial::drachm_base_unit> {
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp349715824.html b/doc/html/boost/units/base_unit_inf_idp349715824.html deleted file mode 100644 index b20431a7f1..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp349715824.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<imperial::fluid_ounce_base_unit> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<imperial::fluid_ounce_base_unit>

                                                                                        -

                                                                                        boost::units::base_unit_info<imperial::fluid_ounce_base_unit>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/imperial/fluid_ounce.hpp>
-
-
-struct base_unit_info<imperial::fluid_ounce_base_unit> {
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp349724128.html b/doc/html/boost/units/base_unit_inf_idp349724128.html deleted file mode 100644 index 77024b8a9b..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp349724128.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<imperial::foot_base_unit> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<imperial::foot_base_unit>

                                                                                        -

                                                                                        boost::units::base_unit_info<imperial::foot_base_unit>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/imperial/foot.hpp>
-
-
-struct base_unit_info<imperial::foot_base_unit> {
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp349732432.html b/doc/html/boost/units/base_unit_inf_idp349732432.html deleted file mode 100644 index 7823048488..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp349732432.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<imperial::furlong_base_unit> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<imperial::furlong_base_unit>

                                                                                        -

                                                                                        boost::units::base_unit_info<imperial::furlong_base_unit>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/imperial/furlong.hpp>
-
-
-struct base_unit_info<imperial::furlong_base_unit> {
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp349740736.html b/doc/html/boost/units/base_unit_inf_idp349740736.html deleted file mode 100644 index 4d961e0cf8..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp349740736.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<imperial::gallon_base_unit> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<imperial::gallon_base_unit>

                                                                                        -

                                                                                        boost::units::base_unit_info<imperial::gallon_base_unit>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/imperial/gallon.hpp>
-
-
-struct base_unit_info<imperial::gallon_base_unit> {
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp349749040.html b/doc/html/boost/units/base_unit_inf_idp349749040.html deleted file mode 100644 index a5fbb4209c..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp349749040.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<imperial::gill_base_unit> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<imperial::gill_base_unit>

                                                                                        -

                                                                                        boost::units::base_unit_info<imperial::gill_base_unit>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/imperial/gill.hpp>
-
-
-struct base_unit_info<imperial::gill_base_unit> {
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp349757344.html b/doc/html/boost/units/base_unit_inf_idp349757344.html deleted file mode 100644 index a1a6f08230..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp349757344.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<imperial::grain_base_unit> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<imperial::grain_base_unit>

                                                                                        -

                                                                                        boost::units::base_unit_info<imperial::grain_base_unit>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/imperial/grain.hpp>
-
-
-struct base_unit_info<imperial::grain_base_unit> {
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp349765648.html b/doc/html/boost/units/base_unit_inf_idp349765648.html deleted file mode 100644 index 3d4c79e03a..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp349765648.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<imperial::hundredweight_base_unit> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<imperial::hundredweight_base_unit>

                                                                                        -

                                                                                        boost::units::base_unit_info<imperial::hundredweight_base_unit>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/imperial/hundredweight.hpp>
-
-
-struct base_unit_info<imperial::hundredweight_base_unit> {
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp349773952.html b/doc/html/boost/units/base_unit_inf_idp349773952.html deleted file mode 100644 index 190a863690..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp349773952.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<imperial::inch_base_unit> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<imperial::inch_base_unit>

                                                                                        -

                                                                                        boost::units::base_unit_info<imperial::inch_base_unit>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/imperial/inch.hpp>
-
-
-struct base_unit_info<imperial::inch_base_unit> {
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp349782256.html b/doc/html/boost/units/base_unit_inf_idp349782256.html deleted file mode 100644 index 8b898f62f7..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp349782256.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<imperial::league_base_unit> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<imperial::league_base_unit>

                                                                                        -

                                                                                        boost::units::base_unit_info<imperial::league_base_unit>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/imperial/league.hpp>
-
-
-struct base_unit_info<imperial::league_base_unit> {
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp349790560.html b/doc/html/boost/units/base_unit_inf_idp349790560.html deleted file mode 100644 index 4b64c2942a..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp349790560.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<imperial::mile_base_unit> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<imperial::mile_base_unit>

                                                                                        -

                                                                                        boost::units::base_unit_info<imperial::mile_base_unit>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/imperial/mile.hpp>
-
-
-struct base_unit_info<imperial::mile_base_unit> {
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp349798864.html b/doc/html/boost/units/base_unit_inf_idp349798864.html deleted file mode 100644 index 2fe52599f0..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp349798864.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<imperial::ounce_base_unit> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<imperial::ounce_base_unit>

                                                                                        -

                                                                                        boost::units::base_unit_info<imperial::ounce_base_unit>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/imperial/ounce.hpp>
-
-
-struct base_unit_info<imperial::ounce_base_unit> {
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp349820960.html b/doc/html/boost/units/base_unit_inf_idp349820960.html deleted file mode 100644 index 472b6d8e5a..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp349820960.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<imperial::quart_base_unit> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<imperial::quart_base_unit>

                                                                                        -

                                                                                        boost::units::base_unit_info<imperial::quart_base_unit>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/imperial/quart.hpp>
-
-
-struct base_unit_info<imperial::quart_base_unit> {
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp349829264.html b/doc/html/boost/units/base_unit_inf_idp349829264.html deleted file mode 100644 index 82e1ff67d0..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp349829264.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<imperial::quarter_base_unit> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<imperial::quarter_base_unit>

                                                                                        -

                                                                                        boost::units::base_unit_info<imperial::quarter_base_unit>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/imperial/quarter.hpp>
-
-
-struct base_unit_info<imperial::quarter_base_unit> {
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp349837568.html b/doc/html/boost/units/base_unit_inf_idp349837568.html deleted file mode 100644 index 31d29230d3..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp349837568.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<imperial::stone_base_unit> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<imperial::stone_base_unit>

                                                                                        -

                                                                                        boost::units::base_unit_info<imperial::stone_base_unit>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/imperial/stone.hpp>
-
-
-struct base_unit_info<imperial::stone_base_unit> {
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp349845872.html b/doc/html/boost/units/base_unit_inf_idp349845872.html deleted file mode 100644 index 6fac778342..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp349845872.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<imperial::thou_base_unit> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<imperial::thou_base_unit>

                                                                                        -

                                                                                        boost::units::base_unit_info<imperial::thou_base_unit>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/imperial/thou.hpp>
-
-
-struct base_unit_info<imperial::thou_base_unit> {
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp349854176.html b/doc/html/boost/units/base_unit_inf_idp349854176.html deleted file mode 100644 index b16aca6208..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp349854176.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<imperial::ton_base_unit> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<imperial::ton_base_unit>

                                                                                        -

                                                                                        boost::units::base_unit_info<imperial::ton_base_unit>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/imperial/ton.hpp>
-
-
-struct base_unit_info<imperial::ton_base_unit> {
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp349870816.html b/doc/html/boost/units/base_unit_inf_idp349870816.html deleted file mode 100644 index a99c1233c0..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp349870816.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<metric::angstrom_base_unit> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<metric::angstrom_base_unit>

                                                                                        -

                                                                                        boost::units::base_unit_info<metric::angstrom_base_unit>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/metric/angstrom.hpp>
-
-
-struct base_unit_info<metric::angstrom_base_unit> {
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp349906224.html b/doc/html/boost/units/base_unit_inf_idp349906224.html deleted file mode 100644 index d4c3d71d8e..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp349906224.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<metric::day_base_unit> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<metric::day_base_unit>

                                                                                        -

                                                                                        boost::units::base_unit_info<metric::day_base_unit>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/metric/day.hpp>
-
-
-struct base_unit_info<metric::day_base_unit> {
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp349914112.html b/doc/html/boost/units/base_unit_inf_idp349914112.html deleted file mode 100644 index 347cf2ae2c..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp349914112.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<metric::fermi_base_unit> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<metric::fermi_base_unit>

                                                                                        -

                                                                                        boost::units::base_unit_info<metric::fermi_base_unit>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/metric/fermi.hpp>
-
-
-struct base_unit_info<metric::fermi_base_unit> {
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp349928896.html b/doc/html/boost/units/base_unit_inf_idp349928896.html deleted file mode 100644 index 3fed043fb3..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp349928896.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<metric::hour_base_unit> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<metric::hour_base_unit>

                                                                                        -

                                                                                        boost::units::base_unit_info<metric::hour_base_unit>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/metric/hour.hpp>
-
-
-struct base_unit_info<metric::hour_base_unit> {
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp349950576.html b/doc/html/boost/units/base_unit_inf_idp349950576.html deleted file mode 100644 index 7e80702fb8..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp349950576.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<metric::micron_base_unit> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<metric::micron_base_unit>

                                                                                        -

                                                                                        boost::units::base_unit_info<metric::micron_base_unit>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/metric/micron.hpp>
-
-
-struct base_unit_info<metric::micron_base_unit> {
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp349958496.html b/doc/html/boost/units/base_unit_inf_idp349958496.html deleted file mode 100644 index a2859e0cc7..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp349958496.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<metric::minute_base_unit> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<metric::minute_base_unit>

                                                                                        -

                                                                                        boost::units::base_unit_info<metric::minute_base_unit>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/metric/minute.hpp>
-
-
-struct base_unit_info<metric::minute_base_unit> {
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp349973296.html b/doc/html/boost/units/base_unit_inf_idp349973296.html deleted file mode 100644 index 274bf81c9e..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp349973296.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<metric::nautical_mile_base_unit> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<metric::nautical_mile_base_unit>

                                                                                        -

                                                                                        boost::units::base_unit_info<metric::nautical_mile_base_unit>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/metric/nautical_mile.hpp>
-
-
-struct base_unit_info<metric::nautical_mile_base_unit> {
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp349981200.html b/doc/html/boost/units/base_unit_inf_idp349981200.html deleted file mode 100644 index a87467c7f2..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp349981200.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<metric::ton_base_unit> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<metric::ton_base_unit>

                                                                                        -

                                                                                        boost::units::base_unit_info<metric::ton_base_unit>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/metric/ton.hpp>
-
-
-struct base_unit_info<metric::ton_base_unit> {
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp349995968.html b/doc/html/boost/units/base_unit_inf_idp349995968.html deleted file mode 100644 index 39a14bc477..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp349995968.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<metric::year_base_unit> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<metric::year_base_unit>

                                                                                        -

                                                                                        boost::units::base_unit_info<metric::year_base_unit>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/metric/year.hpp>
-
-
-struct base_unit_info<metric::year_base_unit> {
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp350066848.html b/doc/html/boost/units/base_unit_inf_idp350066848.html deleted file mode 100644 index 6619e028c9..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp350066848.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<us::cup_base_unit> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<us::cup_base_unit>

                                                                                        -

                                                                                        boost::units::base_unit_info<us::cup_base_unit>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/us/cup.hpp>
-
-
-struct base_unit_info<us::cup_base_unit> {
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp350075120.html b/doc/html/boost/units/base_unit_inf_idp350075120.html deleted file mode 100644 index 857e37325f..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp350075120.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<us::dram_base_unit> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<us::dram_base_unit>

                                                                                        -

                                                                                        boost::units::base_unit_info<us::dram_base_unit>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/us/dram.hpp>
-
-
-struct base_unit_info<us::dram_base_unit> {
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp350083408.html b/doc/html/boost/units/base_unit_inf_idp350083408.html deleted file mode 100644 index 2e5c05648b..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp350083408.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<us::fluid_dram_base_unit> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<us::fluid_dram_base_unit>

                                                                                        -

                                                                                        boost::units::base_unit_info<us::fluid_dram_base_unit>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/us/fluid_dram.hpp>
-
-
-struct base_unit_info<us::fluid_dram_base_unit> {
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp350091712.html b/doc/html/boost/units/base_unit_inf_idp350091712.html deleted file mode 100644 index 42e60a3ca5..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp350091712.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<us::fluid_ounce_base_unit> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<us::fluid_ounce_base_unit>

                                                                                        -

                                                                                        boost::units::base_unit_info<us::fluid_ounce_base_unit>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/us/fluid_ounce.hpp>
-
-
-struct base_unit_info<us::fluid_ounce_base_unit> {
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp350100000.html b/doc/html/boost/units/base_unit_inf_idp350100000.html deleted file mode 100644 index d2a660b589..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp350100000.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<us::foot_base_unit> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<us::foot_base_unit>

                                                                                        -

                                                                                        boost::units::base_unit_info<us::foot_base_unit>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/us/foot.hpp>
-
-
-struct base_unit_info<us::foot_base_unit> {
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp350108272.html b/doc/html/boost/units/base_unit_inf_idp350108272.html deleted file mode 100644 index c1d24f3098..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp350108272.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<us::gallon_base_unit> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<us::gallon_base_unit>

                                                                                        -

                                                                                        boost::units::base_unit_info<us::gallon_base_unit>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/us/gallon.hpp>
-
-
-struct base_unit_info<us::gallon_base_unit> {
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp350116544.html b/doc/html/boost/units/base_unit_inf_idp350116544.html deleted file mode 100644 index 226e40e2ef..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp350116544.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<us::gill_base_unit> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<us::gill_base_unit>

                                                                                        -

                                                                                        boost::units::base_unit_info<us::gill_base_unit>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/us/gill.hpp>
-
-
-struct base_unit_info<us::gill_base_unit> {
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp350124816.html b/doc/html/boost/units/base_unit_inf_idp350124816.html deleted file mode 100644 index 7d5541960d..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp350124816.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<us::grain_base_unit> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<us::grain_base_unit>

                                                                                        -

                                                                                        boost::units::base_unit_info<us::grain_base_unit>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/us/grain.hpp>
-
-
-struct base_unit_info<us::grain_base_unit> {
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp350133104.html b/doc/html/boost/units/base_unit_inf_idp350133104.html deleted file mode 100644 index 6788cf22c8..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp350133104.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<us::hundredweight_base_unit> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<us::hundredweight_base_unit>

                                                                                        -

                                                                                        boost::units::base_unit_info<us::hundredweight_base_unit>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/us/hundredweight.hpp>
-
-
-struct base_unit_info<us::hundredweight_base_unit> {
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp350141392.html b/doc/html/boost/units/base_unit_inf_idp350141392.html deleted file mode 100644 index 7d586b6701..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp350141392.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<us::inch_base_unit> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<us::inch_base_unit>

                                                                                        -

                                                                                        boost::units::base_unit_info<us::inch_base_unit>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/us/inch.hpp>
-
-
-struct base_unit_info<us::inch_base_unit> {
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp350149664.html b/doc/html/boost/units/base_unit_inf_idp350149664.html deleted file mode 100644 index a7ae02f8bd..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp350149664.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<us::mil_base_unit> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<us::mil_base_unit>

                                                                                        -

                                                                                        boost::units::base_unit_info<us::mil_base_unit>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/us/mil.hpp>
-
-
-struct base_unit_info<us::mil_base_unit> {
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp350157952.html b/doc/html/boost/units/base_unit_inf_idp350157952.html deleted file mode 100644 index 10aee8ddb8..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp350157952.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<us::mile_base_unit> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<us::mile_base_unit>

                                                                                        -

                                                                                        boost::units::base_unit_info<us::mile_base_unit>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/us/mile.hpp>
-
-
-struct base_unit_info<us::mile_base_unit> {
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp350166224.html b/doc/html/boost/units/base_unit_inf_idp350166224.html deleted file mode 100644 index c753c25548..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp350166224.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<us::minim_base_unit> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<us::minim_base_unit>

                                                                                        -

                                                                                        boost::units::base_unit_info<us::minim_base_unit>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/us/minim.hpp>
-
-
-struct base_unit_info<us::minim_base_unit> {
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp350174496.html b/doc/html/boost/units/base_unit_inf_idp350174496.html deleted file mode 100644 index 89b3d8f724..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp350174496.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<us::ounce_base_unit> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<us::ounce_base_unit>

                                                                                        -

                                                                                        boost::units::base_unit_info<us::ounce_base_unit>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/us/ounce.hpp>
-
-
-struct base_unit_info<us::ounce_base_unit> {
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp350203424.html b/doc/html/boost/units/base_unit_inf_idp350203424.html deleted file mode 100644 index ae515cb3ab..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp350203424.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<us::quart_base_unit> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<us::quart_base_unit>

                                                                                        -

                                                                                        boost::units::base_unit_info<us::quart_base_unit>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/us/quart.hpp>
-
-
-struct base_unit_info<us::quart_base_unit> {
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp350211712.html b/doc/html/boost/units/base_unit_inf_idp350211712.html deleted file mode 100644 index eb815c19b5..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp350211712.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<us::tablespoon_base_unit> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<us::tablespoon_base_unit>

                                                                                        -

                                                                                        boost::units::base_unit_info<us::tablespoon_base_unit>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/us/tablespoon.hpp>
-
-
-struct base_unit_info<us::tablespoon_base_unit> {
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp350220000.html b/doc/html/boost/units/base_unit_inf_idp350220000.html deleted file mode 100644 index 0a2c275690..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp350220000.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<us::teaspoon_base_unit> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<us::teaspoon_base_unit>

                                                                                        -

                                                                                        boost::units::base_unit_info<us::teaspoon_base_unit>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/us/teaspoon.hpp>
-
-
-struct base_unit_info<us::teaspoon_base_unit> {
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_inf_idp350228272.html b/doc/html/boost/units/base_unit_inf_idp350228272.html deleted file mode 100644 index 4fc234ef4b..0000000000 --- a/doc/html/boost/units/base_unit_inf_idp350228272.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct base_unit_info<us::ton_base_unit> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct base_unit_info<us::ton_base_unit>

                                                                                        -

                                                                                        boost::units::base_unit_info<us::ton_base_unit>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/base_units/us/ton.hpp>
-
-
-struct base_unit_info<us::ton_base_unit> {
-
-  // public static functions
-  static const char * name();
-  static const char * symbol();
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        -
                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/base_unit_info.html b/doc/html/boost/units/base_unit_info.html index d858548aef..2b7a4438fb 100644 --- a/doc/html/boost/units/base_unit_info.html +++ b/doc/html/boost/units/base_unit_info.html @@ -35,20 +35,20 @@ template<typename BaseUnit> struct base_unit_info { - // public static functions - static std::string name(); - static std::string symbol(); + // public static functions + static std::string name(); + static std::string symbol(); };
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        -

                                                                                        -base_unit_info public static functions

                                                                                        +

                                                                                        +base_unit_info public static functions

                                                                                        1. -
                                                                                          static std::string name();
                                                                                          The full name of the unit (returns BaseUnit::name() by default)
                                                                                          2. +
                                                                                          static std::string name();
                                                                                          The full name of the unit (returns BaseUnit::name() by default)
                                                                                        2. -
                                                                                          static std::string symbol();
                                                                                          The symbol for the base unit (Returns BaseUnit::symbol() by default)

                                                                                          +

                                                                                          static std::string symbol();
                                                                                          The symbol for the base unit (Returns BaseUnit::symbol() by default)

                                                                                          diff --git a/doc/html/boost/units/cgs/gram_base_unit.html b/doc/html/boost/units/cgs/gram_base_unit.html index f5de8268d1..f74a2302a1 100644 --- a/doc/html/boost/units/cgs/gram_base_unit.html +++ b/doc/html/boost/units/cgs/gram_base_unit.html @@ -8,7 +8,7 @@ - +
                                                                                          @@ -21,7 +21,7 @@
                                                                                          -PrevUpHomeNext +PrevUpHomeNext
                                                                                          @@ -35,18 +35,18 @@ struct gram_base_unit : public base_unit< gram_base_unit, mass_dimension,-8 > { - // public static functions - static std::string name(); - static std::string symbol(); + // public static functions + static std::string name(); + static std::string symbol(); };
                                                                                          -

                                                                                          Description

                                                                                          +

                                                                                          Description

                                                                                          -

                                                                                          -gram_base_unit public static functions

                                                                                          +

                                                                                          +gram_base_unit public static functions

                                                                                            -
                                                                                          1. static std::string name();
                                                                                            2. -
                                                                                          2. static std::string symbol();
                                                                                            3. +
                                                                                          3. static std::string name();
                                                                                            4. +
                                                                                          4. static std::string symbol();
                                                                                          @@ -62,7 +62,7 @@
                                                                                          -PrevUpHomeNext +PrevUpHomeNext
                                                                                          diff --git a/doc/html/boost/units/conversion_helper.html b/doc/html/boost/units/conversion_helper.html index 05d83417e7..037ab6ede6 100644 --- a/doc/html/boost/units/conversion_helper.html +++ b/doc/html/boost/units/conversion_helper.html @@ -35,11 +35,11 @@ template<typename From, typename To> struct conversion_helper { - // public static functions - static To convert(const From &); + // public static functions + static To convert(const From &); };
                                                                                          -

                                                                                          Description

                                                                                          +

                                                                                          Description

                                                                                          Template for defining conversions between quantities. This template should be specialized for every quantity that allows conversions. For example, if you have a two units called pair and dozen you would write 

                                                                                          namespace boost {
 namespace units {
@@ -56,9 +56,9 @@

                                                                                          In most cases, the predefined specializations for unit and absolute should be sufficient, so users should rarely need to use this.

                                                                                          -

                                                                                          -conversion_helper public static functions

                                                                                          -
                                                                                          1. static To convert(const From &);
                                                                                          +

                                                                                          +conversion_helper public static functions

                                                                                          +
                                                                                          1. static To convert(const From &);
                                                                                        diff --git a/doc/html/boost/units/dim.html b/doc/html/boost/units/dim.html index b6e364a9df..9bb53dbde6 100644 --- a/doc/html/boost/units/dim.html +++ b/doc/html/boost/units/dim.html @@ -41,7 +41,7 @@ typedef V value_type; };
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        The dim class represents a single dimension tag/dimension exponent pair. That is, dim<tag_type,value_type> is a pair where tag_type represents the fundamental dimension being represented and value_type represents the exponent of that fundamental dimension as a static_rational. tag_type must be a derived from a specialization of base_dimension. Specialization of the following Boost.MPL metafunctions are provided - @c mpl::plus for two @c dims - @c mpl::minus for two @c dims - @c mpl::negate for a @c dim diff --git a/doc/html/boost/units/divide_t_idm45506851716160.html b/doc/html/boost/units/divide_t_idm45506851716160.html new file mode 100644 index 0000000000..dc876ab202 --- /dev/null +++ b/doc/html/boost/units/divide_t_idm45506851716160.html @@ -0,0 +1,55 @@ + + + + +Struct template divide_typeof_helper<boost::units::unit< Dim, System >, boost::lambda::lambda_functor< Arg >> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +

                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct template divide_typeof_helper<boost::units::unit< Dim, System >, boost::lambda::lambda_functor< Arg >>

                                                                                        +

                                                                                        boost::units::divide_typeof_helper<boost::units::unit< Dim, System >, boost::lambda::lambda_functor< Arg >>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/lambda.hpp>
+
+template<typename System, typename Dim, typename Arg> 
+struct divide_typeof_helper<boost::units::unit< Dim, System >, boost::lambda::lambda_functor< Arg >> {
+  // types
+  typedef boost::lambda::lambda_functor< boost::lambda::lambda_functor_base< boost::lambda::arithmetic_action< boost::lambda::divide_action >, tuple< typename boost::lambda::const_copy_argument< const boost::units::unit< Dim, System > >::type, boost::lambda::lambda_functor< Arg > > > > type;
+};
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/divide_t_idm45506851721056.html b/doc/html/boost/units/divide_t_idm45506851721056.html new file mode 100644 index 0000000000..0606aba03b --- /dev/null +++ b/doc/html/boost/units/divide_t_idm45506851721056.html @@ -0,0 +1,55 @@ + + + + +Struct template divide_typeof_helper<boost::lambda::lambda_functor< Arg >, boost::units::unit< Dim, System >> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct template divide_typeof_helper<boost::lambda::lambda_functor< Arg >, boost::units::unit< Dim, System >>

                                                                                        +

                                                                                        boost::units::divide_typeof_helper<boost::lambda::lambda_functor< Arg >, boost::units::unit< Dim, System >>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/lambda.hpp>
+
+template<typename System, typename Dim, typename Arg> 
+struct divide_typeof_helper<boost::lambda::lambda_functor< Arg >, boost::units::unit< Dim, System >> {
+  // types
+  typedef boost::lambda::lambda_functor< boost::lambda::lambda_functor_base< boost::lambda::arithmetic_action< boost::lambda::divide_action >, tuple< boost::lambda::lambda_functor< Arg >, typename boost::lambda::const_copy_argument< const boost::units::unit< Dim, System > >::type > > > type;
+};
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/divide_typeof_helper.html b/doc/html/boost/units/divide_typeof_helper.html index d337451aa3..022c8e9830 100644 --- a/doc/html/boost/units/divide_typeof_helper.html +++ b/doc/html/boost/units/divide_typeof_helper.html @@ -35,15 +35,15 @@ template<typename X, typename Y> struct divide_typeof_helper { - // public member functions - typedef typeof((typeof_::make< X >()/typeof_::make< Y >())); + // public member functions + typedef typeof((typeof_::make< X >()/typeof_::make< Y >())); };
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        -

                                                                                        -divide_typeof_helper public member functions

                                                                                        -
                                                                                        1. typedef typeof((typeof_::make< X >()/typeof_::make< Y >()));
                                                                                        +

                                                                                        +divide_typeof_helper public member functions

                                                                                        +
                                                                                        1. typedef typeof((typeof_::make< X >()/typeof_::make< Y >()));
                                                                                        diff --git a/doc/html/boost/units/divide_typeof_idp347243200.html b/doc/html/boost/units/divide_typeof_idp347243200.html deleted file mode 100644 index e961f7c919..0000000000 --- a/doc/html/boost/units/divide_typeof_idp347243200.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template divide_typeof_helper<boost::lambda::lambda_functor< Arg >, boost::units::unit< Dim, System >> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct template divide_typeof_helper<boost::lambda::lambda_functor< Arg >, boost::units::unit< Dim, System >>

                                                                                        -

                                                                                        boost::units::divide_typeof_helper<boost::lambda::lambda_functor< Arg >, boost::units::unit< Dim, System >>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/lambda.hpp>
-
-template<typename System, typename Dim, typename Arg> 
-struct divide_typeof_helper<boost::lambda::lambda_functor< Arg >, boost::units::unit< Dim, System >> {
-  // types
-  typedef boost::lambda::lambda_functor< boost::lambda::lambda_functor_base< boost::lambda::arithmetic_action< boost::lambda::divide_action >, tuple< boost::lambda::lambda_functor< Arg >, typename boost::lambda::const_copy_argument< const boost::units::unit< Dim, System > >::type > > > type;
-};
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/divide_typeof_idp347248096.html b/doc/html/boost/units/divide_typeof_idp347248096.html deleted file mode 100644 index cb0615eeff..0000000000 --- a/doc/html/boost/units/divide_typeof_idp347248096.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template divide_typeof_helper<boost::units::unit< Dim, System >, boost::lambda::lambda_functor< Arg >> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct template divide_typeof_helper<boost::units::unit< Dim, System >, boost::lambda::lambda_functor< Arg >>

                                                                                        -

                                                                                        boost::units::divide_typeof_helper<boost::units::unit< Dim, System >, boost::lambda::lambda_functor< Arg >>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/lambda.hpp>
-
-template<typename System, typename Dim, typename Arg> 
-struct divide_typeof_helper<boost::units::unit< Dim, System >, boost::lambda::lambda_functor< Arg >> {
-  // types
-  typedef boost::lambda::lambda_functor< boost::lambda::lambda_functor_base< boost::lambda::arithmetic_action< boost::lambda::divide_action >, tuple< typename boost::lambda::const_copy_argument< const boost::units::unit< Dim, System > >::type, boost::lambda::lambda_functor< Arg > > > > type;
-};
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/get_dime_idm45506852163616.html b/doc/html/boost/units/get_dime_idm45506852163616.html new file mode 100644 index 0000000000..6d45f16945 --- /dev/null +++ b/doc/html/boost/units/get_dime_idm45506852163616.html @@ -0,0 +1,55 @@ + + + + +Struct template get_dimension<unit< Dim, System >> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct template get_dimension<unit< Dim, System >>

                                                                                        +

                                                                                        boost::units::get_dimension<unit< Dim, System >> — Get the dimension of a unit.

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/get_dimension.hpp>
+
+template<typename Dim, typename System> 
+struct get_dimension<unit< Dim, System >> {
+  // types
+  typedef Dim type;
+};
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/get_dime_idm45506852167568.html b/doc/html/boost/units/get_dime_idm45506852167568.html new file mode 100644 index 0000000000..4fcd3eb3b5 --- /dev/null +++ b/doc/html/boost/units/get_dime_idm45506852167568.html @@ -0,0 +1,55 @@ + + + + +Struct template get_dimension<quantity< Unit, Y >> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct template get_dimension<quantity< Unit, Y >>

                                                                                        +

                                                                                        boost::units::get_dimension<quantity< Unit, Y >> — Get the dimension of a quantity.

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/get_dimension.hpp>
+
+template<typename Unit, typename Y> 
+struct get_dimension<quantity< Unit, Y >> {
+  // types
+  typedef get_dimension< Unit >::type type;
+};
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/get_dime_idm45506852170672.html b/doc/html/boost/units/get_dime_idm45506852170672.html new file mode 100644 index 0000000000..518c94ec32 --- /dev/null +++ b/doc/html/boost/units/get_dime_idm45506852170672.html @@ -0,0 +1,55 @@ + + + + +Struct template get_dimension<absolute< Unit >> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct template get_dimension<absolute< Unit >>

                                                                                        +

                                                                                        boost::units::get_dimension<absolute< Unit >> — Get the dimension of an absolute unit.

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/get_dimension.hpp>
+
+template<typename Unit> 
+struct get_dimension<absolute< Unit >> {
+  // types
+  typedef get_dimension< Unit >::type type;
+};
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/get_dimension.html b/doc/html/boost/units/get_dimension.html index dfd08e1186..fadf4c4e0e 100644 --- a/doc/html/boost/units/get_dimension.html +++ b/doc/html/boost/units/get_dimension.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        @@ -47,7 +47,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        diff --git a/doc/html/boost/units/get_dimension_idp346793584.html b/doc/html/boost/units/get_dimension_idp346793584.html deleted file mode 100644 index 218f295d5d..0000000000 --- a/doc/html/boost/units/get_dimension_idp346793584.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template get_dimension<absolute< Unit >> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct template get_dimension<absolute< Unit >>

                                                                                        -

                                                                                        boost::units::get_dimension<absolute< Unit >> — Get the dimension of an absolute unit.

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/get_dimension.hpp>
-
-template<typename Unit> 
-struct get_dimension<absolute< Unit >> {
-  // types
-  typedef get_dimension< Unit >::type type;
-};
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/get_dimension_idp346796688.html b/doc/html/boost/units/get_dimension_idp346796688.html deleted file mode 100644 index d6d7500cd7..0000000000 --- a/doc/html/boost/units/get_dimension_idp346796688.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template get_dimension<quantity< Unit, Y >> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct template get_dimension<quantity< Unit, Y >>

                                                                                        -

                                                                                        boost::units::get_dimension<quantity< Unit, Y >> — Get the dimension of a quantity.

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/get_dimension.hpp>
-
-template<typename Unit, typename Y> 
-struct get_dimension<quantity< Unit, Y >> {
-  // types
-  typedef get_dimension< Unit >::type type;
-};
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/get_dimension_idp346800640.html b/doc/html/boost/units/get_dimension_idp346800640.html deleted file mode 100644 index d14e0ac3fc..0000000000 --- a/doc/html/boost/units/get_dimension_idp346800640.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template get_dimension<unit< Dim, System >> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct template get_dimension<unit< Dim, System >>

                                                                                        -

                                                                                        boost::units::get_dimension<unit< Dim, System >> — Get the dimension of a unit.

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/get_dimension.hpp>
-
-template<typename Dim, typename System> 
-struct get_dimension<unit< Dim, System >> {
-  // types
-  typedef Dim type;
-};
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/get_syst_idm45506852148880.html b/doc/html/boost/units/get_syst_idm45506852148880.html new file mode 100644 index 0000000000..579de6569e --- /dev/null +++ b/doc/html/boost/units/get_syst_idm45506852148880.html @@ -0,0 +1,55 @@ + + + + +Struct template get_system<unit< Dim, System >> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct template get_system<unit< Dim, System >>

                                                                                        +

                                                                                        boost::units::get_system<unit< Dim, System >> — Get the system of a unit.

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/get_system.hpp>
+
+template<typename Dim, typename System> 
+struct get_system<unit< Dim, System >> {
+  // types
+  typedef System type;
+};
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/get_syst_idm45506852152832.html b/doc/html/boost/units/get_syst_idm45506852152832.html new file mode 100644 index 0000000000..ae4abaf105 --- /dev/null +++ b/doc/html/boost/units/get_syst_idm45506852152832.html @@ -0,0 +1,55 @@ + + + + +Struct template get_system<quantity< Unit, Y >> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct template get_system<quantity< Unit, Y >>

                                                                                        +

                                                                                        boost::units::get_system<quantity< Unit, Y >> — Get the system of a quantity.

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/get_system.hpp>
+
+template<typename Unit, typename Y> 
+struct get_system<quantity< Unit, Y >> {
+  // types
+  typedef get_system< Unit >::type type;
+};
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/get_syst_idm45506852155936.html b/doc/html/boost/units/get_syst_idm45506852155936.html new file mode 100644 index 0000000000..8d5b9e8710 --- /dev/null +++ b/doc/html/boost/units/get_syst_idm45506852155936.html @@ -0,0 +1,55 @@ + + + + +Struct template get_system<absolute< Unit >> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct template get_system<absolute< Unit >>

                                                                                        +

                                                                                        boost::units::get_system<absolute< Unit >> — Get the system of an absolute unit.

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/get_system.hpp>
+
+template<typename Unit> 
+struct get_system<absolute< Unit >> {
+  // types
+  typedef get_system< Unit >::type type;
+};
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/get_system.html b/doc/html/boost/units/get_system.html index 1849d55bb6..7351cf7931 100644 --- a/doc/html/boost/units/get_system.html +++ b/doc/html/boost/units/get_system.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        @@ -47,7 +47,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        diff --git a/doc/html/boost/units/get_system_ab_idp346808320.html b/doc/html/boost/units/get_system_ab_idp346808320.html deleted file mode 100644 index 38dc2eedf4..0000000000 --- a/doc/html/boost/units/get_system_ab_idp346808320.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template get_system<absolute< Unit >> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct template get_system<absolute< Unit >>

                                                                                        -

                                                                                        boost::units::get_system<absolute< Unit >> — Get the system of an absolute unit.

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/get_system.hpp>
-
-template<typename Unit> 
-struct get_system<absolute< Unit >> {
-  // types
-  typedef get_system< Unit >::type type;
-};
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/get_system_qu_idp346811424.html b/doc/html/boost/units/get_system_qu_idp346811424.html deleted file mode 100644 index de5f3e5329..0000000000 --- a/doc/html/boost/units/get_system_qu_idp346811424.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template get_system<quantity< Unit, Y >> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct template get_system<quantity< Unit, Y >>

                                                                                        -

                                                                                        boost::units::get_system<quantity< Unit, Y >> — Get the system of a quantity.

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/get_system.hpp>
-
-template<typename Unit, typename Y> 
-struct get_system<quantity< Unit, Y >> {
-  // types
-  typedef get_system< Unit >::type type;
-};
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/get_system_un_idp346815376.html b/doc/html/boost/units/get_system_un_idp346815376.html deleted file mode 100644 index 1fd52f9ac3..0000000000 --- a/doc/html/boost/units/get_system_un_idp346815376.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template get_system<unit< Dim, System >> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct template get_system<unit< Dim, System >>

                                                                                        -

                                                                                        boost::units::get_system<unit< Dim, System >> — Get the system of a unit.

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/get_system.hpp>
-
-template<typename Dim, typename System> 
-struct get_system<unit< Dim, System >> {
-  // types
-  typedef System type;
-};
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/heterogeneous_system.html b/doc/html/boost/units/heterogeneous_system.html index 739158cc38..cc44a8ffc4 100644 --- a/doc/html/boost/units/heterogeneous_system.html +++ b/doc/html/boost/units/heterogeneous_system.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        @@ -36,7 +36,7 @@ struct heterogeneous_system : public T { };
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        A system that can represent any possible combination of units at the expense of not preserving information about how it was created. Do not create specializations of this template directly. Instead use reduce_unit and base_unit<...>::unit_type.

                                                                                        @@ -51,7 +51,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        diff --git a/doc/html/boost/units/homogeneous_system.html b/doc/html/boost/units/homogeneous_system.html index 3f422b4388..ef8ee9a947 100644 --- a/doc/html/boost/units/homogeneous_system.html +++ b/doc/html/boost/units/homogeneous_system.html @@ -36,7 +36,7 @@ struct homogeneous_system { };
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        A system that can uniquely represent any unit which can be composed from a linearly independent set of base units. It is safe to rebind a unit with such a system to different dimensions.

                                                                                        Do not construct this template directly. Use make_system instead.

                                                                                        diff --git a/doc/html/boost/units/imperial/pint_base_unit.html b/doc/html/boost/units/imperial/pint_base_unit.html index e9d8175174..42f7c4580e 100644 --- a/doc/html/boost/units/imperial/pint_base_unit.html +++ b/doc/html/boost/units/imperial/pint_base_unit.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        @@ -36,18 +36,18 @@ struct pint_base_unit : public boost::units::base_unit< pint_base_unit, si::volume::dimension_type,-303 > { - // public static functions - static const char * name(); - static const char * symbol(); + // public static functions + static const char * name(); + static const char * symbol(); };
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        -

                                                                                        -pint_base_unit public static functions

                                                                                        +

                                                                                        +pint_base_unit public static functions

                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        3. static const char * name();
                                                                                          4. +
                                                                                        4. static const char * symbol();
                                                                                        @@ -63,7 +63,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        diff --git a/doc/html/boost/units/imperial/pound_base_unit.html b/doc/html/boost/units/imperial/pound_base_unit.html index 1c7f6b1a97..4cda25b828 100644 --- a/doc/html/boost/units/imperial/pound_base_unit.html +++ b/doc/html/boost/units/imperial/pound_base_unit.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        @@ -36,18 +36,18 @@ struct pound_base_unit : public boost::units::base_unit< pound_base_unit, cgs::gram_base_unit::dimension_type,-302 > { - // public static functions - static const char * name(); - static const char * symbol(); + // public static functions + static const char * name(); + static const char * symbol(); };
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        -

                                                                                        -pound_base_unit public static functions

                                                                                        +

                                                                                        +pound_base_unit public static functions

                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        3. static const char * name();
                                                                                          4. +
                                                                                        4. static const char * symbol();
                                                                                        @@ -63,7 +63,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        diff --git a/doc/html/boost/units/imperial/yard_base_unit.html b/doc/html/boost/units/imperial/yard_base_unit.html index e40b026c12..3af1621d45 100644 --- a/doc/html/boost/units/imperial/yard_base_unit.html +++ b/doc/html/boost/units/imperial/yard_base_unit.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        @@ -36,18 +36,18 @@ struct yard_base_unit : public boost::units::base_unit< yard_base_unit, si::meter_base_unit::dimension_type,-301 > { - // public static functions - static const char * name(); - static const char * symbol(); + // public static functions + static const char * name(); + static const char * symbol(); };
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        -

                                                                                        -yard_base_unit public static functions

                                                                                        +

                                                                                        +yard_base_unit public static functions

                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        3. static const char * name();
                                                                                          4. +
                                                                                        4. static const char * symbol();
                                                                                        @@ -63,7 +63,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        diff --git a/doc/html/boost/units/is_dim.html b/doc/html/boost/units/is_dim.html index f86f7ab97c..f361a14d8f 100644 --- a/doc/html/boost/units/is_dim.html +++ b/doc/html/boost/units/is_dim.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        @@ -47,7 +47,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        diff --git a/doc/html/boost/units/is_dim_d_idm45506852017952.html b/doc/html/boost/units/is_dim_d_idm45506852017952.html new file mode 100644 index 0000000000..d295d02a60 --- /dev/null +++ b/doc/html/boost/units/is_dim_d_idm45506852017952.html @@ -0,0 +1,53 @@ + + + + +Struct template is_dim<dim< T, V >> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct template is_dim<dim< T, V >>

                                                                                        +

                                                                                        boost::units::is_dim<dim< T, V >>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/is_dim.hpp>
+
+template<typename T, typename V> 
+struct is_dim<dim< T, V >> : public true_ {
+};
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/is_dim_dim_T__idp346946304.html b/doc/html/boost/units/is_dim_dim_T__idp346946304.html deleted file mode 100644 index a1e34448ec..0000000000 --- a/doc/html/boost/units/is_dim_dim_T__idp346946304.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template is_dim<dim< T, V >> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct template is_dim<dim< T, V >>

                                                                                        -

                                                                                        boost::units::is_dim<dim< T, V >>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/is_dim.hpp>
-
-template<typename T, typename V> 
-struct is_dim<dim< T, V >> : public true_ {
-};
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/is_dimen_idm45506851997280.html b/doc/html/boost/units/is_dimen_idm45506851997280.html new file mode 100644 index 0000000000..a58650474d --- /dev/null +++ b/doc/html/boost/units/is_dimen_idm45506851997280.html @@ -0,0 +1,53 @@ + + + + +Struct template is_dimensionless<unit< dimensionless_type, System >> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct template is_dimensionless<unit< dimensionless_type, System >>

                                                                                        +

                                                                                        boost::units::is_dimensionless<unit< dimensionless_type, System >> — Check if a unit is dimensionless.

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/is_dimensionless.hpp>
+
+template<typename System> 
+struct is_dimensionless<unit< dimensionless_type, System >> : public true_ {
+};
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/is_dimen_idm45506852000672.html b/doc/html/boost/units/is_dimen_idm45506852000672.html new file mode 100644 index 0000000000..4042dbe9e3 --- /dev/null +++ b/doc/html/boost/units/is_dimen_idm45506852000672.html @@ -0,0 +1,53 @@ + + + + +Struct template is_dimensionless<quantity< Unit, Y >> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct template is_dimensionless<quantity< Unit, Y >>

                                                                                        +

                                                                                        boost::units::is_dimensionless<quantity< Unit, Y >> — Check if a quantity is dimensionless.

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/is_dimensionless.hpp>
+
+template<typename Unit, typename Y> 
+struct is_dimensionless<quantity< Unit, Y >> : public boost::units::is_dimensionless< Unit > {
+};
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/is_dimen_idm45506852008320.html b/doc/html/boost/units/is_dimen_idm45506852008320.html new file mode 100644 index 0000000000..aebd42518f --- /dev/null +++ b/doc/html/boost/units/is_dimen_idm45506852008320.html @@ -0,0 +1,53 @@ + + + + +Struct template is_dimension_list<list< Item, Next >> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct template is_dimension_list<list< Item, Next >>

                                                                                        +

                                                                                        boost::units::is_dimension_list<list< Item, Next >>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/is_dimension_list.hpp>
+
+template<typename Item, typename Next> 
+struct is_dimension_list<list< Item, Next >> : public true_ {
+};
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/is_dimen_idm45506852009984.html b/doc/html/boost/units/is_dimen_idm45506852009984.html new file mode 100644 index 0000000000..61daa3538d --- /dev/null +++ b/doc/html/boost/units/is_dimen_idm45506852009984.html @@ -0,0 +1,53 @@ + + + + +Struct is_dimension_list<dimensionless_type> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct is_dimension_list<dimensionless_type>

                                                                                        +

                                                                                        boost::units::is_dimension_list<dimensionless_type>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/is_dimension_list.hpp>
+
+
+struct is_dimension_list<dimensionless_type> : public true_ {
+};
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/is_dimension__idp346954272.html b/doc/html/boost/units/is_dimension__idp346954272.html deleted file mode 100644 index ded3f21b14..0000000000 --- a/doc/html/boost/units/is_dimension__idp346954272.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct is_dimension_list<dimensionless_type> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct is_dimension_list<dimensionless_type>

                                                                                        -

                                                                                        boost::units::is_dimension_list<dimensionless_type>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/is_dimension_list.hpp>
-
-
-struct is_dimension_list<dimensionless_type> : public true_ {
-};
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/is_dimension__idp346955936.html b/doc/html/boost/units/is_dimension__idp346955936.html deleted file mode 100644 index 44cd07b731..0000000000 --- a/doc/html/boost/units/is_dimension__idp346955936.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template is_dimension_list<list< Item, Next >> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct template is_dimension_list<list< Item, Next >>

                                                                                        -

                                                                                        boost::units::is_dimension_list<list< Item, Next >>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/is_dimension_list.hpp>
-
-template<typename Item, typename Next> 
-struct is_dimension_list<list< Item, Next >> : public true_ {
-};
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/is_dimension_list.html b/doc/html/boost/units/is_dimension_list.html index ba1ef1a5f1..9356fb775c 100644 --- a/doc/html/boost/units/is_dimension_list.html +++ b/doc/html/boost/units/is_dimension_list.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        @@ -47,7 +47,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        diff --git a/doc/html/boost/units/is_dimensionl_idp346963584.html b/doc/html/boost/units/is_dimensionl_idp346963584.html deleted file mode 100644 index 2f9a21a39a..0000000000 --- a/doc/html/boost/units/is_dimensionl_idp346963584.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template is_dimensionless<quantity< Unit, Y >> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct template is_dimensionless<quantity< Unit, Y >>

                                                                                        -

                                                                                        boost::units::is_dimensionless<quantity< Unit, Y >> — Check if a quantity is dimensionless.

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/is_dimensionless.hpp>
-
-template<typename Unit, typename Y> 
-struct is_dimensionless<quantity< Unit, Y >> : public boost::units::is_dimensionless< Unit > {
-};
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/is_dimensionl_idp346966976.html b/doc/html/boost/units/is_dimensionl_idp346966976.html deleted file mode 100644 index d41b810dc4..0000000000 --- a/doc/html/boost/units/is_dimensionl_idp346966976.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template is_dimensionless<unit< dimensionless_type, System >> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct template is_dimensionless<unit< dimensionless_type, System >>

                                                                                        -

                                                                                        boost::units::is_dimensionless<unit< dimensionless_type, System >> — Check if a unit is dimensionless.

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/is_dimensionless.hpp>
-
-template<typename System> 
-struct is_dimensionless<unit< dimensionless_type, System >> : public true_ {
-};
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/is_dimensionless.html b/doc/html/boost/units/is_dimensionless.html index 20bdb5e884..d9d80abb21 100644 --- a/doc/html/boost/units/is_dimensionless.html +++ b/doc/html/boost/units/is_dimensionless.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        @@ -47,7 +47,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        diff --git a/doc/html/boost/units/is_dimensionless_quantity.html b/doc/html/boost/units/is_dimensionless_quantity.html index dd8aa9f500..be21fda457 100644 --- a/doc/html/boost/units/is_dimensionless_quantity.html +++ b/doc/html/boost/units/is_dimensionless_quantity.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        @@ -49,7 +49,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        diff --git a/doc/html/boost/units/is_quant_idm45506851961648.html b/doc/html/boost/units/is_quant_idm45506851961648.html new file mode 100644 index 0000000000..a038137e86 --- /dev/null +++ b/doc/html/boost/units/is_quant_idm45506851961648.html @@ -0,0 +1,55 @@ + + + + +Struct template is_quantity_of_system<quantity< Unit, Y >, System> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct template is_quantity_of_system<quantity< Unit, Y >, System>

                                                                                        +

                                                                                        boost::units::is_quantity_of_system<quantity< Unit, Y >, System>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/is_quantity_of_system.hpp>
+
+template<typename Unit, typename Y, typename System> 
+struct is_quantity_of_system<quantity< Unit, Y >, System> :
+  public boost::units::is_unit_of_system< Unit, System >
+{
+};
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/is_quant_idm45506851971072.html b/doc/html/boost/units/is_quant_idm45506851971072.html new file mode 100644 index 0000000000..56969a7d08 --- /dev/null +++ b/doc/html/boost/units/is_quant_idm45506851971072.html @@ -0,0 +1,55 @@ + + + + +Struct template is_quantity_of_dimension<quantity< Unit, Y >, Dim> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct template is_quantity_of_dimension<quantity< Unit, Y >, Dim>

                                                                                        +

                                                                                        boost::units::is_quantity_of_dimension<quantity< Unit, Y >, Dim>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/is_quantity_of_dimension.hpp>
+
+template<typename Unit, typename Y, typename Dim> 
+struct is_quantity_of_dimension<quantity< Unit, Y >, Dim> :
+  public boost::units::is_unit_of_dimension< Unit, Dim >
+{
+};
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/is_quant_idm45506851979664.html b/doc/html/boost/units/is_quant_idm45506851979664.html new file mode 100644 index 0000000000..9a42eae950 --- /dev/null +++ b/doc/html/boost/units/is_quant_idm45506851979664.html @@ -0,0 +1,53 @@ + + + + +Struct template is_quantity<quantity< Unit, Y >> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct template is_quantity<quantity< Unit, Y >>

                                                                                        +

                                                                                        boost::units::is_quantity<quantity< Unit, Y >>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/is_quantity.hpp>
+
+template<typename Unit, typename Y> 
+struct is_quantity<quantity< Unit, Y >> : public true_ {
+};
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/is_quantity.html b/doc/html/boost/units/is_quantity.html index acdc13b315..79e995647e 100644 --- a/doc/html/boost/units/is_quantity.html +++ b/doc/html/boost/units/is_quantity.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        @@ -47,7 +47,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        diff --git a/doc/html/boost/units/is_quantity_o_idp346993184.html b/doc/html/boost/units/is_quantity_o_idp346993184.html deleted file mode 100644 index 429cfa726f..0000000000 --- a/doc/html/boost/units/is_quantity_o_idp346993184.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template is_quantity_of_dimension<quantity< Unit, Y >, Dim> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct template is_quantity_of_dimension<quantity< Unit, Y >, Dim>

                                                                                        -

                                                                                        boost::units::is_quantity_of_dimension<quantity< Unit, Y >, Dim>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/is_quantity_of_dimension.hpp>
-
-template<typename Unit, typename Y, typename Dim> 
-struct is_quantity_of_dimension<quantity< Unit, Y >, Dim> :
-  public boost::units::is_unit_of_dimension< Unit, Dim >
-{
-};
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/is_quantity_o_idp347002608.html b/doc/html/boost/units/is_quantity_o_idp347002608.html deleted file mode 100644 index feac3e5561..0000000000 --- a/doc/html/boost/units/is_quantity_o_idp347002608.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template is_quantity_of_system<quantity< Unit, Y >, System> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct template is_quantity_of_system<quantity< Unit, Y >, System>

                                                                                        -

                                                                                        boost::units::is_quantity_of_system<quantity< Unit, Y >, System>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/is_quantity_of_system.hpp>
-
-template<typename Unit, typename Y, typename System> 
-struct is_quantity_of_system<quantity< Unit, Y >, System> :
-  public boost::units::is_unit_of_system< Unit, System >
-{
-};
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/is_quantity_of_dimension.html b/doc/html/boost/units/is_quantity_of_dimension.html index ec9ba8739f..f2e5faa9f2 100644 --- a/doc/html/boost/units/is_quantity_of_dimension.html +++ b/doc/html/boost/units/is_quantity_of_dimension.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        @@ -47,7 +47,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        diff --git a/doc/html/boost/units/is_quantity_of_system.html b/doc/html/boost/units/is_quantity_of_system.html index 0a62e906d8..1e21ce2fc8 100644 --- a/doc/html/boost/units/is_quantity_of_system.html +++ b/doc/html/boost/units/is_quantity_of_system.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        @@ -47,7 +47,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        diff --git a/doc/html/boost/units/is_quantity_q_idp346984592.html b/doc/html/boost/units/is_quantity_q_idp346984592.html deleted file mode 100644 index 58eba4b453..0000000000 --- a/doc/html/boost/units/is_quantity_q_idp346984592.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template is_quantity<quantity< Unit, Y >> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct template is_quantity<quantity< Unit, Y >>

                                                                                        -

                                                                                        boost::units::is_quantity<quantity< Unit, Y >>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/is_quantity.hpp>
-
-template<typename Unit, typename Y> 
-struct is_quantity<quantity< Unit, Y >> : public true_ {
-};
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/is_unit.html b/doc/html/boost/units/is_unit.html index 8ee5b4f965..540d86f778 100644 --- a/doc/html/boost/units/is_unit.html +++ b/doc/html/boost/units/is_unit.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        @@ -47,7 +47,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        diff --git a/doc/html/boost/units/is_unit__idm45506851928752.html b/doc/html/boost/units/is_unit__idm45506851928752.html new file mode 100644 index 0000000000..f7f78b10e0 --- /dev/null +++ b/doc/html/boost/units/is_unit__idm45506851928752.html @@ -0,0 +1,53 @@ + + + + +Struct template is_unit_of_system<unit< Dim, System >, System> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct template is_unit_of_system<unit< Dim, System >, System>

                                                                                        +

                                                                                        boost::units::is_unit_of_system<unit< Dim, System >, System>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/is_unit_of_system.hpp>
+
+template<typename Dim, typename System> 
+struct is_unit_of_system<unit< Dim, System >, System> : public true_ {
+};
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/is_unit__idm45506851932112.html b/doc/html/boost/units/is_unit__idm45506851932112.html new file mode 100644 index 0000000000..0507b6b50b --- /dev/null +++ b/doc/html/boost/units/is_unit__idm45506851932112.html @@ -0,0 +1,53 @@ + + + + +Struct template is_unit_of_system<absolute< unit< Dim, System > >, System> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct template is_unit_of_system<absolute< unit< Dim, System > >, System>

                                                                                        +

                                                                                        boost::units::is_unit_of_system<absolute< unit< Dim, System > >, System>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/is_unit_of_system.hpp>
+
+template<typename Dim, typename System> 
+struct is_unit_of_system<absolute< unit< Dim, System > >, System> : public true_ {
+};
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/is_unit__idm45506851940928.html b/doc/html/boost/units/is_unit__idm45506851940928.html new file mode 100644 index 0000000000..f693cc434c --- /dev/null +++ b/doc/html/boost/units/is_unit__idm45506851940928.html @@ -0,0 +1,53 @@ + + + + +Struct template is_unit_of_dimension<unit< Dim, System >, Dim> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct template is_unit_of_dimension<unit< Dim, System >, Dim>

                                                                                        +

                                                                                        boost::units::is_unit_of_dimension<unit< Dim, System >, Dim>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/is_unit_of_dimension.hpp>
+
+template<typename Dim, typename System> 
+struct is_unit_of_dimension<unit< Dim, System >, Dim> : public true_ {
+};
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/is_unit__idm45506851944288.html b/doc/html/boost/units/is_unit__idm45506851944288.html new file mode 100644 index 0000000000..128f6dc23d --- /dev/null +++ b/doc/html/boost/units/is_unit__idm45506851944288.html @@ -0,0 +1,53 @@ + + + + +Struct template is_unit_of_dimension<absolute< unit< Dim, System > >, Dim> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct template is_unit_of_dimension<absolute< unit< Dim, System > >, Dim>

                                                                                        +

                                                                                        boost::units::is_unit_of_dimension<absolute< unit< Dim, System > >, Dim>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/is_unit_of_dimension.hpp>
+
+template<typename Dim, typename System> 
+struct is_unit_of_dimension<absolute< unit< Dim, System > >, Dim> : public true_ {
+};
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/is_unit__idm45506851952848.html b/doc/html/boost/units/is_unit__idm45506851952848.html new file mode 100644 index 0000000000..91e54720f6 --- /dev/null +++ b/doc/html/boost/units/is_unit__idm45506851952848.html @@ -0,0 +1,53 @@ + + + + +Struct template is_unit<unit< Dim, System >> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct template is_unit<unit< Dim, System >>

                                                                                        +

                                                                                        boost::units::is_unit<unit< Dim, System >>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/is_unit.hpp>
+
+template<typename Dim, typename System> 
+struct is_unit<unit< Dim, System >> : public true_ {
+};
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/is_unit_of_di_idp347019968.html b/doc/html/boost/units/is_unit_of_di_idp347019968.html deleted file mode 100644 index 2ace4df47a..0000000000 --- a/doc/html/boost/units/is_unit_of_di_idp347019968.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template is_unit_of_dimension<absolute< unit< Dim, System > >, Dim> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct template is_unit_of_dimension<absolute< unit< Dim, System > >, Dim>

                                                                                        -

                                                                                        boost::units::is_unit_of_dimension<absolute< unit< Dim, System > >, Dim>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/is_unit_of_dimension.hpp>
-
-template<typename Dim, typename System> 
-struct is_unit_of_dimension<absolute< unit< Dim, System > >, Dim> : public true_ {
-};
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/is_unit_of_di_idp347023328.html b/doc/html/boost/units/is_unit_of_di_idp347023328.html deleted file mode 100644 index c60d63ad3d..0000000000 --- a/doc/html/boost/units/is_unit_of_di_idp347023328.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template is_unit_of_dimension<unit< Dim, System >, Dim> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct template is_unit_of_dimension<unit< Dim, System >, Dim>

                                                                                        -

                                                                                        boost::units::is_unit_of_dimension<unit< Dim, System >, Dim>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/is_unit_of_dimension.hpp>
-
-template<typename Dim, typename System> 
-struct is_unit_of_dimension<unit< Dim, System >, Dim> : public true_ {
-};
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/is_unit_of_dimension.html b/doc/html/boost/units/is_unit_of_dimension.html index 65e8be847d..8534b010b1 100644 --- a/doc/html/boost/units/is_unit_of_dimension.html +++ b/doc/html/boost/units/is_unit_of_dimension.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        @@ -47,7 +47,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        diff --git a/doc/html/boost/units/is_unit_of_sy_idp347032144.html b/doc/html/boost/units/is_unit_of_sy_idp347032144.html deleted file mode 100644 index e522f04fda..0000000000 --- a/doc/html/boost/units/is_unit_of_sy_idp347032144.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template is_unit_of_system<absolute< unit< Dim, System > >, System> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct template is_unit_of_system<absolute< unit< Dim, System > >, System>

                                                                                        -

                                                                                        boost::units::is_unit_of_system<absolute< unit< Dim, System > >, System>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/is_unit_of_system.hpp>
-
-template<typename Dim, typename System> 
-struct is_unit_of_system<absolute< unit< Dim, System > >, System> : public true_ {
-};
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/is_unit_of_sy_idp347035504.html b/doc/html/boost/units/is_unit_of_sy_idp347035504.html deleted file mode 100644 index f035086382..0000000000 --- a/doc/html/boost/units/is_unit_of_sy_idp347035504.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template is_unit_of_system<unit< Dim, System >, System> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct template is_unit_of_system<unit< Dim, System >, System>

                                                                                        -

                                                                                        boost::units::is_unit_of_system<unit< Dim, System >, System>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/is_unit_of_system.hpp>
-
-template<typename Dim, typename System> 
-struct is_unit_of_system<unit< Dim, System >, System> : public true_ {
-};
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/is_unit_of_system.html b/doc/html/boost/units/is_unit_of_system.html index e12d70a574..6758f32b2a 100644 --- a/doc/html/boost/units/is_unit_of_system.html +++ b/doc/html/boost/units/is_unit_of_system.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        @@ -47,7 +47,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        diff --git a/doc/html/boost/units/is_unit_unit__idp347011408.html b/doc/html/boost/units/is_unit_unit__idp347011408.html deleted file mode 100644 index 0f7a7a617b..0000000000 --- a/doc/html/boost/units/is_unit_unit__idp347011408.html +++ /dev/null @@ -1,53 +0,0 @@ - - - - -Struct template is_unit<unit< Dim, System >> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct template is_unit<unit< Dim, System >>

                                                                                        -

                                                                                        boost::units::is_unit<unit< Dim, System >>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/is_unit.hpp>
-
-template<typename Dim, typename System> 
-struct is_unit<unit< Dim, System >> : public true_ {
-};
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/length_base_dimension.html b/doc/html/boost/units/length_base_dimension.html index 5cc5717c7b..9dd54a63b9 100644 --- a/doc/html/boost/units/length_base_dimension.html +++ b/doc/html/boost/units/length_base_dimension.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        @@ -49,7 +49,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        diff --git a/doc/html/boost/units/luminous_idm45506850904240.html b/doc/html/boost/units/luminous_idm45506850904240.html new file mode 100644 index 0000000000..8799b52074 --- /dev/null +++ b/doc/html/boost/units/luminous_idm45506850904240.html @@ -0,0 +1,55 @@ + + + + +Struct luminous_intensity_base_dimension + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct luminous_intensity_base_dimension

                                                                                        +

                                                                                        boost::units::luminous_intensity_base_dimension — base dimension of luminous intensity

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/physical_dimensions/luminous_intensity.hpp>
+
+
+struct luminous_intensity_base_dimension :
+  public boost::units::base_dimension< luminous_intensity_base_dimension,-3 >
+{
+};
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/luminous_inte_idp348060016.html b/doc/html/boost/units/luminous_inte_idp348060016.html deleted file mode 100644 index 0ecb1d3be5..0000000000 --- a/doc/html/boost/units/luminous_inte_idp348060016.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct luminous_intensity_base_dimension - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct luminous_intensity_base_dimension

                                                                                        -

                                                                                        boost::units::luminous_intensity_base_dimension — base dimension of luminous intensity

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/physical_dimensions/luminous_intensity.hpp>
-
-
-struct luminous_intensity_base_dimension :
-  public boost::units::base_dimension< luminous_intensity_base_dimension,-3 >
-{
-};
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/make_dimension_list.html b/doc/html/boost/units/make_dimension_list.html index 2d45366739..4f0f2e2fae 100644 --- a/doc/html/boost/units/make_dimension_list.html +++ b/doc/html/boost/units/make_dimension_list.html @@ -38,7 +38,7 @@ typedef unspecified type; };
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        Reduce dimension list to cardinal form. This algorithm collapses duplicate base dimension tags and sorts the resulting list by the tag ordinal value. Dimension lists that resolve to the same dimension are guaranteed to be represented by an identical type.

                                                                                        The argument should be an MPL forward sequence containing instances of the dim template.

                                                                                        The result is also an MPL forward sequence. It also supports the following metafunctions to allow use as a dimension.

                                                                                        diff --git a/doc/html/boost/units/make_sca_idm45506851596992.html b/doc/html/boost/units/make_sca_idm45506851596992.html new file mode 100644 index 0000000000..a536bc469f --- /dev/null +++ b/doc/html/boost/units/make_sca_idm45506851596992.html @@ -0,0 +1,55 @@ + + + + +Struct template make_scaled_unit<unit< Dimension, heterogeneous_system< heterogeneous_system_impl< UnitList, Dimension, OldScale > > >, scale< Base, static_rational< 0 > >> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct template make_scaled_unit<unit< Dimension, heterogeneous_system< heterogeneous_system_impl< UnitList, Dimension, OldScale > > >, scale< Base, static_rational< 0 > >>

                                                                                        +

                                                                                        boost::units::make_scaled_unit<unit< Dimension, heterogeneous_system< heterogeneous_system_impl< UnitList, Dimension, OldScale > > >, scale< Base, static_rational< 0 > >>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/make_scaled_unit.hpp>
+
+template<typename Dimension, typename UnitList, typename OldScale, long Base> 
+struct make_scaled_unit<unit< Dimension, heterogeneous_system< heterogeneous_system_impl< UnitList, Dimension, OldScale > > >, scale< Base, static_rational< 0 > >> {
+  // types
+  typedef unit< Dimension, heterogeneous_system< heterogeneous_system_impl< UnitList, Dimension, OldScale > > > type;
+};
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/make_sca_idm45506851604096.html b/doc/html/boost/units/make_sca_idm45506851604096.html new file mode 100644 index 0000000000..47f85ebc92 --- /dev/null +++ b/doc/html/boost/units/make_sca_idm45506851604096.html @@ -0,0 +1,56 @@ + + + + +Struct template make_scaled_unit<unit< Dimension, heterogeneous_system< heterogeneous_system_impl< UnitList, Dimension, OldScale > > >, Scale> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct template make_scaled_unit<unit< Dimension, heterogeneous_system< heterogeneous_system_impl< UnitList, Dimension, OldScale > > >, Scale>

                                                                                        +

                                                                                        boost::units::make_scaled_unit<unit< Dimension, heterogeneous_system< heterogeneous_system_impl< UnitList, Dimension, OldScale > > >, Scale>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/make_scaled_unit.hpp>
+
+template<typename Dimension, typename UnitList, typename OldScale, 
+         typename Scale> 
+struct make_scaled_unit<unit< Dimension, heterogeneous_system< heterogeneous_system_impl< UnitList, Dimension, OldScale > > >, Scale> {
+  // types
+  typedef unit< Dimension, heterogeneous_system< heterogeneous_system_impl< UnitList, Dimension, typename mpl::times< OldScale, list< scale_list_dim< Scale >, dimensionless_type > >::type > > > type;
+};
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/make_scaled_u_idp347360160.html b/doc/html/boost/units/make_scaled_u_idp347360160.html deleted file mode 100644 index 10f7e6ecc3..0000000000 --- a/doc/html/boost/units/make_scaled_u_idp347360160.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Struct template make_scaled_unit<unit< Dimension, heterogeneous_system< heterogeneous_system_impl< UnitList, Dimension, OldScale > > >, Scale> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct template make_scaled_unit<unit< Dimension, heterogeneous_system< heterogeneous_system_impl< UnitList, Dimension, OldScale > > >, Scale>

                                                                                        -

                                                                                        boost::units::make_scaled_unit<unit< Dimension, heterogeneous_system< heterogeneous_system_impl< UnitList, Dimension, OldScale > > >, Scale>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/make_scaled_unit.hpp>
-
-template<typename Dimension, typename UnitList, typename OldScale, 
-         typename Scale> 
-struct make_scaled_unit<unit< Dimension, heterogeneous_system< heterogeneous_system_impl< UnitList, Dimension, OldScale > > >, Scale> {
-  // types
-  typedef unit< Dimension, heterogeneous_system< heterogeneous_system_impl< UnitList, Dimension, typename mpl::times< OldScale, list< scale_list_dim< Scale >, dimensionless_type > >::type > > > type;
-};
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/make_scaled_u_idp347367264.html b/doc/html/boost/units/make_scaled_u_idp347367264.html deleted file mode 100644 index e7c5b4a6b9..0000000000 --- a/doc/html/boost/units/make_scaled_u_idp347367264.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template make_scaled_unit<unit< Dimension, heterogeneous_system< heterogeneous_system_impl< UnitList, Dimension, OldScale > > >, scale< Base, static_rational< 0 > >> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct template make_scaled_unit<unit< Dimension, heterogeneous_system< heterogeneous_system_impl< UnitList, Dimension, OldScale > > >, scale< Base, static_rational< 0 > >>

                                                                                        -

                                                                                        boost::units::make_scaled_unit<unit< Dimension, heterogeneous_system< heterogeneous_system_impl< UnitList, Dimension, OldScale > > >, scale< Base, static_rational< 0 > >>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/make_scaled_unit.hpp>
-
-template<typename Dimension, typename UnitList, typename OldScale, long Base> 
-struct make_scaled_unit<unit< Dimension, heterogeneous_system< heterogeneous_system_impl< UnitList, Dimension, OldScale > > >, scale< Base, static_rational< 0 > >> {
-  // types
-  typedef unit< Dimension, heterogeneous_system< heterogeneous_system_impl< UnitList, Dimension, OldScale > > > type;
-};
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/make_scaled_unit.html b/doc/html/boost/units/make_scaled_unit.html index cf3cab0418..a1b3a53e94 100644 --- a/doc/html/boost/units/make_scaled_unit.html +++ b/doc/html/boost/units/make_scaled_unit.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        @@ -49,7 +49,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        diff --git a/doc/html/boost/units/make_system.html b/doc/html/boost/units/make_system.html index 5b0825ed2a..5017c667ae 100644 --- a/doc/html/boost/units/make_system.html +++ b/doc/html/boost/units/make_system.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        @@ -39,7 +39,7 @@ typedef unspecified type; };
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        Metafunction returning a homogeneous system that can represent any combination of the base units. There must be no way to represent any of the base units in terms of the others. make_system<foot_base_unit, meter_base_unit>::type is not allowed, for example.

                                                                                        @@ -54,7 +54,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        diff --git a/doc/html/boost/units/mass_base_dimension.html b/doc/html/boost/units/mass_base_dimension.html index 756f4b4ed6..0e03f1244e 100644 --- a/doc/html/boost/units/mass_base_dimension.html +++ b/doc/html/boost/units/mass_base_dimension.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        @@ -49,7 +49,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        diff --git a/doc/html/boost/units/metric/are_base_unit.html b/doc/html/boost/units/metric/are_base_unit.html index 7effe3d2de..ef2ed65637 100644 --- a/doc/html/boost/units/metric/are_base_unit.html +++ b/doc/html/boost/units/metric/are_base_unit.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        @@ -36,18 +36,18 @@ struct are_base_unit : public boost::units::base_unit< are_base_unit, si::area::dimension_type, 10 > { - // public static functions - static const char * name(); - static const char * symbol(); + // public static functions + static const char * name(); + static const char * symbol(); };
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        -

                                                                                        -are_base_unit public static functions

                                                                                        +

                                                                                        +are_base_unit public static functions

                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        3. static const char * name();
                                                                                          4. +
                                                                                        4. static const char * symbol();
                                                                                        @@ -63,7 +63,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        diff --git a/doc/html/boost/units/metric/atmosphere_base_unit.html b/doc/html/boost/units/metric/atmosphere_base_unit.html index 6e8d599309..9234d77e52 100644 --- a/doc/html/boost/units/metric/atmosphere_base_unit.html +++ b/doc/html/boost/units/metric/atmosphere_base_unit.html @@ -36,18 +36,18 @@ struct atmosphere_base_unit : public boost::units::base_unit< atmosphere_base_unit, si::pressure::dimension_type, 33 > { - // public static functions - static const char * name(); - static const char * symbol(); + // public static functions + static const char * name(); + static const char * symbol(); };
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        -

                                                                                        -atmosphere_base_unit public static functions

                                                                                        +

                                                                                        +atmosphere_base_unit public static functions

                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        3. static const char * name();
                                                                                          4. +
                                                                                        4. static const char * symbol();
                                                                                        diff --git a/doc/html/boost/units/metric/bar_base_unit.html b/doc/html/boost/units/metric/bar_base_unit.html index f3474f9fff..8cd5194f9a 100644 --- a/doc/html/boost/units/metric/bar_base_unit.html +++ b/doc/html/boost/units/metric/bar_base_unit.html @@ -36,18 +36,18 @@ struct bar_base_unit : public boost::units::base_unit< bar_base_unit, si::pressure::dimension_type, 14 > { - // public static functions - static const char * name(); - static const char * symbol(); + // public static functions + static const char * name(); + static const char * symbol(); };
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        -

                                                                                        -bar_base_unit public static functions

                                                                                        +

                                                                                        +bar_base_unit public static functions

                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        3. static const char * name();
                                                                                          4. +
                                                                                        4. static const char * symbol();
                                                                                        diff --git a/doc/html/boost/units/metric/barn_base_unit.html b/doc/html/boost/units/metric/barn_base_unit.html index 366a2f4f7f..01629d652e 100644 --- a/doc/html/boost/units/metric/barn_base_unit.html +++ b/doc/html/boost/units/metric/barn_base_unit.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        @@ -36,18 +36,18 @@ struct barn_base_unit : public boost::units::base_unit< barn_base_unit, si::area::dimension_type, 11 > { - // public static functions - static const char * name(); - static const char * symbol(); + // public static functions + static const char * name(); + static const char * symbol(); };
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        -

                                                                                        -barn_base_unit public static functions

                                                                                        +

                                                                                        +barn_base_unit public static functions

                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        3. static const char * name();
                                                                                          4. +
                                                                                        4. static const char * symbol();
                                                                                        @@ -63,7 +63,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        diff --git a/doc/html/boost/units/metric/hectare_base_unit.html b/doc/html/boost/units/metric/hectare_base_unit.html index 6ffd3a84ba..ef9c2b3e59 100644 --- a/doc/html/boost/units/metric/hectare_base_unit.html +++ b/doc/html/boost/units/metric/hectare_base_unit.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        @@ -36,18 +36,18 @@ struct hectare_base_unit : public boost::units::base_unit< hectare_base_unit, si::area::dimension_type, 12 > { - // public static functions - static const char * name(); - static const char * symbol(); + // public static functions + static const char * name(); + static const char * symbol(); };
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        -

                                                                                        -hectare_base_unit public static functions

                                                                                        +

                                                                                        +hectare_base_unit public static functions

                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        3. static const char * name();
                                                                                          4. +
                                                                                        4. static const char * symbol();
                                                                                        @@ -63,7 +63,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        diff --git a/doc/html/boost/units/metric/knot_base_unit.html b/doc/html/boost/units/metric/knot_base_unit.html index 65fc1a577c..b97e51c891 100644 --- a/doc/html/boost/units/metric/knot_base_unit.html +++ b/doc/html/boost/units/metric/knot_base_unit.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        @@ -36,18 +36,18 @@ struct knot_base_unit : public boost::units::base_unit< knot_base_unit, boost::units::si::velocity::dimension_type,-403 > { - // public static functions - static const char * name(); - static const char * symbol(); + // public static functions + static const char * name(); + static const char * symbol(); };
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        -

                                                                                        -knot_base_unit public static functions

                                                                                        +

                                                                                        +knot_base_unit public static functions

                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        3. static const char * name();
                                                                                          4. +
                                                                                        4. static const char * symbol();
                                                                                        @@ -63,7 +63,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        diff --git a/doc/html/boost/units/metric/liter_base_unit.html b/doc/html/boost/units/metric/liter_base_unit.html index d5427f5d13..0842ce06f1 100644 --- a/doc/html/boost/units/metric/liter_base_unit.html +++ b/doc/html/boost/units/metric/liter_base_unit.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        @@ -36,18 +36,18 @@ struct liter_base_unit : public boost::units::base_unit< liter_base_unit, si::volume::dimension_type, 13 > { - // public static functions - static const char * name(); - static const char * symbol(); + // public static functions + static const char * name(); + static const char * symbol(); };
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        -

                                                                                        -liter_base_unit public static functions

                                                                                        +

                                                                                        +liter_base_unit public static functions

                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        3. static const char * name();
                                                                                          4. +
                                                                                        4. static const char * symbol();
                                                                                        @@ -63,7 +63,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        diff --git a/doc/html/boost/units/metric/mmHg_base_unit.html b/doc/html/boost/units/metric/mmHg_base_unit.html index 1af117da93..5ea2caade4 100644 --- a/doc/html/boost/units/metric/mmHg_base_unit.html +++ b/doc/html/boost/units/metric/mmHg_base_unit.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        @@ -36,18 +36,18 @@ struct mmHg_base_unit : public boost::units::base_unit< mmHg_base_unit, si::pressure::dimension_type,-404 > { - // public static functions - static const char * name(); - static const char * symbol(); + // public static functions + static const char * name(); + static const char * symbol(); };
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        -

                                                                                        -mmHg_base_unit public static functions

                                                                                        +

                                                                                        +mmHg_base_unit public static functions

                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        3. static const char * name();
                                                                                          4. +
                                                                                        4. static const char * symbol();
                                                                                        @@ -63,7 +63,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        diff --git a/doc/html/boost/units/metric/torr_base_unit.html b/doc/html/boost/units/metric/torr_base_unit.html index e400d57de1..776c3ecc4f 100644 --- a/doc/html/boost/units/metric/torr_base_unit.html +++ b/doc/html/boost/units/metric/torr_base_unit.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        @@ -36,18 +36,18 @@ struct torr_base_unit : public boost::units::base_unit< torr_base_unit, si::pressure::dimension_type,-401 > { - // public static functions - static const char * name(); - static const char * symbol(); + // public static functions + static const char * name(); + static const char * symbol(); };
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        -

                                                                                        -torr_base_unit public static functions

                                                                                        +

                                                                                        +torr_base_unit public static functions

                                                                                          -
                                                                                        1. static const char * name();
                                                                                          2. -
                                                                                        2. static const char * symbol();
                                                                                          3. +
                                                                                        3. static const char * name();
                                                                                          4. +
                                                                                        4. static const char * symbol();
                                                                                        @@ -63,7 +63,7 @@
                                                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                                                        diff --git a/doc/html/boost/units/multiply_idm45506851695616.html b/doc/html/boost/units/multiply_idm45506851695616.html new file mode 100644 index 0000000000..2b180464e1 --- /dev/null +++ b/doc/html/boost/units/multiply_idm45506851695616.html @@ -0,0 +1,55 @@ + + + + +Struct template multiply_typeof_helper<boost::units::unit< Dim, System >, boost::lambda::lambda_functor< Arg >> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct template multiply_typeof_helper<boost::units::unit< Dim, System >, boost::lambda::lambda_functor< Arg >>

                                                                                        +

                                                                                        boost::units::multiply_typeof_helper<boost::units::unit< Dim, System >, boost::lambda::lambda_functor< Arg >>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/lambda.hpp>
+
+template<typename System, typename Dim, typename Arg> 
+struct multiply_typeof_helper<boost::units::unit< Dim, System >, boost::lambda::lambda_functor< Arg >> {
+  // types
+  typedef boost::lambda::lambda_functor< boost::lambda::lambda_functor_base< boost::lambda::arithmetic_action< boost::lambda::multiply_action >, tuple< typename boost::lambda::const_copy_argument< const boost::units::unit< Dim, System > >::type, boost::lambda::lambda_functor< Arg > > > > type;
+};
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/multiply_idm45506851700992.html b/doc/html/boost/units/multiply_idm45506851700992.html new file mode 100644 index 0000000000..4a288cde17 --- /dev/null +++ b/doc/html/boost/units/multiply_idm45506851700992.html @@ -0,0 +1,55 @@ + + + + +Struct template multiply_typeof_helper<boost::units::absolute< boost::units::unit< Dim, System > >, boost::lambda::lambda_functor< Arg >> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct template multiply_typeof_helper<boost::units::absolute< boost::units::unit< Dim, System > >, boost::lambda::lambda_functor< Arg >>

                                                                                        +

                                                                                        boost::units::multiply_typeof_helper<boost::units::absolute< boost::units::unit< Dim, System > >, boost::lambda::lambda_functor< Arg >>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/lambda.hpp>
+
+template<typename System, typename Dim, typename Arg> 
+struct multiply_typeof_helper<boost::units::absolute< boost::units::unit< Dim, System > >, boost::lambda::lambda_functor< Arg >> {
+  // types
+  typedef boost::lambda::lambda_functor< boost::lambda::lambda_functor_base< boost::lambda::arithmetic_action< boost::lambda::multiply_action >, tuple< typename boost::lambda::const_copy_argument< const boost::units::absolute< boost::units::unit< Dim, System > > >::type, boost::lambda::lambda_functor< Arg > > > > type;
+};
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/multiply_idm45506851705888.html b/doc/html/boost/units/multiply_idm45506851705888.html new file mode 100644 index 0000000000..9d5899d9dd --- /dev/null +++ b/doc/html/boost/units/multiply_idm45506851705888.html @@ -0,0 +1,55 @@ + + + + +Struct template multiply_typeof_helper<boost::lambda::lambda_functor< Arg >, boost::units::unit< Dim, System >> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct template multiply_typeof_helper<boost::lambda::lambda_functor< Arg >, boost::units::unit< Dim, System >>

                                                                                        +

                                                                                        boost::units::multiply_typeof_helper<boost::lambda::lambda_functor< Arg >, boost::units::unit< Dim, System >>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/lambda.hpp>
+
+template<typename System, typename Dim, typename Arg> 
+struct multiply_typeof_helper<boost::lambda::lambda_functor< Arg >, boost::units::unit< Dim, System >> {
+  // types
+  typedef boost::lambda::lambda_functor< boost::lambda::lambda_functor_base< boost::lambda::arithmetic_action< boost::lambda::multiply_action >, tuple< boost::lambda::lambda_functor< Arg >, typename boost::lambda::const_copy_argument< const boost::units::unit< Dim, System > >::type > > > type;
+};
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/multiply_idm45506851711264.html b/doc/html/boost/units/multiply_idm45506851711264.html new file mode 100644 index 0000000000..47df7716e1 --- /dev/null +++ b/doc/html/boost/units/multiply_idm45506851711264.html @@ -0,0 +1,55 @@ + + + + +Struct template multiply_typeof_helper<boost::lambda::lambda_functor< Arg >, boost::units::absolute< boost::units::unit< Dim, System > >> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct template multiply_typeof_helper<boost::lambda::lambda_functor< Arg >, boost::units::absolute< boost::units::unit< Dim, System > >>

                                                                                        +

                                                                                        boost::units::multiply_typeof_helper<boost::lambda::lambda_functor< Arg >, boost::units::absolute< boost::units::unit< Dim, System > >>

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/lambda.hpp>
+
+template<typename System, typename Dim, typename Arg> 
+struct multiply_typeof_helper<boost::lambda::lambda_functor< Arg >, boost::units::absolute< boost::units::unit< Dim, System > >> {
+  // types
+  typedef boost::lambda::lambda_functor< boost::lambda::lambda_functor_base< boost::lambda::arithmetic_action< boost::lambda::multiply_action >, tuple< boost::lambda::lambda_functor< Arg >, typename boost::lambda::const_copy_argument< const boost::units::absolute< boost::units::unit< Dim, System > > >::type > > > type;
+};
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/multiply_type_idp347252992.html b/doc/html/boost/units/multiply_type_idp347252992.html deleted file mode 100644 index 7bd9407d5f..0000000000 --- a/doc/html/boost/units/multiply_type_idp347252992.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template multiply_typeof_helper<boost::lambda::lambda_functor< Arg >, boost::units::absolute< boost::units::unit< Dim, System > >> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct template multiply_typeof_helper<boost::lambda::lambda_functor< Arg >, boost::units::absolute< boost::units::unit< Dim, System > >>

                                                                                        -

                                                                                        boost::units::multiply_typeof_helper<boost::lambda::lambda_functor< Arg >, boost::units::absolute< boost::units::unit< Dim, System > >>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/lambda.hpp>
-
-template<typename System, typename Dim, typename Arg> 
-struct multiply_typeof_helper<boost::lambda::lambda_functor< Arg >, boost::units::absolute< boost::units::unit< Dim, System > >> {
-  // types
-  typedef boost::lambda::lambda_functor< boost::lambda::lambda_functor_base< boost::lambda::arithmetic_action< boost::lambda::multiply_action >, tuple< boost::lambda::lambda_functor< Arg >, typename boost::lambda::const_copy_argument< const boost::units::absolute< boost::units::unit< Dim, System > > >::type > > > type;
-};
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/multiply_type_idp347258368.html b/doc/html/boost/units/multiply_type_idp347258368.html deleted file mode 100644 index 615e2c9a13..0000000000 --- a/doc/html/boost/units/multiply_type_idp347258368.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template multiply_typeof_helper<boost::lambda::lambda_functor< Arg >, boost::units::unit< Dim, System >> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct template multiply_typeof_helper<boost::lambda::lambda_functor< Arg >, boost::units::unit< Dim, System >>

                                                                                        -

                                                                                        boost::units::multiply_typeof_helper<boost::lambda::lambda_functor< Arg >, boost::units::unit< Dim, System >>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/lambda.hpp>
-
-template<typename System, typename Dim, typename Arg> 
-struct multiply_typeof_helper<boost::lambda::lambda_functor< Arg >, boost::units::unit< Dim, System >> {
-  // types
-  typedef boost::lambda::lambda_functor< boost::lambda::lambda_functor_base< boost::lambda::arithmetic_action< boost::lambda::multiply_action >, tuple< boost::lambda::lambda_functor< Arg >, typename boost::lambda::const_copy_argument< const boost::units::unit< Dim, System > >::type > > > type;
-};
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/multiply_type_idp347263264.html b/doc/html/boost/units/multiply_type_idp347263264.html deleted file mode 100644 index f7de6d3505..0000000000 --- a/doc/html/boost/units/multiply_type_idp347263264.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template multiply_typeof_helper<boost::units::absolute< boost::units::unit< Dim, System > >, boost::lambda::lambda_functor< Arg >> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct template multiply_typeof_helper<boost::units::absolute< boost::units::unit< Dim, System > >, boost::lambda::lambda_functor< Arg >>

                                                                                        -

                                                                                        boost::units::multiply_typeof_helper<boost::units::absolute< boost::units::unit< Dim, System > >, boost::lambda::lambda_functor< Arg >>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/lambda.hpp>
-
-template<typename System, typename Dim, typename Arg> 
-struct multiply_typeof_helper<boost::units::absolute< boost::units::unit< Dim, System > >, boost::lambda::lambda_functor< Arg >> {
-  // types
-  typedef boost::lambda::lambda_functor< boost::lambda::lambda_functor_base< boost::lambda::arithmetic_action< boost::lambda::multiply_action >, tuple< typename boost::lambda::const_copy_argument< const boost::units::absolute< boost::units::unit< Dim, System > > >::type, boost::lambda::lambda_functor< Arg > > > > type;
-};
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/multiply_type_idp347268640.html b/doc/html/boost/units/multiply_type_idp347268640.html deleted file mode 100644 index 1bc049f823..0000000000 --- a/doc/html/boost/units/multiply_type_idp347268640.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template multiply_typeof_helper<boost::units::unit< Dim, System >, boost::lambda::lambda_functor< Arg >> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct template multiply_typeof_helper<boost::units::unit< Dim, System >, boost::lambda::lambda_functor< Arg >>

                                                                                        -

                                                                                        boost::units::multiply_typeof_helper<boost::units::unit< Dim, System >, boost::lambda::lambda_functor< Arg >>

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/lambda.hpp>
-
-template<typename System, typename Dim, typename Arg> 
-struct multiply_typeof_helper<boost::units::unit< Dim, System >, boost::lambda::lambda_functor< Arg >> {
-  // types
-  typedef boost::lambda::lambda_functor< boost::lambda::lambda_functor_base< boost::lambda::arithmetic_action< boost::lambda::multiply_action >, tuple< typename boost::lambda::const_copy_argument< const boost::units::unit< Dim, System > >::type, boost::lambda::lambda_functor< Arg > > > > type;
-};
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/multiply_typeof_helper.html b/doc/html/boost/units/multiply_typeof_helper.html index 6b8fd97902..34e3df6c57 100644 --- a/doc/html/boost/units/multiply_typeof_helper.html +++ b/doc/html/boost/units/multiply_typeof_helper.html @@ -35,15 +35,15 @@ template<typename X, typename Y> struct multiply_typeof_helper { - // public member functions - typedef typeof((typeof_::make< X >()*typeof_::make< Y >())); + // public member functions + typedef typeof((typeof_::make< X >()*typeof_::make< Y >())); };
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        -

                                                                                        -multiply_typeof_helper public member functions

                                                                                        -
                                                                                        1. typedef typeof((typeof_::make< X >()*typeof_::make< Y >()));
                                                                                        +

                                                                                        +multiply_typeof_helper public member functions

                                                                                        +
                                                                                        1. typedef typeof((typeof_::make< X >()*typeof_::make< Y >()));
                                                                                        diff --git a/doc/html/boost/units/operator/_idp347279936.html b/doc/html/boost/units/operator/_idp347279936.html deleted file mode 100644 index c7b7779ddf..0000000000 --- a/doc/html/boost/units/operator/_idp347279936.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Function template operator/ - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Function template operator/

                                                                                        -

                                                                                        boost::units::operator/

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/lambda.hpp>
-
-
-template<typename System, typename Dim, typename Arg> 
-  const divide_typeof_helper< boost::units::unit< Dim, System >, boost::lambda::lambda_functor< Arg > >::type 
-  operator/(const boost::units::unit< Dim, System > & a, 
-            const boost::lambda::lambda_functor< Arg > & b);
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -

                                                                                        Disambiguating overload for action unit<Dim, System> / lambda_functor<Arg> based on <boost/lambda/detail/operators.hpp>.

                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/operator/_idp347292208.html b/doc/html/boost/units/operator/_idp347292208.html deleted file mode 100644 index 615ed4f0ef..0000000000 --- a/doc/html/boost/units/operator/_idp347292208.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Function template operator/ - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Function template operator/

                                                                                        -

                                                                                        boost::units::operator/

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/lambda.hpp>
-
-
-template<typename System, typename Dim, typename Arg> 
-  const divide_typeof_helper< boost::lambda::lambda_functor< Arg >, boost::units::unit< Dim, System > >::type 
-  operator/(const boost::lambda::lambda_functor< Arg > & a, 
-            const boost::units::unit< Dim, System > & b);
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -

                                                                                        Disambiguating overload for action lambda_functor<Arg> / unit<Dim, System> based on <boost/lambda/detail/operators.hpp>.

                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/operator_idm45506851658880.html b/doc/html/boost/units/operator_idm45506851658880.html new file mode 100644 index 0000000000..7328db1b5d --- /dev/null +++ b/doc/html/boost/units/operator_idm45506851658880.html @@ -0,0 +1,59 @@ + + + + +Function template operator* + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Function template operator*

                                                                                        +

                                                                                        boost::units::operator*

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/lambda.hpp>
+
+
+template<typename System, typename Dim, typename Arg> 
+  const multiply_typeof_helper< boost::units::absolute< boost::units::unit< Dim, System > >, boost::lambda::lambda_functor< Arg > >::type 
+  operator*(const boost::units::absolute< boost::units::unit< Dim, System > > & a, 
+            const boost::lambda::lambda_functor< Arg > & b);
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +

                                                                                        Disambiguating overload for action absolute<unit<Dim, System> > * lambda_functor<Arg> based on <boost/lambda/detail/operators.hpp>.

                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/operator_idm45506851665920.html b/doc/html/boost/units/operator_idm45506851665920.html new file mode 100644 index 0000000000..a255dc48a3 --- /dev/null +++ b/doc/html/boost/units/operator_idm45506851665920.html @@ -0,0 +1,59 @@ + + + + +Function template operator* + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Function template operator*

                                                                                        +

                                                                                        boost::units::operator*

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/lambda.hpp>
+
+
+template<typename System, typename Dim, typename Arg> 
+  const multiply_typeof_helper< boost::lambda::lambda_functor< Arg >, boost::units::absolute< boost::units::unit< Dim, System > > >::type 
+  operator*(const boost::lambda::lambda_functor< Arg > & a, 
+            const boost::units::absolute< boost::units::unit< Dim, System > > & b);
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +

                                                                                        Disambiguating overload for action lambda_functor<Arg> * absolute<unit<Dim, System> > based on <boost/lambda/detail/operators.hpp>.

                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/operator_idm45506851672048.html b/doc/html/boost/units/operator_idm45506851672048.html new file mode 100644 index 0000000000..b72e453831 --- /dev/null +++ b/doc/html/boost/units/operator_idm45506851672048.html @@ -0,0 +1,59 @@ + + + + +Function template operator/ + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Function template operator/

                                                                                        +

                                                                                        boost::units::operator/

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/lambda.hpp>
+
+
+template<typename System, typename Dim, typename Arg> 
+  const divide_typeof_helper< boost::lambda::lambda_functor< Arg >, boost::units::unit< Dim, System > >::type 
+  operator/(const boost::lambda::lambda_functor< Arg > & a, 
+            const boost::units::unit< Dim, System > & b);
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +

                                                                                        Disambiguating overload for action lambda_functor<Arg> / unit<Dim, System> based on <boost/lambda/detail/operators.hpp>.

                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/operator_idm45506851678176.html b/doc/html/boost/units/operator_idm45506851678176.html new file mode 100644 index 0000000000..93855c7f50 --- /dev/null +++ b/doc/html/boost/units/operator_idm45506851678176.html @@ -0,0 +1,59 @@ + + + + +Function template operator* + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Function template operator*

                                                                                        +

                                                                                        boost::units::operator*

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/lambda.hpp>
+
+
+template<typename System, typename Dim, typename Arg> 
+  const multiply_typeof_helper< boost::lambda::lambda_functor< Arg >, boost::units::unit< Dim, System > >::type 
+  operator*(const boost::lambda::lambda_functor< Arg > & a, 
+            const boost::units::unit< Dim, System > & b);
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +

                                                                                        Disambiguating overload for action lambda_functor<Arg> * unit<Dim, System> based on <boost/lambda/detail/operators.hpp>.

                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/operator_idm45506851684320.html b/doc/html/boost/units/operator_idm45506851684320.html new file mode 100644 index 0000000000..be8a598164 --- /dev/null +++ b/doc/html/boost/units/operator_idm45506851684320.html @@ -0,0 +1,59 @@ + + + + +Function template operator/ + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Function template operator/

                                                                                        +

                                                                                        boost::units::operator/

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/lambda.hpp>
+
+
+template<typename System, typename Dim, typename Arg> 
+  const divide_typeof_helper< boost::units::unit< Dim, System >, boost::lambda::lambda_functor< Arg > >::type 
+  operator/(const boost::units::unit< Dim, System > & a, 
+            const boost::lambda::lambda_functor< Arg > & b);
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +

                                                                                        Disambiguating overload for action unit<Dim, System> / lambda_functor<Arg> based on <boost/lambda/detail/operators.hpp>.

                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/operator_idm45506851690464.html b/doc/html/boost/units/operator_idm45506851690464.html new file mode 100644 index 0000000000..466f46fc47 --- /dev/null +++ b/doc/html/boost/units/operator_idm45506851690464.html @@ -0,0 +1,59 @@ + + + + +Function template operator* + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Function template operator*

                                                                                        +

                                                                                        boost::units::operator*

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/lambda.hpp>
+
+
+template<typename System, typename Dim, typename Arg> 
+  const multiply_typeof_helper< boost::units::unit< Dim, System >, boost::lambda::lambda_functor< Arg > >::type 
+  operator*(const boost::units::unit< Dim, System > & a, 
+            const boost::lambda::lambda_functor< Arg > & b);
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +

                                                                                        Disambiguating overload for action unit<Dim, System> * lambda_functor<Arg> based on <boost/lambda/detail/operators.hpp>.

                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/operator_idm45506852030768.html b/doc/html/boost/units/operator_idm45506852030768.html new file mode 100644 index 0000000000..a30d203eac --- /dev/null +++ b/doc/html/boost/units/operator_idm45506852030768.html @@ -0,0 +1,59 @@ + + + + +Function template operator<< + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Function template operator<<

                                                                                        +

                                                                                        boost::units::operator<< — Print a quantity.

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/io.hpp>
+
+
+template<typename Char, typename Traits, typename Unit, typename T> 
+  std::basic_ostream< Char, Traits > & 
+  operator<<(std::basic_ostream< Char, Traits > & os, 
+             const quantity< Unit, T > & q);
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +

                                                                                        Prints the value followed by the unit. If the engineering_prefix, or binary_prefix is set, tries to scale the value appropriately. For example, it might print 12.345 km instead of 12345 m. (Note does not attempt to automatically scale scalars like double, float...)

                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/operator_idm45506852037168.html b/doc/html/boost/units/operator_idm45506852037168.html new file mode 100644 index 0000000000..85278bb566 --- /dev/null +++ b/doc/html/boost/units/operator_idm45506852037168.html @@ -0,0 +1,62 @@ + + + + +Function template operator<< + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Function template operator<<

                                                                                        +

                                                                                        boost::units::operator<<

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/io.hpp>
+
+
+template<typename Char, typename Traits, typename Dimension, typename System> 
+  std::basic_ostream< Char, Traits > & 
+  operator<<(std::basic_ostream< Char, Traits > & os, 
+             const unit< Dimension, System > & u);
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +

                                                                                        Print a unit as a list of base units and their exponents. for @c symbol_format outputs e.g. "m s^-1" or "J". +for @c name_format outputs e.g. "meter second^-1" or "joule". +for @c raw_format outputs e.g. "m s^-1" or "meter kilogram^2 second^-2". +for @c typename_format outputs the typename itself (currently demangled only on GCC).

                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/operator_idp346927088.html b/doc/html/boost/units/operator_idp346927088.html deleted file mode 100644 index 843e96b67b..0000000000 --- a/doc/html/boost/units/operator_idp346927088.html +++ /dev/null @@ -1,62 +0,0 @@ - - - - -Function template operator<< - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Function template operator<<

                                                                                        -

                                                                                        boost::units::operator<<

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/io.hpp>
-
-
-template<typename Char, typename Traits, typename Dimension, typename System> 
-  std::basic_ostream< Char, Traits > & 
-  operator<<(std::basic_ostream< Char, Traits > & os, 
-             const unit< Dimension, System > & u);
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -

                                                                                        Print a unit as a list of base units and their exponents. for @c symbol_format outputs e.g. "m s^-1" or "J". -for @c name_format outputs e.g. "meter second^-1" or "joule". -for @c raw_format outputs e.g. "m s^-1" or "meter kilogram^2 second^-2". -for @c typename_format outputs the typename itself (currently demangled only on GCC).

                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/operator_idp346933488.html b/doc/html/boost/units/operator_idp346933488.html deleted file mode 100644 index 9915d27b80..0000000000 --- a/doc/html/boost/units/operator_idp346933488.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Function template operator<< - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Function template operator<<

                                                                                        -

                                                                                        boost::units::operator<< — Print a quantity.

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/io.hpp>
-
-
-template<typename Char, typename Traits, typename Unit, typename T> 
-  std::basic_ostream< Char, Traits > & 
-  operator<<(std::basic_ostream< Char, Traits > & os, 
-             const quantity< Unit, T > & q);
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -

                                                                                        Prints the value followed by the unit. If the engineering_prefix, or binary_prefix is set, tries to scale the value appropriately. For example, it might print 12.345 km instead of 12345 m. (Note does not attempt to automatically scale scalars like double, float...)

                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/operator_idp347273792.html b/doc/html/boost/units/operator_idp347273792.html deleted file mode 100644 index ef505638e6..0000000000 --- a/doc/html/boost/units/operator_idp347273792.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Function template operator* - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Function template operator*

                                                                                        -

                                                                                        boost::units::operator*

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/lambda.hpp>
-
-
-template<typename System, typename Dim, typename Arg> 
-  const multiply_typeof_helper< boost::units::unit< Dim, System >, boost::lambda::lambda_functor< Arg > >::type 
-  operator*(const boost::units::unit< Dim, System > & a, 
-            const boost::lambda::lambda_functor< Arg > & b);
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -

                                                                                        Disambiguating overload for action unit<Dim, System> * lambda_functor<Arg> based on <boost/lambda/detail/operators.hpp>.

                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/operator_idp347286080.html b/doc/html/boost/units/operator_idp347286080.html deleted file mode 100644 index 67fe4aebf7..0000000000 --- a/doc/html/boost/units/operator_idp347286080.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Function template operator* - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Function template operator*

                                                                                        -

                                                                                        boost::units::operator*

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/lambda.hpp>
-
-
-template<typename System, typename Dim, typename Arg> 
-  const multiply_typeof_helper< boost::lambda::lambda_functor< Arg >, boost::units::unit< Dim, System > >::type 
-  operator*(const boost::lambda::lambda_functor< Arg > & a, 
-            const boost::units::unit< Dim, System > & b);
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -

                                                                                        Disambiguating overload for action lambda_functor<Arg> * unit<Dim, System> based on <boost/lambda/detail/operators.hpp>.

                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/operator_idp347298336.html b/doc/html/boost/units/operator_idp347298336.html deleted file mode 100644 index ebfd916781..0000000000 --- a/doc/html/boost/units/operator_idp347298336.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Function template operator* - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Function template operator*

                                                                                        -

                                                                                        boost::units::operator*

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/lambda.hpp>
-
-
-template<typename System, typename Dim, typename Arg> 
-  const multiply_typeof_helper< boost::lambda::lambda_functor< Arg >, boost::units::absolute< boost::units::unit< Dim, System > > >::type 
-  operator*(const boost::lambda::lambda_functor< Arg > & a, 
-            const boost::units::absolute< boost::units::unit< Dim, System > > & b);
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -

                                                                                        Disambiguating overload for action lambda_functor<Arg> * absolute<unit<Dim, System> > based on <boost/lambda/detail/operators.hpp>.

                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/operator_idp347305376.html b/doc/html/boost/units/operator_idp347305376.html deleted file mode 100644 index 7b642a50f5..0000000000 --- a/doc/html/boost/units/operator_idp347305376.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Function template operator* - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Function template operator*

                                                                                        -

                                                                                        boost::units::operator*

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/lambda.hpp>
-
-
-template<typename System, typename Dim, typename Arg> 
-  const multiply_typeof_helper< boost::units::absolute< boost::units::unit< Dim, System > >, boost::lambda::lambda_functor< Arg > >::type 
-  operator*(const boost::units::absolute< boost::units::unit< Dim, System > > & a, 
-            const boost::lambda::lambda_functor< Arg > & b);
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -

                                                                                        Disambiguating overload for action absolute<unit<Dim, System> > * lambda_functor<Arg> based on <boost/lambda/detail/operators.hpp>.

                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/pow_idm45506852379376.html b/doc/html/boost/units/pow_idm45506852379376.html new file mode 100644 index 0000000000..19b89e1045 --- /dev/null +++ b/doc/html/boost/units/pow_idm45506852379376.html @@ -0,0 +1,59 @@ + + + + +Function template pow + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Function template pow

                                                                                        +

                                                                                        boost::units::pow

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/cmath.hpp>
+
+
+template<typename S, typename Y> 
+  quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(S), Y > 
+  pow(const quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(S), Y > & q1, 
+      const quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(S), Y > & q2);
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +

                                                                                        For non-dimensionless quantities, integral and rational powers and roots can be computed by pow<Ex> and root<Rt> respectively.

                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/pow_idp346584880.html b/doc/html/boost/units/pow_idp346584880.html deleted file mode 100644 index 51b5b3eb04..0000000000 --- a/doc/html/boost/units/pow_idp346584880.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Function template pow - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Function template pow

                                                                                        -

                                                                                        boost::units::pow

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/cmath.hpp>
-
-
-template<typename S, typename Y> 
-  quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(S), Y > 
-  pow(const quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(S), Y > & q1, 
-      const quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(S), Y > & q2);
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -

                                                                                        For non-dimensionless quantities, integral and rational powers and roots can be computed by pow<Ex> and root<Rt> respectively.

                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/power_ty_idm45506851137248.html b/doc/html/boost/units/power_ty_idm45506851137248.html new file mode 100644 index 0000000000..ce37bd48c9 --- /dev/null +++ b/doc/html/boost/units/power_ty_idm45506851137248.html @@ -0,0 +1,66 @@ + + + + +Struct template power_typeof_helper<unit< Dim, System >, static_rational< N, D >> + + + + + + + + + + + + + + + +
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +

                                                                                        Struct template power_typeof_helper<unit< Dim, System >, static_rational< N, D >>

                                                                                        +

                                                                                        boost::units::power_typeof_helper<unit< Dim, System >, static_rational< N, D >> — raise unit to a static_rational power

                                                                                        +
                                                                                        +

                                                                                        Synopsis

                                                                                        +
                                                                                        // In header: <boost/units/unit.hpp>
+
+template<typename Dim, typename System, long N, long D> 
+struct power_typeof_helper<unit< Dim, System >, static_rational< N, D >> {
+  // types
+  typedef unit< typename static_power< Dim, static_rational< N, D > >::type, typename static_power< System, static_rational< N, D > >::type > type;
+
+  // public static functions
+  static type value(const unit< Dim, System > &);
+};
                                                                                        +
                                                                                        +

                                                                                        Description

                                                                                        +
                                                                                        +

                                                                                        +power_typeof_helper public static functions

                                                                                        +
                                                                                        1. static type value(const unit< Dim, System > &);
                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        + + + +
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven + Watanabe

                                                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                        +
                                                                                        +
                                                                                        +
                                                                                        +PrevUpHomeNext +
                                                                                        + + diff --git a/doc/html/boost/units/power_typeof__idp347827008.html b/doc/html/boost/units/power_typeof__idp347827008.html deleted file mode 100644 index 52d8d5597b..0000000000 --- a/doc/html/boost/units/power_typeof__idp347827008.html +++ /dev/null @@ -1,66 +0,0 @@ - - - - -Struct template power_typeof_helper<unit< Dim, System >, static_rational< N, D >> - - - - - - - - - - - - - - - -
                                                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -

                                                                                        Struct template power_typeof_helper<unit< Dim, System >, static_rational< N, D >>

                                                                                        -

                                                                                        boost::units::power_typeof_helper<unit< Dim, System >, static_rational< N, D >> — raise unit to a static_rational power

                                                                                        -
                                                                                        -

                                                                                        Synopsis

                                                                                        -
                                                                                        // In header: <boost/units/unit.hpp>
-
-template<typename Dim, typename System, long N, long D> 
-struct power_typeof_helper<unit< Dim, System >, static_rational< N, D >> {
-  // types
-  typedef unit< typename static_power< Dim, static_rational< N, D > >::type, typename static_power< System, static_rational< N, D > >::type > type;
-
-  // public static functions
-  static type value(const unit< Dim, System > &);
-};
                                                                                        -
                                                                                        -

                                                                                        Description

                                                                                        -
                                                                                        -

                                                                                        -power_typeof_helper public static functions

                                                                                        -
                                                                                        1. static type value(const unit< Dim, System > &);
                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        - - - -
                                                                                        Copyright © 2003-2008 Matthias Christian Schabel
                                                                                        Copyright © 2007-2010 Steven - Watanabe

                                                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                        -
                                                                                        -
                                                                                        -
                                                                                        -PrevUpHomeNext -
                                                                                        - - diff --git a/doc/html/boost/units/power_typeof_helper.html b/doc/html/boost/units/power_typeof_helper.html index 1e3562f7f4..7a73c4d485 100644 --- a/doc/html/boost/units/power_typeof_helper.html +++ b/doc/html/boost/units/power_typeof_helper.html @@ -37,17 +37,17 @@ // types typedef unspecified type; // specifies the result type - // public static functions - static type value(const BaseType &); + // public static functions + static type value(const BaseType &); };
                                                                                        -

                                                                                        Description

                                                                                        +

                                                                                        Description

                                                                                        A helper used by pow to raise a runtime object to a compile time known exponent. This template is intended to be specialized. All specializations must conform to the interface shown here. Exponent will be either the exponent passed to pow or static_rational<N> for and integer argument, N.

                                                                                        -

                                                                                        -power_typeof_helper public static functions

                                                                                        +

                                                                                        +power_typeof_helper public static functions

                                                                                        1. -
                                                                                          static type value(const BaseType & base);
                                                                                          Carries out the runtime calculation.
                                                                                        +
                                                                                        static type value(const BaseType & base);
                                                                                        Carries out the runtime calculation.
                                                                                      diff --git a/doc/html/boost/units/quantity.html b/doc/html/boost/units/quantity.html index 7620225c04..5f911c142b 100644 --- a/doc/html/boost/units/quantity.html +++ b/doc/html/boost/units/quantity.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
                                                                                      -PrevUpHomeNext +PrevUpHomeNext
                                                                                      @@ -41,111 +41,111 @@ typedef Unit unit_type; // construct/copy/destruct - quantity(); - quantity(unspecified_null_pointer_constant_type); - quantity(const this_type &); + quantity(); + quantity(unspecified_null_pointer_constant_type); + quantity(const this_type &); template<typename YY> - quantity(const quantity< Unit, YY > &, unspecified = 0); + quantity(const quantity< Unit, YY > &, unspecified = 0); template<typename YY> - explicit quantity(const quantity< Unit, YY > &, unspecified = 0); + explicit quantity(const quantity< Unit, YY > &, unspecified = 0); template<typename Unit2, typename YY> - explicit quantity(const quantity< Unit2, YY > &, unspecified = 0); + explicit quantity(const quantity< Unit2, YY > &, unspecified = 0); template<typename Unit2, typename YY> - quantity(const quantity< Unit2, YY > &, unspecified = 0); - explicit quantity(const value_type &, int); - this_type & operator=(const this_type &); - template<typename YY> this_type & operator=(const quantity< Unit, YY > &); + quantity(const quantity< Unit2, YY > &, unspecified = 0); + explicit quantity(const value_type &, int); + this_type & operator=(const this_type &); + template<typename YY> this_type & operator=(const quantity< Unit, YY > &); template<typename Unit2, typename YY> - this_type & operator=(const quantity< Unit2, YY > &); + this_type & operator=(const quantity< Unit2, YY > &); - // private member functions - BOOST_MPL_ASSERT_NOT(unspecified); + // private member functions + BOOST_MPL_ASSERT_NOT(unspecified); - // public member functions - const value_type & value() const; + // public member functions + const value_type & value() const; template<typename Unit2, typename YY> - this_type & operator+=(const quantity< Unit2, YY > &); + this_type & operator+=(const quantity< Unit2, YY > &); template<typename Unit2, typename YY> - this_type & operator-=(const quantity< Unit2, YY > &); + this_type & operator-=(const quantity< Unit2, YY > &); template<typename Unit2, typename YY> - this_type & operator*=(const quantity< Unit2, YY > &); + this_type & operator*=(const quantity< Unit2, YY > &); template<typename Unit2, typename YY> - this_type & operator/=(const quantity< Unit2, YY > &); - this_type & operator*=(const value_type &); - this_type & operator/=(const value_type &); + this_type & operator/=(const quantity< Unit2, YY > &); + this_type & operator*=(const value_type &); + this_type & operator/=(const value_type &); - // public static functions - static this_type from_value(const value_type &); + // public static functions + static this_type from_value(const value_type &); };
                                                                                      -

                                                                                      Description

                                                                                      +

                                                                                      Description

                                                                                      -

                                                                                      +

                                                                                      quantity public construct/copy/destruct

                                                                                        -
                                                                                      1. quantity();
                                                                                        2. -
                                                                                      2. quantity(unspecified_null_pointer_constant_type);
                                                                                        3. -
                                                                                      3. quantity(const this_type & source);
                                                                                        4. +
                                                                                      4. quantity();
                                                                                        5. +
                                                                                      5. quantity(unspecified_null_pointer_constant_type);
                                                                                        6. +
                                                                                      6. quantity(const this_type & source);
                                                                                      7. template<typename YY> 
-  quantity(const quantity< Unit, YY > & source, unspecified = 0);
                                                                                        implicit conversion between value types is allowed if allowed for value types themselves
                                                                                        8. + quantity(const quantity< Unit, YY > & source, unspecified = 0);implicit conversion between value types is allowed if allowed for value types themselves 
                                                                                      8. template<typename YY> 
-  explicit quantity(const quantity< Unit, YY > & source, unspecified = 0);
                                                                                        implicit conversion between value types is not allowed if not allowed for value types themselves
                                                                                        9. + explicit quantity(const quantity< Unit, YY > & source, unspecified = 0);implicit conversion between value types is not allowed if not allowed for value types themselves 
                                                                                      9. template<typename Unit2, typename YY> 
-  explicit quantity(const quantity< Unit2, YY > & source, unspecified = 0);
                                                                                        explicit conversion between different unit systems is allowed if implicit conversion is disallowed
                                                                                        10. + explicit quantity(const quantity< Unit2, YY > & source, unspecified = 0);explicit conversion between different unit systems is allowed if implicit conversion is disallowed 
                                                                                      10. template<typename Unit2, typename YY> 
-  quantity(const quantity< Unit2, YY > & source, unspecified = 0);
                                                                                        implicit conversion between different unit systems is allowed if each fundamental dimension is implicitly convertible
                                                                                        11. -
                                                                                      11. explicit quantity(const value_type & val, int);
                                                                                        12. -
                                                                                      12. this_type & operator=(const this_type & source);
                                                                                        13. + quantity(const quantity< Unit2, YY > & source, unspecified = 0);implicit conversion between different unit systems is allowed if each fundamental dimension is implicitly convertible +
                                                                                      13. explicit quantity(const value_type & val, int);
                                                                                        14. +
                                                                                      14. this_type & operator=(const this_type & source);
                                                                                      15. template<typename YY> 
-  this_type & operator=(const quantity< Unit, YY > & source);
                                                                                        implicit assignment between value types is allowed if allowed for value types themselves
                                                                                        16. + this_type & operator=(const quantity< Unit, YY > & source);implicit assignment between value types is allowed if allowed for value types themselves 
                                                                                      16. template<typename Unit2, typename YY> 
-  this_type & operator=(const quantity< Unit2, YY > & source);
                                                                                        implicit assignment between different unit systems is allowed if each fundamental dimension is implicitly convertible
                                                                                        17. + this_type & operator=(const quantity< Unit2, YY > & source);implicit assignment between different unit systems is allowed if each fundamental dimension is implicitly convertible
                                                                                      -

                                                                                      -quantity private member functions

                                                                                      -
                                                                                      1.  BOOST_MPL_ASSERT_NOT(unspecified);
                                                                                      +

                                                                                      +quantity private member functions

                                                                                      +
                                                                                      1.  BOOST_MPL_ASSERT_NOT(unspecified);
                                                                                      -

                                                                                      -quantity public member functions

                                                                                      +

                                                                                      +quantity public member functions

                                                                                      1. -
                                                                                        const value_type & value() const;
                                                                                        constant accessor to value

                                                                                        can add a quantity of the same type if add_typeof_helper<value_type,value_type>::type is convertible to value_type

                                                                                        +
                                                                                        const value_type & value() const;
                                                                                        constant accessor to value

                                                                                        can add a quantity of the same type if add_typeof_helper<value_type,value_type>::type is convertible to value_type 

                                                                                      2. template<typename Unit2, typename YY> 
-  this_type & operator+=(const quantity< Unit2, YY > & source);
                                                                                        can subtract a quantity of the same type if subtract_typeof_helper<value_type,value_type>::type is convertible to value_type
                                                                                        3. + this_type & operator+=(const quantity< Unit2, YY > & source);can subtract a quantity of the same type if subtract_typeof_helper<value_type,value_type>::type is convertible to value_type 
                                                                                      3. template<typename Unit2, typename YY> 
-  this_type & operator-=(const quantity< Unit2, YY > & source);
                                                                                        4. + this_type & operator-=(const quantity< Unit2, YY > & source); 
                                                                                      4. template<typename Unit2, typename YY> 
-  this_type & operator*=(const quantity< Unit2, YY > & source);
                                                                                        5. + this_type & operator*=(const quantity< Unit2, YY > & source); 
                                                                                      5. template<typename Unit2, typename YY> 
-  this_type & operator/=(const quantity< Unit2, YY > & source);
                                                                                        can multiply a quantity by a scalar value_type if multiply_typeof_helper<value_type,value_type>::type is convertible to value_type
                                                                                        6. + this_type & operator/=(const quantity< Unit2, YY > & source);can multiply a quantity by a scalar value_type if multiply_typeof_helper<value_type,value_type>::type is convertible to value_type
                                                                                      6. -
                                                                                        this_type & operator*=(const value_type & source);
                                                                                        can divide a quantity by a scalar value_type if divide_typeof_helper<value_type,value_type>::type is convertible to value_type
                                                                                        7. -
                                                                                      7. this_type & operator/=(const value_type & source);
                                                                                        8. +
                                                                                        this_type & operator*=(const value_type & source);
                                                                                        can divide a quantity by a scalar value_type if divide_typeof_helper<value_type,value_type>::type is convertible to value_type +
                                                                                      8. this_type & operator/=(const value_type & source);
                                                                                      -

                                                                                      -quantity public static functions

                                                                                      +

                                                                                      +quantity public static functions

                                                                                      1. -
                                                                                        static this_type from_value(const value_type & val);
                                                                                        Construct quantity directly from value_type (potentially dangerous).
                                                                                      +
                                                                                      static this_type from_value(const value_type & val);
                                                                                      Construct quantity directly from value_type (potentially dangerous).
                                                                                    -

                                                                                    Specializations

                                                                                    -
                                                                                    +

                                                                                    Specializations

                                                                                    +
                                                                                    @@ -160,7 +160,7 @@
                                                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                                                    diff --git a/doc/html/boost/units/quantity_BOOS_idp347523824.html b/doc/html/boost/units/quantity_BOOS_idp347523824.html deleted file mode 100644 index 6b17aea994..0000000000 --- a/doc/html/boost/units/quantity_BOOS_idp347523824.html +++ /dev/null @@ -1,165 +0,0 @@ - - - - -Class template quantity<BOOST_UNITS_DIMENSIONLESS_UNIT(System), Y> - - - - - - - - - - - - - - - -
                                                                                    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                    -
                                                                                    -
                                                                                    -PrevUpHomeNext -
                                                                                    -
                                                                                    -
                                                                                    -
                                                                                    -

                                                                                    Class template quantity<BOOST_UNITS_DIMENSIONLESS_UNIT(System), Y>

                                                                                    -

                                                                                    boost::units::quantity<BOOST_UNITS_DIMENSIONLESS_UNIT(System), Y>

                                                                                    -
                                                                                    -

                                                                                    Synopsis

                                                                                    -
                                                                                    // In header: <boost/units/quantity.hpp>
-
-template<typename System, typename Y> 
-class quantity<BOOST_UNITS_DIMENSIONLESS_UNIT(System), Y> {
-public:
-  // types
-  typedef quantity< unit< dimensionless_type, System >, Y > this_type;     
-  typedef Y                                                 value_type;    
-  typedef System                                            system_type;   
-  typedef dimensionless_type                                dimension_type;
-  typedef unit< dimension_type, system_type >               unit_type;     
-
-  // construct/copy/destruct
-  quantity();
-  quantity(value_type);
-  quantity(const this_type &);
-  template<typename YY> 
-    quantity(const quantity< unit< dimension_type, system_type >, YY > &, 
-             unspecified = 0);
-  template<typename YY> 
-    explicit quantity(const quantity< unit< dimension_type, system_type >, YY > &, 
-                      unspecified = 0);
-  template<typename System2, typename Y2> 
-    quantity(const quantity< unit< dimensionless_type, System2 >, Y2 > &, 
-             unspecified = 0, unspecified = 0, unspecified = 0);
-  template<typename System2, typename Y2> 
-    explicit quantity(const quantity< unit< dimensionless_type, System2 >, Y2 > &, 
-                      unspecified = 0, unspecified = 0, unspecified = 0);
-  template<typename System2, typename Y2> 
-    explicit quantity(const quantity< unit< dimensionless_type, System2 >, Y2 > &, 
-                      unspecified = 0);
-  this_type & operator=(const this_type &);
-  template<typename YY> 
-    this_type & operator=(const quantity< unit< dimension_type, system_type >, YY > &);
-  template<typename System2> 
-    this_type & operator=(const quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(System2), Y > &);
-
-  // public member functions
-  operator value_type() const;
-  const value_type & value() const;
-  this_type & operator+=(const this_type &);
-  this_type & operator-=(const this_type &);
-  this_type & operator*=(const value_type &);
-  this_type & operator/=(const value_type &);
-
-  // public static functions
-  static this_type from_value(const value_type &);
-};
                                                                                    -
                                                                                    -

                                                                                    Description

                                                                                    -

                                                                                    Specialization for dimensionless quantities. Implicit conversions between unit systems are allowed because all dimensionless quantities are equivalent. Implicit construction and assignment from and conversion to value_type is also allowed.

                                                                                    -
                                                                                    -

                                                                                    -quantity - public - construct/copy/destruct

                                                                                    -
                                                                                      -
                                                                                    1. quantity();
                                                                                      2. -
                                                                                    2. -
                                                                                      quantity(value_type val);
                                                                                      construction from raw value_type is allowed
                                                                                      3. -
                                                                                    3. quantity(const this_type & source);
                                                                                      4. -
                                                                                    4. -
                                                                                      template<typename YY> 
-  quantity(const quantity< unit< dimension_type, system_type >, YY > & source, 
-           unspecified = 0);
                                                                                      implicit conversion between value types is allowed if allowed for value types themselves
                                                                                      5. -
                                                                                    5. -
                                                                                      template<typename YY> 
-  explicit quantity(const quantity< unit< dimension_type, system_type >, YY > & source, 
-                    unspecified = 0);
                                                                                      implicit conversion between value types is not allowed if not allowed for value types themselves
                                                                                      6. -
                                                                                    6. -
                                                                                      template<typename System2, typename Y2> 
-  quantity(const quantity< unit< dimensionless_type, System2 >, Y2 > & source, 
-           unspecified = 0, unspecified = 0, unspecified = 0);
                                                                                      implicit conversion between different unit systems is allowed
                                                                                      7. -
                                                                                    7. -
                                                                                      template<typename System2, typename Y2> 
-  explicit quantity(const quantity< unit< dimensionless_type, System2 >, Y2 > & source, 
-                    unspecified = 0, unspecified = 0, unspecified = 0);
                                                                                      implicit conversion between different unit systems is allowed
                                                                                      8. -
                                                                                    8. -
                                                                                      template<typename System2, typename Y2> 
-  explicit quantity(const quantity< unit< dimensionless_type, System2 >, Y2 > & source, 
-                    unspecified = 0);
                                                                                      -

                                                                                      conversion between different unit systems is explicit when the units are not equivalent.

                                                                                      -
                                                                                      9. -
                                                                                    9. this_type & operator=(const this_type & source);
                                                                                      10. -
                                                                                    10. -
                                                                                      template<typename YY> 
-  this_type & operator=(const quantity< unit< dimension_type, system_type >, YY > & source);
                                                                                      implicit assignment between value types is allowed if allowed for value types themselves
                                                                                      11. -
                                                                                    11. -
                                                                                      template<typename System2> 
-  this_type & operator=(const quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(System2), Y > & source);
                                                                                      implicit assignment between different unit systems is allowed
                                                                                      12. -
                                                                                    -
                                                                                    -
                                                                                    -

                                                                                    -quantity public member functions

                                                                                    -
                                                                                      -
                                                                                    1. -
                                                                                      operator value_type() const;
                                                                                      implicit conversion to value_type is allowed
                                                                                      2. -
                                                                                    2. -
                                                                                      const value_type & value() const;
                                                                                      constant accessor to value

                                                                                      can add a quantity of the same type if add_typeof_helper<value_type,value_type>::type is convertible to value_type

                                                                                      -
                                                                                      3. -
                                                                                    3. -
                                                                                      this_type & operator+=(const this_type & source);
                                                                                      can subtract a quantity of the same type if subtract_typeof_helper<value_type,value_type>::type is convertible to value_type
                                                                                      4. -
                                                                                    4. -
                                                                                      this_type & operator-=(const this_type & source);
                                                                                      can multiply a quantity by a scalar value_type if multiply_typeof_helper<value_type,value_type>::type is convertible to value_type
                                                                                      5. -
                                                                                    5. -
                                                                                      this_type & operator*=(const value_type & val);
                                                                                      can divide a quantity by a scalar value_type if divide_typeof_helper<value_type,value_type>::type is convertible to value_type
                                                                                      6. -
                                                                                    6. this_type & operator/=(const value_type & val);
                                                                                      7. -
                                                                                    -
                                                                                    -
                                                                                    -

                                                                                    -quantity public static functions

                                                                                    -
                                                                                    1. -
                                                                                      static this_type from_value(const value_type & val);
                                                                                      Construct quantity directly from value_type.
                                                                                    -
                                                                                    -
                                                                                    -
                                                                                    - - - -
                                                                                    Copyright © 2003-2008 Matthias Christian Schabel
                                                                                    Copyright © 2007-2010 Steven - Watanabe

                                                                                    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                    -
                                                                                    -
                                                                                    -
                                                                                    -PrevUpHomeNext -
                                                                                    - - diff --git a/doc/html/boost/units/quantity_idm45506851440432.html b/doc/html/boost/units/quantity_idm45506851440432.html new file mode 100644 index 0000000000..775c207ed6 --- /dev/null +++ b/doc/html/boost/units/quantity_idm45506851440432.html @@ -0,0 +1,165 @@ + + + + +Class template quantity<BOOST_UNITS_DIMENSIONLESS_UNIT(System), Y> + + + + + + + + + + + + + + + +
                                                                                    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                    +
                                                                                    +
                                                                                    +PrevUpHomeNext +
                                                                                    +
                                                                                    +
                                                                                    +
                                                                                    +

                                                                                    Class template quantity<BOOST_UNITS_DIMENSIONLESS_UNIT(System), Y>

                                                                                    +

                                                                                    boost::units::quantity<BOOST_UNITS_DIMENSIONLESS_UNIT(System), Y>

                                                                                    +
                                                                                    +

                                                                                    Synopsis

                                                                                    +
                                                                                    // In header: <boost/units/quantity.hpp>
+
+template<typename System, typename Y> 
+class quantity<BOOST_UNITS_DIMENSIONLESS_UNIT(System), Y> {
+public:
+  // types
+  typedef quantity< unit< dimensionless_type, System >, Y > this_type;     
+  typedef Y                                                 value_type;    
+  typedef System                                            system_type;   
+  typedef dimensionless_type                                dimension_type;
+  typedef unit< dimension_type, system_type >               unit_type;     
+
+  // construct/copy/destruct
+  quantity();
+  quantity(value_type);
+  quantity(const this_type &);
+  template<typename YY> 
+    quantity(const quantity< unit< dimension_type, system_type >, YY > &, 
+             unspecified = 0);
+  template<typename YY> 
+    explicit quantity(const quantity< unit< dimension_type, system_type >, YY > &, 
+                      unspecified = 0);
+  template<typename System2, typename Y2> 
+    quantity(const quantity< unit< dimensionless_type, System2 >, Y2 > &, 
+             unspecified = 0, unspecified = 0, unspecified = 0);
+  template<typename System2, typename Y2> 
+    explicit quantity(const quantity< unit< dimensionless_type, System2 >, Y2 > &, 
+                      unspecified = 0, unspecified = 0, unspecified = 0);
+  template<typename System2, typename Y2> 
+    explicit quantity(const quantity< unit< dimensionless_type, System2 >, Y2 > &, 
+                      unspecified = 0);
+  this_type & operator=(const this_type &);
+  template<typename YY> 
+    this_type & operator=(const quantity< unit< dimension_type, system_type >, YY > &);
+  template<typename System2> 
+    this_type & operator=(const quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(System2), Y > &);
+
+  // public member functions
+  operator value_type() const;
+  const value_type & value() const;
+  this_type & operator+=(const this_type &);
+  this_type & operator-=(const this_type &);
+  this_type & operator*=(const value_type &);
+  this_type & operator/=(const value_type &);
+
+  // public static functions
+  static this_type from_value(const value_type &);
+};
                                                                                    +
                                                                                    +

                                                                                    Description

                                                                                    +

                                                                                    Specialization for dimensionless quantities. Implicit conversions between unit systems are allowed because all dimensionless quantities are equivalent. Implicit construction and assignment from and conversion to value_type is also allowed.

                                                                                    +
                                                                                    +

                                                                                    +quantity + public + construct/copy/destruct

                                                                                    +
                                                                                      +
                                                                                    1. quantity();
                                                                                      2. +
                                                                                    2. +
                                                                                      quantity(value_type val);
                                                                                      construction from raw value_type is allowed
                                                                                      3. +
                                                                                    3. quantity(const this_type & source);
                                                                                      4. +
                                                                                    4. +
                                                                                      template<typename YY> 
+  quantity(const quantity< unit< dimension_type, system_type >, YY > & source, 
+           unspecified = 0);
                                                                                      implicit conversion between value types is allowed if allowed for value types themselves
                                                                                      5. +
                                                                                    5. +
                                                                                      template<typename YY> 
+  explicit quantity(const quantity< unit< dimension_type, system_type >, YY > & source, 
+                    unspecified = 0);
                                                                                      implicit conversion between value types is not allowed if not allowed for value types themselves
                                                                                      6. +
                                                                                    6. +
                                                                                      template<typename System2, typename Y2> 
+  quantity(const quantity< unit< dimensionless_type, System2 >, Y2 > & source, 
+           unspecified = 0, unspecified = 0, unspecified = 0);
                                                                                      implicit conversion between different unit systems is allowed
                                                                                      7. +
                                                                                    7. +
                                                                                      template<typename System2, typename Y2> 
+  explicit quantity(const quantity< unit< dimensionless_type, System2 >, Y2 > & source, 
+                    unspecified = 0, unspecified = 0, unspecified = 0);
                                                                                      implicit conversion between different unit systems is allowed
                                                                                      8. +
                                                                                    8. +
                                                                                      template<typename System2, typename Y2> 
+  explicit quantity(const quantity< unit< dimensionless_type, System2 >, Y2 > & source, 
+                    unspecified = 0);
                                                                                      +

                                                                                      conversion between different unit systems is explicit when the units are not equivalent.

                                                                                      +
                                                                                      9. +
                                                                                    9. this_type & operator=(const this_type & source);
                                                                                      10. +
                                                                                    10. +
                                                                                      template<typename YY> 
+  this_type & operator=(const quantity< unit< dimension_type, system_type >, YY > & source);
                                                                                      implicit assignment between value types is allowed if allowed for value types themselves
                                                                                      11. +
                                                                                    11. +
                                                                                      template<typename System2> 
+  this_type & operator=(const quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(System2), Y > & source);
                                                                                      implicit assignment between different unit systems is allowed
                                                                                      12. +
                                                                                    +
                                                                                    +
                                                                                    +

                                                                                    +quantity public member functions

                                                                                    +
                                                                                      +
                                                                                    1. +
                                                                                      operator value_type() const;
                                                                                      implicit conversion to value_type is allowed
                                                                                      2. +
                                                                                    2. +
                                                                                      const value_type & value() const;
                                                                                      constant accessor to value

                                                                                      can add a quantity of the same type if add_typeof_helper<value_type,value_type>::type is convertible to value_type

                                                                                      +
                                                                                      3. +
                                                                                    3. +
                                                                                      this_type & operator+=(const this_type & source);
                                                                                      can subtract a quantity of the same type if subtract_typeof_helper<value_type,value_type>::type is convertible to value_type
                                                                                      4. +
                                                                                    4. +
                                                                                      this_type & operator-=(const this_type & source);
                                                                                      can multiply a quantity by a scalar value_type if multiply_typeof_helper<value_type,value_type>::type is convertible to value_type
                                                                                      5. +
                                                                                    5. +
                                                                                      this_type & operator*=(const value_type & val);
                                                                                      can divide a quantity by a scalar value_type if divide_typeof_helper<value_type,value_type>::type is convertible to value_type
                                                                                      6. +
                                                                                    6. this_type & operator/=(const value_type & val);
                                                                                      7. +
                                                                                    +
                                                                                    +
                                                                                    +

                                                                                    +quantity public static functions

                                                                                    +
                                                                                    1. +
                                                                                      static this_type from_value(const value_type & val);
                                                                                      Construct quantity directly from value_type.
                                                                                    +
                                                                                    +
                                                                                    +
                                                                                    + + + +
                                                                                    Copyright © 2003-2008 Matthias Christian Schabel
                                                                                    Copyright © 2007-2010 Steven + Watanabe

                                                                                    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                    +
                                                                                    +
                                                                                    +
                                                                                    +PrevUpHomeNext +
                                                                                    + + diff --git a/doc/html/boost/units/reduce_u_idm45506851125392.html b/doc/html/boost/units/reduce_u_idm45506851125392.html new file mode 100644 index 0000000000..98d80720ab --- /dev/null +++ b/doc/html/boost/units/reduce_u_idm45506851125392.html @@ -0,0 +1,55 @@ + + + + +Struct template reduce_unit<unit< Dim, System >> + + + + + + + + + + + + + + + +
                                                                                    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                    +
                                                                                    +
                                                                                    +PrevUpHomeNext +
                                                                                    +
                                                                                    +
                                                                                    +
                                                                                    +

                                                                                    Struct template reduce_unit<unit< Dim, System >>

                                                                                    +

                                                                                    boost::units::reduce_unit<unit< Dim, System >> — Returns a unique type for every unit.

                                                                                    +
                                                                                    +

                                                                                    Synopsis

                                                                                    +
                                                                                    // In header: <boost/units/unit.hpp>
+
+template<typename Dim, typename System> 
+struct reduce_unit<unit< Dim, System >> {
+  // types
+  typedef unspecified type;
+};
                                                                                    +
                                                                                    + + + +
                                                                                    Copyright © 2003-2008 Matthias Christian Schabel
                                                                                    Copyright © 2007-2010 Steven + Watanabe

                                                                                    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                    +
                                                                                    +
                                                                                    +
                                                                                    +PrevUpHomeNext +
                                                                                    + + diff --git a/doc/html/boost/units/reduce_unit.html b/doc/html/boost/units/reduce_unit.html index 03c2ea2509..cc7398f73a 100644 --- a/doc/html/boost/units/reduce_unit.html +++ b/doc/html/boost/units/reduce_unit.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                                                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                                                    @@ -49,7 +49,7 @@
                                                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                                                    diff --git a/doc/html/boost/units/reduce_unit_u_idp347838864.html b/doc/html/boost/units/reduce_unit_u_idp347838864.html deleted file mode 100644 index e8c20eb7ee..0000000000 --- a/doc/html/boost/units/reduce_unit_u_idp347838864.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template reduce_unit<unit< Dim, System >> - - - - - - - - - - - - - - - -
                                                                                    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                    -
                                                                                    -
                                                                                    -PrevUpHomeNext -
                                                                                    -
                                                                                    -
                                                                                    -
                                                                                    -

                                                                                    Struct template reduce_unit<unit< Dim, System >>

                                                                                    -

                                                                                    boost::units::reduce_unit<unit< Dim, System >> — Returns a unique type for every unit.

                                                                                    -
                                                                                    -

                                                                                    Synopsis

                                                                                    -
                                                                                    // In header: <boost/units/unit.hpp>
-
-template<typename Dim, typename System> 
-struct reduce_unit<unit< Dim, System >> {
-  // types
-  typedef unspecified type;
-};
                                                                                    -
                                                                                    - - - -
                                                                                    Copyright © 2003-2008 Matthias Christian Schabel
                                                                                    Copyright © 2007-2010 Steven - Watanabe

                                                                                    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                    -
                                                                                    -
                                                                                    -
                                                                                    -PrevUpHomeNext -
                                                                                    - - diff --git a/doc/html/boost/units/root_typ_idm45506851121600.html b/doc/html/boost/units/root_typ_idm45506851121600.html new file mode 100644 index 0000000000..b833eb63c2 --- /dev/null +++ b/doc/html/boost/units/root_typ_idm45506851121600.html @@ -0,0 +1,66 @@ + + + + +Struct template root_typeof_helper<unit< Dim, System >, static_rational< N, D >> + + + + + + + + + + + + + + + +
                                                                                    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                    +
                                                                                    +
                                                                                    +PrevUpHomeNext +
                                                                                    +
                                                                                    +
                                                                                    +
                                                                                    +

                                                                                    Struct template root_typeof_helper<unit< Dim, System >, static_rational< N, D >>

                                                                                    +

                                                                                    boost::units::root_typeof_helper<unit< Dim, System >, static_rational< N, D >> — take the static_rational root of a unit

                                                                                    +
                                                                                    +

                                                                                    Synopsis

                                                                                    +
                                                                                    // In header: <boost/units/unit.hpp>
+
+template<typename Dim, typename System, long N, long D> 
+struct root_typeof_helper<unit< Dim, System >, static_rational< N, D >> {
+  // types
+  typedef unit< typename static_root< Dim, static_rational< N, D > >::type, typename static_root< System, static_rational< N, D > >::type > type;
+
+  // public static functions
+  static type value(const unit< Dim, System > &);
+};
                                                                                    +
                                                                                    +

                                                                                    Description

                                                                                    +
                                                                                    +

                                                                                    +root_typeof_helper public static functions

                                                                                    +
                                                                                    1. static type value(const unit< Dim, System > &);
                                                                                    +
                                                                                    +
                                                                                    +
                                                                                    + + + +
                                                                                    Copyright © 2003-2008 Matthias Christian Schabel
                                                                                    Copyright © 2007-2010 Steven + Watanabe

                                                                                    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                    +
                                                                                    +
                                                                                    +
                                                                                    +PrevUpHomeNext +
                                                                                    + + diff --git a/doc/html/boost/units/root_typeof_h_idp347842656.html b/doc/html/boost/units/root_typeof_h_idp347842656.html deleted file mode 100644 index 2fb1f8b6f0..0000000000 --- a/doc/html/boost/units/root_typeof_h_idp347842656.html +++ /dev/null @@ -1,66 +0,0 @@ - - - - -Struct template root_typeof_helper<unit< Dim, System >, static_rational< N, D >> - - - - - - - - - - - - - - - -
                                                                                    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                    -
                                                                                    -
                                                                                    -PrevUpHomeNext -
                                                                                    -
                                                                                    -
                                                                                    -
                                                                                    -

                                                                                    Struct template root_typeof_helper<unit< Dim, System >, static_rational< N, D >>

                                                                                    -

                                                                                    boost::units::root_typeof_helper<unit< Dim, System >, static_rational< N, D >> — take the static_rational root of a unit

                                                                                    -
                                                                                    -

                                                                                    Synopsis

                                                                                    -
                                                                                    // In header: <boost/units/unit.hpp>
-
-template<typename Dim, typename System, long N, long D> 
-struct root_typeof_helper<unit< Dim, System >, static_rational< N, D >> {
-  // types
-  typedef unit< typename static_root< Dim, static_rational< N, D > >::type, typename static_root< System, static_rational< N, D > >::type > type;
-
-  // public static functions
-  static type value(const unit< Dim, System > &);
-};
                                                                                    -
                                                                                    -

                                                                                    Description

                                                                                    -
                                                                                    -

                                                                                    -root_typeof_helper public static functions

                                                                                    -
                                                                                    1. static type value(const unit< Dim, System > &);
                                                                                    -
                                                                                    -
                                                                                    -
                                                                                    - - - -
                                                                                    Copyright © 2003-2008 Matthias Christian Schabel
                                                                                    Copyright © 2007-2010 Steven - Watanabe

                                                                                    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                    -
                                                                                    -
                                                                                    -
                                                                                    -PrevUpHomeNext -
                                                                                    - - diff --git a/doc/html/boost/units/root_typeof_helper.html b/doc/html/boost/units/root_typeof_helper.html index e262bf2f9f..b84b5d1ce4 100644 --- a/doc/html/boost/units/root_typeof_helper.html +++ b/doc/html/boost/units/root_typeof_helper.html @@ -37,17 +37,17 @@ // types typedef unspecified type; // specifies the result type - // public static functions - static type value(const Radicand &); + // public static functions + static type value(const Radicand &); };
                                                                                    -

                                                                                    Description

                                                                                    +

                                                                                    Description

                                                                                    A helper used by root to take a root of a runtime object using a compile time known index. This template is intended to be specialized. All specializations must conform to the interface shown here. Index will be either the type passed to pow or static_rational<N> for and integer argument, N.

                                                                                    -

                                                                                    -root_typeof_helper public static functions

                                                                                    +

                                                                                    +root_typeof_helper public static functions

                                                                                    1. -
                                                                                      static type value(const Radicand & base);
                                                                                      Carries out the runtime calculation.
                                                                                    +
                                                                                    static type value(const Radicand & base);
                                                                                    Carries out the runtime calculation.
                                                                                  diff --git a/doc/html/boost/units/scale.html b/doc/html/boost/units/scale.html index 42a3502c76..a8d6865507 100644 --- a/doc/html/boost/units/scale.html +++ b/doc/html/boost/units/scale.html @@ -38,19 +38,19 @@ typedef Exponent exponent; typedef double value_type; - // public static functions - static value_type value(); + // public static functions + static value_type value(); // public data members static const long base; };
                                                                                  -

                                                                                  Description

                                                                                  +

                                                                                  Description

                                                                                  class representing a scaling factor such as 10^3 The exponent must be a static rational.

                                                                                  -

                                                                                  -scale public static functions

                                                                                  -
                                                                                  1. static value_type value();
                                                                                  +

                                                                                  +scale public static functions

                                                                                  +
                                                                                  1. static value_type value();
                                                                                diff --git a/doc/html/boost/units/scaled_base_unit.html b/doc/html/boost/units/scaled_base_unit.html index 09653c65b8..d8e785c549 100644 --- a/doc/html/boost/units/scaled_base_unit.html +++ b/doc/html/boost/units/scaled_base_unit.html @@ -42,18 +42,18 @@ typedef S::dimension_type dimension_type; typedef unspecified unit_type; - // public static functions - static std::string symbol(); - static std::string name(); + // public static functions + static std::string symbol(); + static std::string name(); };
                                                                                -

                                                                                Description

                                                                                +

                                                                                Description

                                                                                -

                                                                                -scaled_base_unit public static functions

                                                                                +

                                                                                +scaled_base_unit public static functions

                                                                                  -
                                                                                1. static std::string symbol();
                                                                                  2. -
                                                                                2. static std::string name();
                                                                                  3. +
                                                                                3. static std::string symbol();
                                                                                  4. +
                                                                                4. static std::string name();
                                                                                diff --git a/doc/html/boost/units/si/ampere_base_unit.html b/doc/html/boost/units/si/ampere_base_unit.html index 8a7555b1da..54b64c2773 100644 --- a/doc/html/boost/units/si/ampere_base_unit.html +++ b/doc/html/boost/units/si/ampere_base_unit.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                                                                                -PrevUpHomeNext +PrevUpHomeNext
                                                                                @@ -37,18 +37,18 @@ public base_unit< ampere_base_unit, current_dimension,-6 > { - // public static functions - static std::string name(); - static std::string symbol(); + // public static functions + static std::string name(); + static std::string symbol(); };
                                                                                -

                                                                                Description

                                                                                +

                                                                                Description

                                                                                -

                                                                                -ampere_base_unit public static functions

                                                                                +

                                                                                +ampere_base_unit public static functions

                                                                                  -
                                                                                1. static std::string name();
                                                                                  2. -
                                                                                2. static std::string symbol();
                                                                                  3. +
                                                                                3. static std::string name();
                                                                                  4. +
                                                                                4. static std::string symbol();
                                                                                @@ -64,7 +64,7 @@
                                                                                -PrevUpHomeNext +PrevUpHomeNext
                                                                                diff --git a/doc/html/boost/units/si/candela_base_unit.html b/doc/html/boost/units/si/candela_base_unit.html index c3626f81a8..fa506906e8 100644 --- a/doc/html/boost/units/si/candela_base_unit.html +++ b/doc/html/boost/units/si/candela_base_unit.html @@ -37,18 +37,18 @@ public base_unit< candela_base_unit, luminous_intensity_dimension,-3 > { - // public static functions - static std::string name(); - static std::string symbol(); + // public static functions + static std::string name(); + static std::string symbol(); };
                                                                                -

                                                                                Description

                                                                                +

                                                                                Description

                                                                                -

                                                                                -candela_base_unit public static functions

                                                                                +

                                                                                +candela_base_unit public static functions

                                                                                  -
                                                                                1. static std::string name();
                                                                                  2. -
                                                                                2. static std::string symbol();
                                                                                  3. +
                                                                                3. static std::string name();
                                                                                  4. +
                                                                                4. static std::string symbol();
                                                                                diff --git a/doc/html/boost/units/si/constants/codata/BOOST_UNITS_P_idp348286224.html b/doc/html/boost/units/si/constants/codata/BOOST_UNITS_P_idp348286224.html deleted file mode 100644 index 1741a15162..0000000000 --- a/doc/html/boost/units/si/constants/codata/BOOST_UNITS_P_idp348286224.html +++ /dev/null @@ -1,58 +0,0 @@ - - - - -Function BOOST_UNITS_PHYSICAL_CONSTANT - - - - - - - - - - - - - - - -
                                                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                -
                                                                                -
                                                                                -PrevUpHomeNext -
                                                                                -
                                                                                -
                                                                                -
                                                                                -

                                                                                Function BOOST_UNITS_PHYSICAL_CONSTANT

                                                                                -

                                                                                boost::units::si::constants::codata::BOOST_UNITS_PHYSICAL_CONSTANT — CODATA recommended values of the fundamental physical constants: NIST SP 961.

                                                                                -
                                                                                -

                                                                                Synopsis

                                                                                -
                                                                                // In header: <boost/units/systems/si/codata/alpha_constants.hpp>
-
-
- BOOST_UNITS_PHYSICAL_CONSTANT(m_alpha, quantity< mass >, 
-                               6.64465620e-27 * kilograms, 
-                               3.3e-34 * kilograms);
                                                                                -
                                                                                -

                                                                                Description

                                                                                -

                                                                                alpha particle mass

                                                                                -
                                                                                -
                                                                                - - - -
                                                                                Copyright © 2003-2008 Matthias Christian Schabel
                                                                                Copyright © 2007-2010 Steven - Watanabe

                                                                                - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                -
                                                                                -
                                                                                -
                                                                                -PrevUpHomeNext -
                                                                                - - diff --git a/doc/html/boost/units/si/constants/codata/BOOST_UNITS_P_idp348306176.html b/doc/html/boost/units/si/constants/codata/BOOST_UNITS_P_idp348306176.html deleted file mode 100644 index 41712af375..0000000000 --- a/doc/html/boost/units/si/constants/codata/BOOST_UNITS_P_idp348306176.html +++ /dev/null @@ -1,58 +0,0 @@ - - - - -Function BOOST_UNITS_PHYSICAL_CONSTANT - - - - - - - - - - - - - - - -
                                                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                -
                                                                                -
                                                                                -PrevUpHomeNext -
                                                                                -
                                                                                -
                                                                                -
                                                                                -

                                                                                Function BOOST_UNITS_PHYSICAL_CONSTANT

                                                                                -

                                                                                boost::units::si::constants::codata::BOOST_UNITS_PHYSICAL_CONSTANT — CODATA recommended values of the fundamental physical constants: NIST SP 961.

                                                                                -
                                                                                -

                                                                                Synopsis

                                                                                -
                                                                                // In header: <boost/units/systems/si/codata/atomic-nuclear_constants.hpp>
-
-
- BOOST_UNITS_PHYSICAL_CONSTANT(alpha, quantity< dimensionless >, 
-                               7.2973525376e-3 * dimensionless, 
-                               5.0e-12 * dimensionless);
                                                                                -
                                                                                -

                                                                                Description

                                                                                -

                                                                                fine structure constant

                                                                                -
                                                                                -
                                                                                - - - -
                                                                                Copyright © 2003-2008 Matthias Christian Schabel
                                                                                Copyright © 2007-2010 Steven - Watanabe

                                                                                - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                -
                                                                                -
                                                                                -
                                                                                -PrevUpHomeNext -
                                                                                - - diff --git a/doc/html/boost/units/si/constants/codata/BOOST_UNITS_P_idp348326592.html b/doc/html/boost/units/si/constants/codata/BOOST_UNITS_P_idp348326592.html deleted file mode 100644 index ac8329101e..0000000000 --- a/doc/html/boost/units/si/constants/codata/BOOST_UNITS_P_idp348326592.html +++ /dev/null @@ -1,58 +0,0 @@ - - - - -Function BOOST_UNITS_PHYSICAL_CONSTANT - - - - - - - - - - - - - - - -
                                                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                -
                                                                                -
                                                                                -PrevUpHomeNext -
                                                                                -
                                                                                -
                                                                                -
                                                                                -

                                                                                Function BOOST_UNITS_PHYSICAL_CONSTANT

                                                                                -

                                                                                boost::units::si::constants::codata::BOOST_UNITS_PHYSICAL_CONSTANT — CODATA recommended values of the fundamental physical constants: NIST SP 961.

                                                                                -
                                                                                -

                                                                                Synopsis

                                                                                -
                                                                                // In header: <boost/units/systems/si/codata/deuteron_constants.hpp>
-
-
- BOOST_UNITS_PHYSICAL_CONSTANT(m_d, quantity< mass >, 
-                               3.34358320e-27 * kilograms, 
-                               1.7e-34 * kilograms);
                                                                                -
                                                                                -

                                                                                Description

                                                                                -

                                                                                deuteron mass

                                                                                -
                                                                                -
                                                                                - - - -
                                                                                Copyright © 2003-2008 Matthias Christian Schabel
                                                                                Copyright © 2007-2010 Steven - Watanabe

                                                                                - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                -
                                                                                -
                                                                                -
                                                                                -PrevUpHomeNext -
                                                                                - - diff --git a/doc/html/boost/units/si/constants/codata/BOOST_UNITS_P_idp348412640.html b/doc/html/boost/units/si/constants/codata/BOOST_UNITS_P_idp348412640.html deleted file mode 100644 index 0c17fb06ac..0000000000 --- a/doc/html/boost/units/si/constants/codata/BOOST_UNITS_P_idp348412640.html +++ /dev/null @@ -1,58 +0,0 @@ - - - - -Function BOOST_UNITS_PHYSICAL_CONSTANT - - - - - - - - - - - - - - - -
                                                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                -
                                                                                -
                                                                                -PrevUpHomeNext -
                                                                                -
                                                                                -
                                                                                -
                                                                                -

                                                                                Function BOOST_UNITS_PHYSICAL_CONSTANT

                                                                                -

                                                                                boost::units::si::constants::codata::BOOST_UNITS_PHYSICAL_CONSTANT — CODATA recommended values of the fundamental physical constants: NIST SP 961.

                                                                                -
                                                                                -

                                                                                Synopsis

                                                                                -
                                                                                // In header: <boost/units/systems/si/codata/electron_constants.hpp>
-
-
- BOOST_UNITS_PHYSICAL_CONSTANT(m_e, quantity< mass >, 
-                               9.10938215e-31 * kilograms, 
-                               4.5e-38 * kilograms);
                                                                                -
                                                                                -

                                                                                Description

                                                                                -

                                                                                electron mass

                                                                                -
                                                                                -
                                                                                - - - -
                                                                                Copyright © 2003-2008 Matthias Christian Schabel
                                                                                Copyright © 2007-2010 Steven - Watanabe

                                                                                - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                -
                                                                                -
                                                                                -
                                                                                -PrevUpHomeNext -
                                                                                - - diff --git a/doc/html/boost/units/si/constants/codata/BOOST_UNITS_P_idp348508624.html b/doc/html/boost/units/si/constants/codata/BOOST_UNITS_P_idp348508624.html deleted file mode 100644 index 1e677db131..0000000000 --- a/doc/html/boost/units/si/constants/codata/BOOST_UNITS_P_idp348508624.html +++ /dev/null @@ -1,58 +0,0 @@ - - - - -Function BOOST_UNITS_PHYSICAL_CONSTANT - - - - - - - - - - - - - - - -
                                                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                -
                                                                                -
                                                                                -PrevUpHomeNext -
                                                                                -
                                                                                -
                                                                                -
                                                                                -

                                                                                Function BOOST_UNITS_PHYSICAL_CONSTANT

                                                                                -

                                                                                boost::units::si::constants::codata::BOOST_UNITS_PHYSICAL_CONSTANT — CODATA recommended values of the fundamental physical constants: NIST SP 961.

                                                                                -
                                                                                -

                                                                                Synopsis

                                                                                -
                                                                                // In header: <boost/units/systems/si/codata/helion_constants.hpp>
-
-
- BOOST_UNITS_PHYSICAL_CONSTANT(m_h, quantity< mass >, 
-                               5.00641192e-27 * kilograms, 
-                               2.5e-34 * kilograms);
                                                                                -
                                                                                -

                                                                                Description

                                                                                -

                                                                                helion mass

                                                                                -
                                                                                -
                                                                                - - - -
                                                                                Copyright © 2003-2008 Matthias Christian Schabel
                                                                                Copyright © 2007-2010 Steven - Watanabe

                                                                                - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                -
                                                                                -
                                                                                -
                                                                                -PrevUpHomeNext -
                                                                                - - diff --git a/doc/html/boost/units/si/constants/codata/BOOST_UNITS_P_idp348551696.html b/doc/html/boost/units/si/constants/codata/BOOST_UNITS_P_idp348551696.html deleted file mode 100644 index d6fdf8caaf..0000000000 --- a/doc/html/boost/units/si/constants/codata/BOOST_UNITS_P_idp348551696.html +++ /dev/null @@ -1,58 +0,0 @@ - - - - -Function BOOST_UNITS_PHYSICAL_CONSTANT - - - - - - - - - - - - - - - -
                                                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                -
                                                                                -
                                                                                -PrevUpHomeNext -
                                                                                -
                                                                                -
                                                                                -
                                                                                -

                                                                                Function BOOST_UNITS_PHYSICAL_CONSTANT

                                                                                -

                                                                                boost::units::si::constants::codata::BOOST_UNITS_PHYSICAL_CONSTANT — CODATA recommended values of the fundamental physical constants: NIST SP 961.

                                                                                -
                                                                                -

                                                                                Synopsis

                                                                                -
                                                                                // In header: <boost/units/systems/si/codata/muon_constants.hpp>
-
-
- BOOST_UNITS_PHYSICAL_CONSTANT(m_mu, quantity< mass >, 
-                               1.88353130e-28 * kilograms, 
-                               1.1e-35 * kilograms);
                                                                                -
                                                                                -

                                                                                Description

                                                                                -

                                                                                muon mass

                                                                                -
                                                                                -
                                                                                - - - -
                                                                                Copyright © 2003-2008 Matthias Christian Schabel
                                                                                Copyright © 2007-2010 Steven - Watanabe

                                                                                - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                -
                                                                                -
                                                                                -
                                                                                -PrevUpHomeNext -
                                                                                - - diff --git a/doc/html/boost/units/si/constants/codata/BOOST_UNITS_P_idp348606096.html b/doc/html/boost/units/si/constants/codata/BOOST_UNITS_P_idp348606096.html deleted file mode 100644 index 4c8716521a..0000000000 --- a/doc/html/boost/units/si/constants/codata/BOOST_UNITS_P_idp348606096.html +++ /dev/null @@ -1,58 +0,0 @@ - - - - -Function BOOST_UNITS_PHYSICAL_CONSTANT - - - - - - - - - - - - - - - -
                                                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                -
                                                                                -
                                                                                -PrevUpHomeNext -
                                                                                -
                                                                                -
                                                                                -
                                                                                -

                                                                                Function BOOST_UNITS_PHYSICAL_CONSTANT

                                                                                -

                                                                                boost::units::si::constants::codata::BOOST_UNITS_PHYSICAL_CONSTANT — CODATA recommended values of the fundamental physical constants: NIST SP 961.

                                                                                -
                                                                                -

                                                                                Synopsis

                                                                                -
                                                                                // In header: <boost/units/systems/si/codata/neutron_constants.hpp>
-
-
- BOOST_UNITS_PHYSICAL_CONSTANT(m_n, quantity< mass >, 
-                               1.674927211e-27 * kilograms, 
-                               8.4e-35 * kilograms);
                                                                                -
                                                                                -

                                                                                Description

                                                                                -

                                                                                neutron mass

                                                                                -
                                                                                -
                                                                                - - - -
                                                                                Copyright © 2003-2008 Matthias Christian Schabel
                                                                                Copyright © 2007-2010 Steven - Watanabe

                                                                                - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                -
                                                                                -
                                                                                -
                                                                                -PrevUpHomeNext -
                                                                                - - diff --git a/doc/html/boost/units/si/constants/codata/BOOST_UNITS_P_idp348706944.html b/doc/html/boost/units/si/constants/codata/BOOST_UNITS_P_idp348706944.html deleted file mode 100644 index 0bec23cc81..0000000000 --- a/doc/html/boost/units/si/constants/codata/BOOST_UNITS_P_idp348706944.html +++ /dev/null @@ -1,58 +0,0 @@ - - - - -Function BOOST_UNITS_PHYSICAL_CONSTANT - - - - - - - - - - - - - - - -
                                                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                -
                                                                                -
                                                                                -PrevUpHomeNext -
                                                                                -
                                                                                -
                                                                                -
                                                                                -

                                                                                Function BOOST_UNITS_PHYSICAL_CONSTANT

                                                                                -

                                                                                boost::units::si::constants::codata::BOOST_UNITS_PHYSICAL_CONSTANT — CODATA recommended values of the fundamental physical constants: NIST SP 961.

                                                                                -
                                                                                -

                                                                                Synopsis

                                                                                -
                                                                                // In header: <boost/units/systems/si/codata/proton_constants.hpp>
-
-
- BOOST_UNITS_PHYSICAL_CONSTANT(m_p, quantity< mass >, 
-                               1.672621637e-27 * kilograms, 
-                               8.3e-35 * kilograms);
                                                                                -
                                                                                -

                                                                                Description

                                                                                -

                                                                                proton mass

                                                                                -
                                                                                -
                                                                                - - - -
                                                                                Copyright © 2003-2008 Matthias Christian Schabel
                                                                                Copyright © 2007-2010 Steven - Watanabe

                                                                                - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                -
                                                                                -
                                                                                -
                                                                                -PrevUpHomeNext -
                                                                                - - diff --git a/doc/html/boost/units/si/constants/codata/BOOST_UNITS_P_idp348787808.html b/doc/html/boost/units/si/constants/codata/BOOST_UNITS_P_idp348787808.html deleted file mode 100644 index 301afacdfa..0000000000 --- a/doc/html/boost/units/si/constants/codata/BOOST_UNITS_P_idp348787808.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function BOOST_UNITS_PHYSICAL_CONSTANT - - - - - - - - - - - - - - - -
                                                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                -
                                                                                -
                                                                                -PrevUpHomeNext -
                                                                                -
                                                                                -
                                                                                -
                                                                                -

                                                                                Function BOOST_UNITS_PHYSICAL_CONSTANT

                                                                                -

                                                                                boost::units::si::constants::codata::BOOST_UNITS_PHYSICAL_CONSTANT — CODATA recommended values of the fundamental physical constants: NIST SP 961.

                                                                                -
                                                                                -

                                                                                Synopsis

                                                                                -
                                                                                // In header: <boost/units/systems/si/codata/tau_constants.hpp>
-
-
- BOOST_UNITS_PHYSICAL_CONSTANT(m_tau, quantity< mass >, 
-                               3.16777e-27 * kilograms, 5.2e-31 * kilograms);
                                                                                -
                                                                                -

                                                                                Description

                                                                                -

                                                                                tau mass

                                                                                -
                                                                                -
                                                                                - - - -
                                                                                Copyright © 2003-2008 Matthias Christian Schabel
                                                                                Copyright © 2007-2010 Steven - Watanabe

                                                                                - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                -
                                                                                -
                                                                                -
                                                                                -PrevUpHomeNext -
                                                                                - - diff --git a/doc/html/boost/units/si/constants/codata/BOOST_UNITS_P_idp348819392.html b/doc/html/boost/units/si/constants/codata/BOOST_UNITS_P_idp348819392.html deleted file mode 100644 index 6fe4073503..0000000000 --- a/doc/html/boost/units/si/constants/codata/BOOST_UNITS_P_idp348819392.html +++ /dev/null @@ -1,58 +0,0 @@ - - - - -Function BOOST_UNITS_PHYSICAL_CONSTANT - - - - - - - - - - - - - - - -
                                                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                -
                                                                                -
                                                                                -PrevUpHomeNext -
                                                                                -
                                                                                -
                                                                                -
                                                                                -

                                                                                Function BOOST_UNITS_PHYSICAL_CONSTANT

                                                                                -

                                                                                boost::units::si::constants::codata::BOOST_UNITS_PHYSICAL_CONSTANT — CODATA recommended values of the fundamental physical constants: NIST SP 961.

                                                                                -
                                                                                -

                                                                                Synopsis

                                                                                -
                                                                                // In header: <boost/units/systems/si/codata/triton_constants.hpp>
-
-
- BOOST_UNITS_PHYSICAL_CONSTANT(m_t, quantity< mass >, 
-                               5.00735588e-27 * kilograms, 
-                               2.5e-34 * kilograms);
                                                                                -
                                                                                -

                                                                                Description

                                                                                -

                                                                                triton mass

                                                                                -
                                                                                -
                                                                                - - - -
                                                                                Copyright © 2003-2008 Matthias Christian Schabel
                                                                                Copyright © 2007-2010 Steven - Watanabe

                                                                                - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                -
                                                                                -
                                                                                -
                                                                                -PrevUpHomeNext -
                                                                                - - diff --git a/doc/html/boost/units/si/constants/codata/BOOST_UNITS_P_idp348887856.html b/doc/html/boost/units/si/constants/codata/BOOST_UNITS_P_idp348887856.html deleted file mode 100644 index 5aa15226a7..0000000000 --- a/doc/html/boost/units/si/constants/codata/BOOST_UNITS_P_idp348887856.html +++ /dev/null @@ -1,58 +0,0 @@ - - - - -Function BOOST_UNITS_PHYSICAL_CONSTANT - - - - - - - - - - - - - - - -
                                                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                -
                                                                                -
                                                                                -PrevUpHomeNext -
                                                                                -
                                                                                -
                                                                                -
                                                                                -

                                                                                Function BOOST_UNITS_PHYSICAL_CONSTANT

                                                                                -

                                                                                boost::units::si::constants::codata::BOOST_UNITS_PHYSICAL_CONSTANT — CODATA recommended values of the fundamental physical constants: NIST SP 961.

                                                                                -
                                                                                -

                                                                                Synopsis

                                                                                -
                                                                                // In header: <boost/units/systems/si/codata/universal_constants.hpp>
-
-
- BOOST_UNITS_PHYSICAL_CONSTANT(c, quantity< velocity >, 
-                               299792458.0 *meters/ second, 
-                               0.0 *meters/ second);
                                                                                -
                                                                                -

                                                                                Description

                                                                                -

                                                                                speed of light

                                                                                -
                                                                                -
                                                                                - - - -
                                                                                Copyright © 2003-2008 Matthias Christian Schabel
                                                                                Copyright © 2007-2010 Steven - Watanabe

                                                                                - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                -
                                                                                -
                                                                                -
                                                                                -PrevUpHomeNext -
                                                                                - - diff --git a/doc/html/boost/units/si/constants/codata/BOOST_UN_idm45506850076400.html b/doc/html/boost/units/si/constants/codata/BOOST_UN_idm45506850076400.html new file mode 100644 index 0000000000..62bdab129e --- /dev/null +++ b/doc/html/boost/units/si/constants/codata/BOOST_UN_idm45506850076400.html @@ -0,0 +1,58 @@ + + + + +Function BOOST_UNITS_PHYSICAL_CONSTANT + + + + + + + + + + + + + + + +
                                                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                +
                                                                                +
                                                                                +PrevUpHomeNext +
                                                                                +
                                                                                +
                                                                                +
                                                                                +

                                                                                Function BOOST_UNITS_PHYSICAL_CONSTANT

                                                                                +

                                                                                boost::units::si::constants::codata::BOOST_UNITS_PHYSICAL_CONSTANT — CODATA recommended values of the fundamental physical constants: NIST SP 961.

                                                                                +
                                                                                +

                                                                                Synopsis

                                                                                +
                                                                                // In header: <boost/units/systems/si/codata/universal_constants.hpp>
+
+
+ BOOST_UNITS_PHYSICAL_CONSTANT(c, quantity< velocity >, 
+                               299792458.0 *meters/ second, 
+                               0.0 *meters/ second);
                                                                                +
                                                                                +

                                                                                Description

                                                                                +

                                                                                speed of light

                                                                                +
                                                                                +
                                                                                + + + +
                                                                                Copyright © 2003-2008 Matthias Christian Schabel
                                                                                Copyright © 2007-2010 Steven + Watanabe

                                                                                + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                +
                                                                                +
                                                                                +
                                                                                +PrevUpHomeNext +
                                                                                + + diff --git a/doc/html/boost/units/si/constants/codata/BOOST_UN_idm45506850144864.html b/doc/html/boost/units/si/constants/codata/BOOST_UN_idm45506850144864.html new file mode 100644 index 0000000000..1066c9c637 --- /dev/null +++ b/doc/html/boost/units/si/constants/codata/BOOST_UN_idm45506850144864.html @@ -0,0 +1,58 @@ + + + + +Function BOOST_UNITS_PHYSICAL_CONSTANT + + + + + + + + + + + + + + + +
                                                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                +
                                                                                +
                                                                                +PrevUpHomeNext +
                                                                                +
                                                                                +
                                                                                +
                                                                                +

                                                                                Function BOOST_UNITS_PHYSICAL_CONSTANT

                                                                                +

                                                                                boost::units::si::constants::codata::BOOST_UNITS_PHYSICAL_CONSTANT — CODATA recommended values of the fundamental physical constants: NIST SP 961.

                                                                                +
                                                                                +

                                                                                Synopsis

                                                                                +
                                                                                // In header: <boost/units/systems/si/codata/triton_constants.hpp>
+
+
+ BOOST_UNITS_PHYSICAL_CONSTANT(m_t, quantity< mass >, 
+                               5.00735588e-27 * kilograms, 
+                               2.5e-34 * kilograms);
                                                                                +
                                                                                +

                                                                                Description

                                                                                +

                                                                                triton mass

                                                                                +
                                                                                +
                                                                                + + + +
                                                                                Copyright © 2003-2008 Matthias Christian Schabel
                                                                                Copyright © 2007-2010 Steven + Watanabe

                                                                                + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                +
                                                                                +
                                                                                +
                                                                                +PrevUpHomeNext +
                                                                                + + diff --git a/doc/html/boost/units/si/constants/codata/BOOST_UN_idm45506850176448.html b/doc/html/boost/units/si/constants/codata/BOOST_UN_idm45506850176448.html new file mode 100644 index 0000000000..d16ecb97ee --- /dev/null +++ b/doc/html/boost/units/si/constants/codata/BOOST_UN_idm45506850176448.html @@ -0,0 +1,57 @@ + + + + +Function BOOST_UNITS_PHYSICAL_CONSTANT + + + + + + + + + + + + + + + +
                                                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                +
                                                                                +
                                                                                +PrevUpHomeNext +
                                                                                +
                                                                                +
                                                                                +
                                                                                +

                                                                                Function BOOST_UNITS_PHYSICAL_CONSTANT

                                                                                +

                                                                                boost::units::si::constants::codata::BOOST_UNITS_PHYSICAL_CONSTANT — CODATA recommended values of the fundamental physical constants: NIST SP 961.

                                                                                +
                                                                                +

                                                                                Synopsis

                                                                                +
                                                                                // In header: <boost/units/systems/si/codata/tau_constants.hpp>
+
+
+ BOOST_UNITS_PHYSICAL_CONSTANT(m_tau, quantity< mass >, 
+                               3.16777e-27 * kilograms, 5.2e-31 * kilograms);
                                                                                +
                                                                                +

                                                                                Description

                                                                                +

                                                                                tau mass

                                                                                +
                                                                                +
                                                                                + + + +
                                                                                Copyright © 2003-2008 Matthias Christian Schabel
                                                                                Copyright © 2007-2010 Steven + Watanabe

                                                                                + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                +
                                                                                +
                                                                                +
                                                                                +PrevUpHomeNext +
                                                                                + + diff --git a/doc/html/boost/units/si/constants/codata/BOOST_UN_idm45506850257312.html b/doc/html/boost/units/si/constants/codata/BOOST_UN_idm45506850257312.html new file mode 100644 index 0000000000..37525647a4 --- /dev/null +++ b/doc/html/boost/units/si/constants/codata/BOOST_UN_idm45506850257312.html @@ -0,0 +1,58 @@ + + + + +Function BOOST_UNITS_PHYSICAL_CONSTANT + + + + + + + + + + + + + + + +
                                                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                +
                                                                                +
                                                                                +PrevUpHomeNext +
                                                                                +
                                                                                +
                                                                                +
                                                                                +

                                                                                Function BOOST_UNITS_PHYSICAL_CONSTANT

                                                                                +

                                                                                boost::units::si::constants::codata::BOOST_UNITS_PHYSICAL_CONSTANT — CODATA recommended values of the fundamental physical constants: NIST SP 961.

                                                                                +
                                                                                +

                                                                                Synopsis

                                                                                +
                                                                                // In header: <boost/units/systems/si/codata/proton_constants.hpp>
+
+
+ BOOST_UNITS_PHYSICAL_CONSTANT(m_p, quantity< mass >, 
+                               1.672621637e-27 * kilograms, 
+                               8.3e-35 * kilograms);
                                                                                +
                                                                                +

                                                                                Description

                                                                                +

                                                                                proton mass

                                                                                +
                                                                                +
                                                                                + + + +
                                                                                Copyright © 2003-2008 Matthias Christian Schabel
                                                                                Copyright © 2007-2010 Steven + Watanabe

                                                                                + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                +
                                                                                +
                                                                                +
                                                                                +PrevUpHomeNext +
                                                                                + + diff --git a/doc/html/boost/units/si/constants/codata/BOOST_UN_idm45506850358160.html b/doc/html/boost/units/si/constants/codata/BOOST_UN_idm45506850358160.html new file mode 100644 index 0000000000..041c15fe96 --- /dev/null +++ b/doc/html/boost/units/si/constants/codata/BOOST_UN_idm45506850358160.html @@ -0,0 +1,58 @@ + + + + +Function BOOST_UNITS_PHYSICAL_CONSTANT + + + + + + + + + + + + + + + +
                                                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                +
                                                                                +
                                                                                +PrevUpHomeNext +
                                                                                +
                                                                                +
                                                                                +
                                                                                +

                                                                                Function BOOST_UNITS_PHYSICAL_CONSTANT

                                                                                +

                                                                                boost::units::si::constants::codata::BOOST_UNITS_PHYSICAL_CONSTANT — CODATA recommended values of the fundamental physical constants: NIST SP 961.

                                                                                +
                                                                                +

                                                                                Synopsis

                                                                                +
                                                                                // In header: <boost/units/systems/si/codata/neutron_constants.hpp>
+
+
+ BOOST_UNITS_PHYSICAL_CONSTANT(m_n, quantity< mass >, 
+                               1.674927211e-27 * kilograms, 
+                               8.4e-35 * kilograms);
                                                                                +
                                                                                +

                                                                                Description

                                                                                +

                                                                                neutron mass

                                                                                +
                                                                                +
                                                                                + + + +
                                                                                Copyright © 2003-2008 Matthias Christian Schabel
                                                                                Copyright © 2007-2010 Steven + Watanabe

                                                                                + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                +
                                                                                +
                                                                                +
                                                                                +PrevUpHomeNext +
                                                                                + + diff --git a/doc/html/boost/units/si/constants/codata/BOOST_UN_idm45506850412560.html b/doc/html/boost/units/si/constants/codata/BOOST_UN_idm45506850412560.html new file mode 100644 index 0000000000..ee66af29d5 --- /dev/null +++ b/doc/html/boost/units/si/constants/codata/BOOST_UN_idm45506850412560.html @@ -0,0 +1,58 @@ + + + + +Function BOOST_UNITS_PHYSICAL_CONSTANT + + + + + + + + + + + + + + + +
                                                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                +
                                                                                +
                                                                                +PrevUpHomeNext +
                                                                                +
                                                                                +
                                                                                +
                                                                                +

                                                                                Function BOOST_UNITS_PHYSICAL_CONSTANT

                                                                                +

                                                                                boost::units::si::constants::codata::BOOST_UNITS_PHYSICAL_CONSTANT — CODATA recommended values of the fundamental physical constants: NIST SP 961.

                                                                                +
                                                                                +

                                                                                Synopsis

                                                                                +
                                                                                // In header: <boost/units/systems/si/codata/muon_constants.hpp>
+
+
+ BOOST_UNITS_PHYSICAL_CONSTANT(m_mu, quantity< mass >, 
+                               1.88353130e-28 * kilograms, 
+                               1.1e-35 * kilograms);
                                                                                +
                                                                                +

                                                                                Description

                                                                                +

                                                                                muon mass

                                                                                +
                                                                                +
                                                                                + + + +
                                                                                Copyright © 2003-2008 Matthias Christian Schabel
                                                                                Copyright © 2007-2010 Steven + Watanabe

                                                                                + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                +
                                                                                +
                                                                                +
                                                                                +PrevUpHomeNext +
                                                                                + + diff --git a/doc/html/boost/units/si/constants/codata/BOOST_UN_idm45506850455632.html b/doc/html/boost/units/si/constants/codata/BOOST_UN_idm45506850455632.html new file mode 100644 index 0000000000..2c5075912b --- /dev/null +++ b/doc/html/boost/units/si/constants/codata/BOOST_UN_idm45506850455632.html @@ -0,0 +1,58 @@ + + + + +Function BOOST_UNITS_PHYSICAL_CONSTANT + + + + + + + + + + + + + + + +
                                                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                +
                                                                                +
                                                                                +PrevUpHomeNext +
                                                                                +
                                                                                +
                                                                                +
                                                                                +

                                                                                Function BOOST_UNITS_PHYSICAL_CONSTANT

                                                                                +

                                                                                boost::units::si::constants::codata::BOOST_UNITS_PHYSICAL_CONSTANT — CODATA recommended values of the fundamental physical constants: NIST SP 961.

                                                                                +
                                                                                +

                                                                                Synopsis

                                                                                +
                                                                                // In header: <boost/units/systems/si/codata/helion_constants.hpp>
+
+
+ BOOST_UNITS_PHYSICAL_CONSTANT(m_h, quantity< mass >, 
+                               5.00641192e-27 * kilograms, 
+                               2.5e-34 * kilograms);
                                                                                +
                                                                                +

                                                                                Description

                                                                                +

                                                                                helion mass

                                                                                +
                                                                                +
                                                                                + + + +
                                                                                Copyright © 2003-2008 Matthias Christian Schabel
                                                                                Copyright © 2007-2010 Steven + Watanabe

                                                                                + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                +
                                                                                +
                                                                                +
                                                                                +PrevUpHomeNext +
                                                                                + + diff --git a/doc/html/boost/units/si/constants/codata/BOOST_UN_idm45506850551616.html b/doc/html/boost/units/si/constants/codata/BOOST_UN_idm45506850551616.html new file mode 100644 index 0000000000..1770a86085 --- /dev/null +++ b/doc/html/boost/units/si/constants/codata/BOOST_UN_idm45506850551616.html @@ -0,0 +1,58 @@ + + + + +Function BOOST_UNITS_PHYSICAL_CONSTANT + + + + + + + + + + + + + + + +
                                                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                +
                                                                                +
                                                                                +PrevUpHomeNext +
                                                                                +
                                                                                +
                                                                                +
                                                                                +

                                                                                Function BOOST_UNITS_PHYSICAL_CONSTANT

                                                                                +

                                                                                boost::units::si::constants::codata::BOOST_UNITS_PHYSICAL_CONSTANT — CODATA recommended values of the fundamental physical constants: NIST SP 961.

                                                                                +
                                                                                +

                                                                                Synopsis

                                                                                +
                                                                                // In header: <boost/units/systems/si/codata/electron_constants.hpp>
+
+
+ BOOST_UNITS_PHYSICAL_CONSTANT(m_e, quantity< mass >, 
+                               9.10938215e-31 * kilograms, 
+                               4.5e-38 * kilograms);
                                                                                +
                                                                                +

                                                                                Description

                                                                                +

                                                                                electron mass

                                                                                +
                                                                                +
                                                                                + + + +
                                                                                Copyright © 2003-2008 Matthias Christian Schabel
                                                                                Copyright © 2007-2010 Steven + Watanabe

                                                                                + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                +
                                                                                +
                                                                                +
                                                                                +PrevUpHomeNext +
                                                                                + + diff --git a/doc/html/boost/units/si/constants/codata/BOOST_UN_idm45506850637664.html b/doc/html/boost/units/si/constants/codata/BOOST_UN_idm45506850637664.html new file mode 100644 index 0000000000..6e828e92e5 --- /dev/null +++ b/doc/html/boost/units/si/constants/codata/BOOST_UN_idm45506850637664.html @@ -0,0 +1,58 @@ + + + + +Function BOOST_UNITS_PHYSICAL_CONSTANT + + + + + + + + + + + + + + + +
                                                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                +
                                                                                +
                                                                                +PrevUpHomeNext +
                                                                                +
                                                                                +
                                                                                +
                                                                                +

                                                                                Function BOOST_UNITS_PHYSICAL_CONSTANT

                                                                                +

                                                                                boost::units::si::constants::codata::BOOST_UNITS_PHYSICAL_CONSTANT — CODATA recommended values of the fundamental physical constants: NIST SP 961.

                                                                                +
                                                                                +

                                                                                Synopsis

                                                                                +
                                                                                // In header: <boost/units/systems/si/codata/deuteron_constants.hpp>
+
+
+ BOOST_UNITS_PHYSICAL_CONSTANT(m_d, quantity< mass >, 
+                               3.34358320e-27 * kilograms, 
+                               1.7e-34 * kilograms);
                                                                                +
                                                                                +

                                                                                Description

                                                                                +

                                                                                deuteron mass

                                                                                +
                                                                                +
                                                                                + + + +
                                                                                Copyright © 2003-2008 Matthias Christian Schabel
                                                                                Copyright © 2007-2010 Steven + Watanabe

                                                                                + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                +
                                                                                +
                                                                                +
                                                                                +PrevUpHomeNext +
                                                                                + + diff --git a/doc/html/boost/units/si/constants/codata/BOOST_UN_idm45506850658080.html b/doc/html/boost/units/si/constants/codata/BOOST_UN_idm45506850658080.html new file mode 100644 index 0000000000..29cb424a94 --- /dev/null +++ b/doc/html/boost/units/si/constants/codata/BOOST_UN_idm45506850658080.html @@ -0,0 +1,58 @@ + + + + +Function BOOST_UNITS_PHYSICAL_CONSTANT + + + + + + + + + + + + + + + +
                                                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                +
                                                                                +
                                                                                +PrevUpHomeNext +
                                                                                +
                                                                                +
                                                                                +
                                                                                +

                                                                                Function BOOST_UNITS_PHYSICAL_CONSTANT

                                                                                +

                                                                                boost::units::si::constants::codata::BOOST_UNITS_PHYSICAL_CONSTANT — CODATA recommended values of the fundamental physical constants: NIST SP 961.

                                                                                +
                                                                                +

                                                                                Synopsis

                                                                                +
                                                                                // In header: <boost/units/systems/si/codata/atomic-nuclear_constants.hpp>
+
+
+ BOOST_UNITS_PHYSICAL_CONSTANT(alpha, quantity< dimensionless >, 
+                               7.2973525376e-3 * dimensionless, 
+                               5.0e-12 * dimensionless);
                                                                                +
                                                                                +

                                                                                Description

                                                                                +

                                                                                fine structure constant

                                                                                +
                                                                                +
                                                                                + + + +
                                                                                Copyright © 2003-2008 Matthias Christian Schabel
                                                                                Copyright © 2007-2010 Steven + Watanabe

                                                                                + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                +
                                                                                +
                                                                                +
                                                                                +PrevUpHomeNext +
                                                                                + + diff --git a/doc/html/boost/units/si/constants/codata/BOOST_UN_idm45506850678032.html b/doc/html/boost/units/si/constants/codata/BOOST_UN_idm45506850678032.html new file mode 100644 index 0000000000..8f29ece2c8 --- /dev/null +++ b/doc/html/boost/units/si/constants/codata/BOOST_UN_idm45506850678032.html @@ -0,0 +1,58 @@ + + + + +Function BOOST_UNITS_PHYSICAL_CONSTANT + + + + + + + + + + + + + + + +
                                                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                +
                                                                                +
                                                                                +PrevUpHomeNext +
                                                                                +
                                                                                +
                                                                                +
                                                                                +

                                                                                Function BOOST_UNITS_PHYSICAL_CONSTANT

                                                                                +

                                                                                boost::units::si::constants::codata::BOOST_UNITS_PHYSICAL_CONSTANT — CODATA recommended values of the fundamental physical constants: NIST SP 961.

                                                                                +
                                                                                +

                                                                                Synopsis

                                                                                +
                                                                                // In header: <boost/units/systems/si/codata/alpha_constants.hpp>
+
+
+ BOOST_UNITS_PHYSICAL_CONSTANT(m_alpha, quantity< mass >, 
+                               6.64465620e-27 * kilograms, 
+                               3.3e-34 * kilograms);
                                                                                +
                                                                                +

                                                                                Description

                                                                                +

                                                                                alpha particle mass

                                                                                +
                                                                                +
                                                                                + + + +
                                                                                Copyright © 2003-2008 Matthias Christian Schabel
                                                                                Copyright © 2007-2010 Steven + Watanabe

                                                                                + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                +
                                                                                +
                                                                                +
                                                                                +PrevUpHomeNext +
                                                                                + + diff --git a/doc/html/boost/units/si/katals.html b/doc/html/boost/units/si/katals.html index 9436bae003..f22881e4e5 100644 --- a/doc/html/boost/units/si/katals.html +++ b/doc/html/boost/units/si/katals.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
                                                                                -PrevUpHomeNext +PrevUpHomeNext
                                                                                @@ -45,7 +45,7 @@
                                                                                -PrevUpHomeNext +PrevUpHomeNext
                                                                                diff --git a/doc/html/boost/units/si/kelvin_base_unit.html b/doc/html/boost/units/si/kelvin_base_unit.html index b7ac3f3918..61e7b94e1c 100644 --- a/doc/html/boost/units/si/kelvin_base_unit.html +++ b/doc/html/boost/units/si/kelvin_base_unit.html @@ -37,18 +37,18 @@ public base_unit< kelvin_base_unit, temperature_dimension,-5 > { - // public static functions - static std::string name(); - static std::string symbol(); + // public static functions + static std::string name(); + static std::string symbol(); };
                                                                                -

                                                                                Description

                                                                                +

                                                                                Description

                                                                                -

                                                                                -kelvin_base_unit public static functions

                                                                                +

                                                                                +kelvin_base_unit public static functions

                                                                                  -
                                                                                1. static std::string name();
                                                                                  2. -
                                                                                2. static std::string symbol();
                                                                                  3. +
                                                                                3. static std::string name();
                                                                                  4. +
                                                                                4. static std::string symbol();
                                                                                diff --git a/doc/html/boost/units/si/kilogram_idm45506849739072.html b/doc/html/boost/units/si/kilogram_idm45506849739072.html new file mode 100644 index 0000000000..7d8b7830a7 --- /dev/null +++ b/doc/html/boost/units/si/kilogram_idm45506849739072.html @@ -0,0 +1,51 @@ + + + + +Global kilogrammes_per_square_metre + + + + + + + + + + + + + + + +
                                                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                +
                                                                                +
                                                                                +PrevUpHomeNext +
                                                                                +
                                                                                +
                                                                                +
                                                                                +

                                                                                Global kilogrammes_per_square_metre

                                                                                +

                                                                                boost::units::si::kilogrammes_per_square_metre

                                                                                +
                                                                                +

                                                                                Synopsis

                                                                                +
                                                                                // In header: <boost/units/systems/si/surface_density.hpp>
+
+static const surface_density kilogrammes_per_square_metre;
                                                                                +
                                                                                + + + +
                                                                                Copyright © 2003-2008 Matthias Christian Schabel
                                                                                Copyright © 2007-2010 Steven + Watanabe

                                                                                + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                +
                                                                                +
                                                                                +
                                                                                +PrevUpHomeNext +
                                                                                + + diff --git a/doc/html/boost/units/si/kilogram_idm45506849740208.html b/doc/html/boost/units/si/kilogram_idm45506849740208.html new file mode 100644 index 0000000000..90fb2dfe6d --- /dev/null +++ b/doc/html/boost/units/si/kilogram_idm45506849740208.html @@ -0,0 +1,51 @@ + + + + +Global kilogramme_per_square_metre + + + + + + + + + + + + + + + +
                                                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                +
                                                                                +
                                                                                +PrevUpHomeNext +
                                                                                +
                                                                                +
                                                                                +
                                                                                +

                                                                                Global kilogramme_per_square_metre

                                                                                +

                                                                                boost::units::si::kilogramme_per_square_metre

                                                                                +
                                                                                +

                                                                                Synopsis

                                                                                +
                                                                                // In header: <boost/units/systems/si/surface_density.hpp>
+
+static const surface_density kilogramme_per_square_metre;
                                                                                +
                                                                                + + + +
                                                                                Copyright © 2003-2008 Matthias Christian Schabel
                                                                                Copyright © 2007-2010 Steven + Watanabe

                                                                                + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                +
                                                                                +
                                                                                +
                                                                                +PrevUpHomeNext +
                                                                                + + diff --git a/doc/html/boost/units/si/kilogram_idm45506849846464.html b/doc/html/boost/units/si/kilogram_idm45506849846464.html new file mode 100644 index 0000000000..25a4427459 --- /dev/null +++ b/doc/html/boost/units/si/kilogram_idm45506849846464.html @@ -0,0 +1,51 @@ + + + + +Global kilogrammes_per_cubic_metre + + + + + + + + + + + + + + + +
                                                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                +
                                                                                +
                                                                                +PrevUpHomeNext +
                                                                                +
                                                                                +
                                                                                +
                                                                                +

                                                                                Global kilogrammes_per_cubic_metre

                                                                                +

                                                                                boost::units::si::kilogrammes_per_cubic_metre

                                                                                +
                                                                                +

                                                                                Synopsis

                                                                                +
                                                                                // In header: <boost/units/systems/si/mass_density.hpp>
+
+static const mass_density kilogrammes_per_cubic_metre;
                                                                                +
                                                                                + + + +
                                                                                Copyright © 2003-2008 Matthias Christian Schabel
                                                                                Copyright © 2007-2010 Steven + Watanabe

                                                                                + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                +
                                                                                +
                                                                                +
                                                                                +PrevUpHomeNext +
                                                                                + + diff --git a/doc/html/boost/units/si/kilogramme_pe_idp349224048.html b/doc/html/boost/units/si/kilogramme_pe_idp349224048.html deleted file mode 100644 index a785a1d503..0000000000 --- a/doc/html/boost/units/si/kilogramme_pe_idp349224048.html +++ /dev/null @@ -1,51 +0,0 @@ - - - - -Global kilogramme_per_square_metre - - - - - - - - - - - - - - - -
                                                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                -
                                                                                -
                                                                                -PrevUpHomeNext -
                                                                                -
                                                                                -
                                                                                -
                                                                                -

                                                                                Global kilogramme_per_square_metre

                                                                                -

                                                                                boost::units::si::kilogramme_per_square_metre

                                                                                -
                                                                                -

                                                                                Synopsis

                                                                                -
                                                                                // In header: <boost/units/systems/si/surface_density.hpp>
-
-static const surface_density kilogramme_per_square_metre;
                                                                                -
                                                                                - - - -
                                                                                Copyright © 2003-2008 Matthias Christian Schabel
                                                                                Copyright © 2007-2010 Steven - Watanabe

                                                                                - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                -
                                                                                -
                                                                                -
                                                                                -PrevUpHomeNext -
                                                                                - - diff --git a/doc/html/boost/units/si/kilogramme_per_cubic_metre.html b/doc/html/boost/units/si/kilogramme_per_cubic_metre.html index ac3bb30289..a02383d79b 100644 --- a/doc/html/boost/units/si/kilogramme_per_cubic_metre.html +++ b/doc/html/boost/units/si/kilogramme_per_cubic_metre.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
                                                                                -PrevUpHomeNext +PrevUpHomeNext
                                                                                @@ -45,7 +45,7 @@
                                                                                -PrevUpHomeNext +PrevUpHomeNext
                                                                                diff --git a/doc/html/boost/units/si/kilogrammes_p_idp349117792.html b/doc/html/boost/units/si/kilogrammes_p_idp349117792.html deleted file mode 100644 index 6a52c920d6..0000000000 --- a/doc/html/boost/units/si/kilogrammes_p_idp349117792.html +++ /dev/null @@ -1,51 +0,0 @@ - - - - -Global kilogrammes_per_cubic_metre - - - - - - - - - - - - - - - -
                                                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                -
                                                                                -
                                                                                -PrevUpHomeNext -
                                                                                -
                                                                                -
                                                                                -
                                                                                -

                                                                                Global kilogrammes_per_cubic_metre

                                                                                -

                                                                                boost::units::si::kilogrammes_per_cubic_metre

                                                                                -
                                                                                -

                                                                                Synopsis

                                                                                -
                                                                                // In header: <boost/units/systems/si/mass_density.hpp>
-
-static const mass_density kilogrammes_per_cubic_metre;
                                                                                -
                                                                                - - - -
                                                                                Copyright © 2003-2008 Matthias Christian Schabel
                                                                                Copyright © 2007-2010 Steven - Watanabe

                                                                                - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                -
                                                                                -
                                                                                -
                                                                                -PrevUpHomeNext -
                                                                                - - diff --git a/doc/html/boost/units/si/kilogrammes_p_idp349225184.html b/doc/html/boost/units/si/kilogrammes_p_idp349225184.html deleted file mode 100644 index 9eaf2c0eb9..0000000000 --- a/doc/html/boost/units/si/kilogrammes_p_idp349225184.html +++ /dev/null @@ -1,51 +0,0 @@ - - - - -Global kilogrammes_per_square_metre - - - - - - - - - - - - - - - -
                                                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                -
                                                                                -
                                                                                -PrevUpHomeNext -
                                                                                -
                                                                                -
                                                                                -
                                                                                -

                                                                                Global kilogrammes_per_square_metre

                                                                                -

                                                                                boost::units::si::kilogrammes_per_square_metre

                                                                                -
                                                                                -

                                                                                Synopsis

                                                                                -
                                                                                // In header: <boost/units/systems/si/surface_density.hpp>
-
-static const surface_density kilogrammes_per_square_metre;
                                                                                -
                                                                                - - - -
                                                                                Copyright © 2003-2008 Matthias Christian Schabel
                                                                                Copyright © 2007-2010 Steven - Watanabe

                                                                                - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                -
                                                                                -
                                                                                -
                                                                                -PrevUpHomeNext -
                                                                                - - diff --git a/doc/html/boost/units/si/kilograms_per_square_meter.html b/doc/html/boost/units/si/kilograms_per_square_meter.html index c90904c94d..fce400db94 100644 --- a/doc/html/boost/units/si/kilograms_per_square_meter.html +++ b/doc/html/boost/units/si/kilograms_per_square_meter.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
                                                                                -PrevUpHomeNext +PrevUpHomeNext
                                                                                @@ -45,7 +45,7 @@
                                                                                -PrevUpHomeNext +PrevUpHomeNext
                                                                                diff --git a/doc/html/boost/units/si/meter_base_unit.html b/doc/html/boost/units/si/meter_base_unit.html index c687bc2514..a30399d44c 100644 --- a/doc/html/boost/units/si/meter_base_unit.html +++ b/doc/html/boost/units/si/meter_base_unit.html @@ -37,18 +37,18 @@ public base_unit< meter_base_unit, length_dimension,-9 > { - // public static functions - static std::string name(); - static std::string symbol(); + // public static functions + static std::string name(); + static std::string symbol(); };
                                                                                -

                                                                                Description

                                                                                +

                                                                                Description

                                                                                -

                                                                                -meter_base_unit public static functions

                                                                                +

                                                                                +meter_base_unit public static functions

                                                                                  -
                                                                                1. static std::string name();
                                                                                  2. -
                                                                                2. static std::string symbol();
                                                                                  3. +
                                                                                3. static std::string name();
                                                                                  4. +
                                                                                4. static std::string symbol();
                                                                                diff --git a/doc/html/boost/units/si/mole_base_unit.html b/doc/html/boost/units/si/mole_base_unit.html index a4687d3f3e..028cc45cda 100644 --- a/doc/html/boost/units/si/mole_base_unit.html +++ b/doc/html/boost/units/si/mole_base_unit.html @@ -37,18 +37,18 @@ public base_unit< mole_base_unit, amount_dimension,-4 > { - // public static functions - static std::string name(); - static std::string symbol(); + // public static functions + static std::string name(); + static std::string symbol(); };
                                                                                -

                                                                                Description

                                                                                +

                                                                                Description

                                                                                -

                                                                                -mole_base_unit public static functions

                                                                                +

                                                                                +mole_base_unit public static functions

                                                                                  -
                                                                                1. static std::string name();
                                                                                  2. -
                                                                                2. static std::string symbol();
                                                                                  3. +
                                                                                3. static std::string name();
                                                                                  4. +
                                                                                4. static std::string symbol();
                                                                                diff --git a/doc/html/boost/units/si/newton_per_meter.html b/doc/html/boost/units/si/newton_per_meter.html index 1b4c7a92fa..177c2a3922 100644 --- a/doc/html/boost/units/si/newton_per_meter.html +++ b/doc/html/boost/units/si/newton_per_meter.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                                                                                -PrevUpHomeNext +PrevUpHomeNext
                                                                                @@ -45,7 +45,7 @@
                                                                                -PrevUpHomeNext +PrevUpHomeNext
                                                                                diff --git a/doc/html/boost/units/si/pascal.html b/doc/html/boost/units/si/pascal.html index 2905f7db97..412d880200 100644 --- a/doc/html/boost/units/si/pascal.html +++ b/doc/html/boost/units/si/pascal.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                                                                                -PrevUpHomeNext +PrevUpHomeNext
                                                                                @@ -45,7 +45,7 @@
                                                                                -PrevUpHomeNext +PrevUpHomeNext
                                                                                diff --git a/doc/html/boost/units/si/radian.html b/doc/html/boost/units/si/radian.html index 0a222fd2c1..b4481668df 100644 --- a/doc/html/boost/units/si/radian.html +++ b/doc/html/boost/units/si/radian.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                                                                                -PrevUpHomeNext +PrevUpHomeNext
                                                                                @@ -45,7 +45,7 @@
                                                                                -PrevUpHomeNext +PrevUpHomeNext
                                                                                diff --git a/doc/html/boost/units/si/second_base_unit.html b/doc/html/boost/units/si/second_base_unit.html index 1caf13c392..a5127adc57 100644 --- a/doc/html/boost/units/si/second_base_unit.html +++ b/doc/html/boost/units/si/second_base_unit.html @@ -37,18 +37,18 @@ public base_unit< second_base_unit, time_dimension,-7 > { - // public static functions - static std::string name(); - static std::string symbol(); + // public static functions + static std::string name(); + static std::string symbol(); };
                                                                                -

                                                                                Description

                                                                                +

                                                                                Description

                                                                                -

                                                                                -second_base_unit public static functions

                                                                                +

                                                                                +second_base_unit public static functions

                                                                                  -
                                                                                1. static std::string name();
                                                                                  2. -
                                                                                2. static std::string symbol();
                                                                                  3. +
                                                                                3. static std::string name();
                                                                                  4. +
                                                                                4. static std::string symbol();
                                                                                diff --git a/doc/html/boost/units/si/siemen.html b/doc/html/boost/units/si/siemen.html index d7ee414013..323dd6378a 100644 --- a/doc/html/boost/units/si/siemen.html +++ b/doc/html/boost/units/si/siemen.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                                                                                -PrevUpHomeNext +PrevUpHomeNext
                                                                                @@ -45,7 +45,7 @@
                                                                                -PrevUpHomeNext +PrevUpHomeNext
                                                                                diff --git a/doc/html/boost/units/si/watts.html b/doc/html/boost/units/si/watts.html index 2a540ab40b..b0ce3c6e43 100644 --- a/doc/html/boost/units/si/watts.html +++ b/doc/html/boost/units/si/watts.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
                                                                                -PrevUpHomeNext +PrevUpHomeNext
                                                                                @@ -45,7 +45,7 @@
                                                                                -PrevUpHomeNext +PrevUpHomeNext
                                                                                diff --git a/doc/html/boost/units/static_abs.html b/doc/html/boost/units/static_abs.html index 2415736053..255de05024 100644 --- a/doc/html/boost/units/static_abs.html +++ b/doc/html/boost/units/static_abs.html @@ -35,15 +35,15 @@ template<integer_type Value> struct static_abs { - // public member functions - BOOST_STATIC_CONSTANT(integer_type); + // public member functions + BOOST_STATIC_CONSTANT(integer_type); };
                                                                                -

                                                                                Description

                                                                                +

                                                                                Description

                                                                                -

                                                                                -static_abs public member functions

                                                                                -
                                                                                1.  BOOST_STATIC_CONSTANT(integer_type);
                                                                                +

                                                                                +static_abs public member functions

                                                                                +
                                                                                1.  BOOST_STATIC_CONSTANT(integer_type);
                                                                                diff --git a/doc/html/boost/units/static_rational.html b/doc/html/boost/units/static_rational.html index 3fc25d0232..3ff6558645 100644 --- a/doc/html/boost/units/static_rational.html +++ b/doc/html/boost/units/static_rational.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
                                                                                -PrevUpHomeNext +PrevUpHomeNext
                                                                                @@ -40,18 +40,18 @@ typedef static_rational< Numerator, Denominator > type; // static_rational<N,D> reduced by GCD // construct/copy/destruct - static_rational(); + static_rational(); - // public static functions - static integer_type numerator(); - static integer_type denominator(); + // public static functions + static integer_type numerator(); + static integer_type denominator(); // public data members static const integer_type Numerator; static const integer_type Denominator; };
                                                                                -

                                                                                Description

                                                                                +

                                                                                Description

                                                                                This is an implementation of a compile time rational number, where static_rational<N,D> represents a rational number with numerator N and denominator D. Because of the potential for ambiguity arising from multiple equivalent values of static_rational (e.g. static_rational<6,2>==static_rational<3>), static rationals should always be accessed through static_rational<N,D>::type. Template specialization prevents instantiation of zero denominators (i.e. static_rational<N,0>). The following compile-time arithmetic operators are provided for static_rational variables only (no operators are defined between long and static_rational):

                                                                                • mpl::negate

                                                                                  • @@ -64,18 +64,18 @@

                                                                                  Neither static_power nor static_root are defined for static_rational. This is because template types may not be floating point values, while powers and roots of rational numbers can produce floating point values.

                                                                                  -

                                                                                  +

                                                                                  static_rational public construct/copy/destruct

                                                                                  -
                                                                                  1. static_rational();
                                                                                  +
                                                                                  1. static_rational();
                                                                                  -

                                                                                  -static_rational public static functions

                                                                                  +

                                                                                  +static_rational public static functions

                                                                                    -
                                                                                  1. static integer_type numerator();
                                                                                    2. -
                                                                                  2. static integer_type denominator();
                                                                                    3. +
                                                                                  3. static integer_type numerator();
                                                                                    4. +
                                                                                  4. static integer_type denominator();
                                                                                @@ -91,7 +91,7 @@
                                                                                -PrevUpHomeNext +PrevUpHomeNext
                                                                                diff --git a/doc/html/boost/units/subtract_idm45506851367776.html b/doc/html/boost/units/subtract_idm45506851367776.html new file mode 100644 index 0000000000..fa58bab818 --- /dev/null +++ b/doc/html/boost/units/subtract_idm45506851367776.html @@ -0,0 +1,54 @@ + + + + +Struct template subtract_typeof_helper<quantity< unit< Dim1, System1 >, X >, quantity< unit< Dim2, System2 >, Y >> + + + + + + + + + + + + + + + +
                                                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                +
                                                                                +
                                                                                +PrevUpHomeNext +
                                                                                +
                                                                                +
                                                                                +
                                                                                +

                                                                                Struct template subtract_typeof_helper<quantity< unit< Dim1, System1 >, X >, quantity< unit< Dim2, System2 >, Y >>

                                                                                +

                                                                                boost::units::subtract_typeof_helper<quantity< unit< Dim1, System1 >, X >, quantity< unit< Dim2, System2 >, Y >>

                                                                                +
                                                                                +

                                                                                Synopsis

                                                                                +
                                                                                // In header: <boost/units/quantity.hpp>
+
+template<typename Dim1, typename System1, typename Dim2, typename System2, 
+         typename X, typename Y> 
+struct subtract_typeof_helper<quantity< unit< Dim1, System1 >, X >, quantity< unit< Dim2, System2 >, Y >> {
+};
                                                                                +
                                                                                + + + +
                                                                                Copyright © 2003-2008 Matthias Christian Schabel
                                                                                Copyright © 2007-2010 Steven + Watanabe

                                                                                + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                +
                                                                                +
                                                                                +
                                                                                +PrevUpHomeNext +
                                                                                + + diff --git a/doc/html/boost/units/subtract_idm45506851375984.html b/doc/html/boost/units/subtract_idm45506851375984.html new file mode 100644 index 0000000000..305499c325 --- /dev/null +++ b/doc/html/boost/units/subtract_idm45506851375984.html @@ -0,0 +1,57 @@ + + + + +Struct template subtract_typeof_helper<quantity< unit< Dim, System >, X >, quantity< unit< Dim, System >, Y >> + + + + + + + + + + + + + + + +
                                                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                +
                                                                                +
                                                                                +PrevUpHomeNext +
                                                                                +
                                                                                +
                                                                                +
                                                                                +

                                                                                Struct template subtract_typeof_helper<quantity< unit< Dim, System >, X >, quantity< unit< Dim, System >, Y >>

                                                                                +

                                                                                boost::units::subtract_typeof_helper<quantity< unit< Dim, System >, X >, quantity< unit< Dim, System >, Y >>

                                                                                +
                                                                                +

                                                                                Synopsis

                                                                                +
                                                                                // In header: <boost/units/quantity.hpp>
+
+template<typename Dim, typename System, typename X, typename Y> 
+struct subtract_typeof_helper<quantity< unit< Dim, System >, X >, quantity< unit< Dim, System >, Y >> {
+  // types
+  typedef subtract_typeof_helper< X, Y >::type value_type;
+  typedef unit< Dim, System >                  unit_type; 
+  typedef quantity< unit_type, value_type >    type;      
+};
                                                                                +
                                                                                + + + +
                                                                                Copyright © 2003-2008 Matthias Christian Schabel
                                                                                Copyright © 2007-2010 Steven + Watanabe

                                                                                + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                +
                                                                                +
                                                                                +
                                                                                +PrevUpHomeNext +
                                                                                + + diff --git a/doc/html/boost/units/subtract_type_idp347588272.html b/doc/html/boost/units/subtract_type_idp347588272.html deleted file mode 100644 index e92ac95837..0000000000 --- a/doc/html/boost/units/subtract_type_idp347588272.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Struct template subtract_typeof_helper<quantity< unit< Dim, System >, X >, quantity< unit< Dim, System >, Y >> - - - - - - - - - - - - - - - -
                                                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                -
                                                                                -
                                                                                -PrevUpHomeNext -
                                                                                -
                                                                                -
                                                                                -
                                                                                -

                                                                                Struct template subtract_typeof_helper<quantity< unit< Dim, System >, X >, quantity< unit< Dim, System >, Y >>

                                                                                -

                                                                                boost::units::subtract_typeof_helper<quantity< unit< Dim, System >, X >, quantity< unit< Dim, System >, Y >>

                                                                                -
                                                                                -

                                                                                Synopsis

                                                                                -
                                                                                // In header: <boost/units/quantity.hpp>
-
-template<typename Dim, typename System, typename X, typename Y> 
-struct subtract_typeof_helper<quantity< unit< Dim, System >, X >, quantity< unit< Dim, System >, Y >> {
-  // types
-  typedef subtract_typeof_helper< X, Y >::type value_type;
-  typedef unit< Dim, System >                  unit_type; 
-  typedef quantity< unit_type, value_type >    type;      
-};
                                                                                -
                                                                                - - - -
                                                                                Copyright © 2003-2008 Matthias Christian Schabel
                                                                                Copyright © 2007-2010 Steven - Watanabe

                                                                                - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                -
                                                                                -
                                                                                -
                                                                                -PrevUpHomeNext -
                                                                                - - diff --git a/doc/html/boost/units/subtract_type_idp347596480.html b/doc/html/boost/units/subtract_type_idp347596480.html deleted file mode 100644 index b9fdaca183..0000000000 --- a/doc/html/boost/units/subtract_type_idp347596480.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template subtract_typeof_helper<quantity< unit< Dim1, System1 >, X >, quantity< unit< Dim2, System2 >, Y >> - - - - - - - - - - - - - - - -
                                                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                -
                                                                                -
                                                                                -PrevUpHomeNext -
                                                                                -
                                                                                -
                                                                                -
                                                                                -

                                                                                Struct template subtract_typeof_helper<quantity< unit< Dim1, System1 >, X >, quantity< unit< Dim2, System2 >, Y >>

                                                                                -

                                                                                boost::units::subtract_typeof_helper<quantity< unit< Dim1, System1 >, X >, quantity< unit< Dim2, System2 >, Y >>

                                                                                -
                                                                                -

                                                                                Synopsis

                                                                                -
                                                                                // In header: <boost/units/quantity.hpp>
-
-template<typename Dim1, typename System1, typename Dim2, typename System2, 
-         typename X, typename Y> 
-struct subtract_typeof_helper<quantity< unit< Dim1, System1 >, X >, quantity< unit< Dim2, System2 >, Y >> {
-};
                                                                                -
                                                                                - - - -
                                                                                Copyright © 2003-2008 Matthias Christian Schabel
                                                                                Copyright © 2007-2010 Steven - Watanabe

                                                                                - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                -
                                                                                -
                                                                                -
                                                                                -PrevUpHomeNext -
                                                                                - - diff --git a/doc/html/boost/units/subtract_typeof_helper.html b/doc/html/boost/units/subtract_typeof_helper.html index 1b93abd6cc..36f5b45e45 100644 --- a/doc/html/boost/units/subtract_typeof_helper.html +++ b/doc/html/boost/units/subtract_typeof_helper.html @@ -35,15 +35,15 @@ template<typename X, typename Y> struct subtract_typeof_helper { - // public member functions - typedef typeof((typeof_::make< X >()-typeof_::make< Y >())); + // public member functions + typedef typeof((typeof_::make< X >()-typeof_::make< Y >())); };
                                                                                -

                                                                                Description

                                                                                +

                                                                                Description

                                                                                -

                                                                                -subtract_typeof_helper public member functions

                                                                                -
                                                                                1. typedef typeof((typeof_::make< X >()-typeof_::make< Y >()));
                                                                                +

                                                                                +subtract_typeof_helper public member functions

                                                                                +
                                                                                1. typedef typeof((typeof_::make< X >()-typeof_::make< Y >()));
                                                                                diff --git a/doc/html/boost/units/temperature/celsius_base_unit.html b/doc/html/boost/units/temperature/celsius_base_unit.html index 9ca2561dc2..64ed38fa0d 100644 --- a/doc/html/boost/units/temperature/celsius_base_unit.html +++ b/doc/html/boost/units/temperature/celsius_base_unit.html @@ -37,18 +37,18 @@ public base_unit< celsius_base_unit, temperature_dimension,-1008 > { - // public static functions - static std::string name(); - static std::string symbol(); + // public static functions + static std::string name(); + static std::string symbol(); };
                                                                                -

                                                                                Description

                                                                                +

                                                                                Description

                                                                                -

                                                                                -celsius_base_unit public static functions

                                                                                +

                                                                                +celsius_base_unit public static functions

                                                                                  -
                                                                                1. static std::string name();
                                                                                  2. -
                                                                                2. static std::string symbol();
                                                                                  3. +
                                                                                3. static std::string name();
                                                                                  4. +
                                                                                4. static std::string symbol();
                                                                                diff --git a/doc/html/boost/units/temperature/fahrenheit_base_unit.html b/doc/html/boost/units/temperature/fahrenheit_base_unit.html index 1366415295..871c1b62fd 100644 --- a/doc/html/boost/units/temperature/fahrenheit_base_unit.html +++ b/doc/html/boost/units/temperature/fahrenheit_base_unit.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
                                                                                -PrevUpHomeNext +PrevUpHomeNext
                                                                                @@ -37,18 +37,18 @@ public base_unit< fahrenheit_base_unit, temperature_dimension,-1007 > { - // public static functions - static std::string name(); - static std::string symbol(); + // public static functions + static std::string name(); + static std::string symbol(); };
                                                                                -

                                                                                Description

                                                                                +

                                                                                Description

                                                                                -

                                                                                -fahrenheit_base_unit public static functions

                                                                                +

                                                                                +fahrenheit_base_unit public static functions

                                                                                  -
                                                                                1. static std::string name();
                                                                                  2. -
                                                                                2. static std::string symbol();
                                                                                  3. +
                                                                                3. static std::string name();
                                                                                  4. +
                                                                                4. static std::string symbol();
                                                                                @@ -64,7 +64,7 @@
                                                                                -PrevUpHomeNext +PrevUpHomeNext
                                                                                diff --git a/doc/html/boost/units/unary_minus_typeof_helper.html b/doc/html/boost/units/unary_minus_typeof_helper.html index ada278b7d7..e0af00ec15 100644 --- a/doc/html/boost/units/unary_minus_typeof_helper.html +++ b/doc/html/boost/units/unary_minus_typeof_helper.html @@ -35,15 +35,15 @@ template<typename X> struct unary_minus_typeof_helper { - // public member functions - typedef typeof((-typeof_::make< X >())); + // public member functions + typedef typeof((-typeof_::make< X >())); };
                                                                              -

                                                                              Description

                                                                              +

                                                                              Description

                                                                              -

                                                                              -unary_minus_typeof_helper public member functions

                                                                              -
                                                                              1. typedef typeof((-typeof_::make< X >()));
                                                                              +

                                                                              +unary_minus_typeof_helper public member functions

                                                                              +
                                                                              1. typedef typeof((-typeof_::make< X >()));
                                                                              diff --git a/doc/html/boost/units/unary_plus_typeof_helper.html b/doc/html/boost/units/unary_plus_typeof_helper.html index 8c77647c5c..49a5808e9a 100644 --- a/doc/html/boost/units/unary_plus_typeof_helper.html +++ b/doc/html/boost/units/unary_plus_typeof_helper.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
                                                                              -PrevUpHomeNext +PrevUpHomeNext
                                                                              @@ -35,15 +35,15 @@ template<typename X> struct unary_plus_typeof_helper { - // public member functions - typedef typeof((+typeof_::make< X >())); + // public member functions + typedef typeof((+typeof_::make< X >())); };
                                                                              -

                                                                              Description

                                                                              +

                                                                              Description

                                                                              -

                                                                              -unary_plus_typeof_helper public member functions

                                                                              -
                                                                              1. typedef typeof((+typeof_::make< X >()));
                                                                              +

                                                                              +unary_plus_typeof_helper public member functions

                                                                              +
                                                                              1. typedef typeof((+typeof_::make< X >()));
                                                                              @@ -58,7 +58,7 @@
                                                                              -PrevUpHomeNext +PrevUpHomeNext
                                                                              diff --git a/doc/html/boost/units/unit.html b/doc/html/boost/units/unit.html index 33e9458dc3..b687324941 100644 --- a/doc/html/boost/units/unit.html +++ b/doc/html/boost/units/unit.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                                                                              -PrevUpHomeNext +PrevUpHomeNext
                                                                              @@ -42,22 +42,22 @@ typedef System system_type; // construct/copy/destruct - unit(); - unit(const this_type &); - this_type & operator=(const this_type &); + unit(); + unit(const this_type &); + this_type & operator=(const this_type &); };
                                                                              -

                                                                              Description

                                                                              +

                                                                              Description

                                                                              (e.g. meters, Kelvin, feet, etc...)

                                                                              -

                                                                              +

                                                                              unit public construct/copy/destruct

                                                                                -
                                                                              1. unit();
                                                                                2. -
                                                                              2. unit(const this_type &);
                                                                                3. -
                                                                              3. this_type & operator=(const this_type &);
                                                                                4. +
                                                                              4. unit();
                                                                                5. +
                                                                              5. unit(const this_type &);
                                                                                6. +
                                                                              6. this_type & operator=(const this_type &);
                                                                              @@ -73,7 +73,7 @@
                                                                              -PrevUpHomeNext +PrevUpHomeNext
                                                                              diff --git a/doc/html/boost/units/us/pint_base_unit.html b/doc/html/boost/units/us/pint_base_unit.html index 087ff77fb5..82062066b6 100644 --- a/doc/html/boost/units/us/pint_base_unit.html +++ b/doc/html/boost/units/us/pint_base_unit.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                                                                              -PrevUpHomeNext +PrevUpHomeNext
                                                                              @@ -36,18 +36,18 @@ struct pint_base_unit : public boost::units::base_unit< pint_base_unit, si::volume::dimension_type,-503 > { - // public static functions - static const char * name(); - static const char * symbol(); + // public static functions + static const char * name(); + static const char * symbol(); };
                                                                              -

                                                                              Description

                                                                              +

                                                                              Description

                                                                              -

                                                                              -pint_base_unit public static functions

                                                                              +

                                                                              +pint_base_unit public static functions

                                                                                -
                                                                              1. static const char * name();
                                                                                2. -
                                                                              2. static const char * symbol();
                                                                                3. +
                                                                              3. static const char * name();
                                                                                4. +
                                                                              4. static const char * symbol();
                                                                              @@ -63,7 +63,7 @@
                                                                              -PrevUpHomeNext +PrevUpHomeNext
                                                                              diff --git a/doc/html/boost/units/us/pound_base_unit.html b/doc/html/boost/units/us/pound_base_unit.html index 7803c30414..321aec093e 100644 --- a/doc/html/boost/units/us/pound_base_unit.html +++ b/doc/html/boost/units/us/pound_base_unit.html @@ -36,18 +36,18 @@ struct pound_base_unit : public boost::units::base_unit< pound_base_unit, cgs::gram_base_unit::dimension_type,-502 > { - // public static functions - static const char * name(); - static const char * symbol(); + // public static functions + static const char * name(); + static const char * symbol(); };
                                                                              -

                                                                              Description

                                                                              +

                                                                              Description

                                                                              -

                                                                              -pound_base_unit public static functions

                                                                              +

                                                                              +pound_base_unit public static functions

                                                                                -
                                                                              1. static const char * name();
                                                                                2. -
                                                                              2. static const char * symbol();
                                                                                3. +
                                                                              3. static const char * name();
                                                                                4. +
                                                                              4. static const char * symbol();
                                                                              diff --git a/doc/html/boost/units/us/pound_force_base_unit.html b/doc/html/boost/units/us/pound_force_base_unit.html index d45c7ae0bf..3bbaedffa6 100644 --- a/doc/html/boost/units/us/pound_force_base_unit.html +++ b/doc/html/boost/units/us/pound_force_base_unit.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
                                                                              -PrevUpHomeNext +PrevUpHomeNext
                                                                              @@ -36,18 +36,18 @@ struct pound_force_base_unit : public boost::units::base_unit< pound_force_base_unit, si::force::dimension_type,-600 > { - // public static functions - static const char * name(); - static const char * symbol(); + // public static functions + static const char * name(); + static const char * symbol(); };
                                                                              -

                                                                              Description

                                                                              +

                                                                              Description

                                                                              -

                                                                              -pound_force_base_unit public static functions

                                                                              +

                                                                              +pound_force_base_unit public static functions

                                                                                -
                                                                              1. static const char * name();
                                                                                2. -
                                                                              2. static const char * symbol();
                                                                                3. +
                                                                              3. static const char * name();
                                                                                4. +
                                                                              4. static const char * symbol();
                                                                              @@ -63,7 +63,7 @@
                                                                              -PrevUpHomeNext +PrevUpHomeNext
                                                                              diff --git a/doc/html/boost/units/us/yard_base_unit.html b/doc/html/boost/units/us/yard_base_unit.html index 8c255f4ad1..5e35648993 100644 --- a/doc/html/boost/units/us/yard_base_unit.html +++ b/doc/html/boost/units/us/yard_base_unit.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                                                                              -PrevUpHomeNext +PrevUpHomeNext
                                                                              @@ -36,18 +36,18 @@ struct yard_base_unit : public boost::units::base_unit< yard_base_unit, si::meter_base_unit::dimension_type,-501 > { - // public static functions - static const char * name(); - static const char * symbol(); + // public static functions + static const char * name(); + static const char * symbol(); };
                                                                              -

                                                                              Description

                                                                              +

                                                                              Description

                                                                              -

                                                                              -yard_base_unit public static functions

                                                                              +

                                                                              +yard_base_unit public static functions

                                                                                -
                                                                              1. static const char * name();
                                                                                2. -
                                                                              2. static const char * symbol();
                                                                                3. +
                                                                              3. static const char * name();
                                                                                4. +
                                                                              4. static const char * symbol();
                                                                              @@ -63,7 +63,7 @@
                                                                              -PrevUpHomeNext +PrevUpHomeNext
                                                                              diff --git a/doc/html/boost/unordered_map.html b/doc/html/boost/unordered_map.html index 46854082ba..db0627eb4d 100644 --- a/doc/html/boost/unordered_map.html +++ b/doc/html/boost/unordered_map.html @@ -58,113 +58,113 @@ typedef implementation-defined const_local_iterator; // construct/copy/destruct - explicit unordered_map(size_type = implementation-defined, + explicit unordered_map(size_type = implementation-defined, hasher const& = hasher(), key_equal const& = key_equal(), allocator_type const& = allocator_type()); template<typename InputIterator> - unordered_map(InputIterator, InputIterator, + unordered_map(InputIterator, InputIterator, size_type = implementation-defined, hasher const& = hasher(), key_equal const& = key_equal(), allocator_type const& = allocator_type()); - unordered_map(unordered_map const&); - unordered_map(unordered_map &&); - explicit unordered_map(Allocator const&); - unordered_map(unordered_map const&, Allocator const&); - ~unordered_map(); - unordered_map& operator=(unordered_map const&); - unordered_map& operator=(unordered_map &&); - allocator_type get_allocator() const; + unordered_map(unordered_map const&); + unordered_map(unordered_map &&); + explicit unordered_map(Allocator const&); + unordered_map(unordered_map const&, Allocator const&); + ~unordered_map(); + unordered_map& operator=(unordered_map const&); + unordered_map& operator=(unordered_map &&); + allocator_type get_allocator() const; - // size and capacity - bool empty() const; - size_type size() const; - size_type max_size() const; + // size and capacity + bool empty() const; + size_type size() const; + size_type max_size() const; - // iterators - iterator begin(); - const_iterator begin() const; - iterator end(); - const_iterator end() const; - const_iterator cbegin() const; - const_iterator cend() const; + // iterators + iterator begin(); + const_iterator begin() const; + iterator end(); + const_iterator end() const; + const_iterator cbegin() const; + const_iterator cend() const; - // modifiers - template<typename... Args> std::pair<iterator, bool> emplace(Args&&...); - template<typename... Args> iterator emplace_hint(const_iterator, Args&&...); - std::pair<iterator, bool> insert(value_type const&); - std::pair<iterator, bool> insert(value_type&&); - iterator insert(const_iterator, value_type const&); - iterator insert(const_iterator, value_type&&); - template<typename InputIterator> void insert(InputIterator, InputIterator); - iterator erase(const_iterator); - size_type erase(key_type const&); - iterator erase(const_iterator, const_iterator); - void quick_erase(const_iterator); - void erase_return_void(const_iterator); - void clear(); - void swap(unordered_map&); + // modifiers + template<typename... Args> std::pair<iterator, bool> emplace(Args&&...); + template<typename... Args> iterator emplace_hint(const_iterator, Args&&...); + std::pair<iterator, bool> insert(value_type const&); + std::pair<iterator, bool> insert(value_type&&); + iterator insert(const_iterator, value_type const&); + iterator insert(const_iterator, value_type&&); + template<typename InputIterator> void insert(InputIterator, InputIterator); + iterator erase(const_iterator); + size_type erase(key_type const&); + iterator erase(const_iterator, const_iterator); + void quick_erase(const_iterator); + void erase_return_void(const_iterator); + void clear(); + void swap(unordered_map&); - // observers - hasher hash_function() const; - key_equal key_eq() const; + // observers + hasher hash_function() const; + key_equal key_eq() const; - // lookup - iterator find(key_type const&); - const_iterator find(key_type const&) const; + // lookup + iterator find(key_type const&); + const_iterator find(key_type const&) const; template<typename CompatibleKey, typename CompatibleHash, typename CompatiblePredicate> - iterator find(CompatibleKey const&, CompatibleHash const&, + iterator find(CompatibleKey const&, CompatibleHash const&, CompatiblePredicate const&); template<typename CompatibleKey, typename CompatibleHash, typename CompatiblePredicate> const_iterator - find(CompatibleKey const&, CompatibleHash const&, + find(CompatibleKey const&, CompatibleHash const&, CompatiblePredicate const&) const; - size_type count(key_type const&) const; - std::pair<iterator, iterator> equal_range(key_type const&); - std::pair<const_iterator, const_iterator> equal_range(key_type const&) const; - mapped_type& operator[](key_type const&); - Mapped& at(key_type const&); - Mapped const& at(key_type const&) const; + size_type count(key_type const&) const; + std::pair<iterator, iterator> equal_range(key_type const&); + std::pair<const_iterator, const_iterator> equal_range(key_type const&) const; + mapped_type& operator[](key_type const&); + Mapped& at(key_type const&); + Mapped const& at(key_type const&) const; - // bucket interface - size_type bucket_count() const; - size_type max_bucket_count() const; - size_type bucket_size(size_type) const; - size_type bucket(key_type const&) const; - local_iterator begin(size_type); - const_local_iterator begin(size_type) const; - local_iterator end(size_type); - const_local_iterator end(size_type) const; - const_local_iterator cbegin(size_type) const; - const_local_iterator cend(size_type); + // bucket interface + size_type bucket_count() const; + size_type max_bucket_count() const; + size_type bucket_size(size_type) const; + size_type bucket(key_type const&) const; + local_iterator begin(size_type); + const_local_iterator begin(size_type) const; + local_iterator end(size_type); + const_local_iterator end(size_type) const; + const_local_iterator cbegin(size_type) const; + const_local_iterator cend(size_type); - // hash policy - float load_factor() const; - float max_load_factor() const; - void max_load_factor(float); - void rehash(size_type); - void reserve(size_type); + // hash policy + float load_factor() const; + float max_load_factor() const; + void max_load_factor(float); + void rehash(size_type); + void reserve(size_type); }; -// Equality Comparisons +// Equality Comparisons template<typename Key, typename Mapped, typename Hash, typename Pred, typename Alloc> - bool operator==(unordered_map<Key, Mapped, Hash, Pred, Alloc> const&, + bool operator==(unordered_map<Key, Mapped, Hash, Pred, Alloc> const&, unordered_map<Key, Mapped, Hash, Pred, Alloc> const&); template<typename Key, typename Mapped, typename Hash, typename Pred, typename Alloc> - bool operator!=(unordered_map<Key, Mapped, Hash, Pred, Alloc> const&, + bool operator!=(unordered_map<Key, Mapped, Hash, Pred, Alloc> const&, unordered_map<Key, Mapped, Hash, Pred, Alloc> const&); -// swap +// swap template<typename Key, typename Mapped, typename Hash, typename Pred, typename Alloc> - void swap(unordered_map<Key, Mapped, Hash, Pred, Alloc>&, + void swap(unordered_map<Key, Mapped, Hash, Pred, Alloc>&, unordered_map<Key, Mapped, Hash, Pred, Alloc>&);
                                                                            -

                                                                            Description

                                                                            +

                                                                            Description

                                                                            Template Parameters

                                                                            @@ -206,7 +206,7 @@

                                                                            The elements are organized into buckets. Keys with the same hash code are stored in the same bucket.

                                                                            The number of buckets can be automatically increased by a call to insert, or as the result of calling rehash.

                                                                            -

                                                                            +

                                                                            unordered_map public types

                                                                            @@ -267,13 +267,13 @@
                                                                            -

                                                                            +

                                                                            unordered_map public construct/copy/destruct

                                                                            1. -
                                                                              explicit unordered_map(size_type n = implementation-defined, 
+
                                                                              explicit unordered_map(size_type n = implementation-defined, 
                        hasher const& hf = hasher(), 
                        key_equal const& eq = key_equal(), 
                        allocator_type const& a = allocator_type());
                                                                              
@@ -286,7 +286,7 @@
                                                                            - + @@ -299,7 +299,7 @@ 
                                                                          5. template<typename InputIterator> 
-  unordered_map(InputIterator f, InputIterator l, 
+  unordered_map(InputIterator f, InputIterator l, 
                 size_type n = implementation-defined, 
                 hasher const& hf = hasher(), 
                 key_equal const& eq = key_equal(), 
@@ -319,7 +319,7 @@

                                                                            6. Postconditions:

                                                                            		size() == 0size() == 0

                                                                            Requires:
                                                                          6. -
                                                                            unordered_map(unordered_map const&);
                                                                            +
                                                                            unordered_map(unordered_map const&);

                                                                            The copy constructor. Copies the contained elements, hash function, predicate, maximum load factor and allocator.

                                                                            If Allocator::select_on_container_copy_construction exists and has the right signature, the allocator will be @@ -336,7 +336,7 @@

                                                                          7. -
                                                                            unordered_map(unordered_map &&);
                                                                            +
                                                                            unordered_map(unordered_map &&);

                                                                            The move constructor.

                                                                            @@ -367,15 +367,15 @@
                                                                          8. -
                                                                            explicit unordered_map(Allocator const& a);
                                                                            +
                                                                            explicit unordered_map(Allocator const& a);

                                                                            Constructs an empty container, using allocator a.

                                                                          9. -
                                                                            unordered_map(unordered_map const& x, Allocator const& a);
                                                                            +
                                                                            unordered_map(unordered_map const& x, Allocator const& a);

                                                                            Constructs an container, copying x's contained elements, hash function, predicate, maximum load factor, but using allocator a.

                                                                          10. -
                                                                            ~unordered_map();
                                                                            +
                                                                            ~unordered_map();
                                                                            @@ -389,7 +389,7 @@ -
                                                                            unordered_map& operator=(unordered_map const&);
                                                                            +
                                                                            unordered_map& operator=(unordered_map const&);

                                                                            The assignment operator. Copies the contained elements, hash function, predicate and maximum load factor but not the allocator.

                                                                            If Alloc::propagate_on_container_copy_assignment exists and Alloc::propagate_on_container_copy_assignment::value @@ -406,7 +406,7 @@

                                                                            value_type is copy constructible
                                                                            -
                                                                            unordered_map& operator=(unordered_map &&);
                                                                            +
                                                                            unordered_map& operator=(unordered_map &&);

                                                                            The move assignment operator.

                                                                            If Alloc::propagate_on_container_move_assignment exists and Alloc::propagate_on_container_move_assignment::value @@ -435,13 +435,13 @@

                                                                            11. -
                                                                            allocator_type get_allocator() const;
                                                                            +
                                                                            allocator_type get_allocator() const;
                                                                            -

                                                                            -unordered_map size and capacity

                                                                            +

                                                                            +unordered_map size and capacity

                                                                            1. -
                                                                              bool empty() const;
                                                                              +
                                                                              bool empty() const;
                                                                              @@ -449,12 +449,12 @@ - +

                                                                              Returns:

                                                                              		size() == 0size() == 0
                                                                            2. -
                                                                              size_type size() const;
                                                                              +
                                                                              size_type size() const;
                                                                              @@ -462,12 +462,12 @@ - +

                                                                              Returns:

                                                                              		std::distance(begin(), end())std::distance(begin(), end())
                                                                            3. -
                                                                              size_type max_size() const;
                                                                              +
                                                                              size_type max_size() const;
                                                                              @@ -476,7 +476,7 @@

                                                                              Returns:

                                                                              		 -size() of the largest possible container. +size() of the largest possible container.
                                                                              @@ -484,12 +484,12 @@
                                                                            -

                                                                            -unordered_map iterators

                                                                            +

                                                                            +unordered_map iterators

                                                                            1. -
                                                                              iterator begin();
-const_iterator begin() const;
                                                                              +
                                                                              iterator begin();
+const_iterator begin() const;
                                                                              @@ -503,8 +503,8 @@
                                                                            2. -
                                                                              iterator end();
-const_iterator end() const;
                                                                              +
                                                                              iterator end();
+const_iterator end() const;
                                                                              @@ -518,7 +518,7 @@
                                                                            3. -
                                                                              const_iterator cbegin() const;
                                                                              +
                                                                              const_iterator cbegin() const;
                                                                              @@ -532,7 +532,7 @@
                                                                            4. -
                                                                              const_iterator cend() const;
                                                                              +
                                                                              const_iterator cend() const;
                                                                              @@ -548,11 +548,11 @@
                                                                              -

                                                                              -unordered_map modifiers

                                                                              +

                                                                              +unordered_map modifiers

                                                                              1. -
                                                                                template<typename... Args> std::pair<iterator, bool> emplace(Args&&... args);
                                                                                +
                                                                                template<typename... Args> std::pair<iterator, bool> emplace(Args&&... args);

                                                                                Inserts an object, constructed with the arguments args, in the container if and only if there is no element in the container with an equivalent key.

                                                                              @@ -595,7 +595,7 @@ 
                                                                            5. template<typename... Args> 
-  iterator emplace_hint(const_iterator hint, Args&&... args);
                                                                              + iterator emplace_hint(const_iterator hint, Args&&... args);

                                                                              Inserts an object, constructed with the arguments args, in the container if and only if there is no element in the container with an equivalent key.

                                                                              hint is a suggestion to where the element should be inserted.

                                                                              6. @@ -636,7 +636,7 @@
                                                                            6. -
                                                                              std::pair<iterator, bool> insert(value_type const& obj);
                                                                              +
                                                                              std::pair<iterator, bool> insert(value_type const& obj);

                                                                              Inserts obj in the container if and only if there is no element in the container with an equivalent key.

                                                                              @@ -670,7 +670,7 @@
                                                                            7. -
                                                                              std::pair<iterator, bool> insert(value_type&& obj);
                                                                              +
                                                                              std::pair<iterator, bool> insert(value_type&& obj);

                                                                              Inserts obj in the container if and only if there is no element in the container with an equivalent key.

                                                                              @@ -704,7 +704,7 @@
                                                                            8. -
                                                                              iterator insert(const_iterator hint, value_type const& obj);
                                                                              +
                                                                              iterator insert(const_iterator hint, value_type const& obj);

                                                                              Inserts obj in the container if and only if there is no element in the container with an equivalent key.

                                                                              hint is a suggestion to where the element should be inserted.

                                                                              @@ -737,7 +737,7 @@
                                                                            9. -
                                                                              iterator insert(const_iterator hint, value_type&& obj);
                                                                              +
                                                                              iterator insert(const_iterator hint, value_type&& obj);

                                                                              Inserts obj in the container if and only if there is no element in the container with an equivalent key.

                                                                              hint is a suggestion to where the element should be inserted.

                                                                              @@ -771,7 +771,7 @@ 
                                                                            10. template<typename InputIterator> 
-  void insert(InputIterator first, InputIterator last);
                                                                              + void insert(InputIterator first, InputIterator last);

                                                                              Inserts a range of elements into the container. Elements are inserted if and only if there is no element in the container with an equivalent key.

                                                                              11. @@ -799,7 +799,7 @@
                                                                            11. -
                                                                              iterator erase(const_iterator position);
                                                                              +
                                                                              iterator erase(const_iterator position);

                                                                              Erase the element pointed to by position.

                                                                              @@ -828,7 +828,7 @@
                                                                            12. -
                                                                              size_type erase(key_type const& k);
                                                                              +
                                                                              size_type erase(key_type const& k);

                                                                              Erase all elements with key equivalent to k.

                                                                              @@ -848,7 +848,7 @@
                                                                            13. -
                                                                              iterator erase(const_iterator first, const_iterator last);
                                                                              +
                                                                              iterator erase(const_iterator first, const_iterator last);

                                                                              Erases the elements in the range from first to last.

                                                                              @@ -871,7 +871,7 @@
                                                                            14. -
                                                                              void quick_erase(const_iterator position);
                                                                              +
                                                                              void quick_erase(const_iterator position);

                                                                              Erase the element pointed to by position.

                                                                              @@ -899,7 +899,7 @@
                                                                            15. -
                                                                              void erase_return_void(const_iterator position);
                                                                              +
                                                                              void erase_return_void(const_iterator position);

                                                                              Erase the element pointed to by position.

                                                                              @@ -927,7 +927,7 @@
                                                                            16. -
                                                                              void clear();
                                                                              +
                                                                              void clear();

                                                                              Erases all elements in the container.

                                                                              @@ -937,7 +937,7 @@ - + @@ -947,7 +947,7 @@

                                                                              Postconditions:

                                                                              size() == 0

                                                                              size() == 0

                                                                              Throws:

                                                                            17. -
                                                                              void swap(unordered_map&);
                                                                              +
                                                                              void swap(unordered_map&);

                                                                              Swaps the contents of the container with the parameter.

                                                                              If Allocator::propagate_on_container_swap is declared and Allocator::propagate_on_container_swap::value is true then the @@ -974,11 +974,11 @@

                                                                            -

                                                                            -unordered_map observers

                                                                            +

                                                                            +unordered_map observers

                                                                            1. -
                                                                              hasher hash_function() const;
                                                                              +
                                                                              hasher hash_function() const;
                                                                              @@ -992,7 +992,7 @@
                                                                            2. -
                                                                              key_equal key_eq() const;
                                                                              +
                                                                              key_equal key_eq() const;
                                                                              @@ -1008,20 +1008,20 @@
                                                                              -

                                                                              -unordered_map lookup

                                                                              +

                                                                              +unordered_map lookup

                                                                              1. -
                                                                                iterator find(key_type const& k);
-const_iterator find(key_type const& k) const;
+
                                                                                iterator find(key_type const& k);
+const_iterator find(key_type const& k) const;
 template<typename CompatibleKey, typename CompatibleHash, 
          typename CompatiblePredicate> 
-  iterator find(CompatibleKey const& k, CompatibleHash const& hash, 
+  iterator find(CompatibleKey const& k, CompatibleHash const& hash, 
                 CompatiblePredicate const& eq);
 template<typename CompatibleKey, typename CompatibleHash, 
          typename CompatiblePredicate> 
   const_iterator 
-  find(CompatibleKey const& k, CompatibleHash const& hash, 
+  find(CompatibleKey const& k, CompatibleHash const& hash, 
        CompatiblePredicate const& eq) const;
                                                                              @@ -1046,7 +1046,7 @@
                                                                            3. -
                                                                              size_type count(key_type const& k) const;
                                                                              +
                                                                              size_type count(key_type const& k) const;
                                                                              @@ -1059,8 +1059,8 @@
                                                                            4. -
                                                                              std::pair<iterator, iterator> equal_range(key_type const& k);
-std::pair<const_iterator, const_iterator> equal_range(key_type const& k) const;
                                                                              +
                                                                              std::pair<iterator, iterator> equal_range(key_type const& k);
+std::pair<const_iterator, const_iterator> equal_range(key_type const& k) const;
                                                                              @@ -1076,7 +1076,7 @@
                                                                            5. -
                                                                              mapped_type& operator[](key_type const& k);
                                                                              +
                                                                              mapped_type& operator[](key_type const& k);
                                                                              @@ -1106,8 +1106,8 @@
                                                                            6. -
                                                                              Mapped& at(key_type const& k);
-Mapped const& at(key_type const& k) const;
                                                                              +
                                                                              Mapped& at(key_type const& k);
+Mapped const& at(key_type const& k) const;
                                                                              @@ -1128,11 +1128,11 @@
                                                                              -

                                                                              -unordered_map bucket interface

                                                                              +

                                                                              +unordered_map bucket interface

                                                                              1. -
                                                                                size_type bucket_count() const;
                                                                                +
                                                                                size_type bucket_count() const;
                                                                              @@ -1145,7 +1145,7 @@
                                                                            7. -
                                                                              size_type max_bucket_count() const;
                                                                              +
                                                                              size_type max_bucket_count() const;
                                                                              @@ -1158,7 +1158,7 @@
                                                                            8. -
                                                                              size_type bucket_size(size_type n) const;
                                                                              +
                                                                              size_type bucket_size(size_type n) const;
                                                                              @@ -1167,7 +1167,7 @@ - + @@ -1177,7 +1177,7 @@

                                                                              Requires:

                                                                              n < bucket_count()

                                                                              n < bucket_count()

                                                                              Returns:

                                                                            9. -
                                                                              size_type bucket(key_type const& k) const;
                                                                              +
                                                                              size_type bucket(key_type const& k) const;
                                                                              @@ -1196,8 +1196,8 @@
                                                                            10. -
                                                                              local_iterator begin(size_type n);
-const_local_iterator begin(size_type n) const;
                                                                              +
                                                                              local_iterator begin(size_type n);
+const_local_iterator begin(size_type n) const;
                                                                              @@ -1216,8 +1216,8 @@
                                                                            11. -
                                                                              local_iterator end(size_type n);
-const_local_iterator end(size_type n) const;
                                                                              +
                                                                              local_iterator end(size_type n);
+const_local_iterator end(size_type n) const;
                                                                              @@ -1236,7 +1236,7 @@
                                                                            12. -
                                                                              const_local_iterator cbegin(size_type n) const;
                                                                              +
                                                                              const_local_iterator cbegin(size_type n) const;
                                                                              @@ -1255,7 +1255,7 @@
                                                                            13. -
                                                                              const_local_iterator cend(size_type n);
                                                                              +
                                                                              const_local_iterator cend(size_type n);
                                                                              @@ -1276,11 +1276,11 @@
                                                                              -

                                                                              -unordered_map hash policy

                                                                              +

                                                                              +unordered_map hash policy

                                                                              1. -
                                                                                float load_factor() const;
                                                                                +
                                                                                float load_factor() const;
                                                                              @@ -1293,7 +1293,7 @@
                                                                            14. -
                                                                              float max_load_factor() const;
                                                                              +
                                                                              float max_load_factor() const;
                                                                              @@ -1306,7 +1306,7 @@
                                                                            15. -
                                                                              void max_load_factor(float z);
                                                                              +
                                                                              void max_load_factor(float z);
                                                                              @@ -1319,7 +1319,7 @@
                                                                            16. -
                                                                              void rehash(size_type n);
                                                                              +
                                                                              void rehash(size_type n);

                                                                              Changes the number of buckets so that there at least n buckets, and so that the load factor is less than the maximum load factor.

                                                                              Invalidates iterators, and changes the order of elements. Pointers and references to elements are not invalidated.

                                                                              @@ -1334,7 +1334,7 @@
                                                                            17. -
                                                                              void reserve(size_type n);
                                                                              +
                                                                              void reserve(size_type n);

                                                                              Invalidates iterators, and changes the order of elements. Pointers and references to elements are not invalidated.

                                                                              @@ -1350,13 +1350,13 @@
                                                                              -

                                                                              -unordered_map Equality Comparisons

                                                                              +

                                                                              +unordered_map Equality Comparisons

                                                                              1. template<typename Key, typename Mapped, typename Hash, typename Pred, 
          typename Alloc> 
-  bool operator==(unordered_map<Key, Mapped, Hash, Pred, Alloc> const& x, 
+  bool operator==(unordered_map<Key, Mapped, Hash, Pred, Alloc> const& x, 
                   unordered_map<Key, Mapped, Hash, Pred, Alloc> const& y);

                                                                                Return true if x.size() == y.size and for every element in x, @@ -1383,7 +1383,7 @@ 

                                                                              2. template<typename Key, typename Mapped, typename Hash, typename Pred, 
          typename Alloc> 
-  bool operator!=(unordered_map<Key, Mapped, Hash, Pred, Alloc> const& x, 
+  bool operator!=(unordered_map<Key, Mapped, Hash, Pred, Alloc> const& x, 
                   unordered_map<Key, Mapped, Hash, Pred, Alloc> const& y);

                                                                                Return false if x.size() == y.size and for every element in x, @@ -1410,12 +1410,12 @@

                                                                              -

                                                                              -unordered_map swap

                                                                              +

                                                                              +unordered_map swap

                                                                              1. template<typename Key, typename Mapped, typename Hash, typename Pred, 
          typename Alloc> 
-  void swap(unordered_map<Key, Mapped, Hash, Pred, Alloc>& x, 
+  void swap(unordered_map<Key, Mapped, Hash, Pred, Alloc>& x, 
             unordered_map<Key, Mapped, Hash, Pred, Alloc>& y);

                                                                                Swaps the contents of x and y.

                                                                                If Allocator::propagate_on_container_swap is declared and diff --git a/doc/html/boost/unordered_multimap.html b/doc/html/boost/unordered_multimap.html index 2081a5579c..f06e421d3d 100644 --- a/doc/html/boost/unordered_multimap.html +++ b/doc/html/boost/unordered_multimap.html @@ -58,111 +58,111 @@ typedef implementation-defined const_local_iterator; // construct/copy/destruct - explicit unordered_multimap(size_type = implementation-defined, + explicit unordered_multimap(size_type = implementation-defined, hasher const& = hasher(), key_equal const& = key_equal(), allocator_type const& = allocator_type()); template<typename InputIterator> - unordered_multimap(InputIterator, InputIterator, + unordered_multimap(InputIterator, InputIterator, size_type = implementation-defined, hasher const& = hasher(), key_equal const& = key_equal(), allocator_type const& = allocator_type()); - unordered_multimap(unordered_multimap const&); - unordered_multimap(unordered_multimap &&); - explicit unordered_multimap(Allocator const&); - unordered_multimap(unordered_multimap const&, Allocator const&); - ~unordered_multimap(); - unordered_multimap& operator=(unordered_multimap const&); - unordered_multimap& operator=(unordered_multimap &&); - allocator_type get_allocator() const; + unordered_multimap(unordered_multimap const&); + unordered_multimap(unordered_multimap &&); + explicit unordered_multimap(Allocator const&); + unordered_multimap(unordered_multimap const&, Allocator const&); + ~unordered_multimap(); + unordered_multimap& operator=(unordered_multimap const&); + unordered_multimap& operator=(unordered_multimap &&); + allocator_type get_allocator() const; - // size and capacity - bool empty() const; - size_type size() const; - size_type max_size() const; + // size and capacity + bool empty() const; + size_type size() const; + size_type max_size() const; - // iterators - iterator begin(); - const_iterator begin() const; - iterator end(); - const_iterator end() const; - const_iterator cbegin() const; - const_iterator cend() const; + // iterators + iterator begin(); + const_iterator begin() const; + iterator end(); + const_iterator end() const; + const_iterator cbegin() const; + const_iterator cend() const; - // modifiers - template<typename... Args> iterator emplace(Args&&...); - template<typename... Args> iterator emplace_hint(const_iterator, Args&&...); - iterator insert(value_type const&); - iterator insert(value_type&&); - iterator insert(const_iterator, value_type const&); - iterator insert(const_iterator, value_type&&); - template<typename InputIterator> void insert(InputIterator, InputIterator); - iterator erase(const_iterator); - size_type erase(key_type const&); - iterator erase(const_iterator, const_iterator); - void quick_erase(const_iterator); - void erase_return_void(const_iterator); - void clear(); - void swap(unordered_multimap&); + // modifiers + template<typename... Args> iterator emplace(Args&&...); + template<typename... Args> iterator emplace_hint(const_iterator, Args&&...); + iterator insert(value_type const&); + iterator insert(value_type&&); + iterator insert(const_iterator, value_type const&); + iterator insert(const_iterator, value_type&&); + template<typename InputIterator> void insert(InputIterator, InputIterator); + iterator erase(const_iterator); + size_type erase(key_type const&); + iterator erase(const_iterator, const_iterator); + void quick_erase(const_iterator); + void erase_return_void(const_iterator); + void clear(); + void swap(unordered_multimap&); - // observers - hasher hash_function() const; - key_equal key_eq() const; + // observers + hasher hash_function() const; + key_equal key_eq() const; - // lookup - iterator find(key_type const&); - const_iterator find(key_type const&) const; + // lookup + iterator find(key_type const&); + const_iterator find(key_type const&) const; template<typename CompatibleKey, typename CompatibleHash, typename CompatiblePredicate> - iterator find(CompatibleKey const&, CompatibleHash const&, + iterator find(CompatibleKey const&, CompatibleHash const&, CompatiblePredicate const&); template<typename CompatibleKey, typename CompatibleHash, typename CompatiblePredicate> const_iterator - find(CompatibleKey const&, CompatibleHash const&, + find(CompatibleKey const&, CompatibleHash const&, CompatiblePredicate const&) const; - size_type count(key_type const&) const; - std::pair<iterator, iterator> equal_range(key_type const&); - std::pair<const_iterator, const_iterator> equal_range(key_type const&) const; + size_type count(key_type const&) const; + std::pair<iterator, iterator> equal_range(key_type const&); + std::pair<const_iterator, const_iterator> equal_range(key_type const&) const; - // bucket interface - size_type bucket_count() const; - size_type max_bucket_count() const; - size_type bucket_size(size_type) const; - size_type bucket(key_type const&) const; - local_iterator begin(size_type); - const_local_iterator begin(size_type) const; - local_iterator end(size_type); - const_local_iterator end(size_type) const; - const_local_iterator cbegin(size_type) const; - const_local_iterator cend(size_type); + // bucket interface + size_type bucket_count() const; + size_type max_bucket_count() const; + size_type bucket_size(size_type) const; + size_type bucket(key_type const&) const; + local_iterator begin(size_type); + const_local_iterator begin(size_type) const; + local_iterator end(size_type); + const_local_iterator end(size_type) const; + const_local_iterator cbegin(size_type) const; + const_local_iterator cend(size_type); - // hash policy - float load_factor() const; - float max_load_factor() const; - void max_load_factor(float); - void rehash(size_type); - void reserve(size_type); + // hash policy + float load_factor() const; + float max_load_factor() const; + void max_load_factor(float); + void rehash(size_type); + void reserve(size_type); }; -// Equality Comparisons +// Equality Comparisons template<typename Key, typename Mapped, typename Hash, typename Pred, typename Alloc> - bool operator==(unordered_multimap<Key, Mapped, Hash, Pred, Alloc> const&, + bool operator==(unordered_multimap<Key, Mapped, Hash, Pred, Alloc> const&, unordered_multimap<Key, Mapped, Hash, Pred, Alloc> const&); template<typename Key, typename Mapped, typename Hash, typename Pred, typename Alloc> - bool operator!=(unordered_multimap<Key, Mapped, Hash, Pred, Alloc> const&, + bool operator!=(unordered_multimap<Key, Mapped, Hash, Pred, Alloc> const&, unordered_multimap<Key, Mapped, Hash, Pred, Alloc> const&); -// swap +// swap template<typename Key, typename Mapped, typename Hash, typename Pred, typename Alloc> - void swap(unordered_multimap<Key, Mapped, Hash, Pred, Alloc>&, + void swap(unordered_multimap<Key, Mapped, Hash, Pred, Alloc>&, unordered_multimap<Key, Mapped, Hash, Pred, Alloc>&);

                                                                              -

                                                                              Description

                                                                              +

                                                                              Description

                                                                              Template Parameters

                                                                              @@ -204,7 +204,7 @@

                                                                              The elements are organized into buckets. Keys with the same hash code are stored in the same bucket and elements with equivalent keys are stored next to each other.

                                                                              The number of buckets can be automatically increased by a call to insert, or as the result of calling rehash.

                                                                              -

                                                                              +

                                                                              unordered_multimap public types

                                                                              @@ -265,13 +265,13 @@
                                                                              -

                                                                              +

                                                                              unordered_multimap public construct/copy/destruct

                                                                              1. -
                                                                                explicit unordered_multimap(size_type n = implementation-defined, 
+
                                                                                explicit unordered_multimap(size_type n = implementation-defined, 
                             hasher const& hf = hasher(), 
                             key_equal const& eq = key_equal(), 
                             allocator_type const& a = allocator_type());
                                                                                
@@ -284,7 +284,7 @@
                                                                              - + @@ -297,7 +297,7 @@ 
                                                                            18. template<typename InputIterator> 
-  unordered_multimap(InputIterator f, InputIterator l, 
+  unordered_multimap(InputIterator f, InputIterator l, 
                      size_type n = implementation-defined, 
                      hasher const& hf = hasher(), 
                      key_equal const& eq = key_equal(), 
@@ -317,7 +317,7 @@

                                                                              19. Postconditions:

                                                                              		size() == 0size() == 0

                                                                              Requires:
                                                                            19. -
                                                                              unordered_multimap(unordered_multimap const&);
                                                                              +
                                                                              unordered_multimap(unordered_multimap const&);

                                                                              The copy constructor. Copies the contained elements, hash function, predicate, maximum load factor and allocator.

                                                                              If Allocator::select_on_container_copy_construction exists and has the right signature, the allocator will be @@ -334,7 +334,7 @@

                                                                          11. -
                                                                            unordered_multimap(unordered_multimap &&);
                                                                            +
                                                                            unordered_multimap(unordered_multimap &&);

                                                                            The move constructor.

                                                                            @@ -365,15 +365,15 @@
                                                                          12. -
                                                                            explicit unordered_multimap(Allocator const& a);
                                                                            +
                                                                            explicit unordered_multimap(Allocator const& a);

                                                                            Constructs an empty container, using allocator a.

                                                                          13. -
                                                                            unordered_multimap(unordered_multimap const& x, Allocator const& a);
                                                                            +
                                                                            unordered_multimap(unordered_multimap const& x, Allocator const& a);

                                                                            Constructs an container, copying x's contained elements, hash function, predicate, maximum load factor, but using allocator a.

                                                                          14. -
                                                                            ~unordered_multimap();
                                                                            +
                                                                            ~unordered_multimap();
                                                                            @@ -387,7 +387,7 @@ -
                                                                            unordered_multimap& operator=(unordered_multimap const&);
                                                                            +
                                                                            unordered_multimap& operator=(unordered_multimap const&);

                                                                            The assignment operator. Copies the contained elements, hash function, predicate and maximum load factor but not the allocator.

                                                                            If Alloc::propagate_on_container_copy_assignment exists and Alloc::propagate_on_container_copy_assignment::value @@ -404,7 +404,7 @@

                                                                            value_type is copy constructible
                                                                            -
                                                                            unordered_multimap& operator=(unordered_multimap &&);
                                                                            +
                                                                            unordered_multimap& operator=(unordered_multimap &&);

                                                                            The move assignment operator.

                                                                            If Alloc::propagate_on_container_move_assignment exists and Alloc::propagate_on_container_move_assignment::value @@ -433,13 +433,13 @@

                                                                            15. -
                                                                            allocator_type get_allocator() const;
                                                                            +
                                                                            allocator_type get_allocator() const;
                                                                            -

                                                                            -unordered_multimap size and capacity

                                                                            +

                                                                            +unordered_multimap size and capacity

                                                                            1. -
                                                                              bool empty() const;
                                                                              +
                                                                              bool empty() const;
                                                                              @@ -447,12 +447,12 @@ - +

                                                                              Returns:

                                                                              		size() == 0size() == 0
                                                                            2. -
                                                                              size_type size() const;
                                                                              +
                                                                              size_type size() const;
                                                                              @@ -460,12 +460,12 @@ - +

                                                                              Returns:

                                                                              		std::distance(begin(), end())std::distance(begin(), end())
                                                                            3. -
                                                                              size_type max_size() const;
                                                                              +
                                                                              size_type max_size() const;
                                                                              @@ -474,7 +474,7 @@

                                                                              Returns:

                                                                              		 -size() of the largest possible container. +size() of the largest possible container.
                                                                              @@ -482,12 +482,12 @@
                                                                            -

                                                                            -unordered_multimap iterators

                                                                            +

                                                                            +unordered_multimap iterators

                                                                            1. -
                                                                              iterator begin();
-const_iterator begin() const;
                                                                              +
                                                                              iterator begin();
+const_iterator begin() const;
                                                                              @@ -501,8 +501,8 @@
                                                                            2. -
                                                                              iterator end();
-const_iterator end() const;
                                                                              +
                                                                              iterator end();
+const_iterator end() const;
                                                                              @@ -516,7 +516,7 @@
                                                                            3. -
                                                                              const_iterator cbegin() const;
                                                                              +
                                                                              const_iterator cbegin() const;
                                                                              @@ -530,7 +530,7 @@
                                                                            4. -
                                                                              const_iterator cend() const;
                                                                              +
                                                                              const_iterator cend() const;
                                                                              @@ -546,11 +546,11 @@
                                                                              -

                                                                              -unordered_multimap modifiers

                                                                              +

                                                                              +unordered_multimap modifiers

                                                                              1. -
                                                                                template<typename... Args> iterator emplace(Args&&... args);
                                                                                +
                                                                                template<typename... Args> iterator emplace(Args&&... args);

                                                                                Inserts an object, constructed with the arguments args, in the container.

                                                                              @@ -590,7 +590,7 @@ 
                                                                            5. template<typename... Args> 
-  iterator emplace_hint(const_iterator hint, Args&&... args);
                                                                              + iterator emplace_hint(const_iterator hint, Args&&... args);

                                                                              Inserts an object, constructed with the arguments args, in the container.

                                                                              hint is a suggestion to where the element should be inserted.

                                                                              6. @@ -631,7 +631,7 @@
                                                                            6. -
                                                                              iterator insert(value_type const& obj);
                                                                              +
                                                                              iterator insert(value_type const& obj);

                                                                              Inserts obj in the container.

                                                                              @@ -662,7 +662,7 @@
                                                                            7. -
                                                                              iterator insert(value_type&& obj);
                                                                              +
                                                                              iterator insert(value_type&& obj);

                                                                              Inserts obj in the container.

                                                                              @@ -693,7 +693,7 @@
                                                                            8. -
                                                                              iterator insert(const_iterator hint, value_type const& obj);
                                                                              +
                                                                              iterator insert(const_iterator hint, value_type const& obj);

                                                                              Inserts obj in the container.

                                                                              hint is a suggestion to where the element should be inserted.

                                                                              @@ -726,7 +726,7 @@
                                                                            9. -
                                                                              iterator insert(const_iterator hint, value_type&& obj);
                                                                              +
                                                                              iterator insert(const_iterator hint, value_type&& obj);

                                                                              Inserts obj in the container.

                                                                              hint is a suggestion to where the element should be inserted.

                                                                              @@ -760,7 +760,7 @@ 
                                                                            10. template<typename InputIterator> 
-  void insert(InputIterator first, InputIterator last);
                                                                              + void insert(InputIterator first, InputIterator last);

                                                                              Inserts a range of elements into the container. Elements are inserted if and only if there is no element in the container with an equivalent key.

                                                                              11. @@ -788,7 +788,7 @@
                                                                            11. -
                                                                              iterator erase(const_iterator position);
                                                                              +
                                                                              iterator erase(const_iterator position);

                                                                              Erase the element pointed to by position.

                                                                              @@ -817,7 +817,7 @@
                                                                            12. -
                                                                              size_type erase(key_type const& k);
                                                                              +
                                                                              size_type erase(key_type const& k);

                                                                              Erase all elements with key equivalent to k.

                                                                              @@ -837,7 +837,7 @@
                                                                            13. -
                                                                              iterator erase(const_iterator first, const_iterator last);
                                                                              +
                                                                              iterator erase(const_iterator first, const_iterator last);

                                                                              Erases the elements in the range from first to last.

                                                                              @@ -860,7 +860,7 @@
                                                                            14. -
                                                                              void quick_erase(const_iterator position);
                                                                              +
                                                                              void quick_erase(const_iterator position);

                                                                              Erase the element pointed to by position.

                                                                              @@ -888,7 +888,7 @@
                                                                            15. -
                                                                              void erase_return_void(const_iterator position);
                                                                              +
                                                                              void erase_return_void(const_iterator position);

                                                                              Erase the element pointed to by position.

                                                                              @@ -916,7 +916,7 @@
                                                                            16. -
                                                                              void clear();
                                                                              +
                                                                              void clear();

                                                                              Erases all elements in the container.

                                                                              @@ -926,7 +926,7 @@ - + @@ -936,7 +936,7 @@

                                                                              Postconditions:

                                                                              size() == 0

                                                                              size() == 0

                                                                              Throws:

                                                                            17. -
                                                                              void swap(unordered_multimap&);
                                                                              +
                                                                              void swap(unordered_multimap&);

                                                                              Swaps the contents of the container with the parameter.

                                                                              If Allocator::propagate_on_container_swap is declared and Allocator::propagate_on_container_swap::value is true then the @@ -963,11 +963,11 @@

                                                                            -

                                                                            -unordered_multimap observers

                                                                            +

                                                                            +unordered_multimap observers

                                                                            1. -
                                                                              hasher hash_function() const;
                                                                              +
                                                                              hasher hash_function() const;
                                                                              @@ -981,7 +981,7 @@
                                                                            2. -
                                                                              key_equal key_eq() const;
                                                                              +
                                                                              key_equal key_eq() const;
                                                                              @@ -997,20 +997,20 @@
                                                                              -

                                                                              -unordered_multimap lookup

                                                                              +

                                                                              +unordered_multimap lookup

                                                                              1. -
                                                                                iterator find(key_type const& k);
-const_iterator find(key_type const& k) const;
+
                                                                                iterator find(key_type const& k);
+const_iterator find(key_type const& k) const;
 template<typename CompatibleKey, typename CompatibleHash, 
          typename CompatiblePredicate> 
-  iterator find(CompatibleKey const& k, CompatibleHash const& hash, 
+  iterator find(CompatibleKey const& k, CompatibleHash const& hash, 
                 CompatiblePredicate const& eq);
 template<typename CompatibleKey, typename CompatibleHash, 
          typename CompatiblePredicate> 
   const_iterator 
-  find(CompatibleKey const& k, CompatibleHash const& hash, 
+  find(CompatibleKey const& k, CompatibleHash const& hash, 
        CompatiblePredicate const& eq) const;
                                                                              @@ -1035,7 +1035,7 @@
                                                                            3. -
                                                                              size_type count(key_type const& k) const;
                                                                              +
                                                                              size_type count(key_type const& k) const;
                                                                              @@ -1048,8 +1048,8 @@
                                                                            4. -
                                                                              std::pair<iterator, iterator> equal_range(key_type const& k);
-std::pair<const_iterator, const_iterator> equal_range(key_type const& k) const;
                                                                              +
                                                                              std::pair<iterator, iterator> equal_range(key_type const& k);
+std::pair<const_iterator, const_iterator> equal_range(key_type const& k) const;
                                                                              @@ -1067,11 +1067,11 @@
                                                                              -

                                                                              -unordered_multimap bucket interface

                                                                              +

                                                                              +unordered_multimap bucket interface

                                                                              1. -
                                                                                size_type bucket_count() const;
                                                                                +
                                                                                size_type bucket_count() const;
                                                                              @@ -1084,7 +1084,7 @@
                                                                            5. -
                                                                              size_type max_bucket_count() const;
                                                                              +
                                                                              size_type max_bucket_count() const;
                                                                              @@ -1097,7 +1097,7 @@
                                                                            6. -
                                                                              size_type bucket_size(size_type n) const;
                                                                              +
                                                                              size_type bucket_size(size_type n) const;
                                                                              @@ -1106,7 +1106,7 @@ - + @@ -1116,7 +1116,7 @@

                                                                              Requires:

                                                                              n < bucket_count()

                                                                              n < bucket_count()

                                                                              Returns:

                                                                            7. -
                                                                              size_type bucket(key_type const& k) const;
                                                                              +
                                                                              size_type bucket(key_type const& k) const;
                                                                              @@ -1135,8 +1135,8 @@
                                                                            8. -
                                                                              local_iterator begin(size_type n);
-const_local_iterator begin(size_type n) const;
                                                                              +
                                                                              local_iterator begin(size_type n);
+const_local_iterator begin(size_type n) const;
                                                                              @@ -1155,8 +1155,8 @@
                                                                            9. -
                                                                              local_iterator end(size_type n);
-const_local_iterator end(size_type n) const;
                                                                              +
                                                                              local_iterator end(size_type n);
+const_local_iterator end(size_type n) const;
                                                                              @@ -1175,7 +1175,7 @@
                                                                            10. -
                                                                              const_local_iterator cbegin(size_type n) const;
                                                                              +
                                                                              const_local_iterator cbegin(size_type n) const;
                                                                              @@ -1194,7 +1194,7 @@
                                                                            11. -
                                                                              const_local_iterator cend(size_type n);
                                                                              +
                                                                              const_local_iterator cend(size_type n);
                                                                              @@ -1215,11 +1215,11 @@
                                                                              -

                                                                              -unordered_multimap hash policy

                                                                              +

                                                                              +unordered_multimap hash policy

                                                                              1. -
                                                                                float load_factor() const;
                                                                                +
                                                                                float load_factor() const;
                                                                              @@ -1232,7 +1232,7 @@
                                                                            12. -
                                                                              float max_load_factor() const;
                                                                              +
                                                                              float max_load_factor() const;
                                                                              @@ -1245,7 +1245,7 @@
                                                                            13. -
                                                                              void max_load_factor(float z);
                                                                              +
                                                                              void max_load_factor(float z);
                                                                              @@ -1258,7 +1258,7 @@
                                                                            14. -
                                                                              void rehash(size_type n);
                                                                              +
                                                                              void rehash(size_type n);

                                                                              Changes the number of buckets so that there at least n buckets, and so that the load factor is less than the maximum load factor.

                                                                              Invalidates iterators, and changes the order of elements. Pointers and references to elements are not invalidated.

                                                                              @@ -1273,7 +1273,7 @@
                                                                            15. -
                                                                              void reserve(size_type n);
                                                                              +
                                                                              void reserve(size_type n);

                                                                              Invalidates iterators, and changes the order of elements. Pointers and references to elements are not invalidated.

                                                                              @@ -1289,13 +1289,13 @@
                                                                              -

                                                                              -unordered_multimap Equality Comparisons

                                                                              +

                                                                              +unordered_multimap Equality Comparisons

                                                                              1. template<typename Key, typename Mapped, typename Hash, typename Pred, 
          typename Alloc> 
-  bool operator==(unordered_multimap<Key, Mapped, Hash, Pred, Alloc> const& x, 
+  bool operator==(unordered_multimap<Key, Mapped, Hash, Pred, Alloc> const& x, 
                   unordered_multimap<Key, Mapped, Hash, Pred, Alloc> const& y);

                                                                                Return true if x.size() == y.size and for every equivalent key group in @@ -1322,7 +1322,7 @@ 

                                                                              2. template<typename Key, typename Mapped, typename Hash, typename Pred, 
          typename Alloc> 
-  bool operator!=(unordered_multimap<Key, Mapped, Hash, Pred, Alloc> const& x, 
+  bool operator!=(unordered_multimap<Key, Mapped, Hash, Pred, Alloc> const& x, 
                   unordered_multimap<Key, Mapped, Hash, Pred, Alloc> const& y);

                                                                                Return false if x.size() == y.size and for every equivalent key group in @@ -1349,12 +1349,12 @@

                                                                              -

                                                                              -unordered_multimap swap

                                                                              +

                                                                              +unordered_multimap swap

                                                                              1. template<typename Key, typename Mapped, typename Hash, typename Pred, 
          typename Alloc> 
-  void swap(unordered_multimap<Key, Mapped, Hash, Pred, Alloc>& x, 
+  void swap(unordered_multimap<Key, Mapped, Hash, Pred, Alloc>& x, 
             unordered_multimap<Key, Mapped, Hash, Pred, Alloc>& y);

                                                                                Swaps the contents of x and y.

                                                                                If Allocator::propagate_on_container_swap is declared and diff --git a/doc/html/boost/unordered_multiset.html b/doc/html/boost/unordered_multiset.html index ba736223f6..63f8971357 100644 --- a/doc/html/boost/unordered_multiset.html +++ b/doc/html/boost/unordered_multiset.html @@ -57,108 +57,108 @@ typedef implementation-defined const_local_iterator; // construct/copy/destruct - explicit unordered_multiset(size_type = implementation-defined, + explicit unordered_multiset(size_type = implementation-defined, hasher const& = hasher(), key_equal const& = key_equal(), allocator_type const& = allocator_type()); template<typename InputIterator> - unordered_multiset(InputIterator, InputIterator, + unordered_multiset(InputIterator, InputIterator, size_type = implementation-defined, hasher const& = hasher(), key_equal const& = key_equal(), allocator_type const& = allocator_type()); - unordered_multiset(unordered_multiset const&); - unordered_multiset(unordered_multiset &&); - explicit unordered_multiset(Allocator const&); - unordered_multiset(unordered_multiset const&, Allocator const&); - ~unordered_multiset(); - unordered_multiset& operator=(unordered_multiset const&); - unordered_multiset& operator=(unordered_multiset &&); - allocator_type get_allocator() const; + unordered_multiset(unordered_multiset const&); + unordered_multiset(unordered_multiset &&); + explicit unordered_multiset(Allocator const&); + unordered_multiset(unordered_multiset const&, Allocator const&); + ~unordered_multiset(); + unordered_multiset& operator=(unordered_multiset const&); + unordered_multiset& operator=(unordered_multiset &&); + allocator_type get_allocator() const; - // size and capacity - bool empty() const; - size_type size() const; - size_type max_size() const; + // size and capacity + bool empty() const; + size_type size() const; + size_type max_size() const; - // iterators - iterator begin(); - const_iterator begin() const; - iterator end(); - const_iterator end() const; - const_iterator cbegin() const; - const_iterator cend() const; + // iterators + iterator begin(); + const_iterator begin() const; + iterator end(); + const_iterator end() const; + const_iterator cbegin() const; + const_iterator cend() const; - // modifiers - template<typename... Args> iterator emplace(Args&&...); - template<typename... Args> iterator emplace_hint(const_iterator, Args&&...); - iterator insert(value_type const&); - iterator insert(value_type&&); - iterator insert(const_iterator, value_type const&); - iterator insert(const_iterator, value_type&&); - template<typename InputIterator> void insert(InputIterator, InputIterator); - iterator erase(const_iterator); - size_type erase(key_type const&); - iterator erase(const_iterator, const_iterator); - void quick_erase(const_iterator); - void erase_return_void(const_iterator); - void clear(); - void swap(unordered_multiset&); + // modifiers + template<typename... Args> iterator emplace(Args&&...); + template<typename... Args> iterator emplace_hint(const_iterator, Args&&...); + iterator insert(value_type const&); + iterator insert(value_type&&); + iterator insert(const_iterator, value_type const&); + iterator insert(const_iterator, value_type&&); + template<typename InputIterator> void insert(InputIterator, InputIterator); + iterator erase(const_iterator); + size_type erase(key_type const&); + iterator erase(const_iterator, const_iterator); + void quick_erase(const_iterator); + void erase_return_void(const_iterator); + void clear(); + void swap(unordered_multiset&); - // observers - hasher hash_function() const; - key_equal key_eq() const; + // observers + hasher hash_function() const; + key_equal key_eq() const; - // lookup - iterator find(key_type const&); - const_iterator find(key_type const&) const; + // lookup + iterator find(key_type const&); + const_iterator find(key_type const&) const; template<typename CompatibleKey, typename CompatibleHash, typename CompatiblePredicate> - iterator find(CompatibleKey const&, CompatibleHash const&, + iterator find(CompatibleKey const&, CompatibleHash const&, CompatiblePredicate const&); template<typename CompatibleKey, typename CompatibleHash, typename CompatiblePredicate> const_iterator - find(CompatibleKey const&, CompatibleHash const&, + find(CompatibleKey const&, CompatibleHash const&, CompatiblePredicate const&) const; - size_type count(key_type const&) const; - std::pair<iterator, iterator> equal_range(key_type const&); - std::pair<const_iterator, const_iterator> equal_range(key_type const&) const; + size_type count(key_type const&) const; + std::pair<iterator, iterator> equal_range(key_type const&); + std::pair<const_iterator, const_iterator> equal_range(key_type const&) const; - // bucket interface - size_type bucket_count() const; - size_type max_bucket_count() const; - size_type bucket_size(size_type) const; - size_type bucket(key_type const&) const; - local_iterator begin(size_type); - const_local_iterator begin(size_type) const; - local_iterator end(size_type); - const_local_iterator end(size_type) const; - const_local_iterator cbegin(size_type) const; - const_local_iterator cend(size_type); + // bucket interface + size_type bucket_count() const; + size_type max_bucket_count() const; + size_type bucket_size(size_type) const; + size_type bucket(key_type const&) const; + local_iterator begin(size_type); + const_local_iterator begin(size_type) const; + local_iterator end(size_type); + const_local_iterator end(size_type) const; + const_local_iterator cbegin(size_type) const; + const_local_iterator cend(size_type); - // hash policy - float load_factor() const; - float max_load_factor() const; - void max_load_factor(float); - void rehash(size_type); - void reserve(size_type); + // hash policy + float load_factor() const; + float max_load_factor() const; + void max_load_factor(float); + void rehash(size_type); + void reserve(size_type); }; -// Equality Comparisons +// Equality Comparisons template<typename Value, typename Hash, typename Pred, typename Alloc> - bool operator==(unordered_multiset<Value, Hash, Pred, Alloc> const&, + bool operator==(unordered_multiset<Value, Hash, Pred, Alloc> const&, unordered_multiset<Value, Hash, Pred, Alloc> const&); template<typename Value, typename Hash, typename Pred, typename Alloc> - bool operator!=(unordered_multiset<Value, Hash, Pred, Alloc> const&, + bool operator!=(unordered_multiset<Value, Hash, Pred, Alloc> const&, unordered_multiset<Value, Hash, Pred, Alloc> const&); -// swap +// swap template<typename Value, typename Hash, typename Pred, typename Alloc> - void swap(unordered_multiset<Value, Hash, Pred, Alloc>&, + void swap(unordered_multiset<Value, Hash, Pred, Alloc>&, unordered_multiset<Value, Hash, Pred, Alloc>&);

                                                                              -

                                                                              Description

                                                                              +

                                                                              Description

                                                                              Template Parameters

                                                                              @@ -193,7 +193,7 @@

                                                                              The elements are organized into buckets. Keys with the same hash code are stored in the same bucket and elements with equivalent keys are stored next to each other.

                                                                              The number of buckets can be automatically increased by a call to insert, or as the result of calling rehash.

                                                                              -

                                                                              +

                                                                              unordered_multiset public types

                                                                              @@ -254,13 +254,13 @@
                                                                              -

                                                                              +

                                                                              unordered_multiset public construct/copy/destruct

                                                                              1. -
                                                                                explicit unordered_multiset(size_type n = implementation-defined, 
+
                                                                                explicit unordered_multiset(size_type n = implementation-defined, 
                             hasher const& hf = hasher(), 
                             key_equal const& eq = key_equal(), 
                             allocator_type const& a = allocator_type());
                                                                                
@@ -273,7 +273,7 @@
                                                                              - + @@ -286,7 +286,7 @@ 
                                                                            16. template<typename InputIterator> 
-  unordered_multiset(InputIterator f, InputIterator l, 
+  unordered_multiset(InputIterator f, InputIterator l, 
                      size_type n = implementation-defined, 
                      hasher const& hf = hasher(), 
                      key_equal const& eq = key_equal(), 
@@ -306,7 +306,7 @@

                                                                              17. Postconditions:

                                                                              		size() == 0size() == 0

                                                                              Requires:
                                                                            17. -
                                                                              unordered_multiset(unordered_multiset const&);
                                                                              +
                                                                              unordered_multiset(unordered_multiset const&);

                                                                              The copy constructor. Copies the contained elements, hash function, predicate, maximum load factor and allocator.

                                                                              If Allocator::select_on_container_copy_construction exists and has the right signature, the allocator will be @@ -323,7 +323,7 @@

                                                                          15. -
                                                                            unordered_multiset(unordered_multiset &&);
                                                                            +
                                                                            unordered_multiset(unordered_multiset &&);

                                                                            The move constructor.

                                                                            @@ -354,15 +354,15 @@
                                                                          16. -
                                                                            explicit unordered_multiset(Allocator const& a);
                                                                            +
                                                                            explicit unordered_multiset(Allocator const& a);

                                                                            Constructs an empty container, using allocator a.

                                                                          17. -
                                                                            unordered_multiset(unordered_multiset const& x, Allocator const& a);
                                                                            +
                                                                            unordered_multiset(unordered_multiset const& x, Allocator const& a);

                                                                            Constructs an container, copying x's contained elements, hash function, predicate, maximum load factor, but using allocator a.

                                                                          18. -
                                                                            ~unordered_multiset();
                                                                            +
                                                                            ~unordered_multiset();
                                                                            @@ -376,7 +376,7 @@ -
                                                                            unordered_multiset& operator=(unordered_multiset const&);
                                                                            +
                                                                            unordered_multiset& operator=(unordered_multiset const&);

                                                                            The assignment operator. Copies the contained elements, hash function, predicate and maximum load factor but not the allocator.

                                                                            If Alloc::propagate_on_container_copy_assignment exists and Alloc::propagate_on_container_copy_assignment::value @@ -393,7 +393,7 @@

                                                                            value_type is copy constructible
                                                                            -
                                                                            unordered_multiset& operator=(unordered_multiset &&);
                                                                            +
                                                                            unordered_multiset& operator=(unordered_multiset &&);

                                                                            The move assignment operator.

                                                                            If Alloc::propagate_on_container_move_assignment exists and Alloc::propagate_on_container_move_assignment::value @@ -422,13 +422,13 @@

                                                                            19. -
                                                                            allocator_type get_allocator() const;
                                                                            +
                                                                            allocator_type get_allocator() const;
                                                                            -

                                                                            -unordered_multiset size and capacity

                                                                            +

                                                                            +unordered_multiset size and capacity

                                                                            1. -
                                                                              bool empty() const;
                                                                              +
                                                                              bool empty() const;
                                                                              @@ -436,12 +436,12 @@ - +

                                                                              Returns:

                                                                              		size() == 0size() == 0
                                                                            2. -
                                                                              size_type size() const;
                                                                              +
                                                                              size_type size() const;
                                                                              @@ -449,12 +449,12 @@ - +

                                                                              Returns:

                                                                              		std::distance(begin(), end())std::distance(begin(), end())
                                                                            3. -
                                                                              size_type max_size() const;
                                                                              +
                                                                              size_type max_size() const;
                                                                              @@ -463,7 +463,7 @@

                                                                              Returns:

                                                                              		 -size() of the largest possible container. +size() of the largest possible container.
                                                                              @@ -471,12 +471,12 @@
                                                                            -

                                                                            -unordered_multiset iterators

                                                                            +

                                                                            +unordered_multiset iterators

                                                                            1. -
                                                                              iterator begin();
-const_iterator begin() const;
                                                                              +
                                                                              iterator begin();
+const_iterator begin() const;
                                                                              @@ -490,8 +490,8 @@
                                                                            2. -
                                                                              iterator end();
-const_iterator end() const;
                                                                              +
                                                                              iterator end();
+const_iterator end() const;
                                                                              @@ -505,7 +505,7 @@
                                                                            3. -
                                                                              const_iterator cbegin() const;
                                                                              +
                                                                              const_iterator cbegin() const;
                                                                              @@ -519,7 +519,7 @@
                                                                            4. -
                                                                              const_iterator cend() const;
                                                                              +
                                                                              const_iterator cend() const;
                                                                              @@ -535,11 +535,11 @@
                                                                              -

                                                                              -unordered_multiset modifiers

                                                                              +

                                                                              +unordered_multiset modifiers

                                                                              1. -
                                                                                template<typename... Args> iterator emplace(Args&&... args);
                                                                                +
                                                                                template<typename... Args> iterator emplace(Args&&... args);

                                                                                Inserts an object, constructed with the arguments args, in the container.

                                                                              @@ -579,7 +579,7 @@ 
                                                                            5. template<typename... Args> 
-  iterator emplace_hint(const_iterator hint, Args&&... args);
                                                                              + iterator emplace_hint(const_iterator hint, Args&&... args);

                                                                              Inserts an object, constructed with the arguments args, in the container.

                                                                              hint is a suggestion to where the element should be inserted.

                                                                              6. @@ -620,7 +620,7 @@
                                                                            6. -
                                                                              iterator insert(value_type const& obj);
                                                                              +
                                                                              iterator insert(value_type const& obj);

                                                                              Inserts obj in the container.

                                                                              @@ -651,7 +651,7 @@
                                                                            7. -
                                                                              iterator insert(value_type&& obj);
                                                                              +
                                                                              iterator insert(value_type&& obj);

                                                                              Inserts obj in the container.

                                                                              @@ -682,7 +682,7 @@
                                                                            8. -
                                                                              iterator insert(const_iterator hint, value_type const& obj);
                                                                              +
                                                                              iterator insert(const_iterator hint, value_type const& obj);

                                                                              Inserts obj in the container.

                                                                              hint is a suggestion to where the element should be inserted.

                                                                              @@ -715,7 +715,7 @@
                                                                            9. -
                                                                              iterator insert(const_iterator hint, value_type&& obj);
                                                                              +
                                                                              iterator insert(const_iterator hint, value_type&& obj);

                                                                              Inserts obj in the container.

                                                                              hint is a suggestion to where the element should be inserted.

                                                                              @@ -749,7 +749,7 @@ 
                                                                            10. template<typename InputIterator> 
-  void insert(InputIterator first, InputIterator last);
                                                                              + void insert(InputIterator first, InputIterator last);

                                                                              Inserts a range of elements into the container. Elements are inserted if and only if there is no element in the container with an equivalent value.

                                                                              11. @@ -777,7 +777,7 @@
                                                                            11. -
                                                                              iterator erase(const_iterator position);
                                                                              +
                                                                              iterator erase(const_iterator position);

                                                                              Erase the element pointed to by position.

                                                                              @@ -806,7 +806,7 @@
                                                                            12. -
                                                                              size_type erase(key_type const& k);
                                                                              +
                                                                              size_type erase(key_type const& k);

                                                                              Erase all elements with key equivalent to k.

                                                                              @@ -826,7 +826,7 @@
                                                                            13. -
                                                                              iterator erase(const_iterator first, const_iterator last);
                                                                              +
                                                                              iterator erase(const_iterator first, const_iterator last);

                                                                              Erases the elements in the range from first to last.

                                                                              @@ -849,7 +849,7 @@
                                                                            14. -
                                                                              void quick_erase(const_iterator position);
                                                                              +
                                                                              void quick_erase(const_iterator position);

                                                                              Erase the element pointed to by position.

                                                                              @@ -877,7 +877,7 @@
                                                                            15. -
                                                                              void erase_return_void(const_iterator position);
                                                                              +
                                                                              void erase_return_void(const_iterator position);

                                                                              Erase the element pointed to by position.

                                                                              @@ -905,7 +905,7 @@
                                                                            16. -
                                                                              void clear();
                                                                              +
                                                                              void clear();

                                                                              Erases all elements in the container.

                                                                              @@ -915,7 +915,7 @@ - + @@ -925,7 +925,7 @@

                                                                              Postconditions:

                                                                              size() == 0

                                                                              size() == 0

                                                                              Throws:

                                                                            17. -
                                                                              void swap(unordered_multiset&);
                                                                              +
                                                                              void swap(unordered_multiset&);

                                                                              Swaps the contents of the container with the parameter.

                                                                              If Allocator::propagate_on_container_swap is declared and Allocator::propagate_on_container_swap::value is true then the @@ -952,11 +952,11 @@

                                                                            -

                                                                            -unordered_multiset observers

                                                                            +

                                                                            +unordered_multiset observers

                                                                            1. -
                                                                              hasher hash_function() const;
                                                                              +
                                                                              hasher hash_function() const;
                                                                              @@ -970,7 +970,7 @@
                                                                            2. -
                                                                              key_equal key_eq() const;
                                                                              +
                                                                              key_equal key_eq() const;
                                                                              @@ -986,20 +986,20 @@
                                                                              -

                                                                              -unordered_multiset lookup

                                                                              +

                                                                              +unordered_multiset lookup

                                                                              1. -
                                                                                iterator find(key_type const& k);
-const_iterator find(key_type const& k) const;
+
                                                                                iterator find(key_type const& k);
+const_iterator find(key_type const& k) const;
 template<typename CompatibleKey, typename CompatibleHash, 
          typename CompatiblePredicate> 
-  iterator find(CompatibleKey const& k, CompatibleHash const& hash, 
+  iterator find(CompatibleKey const& k, CompatibleHash const& hash, 
                 CompatiblePredicate const& eq);
 template<typename CompatibleKey, typename CompatibleHash, 
          typename CompatiblePredicate> 
   const_iterator 
-  find(CompatibleKey const& k, CompatibleHash const& hash, 
+  find(CompatibleKey const& k, CompatibleHash const& hash, 
        CompatiblePredicate const& eq) const;
                                                                              @@ -1024,7 +1024,7 @@
                                                                            3. -
                                                                              size_type count(key_type const& k) const;
                                                                              +
                                                                              size_type count(key_type const& k) const;
                                                                              @@ -1037,8 +1037,8 @@
                                                                            4. -
                                                                              std::pair<iterator, iterator> equal_range(key_type const& k);
-std::pair<const_iterator, const_iterator> equal_range(key_type const& k) const;
                                                                              +
                                                                              std::pair<iterator, iterator> equal_range(key_type const& k);
+std::pair<const_iterator, const_iterator> equal_range(key_type const& k) const;
                                                                              @@ -1056,11 +1056,11 @@
                                                                              -

                                                                              -unordered_multiset bucket interface

                                                                              +

                                                                              +unordered_multiset bucket interface

                                                                              1. -
                                                                                size_type bucket_count() const;
                                                                                +
                                                                                size_type bucket_count() const;
                                                                              @@ -1073,7 +1073,7 @@
                                                                            5. -
                                                                              size_type max_bucket_count() const;
                                                                              +
                                                                              size_type max_bucket_count() const;
                                                                              @@ -1086,7 +1086,7 @@
                                                                            6. -
                                                                              size_type bucket_size(size_type n) const;
                                                                              +
                                                                              size_type bucket_size(size_type n) const;
                                                                              @@ -1095,7 +1095,7 @@ - + @@ -1105,7 +1105,7 @@

                                                                              Requires:

                                                                              n < bucket_count()

                                                                              n < bucket_count()

                                                                              Returns:

                                                                            7. -
                                                                              size_type bucket(key_type const& k) const;
                                                                              +
                                                                              size_type bucket(key_type const& k) const;
                                                                              @@ -1124,8 +1124,8 @@
                                                                            8. -
                                                                              local_iterator begin(size_type n);
-const_local_iterator begin(size_type n) const;
                                                                              +
                                                                              local_iterator begin(size_type n);
+const_local_iterator begin(size_type n) const;
                                                                              @@ -1144,8 +1144,8 @@
                                                                            9. -
                                                                              local_iterator end(size_type n);
-const_local_iterator end(size_type n) const;
                                                                              +
                                                                              local_iterator end(size_type n);
+const_local_iterator end(size_type n) const;
                                                                              @@ -1164,7 +1164,7 @@
                                                                            10. -
                                                                              const_local_iterator cbegin(size_type n) const;
                                                                              +
                                                                              const_local_iterator cbegin(size_type n) const;
                                                                              @@ -1183,7 +1183,7 @@
                                                                            11. -
                                                                              const_local_iterator cend(size_type n);
                                                                              +
                                                                              const_local_iterator cend(size_type n);
                                                                              @@ -1204,11 +1204,11 @@
                                                                              -

                                                                              -unordered_multiset hash policy

                                                                              +

                                                                              +unordered_multiset hash policy

                                                                              1. -
                                                                                float load_factor() const;
                                                                                +
                                                                                float load_factor() const;
                                                                              @@ -1221,7 +1221,7 @@
                                                                            12. -
                                                                              float max_load_factor() const;
                                                                              +
                                                                              float max_load_factor() const;
                                                                              @@ -1234,7 +1234,7 @@
                                                                            13. -
                                                                              void max_load_factor(float z);
                                                                              +
                                                                              void max_load_factor(float z);
                                                                              @@ -1247,7 +1247,7 @@
                                                                            14. -
                                                                              void rehash(size_type n);
                                                                              +
                                                                              void rehash(size_type n);

                                                                              Changes the number of buckets so that there at least n buckets, and so that the load factor is less than the maximum load factor.

                                                                              Invalidates iterators, and changes the order of elements. Pointers and references to elements are not invalidated.

                                                                              @@ -1262,7 +1262,7 @@
                                                                            15. -
                                                                              void reserve(size_type n);
                                                                              +
                                                                              void reserve(size_type n);

                                                                              Invalidates iterators, and changes the order of elements. Pointers and references to elements are not invalidated.

                                                                              @@ -1278,12 +1278,12 @@
                                                                              -

                                                                              -unordered_multiset Equality Comparisons

                                                                              +

                                                                              +unordered_multiset Equality Comparisons

                                                                              1. template<typename Value, typename Hash, typename Pred, typename Alloc> 
-  bool operator==(unordered_multiset<Value, Hash, Pred, Alloc> const& x, 
+  bool operator==(unordered_multiset<Value, Hash, Pred, Alloc> const& x, 
                   unordered_multiset<Value, Hash, Pred, Alloc> const& y);

                                                                                Return true if x.size() == y.size and for every equivalent key group in @@ -1309,7 +1309,7 @@ 

                                                                              2. template<typename Value, typename Hash, typename Pred, typename Alloc> 
-  bool operator!=(unordered_multiset<Value, Hash, Pred, Alloc> const& x, 
+  bool operator!=(unordered_multiset<Value, Hash, Pred, Alloc> const& x, 
                   unordered_multiset<Value, Hash, Pred, Alloc> const& y);

                                                                                Return false if x.size() == y.size and for every equivalent key group in @@ -1336,11 +1336,11 @@

                                                                              -

                                                                              -unordered_multiset swap

                                                                              +

                                                                              +unordered_multiset swap

                                                                              1. template<typename Value, typename Hash, typename Pred, typename Alloc> 
-  void swap(unordered_multiset<Value, Hash, Pred, Alloc>& x, 
+  void swap(unordered_multiset<Value, Hash, Pred, Alloc>& x, 
             unordered_multiset<Value, Hash, Pred, Alloc>& y);

                                                                                Swaps the contents of x and y.

                                                                                If Allocator::propagate_on_container_swap is declared and diff --git a/doc/html/boost/unordered_set.html b/doc/html/boost/unordered_set.html index 1d0ebdba61..dc6fce28b8 100644 --- a/doc/html/boost/unordered_set.html +++ b/doc/html/boost/unordered_set.html @@ -57,107 +57,107 @@ typedef implementation-defined const_local_iterator; // construct/copy/destruct - explicit unordered_set(size_type = implementation-defined, + explicit unordered_set(size_type = implementation-defined, hasher const& = hasher(), key_equal const& = key_equal(), allocator_type const& = allocator_type()); template<typename InputIterator> - unordered_set(InputIterator, InputIterator, + unordered_set(InputIterator, InputIterator, size_type = implementation-defined, hasher const& = hasher(), key_equal const& = key_equal(), allocator_type const& = allocator_type()); - unordered_set(unordered_set const&); - unordered_set(unordered_set &&); - explicit unordered_set(Allocator const&); - unordered_set(unordered_set const&, Allocator const&); - ~unordered_set(); - unordered_set& operator=(unordered_set const&); - unordered_set& operator=(unordered_set &&); - allocator_type get_allocator() const; + unordered_set(unordered_set const&); + unordered_set(unordered_set &&); + explicit unordered_set(Allocator const&); + unordered_set(unordered_set const&, Allocator const&); + ~unordered_set(); + unordered_set& operator=(unordered_set const&); + unordered_set& operator=(unordered_set &&); + allocator_type get_allocator() const; - // size and capacity - bool empty() const; - size_type size() const; - size_type max_size() const; + // size and capacity + bool empty() const; + size_type size() const; + size_type max_size() const; - // iterators - iterator begin(); - const_iterator begin() const; - iterator end(); - const_iterator end() const; - const_iterator cbegin() const; - const_iterator cend() const; + // iterators + iterator begin(); + const_iterator begin() const; + iterator end(); + const_iterator end() const; + const_iterator cbegin() const; + const_iterator cend() const; - // modifiers - template<typename... Args> std::pair<iterator, bool> emplace(Args&&...); - template<typename... Args> iterator emplace_hint(const_iterator, Args&&...); - std::pair<iterator, bool> insert(value_type const&); - std::pair<iterator, bool> insert(value_type&&); - iterator insert(const_iterator, value_type const&); - iterator insert(const_iterator, value_type&&); - template<typename InputIterator> void insert(InputIterator, InputIterator); - iterator erase(const_iterator); - size_type erase(key_type const&); - iterator erase(const_iterator, const_iterator); - void quick_erase(const_iterator); - void erase_return_void(const_iterator); - void clear(); - void swap(unordered_set&); + // modifiers + template<typename... Args> std::pair<iterator, bool> emplace(Args&&...); + template<typename... Args> iterator emplace_hint(const_iterator, Args&&...); + std::pair<iterator, bool> insert(value_type const&); + std::pair<iterator, bool> insert(value_type&&); + iterator insert(const_iterator, value_type const&); + iterator insert(const_iterator, value_type&&); + template<typename InputIterator> void insert(InputIterator, InputIterator); + iterator erase(const_iterator); + size_type erase(key_type const&); + iterator erase(const_iterator, const_iterator); + void quick_erase(const_iterator); + void erase_return_void(const_iterator); + void clear(); + void swap(unordered_set&); - // observers - hasher hash_function() const; - key_equal key_eq() const; + // observers + hasher hash_function() const; + key_equal key_eq() const; - // lookup - iterator find(key_type const&); - const_iterator find(key_type const&) const; + // lookup + iterator find(key_type const&); + const_iterator find(key_type const&) const; template<typename CompatibleKey, typename CompatibleHash, typename CompatiblePredicate> - iterator find(CompatibleKey const&, CompatibleHash const&, + iterator find(CompatibleKey const&, CompatibleHash const&, CompatiblePredicate const&); template<typename CompatibleKey, typename CompatibleHash, typename CompatiblePredicate> const_iterator - find(CompatibleKey const&, CompatibleHash const&, + find(CompatibleKey const&, CompatibleHash const&, CompatiblePredicate const&) const; - size_type count(key_type const&) const; - std::pair<iterator, iterator> equal_range(key_type const&); - std::pair<const_iterator, const_iterator> equal_range(key_type const&) const; + size_type count(key_type const&) const; + std::pair<iterator, iterator> equal_range(key_type const&); + std::pair<const_iterator, const_iterator> equal_range(key_type const&) const; - // bucket interface - size_type bucket_count() const; - size_type max_bucket_count() const; - size_type bucket_size(size_type) const; - size_type bucket(key_type const&) const; - local_iterator begin(size_type); - const_local_iterator begin(size_type) const; - local_iterator end(size_type); - const_local_iterator end(size_type) const; - const_local_iterator cbegin(size_type) const; - const_local_iterator cend(size_type); + // bucket interface + size_type bucket_count() const; + size_type max_bucket_count() const; + size_type bucket_size(size_type) const; + size_type bucket(key_type const&) const; + local_iterator begin(size_type); + const_local_iterator begin(size_type) const; + local_iterator end(size_type); + const_local_iterator end(size_type) const; + const_local_iterator cbegin(size_type) const; + const_local_iterator cend(size_type); - // hash policy - float load_factor() const; - float max_load_factor() const; - void max_load_factor(float); - void rehash(size_type); - void reserve(size_type); + // hash policy + float load_factor() const; + float max_load_factor() const; + void max_load_factor(float); + void rehash(size_type); + void reserve(size_type); }; -// Equality Comparisons +// Equality Comparisons template<typename Value, typename Hash, typename Pred, typename Alloc> - bool operator==(unordered_set<Value, Hash, Pred, Alloc> const&, + bool operator==(unordered_set<Value, Hash, Pred, Alloc> const&, unordered_set<Value, Hash, Pred, Alloc> const&); template<typename Value, typename Hash, typename Pred, typename Alloc> - bool operator!=(unordered_set<Value, Hash, Pred, Alloc> const&, + bool operator!=(unordered_set<Value, Hash, Pred, Alloc> const&, unordered_set<Value, Hash, Pred, Alloc> const&); -// swap +// swap template<typename Value, typename Hash, typename Pred, typename Alloc> - void swap(unordered_set<Value, Hash, Pred, Alloc>&, + void swap(unordered_set<Value, Hash, Pred, Alloc>&, unordered_set<Value, Hash, Pred, Alloc>&);

                                                                              -

                                                                              Description

                                                                              +

                                                                              Description

                                                                              Template Parameters

                                                                              @@ -192,7 +192,7 @@

                                                                              The elements are organized into buckets. Keys with the same hash code are stored in the same bucket.

                                                                              The number of buckets can be automatically increased by a call to insert, or as the result of calling rehash.

                                                                              -

                                                                              +

                                                                              unordered_set public types

                                                                              @@ -253,13 +253,13 @@
                                                                              -

                                                                              +

                                                                              unordered_set public construct/copy/destruct

                                                                              1. -
                                                                                explicit unordered_set(size_type n = implementation-defined, 
+
                                                                                explicit unordered_set(size_type n = implementation-defined, 
                        hasher const& hf = hasher(), 
                        key_equal const& eq = key_equal(), 
                        allocator_type const& a = allocator_type());
                                                                                
@@ -272,7 +272,7 @@
                                                                              - + @@ -285,7 +285,7 @@ 
                                                                            16. template<typename InputIterator> 
-  unordered_set(InputIterator f, InputIterator l, 
+  unordered_set(InputIterator f, InputIterator l, 
                 size_type n = implementation-defined, 
                 hasher const& hf = hasher(), 
                 key_equal const& eq = key_equal(), 
@@ -305,7 +305,7 @@

                                                                              17. Postconditions:

                                                                              		size() == 0size() == 0

                                                                              Requires:
                                                                            17. -
                                                                              unordered_set(unordered_set const&);
                                                                              +
                                                                              unordered_set(unordered_set const&);

                                                                              The copy constructor. Copies the contained elements, hash function, predicate, maximum load factor and allocator.

                                                                              If Allocator::select_on_container_copy_construction exists and has the right signature, the allocator will be @@ -322,7 +322,7 @@

                                                                          19. -
                                                                            unordered_set(unordered_set &&);
                                                                            +
                                                                            unordered_set(unordered_set &&);

                                                                            The move constructor.

                                                                            @@ -353,15 +353,15 @@
                                                                          20. -
                                                                            explicit unordered_set(Allocator const& a);
                                                                            +
                                                                            explicit unordered_set(Allocator const& a);

                                                                            Constructs an empty container, using allocator a.

                                                                          21. -
                                                                            unordered_set(unordered_set const& x, Allocator const& a);
                                                                            +
                                                                            unordered_set(unordered_set const& x, Allocator const& a);

                                                                            Constructs an container, copying x's contained elements, hash function, predicate, maximum load factor, but using allocator a.

                                                                          22. -
                                                                            ~unordered_set();
                                                                            +
                                                                            ~unordered_set();
                                                                            @@ -375,7 +375,7 @@ -
                                                                            unordered_set& operator=(unordered_set const&);
                                                                            +
                                                                            unordered_set& operator=(unordered_set const&);

                                                                            The assignment operator. Copies the contained elements, hash function, predicate and maximum load factor but not the allocator.

                                                                            If Alloc::propagate_on_container_copy_assignment exists and Alloc::propagate_on_container_copy_assignment::value @@ -392,7 +392,7 @@

                                                                            value_type is copy constructible
                                                                            -
                                                                            unordered_set& operator=(unordered_set &&);
                                                                            +
                                                                            unordered_set& operator=(unordered_set &&);

                                                                            The move assignment operator.

                                                                            If Alloc::propagate_on_container_move_assignment exists and Alloc::propagate_on_container_move_assignment::value @@ -421,13 +421,13 @@

                                                                            23. -
                                                                            allocator_type get_allocator() const;
                                                                            +
                                                                            allocator_type get_allocator() const;
                                                                            -

                                                                            -unordered_set size and capacity

                                                                            +

                                                                            +unordered_set size and capacity

                                                                            1. -
                                                                              bool empty() const;
                                                                              +
                                                                              bool empty() const;
                                                                              @@ -435,12 +435,12 @@ - +

                                                                              Returns:

                                                                              		size() == 0size() == 0
                                                                            2. -
                                                                              size_type size() const;
                                                                              +
                                                                              size_type size() const;
                                                                              @@ -448,12 +448,12 @@ - +

                                                                              Returns:

                                                                              		std::distance(begin(), end())std::distance(begin(), end())
                                                                            3. -
                                                                              size_type max_size() const;
                                                                              +
                                                                              size_type max_size() const;
                                                                              @@ -462,7 +462,7 @@

                                                                              Returns:

                                                                              		 -size() of the largest possible container. +size() of the largest possible container.
                                                                              @@ -470,12 +470,12 @@
                                                                            -

                                                                            -unordered_set iterators

                                                                            +

                                                                            +unordered_set iterators

                                                                            1. -
                                                                              iterator begin();
-const_iterator begin() const;
                                                                              +
                                                                              iterator begin();
+const_iterator begin() const;
                                                                              @@ -489,8 +489,8 @@
                                                                            2. -
                                                                              iterator end();
-const_iterator end() const;
                                                                              +
                                                                              iterator end();
+const_iterator end() const;
                                                                              @@ -504,7 +504,7 @@
                                                                            3. -
                                                                              const_iterator cbegin() const;
                                                                              +
                                                                              const_iterator cbegin() const;
                                                                              @@ -518,7 +518,7 @@
                                                                            4. -
                                                                              const_iterator cend() const;
                                                                              +
                                                                              const_iterator cend() const;
                                                                              @@ -534,11 +534,11 @@
                                                                              -

                                                                              -unordered_set modifiers

                                                                              +

                                                                              +unordered_set modifiers

                                                                              1. -
                                                                                template<typename... Args> std::pair<iterator, bool> emplace(Args&&... args);
                                                                                +
                                                                                template<typename... Args> std::pair<iterator, bool> emplace(Args&&... args);

                                                                                Inserts an object, constructed with the arguments args, in the container if and only if there is no element in the container with an equivalent value.

                                                                              @@ -581,7 +581,7 @@ 
                                                                            5. template<typename... Args> 
-  iterator emplace_hint(const_iterator hint, Args&&... args);
                                                                              + iterator emplace_hint(const_iterator hint, Args&&... args);

                                                                              Inserts an object, constructed with the arguments args, in the container if and only if there is no element in the container with an equivalent value.

                                                                              hint is a suggestion to where the element should be inserted.

                                                                              6. @@ -622,7 +622,7 @@
                                                                            6. -
                                                                              std::pair<iterator, bool> insert(value_type const& obj);
                                                                              +
                                                                              std::pair<iterator, bool> insert(value_type const& obj);

                                                                              Inserts obj in the container if and only if there is no element in the container with an equivalent value.

                                                                              @@ -656,7 +656,7 @@
                                                                            7. -
                                                                              std::pair<iterator, bool> insert(value_type&& obj);
                                                                              +
                                                                              std::pair<iterator, bool> insert(value_type&& obj);

                                                                              Inserts obj in the container if and only if there is no element in the container with an equivalent value.

                                                                              @@ -690,7 +690,7 @@
                                                                            8. -
                                                                              iterator insert(const_iterator hint, value_type const& obj);
                                                                              +
                                                                              iterator insert(const_iterator hint, value_type const& obj);

                                                                              Inserts obj in the container if and only if there is no element in the container with an equivalent value.

                                                                              hint is a suggestion to where the element should be inserted.

                                                                              @@ -723,7 +723,7 @@
                                                                            9. -
                                                                              iterator insert(const_iterator hint, value_type&& obj);
                                                                              +
                                                                              iterator insert(const_iterator hint, value_type&& obj);

                                                                              Inserts obj in the container if and only if there is no element in the container with an equivalent value.

                                                                              hint is a suggestion to where the element should be inserted.

                                                                              @@ -757,7 +757,7 @@ 
                                                                            10. template<typename InputIterator> 
-  void insert(InputIterator first, InputIterator last);
                                                                              + void insert(InputIterator first, InputIterator last);

                                                                              Inserts a range of elements into the container. Elements are inserted if and only if there is no element in the container with an equivalent value.

                                                                              11. @@ -785,7 +785,7 @@
                                                                            11. -
                                                                              iterator erase(const_iterator position);
                                                                              +
                                                                              iterator erase(const_iterator position);

                                                                              Erase the element pointed to by position.

                                                                              @@ -814,7 +814,7 @@
                                                                            12. -
                                                                              size_type erase(key_type const& k);
                                                                              +
                                                                              size_type erase(key_type const& k);

                                                                              Erase all elements with key equivalent to k.

                                                                              @@ -834,7 +834,7 @@
                                                                            13. -
                                                                              iterator erase(const_iterator first, const_iterator last);
                                                                              +
                                                                              iterator erase(const_iterator first, const_iterator last);

                                                                              Erases the elements in the range from first to last.

                                                                              @@ -857,7 +857,7 @@
                                                                            14. -
                                                                              void quick_erase(const_iterator position);
                                                                              +
                                                                              void quick_erase(const_iterator position);

                                                                              Erase the element pointed to by position.

                                                                              @@ -885,7 +885,7 @@
                                                                            15. -
                                                                              void erase_return_void(const_iterator position);
                                                                              +
                                                                              void erase_return_void(const_iterator position);

                                                                              Erase the element pointed to by position.

                                                                              @@ -913,7 +913,7 @@
                                                                            16. -
                                                                              void clear();
                                                                              +
                                                                              void clear();

                                                                              Erases all elements in the container.

                                                                              @@ -923,7 +923,7 @@ - + @@ -933,7 +933,7 @@

                                                                              Postconditions:

                                                                              size() == 0

                                                                              size() == 0

                                                                              Throws:

                                                                            17. -
                                                                              void swap(unordered_set&);
                                                                              +
                                                                              void swap(unordered_set&);

                                                                              Swaps the contents of the container with the parameter.

                                                                              If Allocator::propagate_on_container_swap is declared and Allocator::propagate_on_container_swap::value is true then the @@ -960,11 +960,11 @@

                                                                            -

                                                                            -unordered_set observers

                                                                            +

                                                                            +unordered_set observers

                                                                            1. -
                                                                              hasher hash_function() const;
                                                                              +
                                                                              hasher hash_function() const;
                                                                              @@ -978,7 +978,7 @@
                                                                            2. -
                                                                              key_equal key_eq() const;
                                                                              +
                                                                              key_equal key_eq() const;
                                                                              @@ -994,20 +994,20 @@
                                                                              -

                                                                              -unordered_set lookup

                                                                              +

                                                                              +unordered_set lookup

                                                                              1. -
                                                                                iterator find(key_type const& k);
-const_iterator find(key_type const& k) const;
+
                                                                                iterator find(key_type const& k);
+const_iterator find(key_type const& k) const;
 template<typename CompatibleKey, typename CompatibleHash, 
          typename CompatiblePredicate> 
-  iterator find(CompatibleKey const& k, CompatibleHash const& hash, 
+  iterator find(CompatibleKey const& k, CompatibleHash const& hash, 
                 CompatiblePredicate const& eq);
 template<typename CompatibleKey, typename CompatibleHash, 
          typename CompatiblePredicate> 
   const_iterator 
-  find(CompatibleKey const& k, CompatibleHash const& hash, 
+  find(CompatibleKey const& k, CompatibleHash const& hash, 
        CompatiblePredicate const& eq) const;
                                                                              @@ -1032,7 +1032,7 @@
                                                                            3. -
                                                                              size_type count(key_type const& k) const;
                                                                              +
                                                                              size_type count(key_type const& k) const;
                                                                              @@ -1045,8 +1045,8 @@
                                                                            4. -
                                                                              std::pair<iterator, iterator> equal_range(key_type const& k);
-std::pair<const_iterator, const_iterator> equal_range(key_type const& k) const;
                                                                              +
                                                                              std::pair<iterator, iterator> equal_range(key_type const& k);
+std::pair<const_iterator, const_iterator> equal_range(key_type const& k) const;
                                                                              @@ -1064,11 +1064,11 @@
                                                                              -

                                                                              -unordered_set bucket interface

                                                                              +

                                                                              +unordered_set bucket interface

                                                                              1. -
                                                                                size_type bucket_count() const;
                                                                                +
                                                                                size_type bucket_count() const;
                                                                              @@ -1081,7 +1081,7 @@
                                                                            5. -
                                                                              size_type max_bucket_count() const;
                                                                              +
                                                                              size_type max_bucket_count() const;
                                                                              @@ -1094,7 +1094,7 @@
                                                                            6. -
                                                                              size_type bucket_size(size_type n) const;
                                                                              +
                                                                              size_type bucket_size(size_type n) const;
                                                                              @@ -1103,7 +1103,7 @@ - + @@ -1113,7 +1113,7 @@

                                                                              Requires:

                                                                              n < bucket_count()

                                                                              n < bucket_count()

                                                                              Returns:

                                                                            7. -
                                                                              size_type bucket(key_type const& k) const;
                                                                              +
                                                                              size_type bucket(key_type const& k) const;
                                                                              @@ -1132,8 +1132,8 @@
                                                                            8. -
                                                                              local_iterator begin(size_type n);
-const_local_iterator begin(size_type n) const;
                                                                              +
                                                                              local_iterator begin(size_type n);
+const_local_iterator begin(size_type n) const;
                                                                              @@ -1152,8 +1152,8 @@
                                                                            9. -
                                                                              local_iterator end(size_type n);
-const_local_iterator end(size_type n) const;
                                                                              +
                                                                              local_iterator end(size_type n);
+const_local_iterator end(size_type n) const;
                                                                              @@ -1172,7 +1172,7 @@
                                                                            10. -
                                                                              const_local_iterator cbegin(size_type n) const;
                                                                              +
                                                                              const_local_iterator cbegin(size_type n) const;
                                                                              @@ -1191,7 +1191,7 @@
                                                                            11. -
                                                                              const_local_iterator cend(size_type n);
                                                                              +
                                                                              const_local_iterator cend(size_type n);
                                                                              @@ -1212,11 +1212,11 @@
                                                                              -

                                                                              -unordered_set hash policy

                                                                              +

                                                                              +unordered_set hash policy

                                                                              1. -
                                                                                float load_factor() const;
                                                                                +
                                                                                float load_factor() const;
                                                                              @@ -1229,7 +1229,7 @@
                                                                            12. -
                                                                              float max_load_factor() const;
                                                                              +
                                                                              float max_load_factor() const;
                                                                              @@ -1242,7 +1242,7 @@
                                                                            13. -
                                                                              void max_load_factor(float z);
                                                                              +
                                                                              void max_load_factor(float z);
                                                                              @@ -1255,7 +1255,7 @@
                                                                            14. -
                                                                              void rehash(size_type n);
                                                                              +
                                                                              void rehash(size_type n);

                                                                              Changes the number of buckets so that there at least n buckets, and so that the load factor is less than the maximum load factor.

                                                                              Invalidates iterators, and changes the order of elements. Pointers and references to elements are not invalidated.

                                                                              @@ -1270,7 +1270,7 @@
                                                                            15. -
                                                                              void reserve(size_type n);
                                                                              +
                                                                              void reserve(size_type n);

                                                                              Invalidates iterators, and changes the order of elements. Pointers and references to elements are not invalidated.

                                                                              @@ -1286,12 +1286,12 @@
                                                                              -

                                                                              -unordered_set Equality Comparisons

                                                                              +

                                                                              +unordered_set Equality Comparisons

                                                                              1. template<typename Value, typename Hash, typename Pred, typename Alloc> 
-  bool operator==(unordered_set<Value, Hash, Pred, Alloc> const& x, 
+  bool operator==(unordered_set<Value, Hash, Pred, Alloc> const& x, 
                   unordered_set<Value, Hash, Pred, Alloc> const& y);

                                                                                Return true if x.size() == y.size and for every element in x, @@ -1317,7 +1317,7 @@ 

                                                                              2. template<typename Value, typename Hash, typename Pred, typename Alloc> 
-  bool operator!=(unordered_set<Value, Hash, Pred, Alloc> const& x, 
+  bool operator!=(unordered_set<Value, Hash, Pred, Alloc> const& x, 
                   unordered_set<Value, Hash, Pred, Alloc> const& y);

                                                                                Return false if x.size() == y.size and for every element in x, @@ -1344,11 +1344,11 @@

                                                                              -

                                                                              -unordered_set swap

                                                                              +

                                                                              +unordered_set swap

                                                                              1. template<typename Value, typename Hash, typename Pred, typename Alloc> 
-  void swap(unordered_set<Value, Hash, Pred, Alloc>& x, 
+  void swap(unordered_set<Value, Hash, Pred, Alloc>& x, 
             unordered_set<Value, Hash, Pred, Alloc>& y);

                                                                                Swaps the contents of x and y.

                                                                                If Allocator::propagate_on_container_swap is declared and diff --git a/doc/html/boost/unwrap_recursive_wrapper.html b/doc/html/boost/unwrap_recursive_wrapper.html index aef2a51f3a..ed5ed7873e 100644 --- a/doc/html/boost/unwrap_recursive_wrapper.html +++ b/doc/html/boost/unwrap_recursive_wrapper.html @@ -40,7 +40,7 @@ typedef unspecified type; };

                                                                              -

                                                                              Description

                                                                              +

                                                                              Description

                                                                              type is equivalent to T::type if T is a specialization of recursive_wrapper. Otherwise, diff --git a/doc/html/boost/variant.html b/doc/html/boost/variant.html index 73ea89123d..e1d3e7cedc 100644 --- a/doc/html/boost/variant.html +++ b/doc/html/boost/variant.html @@ -8,7 +8,7 @@ - +

                                                                              @@ -21,7 +21,7 @@
                                                                              -PrevUpHomeNext +PrevUpHomeNext
                                                                              @@ -40,48 +40,48 @@ typedef unspecified types; // construct/copy/destruct - variant(); - variant(const variant &); - variant(variant &&); - template<typename T> variant(T &); - template<typename T> variant(const T &); - template<typename T> variant(T &&); + variant(); + variant(const variant &); + variant(variant &&); + template<typename T> variant(T &); + template<typename T> variant(const T &); + template<typename T> variant(T &&); template<typename U1, typename U2, ..., typename UN> - variant(variant<U1, U2, ..., UN> &); + variant(variant<U1, U2, ..., UN> &); template<typename U1, typename U2, ..., typename UN> - variant(const variant<U1, U2, ..., UN> &); + variant(const variant<U1, U2, ..., UN> &); template<typename U1, typename U2, ..., typename UN> - variant(variant<U1, U2, ..., UN> &&); - ~variant(); + variant(variant<U1, U2, ..., UN> &&); + ~variant(); - // modifiers - void swap(variant &); - variant & operator=(const variant &); - variant & operator=(variant &&); - template<typename T> variant & operator=(const T &); - template<typename T> variant & operator=(T &&); + // modifiers + void swap(variant &); + variant & operator=(const variant &); + variant & operator=(variant &&); + template<typename T> variant & operator=(const T &); + template<typename T> variant & operator=(T &&); - // queries - int which() const; - bool empty() const; - const std::type_info & type() const; + // queries + int which() const; + bool empty() const; + const std::type_info & type() const; - // relational - bool operator==(const variant &) const; - template<typename U> void operator==(const U &) const; - bool operator!=(const variant &) const; - template<typename U> void operator!=(const U &) const; - bool operator<(const variant &) const; - template<typename U> void operator<(const U &) const; - bool operator>(const variant &) const; - template<typename U> void operator>(const U &) const; - bool operator<=(const variant &) const; - template<typename U> void operator<=(const U &) const; - bool operator>=(const variant &) const; - template<typename U> void operator>=(const U &) const; + // relational + bool operator==(const variant &) const; + template<typename U> void operator==(const U &) const; + bool operator!=(const variant &) const; + template<typename U> void operator!=(const U &) const; + bool operator<(const variant &) const; + template<typename U> void operator<(const U &) const; + bool operator>(const variant &) const; + template<typename U> void operator>(const U &) const; + bool operator<=(const variant &) const; + template<typename U> void operator<=(const U &) const; + bool operator>=(const variant &) const; + template<typename U> void operator>=(const U &) const; };
                                                                              -

                                                                              Description

                                                                              +

                                                                              Description

                                                                              The variant class template (inspired by Andrei Alexandrescu's class of the same name [Ale01A]) is an efficient, @@ -93,7 +93,7 @@ of the destination variant's bounded types. As well, through apply_visitor, variant supports compile-time checked, type-safe - visitation; and through get, + visitation; and through get, variant supports run-time checked, type-safe value retrieval.

                                                                              Notes:

                                                                              @@ -127,13 +127,13 @@ Sequence, thus overcoming this limitation.)
                                                                            -

                                                                            +

                                                                            variant public construct/copy/destruct

                                                                            1. -
                                                                              variant();
                                                                              +
                                                                              variant();
                                                                              @@ -161,7 +161,7 @@
                                                                            2. -
                                                                              variant(const variant & other);
                                                                              +
                                                                              variant(const variant & other);
                                                                              @@ -182,7 +182,7 @@
                                                                            3. -
                                                                              variant(variant && other);
                                                                              +
                                                                              variant(variant && other);
                                                                              @@ -207,7 +207,7 @@
                                                                            4. -
                                                                              template<typename T> variant(T & operand);
                                                                              +
                                                                              template<typename T> variant(T & operand);
                                                                              @@ -236,7 +236,7 @@
                                                                            5. -
                                                                              template<typename T> variant(const T & operand);
                                                                              +
                                                                              template<typename T> variant(const T & operand);
                                                                              @@ -250,7 +250,7 @@
                                                                            6. -
                                                                              template<typename T> variant(T && operand);
                                                                              +
                                                                              template<typename T> variant(T && operand);
                                                                              @@ -271,7 +271,7 @@ 
                                                                            7. template<typename U1, typename U2, ..., typename UN> 
-  variant(variant<U1, U2, ..., UN> & operand);
                                                                              + variant(variant<U1, U2, ..., UN> & operand);
                                                                              8. @@ -309,7 +309,7 @@ 
                                                                            8. template<typename U1, typename U2, ..., typename UN> 
-  variant(const variant<U1, U2, ..., UN> & operand);
                                                                              + variant(const variant<U1, U2, ..., UN> & operand);
                                                                              9. @@ -324,7 +324,7 @@ 
                                                                            9. template<typename U1, typename U2, ..., typename UN> 
-  variant(variant<U1, U2, ..., UN> && operand);
                                                                              + variant(variant<U1, U2, ..., UN> && operand);
                                                                              10. @@ -344,7 +344,7 @@
                                                                            10. -
                                                                              ~variant();
                                                                              +
                                                                              ~variant();
                                                                              @@ -365,11 +365,11 @@
                                                                              -

                                                                              -variant modifiers

                                                                              +

                                                                              +variant modifiers

                                                                              1. -
                                                                                void swap(variant & other);
                                                                                +
                                                                                void swap(variant & other);
                                                                              @@ -402,7 +402,7 @@
                                                                            11. -
                                                                              variant & operator=(const variant & rhs);
                                                                              +
                                                                              variant & operator=(const variant & rhs);
                                                                              @@ -439,7 +439,7 @@
                                                                            12. -
                                                                              variant & operator=(variant && rhs);
                                                                              +
                                                                              variant & operator=(variant && rhs);
                                                                              @@ -479,7 +479,7 @@
                                                                            13. -
                                                                              template<typename T> variant & operator=(const T & rhs);
                                                                              +
                                                                              template<typename T> variant & operator=(const T & rhs);
                                                                              @@ -523,7 +523,7 @@
                                                                            14. -
                                                                              template<typename T> variant & operator=(T && rhs);
                                                                              +
                                                                              template<typename T> variant & operator=(T && rhs);
                                                                              @@ -572,11 +572,11 @@
                                                                              -

                                                                              -variant queries

                                                                              +

                                                                              +variant queries

                                                                              1. -
                                                                                int which() const;
                                                                                +
                                                                                int which() const;
                                                                              @@ -599,7 +599,7 @@
                                                                            15. -
                                                                              bool empty() const;
                                                                              +
                                                                              bool empty() const;
                                                                              @@ -627,7 +627,7 @@
                                                                            16. -
                                                                              const std::type_info & type() const;
                                                                              +
                                                                              const std::type_info & type() const;
                                                                              @@ -657,12 +657,12 @@
                                                                              -

                                                                              -variant relational

                                                                              +

                                                                              +variant relational

                                                                              1. -
                                                                                bool operator==(const variant & rhs) const;
-template<typename U> void operator==(const U &) const;
                                                                                Equality comparison.
                                                                              +
                                                                              bool operator==(const variant & rhs) const;
+template<typename U> void operator==(const U &) const;
                                                                              Equality comparison.
                                                                              @@ -703,8 +703,8 @@
                                                                            17. -
                                                                              bool operator!=(const variant & rhs) const;
-template<typename U> void operator!=(const U &) const;
                                                                              InEquality comparison.
                                                                              +
                                                                              bool operator!=(const variant & rhs) const;
+template<typename U> void operator!=(const U &) const;
                                                                              InEquality comparison.
                                                                              @@ -740,8 +740,8 @@
                                                                            18. -
                                                                              bool operator<(const variant & rhs) const;
-template<typename U> void operator<(const U &) const;
                                                                              LessThan comparison.
                                                                              +
                                                                              bool operator<(const variant & rhs) const;
+template<typename U> void operator<(const U &) const;
                                                                              LessThan comparison.
                                                                              @@ -780,8 +780,8 @@
                                                                            19. -
                                                                              bool operator>(const variant & rhs) const;
-template<typename U> void operator>(const U &) const;
                                                                              GreaterThan comparison.
                                                                              +
                                                                              bool operator>(const variant & rhs) const;
+template<typename U> void operator>(const U &) const;
                                                                              GreaterThan comparison.
                                                                              @@ -816,8 +816,8 @@
                                                                            20. -
                                                                              bool operator<=(const variant & rhs) const;
-template<typename U> void operator<=(const U &) const;
                                                                              LessThan or Equal comparison.
                                                                              +
                                                                              bool operator<=(const variant & rhs) const;
+template<typename U> void operator<=(const U &) const;
                                                                              LessThan or Equal comparison.
                                                                              @@ -852,8 +852,8 @@
                                                                            21. -
                                                                              bool operator>=(const variant & rhs) const;
-template<typename U> void operator>=(const U &) const;
                                                                              GreaterThan or Equal comparison.
                                                                              +
                                                                              bool operator>=(const variant & rhs) const;
+template<typename U> void operator>=(const U &) const;
                                                                              GreaterThan or Equal comparison.
                                                                              @@ -901,7 +901,7 @@
                                                                              -PrevUpHomeNext +PrevUpHomeNext
                                                                              diff --git a/doc/html/boost/variate_generator.html b/doc/html/boost/variate_generator.html index 8f5d19b3c5..69d316a814 100644 --- a/doc/html/boost/variate_generator.html +++ b/doc/html/boost/variate_generator.html @@ -42,70 +42,70 @@ typedef Distribution::result_type result_type; // construct/copy/destruct - variate_generator(Engine, Distribution); + variate_generator(Engine, Distribution); - // public member functions - result_type operator()(); - template<typename T> result_type operator()(const T &); - engine_value_type & engine(); - const engine_value_type & engine() const; - distribution_type & distribution(); - const distribution_type & distribution() const; - result_type min() const; - result_type max() const; + // public member functions + result_type operator()(); + template<typename T> result_type operator()(const T &); + engine_value_type & engine(); + const engine_value_type & engine() const; + distribution_type & distribution(); + const distribution_type & distribution() const; + result_type min() const; + result_type max() const; };
                                                                              -

                                                                              Description

                                                                              +

                                                                              Description

                                                                              A random variate generator is used to join a random number generator together with a random number distribution. Boost.Random provides a vast choice of generators as well as distributions .

                                                                              The argument for the template parameter Engine shall be of the form U, U&, or U*, where U models a uniform random number generator . Then, the member engine_value_type names U (not the pointer or reference to U).

                                                                              Specializations of variate_generator satisfy the requirements of CopyConstructible. They also satisfy the requirements of Assignable unless the template parameter Engine is of the form U&.

                                                                              The complexity of all functions specified in this section is constant. No function described in this section except the constructor throws an exception.

                                                                              -

                                                                              +

                                                                              variate_generator public construct/copy/destruct

                                                                              1. -
                                                                                variate_generator(Engine e, Distribution d);
                                                                                +
                                                                                variate_generator(Engine e, Distribution d);

                                                                                Constructs a variate_generator object with the associated uniform random number generator eng and the associated random distribution d.

                                                                                Throws: If and what the copy constructor of Engine or Distribution throws.

                                                                              -

                                                                              -variate_generator public member functions

                                                                              +

                                                                              +variate_generator public member functions

                                                                              1. -
                                                                                result_type operator()();
                                                                                +
                                                                                result_type operator()();

                                                                                Returns: distribution()(engine())

                                                                              2. -
                                                                                template<typename T> result_type operator()(const T & value);
                                                                                +
                                                                                template<typename T> result_type operator()(const T & value);

                                                                                Returns: distribution()(engine(), value).

                                                                              3. -
                                                                                engine_value_type & engine();
                                                                                +
                                                                                engine_value_type & engine();

                                                                                Returns: A reference to the associated uniform random number generator.

                                                                              4. -
                                                                                const engine_value_type & engine() const;
                                                                                +
                                                                                const engine_value_type & engine() const;

                                                                                Returns: A reference to the associated uniform random number generator.

                                                                              5. -
                                                                                distribution_type & distribution();
                                                                                +
                                                                                distribution_type & distribution();

                                                                                Returns: A reference to the associated random distribution .

                                                                              6. -
                                                                                const distribution_type & distribution() const;
                                                                                +
                                                                                const distribution_type & distribution() const;

                                                                                Returns: A reference to the associated random distribution.

                                                                              7. -
                                                                                result_type min() const;
                                                                                +
                                                                                result_type min() const;

                                                                                Precondition: distribution().min() is well-formed

                                                                                Returns: distribution().min()

                                                                              8. -
                                                                                result_type max() const;
                                                                                +
                                                                                result_type max() const;

                                                                                Precondition: distribution().max() is well-formed

                                                                                Returns: distribution().max()

                                                                                9. diff --git a/doc/html/boost/visit_each.html b/doc/html/boost/visit_each.html index 47963c365e..7843f306e1 100644 --- a/doc/html/boost/visit_each.html +++ b/doc/html/boost/visit_each.html @@ -36,7 +36,7 @@ template<typename Visitor, typename T> void visit_each(const Visitor& visitor, const T& t, int);
                                                                              -

                                                                              Description

                                                                              +

                                                                              Description

                                                                              The visit_each mechanism allows a visitor to be applied to every subobject in a given object. It is used by the Signals library to discover diff --git a/doc/html/boost/visitor_ptr.html b/doc/html/boost/visitor_ptr.html index 5e0a054021..38b1526188 100644 --- a/doc/html/boost/visitor_ptr.html +++ b/doc/html/boost/visitor_ptr.html @@ -36,7 +36,7 @@ template<typename R, typename T> visitor_ptr_t<T,R> visitor_ptr(R (*)(T));

                                                                              -

                                                                              Description

                                                                              +

                                                                              Description

                                                                              Constructs and returns a visitor_ptr_t adaptor over the given function.

                                                                              diff --git a/doc/html/boost/visitor_ptr_t.html b/doc/html/boost/visitor_ptr_t.html index 7a6040a9d1..97abc76856 100644 --- a/doc/html/boost/visitor_ptr_t.html +++ b/doc/html/boost/visitor_ptr_t.html @@ -36,24 +36,24 @@ class visitor_ptr_t : public static_visitor<R> { public: // construct/copy/destruct - explicit visitor_ptr_t(R (*)(T)); + explicit visitor_ptr_t(R (*)(T)); - // static visitor interfaces - R operator()(unspecified-forwarding-type); - template<typename U> void operator()(const U&); + // static visitor interfaces + R operator()(unspecified-forwarding-type); + template<typename U> void operator()(const U&); };
                                                                              -

                                                                              Description

                                                                              +

                                                                              Description

                                                                              Adapts the function given at construction for use as a static visitor of type T with result type R.

                                                                              -

                                                                              +

                                                                              visitor_ptr_t public construct/copy/destruct

                                                                              1. -
                                                                                explicit visitor_ptr_t(R (*)(T));
                                                                                +
                                                                                explicit visitor_ptr_t(R (*)(T));
                                                                                @@ -67,11 +67,11 @@
                                                                                -

                                                                                -visitor_ptr_t static visitor interfaces

                                                                                +

                                                                                +visitor_ptr_t static visitor interfaces

                                                                                1. -
                                                                                  R operator()(unspecified-forwarding-type operand);
-template<typename U> void operator()(const U&);
                                                                                  +
                                                                                  R operator()(unspecified-forwarding-type operand);
+template<typename U> void operator()(const U&);
                                                                                diff --git a/doc/html/boost/xpressive/_.html b/doc/html/boost/xpressive/_.html index 2f78e7cd41..8681350d10 100644 --- a/doc/html/boost/xpressive/_.html +++ b/doc/html/boost/xpressive/_.html @@ -34,7 +34,7 @@ unspecified _;
                                                                                -

                                                                                Description

                                                                                +

                                                                                Description

                                                                                Match any character, similar to '.' in perl syntax with the /s modifier. '_' matches any one character, including the newline.

                                                                                diff --git a/doc/html/boost/xpressive/_b.html b/doc/html/boost/xpressive/_b.html index 1d86db4c4b..b0fc6524c1 100644 --- a/doc/html/boost/xpressive/_b.html +++ b/doc/html/boost/xpressive/_b.html @@ -34,7 +34,7 @@ unspecified _b;
                                                                                -

                                                                                Description

                                                                                +

                                                                                Description

                                                                                '_b' matches the zero-width sub-sequence at the beginning or the end of a word. It is equivalent to (bow | eow). The regex traits are used to determine what constitutes a word character. To match a non-word boundary, use ~_b.

                                                                                diff --git a/doc/html/boost/xpressive/_d.html b/doc/html/boost/xpressive/_d.html index 62901f1c8b..259ecbc1f5 100644 --- a/doc/html/boost/xpressive/_d.html +++ b/doc/html/boost/xpressive/_d.html @@ -34,7 +34,7 @@ unspecified _d;
                                                                                -

                                                                                Description

                                                                                +

                                                                                Description

                                                                                '_d' matches a single digit character. The regex traits are used to determine which characters are digits. Use ~_d to match a character that is not a digit character.

                                                                                diff --git a/doc/html/boost/xpressive/_ln.html b/doc/html/boost/xpressive/_ln.html index 59054b4012..fc650f6b01 100644 --- a/doc/html/boost/xpressive/_ln.html +++ b/doc/html/boost/xpressive/_ln.html @@ -34,7 +34,7 @@ unspecified _ln;
                                                                                -

                                                                                Description

                                                                                +

                                                                                Description

                                                                                '_ln' matches a logical newline sequence. This can be any character in the line separator class, as determined by the regex traits, or the '\r\n' sequence. For the purpose of back-tracking, '\r\n' is treated as a unit. To match any one character that is not a logical newline, use ~_ln.

                                                                                diff --git a/doc/html/boost/xpressive/_n.html b/doc/html/boost/xpressive/_n.html index 827f7d39de..29fc78f742 100644 --- a/doc/html/boost/xpressive/_n.html +++ b/doc/html/boost/xpressive/_n.html @@ -34,7 +34,7 @@ proto::terminal<char>::typeconst _n;
                                                                                -

                                                                                Description

                                                                                +

                                                                                Description

                                                                                '_n' matches a single newline character, '\n'. Use ~_n to match a character that is not a newline.

                                                                                diff --git a/doc/html/boost/xpressive/_s.html b/doc/html/boost/xpressive/_s.html index 2c8804997b..54d2ce3812 100644 --- a/doc/html/boost/xpressive/_s.html +++ b/doc/html/boost/xpressive/_s.html @@ -34,7 +34,7 @@ unspecified _s;
                                                                                -

                                                                                Description

                                                                                +

                                                                                Description

                                                                                '_s' matches a single space character. The regex traits are used to determine which characters are space characters. Use ~_s to match a character that is not a space character.

                                                                                diff --git a/doc/html/boost/xpressive/_w.html b/doc/html/boost/xpressive/_w.html index 35ad7df54d..cd9a6afc00 100644 --- a/doc/html/boost/xpressive/_w.html +++ b/doc/html/boost/xpressive/_w.html @@ -34,7 +34,7 @@ unspecified _w;
                                                                                -

                                                                                Description

                                                                                +

                                                                                Description

                                                                                '_w' matches a single word character. The regex traits are used to determine which characters are word characters. Use ~_w to match a character that is not a word character.

                                                                                diff --git a/doc/html/boost/xpressive/after.html b/doc/html/boost/xpressive/after.html index ceb776e296..f78683c564 100644 --- a/doc/html/boost/xpressive/after.html +++ b/doc/html/boost/xpressive/after.html @@ -35,7 +35,7 @@ template<typenameExpr>unspecifiedafter(Exprconst& expr);
                                                                                -

                                                                                Description

                                                                                +

                                                                                Description

                                                                                after(expr) succeeds if the expr sub-expression would match at the current position minus N in the sequence, where N is the width of expr. expr is not included in the match. For instance, after("foo") succeeds if we are after a "foo". Look-behind assertions can be negated with the bit-complement operator.

                                                                                diff --git a/doc/html/boost/xpressive/alnum.html b/doc/html/boost/xpressive/alnum.html index 5f6cd8169b..2d6597de32 100644 --- a/doc/html/boost/xpressive/alnum.html +++ b/doc/html/boost/xpressive/alnum.html @@ -34,7 +34,7 @@ unspecified alnum;
                                                                                -

                                                                                Description

                                                                                +

                                                                                Description

                                                                                The regex traits are used to determine which characters are alpha-numeric. To match any character that is not alpha-numeric, use ~alnum.

                                                                                diff --git a/doc/html/boost/xpressive/alpha.html b/doc/html/boost/xpressive/alpha.html index 2f8c438aea..ea1f7dbf67 100644 --- a/doc/html/boost/xpressive/alpha.html +++ b/doc/html/boost/xpressive/alpha.html @@ -34,7 +34,7 @@ unspecified alpha;
                                                                                -

                                                                                Description

                                                                                +

                                                                                Description

                                                                                The regex traits are used to determine which characters are alphabetic. To match any character that is not alphabetic, use ~alpha.

                                                                                diff --git a/doc/html/boost/xpressive/as_idm45506840056256.html b/doc/html/boost/xpressive/as_idm45506840056256.html new file mode 100644 index 0000000000..b7cd8427e6 --- /dev/null +++ b/doc/html/boost/xpressive/as_idm45506840056256.html @@ -0,0 +1,96 @@ + + + + +Function template as + + + + + + + + +
                                                                                + + + + + + +
                                                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                +
                                                                                +
                                                                                +PrevUpHomeNext +
                                                                                +
                                                                                +
                                                                                +
                                                                                +

                                                                                Function template as

                                                                                +

                                                                                boost::xpressive::as — as() is a lazy funtion for lexically casting a parameter to a different type.

                                                                                +
                                                                                +

                                                                                Synopsis

                                                                                +
                                                                                // In header: <boost/xpressive/regex_actions.hpp>
+
+
+template<typename T, typename A> unspecified as(A const & a);
                                                                                +
                                                                                +

                                                                                Description

                                                                                +

                                                                                + + +

                                                                                +
                                                                                ++++ + + + + + + + + + + + + + + +

                                                                                Parameters:

                                                                                ++++ + + + + +

                                                                                a

                                                                                The lazy value to lexically cast.

                                                                                Template Parameters:

                                                                                ++++ + + + + +

                                                                                T

                                                                                The type to which to lexically cast the parameter.

                                                                                Returns:

                                                                                A lazy object that, when evaluated, lexically casts its argument to the desired type.

                                                                                +
                                                                                +
                                                                                + + + +
                                                                                Copyright © 2007 Eric Niebler

                                                                                + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                                +
                                                                                +
                                                                                +
                                                                                +PrevUpHomeNext +
                                                                                + + diff --git a/doc/html/boost/xpressive/as_idp358484288.html b/doc/html/boost/xpressive/as_idp358484288.html deleted file mode 100644 index 27354c6811..0000000000 --- a/doc/html/boost/xpressive/as_idp358484288.html +++ /dev/null @@ -1,96 +0,0 @@ - - - - -Function template as - - - - - - - - - - - - - - - -
                                                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                                -
                                                                                -
                                                                                -PrevUpHomeNext -
                                                                                -
                                                                                -
                                                                                -
                                                                                -

                                                                                Function template as

                                                                                -

                                                                                boost::xpressive::as — as() is a lazy funtion for lexically casting a parameter to a different type.

                                                                                -
                                                                                -

                                                                                Synopsis

                                                                                -
                                                                                // In header: <boost/xpressive/regex_actions.hpp>
-
-
-template<typename T, typename A> unspecified as(A const & a);
                                                                                -
                                                                                -

                                                                                Description

                                                                                -

                                                                                - - -

                                                                                -
                                                                                ---- - - - - - - - - - - - - - - -

                                                                                Parameters:

                                                                                ---- - - - - -

                                                                                a

                                                                                The lazy value to lexically cast.

                                                                                Template Parameters:

                                                                                ---- - - - - -

                                                                                T

                                                                                The type to which to lexically cast the parameter.

                                                                                Returns:

                                                                                A lazy object that, when evaluated, lexically casts its argument to the desired type.

                                                                                -
                                                                                -
                                                                                - - - -
                                                                                Copyright © 2007 Eric Niebler

                                                                                - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                                -
                                                                                -
                                                                                -
                                                                                -PrevUpHomeNext -
                                                                                - - diff --git a/doc/html/boost/xpressive/as_xpr.html b/doc/html/boost/xpressive/as_xpr.html index e295b38621..3b817880b8 100644 --- a/doc/html/boost/xpressive/as_xpr.html +++ b/doc/html/boost/xpressive/as_xpr.html @@ -35,7 +35,7 @@ template<typename Literal> unspecified as_xpr(Literal const & literal);
                                                                                -

                                                                                Description

                                                                                +

                                                                                Description

                                                                                Use as_xpr() to turn a literal into a regular expression. For instance, "foo" >> "bar" will not compile because both operands to the right-shift operator are const char*, and no such operator exists. Use as_xpr("foo") >> "bar" instead.

                                                                                You can use as_xpr() with character literals in addition to string literals. For instance, as_xpr('a') will match an 'a'. You can also complement a character literal, as with ~as_xpr('a'). This will match any one character that is not an 'a'.

                                                                                diff --git a/doc/html/boost/xpressive/basic_regex.html b/doc/html/boost/xpressive/basic_regex.html index ae73120a50..b022bd9614 100644 --- a/doc/html/boost/xpressive/basic_regex.html +++ b/doc/html/boost/xpressive/basic_regex.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
                                                                                -PrevUpHomeNext +PrevUpHomeNext
                                                                                @@ -42,28 +42,28 @@ typedef regex_constants::syntax_option_type flag_type; // construct/copy/destruct - basic_regex(); - basic_regex(basic_regex< BidiIter > const &); - template<typename Expr> basic_regex(Expr const &); - basic_regex< BidiIter > & operator=(basic_regex< BidiIter > const &); - template<typename Expr> basic_regex< BidiIter > & operator=(Expr const &); + basic_regex(); + basic_regex(basic_regex< BidiIter > const &); + template<typename Expr> basic_regex(Expr const &); + basic_regex< BidiIter > & operator=(basic_regex< BidiIter > const &); + template<typename Expr> basic_regex< BidiIter > & operator=(Expr const &); - // public member functions - std::size_t mark_count() const; - regex_id_type regex_id() const; - void swap(basic_regex< BidiIter > &); + // public member functions + std::size_t mark_count() const; + regex_id_type regex_id() const; + void swap(basic_regex< BidiIter > &); - // public static functions + // public static functions template<typename InputIter> static basic_regex< BidiIter > - compile(InputIter, InputIter, flag_type = regex_constants::ECMAScript); + compile(InputIter, InputIter, flag_type = regex_constants::ECMAScript); template<typename InputRange> static basic_regex< BidiIter > - compile(InputRange const &, flag_type = regex_constants::ECMAScript); + compile(InputRange const &, flag_type = regex_constants::ECMAScript); static basic_regex< BidiIter > - compile(char_type const *, flag_type = regex_constants::ECMAScript); + compile(char_type const *, flag_type = regex_constants::ECMAScript); static basic_regex< BidiIter > - compile(char_type const *, std::size_t, flag_type); + compile(char_type const *, std::size_t, flag_type); // public data members static regex_constants::syntax_option_type const ECMAScript; @@ -77,15 +77,15 @@ static regex_constants::syntax_option_type const ignore_white_space; };
                                                                                -

                                                                                Description

                                                                                +

                                                                                Description

                                                                                -

                                                                                +

                                                                                basic_regex public construct/copy/destruct

                                                                                1. -
                                                                                  basic_regex();
                                                                                  +
                                                                                  basic_regex();

                                                                                  @@ -107,7 +107,7 @@
                                                                              2. -
                                                                                basic_regex(basic_regex< BidiIter > const & that);
                                                                                +
                                                                                basic_regex(basic_regex< BidiIter > const & that);

                                                                                @@ -143,7 +143,7 @@

                                                                            22. -
                                                                              template<typename Expr> basic_regex(Expr const & expr);
                                                                              +
                                                                              template<typename Expr> basic_regex(Expr const & expr);

                                                                              Construct from a static regular expression.

                                                                              @@ -185,7 +185,7 @@

                                                                          23. -
                                                                            basic_regex< BidiIter > & operator=(basic_regex< BidiIter > const & that);
                                                                            +
                                                                            basic_regex< BidiIter > & operator=(basic_regex< BidiIter > const & that);

                                                                            @@ -226,7 +226,7 @@

                                                                          24. -
                                                                            template<typename Expr> basic_regex< BidiIter > & operator=(Expr const & expr);
                                                                            +
                                                                            template<typename Expr> basic_regex< BidiIter > & operator=(Expr const & expr);

                                                                            Construct from a static regular expression.

                                                                            @@ -280,19 +280,19 @@

                                                                          -

                                                                          -basic_regex public member functions

                                                                          +

                                                                          +basic_regex public member functions

                                                                          1. -
                                                                            std::size_t mark_count() const;
                                                                            +
                                                                            std::size_t mark_count() const;

                                                                            Returns the count of capturing sub-expressions in this regular expression

                                                                          2. -
                                                                            regex_id_type regex_id() const;
                                                                            +
                                                                            regex_id_type regex_id() const;

                                                                            Returns a token which uniquely identifies this regular expression.

                                                                          3. -
                                                                            void swap(basic_regex< BidiIter > & that);
                                                                            +
                                                                            void swap(basic_regex< BidiIter > & that);

                                                                            Swaps the contents of this basic_regex object with another.

                                                                            @@ -335,13 +335,13 @@
                                                                          -

                                                                          -basic_regex public static functions

                                                                          +

                                                                          +basic_regex public static functions

                                                                          1. template<typename InputIter> 
   static basic_regex< BidiIter > 
-  compile(InputIter begin, InputIter end, 
+  compile(InputIter begin, InputIter end, 
           flag_type flags = regex_constants::ECMAScript);

                                                                            Factory method for building a regex object from a range of characters. Equivalent to regex_compiler< BidiIter >().compile(begin, end, flags);

                                                                            @@ -402,19 +402,19 @@ 

                                                                          2. template<typename InputRange> 
   static basic_regex< BidiIter > 
-  compile(InputRange const & pat, 
+  compile(InputRange const & pat, 
           flag_type flags = regex_constants::ECMAScript);

                                                                            This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. 

                                                                          3. static basic_regex< BidiIter > 
-compile(char_type const * begin, 
+compile(char_type const * begin, 
         flag_type flags = regex_constants::ECMAScript);

                                                                            This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. 

                                                                          4. static basic_regex< BidiIter > 
-compile(char_type const * begin, std::size_t len, flag_type flags);
                                                                            +compile(char_type const * begin, std::size_t len, flag_type flags);

                                                                            This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

                                                                          @@ -431,7 +431,7 @@
                                                                          -PrevUpHomeNext +PrevUpHomeNext
                                                                          diff --git a/doc/html/boost/xpressive/before.html b/doc/html/boost/xpressive/before.html index 2ee9e1ff8b..0b36de1ef8 100644 --- a/doc/html/boost/xpressive/before.html +++ b/doc/html/boost/xpressive/before.html @@ -35,7 +35,7 @@ template<typename Expr> unspecified before(Expr const & expr);
                                                                          -

                                                                          Description

                                                                          +

                                                                          Description

                                                                          before(expr) succeeds if the expr sub-expression would match at the current position in the sequence, but expr is not included in the match. For instance, before("foo") succeeds if we are before a "foo". Look-ahead assertions can be negated with the bit-compliment operator.

                                                                          diff --git a/doc/html/boost/xpressive/blank.html b/doc/html/boost/xpressive/blank.html index 5388a12ce1..7b3f33c1ca 100644 --- a/doc/html/boost/xpressive/blank.html +++ b/doc/html/boost/xpressive/blank.html @@ -34,7 +34,7 @@ unspecified blank;
                                                                          -

                                                                          Description

                                                                          +

                                                                          Description

                                                                          The regex traits are used to determine which characters are blank characters. To match any character that is not blank, use ~blank.

                                                                          diff --git a/doc/html/boost/xpressive/bol.html b/doc/html/boost/xpressive/bol.html index 079b652ae7..8a5e6a081d 100644 --- a/doc/html/boost/xpressive/bol.html +++ b/doc/html/boost/xpressive/bol.html @@ -34,7 +34,7 @@ unspecified bol;
                                                                          -

                                                                          Description

                                                                          +

                                                                          Description

                                                                          'bol' matches the zero-width sub-sequence immediately following a logical newline sequence. The regex traits is used to determine what constitutes a logical newline sequence.

                                                                          diff --git a/doc/html/boost/xpressive/bos.html b/doc/html/boost/xpressive/bos.html index 9541199672..ee0a5116df 100644 --- a/doc/html/boost/xpressive/bos.html +++ b/doc/html/boost/xpressive/bos.html @@ -34,7 +34,7 @@ unspecified bos;
                                                                          -

                                                                          Description

                                                                          +

                                                                          Description

                                                                          For the character sequence [begin, end), 'bos' matches the zero-width sub-sequence [begin, begin).

                                                                          diff --git a/doc/html/boost/xpressive/bow.html b/doc/html/boost/xpressive/bow.html index 0843039820..6919349e5a 100644 --- a/doc/html/boost/xpressive/bow.html +++ b/doc/html/boost/xpressive/bow.html @@ -34,7 +34,7 @@ unspecified bow;
                                                                          -

                                                                          Description

                                                                          +

                                                                          Description

                                                                          'bow' matches the zero-width sub-sequence immediately following a non-word character and preceeding a word character. The regex traits are used to determine what constitutes a word character.

                                                                          diff --git a/doc/html/boost/xpressive/by_ref.html b/doc/html/boost/xpressive/by_ref.html index 7759165471..f4a7547c10 100644 --- a/doc/html/boost/xpressive/by_ref.html +++ b/doc/html/boost/xpressive/by_ref.html @@ -37,7 +37,7 @@ proto::terminal<reference_wrapper<basic_regex<BidiIter>const>>::typeconstby_ref(basic_regex<BidiIter>const& rex);
                                                                          -

                                                                          Description

                                                                          +

                                                                          Description

                                                                          diff --git a/doc/html/boost/xpressive/c_regex_traits.html b/doc/html/boost/xpressive/c_regex_traits.html index 20c7bcaeba..71a69f0aa8 100644 --- a/doc/html/boost/xpressive/c_regex_traits.html +++ b/doc/html/boost/xpressive/c_regex_traits.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                                                                          -PrevUpHomeNext +PrevUpHomeNext
                                                                          @@ -35,58 +35,58 @@ template<typename Char> struct c_regex_traits { // construct/copy/destruct - c_regex_traits(locale_type const & = locale_type()); + c_regex_traits(locale_type const & = locale_type()); - // public member functions - bool operator==(c_regex_traits< char_type > const &) const; - bool operator!=(c_regex_traits< char_type > const &) const; - string_type fold_case(char_type) const; - locale_type imbue(locale_type); - template<> char widen(char); - template<> wchar_t widen(char); - template<> unsigned char hash(char); - template<> unsigned char hash(wchar_t); - template<> int value(char, int); - template<> int value(wchar_t, int); + // public member functions + bool operator==(c_regex_traits< char_type > const &) const; + bool operator!=(c_regex_traits< char_type > const &) const; + string_type fold_case(char_type) const; + locale_type imbue(locale_type); + template<> char widen(char); + template<> wchar_t widen(char); + template<> unsigned char hash(char); + template<> unsigned char hash(wchar_t); + template<> int value(char, int); + template<> int value(wchar_t, int); - // public static functions - static char_type widen(char); - static unsigned char hash(char_type); - static char_type translate(char_type); - static char_type translate_nocase(char_type); - static char_type tolower(char_type); - static char_type toupper(char_type); - static bool in_range(char_type, char_type, char_type); - static bool in_range_nocase(char_type, char_type, char_type); - template<typename FwdIter> static string_type transform(FwdIter, FwdIter); + // public static functions + static char_type widen(char); + static unsigned char hash(char_type); + static char_type translate(char_type); + static char_type translate_nocase(char_type); + static char_type tolower(char_type); + static char_type toupper(char_type); + static bool in_range(char_type, char_type, char_type); + static bool in_range_nocase(char_type, char_type, char_type); + template<typename FwdIter> static string_type transform(FwdIter, FwdIter); template<typename FwdIter> - static string_type transform_primary(FwdIter, FwdIter); + static string_type transform_primary(FwdIter, FwdIter); template<typename FwdIter> - static string_type lookup_collatename(FwdIter, FwdIter); + static string_type lookup_collatename(FwdIter, FwdIter); template<typename FwdIter> - static char_class_type lookup_classname(FwdIter, FwdIter, bool); - static bool isctype(char_type, char_class_type); - static int value(char_type, int); - static locale_type getloc(); + static char_class_type lookup_classname(FwdIter, FwdIter, bool); + static bool isctype(char_type, char_class_type); + static int value(char_type, int); + static locale_type getloc(); };
                                                                          -

                                                                          Description

                                                                          +

                                                                          Description

                                                                          -

                                                                          +

                                                                          c_regex_traits public construct/copy/destruct

                                                                          1. -
                                                                            c_regex_traits(locale_type const & loc = locale_type());
                                                                            +
                                                                            c_regex_traits(locale_type const & loc = locale_type());

                                                                            Initialize a c_regex_traits object to use the global C locale.

                                                                          -

                                                                          -c_regex_traits public member functions

                                                                          +

                                                                          +c_regex_traits public member functions

                                                                          1. -
                                                                            bool operator==(c_regex_traits< char_type > const &) const;
                                                                            +
                                                                            bool operator==(c_regex_traits< char_type > const &) const;

                                                                            Checks two c_regex_traits objects for equality

                                                                            @@ -102,7 +102,7 @@
                                                                        5. -
                                                                          bool operator!=(c_regex_traits< char_type > const &) const;
                                                                          +
                                                                          bool operator!=(c_regex_traits< char_type > const &) const;

                                                                          Checks two c_regex_traits objects for inequality

                                                                          @@ -118,7 +118,7 @@
                                                                        6. -
                                                                          string_type fold_case(char_type ch) const;
                                                                          +
                                                                          string_type fold_case(char_type ch) const;

                                                                          Returns a string_type containing all the characters that compare equal disregrarding case to the one passed in. This function can only be called if has_fold_case<c_regex_traits<Char> >::value is true.

                                                                          @@ -150,23 +150,23 @@

                                                                        7. -
                                                                          locale_type imbue(locale_type loc);
                                                                          +
                                                                          locale_type imbue(locale_type loc);

                                                                          No-op

                                                                          8. -
                                                                        8. template<> char widen(char ch);
                                                                          9. -
                                                                        9. template<> wchar_t widen(char ch);
                                                                          10. -
                                                                        10. template<> unsigned char hash(char ch);
                                                                          11. -
                                                                        11. template<> unsigned char hash(wchar_t ch);
                                                                          12. -
                                                                        12. template<> int value(char ch, int radix);
                                                                          13. -
                                                                        13. template<> int value(wchar_t ch, int radix);
                                                                          14. +
                                                                        14. template<> char widen(char ch);
                                                                          15. +
                                                                        15. template<> wchar_t widen(char ch);
                                                                          16. +
                                                                        16. template<> unsigned char hash(char ch);
                                                                          17. +
                                                                        17. template<> unsigned char hash(wchar_t ch);
                                                                          18. +
                                                                        18. template<> int value(char ch, int radix);
                                                                          19. +
                                                                        19. template<> int value(wchar_t ch, int radix);
                                                                        -

                                                                        -c_regex_traits public static functions

                                                                        +

                                                                        +c_regex_traits public static functions

                                                                        1. -
                                                                          static char_type widen(char ch);
                                                                          +
                                                                          static char_type widen(char ch);

                                                                          Convert a char to a Char

                                                                          @@ -198,7 +198,7 @@

                                                                      5. -
                                                                        static unsigned char hash(char_type ch);
                                                                        +
                                                                        static unsigned char hash(char_type ch);

                                                                        Returns a hash value for a Char in the range [0, UCHAR_MAX]

                                                                        @@ -230,7 +230,7 @@

                                                                      6. -
                                                                        static char_type translate(char_type ch);
                                                                        +
                                                                        static char_type translate(char_type ch);

                                                                        No-op

                                                                        @@ -262,7 +262,7 @@

                                                                      7. -
                                                                        static char_type translate_nocase(char_type ch);
                                                                        +
                                                                        static char_type translate_nocase(char_type ch);

                                                                        Converts a character to lower-case using the current global C locale.

                                                                        @@ -294,7 +294,7 @@

                                                                      8. -
                                                                        static char_type tolower(char_type ch);
                                                                        +
                                                                        static char_type tolower(char_type ch);

                                                                        Converts a character to lower-case using the current global C locale.

                                                                        @@ -326,7 +326,7 @@

                                                                    5. -
                                                                      static char_type toupper(char_type ch);
                                                                      +
                                                                      static char_type toupper(char_type ch);

                                                                      Converts a character to upper-case using the current global C locale.

                                                                      @@ -358,7 +358,7 @@

                                                                    6. -
                                                                      static bool in_range(char_type first, char_type last, char_type ch);
                                                                      +
                                                                      static bool in_range(char_type first, char_type last, char_type ch);

                                                                      Checks to see if a character is within a character range.

                                                                      @@ -400,7 +400,7 @@

                                                                    7. -
                                                                      static bool in_range_nocase(char_type first, char_type last, char_type ch);
                                                                      +
                                                                      static bool in_range_nocase(char_type first, char_type last, char_type ch);

                                                                      Checks to see if a character is within a character range, irregardless of case.

                                                                      @@ -452,7 +452,7 @@ 

                                                                    8. template<typename FwdIter> 
-  static string_type transform(FwdIter begin, FwdIter end);
                                                                      + static string_type transform(FwdIter begin, FwdIter end);

                                                                      Returns a sort key for the character sequence designated by the iterator range [F1, F2) such that if the character sequence [G1, G2) sorts before the character sequence [H1, H2) then v.transform(G1, G2) < v.transform(H1, H2).

                                                                      @@ -466,7 +466,7 @@ 
                                                                    9. template<typename FwdIter> 
-  static string_type transform_primary(FwdIter begin, FwdIter end);
                                                                      + static string_type transform_primary(FwdIter begin, FwdIter end);

                                                                      Returns a sort key for the character sequence designated by the iterator range [F1, F2) such that if the character sequence [G1, G2) sorts before the character sequence [H1, H2) when character case is not considered then v.transform_primary(G1, G2) < v.transform_primary(H1, H2).

                                                                      10. @@ -480,7 +480,7 @@ 
                                                                    10. template<typename FwdIter> 
-  static string_type lookup_collatename(FwdIter begin, FwdIter end);
                                                                      + static string_type lookup_collatename(FwdIter begin, FwdIter end);

                                                                      Returns a sequence of characters that represents the collating element consisting of the character sequence designated by the iterator range [F1, F2). Returns an empty string if the character sequence is not a valid collating element.

                                                                      11. @@ -495,7 +495,7 @@ 
                                                                    11. template<typename FwdIter> 
   static char_class_type 
-  lookup_classname(FwdIter begin, FwdIter end, bool icase);
                                                                      + lookup_classname(FwdIter begin, FwdIter end, bool icase);

                                                                      For the character class name represented by the specified character sequence, return the corresponding bitmask representation.

                                                                      @@ -537,7 +537,7 @@

                                                                    12. -
                                                                      static bool isctype(char_type ch, char_class_type mask);
                                                                      +
                                                                      static bool isctype(char_type ch, char_class_type mask);

                                                                      Tests a character against a character class bitmask.

                                                                      @@ -580,7 +580,7 @@

                                                                    13. -
                                                                      static int value(char_type ch, int radix);
                                                                      +
                                                                      static int value(char_type ch, int radix);

                                                                      Convert a digit character into the integer it represents.

                                                                      @@ -623,7 +623,7 @@

                                                                  5. -
                                                                    static locale_type getloc();
                                                                    +
                                                                    static locale_type getloc();

                                                                    No-op

                                                                  @@ -640,7 +640,7 @@
                                                                  -PrevUpHomeNext +PrevUpHomeNext
                                                                  diff --git a/doc/html/boost/xpressive/check.html b/doc/html/boost/xpressive/check.html index cd5b4ce806..ff7799f6be 100644 --- a/doc/html/boost/xpressive/check.html +++ b/doc/html/boost/xpressive/check.html @@ -35,7 +35,7 @@ template<typename T> unspecified check(T const & t);
                                                                  -

                                                                  Description

                                                                  +

                                                                  Description

                                                                  A user-defined assertion is a kind of semantic action that evaluates a Boolean lambda and, if it evaluates to false, causes the match to fail at that location in the string. This will cause backtracking, so the match may ultimately succeed.

                                                                  To use check() to specify a user-defined assertion in a regex, use the following syntax:

                                                                  diff --git a/doc/html/boost/xpressive/cntrl.html b/doc/html/boost/xpressive/cntrl.html index 41ac4f2644..74dae658c0 100644 --- a/doc/html/boost/xpressive/cntrl.html +++ b/doc/html/boost/xpressive/cntrl.html @@ -34,7 +34,7 @@ unspecified cntrl;
                                                                  -

                                                                  Description

                                                                  +

                                                                  Description

                                                                  The regex traits are used to determine which characters are control characters. To match any character that is not a control character, use ~cntrl.

                                                                  diff --git a/doc/html/boost/xpressive/const_ca_idm45506840039776.html b/doc/html/boost/xpressive/const_ca_idm45506840039776.html new file mode 100644 index 0000000000..3fd32502d1 --- /dev/null +++ b/doc/html/boost/xpressive/const_ca_idm45506840039776.html @@ -0,0 +1,96 @@ + + + + +Function template const_cast_ + + + + + + + + +
                                                                  + + + + + + +
                                                                  Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                  +
                                                                  +
                                                                  +PrevUpHomeNext +
                                                                  +
                                                                  +
                                                                  +
                                                                  +

                                                                  Function template const_cast_

                                                                  +

                                                                  boost::xpressive::const_cast_ — dynamic_cast_ is a lazy funtion for const-casting a parameter to a different type.

                                                                  +
                                                                  +

                                                                  Synopsis

                                                                  +
                                                                  // In header: <boost/xpressive/regex_actions.hpp>
+
+
+template<typename T, typename A> unspecified const_cast_(A const & a);
                                                                  +
                                                                  +

                                                                  Description

                                                                  +

                                                                  + + +

                                                                  +
                                                                  ++++ + + + + + + + + + + + + + + +

                                                                  Parameters:

                                                                  ++++ + + + + +

                                                                  a

                                                                  The lazy value to const-cast.

                                                                  Template Parameters:

                                                                  ++++ + + + + +

                                                                  T

                                                                  The type to which to const-cast the parameter.

                                                                  Returns:

                                                                  A lazy object that, when evaluated, const-casts its argument to the desired type.

                                                                  +
                                                                  +
                                                                  + + + +
                                                                  Copyright © 2007 Eric Niebler

                                                                  + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                  +
                                                                  +
                                                                  +
                                                                  +PrevUpHomeNext +
                                                                  + + diff --git a/doc/html/boost/xpressive/const_cast_idp358500768.html b/doc/html/boost/xpressive/const_cast_idp358500768.html deleted file mode 100644 index a088eb0230..0000000000 --- a/doc/html/boost/xpressive/const_cast_idp358500768.html +++ /dev/null @@ -1,96 +0,0 @@ - - - - -Function template const_cast_ - - - - - - - - - - - - - - - -
                                                                  Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                  -
                                                                  -
                                                                  -PrevUpHomeNext -
                                                                  -
                                                                  -
                                                                  -
                                                                  -

                                                                  Function template const_cast_

                                                                  -

                                                                  boost::xpressive::const_cast_ — dynamic_cast_ is a lazy funtion for const-casting a parameter to a different type.

                                                                  -
                                                                  -

                                                                  Synopsis

                                                                  -
                                                                  // In header: <boost/xpressive/regex_actions.hpp>
-
-
-template<typename T, typename A> unspecified const_cast_(A const & a);
                                                                  -
                                                                  -

                                                                  Description

                                                                  -

                                                                  - - -

                                                                  -
                                                                  ---- - - - - - - - - - - - - - - -

                                                                  Parameters:

                                                                  ---- - - - - -

                                                                  a

                                                                  The lazy value to const-cast.

                                                                  Template Parameters:

                                                                  ---- - - - - -

                                                                  T

                                                                  The type to which to const-cast the parameter.

                                                                  Returns:

                                                                  A lazy object that, when evaluated, const-casts its argument to the desired type.

                                                                  -
                                                                  -
                                                                  - - - -
                                                                  Copyright © 2007 Eric Niebler

                                                                  - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                  -
                                                                  -
                                                                  -
                                                                  -PrevUpHomeNext -
                                                                  - - diff --git a/doc/html/boost/xpressive/construc_idm45506839992080.html b/doc/html/boost/xpressive/construc_idm45506839992080.html new file mode 100644 index 0000000000..55a5765662 --- /dev/null +++ b/doc/html/boost/xpressive/construc_idm45506839992080.html @@ -0,0 +1,97 @@ + + + + +Function template construct + + + + + + + + + + + + + + + +
                                                                  Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                  +
                                                                  +
                                                                  +PrevUpHomeNext +
                                                                  +
                                                                  +
                                                                  +
                                                                  +

                                                                  Function template construct

                                                                  +

                                                                  boost::xpressive::construct — A lazy funtion for constructing objects objects of the specified type.

                                                                  +
                                                                  +

                                                                  Synopsis

                                                                  +
                                                                  // In header: <boost/xpressive/regex_actions.hpp>
+
+
+template<typename T, typename... Args> 
+  unspecified construct(Args const &... args);
                                                                  +
                                                                  +

                                                                  Description

                                                                  +

                                                                  + + +

                                                                  +
                                                                  ++++ + + + + + + + + + + + + + + +

                                                                  Parameters:

                                                                  ++++ + + + + +

                                                                  args

                                                                  The arguments to the constructor.

                                                                  Template Parameters:

                                                                  ++++ + + + + +

                                                                  T

                                                                  The type of object to construct.

                                                                  Returns:

                                                                  A lazy object that, when evaluated, returns T(xs...), where xs... is the result of evaluating the lazy arguments args....

                                                                  +
                                                                  +
                                                                  + + + +
                                                                  Copyright © 2007 Eric Niebler

                                                                  + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                                  +
                                                                  +
                                                                  +
                                                                  +PrevUpHomeNext +
                                                                  + + diff --git a/doc/html/boost/xpressive/construct_idp358548464.html b/doc/html/boost/xpressive/construct_idp358548464.html deleted file mode 100644 index a9045e2531..0000000000 --- a/doc/html/boost/xpressive/construct_idp358548464.html +++ /dev/null @@ -1,97 +0,0 @@ - - - - -Function template construct - - - - - - - - - - - - - - - -
                                                                  Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                                  -
                                                                  -
                                                                  -PrevUpHomeNext -
                                                                  -
                                                                  -
                                                                  -
                                                                  -

                                                                  Function template construct

                                                                  -

                                                                  boost::xpressive::construct — A lazy funtion for constructing objects objects of the specified type.

                                                                  -
                                                                  -

                                                                  Synopsis

                                                                  -
                                                                  // In header: <boost/xpressive/regex_actions.hpp>
-
-
-template<typename T, typename... Args> 
-  unspecified construct(Args const &... args);
                                                                  -
                                                                  -

                                                                  Description

                                                                  -

                                                                  - - -

                                                                  -
                                                                  ---- - - - - - - - - - - - - - - -

                                                                  Parameters:

                                                                  ---- - - - - -

                                                                  args

                                                                  The arguments to the constructor.

                                                                  Template Parameters:

                                                                  ---- - - - - -

                                                                  T

                                                                  The type of object to construct.

                                                                  Returns:

                                                                  A lazy object that, when evaluated, returns T(xs...), where xs... is the result of evaluating the lazy arguments args....

                                                                  -
                                                                  -
                                                                  - - - -
                                                                  Copyright © 2007 Eric Niebler

                                                                  - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                                  -
                                                                  -
                                                                  -
                                                                  -PrevUpHomeNext -
                                                                  - - diff --git a/doc/html/boost/xpressive/cpp_regex_traits.html b/doc/html/boost/xpressive/cpp_regex_traits.html index ce3f3d3cd8..b5423fa57a 100644 --- a/doc/html/boost/xpressive/cpp_regex_traits.html +++ b/doc/html/boost/xpressive/cpp_regex_traits.html @@ -35,55 +35,55 @@ template<typename Char> struct cpp_regex_traits { // construct/copy/destruct - cpp_regex_traits(locale_type const & = locale_type()); + cpp_regex_traits(locale_type const & = locale_type()); - // public member functions - bool operator==(cpp_regex_traits< char_type > const &) const; - bool operator!=(cpp_regex_traits< char_type > const &) const; - char_type widen(char) const; - char_type translate_nocase(char_type) const; - char_type tolower(char_type) const; - char_type toupper(char_type) const; - string_type fold_case(char_type) const; - bool in_range_nocase(char_type, char_type, char_type) const; + // public member functions + bool operator==(cpp_regex_traits< char_type > const &) const; + bool operator!=(cpp_regex_traits< char_type > const &) const; + char_type widen(char) const; + char_type translate_nocase(char_type) const; + char_type tolower(char_type) const; + char_type toupper(char_type) const; + string_type fold_case(char_type) const; + bool in_range_nocase(char_type, char_type, char_type) const; template<typename FwdIter> - string_type transform_primary(FwdIter, FwdIter) const; + string_type transform_primary(FwdIter, FwdIter) const; template<typename FwdIter> - string_type lookup_collatename(FwdIter, FwdIter) const; + string_type lookup_collatename(FwdIter, FwdIter) const; template<typename FwdIter> - char_class_type lookup_classname(FwdIter, FwdIter, bool) const; - bool isctype(char_type, char_class_type) const; - int value(char_type, int) const; - locale_type imbue(locale_type); - locale_type getloc() const; - template<> unsigned char hash(unsigned char); - template<> unsigned char hash(char); - template<> unsigned char hash(signed char); - template<> unsigned char hash(wchar_t); + char_class_type lookup_classname(FwdIter, FwdIter, bool) const; + bool isctype(char_type, char_class_type) const; + int value(char_type, int) const; + locale_type imbue(locale_type); + locale_type getloc() const; + template<> unsigned char hash(unsigned char); + template<> unsigned char hash(char); + template<> unsigned char hash(signed char); + template<> unsigned char hash(wchar_t); - // public static functions - static unsigned char hash(char_type); - static char_type translate(char_type); - static bool in_range(char_type, char_type, char_type); + // public static functions + static unsigned char hash(char_type); + static char_type translate(char_type); + static bool in_range(char_type, char_type, char_type); };
                                                                  -

                                                                  Description

                                                                  +

                                                                  Description

                                                                  -

                                                                  +

                                                                  cpp_regex_traits public construct/copy/destruct

                                                                  1. -
                                                                    cpp_regex_traits(locale_type const & loc = locale_type());
                                                                    +
                                                                    cpp_regex_traits(locale_type const & loc = locale_type());

                                                                    Initialize a cpp_regex_traits object to use the specified std::locale, or the global std::locale if none is specified.

                                                                  -

                                                                  -cpp_regex_traits public member functions

                                                                  +

                                                                  +cpp_regex_traits public member functions

                                                                  1. -
                                                                    bool operator==(cpp_regex_traits< char_type > const & that) const;
                                                                    +
                                                                    bool operator==(cpp_regex_traits< char_type > const & that) const;

                                                                    Checks two cpp_regex_traits objects for equality

                                                                    @@ -99,7 +99,7 @@
                                                                5. -
                                                                  bool operator!=(cpp_regex_traits< char_type > const & that) const;
                                                                  +
                                                                  bool operator!=(cpp_regex_traits< char_type > const & that) const;

                                                                  Checks two cpp_regex_traits objects for inequality

                                                                  @@ -115,7 +115,7 @@
                                                                6. -
                                                                  char_type widen(char ch) const;
                                                                  +
                                                                  char_type widen(char ch) const;

                                                                  Convert a char to a Char

                                                                  @@ -147,7 +147,7 @@

                                                                7. -
                                                                  char_type translate_nocase(char_type ch) const;
                                                                  +
                                                                  char_type translate_nocase(char_type ch) const;

                                                                  Converts a character to lower-case using the internally-stored std::locale.

                                                                  @@ -179,7 +179,7 @@

                                                                8. -
                                                                  char_type tolower(char_type ch) const;
                                                                  +
                                                                  char_type tolower(char_type ch) const;

                                                                  Converts a character to lower-case using the internally-stored std::locale.

                                                                  @@ -211,7 +211,7 @@

                                                                9. -
                                                                  char_type toupper(char_type ch) const;
                                                                  +
                                                                  char_type toupper(char_type ch) const;

                                                                  Converts a character to upper-case using the internally-stored std::locale.

                                                                  @@ -243,7 +243,7 @@

                                                                10. -
                                                                  string_type fold_case(char_type ch) const;
                                                                  +
                                                                  string_type fold_case(char_type ch) const;

                                                                  Returns a string_type containing all the characters that compare equal disregrarding case to the one passed in. This function can only be called if has_fold_case<cpp_regex_traits<Char> >::value is true.

                                                                  @@ -275,7 +275,7 @@

                                                              5. -
                                                                bool in_range_nocase(char_type first, char_type last, char_type ch) const;
                                                                +
                                                                bool in_range_nocase(char_type first, char_type last, char_type ch) const;

                                                                Checks to see if a character is within a character range, irregardless of case.

                                                                @@ -327,7 +327,7 @@ 

                                                              6. template<typename FwdIter> 
-  string_type transform_primary(FwdIter, FwdIter) const;
                                                                + string_type transform_primary(FwdIter, FwdIter) const;

                                                                Returns a sort key for the character sequence designated by the iterator range [F1, F2) such that if the character sequence [G1, G2) sorts before the character sequence [H1, H2) when character case is not considered then v.transform_primary(G1, G2) < v.transform_primary(H1, H2).

                                                                @@ -341,7 +341,7 @@ 
                                                              7. template<typename FwdIter> 
-  string_type lookup_collatename(FwdIter, FwdIter) const;
                                                                + string_type lookup_collatename(FwdIter, FwdIter) const;

                                                                Returns a sequence of characters that represents the collating element consisting of the character sequence designated by the iterator range [F1, F2). Returns an empty string if the character sequence is not a valid collating element.

                                                                8. @@ -356,7 +356,7 @@ 
                                                              8. template<typename FwdIter> 
   char_class_type 
-  lookup_classname(FwdIter begin, FwdIter end, bool icase) const;
                                                                + lookup_classname(FwdIter begin, FwdIter end, bool icase) const;

                                                                For the character class name represented by the specified character sequence, return the corresponding bitmask representation.

                                                                @@ -398,7 +398,7 @@

                                                              9. -
                                                                bool isctype(char_type ch, char_class_type mask) const;
                                                                +
                                                                bool isctype(char_type ch, char_class_type mask) const;

                                                                Tests a character against a character class bitmask.

                                                                @@ -441,7 +441,7 @@

                                                              10. -
                                                                int value(char_type ch, int radix) const;
                                                                +
                                                                int value(char_type ch, int radix) const;

                                                                Convert a digit character into the integer it represents.

                                                                @@ -484,7 +484,7 @@

                                                              11. -
                                                                locale_type imbue(locale_type loc);
                                                                +
                                                                locale_type imbue(locale_type loc);

                                                                Imbues *this with loc

                                                                @@ -516,21 +516,21 @@

                                                              12. -
                                                                locale_type getloc() const;
                                                                +
                                                                locale_type getloc() const;

                                                                Returns the current std::locale used by *this.

                                                                13. -
                                                              13. template<> unsigned char hash(unsigned char ch);
                                                                14. -
                                                              14. template<> unsigned char hash(char ch);
                                                                15. -
                                                              15. template<> unsigned char hash(signed char ch);
                                                                16. -
                                                              16. template<> unsigned char hash(wchar_t ch);
                                                                17. +
                                                              17. template<> unsigned char hash(unsigned char ch);
                                                                18. +
                                                              18. template<> unsigned char hash(char ch);
                                                                19. +
                                                              19. template<> unsigned char hash(signed char ch);
                                                                20. +
                                                              20. template<> unsigned char hash(wchar_t ch);
                                                              -

                                                              -cpp_regex_traits public static functions

                                                              +

                                                              +cpp_regex_traits public static functions

                                                              1. -
                                                                static unsigned char hash(char_type ch);
                                                                +
                                                                static unsigned char hash(char_type ch);

                                                                Returns a hash value for a Char in the range [0, UCHAR_MAX]

                                                                @@ -562,7 +562,7 @@

                                                            5. -
                                                              static char_type translate(char_type ch);
                                                              +
                                                              static char_type translate(char_type ch);

                                                              No-op

                                                              @@ -594,7 +594,7 @@

                                                            6. -
                                                              static bool in_range(char_type first, char_type last, char_type ch);
                                                              +
                                                              static bool in_range(char_type first, char_type last, char_type ch);

                                                              Checks to see if a character is within a character range.

                                                              diff --git a/doc/html/boost/xpressive/cref.html b/doc/html/boost/xpressive/cref.html index 441c3d8945..0df18f6fca 100644 --- a/doc/html/boost/xpressive/cref.html +++ b/doc/html/boost/xpressive/cref.html @@ -35,7 +35,7 @@ template<typename T> reference< T const > const cref(T const & t);

                                                              7. -

                                                              Description

                                                              +

                                                              Description

                                                              diff --git a/doc/html/boost/xpressive/digit.html b/doc/html/boost/xpressive/digit.html index d481f5f362..6a4685201d 100644 --- a/doc/html/boost/xpressive/digit.html +++ b/doc/html/boost/xpressive/digit.html @@ -34,7 +34,7 @@ unspecified digit;
                                                              -

                                                              Description

                                                              +

                                                              Description

                                                              The regex traits are used to determine which characters are digits. To match any character that is not a digit, use ~digit.

                                                              diff --git a/doc/html/boost/xpressive/dynamic__idm45506840045280.html b/doc/html/boost/xpressive/dynamic__idm45506840045280.html new file mode 100644 index 0000000000..97bbec03b8 --- /dev/null +++ b/doc/html/boost/xpressive/dynamic__idm45506840045280.html @@ -0,0 +1,96 @@ + + + + +Function template dynamic_cast_ + + + + + + + + +
                                                              + + + + + + +
                                                              Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                              +
                                                              +
                                                              +PrevUpHomeNext +
                                                              +
                                                              +
                                                              +
                                                              +

                                                              Function template dynamic_cast_

                                                              +

                                                              boost::xpressive::dynamic_cast_ — dynamic_cast_ is a lazy funtion for dynamically casting a parameter to a different type.

                                                              +
                                                              +

                                                              Synopsis

                                                              +
                                                              // In header: <boost/xpressive/regex_actions.hpp>
+
+
+template<typename T, typename A> unspecified dynamic_cast_(A const & a);
                                                              +
                                                              +

                                                              Description

                                                              +

                                                              + + +

                                                              +
                                                              ++++ + + + + + + + + + + + + + + +

                                                              Parameters:

                                                              ++++ + + + + +

                                                              a

                                                              The lazy value to dynamically cast.

                                                              Template Parameters:

                                                              ++++ + + + + +

                                                              T

                                                              The type to which to dynamically cast the parameter.

                                                              Returns:

                                                              A lazy object that, when evaluated, dynamically casts its argument to the desired type.

                                                              +
                                                              +
                                                              + + + +
                                                              Copyright © 2007 Eric Niebler

                                                              + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                              +
                                                              +
                                                              +
                                                              +PrevUpHomeNext +
                                                              + + diff --git a/doc/html/boost/xpressive/dynamic_cast_idp358495264.html b/doc/html/boost/xpressive/dynamic_cast_idp358495264.html deleted file mode 100644 index 55cd3a350f..0000000000 --- a/doc/html/boost/xpressive/dynamic_cast_idp358495264.html +++ /dev/null @@ -1,96 +0,0 @@ - - - - -Function template dynamic_cast_ - - - - - - - - - - - - - - - -
                                                              Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                              -
                                                              -
                                                              -PrevUpHomeNext -
                                                              -
                                                              -
                                                              -
                                                              -

                                                              Function template dynamic_cast_

                                                              -

                                                              boost::xpressive::dynamic_cast_ — dynamic_cast_ is a lazy funtion for dynamically casting a parameter to a different type.

                                                              -
                                                              -

                                                              Synopsis

                                                              -
                                                              // In header: <boost/xpressive/regex_actions.hpp>
-
-
-template<typename T, typename A> unspecified dynamic_cast_(A const & a);
                                                              -
                                                              -

                                                              Description

                                                              -

                                                              - - -

                                                              -
                                                              ---- - - - - - - - - - - - - - - -

                                                              Parameters:

                                                              ---- - - - - -

                                                              a

                                                              The lazy value to dynamically cast.

                                                              Template Parameters:

                                                              ---- - - - - -

                                                              T

                                                              The type to which to dynamically cast the parameter.

                                                              Returns:

                                                              A lazy object that, when evaluated, dynamically casts its argument to the desired type.

                                                              -
                                                              -
                                                              - - - -
                                                              Copyright © 2007 Eric Niebler

                                                              - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                              -
                                                              -
                                                              -
                                                              -PrevUpHomeNext -
                                                              - - diff --git a/doc/html/boost/xpressive/eol.html b/doc/html/boost/xpressive/eol.html index 215ea87b7a..13db361269 100644 --- a/doc/html/boost/xpressive/eol.html +++ b/doc/html/boost/xpressive/eol.html @@ -34,7 +34,7 @@ unspecified eol;
                                                              -

                                                              Description

                                                              +

                                                              Description

                                                              'eol' matches the zero-width sub-sequence immediately preceeding a logical newline sequence. The regex traits is used to determine what constitutes a logical newline sequence.

                                                              diff --git a/doc/html/boost/xpressive/eos.html b/doc/html/boost/xpressive/eos.html index 10b37bccd0..fc8546575c 100644 --- a/doc/html/boost/xpressive/eos.html +++ b/doc/html/boost/xpressive/eos.html @@ -34,7 +34,7 @@ unspecified eos;
                                                              -

                                                              Description

                                                              +

                                                              Description

                                                              For the character sequence [begin, end), 'eos' matches the zero-width sub-sequence [end, end).

                                                              diff --git a/doc/html/boost/xpressive/eow.html b/doc/html/boost/xpressive/eow.html index 79d52ad743..89686c025d 100644 --- a/doc/html/boost/xpressive/eow.html +++ b/doc/html/boost/xpressive/eow.html @@ -34,7 +34,7 @@ unspecified eow;
                                                              -

                                                              Description

                                                              +

                                                              Description

                                                              'eow' matches the zero-width sub-sequence immediately following a word character and preceeding a non-word character. The regex traits are used to determine what constitutes a word character.

                                                              diff --git a/doc/html/boost/xpressive/function.html b/doc/html/boost/xpressive/function.html index cf88bc2c4e..d0a5f49a42 100644 --- a/doc/html/boost/xpressive/function.html +++ b/doc/html/boost/xpressive/function.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                                                              -PrevUpHomeNext +PrevUpHomeNext
                                                              @@ -38,7 +38,7 @@ typedef proto::terminal< PolymorphicFunctionObject >::type type; };
                                                              -

                                                              Description

                                                              +

                                                              Description

                                                              Use xpressive::function<> to turn an ordinary polymorphic function object type into a type that can be used to declare an object for use in xpressive semantic actions.

                                                              For example, the global object xpressive::push_back can be used to create deferred actions that have the effect of pushing a value into a container. It is defined with xpressive::function<> as follows:

                                                              xpressive::function<xpressive::op::push_back>::type const push_back = {};
@@ -64,7 +64,7 @@
 
 
                                                              
 
                                                              
-PrevUpHomeNext
+PrevUpHomeNext
 
                                                              
 
 
diff --git a/doc/html/boost/xpressive/graph.html b/doc/html/boost/xpressive/graph.html
index 42ef43efc0..d2e8524666 100644
--- a/doc/html/boost/xpressive/graph.html
+++ b/doc/html/boost/xpressive/graph.html
@@ -34,7 +34,7 @@
 
 unspecified graph;
                                                              -

                                                              Description

                                                              +

                                                              Description

                                                              The regex traits are used to determine which characters are graphable. To match any character that is not graphable, use ~graph.

                                                              diff --git a/doc/html/boost/xpressive/has_fold_case_idp359300880.html b/doc/html/boost/xpressive/has_fold_case_idp359300880.html deleted file mode 100644 index 815f47662d..0000000000 --- a/doc/html/boost/xpressive/has_fold_case_idp359300880.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct has_fold_case<c_regex_traits< char >> - - - - - - - - -
                                                              - - - - - - -
                                                              Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                              -
                                                              -
                                                              -PrevUpHomeNext -
                                                              -
                                                              -
                                                              -
                                                              -

                                                              Struct has_fold_case<c_regex_traits< char >>

                                                              -

                                                              boost::xpressive::has_fold_case<c_regex_traits< char >>

                                                              -
                                                              -

                                                              Synopsis

                                                              -
                                                              // In header: <boost/xpressive/traits/c_regex_traits.hpp>
-
-
-struct has_fold_case<c_regex_traits< char >> : public true_ {
-};
                                                              -
                                                              - - - -
                                                              Copyright © 2007 Eric Niebler

                                                              - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                              -
                                                              -
                                                              -
                                                              -PrevUpHomeNext -
                                                              - - diff --git a/doc/html/boost/xpressive/has_fold_case_idp359305424.html b/doc/html/boost/xpressive/has_fold_case_idp359305424.html deleted file mode 100644 index ae4ee8ae43..0000000000 --- a/doc/html/boost/xpressive/has_fold_case_idp359305424.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct has_fold_case<cpp_regex_traits< char >> - - - - - - - - - - - - - - - -
                                                              Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                              -
                                                              -
                                                              -PrevUpHomeNext -
                                                              -
                                                              -
                                                              -
                                                              -

                                                              Struct has_fold_case<cpp_regex_traits< char >>

                                                              -

                                                              boost::xpressive::has_fold_case<cpp_regex_traits< char >>

                                                              -
                                                              -

                                                              Synopsis

                                                              -
                                                              // In header: <boost/xpressive/traits/cpp_regex_traits.hpp>
-
-
-struct has_fold_case<cpp_regex_traits< char >> : public true_ {
-};
                                                              -
                                                              - - - -
                                                              Copyright © 2007 Eric Niebler

                                                              - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                              -
                                                              -
                                                              -
                                                              -PrevUpHomeNext -
                                                              - - diff --git a/doc/html/boost/xpressive/has_fold_idm45506839235120.html b/doc/html/boost/xpressive/has_fold_idm45506839235120.html new file mode 100644 index 0000000000..1d7a7f2789 --- /dev/null +++ b/doc/html/boost/xpressive/has_fold_idm45506839235120.html @@ -0,0 +1,52 @@ + + + + +Struct has_fold_case<cpp_regex_traits< char >> + + + + + + + + + + + + + + + +
                                                              Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                              +
                                                              +
                                                              +PrevUpHomeNext +
                                                              +
                                                              +
                                                              +
                                                              +

                                                              Struct has_fold_case<cpp_regex_traits< char >>

                                                              +

                                                              boost::xpressive::has_fold_case<cpp_regex_traits< char >>

                                                              +
                                                              +

                                                              Synopsis

                                                              +
                                                              // In header: <boost/xpressive/traits/cpp_regex_traits.hpp>
+
+
+struct has_fold_case<cpp_regex_traits< char >> : public true_ {
+};
                                                              +
                                                              + + + +
                                                              Copyright © 2007 Eric Niebler

                                                              + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                              +
                                                              +
                                                              +
                                                              +PrevUpHomeNext +
                                                              + + diff --git a/doc/html/boost/xpressive/has_fold_idm45506839239664.html b/doc/html/boost/xpressive/has_fold_idm45506839239664.html new file mode 100644 index 0000000000..9fca0408f4 --- /dev/null +++ b/doc/html/boost/xpressive/has_fold_idm45506839239664.html @@ -0,0 +1,52 @@ + + + + +Struct has_fold_case<c_regex_traits< char >> + + + + + + + + + + + + + + + +
                                                              Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                              +
                                                              +
                                                              +PrevUpHomeNext +
                                                              +
                                                              +
                                                              +
                                                              +

                                                              Struct has_fold_case<c_regex_traits< char >>

                                                              +

                                                              boost::xpressive::has_fold_case<c_regex_traits< char >>

                                                              +
                                                              +

                                                              Synopsis

                                                              +
                                                              // In header: <boost/xpressive/traits/c_regex_traits.hpp>
+
+
+struct has_fold_case<c_regex_traits< char >> : public true_ {
+};
                                                              +
                                                              + + + +
                                                              Copyright © 2007 Eric Niebler

                                                              + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                              +
                                                              +
                                                              +
                                                              +PrevUpHomeNext +
                                                              + + diff --git a/doc/html/boost/xpressive/icase.html b/doc/html/boost/xpressive/icase.html index ee47a173f5..0e182cb54b 100644 --- a/doc/html/boost/xpressive/icase.html +++ b/doc/html/boost/xpressive/icase.html @@ -35,7 +35,7 @@ template<typename Expr> unspecified icase(Expr const & expr);
                                                              -

                                                              Description

                                                              +

                                                              Description

                                                              Use icase() to make a sub-expression case-insensitive. For instance, "foo" >> icase(set['b'] >> "ar") will match "foo" exactly followed by "bar" irrespective of case.

                                                              diff --git a/doc/html/boost/xpressive/imbue.html b/doc/html/boost/xpressive/imbue.html index ea7cf6cf78..f2c4f460f6 100644 --- a/doc/html/boost/xpressive/imbue.html +++ b/doc/html/boost/xpressive/imbue.html @@ -35,7 +35,7 @@ template<typename Locale> unspecified imbue(Locale const & loc);
                                                              -

                                                              Description

                                                              +

                                                              Description

                                                              imbue() instructs the regex engine to use the specified traits or locale when matching the regex. The entire expression must use the same traits/locale. For instance, the following specifies a locale for use with a regex: std::locale loc; sregex rx = imbue(loc)(+digit);

                                                              diff --git a/doc/html/boost/xpressive/inf.html b/doc/html/boost/xpressive/inf.html index 099e314187..e2c9e116ce 100644 --- a/doc/html/boost/xpressive/inf.html +++ b/doc/html/boost/xpressive/inf.html @@ -34,7 +34,7 @@ unsigned int const inf;
                                                              -

                                                              Description

                                                              +

                                                              Description

                                                              Magic value used with the repeat<>() function template to specify an unbounded repeat. Use as: repeat<17, inf>('a'). The equivalent in perl is /a{17,}/.

                                                              diff --git a/doc/html/boost/xpressive/keep.html b/doc/html/boost/xpressive/keep.html index ed1eba96b4..dc2c594faa 100644 --- a/doc/html/boost/xpressive/keep.html +++ b/doc/html/boost/xpressive/keep.html @@ -35,7 +35,7 @@ template<typename Expr> unspecified keep(Expr const & expr);
                                                            -

                                                            Description

                                                            +

                                                            Description

                                                            Turn off back-tracking for a sub-expression. Any branches or repeats within the sub-expression will match only one way, and no other alternatives are tried.

                                                            diff --git a/doc/html/boost/xpressive/let.html b/doc/html/boost/xpressive/let.html index 8ede2d6950..cb7585297f 100644 --- a/doc/html/boost/xpressive/let.html +++ b/doc/html/boost/xpressive/let.html @@ -8,7 +8,7 @@ - +
                                                            @@ -21,7 +21,7 @@
                                                            -PrevUpHomeNext +PrevUpHomeNext
                                                            @@ -35,7 +35,7 @@ template<typename... ArgBindings> unspecified let(ArgBindings const &... args);
                                                            -

                                                            Description

                                                            +

                                                            Description

                                                            xpressive::let() serves the same purpose as match_results::let(); that is, it binds a placeholder to a local value. The purpose is to allow a regex with semantic actions to be defined that refers to objects that do not yet exist. Rather than referring directly to an object, a semantic action can refer to a placeholder, and the value of the placeholder can be specified later with a let expression. The let expression created with let() is passed to the constructor of either regex_iterator or regex_token_iterator.

                                                            See the section "Referring to Non-Local Variables" in the Users' Guide for more discussion.

                                                            @@ -104,7 +104,7 @@
                                                            -PrevUpHomeNext +PrevUpHomeNext
                                                            diff --git a/doc/html/boost/xpressive/local.html b/doc/html/boost/xpressive/local.html index 18d9849996..e15db0634d 100644 --- a/doc/html/boost/xpressive/local.html +++ b/doc/html/boost/xpressive/local.html @@ -35,15 +35,15 @@ template<typename T> struct local : public proto::terminal::type< reference_wrapper< T > > { // construct/copy/destruct - local(); - explicit local(T const &); + local(); + explicit local(T const &); - // public member functions - T & get(); - T const & get() const; + // public member functions + T & get(); + T const & get() const; };
                                                            -

                                                            Description

                                                            +

                                                            Description

                                                            Below is an example of how to use local<> in semantic actions.

                                                            using namespace boost::xpressive;
@@ -66,22 +66,22 @@ Below is an example of how to use local<>
 
                                                            
 
                                                            
-
                                                            Template Parameters
                                                            
+
                                                            Template Parameters
                                                            
 
                                                            1. 
 
                                                              typename T
                                                              
 
                                                              The type of the local variable.
                                                              
 
                                                            
 
                                                            
 
                                                            
-
                                                            
+
                                                            
 local 
         public
        construct/copy/destruct
                                                            
 
                                                              
 
                                                            1. 
-
                                                              local();
                                                              Store a default-constructed value of type T. 
                                                              2. 
+
                                                              local();
                                                              Store a default-constructed value of type T. 
 
                                                            2. 
-
                                                              explicit local(T const & t);
                                                              Store a default-constructed value of type T. 
                                                              
+
                                                              explicit local(T const & t);
                                                              Store a default-constructed value of type T. 
                                                              
 
                                                              
 
                                                              @@ -106,13 +106,13 @@ Below is an example of how to use local<>
 
 
                                                              
-
                                                              
-local public member functions
                                                              
+
                                                              
+local public member functions
                                                              
 
                                                                
 
                                                              1. 
-
                                                                T & get();
                                                                Fetch the wrapped value. 
                                                                2. 
+
                                                                T & get();
                                                                Fetch the wrapped value. 
 
                                                              2. 
-
                                                                T const & get() const;
                                                                
+
                                                                T const & get() const;
                                                                
 
                                                                This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. 
                                                                
 
                                                                3. 
 
                                                              
diff --git a/doc/html/boost/xpressive/lower.html b/doc/html/boost/xpressive/lower.html
index 3dca3ea973..6e6f53ef70 100644
--- a/doc/html/boost/xpressive/lower.html
+++ b/doc/html/boost/xpressive/lower.html
@@ -34,7 +34,7 @@
 
 unspecified lower;
                                                              
 
                                                              
-
                                                              Description
                                                              
+
                                                              Description
                                                              
 
                                                              The regex traits are used to determine which characters are lower-case. To match any character that is not a lower-case character, use ~lower.
                                                              
 
                                                              
 

                                                              
diff --git a/doc/html/boost/xpressive/mark_tag.html b/doc/html/boost/xpressive/mark_tag.html
index dd8b00da1d..a983851e65 100644
--- a/doc/html/boost/xpressive/mark_tag.html
+++ b/doc/html/boost/xpressive/mark_tag.html
@@ -35,13 +35,13 @@
 
 struct mark_tag {
   // construct/copy/destruct
-  mark_tag(int);
+  mark_tag(int);
 
-  // private static functions
-  static unspecified make_tag(int);
+  // private static functions
+  static unspecified make_tag(int);
 };
 
                                                              
-
                                                              Description
                                                              
+
                                                              Description
                                                              
 
                                                              mark_tag is the type of the global sub-match placeholders s0, s1, etc.. You can use the mark_tag type to create your own sub-match placeholders with more meaningful names. This is roughly equivalent to the "named capture" feature of dynamic regular expressions.
                                                              
 
                                                              To create a named sub-match placeholder, initialize it with a unique integer. The integer must only be unique within the regex in which the placeholder is used. Then you can use it within static regexes to created sub-matches by assigning a sub-expression to it, or to refer back to already created sub-matches.
                                                              
 
                                                              mark_tag number(1); // "number" is now equivalent to "s1"
@@ -50,12 +50,12 @@
 
                                                              
 
                                                              After a successful regex_match() or regex_search(), the sub-match placeholder can be used to index into the match_results<> object to retrieve the corresponding sub-match. 
                                                              
 
                                                              
-
                                                              
+
                                                              
 mark_tag 
         public
        construct/copy/destruct
                                                              
 
                                                              1. 
-
                                                                mark_tag(int mark_nbr);
                                                                Initialize a mark_tag placeholder. 
                                                                
+
                                                                mark_tag(int mark_nbr);
                                                                Initialize a mark_tag placeholder. 
                                                                
 
 
                                                                
 
                                                              
 
                                                              
@@ -86,9 +86,9 @@
 
 
 
                                                              
-
                                                              
-mark_tag private static functions
                                                              
-
                                                              1. static unspecified make_tag(int mark_nbr);
                                                              
+
                                                              
+mark_tag private static functions
                                                              
+
                                                              1. static unspecified make_tag(int mark_nbr);
                                                              
 
                                                              
 
 
diff --git a/doc/html/boost/xpressive/match_results.html b/doc/html/boost/xpressive/match_results.html
index bf723aff3b..2a28457202 100644
--- a/doc/html/boost/xpressive/match_results.html
+++ b/doc/html/boost/xpressive/match_results.html
@@ -7,7 +7,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
                                                              
 
                                                              
 
                                                              
-PrevUpHomeNext
+PrevUpHomeNext
 
                                                              
 
                                                              
 
                                                              
@@ -47,56 +47,56 @@
   typedef unspecified                           nested_results_type;
 
   // construct/copy/destruct
-  match_results();
-  match_results(match_results< BidiIter > const &);
-  match_results< BidiIter > & operator=(match_results< BidiIter > const &);
-  ~match_results();
+  match_results();
+  match_results(match_results< BidiIter > const &);
+  match_results< BidiIter > & operator=(match_results< BidiIter > const &);
+  ~match_results();
 
-  // public member functions
-  size_type size() const;
-  bool empty() const;
-  difference_type length(size_type = 0) const;
-  difference_type position(size_type = 0) const;
-  string_type str(size_type = 0) const;
-  template<typename Sub> const_reference operator[](Sub const &) const;
-  const_reference prefix() const;
-  const_reference suffix() const;
-  const_iterator begin() const;
-  const_iterator end() const;
-  operator bool_type() const;
-  bool operator!() const;
-  regex_id_type regex_id() const;
-  nested_results_type const & nested_results() const;
+  // public member functions
+  size_type size() const;
+  bool empty() const;
+  difference_type length(size_type = 0) const;
+  difference_type position(size_type = 0) const;
+  string_type str(size_type = 0) const;
+  template<typename Sub> const_reference operator[](Sub const &) const;
+  const_reference prefix() const;
+  const_reference suffix() const;
+  const_iterator begin() const;
+  const_iterator end() const;
+  operator bool_type() const;
+  bool operator!() const;
+  regex_id_type regex_id() const;
+  nested_results_type const & nested_results() const;
   template<typename Format, typename OutputIterator> 
     OutputIterator 
-    format(OutputIterator, Format const &, 
+    format(OutputIterator, Format const &, 
            regex_constants::match_flag_type = regex_constants::format_default, 
            unspecified = 0) const;
   template<typename OutputIterator> 
     OutputIterator 
-    format(OutputIterator, char_type const *, 
+    format(OutputIterator, char_type const *, 
            regex_constants::match_flag_type = regex_constants::format_default) const;
   template<typename Format, typename OutputIterator> 
-    string_type format(Format const &, 
+    string_type format(Format const &, 
                        regex_constants::match_flag_type = regex_constants::format_default, 
                        unspecified = 0) const;
-  string_type format(char_type const *, 
+  string_type format(char_type const *, 
                      regex_constants::match_flag_type = regex_constants::format_default) const;
-  void swap(match_results< BidiIter > &);
-  template<typename Arg> match_results< BidiIter > & let(Arg const &);
+  void swap(match_results< BidiIter > &);
+  template<typename Arg> match_results< BidiIter > & let(Arg const &);
 };
                                                            -

                                                            Description

                                                            +

                                                            Description

                                                            Class template match_results<> denotes a collection of sequences representing the result of a regular expression match. Storage for the collection is allocated and freed as necessary by the member functions of class match_results<>.

                                                            The class template match_results<> conforms to the requirements of a Sequence, as specified in (lib.sequence.reqmts), except that only operations defined for const-qualified Sequences are supported.

                                                            -

                                                            +

                                                            match_results public construct/copy/destruct

                                                            1. -
                                                              match_results();
                                                              +
                                                              match_results();

                                                              @@ -128,7 +128,7 @@

                                                          5. -
                                                            match_results(match_results< BidiIter > const & that);
                                                            +
                                                            match_results(match_results< BidiIter > const & that);

                                                            @@ -199,7 +199,7 @@

                                                          6. -
                                                            match_results< BidiIter > & operator=(match_results< BidiIter > const & that);
                                                            +
                                                            match_results< BidiIter > & operator=(match_results< BidiIter > const & that);

                                                            @@ -269,39 +269,39 @@

                                                            7. -
                                                          7. ~match_results();
                                                            8. +
                                                          8. ~match_results();
                                                          -

                                                          -match_results public member functions

                                                          +

                                                          +match_results public member functions

                                                          1. -
                                                            size_type size() const;
                                                            +
                                                            size_type size() const;

                                                            Returns one plus the number of marked sub-expressions in the regular expression that was matched if *this represents the result of a successful match. Otherwise returns 0.

                                                          2. -
                                                            bool empty() const;
                                                            +
                                                            bool empty() const;

                                                            Returns size() == 0.

                                                          3. -
                                                            difference_type length(size_type sub = 0) const;
                                                            +
                                                            difference_type length(size_type sub = 0) const;

                                                            Returns (*this)[sub].length().

                                                          4. -
                                                            difference_type position(size_type sub = 0) const;
                                                            +
                                                            difference_type position(size_type sub = 0) const;

                                                            If !(*this)[sub].matched then returns -1. Otherwise returns std::distance(base, (*this)[sub].first), where base is the start iterator of the sequence that was searched. [Note - unless this is part of a repeated search with a regex_iterator then base is the same as prefix().first - end note]

                                                          5. -
                                                            string_type str(size_type sub = 0) const;
                                                            +
                                                            string_type str(size_type sub = 0) const;

                                                            Returns (*this)[sub].str().

                                                          6. -
                                                            template<typename Sub> const_reference operator[](Sub const & sub) const;
                                                            +
                                                            template<typename Sub> const_reference operator[](Sub const & sub) const;

                                                            Returns a reference to the sub_match object representing the sequence that matched marked sub-expression sub. If sub == 0 then returns a reference to a sub_match object representing the sequence that matched the whole regular expression. If sub >= size() then returns a sub_match object representing an unmatched sub-expression.

                                                          7. -
                                                            const_reference prefix() const;
                                                            +
                                                            const_reference prefix() const;

                                                            Returns a reference to the sub_match object representing the character sequence from the start of the string being matched/searched, to the start of the match found.

                                                            @@ -317,7 +317,7 @@
                                                        5. -
                                                          const_reference suffix() const;
                                                          +
                                                          const_reference suffix() const;

                                                          Returns a reference to the sub_match object representing the character sequence from the end of the match found to the end of the string being matched/searched.

                                                          @@ -333,33 +333,33 @@
                                                        6. -
                                                          const_iterator begin() const;
                                                          +
                                                          const_iterator begin() const;

                                                          Returns a starting iterator that enumerates over all the marked sub-expression matches stored in *this.

                                                        7. -
                                                          const_iterator end() const;
                                                          +
                                                          const_iterator end() const;

                                                          Returns a terminating iterator that enumerates over all the marked sub-expression matches stored in *this.

                                                        8. -
                                                          operator bool_type() const;
                                                          +
                                                          operator bool_type() const;

                                                          Returns a true value if (*this)[0].matched, else returns a false value.

                                                        9. -
                                                          bool operator!() const;
                                                          +
                                                          bool operator!() const;

                                                          Returns true if empty() || !(*this)[0].matched, else returns false.

                                                        10. -
                                                          regex_id_type regex_id() const;
                                                          +
                                                          regex_id_type regex_id() const;

                                                          Returns the id of the basic_regex object most recently used with this match_results object.

                                                        11. -
                                                          nested_results_type const & nested_results() const;
                                                          +
                                                          nested_results_type const & nested_results() const;

                                                          Returns a Sequence of nested match_results elements. 

                                                        12. template<typename Format, typename OutputIterator> 
   OutputIterator 
-  format(OutputIterator out, Format const & fmt, 
+  format(OutputIterator out, Format const & fmt, 
          regex_constants::match_flag_type flags = regex_constants::format_default, 
          unspecified = 0) const;

                                                          If Format models ForwardRange or is a null-terminated string, this function copies the character sequence in fmt to OutputIterator out. For each format specifier or escape sequence in fmt, replace that sequence with either the character(s) it represents, or the sequence within *this to which it refers. The bitmasks specified in flags determines what format specifiers or escape sequences are recognized. By default, this is the format used by ECMA-262, ECMAScript Language Specification, Chapter 15 part 5.4.11 String.prototype.replace.

                                                          @@ -370,13 +370,13 @@ 
                                                        13. template<typename OutputIterator> 
   OutputIterator 
-  format(OutputIterator out, char_type const * fmt, 
+  format(OutputIterator out, char_type const * fmt, 
          regex_constants::match_flag_type flags = regex_constants::format_default) const;

                                                          This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. 

                                                        14. template<typename Format, typename OutputIterator> 
-  string_type format(Format const & fmt, 
+  string_type format(Format const & fmt, 
                      regex_constants::match_flag_type flags = regex_constants::format_default, 
                      unspecified = 0) const;

                                                          If Format models ForwardRange or is a null-terminated string, this function returns a copy of the character sequence fmt. For each format specifier or escape sequence in fmt, replace that sequence with either the character(s) it represents, or the sequence within *this to which it refers. The bitmasks specified in flags determines what format specifiers or escape sequences are recognized. By default this is the format used by ECMA-262, ECMAScript Language Specification, Chapter 15 part 5.4.11 String.prototype.replace.

                                                          @@ -385,12 +385,12 @@

                                                          Otherwise, if Format models Callable<match_results<BidiIter> >, this function returns fmt(*this).

                                                        15. -
                                                          string_type format(char_type const * fmt, 
+
                                                          string_type format(char_type const * fmt, 
                    regex_constants::match_flag_type flags = regex_constants::format_default) const;
                                                          
 
                                                          This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
                                                        16. -
                                                          void swap(match_results< BidiIter > & that);
                                                          +
                                                          void swap(match_results< BidiIter > & that);

                                                          Swaps the contents of two match_results objects. Guaranteed not to throw. @@ -426,7 +426,7 @@

                                                        17. -
                                                          template<typename Arg> match_results< BidiIter > & let(Arg const & arg);
                                                          +
                                                          template<typename Arg> match_results< BidiIter > & let(Arg const & arg);

                                                          TODO document me

                                                        @@ -443,7 +443,7 @@
                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                        diff --git a/doc/html/boost/xpressive/nil.html b/doc/html/boost/xpressive/nil.html index efbcb758d9..3adef44aea 100644 --- a/doc/html/boost/xpressive/nil.html +++ b/doc/html/boost/xpressive/nil.html @@ -34,7 +34,7 @@ unspecified nil;
                                                        -

                                                        Description

                                                        +

                                                        Description

                                                        Successfully matches a zero-width sequence. nil always succeeds and never consumes any characters.

                                                        diff --git a/doc/html/boost/xpressive/null_regex_traits.html b/doc/html/boost/xpressive/null_regex_traits.html index fd034a0299..95b947a084 100644 --- a/doc/html/boost/xpressive/null_regex_traits.html +++ b/doc/html/boost/xpressive/null_regex_traits.html @@ -35,49 +35,49 @@ template<typename Elem> struct null_regex_traits { // construct/copy/destruct - null_regex_traits(locale_type = locale_type()); + null_regex_traits(locale_type = locale_type()); - // public member functions - bool operator==(null_regex_traits< char_type > const &) const; - bool operator!=(null_regex_traits< char_type > const &) const; - char_type widen(char) const; + // public member functions + bool operator==(null_regex_traits< char_type > const &) const; + bool operator!=(null_regex_traits< char_type > const &) const; + char_type widen(char) const; - // public static functions - static unsigned char hash(char_type); - static char_type translate(char_type); - static char_type translate_nocase(char_type); - static bool in_range(char_type, char_type, char_type); - static bool in_range_nocase(char_type, char_type, char_type); - template<typename FwdIter> static string_type transform(FwdIter, FwdIter); + // public static functions + static unsigned char hash(char_type); + static char_type translate(char_type); + static char_type translate_nocase(char_type); + static bool in_range(char_type, char_type, char_type); + static bool in_range_nocase(char_type, char_type, char_type); + template<typename FwdIter> static string_type transform(FwdIter, FwdIter); template<typename FwdIter> - static string_type transform_primary(FwdIter, FwdIter); + static string_type transform_primary(FwdIter, FwdIter); template<typename FwdIter> - static string_type lookup_collatename(FwdIter, FwdIter); + static string_type lookup_collatename(FwdIter, FwdIter); template<typename FwdIter> - static char_class_type lookup_classname(FwdIter, FwdIter, bool); - static bool isctype(char_type, char_class_type); - static int value(char_type, int); - static locale_type imbue(locale_type); - static locale_type getloc(); + static char_class_type lookup_classname(FwdIter, FwdIter, bool); + static bool isctype(char_type, char_class_type); + static int value(char_type, int); + static locale_type imbue(locale_type); + static locale_type getloc(); };
                                                        -

                                                        Description

                                                        +

                                                        Description

                                                        -

                                                        +

                                                        null_regex_traits public construct/copy/destruct

                                                        1. -
                                                          null_regex_traits(locale_type = locale_type());
                                                          +
                                                          null_regex_traits(locale_type = locale_type());

                                                          Initialize a null_regex_traits object.

                                                        -

                                                        -null_regex_traits public member functions

                                                        +

                                                        +null_regex_traits public member functions

                                                        1. -
                                                          bool operator==(null_regex_traits< char_type > const & that) const;
                                                          +
                                                          bool operator==(null_regex_traits< char_type > const & that) const;

                                                          Checks two null_regex_traits objects for equality

                                                          @@ -93,7 +93,7 @@
                                                      6. -
                                                        bool operator!=(null_regex_traits< char_type > const & that) const;
                                                        +
                                                        bool operator!=(null_regex_traits< char_type > const & that) const;

                                                        Checks two null_regex_traits objects for inequality

                                                        @@ -109,7 +109,7 @@
                                                    6. -
                                                      char_type widen(char ch) const;
                                                      +
                                                      char_type widen(char ch) const;

                                                      Convert a char to a Elem

                                                      @@ -143,11 +143,11 @@

                                                    -

                                                    -null_regex_traits public static functions

                                                    +

                                                    +null_regex_traits public static functions

                                                    1. -
                                                      static unsigned char hash(char_type ch);
                                                      +
                                                      static unsigned char hash(char_type ch);

                                                      Returns a hash value for a Elem in the range [0, UCHAR_MAX]

                                                      @@ -179,7 +179,7 @@

                                                  3. -
                                                    static char_type translate(char_type ch);
                                                    +
                                                    static char_type translate(char_type ch);

                                                    No-op

                                                    @@ -211,7 +211,7 @@

                                                3. -
                                                  static char_type translate_nocase(char_type ch);
                                                  +
                                                  static char_type translate_nocase(char_type ch);

                                                  No-op

                                                  @@ -243,7 +243,7 @@

                                              2. -
                                                static bool in_range(char_type first, char_type last, char_type ch);
                                                +
                                                static bool in_range(char_type first, char_type last, char_type ch);

                                                Checks to see if a character is within a character range.

                                                @@ -285,7 +285,7 @@

                                            2. -
                                              static bool in_range_nocase(char_type first, char_type last, char_type ch);
                                              +
                                              static bool in_range_nocase(char_type first, char_type last, char_type ch);

                                              Checks to see if a character is within a character range.

                                              @@ -337,7 +337,7 @@ 

                                            3. template<typename FwdIter> 
-  static string_type transform(FwdIter begin, FwdIter end);
                                              + static string_type transform(FwdIter begin, FwdIter end);

                                              Returns a sort key for the character sequence designated by the iterator range [F1, F2) such that if the character sequence [G1, G2) sorts before the character sequence [H1, H2) then v.transform(G1, G2) < v.transform(H1, H2).

                                              @@ -351,7 +351,7 @@ 
                                            4. template<typename FwdIter> 
-  static string_type transform_primary(FwdIter begin, FwdIter end);
                                              + static string_type transform_primary(FwdIter begin, FwdIter end);

                                              Returns a sort key for the character sequence designated by the iterator range [F1, F2) such that if the character sequence [G1, G2) sorts before the character sequence [H1, H2) when character case is not considered then v.transform_primary(G1, G2) < v.transform_primary(H1, H2).

                                              5. @@ -365,7 +365,7 @@ 
                                            5. template<typename FwdIter> 
-  static string_type lookup_collatename(FwdIter begin, FwdIter end);
                                              + static string_type lookup_collatename(FwdIter begin, FwdIter end);

                                              Returns a sequence of characters that represents the collating element consisting of the character sequence designated by the iterator range [F1, F2). Returns an empty string if the character sequence is not a valid collating element.

                                              6. @@ -380,7 +380,7 @@ 
                                            6. template<typename FwdIter> 
   static char_class_type 
-  lookup_classname(FwdIter begin, FwdIter end, bool icase);
                                              + lookup_classname(FwdIter begin, FwdIter end, bool icase);

                                              The null_regex_traits does not have character classifications, so lookup_classname() is unused.

                                              @@ -422,7 +422,7 @@

                                            7. -
                                              static bool isctype(char_type ch, char_class_type mask);
                                              +
                                              static bool isctype(char_type ch, char_class_type mask);

                                              The null_regex_traits does not have character classifications, so isctype() is unused.

                                              @@ -460,7 +460,7 @@

                                          3. -
                                            static int value(char_type ch, int radix);
                                            +
                                            static int value(char_type ch, int radix);

                                            The null_regex_traits recognizes no elements as digits, so value() is unused.

                                            @@ -498,7 +498,7 @@

                                        3. -
                                          static locale_type imbue(locale_type loc);
                                          +
                                          static locale_type imbue(locale_type loc);

                                          Not used

                                          @@ -530,7 +530,7 @@

                                      3. -
                                        static locale_type getloc();
                                        +
                                        static locale_type getloc();

                                        Returns locale_type().

                                        diff --git a/doc/html/boost/xpressive/op/as.html b/doc/html/boost/xpressive/op/as.html index eef9c68dbd..99e6ce479c 100644 --- a/doc/html/boost/xpressive/op/as.html +++ b/doc/html/boost/xpressive/op/as.html @@ -37,25 +37,25 @@ // types typedef T result_type; - // public member functions - template<typename Value> T operator()(Value const &) const; + // public member functions + template<typename Value> T operator()(Value const &) const; };
                                      -

                                      Description

                                      +

                                      Description

                                      -

                                      Template Parameters

                                      +

                                      Template Parameters

                                      1. typename T

                                        The type to which to lexically cast the parameter.

                                      -

                                      -as public member functions

                                      +

                                      +as public member functions

                                      1. -
                                        template<typename Value> T operator()(Value const & val) const;
                                        +
                                        template<typename Value> T operator()(Value const & val) const;

                                        diff --git a/doc/html/boost/xpressive/op/at.html b/doc/html/boost/xpressive/op/at.html index a61a6666a8..b8ce6b1332 100644 --- a/doc/html/boost/xpressive/op/at.html +++ b/doc/html/boost/xpressive/op/at.html @@ -39,36 +39,36 @@ struct result { }; template<typename This, typename Cont, typename Idx> - struct result<This(Cont &, Idx)> { + struct result<This(Cont &, Idx)> { // types - typedef Cont::reference type; + typedef Cont::reference type; }; template<typename This, typename Cont, typename Idx> - struct result<This(Cont const &, Idx)> { + struct result<This(Cont const &, Idx)> { // types - typedef Cont::const_reference type; + typedef Cont::const_reference type; }; template<typename This, typename Cont, typename Idx> - struct result<This(Cont, Idx)> { + struct result<This(Cont, Idx)> { // types - typedef Cont::const_reference type; + typedef Cont::const_reference type; }; - // public member functions + // public member functions template<typename Cont, typename Idx> - Cont::reference operator()(Cont &, Idx) const; + Cont::reference operator()(Cont &, Idx) const; template<typename Cont, typename Idx> - Cont::const_reference operator()(Cont const &, Idx) const; + Cont::const_reference operator()(Cont const &, Idx) const; };
                                      -

                                      Description

                                      +

                                      Description

                                      -

                                      -at public member functions

                                      +

                                      +at public member functions

                                      1. template<typename Cont, typename Idx> 
-  Cont::reference operator()(Cont & c, Idx idx) const;
                                        + Cont::reference operator()(Cont & c, Idx idx) const;

                                        @@ -111,7 +111,7 @@ 

                                      2. template<typename Cont, typename Idx> 
-  Cont::const_reference operator()(Cont const & c, Idx idx) const;
                                        + Cont::const_reference operator()(Cont const & c, Idx idx) const;

                                        This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

                                      diff --git a/doc/html/boost/xpressive/op/at/result.html b/doc/html/boost/xpressive/op/at/result.html index 20b42fea98..f84ee636a1 100644 --- a/doc/html/boost/xpressive/op/at/result.html +++ b/doc/html/boost/xpressive/op/at/result.html @@ -6,9 +6,9 @@ - + - + @@ -21,7 +21,7 @@
                                      -PrevUpHomeNext +PrevUpHomeNext
                                      @@ -47,7 +47,7 @@
                                      -PrevUpHomeNext +PrevUpHomeNext
                                      diff --git a/doc/html/boost/xpressive/op/at/result_T_idm45506840408416.html b/doc/html/boost/xpressive/op/at/result_T_idm45506840408416.html new file mode 100644 index 0000000000..fd725a1aa3 --- /dev/null +++ b/doc/html/boost/xpressive/op/at/result_T_idm45506840408416.html @@ -0,0 +1,55 @@ + + + + +Struct template result<This(Cont, Idx)> + + + + + + + + + + + + + + + +
                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                      +
                                      +
                                      +PrevUpHomeNext +
                                      +
                                      +
                                      +
                                      +

                                      Struct template result<This(Cont, Idx)>

                                      +

                                      boost::xpressive::op::at::result<This(Cont, Idx)>

                                      +
                                      +

                                      Synopsis

                                      +
                                      // In header: <boost/xpressive/regex_actions.hpp>
+
+
+template<typename This, typename Cont, typename Idx> 
+struct result<This(Cont, Idx)> {
+  // types
+  typedef Cont::const_reference type;
+};
                                      +
                                      + + + +
                                      Copyright © 2007 Eric Niebler

                                      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                      +
                                      +
                                      +
                                      +PrevUpHomeNext +
                                      + + diff --git a/doc/html/boost/xpressive/op/at/result_T_idm45506840412336.html b/doc/html/boost/xpressive/op/at/result_T_idm45506840412336.html new file mode 100644 index 0000000000..aa27b7feb2 --- /dev/null +++ b/doc/html/boost/xpressive/op/at/result_T_idm45506840412336.html @@ -0,0 +1,55 @@ + + + + +Struct template result<This(Cont const &, Idx)> + + + + + + + + + + + + + + + +
                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                      +
                                      +
                                      +PrevUpHomeNext +
                                      +
                                      +
                                      +
                                      +

                                      Struct template result<This(Cont const &, Idx)>

                                      +

                                      boost::xpressive::op::at::result<This(Cont const &, Idx)>

                                      +
                                      +

                                      Synopsis

                                      +
                                      // In header: <boost/xpressive/regex_actions.hpp>
+
+
+template<typename This, typename Cont, typename Idx> 
+struct result<This(Cont const &, Idx)> {
+  // types
+  typedef Cont::const_reference type;
+};
                                      +
                                      + + + +
                                      Copyright © 2007 Eric Niebler

                                      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                      +
                                      +
                                      +
                                      +PrevUpHomeNext +
                                      + + diff --git a/doc/html/boost/xpressive/op/at/result_T_idm45506840416256.html b/doc/html/boost/xpressive/op/at/result_T_idm45506840416256.html new file mode 100644 index 0000000000..31e326402c --- /dev/null +++ b/doc/html/boost/xpressive/op/at/result_T_idm45506840416256.html @@ -0,0 +1,55 @@ + + + + +Struct template result<This(Cont &, Idx)> + + + + + + + + + + + + + + + +
                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                      +
                                      +
                                      +PrevUpHomeNext +
                                      +
                                      +
                                      +
                                      +

                                      Struct template result<This(Cont &, Idx)>

                                      +

                                      boost::xpressive::op::at::result<This(Cont &, Idx)>

                                      +
                                      +

                                      Synopsis

                                      +
                                      // In header: <boost/xpressive/regex_actions.hpp>
+
+
+template<typename This, typename Cont, typename Idx> 
+struct result<This(Cont &, Idx)> {
+  // types
+  typedef Cont::reference type;
+};
                                      +
                                      + + + +
                                      Copyright © 2007 Eric Niebler

                                      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                      +
                                      +
                                      +
                                      +PrevUpHomeNext +
                                      + + diff --git a/doc/html/boost/xpressive/op/at/result_This_C_idp358124288.html b/doc/html/boost/xpressive/op/at/result_This_C_idp358124288.html deleted file mode 100644 index 38e397d8c7..0000000000 --- a/doc/html/boost/xpressive/op/at/result_This_C_idp358124288.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template result<This(Cont &, Idx)> - - - - - - - - - - - - - - - -
                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                      -
                                      -
                                      -PrevUpHomeNext -
                                      -
                                      -
                                      -
                                      -

                                      Struct template result<This(Cont &, Idx)>

                                      -

                                      boost::xpressive::op::at::result<This(Cont &, Idx)>

                                      -
                                      -

                                      Synopsis

                                      -
                                      // In header: <boost/xpressive/regex_actions.hpp>
-
-
-template<typename This, typename Cont, typename Idx> 
-struct result<This(Cont &, Idx)> {
-  // types
-  typedef Cont::reference type;
-};
                                      -
                                      - - - -
                                      Copyright © 2007 Eric Niebler

                                      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                      -
                                      -
                                      -
                                      -PrevUpHomeNext -
                                      - - diff --git a/doc/html/boost/xpressive/op/at/result_This_C_idp358128208.html b/doc/html/boost/xpressive/op/at/result_This_C_idp358128208.html deleted file mode 100644 index c6477e4c8e..0000000000 --- a/doc/html/boost/xpressive/op/at/result_This_C_idp358128208.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template result<This(Cont const &, Idx)> - - - - - - - - - - - - - - - -
                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                      -
                                      -
                                      -PrevUpHomeNext -
                                      -
                                      -
                                      -
                                      -

                                      Struct template result<This(Cont const &, Idx)>

                                      -

                                      boost::xpressive::op::at::result<This(Cont const &, Idx)>

                                      -
                                      -

                                      Synopsis

                                      -
                                      // In header: <boost/xpressive/regex_actions.hpp>
-
-
-template<typename This, typename Cont, typename Idx> 
-struct result<This(Cont const &, Idx)> {
-  // types
-  typedef Cont::const_reference type;
-};
                                      -
                                      - - - -
                                      Copyright © 2007 Eric Niebler

                                      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                      -
                                      -
                                      -
                                      -PrevUpHomeNext -
                                      - - diff --git a/doc/html/boost/xpressive/op/at/result_This_C_idp358132128.html b/doc/html/boost/xpressive/op/at/result_This_C_idp358132128.html deleted file mode 100644 index 186dd3a4b4..0000000000 --- a/doc/html/boost/xpressive/op/at/result_This_C_idp358132128.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template result<This(Cont, Idx)> - - - - - - - - - - - - - - - -
                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                      -
                                      -
                                      -PrevUpHomeNext -
                                      -
                                      -
                                      -
                                      -

                                      Struct template result<This(Cont, Idx)>

                                      -

                                      boost::xpressive::op::at::result<This(Cont, Idx)>

                                      -
                                      -

                                      Synopsis

                                      -
                                      // In header: <boost/xpressive/regex_actions.hpp>
-
-
-template<typename This, typename Cont, typename Idx> 
-struct result<This(Cont, Idx)> {
-  // types
-  typedef Cont::const_reference type;
-};
                                      -
                                      - - - -
                                      Copyright © 2007 Eric Niebler

                                      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                      -
                                      -
                                      -
                                      -PrevUpHomeNext -
                                      - - diff --git a/doc/html/boost/xpressive/op/back.html b/doc/html/boost/xpressive/op/back.html index fd7454bf65..3ac7b9c7e8 100644 --- a/doc/html/boost/xpressive/op/back.html +++ b/doc/html/boost/xpressive/op/back.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                                      -PrevUpHomeNext +PrevUpHomeNext
                                      @@ -39,24 +39,24 @@ struct result { }; template<typename This, typename Sequence> - struct result<This(Sequence)> { + struct result<This(Sequence)> { // types - typedef remove_reference< Sequence >::type sequence_type; - typedef mpl::if_c< is_const< sequence_type >::value, typename sequence_type::const_reference, typename sequence_type::reference >::type type; + typedef remove_reference< Sequence >::type sequence_type; + typedef mpl::if_c< is_const< sequence_type >::value, typename sequence_type::const_reference, typename sequence_type::reference >::type type; }; - // public member functions + // public member functions template<typename Sequence> - result< back(Sequence &)>::type operator()(Sequence &) const; + result< back(Sequence &)>::type operator()(Sequence &) const; };
                                      -

                                      Description

                                      +

                                      Description

                                      -

                                      -back public member functions

                                      +

                                      +back public member functions

                                      1. template<typename Sequence> 
-  result< back(Sequence &)>::type operator()(Sequence & seq) const;
                                        + result< back(Sequence &)>::type operator()(Sequence & seq) const;

                                        @@ -99,7 +99,7 @@
                                        -PrevUpHomeNext +PrevUpHomeNext
                                        diff --git a/doc/html/boost/xpressive/op/back/result.html b/doc/html/boost/xpressive/op/back/result.html index 928639b40f..a1df2ce088 100644 --- a/doc/html/boost/xpressive/op/back/result.html +++ b/doc/html/boost/xpressive/op/back/result.html @@ -6,9 +6,9 @@ - + - + @@ -21,7 +21,7 @@
                                        -PrevUpHomeNext +PrevUpHomeNext
                                        @@ -47,7 +47,7 @@
                                        -PrevUpHomeNext +PrevUpHomeNext
                                        diff --git a/doc/html/boost/xpressive/op/back/result_T_idm45506840390448.html b/doc/html/boost/xpressive/op/back/result_T_idm45506840390448.html new file mode 100644 index 0000000000..eb1f15fb88 --- /dev/null +++ b/doc/html/boost/xpressive/op/back/result_T_idm45506840390448.html @@ -0,0 +1,56 @@ + + + + +Struct template result<This(Sequence)> + + + + + + + + + + + + + + + +
                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                        +
                                        +
                                        +PrevUpHomeNext +
                                        +
                                        +
                                        +
                                        +

                                        Struct template result<This(Sequence)>

                                        +

                                        boost::xpressive::op::back::result<This(Sequence)>

                                        +
                                        +

                                        Synopsis

                                        +
                                        // In header: <boost/xpressive/regex_actions.hpp>
+
+
+template<typename This, typename Sequence> 
+struct result<This(Sequence)> {
+  // types
+  typedef remove_reference< Sequence >::type                                                                                              sequence_type;
+  typedef mpl::if_c< is_const< sequence_type >::value, typename sequence_type::const_reference, typename sequence_type::reference >::type type;         
+};
                                        +
                                        + + + +
                                        Copyright © 2007 Eric Niebler

                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                        +
                                        +
                                        +
                                        +PrevUpHomeNext +
                                        + + diff --git a/doc/html/boost/xpressive/op/back/result_This_S_idp358150096.html b/doc/html/boost/xpressive/op/back/result_This_S_idp358150096.html deleted file mode 100644 index e7db8e9b97..0000000000 --- a/doc/html/boost/xpressive/op/back/result_This_S_idp358150096.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Struct template result<This(Sequence)> - - - - - - - - - - - - - - - -
                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                        -
                                        -
                                        -PrevUpHomeNext -
                                        -
                                        -
                                        -
                                        -

                                        Struct template result<This(Sequence)>

                                        -

                                        boost::xpressive::op::back::result<This(Sequence)>

                                        -
                                        -

                                        Synopsis

                                        -
                                        // In header: <boost/xpressive/regex_actions.hpp>
-
-
-template<typename This, typename Sequence> 
-struct result<This(Sequence)> {
-  // types
-  typedef remove_reference< Sequence >::type                                                                                              sequence_type;
-  typedef mpl::if_c< is_const< sequence_type >::value, typename sequence_type::const_reference, typename sequence_type::reference >::type type;         
-};
                                        -
                                        - - - -
                                        Copyright © 2007 Eric Niebler

                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                        -
                                        -
                                        -
                                        -PrevUpHomeNext -
                                        - - diff --git a/doc/html/boost/xpressive/op/const_cast_.html b/doc/html/boost/xpressive/op/const_cast_.html index 8739f43f0c..25dc6268d6 100644 --- a/doc/html/boost/xpressive/op/const_cast_.html +++ b/doc/html/boost/xpressive/op/const_cast_.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                                        -PrevUpHomeNext +PrevUpHomeNext
                                        @@ -37,25 +37,25 @@ // types typedef T result_type; - // public member functions - template<typename Value> T operator()(Value const &) const; + // public member functions + template<typename Value> T operator()(Value const &) const; };
                                        -

                                        Description

                                        +

                                        Description

                                        -

                                        Template Parameters

                                        +

                                        Template Parameters

                                        1. typename T

                                          The type to which to const-cast the parameter.

                                        -

                                        -const_cast_ public member functions

                                        +

                                        +const_cast_ public member functions

                                        1. -
                                          template<typename Value> T operator()(Value const & val) const;
                                          +
                                          template<typename Value> T operator()(Value const & val) const;

                                          @@ -103,7 +103,7 @@

                                          -PrevUpHomeNext +PrevUpHomeNext
                                          diff --git a/doc/html/boost/xpressive/op/construct.html b/doc/html/boost/xpressive/op/construct.html index 3a7d0e25f0..f111fa2c94 100644 --- a/doc/html/boost/xpressive/op/construct.html +++ b/doc/html/boost/xpressive/op/construct.html @@ -37,45 +37,45 @@ // types typedef T result_type; - // public member functions - T operator()() const; - template<typename A0> T operator()(A0 const &) const; + // public member functions + T operator()() const; + template<typename A0> T operator()(A0 const &) const; template<typename A0, typename A1> - T operator()(A0 const &, A1 const &) const; + T operator()(A0 const &, A1 const &) const; template<typename A0, typename A1, typename A2> - T operator()(A0 const &, A1 const &, A2 const &) const; + T operator()(A0 const &, A1 const &, A2 const &) const; };
                                        -

                                        Description

                                        +

                                        Description

                                        -

                                        Template Parameters

                                        +

                                        Template Parameters

                                        1. typename T

                                          The type of the object to construct.

                                        -

                                        -construct public member functions

                                        +

                                        +construct public member functions

                                        1. -
                                          T operator()() const;
                                          +
                                          T operator()() const;

                                          This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

                                        2. -
                                          template<typename A0> T operator()(A0 const & a0) const;
                                          +
                                          template<typename A0> T operator()(A0 const & a0) const;

                                          This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. 

                                        3. template<typename A0, typename A1> 
-  T operator()(A0 const & a0, A1 const & a1) const;
                                          + T operator()(A0 const & a0, A1 const & a1) const;

                                          This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. 

                                        4. template<typename A0, typename A1, typename A2> 
-  T operator()(A0 const & a0, A1 const & a1, A2 const & a2) const;
                                          + T operator()(A0 const & a0, A1 const & a1, A2 const & a2) const;

                                          diff --git a/doc/html/boost/xpressive/op/dynamic_cast_.html b/doc/html/boost/xpressive/op/dynamic_cast_.html index 460750c708..79bc56f6fa 100644 --- a/doc/html/boost/xpressive/op/dynamic_cast_.html +++ b/doc/html/boost/xpressive/op/dynamic_cast_.html @@ -37,25 +37,25 @@ // types typedef T result_type; - // public member functions - template<typename Value> T operator()(Value const &) const; + // public member functions + template<typename Value> T operator()(Value const &) const; };
                                        -

                                        Description

                                        +

                                        Description

                                        -

                                        Template Parameters

                                        +

                                        Template Parameters

                                        1. typename T

                                          The type to which to dynamically cast the parameter.

                                        -

                                        -dynamic_cast_ public member functions

                                        +

                                        +dynamic_cast_ public member functions

                                        1. -
                                          template<typename Value> T operator()(Value const & val) const;
                                          +
                                          template<typename Value> T operator()(Value const & val) const;

                                          diff --git a/doc/html/boost/xpressive/op/first.html b/doc/html/boost/xpressive/op/first.html index ad47ad945d..85831039ba 100644 --- a/doc/html/boost/xpressive/op/first.html +++ b/doc/html/boost/xpressive/op/first.html @@ -39,21 +39,21 @@ struct result { }; template<typename This, typename Pair> - struct result<This(Pair)> { + struct result<This(Pair)> { // types - typedef remove_reference< Pair >::type::first_type type; + typedef remove_reference< Pair >::type::first_type type; }; - // public member functions - template<typename Pair> Pair::first_type operator()(Pair const &) const; + // public member functions + template<typename Pair> Pair::first_type operator()(Pair const &) const; };
                                        -

                                        Description

                                        +

                                        Description

                                        -

                                        -first public member functions

                                        +

                                        +first public member functions

                                        1. -
                                          template<typename Pair> Pair::first_type operator()(Pair const & p) const;
                                          +
                                          template<typename Pair> Pair::first_type operator()(Pair const & p) const;

                                          diff --git a/doc/html/boost/xpressive/op/first/result.html b/doc/html/boost/xpressive/op/first/result.html index fe62f81262..0ecee10a89 100644 --- a/doc/html/boost/xpressive/op/first/result.html +++ b/doc/html/boost/xpressive/op/first/result.html @@ -6,9 +6,9 @@ - + - + @@ -21,7 +21,7 @@
                                          -PrevUpHomeNext +PrevUpHomeNext
                                          @@ -47,7 +47,7 @@
                                          -PrevUpHomeNext +PrevUpHomeNext
                                          diff --git a/doc/html/boost/xpressive/op/first/result_T_idm45506840337296.html b/doc/html/boost/xpressive/op/first/result_T_idm45506840337296.html new file mode 100644 index 0000000000..32463c37ff --- /dev/null +++ b/doc/html/boost/xpressive/op/first/result_T_idm45506840337296.html @@ -0,0 +1,55 @@ + + + + +Struct template result<This(Pair)> + + + + + + + + + + + + + + + +
                                          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                          +
                                          +
                                          +PrevUpHomeNext +
                                          +
                                          +
                                          +
                                          +

                                          Struct template result<This(Pair)>

                                          +

                                          boost::xpressive::op::first::result<This(Pair)>

                                          +
                                          +

                                          Synopsis

                                          +
                                          // In header: <boost/xpressive/regex_actions.hpp>
+
+
+template<typename This, typename Pair> 
+struct result<This(Pair)> {
+  // types
+  typedef remove_reference< Pair >::type::first_type type;
+};
                                          +
                                          + + + +
                                          Copyright © 2007 Eric Niebler

                                          + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                          +
                                          +
                                          +
                                          +PrevUpHomeNext +
                                          + + diff --git a/doc/html/boost/xpressive/op/first/result_This_P_idp358203248.html b/doc/html/boost/xpressive/op/first/result_This_P_idp358203248.html deleted file mode 100644 index 2adec0bd72..0000000000 --- a/doc/html/boost/xpressive/op/first/result_This_P_idp358203248.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template result<This(Pair)> - - - - - - - - - - - - - - - -
                                          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                          -
                                          -
                                          -PrevUpHomeNext -
                                          -
                                          -
                                          -
                                          -

                                          Struct template result<This(Pair)>

                                          -

                                          boost::xpressive::op::first::result<This(Pair)>

                                          -
                                          -

                                          Synopsis

                                          -
                                          // In header: <boost/xpressive/regex_actions.hpp>
-
-
-template<typename This, typename Pair> 
-struct result<This(Pair)> {
-  // types
-  typedef remove_reference< Pair >::type::first_type type;
-};
                                          -
                                          - - - -
                                          Copyright © 2007 Eric Niebler

                                          - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                          -
                                          -
                                          -
                                          -PrevUpHomeNext -
                                          - - diff --git a/doc/html/boost/xpressive/op/front.html b/doc/html/boost/xpressive/op/front.html index 225f32f59c..944f734c77 100644 --- a/doc/html/boost/xpressive/op/front.html +++ b/doc/html/boost/xpressive/op/front.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                                          -PrevUpHomeNext +PrevUpHomeNext
                                          @@ -39,24 +39,24 @@ struct result { }; template<typename This, typename Sequence> - struct result<This(Sequence)> { + struct result<This(Sequence)> { // types - typedef remove_reference< Sequence >::type sequence_type; - typedef mpl::if_c< is_const< sequence_type >::value, typename sequence_type::const_reference, typename sequence_type::reference >::type type; + typedef remove_reference< Sequence >::type sequence_type; + typedef mpl::if_c< is_const< sequence_type >::value, typename sequence_type::const_reference, typename sequence_type::reference >::type type; }; - // public member functions + // public member functions template<typename Sequence> - result< front(Sequence &)>::type operator()(Sequence &) const; + result< front(Sequence &)>::type operator()(Sequence &) const; };
                                          -

                                          Description

                                          +

                                          Description

                                          -

                                          -front public member functions

                                          +

                                          +front public member functions

                                          1. template<typename Sequence> 
-  result< front(Sequence &)>::type operator()(Sequence & seq) const;
                                            + result< front(Sequence &)>::type operator()(Sequence & seq) const;

                                            @@ -99,7 +99,7 @@
                                            -PrevUpHomeNext +PrevUpHomeNext
                                            diff --git a/doc/html/boost/xpressive/op/front/result.html b/doc/html/boost/xpressive/op/front/result.html index e2bc25fe9e..da6479251c 100644 --- a/doc/html/boost/xpressive/op/front/result.html +++ b/doc/html/boost/xpressive/op/front/result.html @@ -6,9 +6,9 @@ - + - + @@ -21,7 +21,7 @@
                                            -PrevUpHomeNext +PrevUpHomeNext
                                            @@ -47,7 +47,7 @@
                                            -PrevUpHomeNext +PrevUpHomeNext
                                            diff --git a/doc/html/boost/xpressive/op/front/result_T_idm45506840326960.html b/doc/html/boost/xpressive/op/front/result_T_idm45506840326960.html new file mode 100644 index 0000000000..4fee744266 --- /dev/null +++ b/doc/html/boost/xpressive/op/front/result_T_idm45506840326960.html @@ -0,0 +1,56 @@ + + + + +Struct template result<This(Sequence)> + + + + + + + + + + + + + + + +
                                            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                            +
                                            +
                                            +PrevUpHomeNext +
                                            +
                                            +
                                            +
                                            +

                                            Struct template result<This(Sequence)>

                                            +

                                            boost::xpressive::op::front::result<This(Sequence)>

                                            +
                                            +

                                            Synopsis

                                            +
                                            // In header: <boost/xpressive/regex_actions.hpp>
+
+
+template<typename This, typename Sequence> 
+struct result<This(Sequence)> {
+  // types
+  typedef remove_reference< Sequence >::type                                                                                              sequence_type;
+  typedef mpl::if_c< is_const< sequence_type >::value, typename sequence_type::const_reference, typename sequence_type::reference >::type type;         
+};
                                            +
                                            + + + +
                                            Copyright © 2007 Eric Niebler

                                            + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                            +
                                            +
                                            +
                                            +PrevUpHomeNext +
                                            + + diff --git a/doc/html/boost/xpressive/op/front/result_This_S_idp358213584.html b/doc/html/boost/xpressive/op/front/result_This_S_idp358213584.html deleted file mode 100644 index 6a982bb8b2..0000000000 --- a/doc/html/boost/xpressive/op/front/result_This_S_idp358213584.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Struct template result<This(Sequence)> - - - - - - - - - - - - - - - -
                                            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                            -
                                            -
                                            -PrevUpHomeNext -
                                            -
                                            -
                                            -
                                            -

                                            Struct template result<This(Sequence)>

                                            -

                                            boost::xpressive::op::front::result<This(Sequence)>

                                            -
                                            -

                                            Synopsis

                                            -
                                            // In header: <boost/xpressive/regex_actions.hpp>
-
-
-template<typename This, typename Sequence> 
-struct result<This(Sequence)> {
-  // types
-  typedef remove_reference< Sequence >::type                                                                                              sequence_type;
-  typedef mpl::if_c< is_const< sequence_type >::value, typename sequence_type::const_reference, typename sequence_type::reference >::type type;         
-};
                                            -
                                            - - - -
                                            Copyright © 2007 Eric Niebler

                                            - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                            -
                                            -
                                            -
                                            -PrevUpHomeNext -
                                            - - diff --git a/doc/html/boost/xpressive/op/insert.html b/doc/html/boost/xpressive/op/insert.html index 0fff1e7af3..fa6a5fdb8b 100644 --- a/doc/html/boost/xpressive/op/insert.html +++ b/doc/html/boost/xpressive/op/insert.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                                            -PrevUpHomeNext +PrevUpHomeNext
                                            @@ -41,48 +41,48 @@ typedef unspecified type; }; - // public member functions + // public member functions template<typename Cont, typename A0> result< insert(Cont &, A0 const &)>::type - operator()(Cont &, A0 const &) const; + operator()(Cont &, A0 const &) const; template<typename Cont, typename A0, typename A1> result< insert(Cont &, A0 const &, A1 const &)>::type - operator()(Cont &, A0 const &, A1 const &) const; + operator()(Cont &, A0 const &, A1 const &) const; template<typename Cont, typename A0, typename A1, typename A2> result< insert(Cont &, A0 const &, A1 const &, A2 const &)>::type - operator()(Cont &, A0 const &, A1 const &, A2 const &) const; + operator()(Cont &, A0 const &, A1 const &, A2 const &) const; template<typename Cont, typename A0, typename A1, typename A2, typename A3> result< insert(Cont &, A0 const &, A1 const &, A2 const &, A3 const &)>::type - operator()(Cont &, A0 const &, A1 const &, A2 const &, A3 const &) const; + operator()(Cont &, A0 const &, A1 const &, A2 const &, A3 const &) const; };
                                            -

                                            Description

                                            +

                                            Description

                                            -

                                            -insert public member functions

                                            +

                                            +insert public member functions

                                            1. template<typename Cont, typename A0> 
   result< insert(Cont &, A0 const &)>::type 
-  operator()(Cont & cont, A0 const & a0) const;
                                              + operator()(Cont & cont, A0 const & a0) const;

                                              This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. 

                                            2. template<typename Cont, typename A0, typename A1> 
   result< insert(Cont &, A0 const &, A1 const &)>::type 
-  operator()(Cont & cont, A0 const & a0, A1 const & a1) const;
                                              + operator()(Cont & cont, A0 const & a0, A1 const & a1) const;

                                              This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. 

                                            3. template<typename Cont, typename A0, typename A1, typename A2> 
   result< insert(Cont &, A0 const &, A1 const &, A2 const &)>::type 
-  operator()(Cont & cont, A0 const & a0, A1 const & a1, A2 const & a2) const;
                                              + operator()(Cont & cont, A0 const & a0, A1 const & a1, A2 const & a2) const;

                                              This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. 

                                            4. template<typename Cont, typename A0, typename A1, typename A2, typename A3> 
   result< insert(Cont &, A0 const &, A1 const &, A2 const &, A3 const &)>::type 
-  operator()(Cont & cont, A0 const & a0, A1 const & a1, A2 const & a2, 
+  operator()(Cont & cont, A0 const & a0, A1 const & a1, A2 const & a2, 
              A3 const & a3) const;

                                              @@ -154,7 +154,7 @@

                                              -PrevUpHomeNext +PrevUpHomeNext
                                              diff --git a/doc/html/boost/xpressive/op/insert/result.html b/doc/html/boost/xpressive/op/insert/result.html index 22edc6d04a..801706ffd0 100644 --- a/doc/html/boost/xpressive/op/insert/result.html +++ b/doc/html/boost/xpressive/op/insert/result.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
                                              -PrevUpHomeNext +PrevUpHomeNext
                                              @@ -49,7 +49,7 @@
                                              -PrevUpHomeNext +PrevUpHomeNext
                                              diff --git a/doc/html/boost/xpressive/op/length.html b/doc/html/boost/xpressive/op/length.html index efdcc44134..430cd0580c 100644 --- a/doc/html/boost/xpressive/op/length.html +++ b/doc/html/boost/xpressive/op/length.html @@ -39,21 +39,21 @@ struct result { }; template<typename This, typename Sub> - struct result<This(Sub)> { + struct result<This(Sub)> { // types - typedef remove_reference< Sub >::type::difference_type type; + typedef remove_reference< Sub >::type::difference_type type; }; - // public member functions - template<typename Sub> Sub::difference_type operator()(Sub const &) const; + // public member functions + template<typename Sub> Sub::difference_type operator()(Sub const &) const; };
                                              -

                                              Description

                                              +

                                              Description

                                              -

                                              -length public member functions

                                              +

                                              +length public member functions

                                              1. -
                                                template<typename Sub> Sub::difference_type operator()(Sub const & sub) const;
                                                +
                                                template<typename Sub> Sub::difference_type operator()(Sub const & sub) const;

                                                diff --git a/doc/html/boost/xpressive/op/length/result.html b/doc/html/boost/xpressive/op/length/result.html index 177240f559..36a07242c1 100644 --- a/doc/html/boost/xpressive/op/length/result.html +++ b/doc/html/boost/xpressive/op/length/result.html @@ -6,9 +6,9 @@ - + - + @@ -21,7 +21,7 @@
                                                -PrevUpHomeNext +PrevUpHomeNext
                                                @@ -47,7 +47,7 @@
                                                -PrevUpHomeNext +PrevUpHomeNext
                                                diff --git a/doc/html/boost/xpressive/op/length/result_T_idm45506840272608.html b/doc/html/boost/xpressive/op/length/result_T_idm45506840272608.html new file mode 100644 index 0000000000..dd7eb9f167 --- /dev/null +++ b/doc/html/boost/xpressive/op/length/result_T_idm45506840272608.html @@ -0,0 +1,55 @@ + + + + +Struct template result<This(Sub)> + + + + + + + + + + + + + + + +
                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                +
                                                +
                                                +PrevUpHomeNext +
                                                +
                                                +
                                                +
                                                +

                                                Struct template result<This(Sub)>

                                                +

                                                boost::xpressive::op::length::result<This(Sub)>

                                                +
                                                +

                                                Synopsis

                                                +
                                                // In header: <boost/xpressive/regex_actions.hpp>
+
+
+template<typename This, typename Sub> 
+struct result<This(Sub)> {
+  // types
+  typedef remove_reference< Sub >::type::difference_type type;
+};
                                                +
                                                + + + +
                                                Copyright © 2007 Eric Niebler

                                                + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                +
                                                +
                                                +
                                                +PrevUpHomeNext +
                                                + + diff --git a/doc/html/boost/xpressive/op/length/result_This_S_idp358267936.html b/doc/html/boost/xpressive/op/length/result_This_S_idp358267936.html deleted file mode 100644 index 9fb30883c0..0000000000 --- a/doc/html/boost/xpressive/op/length/result_This_S_idp358267936.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template result<This(Sub)> - - - - - - - - - - - - - - - -
                                                Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                -
                                                -
                                                -PrevUpHomeNext -
                                                -
                                                -
                                                -
                                                -

                                                Struct template result<This(Sub)>

                                                -

                                                boost::xpressive::op::length::result<This(Sub)>

                                                -
                                                -

                                                Synopsis

                                                -
                                                // In header: <boost/xpressive/regex_actions.hpp>
-
-
-template<typename This, typename Sub> 
-struct result<This(Sub)> {
-  // types
-  typedef remove_reference< Sub >::type::difference_type type;
-};
                                                -
                                                - - - -
                                                Copyright © 2007 Eric Niebler

                                                - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                -
                                                -
                                                -
                                                -PrevUpHomeNext -
                                                - - diff --git a/doc/html/boost/xpressive/op/make_pair.html b/doc/html/boost/xpressive/op/make_pair.html index 006fb28fc8..425bb4836b 100644 --- a/doc/html/boost/xpressive/op/make_pair.html +++ b/doc/html/boost/xpressive/op/make_pair.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                                                -PrevUpHomeNext +PrevUpHomeNext
                                                @@ -39,26 +39,26 @@ struct result { }; template<typename This, typename First, typename Second> - struct result<This(First, Second)> { + struct result<This(First, Second)> { // types - typedef decay< First >::type first_type; // For exposition only. - typedef decay< Second >::type second_type; // For exposition only. - typedef std::pair< first_type, second_type > type; + typedef decay< First >::type first_type; // For exposition only. + typedef decay< Second >::type second_type; // For exposition only. + typedef std::pair< first_type, second_type > type; }; - // public member functions + // public member functions template<typename First, typename Second> - std::pair< First, Second > operator()(First const &, Second const &) const; + std::pair< First, Second > operator()(First const &, Second const &) const; };
                                                -

                                                Description

                                                +

                                                Description

                                                -

                                                -make_pair public member functions

                                                +

                                                +make_pair public member functions

                                                1. template<typename First, typename Second> 
   std::pair< First, Second > 
-  operator()(First const & first, Second const & second) const;
                                                  + operator()(First const & first, Second const & second) const;

                                                  @@ -107,7 +107,7 @@
                                                  -PrevUpHomeNext +PrevUpHomeNext
                                                  diff --git a/doc/html/boost/xpressive/op/make_pair/result.html b/doc/html/boost/xpressive/op/make_pair/result.html index 8908b636f9..b5a1d53e1a 100644 --- a/doc/html/boost/xpressive/op/make_pair/result.html +++ b/doc/html/boost/xpressive/op/make_pair/result.html @@ -6,9 +6,9 @@ - + - + @@ -21,7 +21,7 @@
                                                  -PrevUpHomeNext +PrevUpHomeNext
                                                  @@ -47,7 +47,7 @@
                                                  -PrevUpHomeNext +PrevUpHomeNext
                                                  diff --git a/doc/html/boost/xpressive/op/make_pair/result_T_idm45506840260208.html b/doc/html/boost/xpressive/op/make_pair/result_T_idm45506840260208.html new file mode 100644 index 0000000000..d5bfdf5bab --- /dev/null +++ b/doc/html/boost/xpressive/op/make_pair/result_T_idm45506840260208.html @@ -0,0 +1,57 @@ + + + + +Struct template result<This(First, Second)> + + + + + + + + + + + + + + + +
                                                  Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                  +
                                                  +
                                                  +PrevUpHomeNext +
                                                  +
                                                  +
                                                  +
                                                  +

                                                  Struct template result<This(First, Second)>

                                                  +

                                                  boost::xpressive::op::make_pair::result<This(First, Second)>

                                                  +
                                                  +

                                                  Synopsis

                                                  +
                                                  // In header: <boost/xpressive/regex_actions.hpp>
+
+
+template<typename This, typename First, typename Second> 
+struct result<This(First, Second)> {
+  // types
+  typedef decay< First >::type                 first_type;   // For exposition only. 
+  typedef decay< Second >::type                second_type;  // For exposition only. 
+  typedef std::pair< first_type, second_type > type;       
+};
                                                  +
                                                  + + + +
                                                  Copyright © 2007 Eric Niebler

                                                  + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                  +
                                                  +
                                                  +
                                                  +PrevUpHomeNext +
                                                  + + diff --git a/doc/html/boost/xpressive/op/make_pair/result_This_F_idp358280336.html b/doc/html/boost/xpressive/op/make_pair/result_This_F_idp358280336.html deleted file mode 100644 index 05ce9171dd..0000000000 --- a/doc/html/boost/xpressive/op/make_pair/result_This_F_idp358280336.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Struct template result<This(First, Second)> - - - - - - - - - - - - - - - -
                                                  Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                  -
                                                  -
                                                  -PrevUpHomeNext -
                                                  -
                                                  -
                                                  -
                                                  -

                                                  Struct template result<This(First, Second)>

                                                  -

                                                  boost::xpressive::op::make_pair::result<This(First, Second)>

                                                  -
                                                  -

                                                  Synopsis

                                                  -
                                                  // In header: <boost/xpressive/regex_actions.hpp>
-
-
-template<typename This, typename First, typename Second> 
-struct result<This(First, Second)> {
-  // types
-  typedef decay< First >::type                 first_type;   // For exposition only. 
-  typedef decay< Second >::type                second_type;  // For exposition only. 
-  typedef std::pair< first_type, second_type > type;       
-};
                                                  -
                                                  - - - -
                                                  Copyright © 2007 Eric Niebler

                                                  - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                  -
                                                  -
                                                  -
                                                  -PrevUpHomeNext -
                                                  - - diff --git a/doc/html/boost/xpressive/op/matched.html b/doc/html/boost/xpressive/op/matched.html index f41c724cf2..b8d2435b75 100644 --- a/doc/html/boost/xpressive/op/matched.html +++ b/doc/html/boost/xpressive/op/matched.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                                                  -PrevUpHomeNext +PrevUpHomeNext
                                                  @@ -37,16 +37,16 @@ // types typedef bool result_type; - // public member functions - template<typename Sub> bool operator()(Sub const &) const; + // public member functions + template<typename Sub> bool operator()(Sub const &) const; };
                                                  -

                                                  Description

                                                  +

                                                  Description

                                                  -

                                                  -matched public member functions

                                                  +

                                                  +matched public member functions

                                                  1. -
                                                    template<typename Sub> bool operator()(Sub const & sub) const;
                                                    +
                                                    template<typename Sub> bool operator()(Sub const & sub) const;

                                                    @@ -89,7 +89,7 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    diff --git a/doc/html/boost/xpressive/op/pop.html b/doc/html/boost/xpressive/op/pop.html index 64dd7aee1c..25f9c8da55 100644 --- a/doc/html/boost/xpressive/op/pop.html +++ b/doc/html/boost/xpressive/op/pop.html @@ -37,16 +37,16 @@ // types typedef void result_type; - // public member functions - template<typename Sequence> void operator()(Sequence &) const; + // public member functions + template<typename Sequence> void operator()(Sequence &) const; };
                                                  -

                                                  Description

                                                  +

                                                  Description

                                                  -

                                                  -pop public member functions

                                                  +

                                                  +pop public member functions

                                                  1. -
                                                    template<typename Sequence> void operator()(Sequence & seq) const;
                                                    Equivalent to seq.pop().

                                                    +

                                                    template<typename Sequence> void operator()(Sequence & seq) const;
                                                    Equivalent to seq.pop().

                                                    diff --git a/doc/html/boost/xpressive/op/pop_back.html b/doc/html/boost/xpressive/op/pop_back.html index cc391fec7a..656cf0e1b0 100644 --- a/doc/html/boost/xpressive/op/pop_back.html +++ b/doc/html/boost/xpressive/op/pop_back.html @@ -37,16 +37,16 @@ // typestypedefvoidresult_type; - // public member functions - template<typename Sequence>voidoperator()(Sequence&)const; + // public member functions + template<typename Sequence>voidoperator()(Sequence&)const;};
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    -

                                                    -pop_back public member functions

                                                    +

                                                    +pop_back public member functions

                                                    1. -
                                                      template<typename Sequence> void operator()(Sequence & seq) const;
                                                      Equivalent to seq.pop_back().

                                                      +

                                                      template<typename Sequence> void operator()(Sequence & seq) const;
                                                      Equivalent to seq.pop_back().

                                                    diff --git a/doc/html/boost/xpressive/op/pop_front.html b/doc/html/boost/xpressive/op/pop_front.html index 2ce6c838aa..05691738ce 100644 --- a/doc/html/boost/xpressive/op/pop_front.html +++ b/doc/html/boost/xpressive/op/pop_front.html @@ -37,16 +37,16 @@ // typestypedefvoidresult_type; - // public member functions - template<typename Sequence>voidoperator()(Sequence&)const; + // public member functions + template<typename Sequence>voidoperator()(Sequence&)const;};
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    -

                                                    -pop_front public member functions

                                                    +

                                                    +pop_front public member functions

                                                    1. -
                                                      template<typename Sequence> void operator()(Sequence & seq) const;
                                                      Equivalent to seq.pop_front().

                                                      +

                                                      template<typename Sequence> void operator()(Sequence & seq) const;
                                                      Equivalent to seq.pop_front().

                                                    diff --git a/doc/html/boost/xpressive/op/push.html b/doc/html/boost/xpressive/op/push.html index af0eed847d..43728d019f 100644 --- a/doc/html/boost/xpressive/op/push.html +++ b/doc/html/boost/xpressive/op/push.html @@ -37,18 +37,18 @@ // typestypedefvoidresult_type; - // public member functions + // public member functionstemplate<typename Sequence,typename Value> - voidoperator()(Sequence&,Valueconst&)const; + voidoperator()(Sequence&,Valueconst&)const;};
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    -

                                                    -push public member functions

                                                    +

                                                    +push public member functions

                                                    1. template<typename Sequence, typename Value> 
-  void operator()(Sequence & seq, Value const & val) const;
                                                      Equivalent to seq.push(val).

                                                      + void operator()(Sequence & seq, Value const & val) const;Equivalent to seq.push(val).

                                                    diff --git a/doc/html/boost/xpressive/op/push_back.html b/doc/html/boost/xpressive/op/push_back.html index be205880c4..d6306df3c1 100644 --- a/doc/html/boost/xpressive/op/push_back.html +++ b/doc/html/boost/xpressive/op/push_back.html @@ -37,18 +37,18 @@ // typestypedefvoidresult_type; - // public member functions + // public member functionstemplate<typename Sequence,typename Value> - voidoperator()(Sequence&,Valueconst&)const; + voidoperator()(Sequence&,Valueconst&)const;};
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    -

                                                    -push_back public member functions

                                                    +

                                                    +push_back public member functions

                                                    1. template<typename Sequence, typename Value> 
-  void operator()(Sequence & seq, Value const & val) const;
                                                      Equivalent to seq.push_back(val).

                                                      + void operator()(Sequence & seq, Value const & val) const;Equivalent to seq.push_back(val).

                                                    diff --git a/doc/html/boost/xpressive/op/push_front.html b/doc/html/boost/xpressive/op/push_front.html index 7a53df59f2..5ed4f4680d 100644 --- a/doc/html/boost/xpressive/op/push_front.html +++ b/doc/html/boost/xpressive/op/push_front.html @@ -37,18 +37,18 @@ // typestypedefvoidresult_type; - // public member functions + // public member functionstemplate<typename Sequence,typename Value> - voidoperator()(Sequence&,Valueconst&)const; + voidoperator()(Sequence&,Valueconst&)const;};
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    -

                                                    -push_front public member functions

                                                    +

                                                    +push_front public member functions

                                                    1. template<typename Sequence, typename Value> 
-  void operator()(Sequence & seq, Value const & val) const;
                                                      Equivalent to seq.push_front(val).

                                                      + void operator()(Sequence & seq, Value const & val) const;Equivalent to seq.push_front(val).

                                                    diff --git a/doc/html/boost/xpressive/op/second.html b/doc/html/boost/xpressive/op/second.html index 29a8b73709..5de0562130 100644 --- a/doc/html/boost/xpressive/op/second.html +++ b/doc/html/boost/xpressive/op/second.html @@ -39,21 +39,21 @@ structresult{};template<typename This,typename Pair> - structresult<This(Pair)>{ + structresult<This(Pair)>{// types - typedefremove_reference<Pair>::type::second_typetype; + typedefremove_reference<Pair>::type::second_typetype;}; - // public member functions - template<typename Pair>Pair::second_typeoperator()(Pairconst&)const; + // public member functions + template<typename Pair>Pair::second_typeoperator()(Pairconst&)const;};
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    -

                                                    -second public member functions

                                                    +

                                                    +second public member functions

                                                    1. -
                                                      template<typename Pair> Pair::second_type operator()(Pair const & p) const;
                                                      +
                                                      template<typename Pair> Pair::second_type operator()(Pair const & p) const;

                                                      diff --git a/doc/html/boost/xpressive/op/second/result.html b/doc/html/boost/xpressive/op/second/result.html index a28ed78d1c..6753f97ee8 100644 --- a/doc/html/boost/xpressive/op/second/result.html +++ b/doc/html/boost/xpressive/op/second/result.html @@ -6,9 +6,9 @@ - + - +
                                                    @@ -21,7 +21,7 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    @@ -47,7 +47,7 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    diff --git a/doc/html/boost/xpressive/op/second/result_T_idm45506840183920.html b/doc/html/boost/xpressive/op/second/result_T_idm45506840183920.html new file mode 100644 index 0000000000..45c9342f99 --- /dev/null +++ b/doc/html/boost/xpressive/op/second/result_T_idm45506840183920.html @@ -0,0 +1,55 @@ + + + + +Struct template result<This(Pair)> + + + + + + + + + + + + + + + +
                                                    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                    +
                                                    +
                                                    +PrevUpHomeNext +
                                                    +
                                                    +
                                                    +
                                                    +

                                                    Struct template result<This(Pair)>

                                                    +

                                                    boost::xpressive::op::second::result<This(Pair)>

                                                    +
                                                    +

                                                    Synopsis

                                                    +
                                                    // In header: <boost/xpressive/regex_actions.hpp>
+
+
+template<typename This, typename Pair> 
+struct result<This(Pair)> {
+  // types
+  typedef remove_reference< Pair >::type::second_type type;
+};
                                                    +
                                                    + + + +
                                                    Copyright © 2007 Eric Niebler

                                                    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                    +
                                                    +
                                                    +
                                                    +PrevUpHomeNext +
                                                    + + diff --git a/doc/html/boost/xpressive/op/second/result_This_P_idp358356624.html b/doc/html/boost/xpressive/op/second/result_This_P_idp358356624.html deleted file mode 100644 index 9efda13de4..0000000000 --- a/doc/html/boost/xpressive/op/second/result_This_P_idp358356624.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template result<This(Pair)> - - - - - - - - - - - - - - - -
                                                    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                    -
                                                    -
                                                    -PrevUpHomeNext -
                                                    -
                                                    -
                                                    -
                                                    -

                                                    Struct template result<This(Pair)>

                                                    -

                                                    boost::xpressive::op::second::result<This(Pair)>

                                                    -
                                                    -

                                                    Synopsis

                                                    -
                                                    // In header: <boost/xpressive/regex_actions.hpp>
-
-
-template<typename This, typename Pair> 
-struct result<This(Pair)> {
-  // types
-  typedef remove_reference< Pair >::type::second_type type;
-};
                                                    -
                                                    - - - -
                                                    Copyright © 2007 Eric Niebler

                                                    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                    -
                                                    -
                                                    -
                                                    -PrevUpHomeNext -
                                                    - - diff --git a/doc/html/boost/xpressive/op/static_cast_.html b/doc/html/boost/xpressive/op/static_cast_.html index 4c13e17d2c..bfed2108c6 100644 --- a/doc/html/boost/xpressive/op/static_cast_.html +++ b/doc/html/boost/xpressive/op/static_cast_.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                                                    -PrevUpHomeNext +PrevUpHomeNext
                                                    @@ -37,25 +37,25 @@ // types typedef T result_type; - // public member functions - template<typename Value> T operator()(Value const &) const; + // public member functions + template<typename Value> T operator()(Value const &) const; };
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    -

                                                    Template Parameters

                                                    +

                                                    Template Parameters

                                                    1. typename T

                                                      The type to which to statically cast the parameter.

                                                    -

                                                    -static_cast_ public member functions

                                                    +

                                                    +static_cast_ public member functions

                                                    1. -
                                                      template<typename Value> T operator()(Value const & val) const;
                                                      +
                                                      template<typename Value> T operator()(Value const & val) const;

                                                      @@ -98,7 +98,7 @@
                                                      -PrevUpHomeNext +PrevUpHomeNext
                                                      diff --git a/doc/html/boost/xpressive/op/str.html b/doc/html/boost/xpressive/op/str.html index ad93ee4a8f..6c782f6e3c 100644 --- a/doc/html/boost/xpressive/op/str.html +++ b/doc/html/boost/xpressive/op/str.html @@ -39,21 +39,21 @@ struct result { }; template<typename This, typename Sub> - struct result<This(Sub)> { + struct result<This(Sub)> { // types - typedef remove_reference< Sub >::type::string_type type; + typedef remove_reference< Sub >::type::string_type type; }; - // public member functions - template<typename Sub> Sub::string_type operator()(Sub const &) const; + // public member functions + template<typename Sub> Sub::string_type operator()(Sub const &) const; };
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    -

                                                    -str public member functions

                                                    +

                                                    +str public member functions

                                                    1. -
                                                      template<typename Sub> Sub::string_type operator()(Sub const & sub) const;
                                                      +
                                                      template<typename Sub> Sub::string_type operator()(Sub const & sub) const;

                                                      diff --git a/doc/html/boost/xpressive/op/str/result.html b/doc/html/boost/xpressive/op/str/result.html index 5e00e86c5b..96cfed3438 100644 --- a/doc/html/boost/xpressive/op/str/result.html +++ b/doc/html/boost/xpressive/op/str/result.html @@ -6,9 +6,9 @@ - + - + @@ -21,7 +21,7 @@
                                                      -PrevUpHomeNext +PrevUpHomeNext
                                                      @@ -47,7 +47,7 @@
                                                      -PrevUpHomeNext +PrevUpHomeNext
                                                      diff --git a/doc/html/boost/xpressive/op/str/result_T_idm45506840163184.html b/doc/html/boost/xpressive/op/str/result_T_idm45506840163184.html new file mode 100644 index 0000000000..8a37930bfc --- /dev/null +++ b/doc/html/boost/xpressive/op/str/result_T_idm45506840163184.html @@ -0,0 +1,55 @@ + + + + +Struct template result<This(Sub)> + + + + + + + + + + + + + + + +
                                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                      +
                                                      +
                                                      +PrevUpHomeNext +
                                                      +
                                                      +
                                                      +
                                                      +

                                                      Struct template result<This(Sub)>

                                                      +

                                                      boost::xpressive::op::str::result<This(Sub)>

                                                      +
                                                      +

                                                      Synopsis

                                                      +
                                                      // In header: <boost/xpressive/regex_actions.hpp>
+
+
+template<typename This, typename Sub> 
+struct result<This(Sub)> {
+  // types
+  typedef remove_reference< Sub >::type::string_type type;
+};
                                                      +
                                                      + + + +
                                                      Copyright © 2007 Eric Niebler

                                                      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                      +
                                                      +
                                                      +
                                                      +PrevUpHomeNext +
                                                      + + diff --git a/doc/html/boost/xpressive/op/str/result_This_S_idp358377360.html b/doc/html/boost/xpressive/op/str/result_This_S_idp358377360.html deleted file mode 100644 index 6ca7b99709..0000000000 --- a/doc/html/boost/xpressive/op/str/result_This_S_idp358377360.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template result<This(Sub)> - - - - - - - - - - - - - - - -
                                                      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                      -
                                                      -
                                                      -PrevUpHomeNext -
                                                      -
                                                      -
                                                      -
                                                      -

                                                      Struct template result<This(Sub)>

                                                      -

                                                      boost::xpressive::op::str::result<This(Sub)>

                                                      -
                                                      -

                                                      Synopsis

                                                      -
                                                      // In header: <boost/xpressive/regex_actions.hpp>
-
-
-template<typename This, typename Sub> 
-struct result<This(Sub)> {
-  // types
-  typedef remove_reference< Sub >::type::string_type type;
-};
                                                      -
                                                      - - - -
                                                      Copyright © 2007 Eric Niebler

                                                      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                      -
                                                      -
                                                      -
                                                      -PrevUpHomeNext -
                                                      - - diff --git a/doc/html/boost/xpressive/op/throw_.html b/doc/html/boost/xpressive/op/throw_.html index 139080c96e..12dcb1ecdf 100644 --- a/doc/html/boost/xpressive/op/throw_.html +++ b/doc/html/boost/xpressive/op/throw_.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                                                      -PrevUpHomeNext +PrevUpHomeNext
                                                      @@ -37,45 +37,45 @@ // types typedef void result_type; - // public member functions - void operator()() const; - template<typename A0> void operator()(A0 const &) const; + // public member functions + void operator()() const; + template<typename A0> void operator()(A0 const &) const; template<typename A0, typename A1> - void operator()(A0 const &, A1 const &) const; + void operator()(A0 const &, A1 const &) const; template<typename A0, typename A1, typename A2> - void operator()(A0 const &, A1 const &, A2 const &) const; + void operator()(A0 const &, A1 const &, A2 const &) const; };
                                                      -

                                                      Description

                                                      +

                                                      Description

                                                      -

                                                      Template Parameters

                                                      +

                                                      Template Parameters

                                                      1. typename Except

                                                        The type of the object to throw.

                                                      -

                                                      -throw_ public member functions

                                                      +

                                                      +throw_ public member functions

                                                      1. -
                                                        void operator()() const;
                                                        +
                                                        void operator()() const;

                                                        This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

                                                      2. -
                                                        template<typename A0> void operator()(A0 const & a0) const;
                                                        +
                                                        template<typename A0> void operator()(A0 const & a0) const;

                                                        This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. 

                                                      3. template<typename A0, typename A1> 
-  void operator()(A0 const & a0, A1 const & a1) const;
                                                        + void operator()(A0 const & a0, A1 const & a1) const;

                                                        This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. 

                                                      4. template<typename A0, typename A1, typename A2> 
-  void operator()(A0 const & a0, A1 const & a1, A2 const & a2) const;
                                                        + void operator()(A0 const & a0, A1 const & a1, A2 const & a2) const;

                                                        @@ -138,7 +138,7 @@
                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                        diff --git a/doc/html/boost/xpressive/op/top.html b/doc/html/boost/xpressive/op/top.html index c6e7eec436..57813c9392 100644 --- a/doc/html/boost/xpressive/op/top.html +++ b/doc/html/boost/xpressive/op/top.html @@ -39,24 +39,24 @@ struct result { }; template<typename This, typename Sequence> - struct result<This(Sequence)> { + struct result<This(Sequence)> { // types - typedef remove_reference< Sequence >::type sequence_type; - typedef mpl::if_c< is_const< sequence_type >::value, typename sequence_type::value_type const &, typename sequence_type::value_type & >::type type; + typedef remove_reference< Sequence >::type sequence_type; + typedef mpl::if_c< is_const< sequence_type >::value, typename sequence_type::value_type const &, typename sequence_type::value_type & >::type type; }; - // public member functions + // public member functions template<typename Sequence> - result< top(Sequence &)>::type operator()(Sequence &) const; + result< top(Sequence &)>::type operator()(Sequence &) const; };
                                                      -

                                                      Description

                                                      +

                                                      Description

                                                      -

                                                      -top public member functions

                                                      +

                                                      +top public member functions

                                                      1. template<typename Sequence> 
-  result< top(Sequence &)>::type operator()(Sequence & seq) const;
                                                        + result< top(Sequence &)>::type operator()(Sequence & seq) const;

                                                        diff --git a/doc/html/boost/xpressive/op/top/result.html b/doc/html/boost/xpressive/op/top/result.html index 58d635700b..29b892ec63 100644 --- a/doc/html/boost/xpressive/op/top/result.html +++ b/doc/html/boost/xpressive/op/top/result.html @@ -6,9 +6,9 @@ - + - + @@ -21,7 +21,7 @@
                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                        @@ -47,7 +47,7 @@
                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                        diff --git a/doc/html/boost/xpressive/op/top/result_T_idm45506840129152.html b/doc/html/boost/xpressive/op/top/result_T_idm45506840129152.html new file mode 100644 index 0000000000..240304000f --- /dev/null +++ b/doc/html/boost/xpressive/op/top/result_T_idm45506840129152.html @@ -0,0 +1,56 @@ + + + + +Struct template result<This(Sequence)> + + + + + + + + + + + + + + + +
                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                        +
                                                        +
                                                        +PrevUpHomeNext +
                                                        +
                                                        +
                                                        +
                                                        +

                                                        Struct template result<This(Sequence)>

                                                        +

                                                        boost::xpressive::op::top::result<This(Sequence)>

                                                        +
                                                        +

                                                        Synopsis

                                                        +
                                                        // In header: <boost/xpressive/regex_actions.hpp>
+
+
+template<typename This, typename Sequence> 
+struct result<This(Sequence)> {
+  // types
+  typedef remove_reference< Sequence >::type                                                                                                    sequence_type;
+  typedef mpl::if_c< is_const< sequence_type >::value, typename sequence_type::value_type const &, typename sequence_type::value_type & >::type type;         
+};
                                                        +
                                                        + + + +
                                                        Copyright © 2007 Eric Niebler

                                                        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                        +
                                                        +
                                                        +
                                                        +PrevUpHomeNext +
                                                        + + diff --git a/doc/html/boost/xpressive/op/top/result_This_S_idp358411392.html b/doc/html/boost/xpressive/op/top/result_This_S_idp358411392.html deleted file mode 100644 index 2445376f7d..0000000000 --- a/doc/html/boost/xpressive/op/top/result_This_S_idp358411392.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Struct template result<This(Sequence)> - - - - - - - - - - - - - - - -
                                                        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                        -
                                                        -
                                                        -PrevUpHomeNext -
                                                        -
                                                        -
                                                        -
                                                        -

                                                        Struct template result<This(Sequence)>

                                                        -

                                                        boost::xpressive::op::top::result<This(Sequence)>

                                                        -
                                                        -

                                                        Synopsis

                                                        -
                                                        // In header: <boost/xpressive/regex_actions.hpp>
-
-
-template<typename This, typename Sequence> 
-struct result<This(Sequence)> {
-  // types
-  typedef remove_reference< Sequence >::type                                                                                                    sequence_type;
-  typedef mpl::if_c< is_const< sequence_type >::value, typename sequence_type::value_type const &, typename sequence_type::value_type & >::type type;         
-};
                                                        -
                                                        - - - -
                                                        Copyright © 2007 Eric Niebler

                                                        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                        -
                                                        -
                                                        -
                                                        -PrevUpHomeNext -
                                                        - - diff --git a/doc/html/boost/xpressive/op/unwrap_reference.html b/doc/html/boost/xpressive/op/unwrap_reference.html index 559a86a21e..0aea782dd1 100644 --- a/doc/html/boost/xpressive/op/unwrap_reference.html +++ b/doc/html/boost/xpressive/op/unwrap_reference.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                        @@ -39,26 +39,26 @@ struct result { }; template<typename This, typename Ref> - struct result<This(Ref &)> { + struct result<This(Ref &)> { // types - typedef boost::unwrap_reference< Ref >::type & type; + typedef boost::unwrap_reference< Ref >::type & type; }; template<typename This, typename Ref> - struct result<This(Ref)> { + struct result<This(Ref)> { // types - typedef boost::unwrap_reference< Ref >::type & type; + typedef boost::unwrap_reference< Ref >::type & type; }; - // public member functions - template<typename T> T & operator()(boost::reference_wrapper< T >) const; + // public member functions + template<typename T> T & operator()(boost::reference_wrapper< T >) const; };
                                                        -

                                                        Description

                                                        +

                                                        Description

                                                        -

                                                        -unwrap_reference public member functions

                                                        +

                                                        +unwrap_reference public member functions

                                                        1. -
                                                          template<typename T> T & operator()(boost::reference_wrapper< T > r) const;
                                                          +
                                                          template<typename T> T & operator()(boost::reference_wrapper< T > r) const;

                                                          @@ -101,7 +101,7 @@
                                                          -PrevUpHomeNext +PrevUpHomeNext
                                                          diff --git a/doc/html/boost/xpressive/op/unwrap_reference/result.html b/doc/html/boost/xpressive/op/unwrap_reference/result.html index 20ad219f5f..9c450efeef 100644 --- a/doc/html/boost/xpressive/op/unwrap_reference/result.html +++ b/doc/html/boost/xpressive/op/unwrap_reference/result.html @@ -6,9 +6,9 @@ - + - + @@ -21,7 +21,7 @@
                                                          -PrevUpHomeNext +PrevUpHomeNext
                                                          @@ -47,7 +47,7 @@
                                                          -PrevUpHomeNext +PrevUpHomeNext
                                                          diff --git a/doc/html/boost/xpressive/op/unwrap_reference/result_T_idm45506840112768.html b/doc/html/boost/xpressive/op/unwrap_reference/result_T_idm45506840112768.html new file mode 100644 index 0000000000..4979b15cda --- /dev/null +++ b/doc/html/boost/xpressive/op/unwrap_reference/result_T_idm45506840112768.html @@ -0,0 +1,55 @@ + + + + +Struct template result<This(Ref)> + + + + + + + + + + + + + + + +
                                                          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                          +
                                                          +
                                                          +PrevUpHomeNext +
                                                          +
                                                          +
                                                          +
                                                          +

                                                          Struct template result<This(Ref)>

                                                          +

                                                          boost::xpressive::op::unwrap_reference::result<This(Ref)>

                                                          +
                                                          +

                                                          Synopsis

                                                          +
                                                          // In header: <boost/xpressive/regex_actions.hpp>
+
+
+template<typename This, typename Ref> 
+struct result<This(Ref)> {
+  // types
+  typedef boost::unwrap_reference< Ref >::type & type;
+};
                                                          +
                                                          + + + +
                                                          Copyright © 2007 Eric Niebler

                                                          + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                          +
                                                          +
                                                          +
                                                          +PrevUpHomeNext +
                                                          + + diff --git a/doc/html/boost/xpressive/op/unwrap_reference/result_T_idm45506840115856.html b/doc/html/boost/xpressive/op/unwrap_reference/result_T_idm45506840115856.html new file mode 100644 index 0000000000..5b52a6f1bf --- /dev/null +++ b/doc/html/boost/xpressive/op/unwrap_reference/result_T_idm45506840115856.html @@ -0,0 +1,55 @@ + + + + +Struct template result<This(Ref &)> + + + + + + + + + + + + + + + +
                                                          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                          +
                                                          +
                                                          +PrevUpHomeNext +
                                                          +
                                                          +
                                                          +
                                                          +

                                                          Struct template result<This(Ref &)>

                                                          +

                                                          boost::xpressive::op::unwrap_reference::result<This(Ref &)>

                                                          +
                                                          +

                                                          Synopsis

                                                          +
                                                          // In header: <boost/xpressive/regex_actions.hpp>
+
+
+template<typename This, typename Ref> 
+struct result<This(Ref &)> {
+  // types
+  typedef boost::unwrap_reference< Ref >::type & type;
+};
                                                          +
                                                          + + + +
                                                          Copyright © 2007 Eric Niebler

                                                          + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                          +
                                                          +
                                                          +
                                                          +PrevUpHomeNext +
                                                          + + diff --git a/doc/html/boost/xpressive/op/unwrap_reference/result_This_R_idp358424688.html b/doc/html/boost/xpressive/op/unwrap_reference/result_This_R_idp358424688.html deleted file mode 100644 index 869f8c22e2..0000000000 --- a/doc/html/boost/xpressive/op/unwrap_reference/result_This_R_idp358424688.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template result<This(Ref &)> - - - - - - - - - - - - - - - -
                                                          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                          -
                                                          -
                                                          -PrevUpHomeNext -
                                                          -
                                                          -
                                                          -
                                                          -

                                                          Struct template result<This(Ref &)>

                                                          -

                                                          boost::xpressive::op::unwrap_reference::result<This(Ref &)>

                                                          -
                                                          -

                                                          Synopsis

                                                          -
                                                          // In header: <boost/xpressive/regex_actions.hpp>
-
-
-template<typename This, typename Ref> 
-struct result<This(Ref &)> {
-  // types
-  typedef boost::unwrap_reference< Ref >::type & type;
-};
                                                          -
                                                          - - - -
                                                          Copyright © 2007 Eric Niebler

                                                          - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                          -
                                                          -
                                                          -
                                                          -PrevUpHomeNext -
                                                          - - diff --git a/doc/html/boost/xpressive/op/unwrap_reference/result_This_R_idp358427776.html b/doc/html/boost/xpressive/op/unwrap_reference/result_This_R_idp358427776.html deleted file mode 100644 index 9de05c79a8..0000000000 --- a/doc/html/boost/xpressive/op/unwrap_reference/result_This_R_idp358427776.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template result<This(Ref)> - - - - - - - - - - - - - - - -
                                                          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                          -
                                                          -
                                                          -PrevUpHomeNext -
                                                          -
                                                          -
                                                          -
                                                          -

                                                          Struct template result<This(Ref)>

                                                          -

                                                          boost::xpressive::op::unwrap_reference::result<This(Ref)>

                                                          -
                                                          -

                                                          Synopsis

                                                          -
                                                          // In header: <boost/xpressive/regex_actions.hpp>
-
-
-template<typename This, typename Ref> 
-struct result<This(Ref)> {
-  // types
-  typedef boost::unwrap_reference< Ref >::type & type;
-};
                                                          -
                                                          - - - -
                                                          Copyright © 2007 Eric Niebler

                                                          - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                          -
                                                          -
                                                          -
                                                          -PrevUpHomeNext -
                                                          - - diff --git a/doc/html/boost/xpressive/operator_idm45506839379712.html b/doc/html/boost/xpressive/operator_idm45506839379712.html new file mode 100644 index 0000000000..40d4fc4c47 --- /dev/null +++ b/doc/html/boost/xpressive/operator_idm45506839379712.html @@ -0,0 +1,91 @@ + + + + +Function template operator<< + + + + + + + + + + + + + + + +
                                                          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                          +
                                                          +
                                                          +PrevUpHomeNext +
                                                          +
                                                          +
                                                          +
                                                          +

                                                          Function template operator<<

                                                          +

                                                          boost::xpressive::operator<< — insertion operator for sending sub-matches to ostreams

                                                          +
                                                          +

                                                          Synopsis

                                                          +
                                                          // In header: <boost/xpressive/sub_match.hpp>
+
+
+template<typename BidiIter, typename Char, typename Traits> 
+  std::basic_ostream< Char, Traits > & 
+  operator<<(std::basic_ostream< Char, Traits > & sout, 
+             sub_match< BidiIter > const & sub);
                                                          +
                                                          +

                                                          Description

                                                          +

                                                          + +

                                                          +
                                                          ++++ + + + + + + + + + + +

                                                          Parameters:

                                                          ++++ + + + + + + + + + + +

                                                          sout

                                                          output stream.

                                                          sub

                                                          sub_match object to be written to the stream.

                                                          Returns:

                                                          sout << sub.str()

                                                          +
                                                          +
                                                          + + + +
                                                          Copyright © 2007 Eric Niebler

                                                          + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                          +
                                                          +
                                                          +
                                                          +PrevUpHomeNext +
                                                          + + diff --git a/doc/html/boost/xpressive/operator_idp359160832.html b/doc/html/boost/xpressive/operator_idp359160832.html deleted file mode 100644 index 9dd087daab..0000000000 --- a/doc/html/boost/xpressive/operator_idp359160832.html +++ /dev/null @@ -1,91 +0,0 @@ - - - - -Function template operator<< - - - - - - - - - - - - - - - -
                                                          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                          -
                                                          -
                                                          -PrevUpHomeNext -
                                                          -
                                                          -
                                                          -
                                                          -

                                                          Function template operator<<

                                                          -

                                                          boost::xpressive::operator<< — insertion operator for sending sub-matches to ostreams

                                                          -
                                                          -

                                                          Synopsis

                                                          -
                                                          // In header: <boost/xpressive/sub_match.hpp>
-
-
-template<typename BidiIter, typename Char, typename Traits> 
-  std::basic_ostream< Char, Traits > & 
-  operator<<(std::basic_ostream< Char, Traits > & sout, 
-             sub_match< BidiIter > const & sub);
                                                          -
                                                          -

                                                          Description

                                                          -

                                                          - -

                                                          -
                                                          ---- - - - - - - - - - - -

                                                          Parameters:

                                                          ---- - - - - - - - - - - -

                                                          sout

                                                          output stream.

                                                          sub

                                                          sub_match object to be written to the stream.

                                                          Returns:

                                                          sout << sub.str()

                                                          -
                                                          -
                                                          - - - -
                                                          Copyright © 2007 Eric Niebler

                                                          - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                          -
                                                          -
                                                          -
                                                          -PrevUpHomeNext -
                                                          - - diff --git a/doc/html/boost/xpressive/optional.html b/doc/html/boost/xpressive/optional.html index df2100b308..30dd3bed3a 100644 --- a/doc/html/boost/xpressive/optional.html +++ b/doc/html/boost/xpressive/optional.html @@ -37,7 +37,7 @@ proto::result_of::make_expr< proto::tag::logical_not, proto::default_domain, Expr const & >::type const optional(Expr const & expr);
                                                          -

                                                          Description

                                                          +

                                                          Description

                                                          diff --git a/doc/html/boost/xpressive/placeholder.html b/doc/html/boost/xpressive/placeholder.html index 0dfc641de3..90b32743f1 100644 --- a/doc/html/boost/xpressive/placeholder.html +++ b/doc/html/boost/xpressive/placeholder.html @@ -35,11 +35,11 @@ template<typename T,int I =0>structplaceholder{// construct/copy/destruct - unspecifiedoperator=(T&)const; - unspecifiedoperator=(Tconst&)const; + unspecifiedoperator=(T&)const; + unspecifiedoperator=(Tconst&)const;};
                                                          -

                                                          Description

                                                          +

                                                          Description

                                                          Use placeholder<> to define a placeholder for use in semantic actions to stand in for real objects. The use of placeholders allows regular expressions with actions to be defined once and reused in many contexts to read and write from objects which were not available when the regex was defined.

                                                          You can use placeholder<> by creating an object of type placeholder<T> and using that object in a semantic action exactly as you intend an object of type T to be used.

                                                          @@ -95,7 +95,7 @@ You can use placeholder<> by creating

                                                          -

                                                          Template Parameters

                                                          +

                                                          Template Parameters

                                                          1. typename T
                                                            @@ -108,13 +108,13 @@ You can use placeholder<> by creating
                                                          -

                                                          +

                                                          placeholder public construct/copy/destruct

                                                          1. -
                                                            unspecified operator=(T & t) const;
                                                            +
                                                            unspecified operator=(T & t) const;

                                                            @@ -145,7 +145,7 @@ You can use placeholder<> by creating
                                                        2. -
                                                          unspecified operator=(T const & t) const;
                                                          +
                                                          unspecified operator=(T const & t) const;

                                                          This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

                                                        diff --git a/doc/html/boost/xpressive/print.html b/doc/html/boost/xpressive/print.html index 71e06d91a2..1ee659e0b2 100644 --- a/doc/html/boost/xpressive/print.html +++ b/doc/html/boost/xpressive/print.html @@ -34,7 +34,7 @@ unspecified print;
                                                        -

                                                        Description

                                                        +

                                                        Description

                                                        The regex traits are used to determine which characters are printable. To match any character that is not printable, use ~print.

                                                        diff --git a/doc/html/boost/xpressive/punct.html b/doc/html/boost/xpressive/punct.html index a4917f6288..985c25d65b 100644 --- a/doc/html/boost/xpressive/punct.html +++ b/doc/html/boost/xpressive/punct.html @@ -34,7 +34,7 @@ unspecified punct;
                                                        -

                                                        Description

                                                        +

                                                        Description

                                                        The regex traits are used to determine which characters are punctuation. To match any character that is not punctuation, use ~punct.

                                                        diff --git a/doc/html/boost/xpressive/range.html b/doc/html/boost/xpressive/range.html index 0403b875fc..f7b6409bb5 100644 --- a/doc/html/boost/xpressive/range.html +++ b/doc/html/boost/xpressive/range.html @@ -35,7 +35,7 @@ template<typename Char>unspecifiedrange(Char ch_min,Char ch_max);
                                                        -

                                                        Description

                                                        +

                                                        Description

                                                        Match any character in the range [ch_min, ch_max].

                                                        diff --git a/doc/html/boost/xpressive/range_begin.html b/doc/html/boost/xpressive/range_begin.html index 8ea07b844b..c9b3edee5c 100644 --- a/doc/html/boost/xpressive/range_begin.html +++ b/doc/html/boost/xpressive/range_begin.html @@ -37,7 +37,7 @@ template<typename BidiIter> BidiIter range_begin(sub_match< BidiIter > const & sub);
                                                        -

                                                        Description

                                                        +

                                                        Description

                                                        diff --git a/doc/html/boost/xpressive/range_end.html b/doc/html/boost/xpressive/range_end.html index d17938d3a1..2c905ee090 100644 --- a/doc/html/boost/xpressive/range_end.html +++ b/doc/html/boost/xpressive/range_end.html @@ -8,7 +8,7 @@ - +

                                                        @@ -21,7 +21,7 @@
                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                        @@ -37,7 +37,7 @@ template<typename BidiIter> BidiIter range_end(sub_match< BidiIter > const & sub);
                                                        -

                                                        Description

                                                        +

                                                        Description

                                                        @@ -83,7 +83,7 @@

                                                        -PrevUpHomeNext +PrevUpHomeNext
                                                        diff --git a/doc/html/boost/xpressive/ref.html b/doc/html/boost/xpressive/ref.html index 5abf04e455..f2302e0c62 100644 --- a/doc/html/boost/xpressive/ref.html +++ b/doc/html/boost/xpressive/ref.html @@ -35,7 +35,7 @@ template<typename T> reference< T > const ref(T & t);
                                                        -

                                                        Description

                                                        +

                                                        Description

                                                        diff --git a/doc/html/boost/xpressive/reference.html b/doc/html/boost/xpressive/reference.html index ef8a257be0..95cd3c9aca 100644 --- a/doc/html/boost/xpressive/reference.html +++ b/doc/html/boost/xpressive/reference.html @@ -36,13 +36,13 @@ structreference:public proto::extends< proto::terminal< reference_wrapper< T > >::type, reference< T > > {// construct/copy/destruct - explicitreference(T&); + explicitreference(T&); - // public member functions - T&get()const; + // public member functions + T&get()const;};
                                                        -

                                                        Description

                                                        +

                                                        Description

                                                        Here is an example of how to use reference<> to create a lazy reference to an existing object so it can be read and written in an xpressive semantic action.

                                                        using namespace boost::xpressive;
@@ -56,19 +56,19 @@ Here is an example of how to use reference<><

                                                        -

                                                        Template Parameters

                                                        +

                                                        Template Parameters

                                                        1. typename T

                                                          The type of the referent.

                                                        -

                                                        +

                                                        reference public construct/copy/destruct

                                                        1. -
                                                          explicit reference(T & t);
                                                          Store a reference to t.

                                                          +

                                                          explicit reference(T & t);
                                                          Store a reference to t.

                                                        @@ -92,10 +92,10 @@ Here is an example of how to use reference<><
                                                        -

                                                        -reference public member functions

                                                        +

                                                        +reference public member functions

                                                        1. -
                                                          T & get() const;
                                                          Fetch the stored value.
                                                        +
                                                        T & get() const;
                                                        Fetch the stored value.
                                                        diff --git a/doc/html/boost/xpressive/regex_compiler.html b/doc/html/boost/xpressive/regex_compiler.html index 807cc0c07c..76e02b16ca 100644 --- a/doc/html/boost/xpressive/regex_compiler.html +++ b/doc/html/boost/xpressive/regex_compiler.html @@ -44,42 +44,42 @@ typedef traits_type::char_class_type char_class_type; // construct/copy/destruct - explicit regex_compiler(RegexTraits const & = RegexTraits()); + explicit regex_compiler(RegexTraits const & = RegexTraits()); - // public member functions - locale_type imbue(locale_type); - locale_type getloc() const; + // public member functions + locale_type imbue(locale_type); + locale_type getloc() const; template<typename InputIter> basic_regex< BidiIter > - compile(InputIter, InputIter, flag_type = regex_constants::ECMAScript); + compile(InputIter, InputIter, flag_type = regex_constants::ECMAScript); template<typename InputRange> disable_if< is_pointer< InputRange >, basic_regex< BidiIter > >::type - compile(InputRange const &, flag_type = regex_constants::ECMAScript); + compile(InputRange const &, flag_type = regex_constants::ECMAScript); basic_regex< BidiIter > - compile(char_type const *, flag_type = regex_constants::ECMAScript); - basic_regex< BidiIter > compile(char_type const *, std::size_t, flag_type); - basic_regex< BidiIter > & operator[](string_type const &); - basic_regex< BidiIter > const & operator[](string_type const &) const; + compile(char_type const *, flag_type = regex_constants::ECMAScript); + basic_regex< BidiIter > compile(char_type const *, std::size_t, flag_type); + basic_regex< BidiIter > & operator[](string_type const &); + basic_regex< BidiIter > const & operator[](string_type const &) const; - // private member functions - bool is_upper_(char_type) const; + // private member functions + bool is_upper_(char_type) const; };
                                                        -

                                                        Description

                                                        +

                                                        Description

                                                        Class template regex_compiler is used to construct a basic_regex object from a string. The string should contain a valid regular expression. You can imbue a regex_compiler object with a locale, after which all basic_regex objects created with that regex_compiler object will use that locale. After creating a regex_compiler object, and optionally imbueing it with a locale, you can call the compile() method to construct a basic_regex object, passing it the string representing the regular expression. You can call compile() multiple times on the same regex_compiler object. Two basic_regex objects compiled from the same string will have different regex_id's.

                                                        -

                                                        +

                                                        regex_compiler public construct/copy/destruct

                                                        -
                                                        1. explicit regex_compiler(RegexTraits const & traits = RegexTraits());
                                                        +
                                                        1. explicit regex_compiler(RegexTraits const & traits = RegexTraits());
                                                        -

                                                        -regex_compiler public member functions

                                                        +

                                                        +regex_compiler public member functions

                                                        1. -
                                                          locale_type imbue(locale_type loc);
                                                          +
                                                          locale_type imbue(locale_type loc);

                                                          Specify the locale to be used by a regex_compiler.

                                                          @@ -111,7 +111,7 @@

                                                      2. -
                                                        locale_type getloc() const;
                                                        +
                                                        locale_type getloc() const;

                                                        Get the locale used by a regex_compiler.

                                                        @@ -129,7 +129,7 @@ 
                                                      3. template<typename InputIter> 
   basic_regex< BidiIter > 
-  compile(InputIter begin, InputIter end, 
+  compile(InputIter begin, InputIter end, 
           flag_type flags = regex_constants::ECMAScript);

                                                        Builds a basic_regex object from a range of characters.

                                                        @@ -195,23 +195,23 @@ 

                                                      4. template<typename InputRange> 
   disable_if< is_pointer< InputRange >, basic_regex< BidiIter > >::type 
-  compile(InputRange const & pat, 
+  compile(InputRange const & pat, 
           flag_type flags = regex_constants::ECMAScript);

                                                        This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. 

                                                      5. basic_regex< BidiIter > 
-compile(char_type const * begin, 
+compile(char_type const * begin, 
         flag_type flags = regex_constants::ECMAScript);

                                                        This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. 

                                                      6. basic_regex< BidiIter > 
-compile(char_type const * begin, std::size_t size, flag_type flags);
                                                        +compile(char_type const * begin, std::size_t size, flag_type flags);

                                                        This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

                                                      7. -
                                                        basic_regex< BidiIter > & operator[](string_type const & name);
                                                        +
                                                        basic_regex< BidiIter > & operator[](string_type const & name);

                                                        Return a reference to the named regular expression. If no such named regular expression exists, create a new regular expression and return a reference to it.

                                                        @@ -248,15 +248,15 @@

                                                    2. -
                                                      basic_regex< BidiIter > const & operator[](string_type const & name) const;
                                                      +
                                                      basic_regex< BidiIter > const & operator[](string_type const & name) const;

                                                      This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

                                                    -

                                                    -regex_compiler private member functions

                                                    -
                                                    1. bool is_upper_(char_type ch) const;
                                                    +

                                                    +regex_compiler private member functions

                                                    +
                                                    1. bool is_upper_(char_type ch) const;
                                                    diff --git a/doc/html/boost/xpressive/regex_constants/error_type.html b/doc/html/boost/xpressive/regex_constants/error_type.html index 5f8c4ee48a..ea3643dc05 100644 --- a/doc/html/boost/xpressive/regex_constants/error_type.html +++ b/doc/html/boost/xpressive/regex_constants/error_type.html @@ -41,7 +41,7 @@ error_badlookbehind, error_badrule, error_badarg, error_badattr, error_internal };
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    Error codes used by the regex_error type

                                                    error_collate
                                                    diff --git a/doc/html/boost/xpressive/regex_constants/match_flag_type.html b/doc/html/boost/xpressive/regex_constants/match_flag_type.html index bad39ef274..4102297873 100644 --- a/doc/html/boost/xpressive/regex_constants/match_flag_type.html +++ b/doc/html/boost/xpressive/regex_constants/match_flag_type.html @@ -46,7 +46,7 @@ format_first_only = = 1 << 16, format_literal = = 1 << 17, format_all = = 1 << 18 };
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    Flags used to customize the behavior of the regex algorithms

                                                    match_default
                                                    diff --git a/doc/html/boost/xpressive/regex_constants/syntax_option_type.html b/doc/html/boost/xpressive/regex_constants/syntax_option_type.html index 9812b4f7e3..56d09b8baf 100644 --- a/doc/html/boost/xpressive/regex_constants/syntax_option_type.html +++ b/doc/html/boost/xpressive/regex_constants/syntax_option_type.html @@ -40,7 +40,7 @@ not_dot_newline = = 1 << 12, ignore_white_space = = 1 << 13 };
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    Flags used to customize the regex syntax

                                                    ECMAScript
                                                    diff --git a/doc/html/boost/xpressive/regex_error.html b/doc/html/boost/xpressive/regex_error.html index 8973881e00..0174d71534 100644 --- a/doc/html/boost/xpressive/regex_error.html +++ b/doc/html/boost/xpressive/regex_error.html @@ -35,22 +35,22 @@ struct regex_error : public std::runtime_error, public exception { // construct/copy/destruct - explicit regex_error(regex_constants::error_type, char const * = ""); - ~regex_error(); + explicit regex_error(regex_constants::error_type, char const * = ""); + ~regex_error(); - // public member functions - regex_constants::error_type code() const; + // public member functions + regex_constants::error_type code() const; };
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    -

                                                    +

                                                    regex_error public construct/copy/destruct

                                                    1. -
                                                      explicit regex_error(regex_constants::error_type code, char const * str = "");
                                                      +
                                                      explicit regex_error(regex_constants::error_type code, char const * str = "");

                                                      Constructs an object of class regex_error.

                                                      @@ -87,7 +87,7 @@
                                                  2. -
                                                    ~regex_error();
                                                    +
                                                    ~regex_error();

                                                    Destructor for class regex_error

                                                    @@ -104,10 +104,10 @@
                                                    -

                                                    -regex_error public member functions

                                                    +

                                                    +regex_error public member functions

                                                    1. -
                                                      regex_constants::error_type code() const;
                                                      +
                                                      regex_constants::error_type code() const;

                                                      Accessor for the error_type value

                                                      diff --git a/doc/html/boost/xpressive/regex_id_filter_predicate.html b/doc/html/boost/xpressive/regex_id_filter_predicate.html index 40735bcd91..d796fbd7a2 100644 --- a/doc/html/boost/xpressive/regex_id_filter_predicate.html +++ b/doc/html/boost/xpressive/regex_id_filter_predicate.html @@ -37,24 +37,24 @@ public std::unary_function< match_results< BidiIter >, bool > { // construct/copy/destruct - regex_id_filter_predicate(regex_id_type); + regex_id_filter_predicate(regex_id_type); - // public member functions - bool operator()(match_results< BidiIter > const &) const; + // public member functions + bool operator()(match_results< BidiIter > const &) const; };
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    -

                                                    +

                                                    regex_id_filter_predicate public construct/copy/destruct

                                                    -
                                                    1. regex_id_filter_predicate(regex_id_type regex_id);
                                                    +
                                                    1. regex_id_filter_predicate(regex_id_type regex_id);
                                                    -

                                                    -regex_id_filter_predicate public member functions

                                                    -
                                                    1. bool operator()(match_results< BidiIter > const & res) const;
                                                    +

                                                    +regex_id_filter_predicate public member functions

                                                    +
                                                    1. bool operator()(match_results< BidiIter > const & res) const;
                                                    diff --git a/doc/html/boost/xpressive/regex_iterator.html b/doc/html/boost/xpressive/regex_iterator.html index 30ad70a1d0..f418cdb8f0 100644 --- a/doc/html/boost/xpressive/regex_iterator.html +++ b/doc/html/boost/xpressive/regex_iterator.html @@ -43,51 +43,51 @@ typedefstd::forward_iterator_tagiterator_category;// construct/copy/destruct - regex_iterator(); - regex_iterator(BidiIter,BidiIter,basic_regex<BidiIter>const&, + regex_iterator(); + regex_iterator(BidiIter,BidiIter,basic_regex<BidiIter>const&,regex_constants::match_flag_type=regex_constants::match_default);template<typename LetExpr> - regex_iterator(BidiIter,BidiIter,basic_regex<BidiIter>const&, + regex_iterator(BidiIter,BidiIter,basic_regex<BidiIter>const&,unspecified,regex_constants::match_flag_type=regex_constants::match_default); - regex_iterator(regex_iterator<BidiIter>const&); - regex_iterator<BidiIter>&operator=(regex_iterator<BidiIter>const&); - - // public member functions - value_typeconst&operator*()const; - value_typeconst*operator->()const; - regex_iterator<BidiIter>&operator++(); - regex_iterator<BidiIter>operator++(int); + regex_iterator(regex_iterator<BidiIter>const&); + regex_iterator<BidiIter>&operator=(regex_iterator<BidiIter>const&); + + // public member functions + value_typeconst&operator*()const; + value_typeconst*operator->()const; + regex_iterator<BidiIter>&operator++(); + regex_iterator<BidiIter>operator++(int);};
                                                    -

                                                    Description

                                                    +

                                                    Description

                                                    -

                                                    +

                                                    regex_iterator public construct/copy/destruct

                                                      -
                                                    1. regex_iterator();
                                                      2. -
                                                    2. regex_iterator(BidiIter begin, BidiIter end, 
+
                                                    3. regex_iterator();
                                                      4. 
+
                                                    4. regex_iterator(BidiIter begin, BidiIter end, 
                basic_regex< BidiIter > const & rex, 
                regex_constants::match_flag_type flags = regex_constants::match_default);
                                                      5. 
 
                                                    5. template<typename LetExpr> 
-  regex_iterator(BidiIter begin, BidiIter end, 
+  regex_iterator(BidiIter begin, BidiIter end, 
                  basic_regex< BidiIter > const & rex, unspecified args, 
                  regex_constants::match_flag_type flags = regex_constants::match_default);
                                                      6. 
-
                                                    6. regex_iterator(regex_iterator< BidiIter > const & that);
                                                      7. 
+
                                                    7. regex_iterator(regex_iterator< BidiIter > const & that);
                                                      8. 
 
                                                    8. regex_iterator< BidiIter > & 
-operator=(regex_iterator< BidiIter > const & that);
                                                      9. 
+operator=(regex_iterator< BidiIter > const & that);
                                                    -

                                                    -regex_iterator public member functions

                                                    +

                                                    +regex_iterator public member functions

                                                      -
                                                    1. value_type const & operator*() const;
                                                      2. -
                                                    2. value_type const * operator->() const;
                                                      3. +
                                                    3. value_type const & operator*() const;
                                                      4. +
                                                    4. value_type const * operator->() const;
                                                    5. -
                                                      regex_iterator< BidiIter > & operator++();
                                                      +
                                                      regex_iterator< BidiIter > & operator++();

                                                      If what.prefix().first != what[0].second and if the element match_prev_avail is not set in flags then sets it. Then behaves as if by calling regex_search(what[0].second, end, what, *pre, flags), with the following variation: in the event that the previous match found was of zero length (what[0].length() == 0) then attempts to find a non-zero length match starting at what[0].second, only if that fails and provided what[0].second != suffix().second does it look for a (possibly zero length) match starting from what[0].second + 1. If no further match is found then sets *this equal to the end of sequence iterator. @@ -173,7 +173,7 @@

                                                    3. -
                                                  3. regex_iterator< BidiIter > operator++(int);
                                                    4. +
                                                  4. regex_iterator< BidiIter > operator++(int);
                                                  diff --git a/doc/html/boost/xpressive/regex_match.html b/doc/html/boost/xpressive/regex_match.html index b9d8cf02b8..7f549884b4 100644 --- a/doc/html/boost/xpressive/regex_match.html +++ b/doc/html/boost/xpressive/regex_match.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                                                  -PrevUpHomeNext +PrevUpHomeNext
                                                  @@ -68,7 +68,7 @@ regex_constants::match_flag_type flags = regex_constants::match_default, unspecified = 0);
                                                  -

                                                  Description

                                                  +

                                                  Description

                                                  Determines whether there is an exact match between the regular expression re, and all of the sequence [begin, end).

                                                  @@ -144,7 +144,7 @@

                                                  -PrevUpHomeNext +PrevUpHomeNext
                                                  diff --git a/doc/html/boost/xpressive/regex_replace.html b/doc/html/boost/xpressive/regex_replace.html index a049765dcf..3b1d862b6e 100644 --- a/doc/html/boost/xpressive/regex_replace.html +++ b/doc/html/boost/xpressive/regex_replace.html @@ -80,7 +80,7 @@ typename add_const< Char >::type * format, regex_constants::match_flag_type flags = regex_constants::match_default);
                                                  -

                                                  Description

                                                  +

                                                  Description

                                                  Constructs a regex_iterator object: regex_iterator< BidiIter > i(begin, end, re, flags), and uses i to enumerate through all of the matches m of type match_results< BidiIter > that occur within the sequence [begin, end). If no such matches are found and !(flags & format_no_copy) then calls std::copy(begin, end, out). Otherwise, for each match found, if !(flags & format_no_copy) calls std::copy(m.prefix().first, m.prefix().second, out), and then calls m.format(out, format, flags). Finally if !(flags & format_no_copy) calls std::copy(last_m.suffix().first, last_m.suffix().second, out) where last_m is a copy of the last match found.

                                                  If flags & format_first_only is non-zero then only the first match found is replaced.

                                                  diff --git a/doc/html/boost/xpressive/regex_search.html b/doc/html/boost/xpressive/regex_search.html index 8e79e923c6..c861dd7bb9 100644 --- a/doc/html/boost/xpressive/regex_search.html +++ b/doc/html/boost/xpressive/regex_search.html @@ -68,7 +68,7 @@ regex_constants::match_flag_type flags = regex_constants::match_default, unspecified = 0);

                                                  -

                                                  Description

                                                  +

                                                  Description

                                                  Determines whether there is some sub-sequence within [begin,end) that matches the regular expression re.

                                                  diff --git a/doc/html/boost/xpressive/regex_token_iterator.html b/doc/html/boost/xpressive/regex_token_iterator.html index b153214a75..366f039148 100644 --- a/doc/html/boost/xpressive/regex_token_iterator.html +++ b/doc/html/boost/xpressive/regex_token_iterator.html @@ -35,39 +35,39 @@ template<typename BidiIter> struct regex_token_iterator { // construct/copy/destruct - regex_token_iterator(); - regex_token_iterator(BidiIter, BidiIter, basic_regex< BidiIter > const &); + regex_token_iterator(); + regex_token_iterator(BidiIter, BidiIter, basic_regex< BidiIter > const &); template<typename LetExpr> - regex_token_iterator(BidiIter, BidiIter, basic_regex< BidiIter > const &, + regex_token_iterator(BidiIter, BidiIter, basic_regex< BidiIter > const &, unspecified); template<typename Subs> - regex_token_iterator(BidiIter, BidiIter, basic_regex< BidiIter > const &, + regex_token_iterator(BidiIter, BidiIter, basic_regex< BidiIter > const &, Subs const &, regex_constants::match_flag_type = regex_constants::match_default); template<typename Subs, typename LetExpr> - regex_token_iterator(BidiIter, BidiIter, basic_regex< BidiIter > const &, + regex_token_iterator(BidiIter, BidiIter, basic_regex< BidiIter > const &, Subs const &, unspecified, regex_constants::match_flag_type = regex_constants::match_default); - regex_token_iterator(regex_token_iterator< BidiIter > const &); + regex_token_iterator(regex_token_iterator< BidiIter > const &); regex_token_iterator< BidiIter > & - operator=(regex_token_iterator< BidiIter > const &); + operator=(regex_token_iterator< BidiIter > const &); - // public member functions - value_type const & operator*() const; - value_type const * operator->() const; - regex_token_iterator< BidiIter > & operator++(); - regex_token_iterator< BidiIter > operator++(int); + // public member functions + value_type const & operator*() const; + value_type const * operator->() const; + regex_token_iterator< BidiIter > & operator++(); + regex_token_iterator< BidiIter > operator++(int); };

                                                  -

                                                  Description

                                                  +

                                                  Description

                                                  -

                                                  +

                                                  regex_token_iterator public construct/copy/destruct

                                                  1. -
                                                    regex_token_iterator();
                                                    +
                                                    regex_token_iterator();

                                                    @@ -82,7 +82,7 @@
                                                  2. -
                                                    regex_token_iterator(BidiIter begin, BidiIter end, 
+
                                                    regex_token_iterator(BidiIter begin, BidiIter end, 
                      basic_regex< BidiIter > const & rex);
                                                    
 
                                                    
 
@@ -125,7 +125,7 @@
 
                                                  3. template<typename LetExpr> 
-  regex_token_iterator(BidiIter begin, BidiIter end, 
+  regex_token_iterator(BidiIter begin, BidiIter end, 
                        basic_regex< BidiIter > const & rex, unspecified args);

                                                    @@ -172,7 +172,7 @@ 

                                                  4. template<typename Subs> 
-  regex_token_iterator(BidiIter begin, BidiIter end, 
+  regex_token_iterator(BidiIter begin, BidiIter end, 
                        basic_regex< BidiIter > const & rex, 
                        Subs const & subs, 
                        regex_constants::match_flag_type flags = regex_constants::match_default);
                                                    @@ -230,7 +230,7 @@ 
                                                  5. template<typename Subs, typename LetExpr> 
-  regex_token_iterator(BidiIter begin, BidiIter end, 
+  regex_token_iterator(BidiIter begin, BidiIter end, 
                        basic_regex< BidiIter > const & rex, 
                        Subs const & subs, unspecified args, 
                        regex_constants::match_flag_type flags = regex_constants::match_default);
                                                    @@ -291,7 +291,7 @@
                                                2. -
                                                  regex_token_iterator(regex_token_iterator< BidiIter > const & that);
                                                  +
                                                  regex_token_iterator(regex_token_iterator< BidiIter > const & that);

                                                  @@ -307,7 +307,7 @@ 
                                                3. regex_token_iterator< BidiIter > & 
-operator=(regex_token_iterator< BidiIter > const & that);
                                                  +operator=(regex_token_iterator< BidiIter > const & that);

                                                  4. @@ -324,16 +324,16 @@
                                                  -

                                                  -regex_token_iterator public member functions

                                                  +

                                                  +regex_token_iterator public member functions

                                                    -
                                                  1. value_type const & operator*() const;
                                                    2. -
                                                  2. value_type const * operator->() const;
                                                    3. +
                                                  3. value_type const & operator*() const;
                                                    4. +
                                                  4. value_type const * operator->() const;
                                                  5. -
                                                    regex_token_iterator< BidiIter > & operator++();
                                                    +
                                                    regex_token_iterator< BidiIter > & operator++();

                                                    If N == -1 then sets *this equal to the end of sequence iterator. Otherwise if N+1 < subs.size(), then increments N and sets result equal to ((subs[N] == -1) ? value_type(what.prefix().str()) : value_type(what[subs[N]].str())). Otherwise if what.prefix().first != what[0].second and if the element match_prev_avail is not set in flags then sets it. Then locates the next match as if by calling regex_search(what[0].second, end, what, *pre, flags), with the following variation: in the event that the previous match found was of zero length (what[0].length() == 0) then attempts to find a non-zero length match starting at what[0].second, only if that fails and provided what[0].second != suffix().second does it look for a (possibly zero length) match starting from what[0].second + 1. If such a match is found then sets N equal to zero, and sets result equal to ((subs[N] == -1) ? value_type(what.prefix().str()) : value_type(what[subs[N]].str())). Otherwise if no further matches were found, then let last_end be the endpoint of the last match that was found. Then if last_end != end and subs[0] == -1 sets N equal to -1 and sets result equal to value_type(last_end, end). Otherwise sets *this equal to the end of sequence iterator.

                                                    6. -
                                                  6. regex_token_iterator< BidiIter > operator++(int);
                                                    7. +
                                                  7. regex_token_iterator< BidiIter > operator++(int);
                                                  diff --git a/doc/html/boost/xpressive/regex_traits.html b/doc/html/boost/xpressive/regex_traits.html index d6a886c3ff..fa8a7f2357 100644 --- a/doc/html/boost/xpressive/regex_traits.html +++ b/doc/html/boost/xpressive/regex_traits.html @@ -38,20 +38,20 @@ typedefImpl::locale_typelocale_type;// construct/copy/destruct - regex_traits(); - explicitregex_traits(locale_typeconst&); + regex_traits(); + explicitregex_traits(locale_typeconst&);};
                                                  -

                                                  Description

                                                  +

                                                  Description

                                                  Thin wrapper around the default regex_traits implementation, either cpp_regex_traits or c_regex_traits

                                                  -

                                                  +

                                                  regex_traits public construct/copy/destruct

                                                    -
                                                  1. regex_traits();
                                                    2. -
                                                  2. explicit regex_traits(locale_type const & loc);
                                                    3. +
                                                  3. regex_traits();
                                                    4. +
                                                  4. explicit regex_traits(locale_type const & loc);
                                                  diff --git a/doc/html/boost/xpressive/regex_traits_version_1_tag.html b/doc/html/boost/xpressive/regex_traits_version_1_tag.html index 7af3d97db1..e10dc4a875 100644 --- a/doc/html/boost/xpressive/regex_traits_version_1_tag.html +++ b/doc/html/boost/xpressive/regex_traits_version_1_tag.html @@ -36,7 +36,7 @@ structregex_traits_version_1_tag{};
                                                  -

                                                  Description

                                                  +

                                                  Description

                                                  Tag used to denote that a traits class conforms to the version 1 traits interface.

                                                  diff --git a/doc/html/boost/xpressive/regex_traits_version_2_tag.html b/doc/html/boost/xpressive/regex_traits_version_2_tag.html index d47eb1c33b..4fdf4e6890 100644 --- a/doc/html/boost/xpressive/regex_traits_version_2_tag.html +++ b/doc/html/boost/xpressive/regex_traits_version_2_tag.html @@ -38,7 +38,7 @@ {};
                                                  -

                                                  Description

                                                  +

                                                  Description

                                                  Tag used to denote that a traits class conforms to the version 2 traits interface.

                                                  diff --git a/doc/html/boost/xpressive/repeat.html b/doc/html/boost/xpressive/repeat.html index 5fa5661824..10a8bc6dde 100644 --- a/doc/html/boost/xpressive/repeat.html +++ b/doc/html/boost/xpressive/repeat.html @@ -38,7 +38,7 @@ template<unsignedint Count,typenameExpr2>unspecifiedrepeat(Expr2const& expr2);
                                                  -

                                                  Description

                                                  +

                                                  Description

                                                  There are two forms of the repeat<>() function template. To match a sub-expression N times, use repeat<N>(expr). To match a sub-expression from M to N times, use repeat<M,N>(expr).

                                                  The repeat<>() function creates a greedy quantifier. To make the quantifier non-greedy, apply the unary minus operator, as in -repeat<M,N>(expr).

                                                  diff --git a/doc/html/boost/xpressive/s1.html b/doc/html/boost/xpressive/s1.html index 0d3f71b9a4..8ccfde1f55 100644 --- a/doc/html/boost/xpressive/s1.html +++ b/doc/html/boost/xpressive/s1.html @@ -34,7 +34,7 @@ mark_tag const s1;

                                                  -

                                                  Description

                                                  +

                                                  Description

                                                  To create a sub-match, assign a sub-expression to the sub-match placeholder. For instance, (s1= _) will match any one character and remember which character was matched in the 1st sub-match. Later in the pattern, you can refer back to the sub-match. For instance, (s1= _) >> s1 will match any character, and then match the same character again.

                                                  After a successful regex_match() or regex_search(), the sub-match placeholders can be used to index into the match_results<> object to retrieve the Nth sub-match.

                                                  diff --git a/doc/html/boost/xpressive/self.html b/doc/html/boost/xpressive/self.html index 5453b4c724..3434144d48 100644 --- a/doc/html/boost/xpressive/self.html +++ b/doc/html/boost/xpressive/self.html @@ -34,7 +34,7 @@ unspecified self;
                                                  -

                                                  Description

                                                  +

                                                  Description

                                                  Useful when constructing recursive regular expression objects. The 'self' identifier is a short-hand for the current regex object. For instance, sregex rx = '(' >> (self | nil) >> ')'; will create a regex object that matches balanced parens such as "((()))".

                                                  diff --git a/doc/html/boost/xpressive/set.html b/doc/html/boost/xpressive/set.html index 03c352a8b8..1009d03ea1 100644 --- a/doc/html/boost/xpressive/set.html +++ b/doc/html/boost/xpressive/set.html @@ -34,7 +34,7 @@ unspecified set;
                                                  -

                                                  Description

                                                  +

                                                  Description

                                                  There are two ways to create character sets with the 'set' identifier. The easiest is to create a comma-separated list of the characters in the set, as in (set= 'a','b','c'). This set will match 'a', 'b', or 'c'. The other way is to define the set as an argument to the set subscript operator. For instance, set[ 'a' | range('b','c') | digit ] will match an 'a', 'b', 'c' or a digit character.

                                                  To complement a set, apply the '~' operator. For instance, ~(set= 'a','b','c') will match any character that is not an 'a', 'b', or 'c'.

                                                  Sets can be composed of other, possibly complemented, sets. For instance, set[ ~digit | ~(set= 'a','b','c') ].

                                                  diff --git a/doc/html/boost/xpressive/skip.html b/doc/html/boost/xpressive/skip.html index eccf626423..d7529f900c 100644 --- a/doc/html/boost/xpressive/skip.html +++ b/doc/html/boost/xpressive/skip.html @@ -35,7 +35,7 @@ template<typename Skip> unspecified skip(Skip const & skip);
                                                  -

                                                  Description

                                                  +

                                                  Description

                                                  skip() instructs the regex engine to skip certain characters when matching a regex. It is most useful for writing regexes that ignore whitespace. For instance, the following specifies a regex that skips whitespace and punctuation:

                                                  // A sentence is one or more words separated by whitespace
 // and punctuation.
diff --git a/doc/html/boost/xpressive/space.html b/doc/html/boost/xpressive/space.html
index 791d35635d..1b8f7e20dc 100644
--- a/doc/html/boost/xpressive/space.html
+++ b/doc/html/boost/xpressive/space.html
@@ -34,7 +34,7 @@
 
 unspecified space;
                                                  -

                                                  Description

                                                  +

                                                  Description

                                                  The regex traits are used to determine which characters are space characters. To match any character that is not white-space, use ~space.

                                                  diff --git a/doc/html/boost/xpressive/static_c_idm45506840050768.html b/doc/html/boost/xpressive/static_c_idm45506840050768.html new file mode 100644 index 0000000000..a724325792 --- /dev/null +++ b/doc/html/boost/xpressive/static_c_idm45506840050768.html @@ -0,0 +1,96 @@ + + + + +Function template static_cast_ + + + + + + + + +
                                                  + + + + + + +
                                                  Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                  +
                                                  +
                                                  +PrevUpHomeNext +
                                                  +
                                                  +
                                                  +
                                                  +

                                                  Function template static_cast_

                                                  +

                                                  boost::xpressive::static_cast_ — static_cast_ is a lazy funtion for statically casting a parameter to a different type.

                                                  +
                                                  +

                                                  Synopsis

                                                  +
                                                  // In header: <boost/xpressive/regex_actions.hpp>
+
+
+template<typename T, typename A> unspecified static_cast_(A const & a);
                                                  +
                                                  +

                                                  Description

                                                  +

                                                  + + +

                                                  +
                                                  ++++ + + + + + + + + + + + + + + +

                                                  Parameters:

                                                  ++++ + + + + +

                                                  a

                                                  The lazy value to statically cast.

                                                  Template Parameters:

                                                  ++++ + + + + +

                                                  T

                                                  The type to which to statically cast the parameter.

                                                  Returns:

                                                  A lazy object that, when evaluated, statically casts its argument to the desired type.

                                                  +
                                                  +
                                                  + + + +
                                                  Copyright © 2007 Eric Niebler

                                                  + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                  +
                                                  +
                                                  +
                                                  +PrevUpHomeNext +
                                                  + + diff --git a/doc/html/boost/xpressive/static_cast_idp358489776.html b/doc/html/boost/xpressive/static_cast_idp358489776.html deleted file mode 100644 index 2e40835cd0..0000000000 --- a/doc/html/boost/xpressive/static_cast_idp358489776.html +++ /dev/null @@ -1,96 +0,0 @@ - - - - -Function template static_cast_ - - - - - - - - - - - - - - - -
                                                  Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                  -
                                                  -
                                                  -PrevUpHomeNext -
                                                  -
                                                  -
                                                  -
                                                  -

                                                  Function template static_cast_

                                                  -

                                                  boost::xpressive::static_cast_ — static_cast_ is a lazy funtion for statically casting a parameter to a different type.

                                                  -
                                                  -

                                                  Synopsis

                                                  -
                                                  // In header: <boost/xpressive/regex_actions.hpp>
-
-
-template<typename T, typename A> unspecified static_cast_(A const & a);
                                                  -
                                                  -

                                                  Description

                                                  -

                                                  - - -

                                                  -
                                                  ---- - - - - - - - - - - - - - - -

                                                  Parameters:

                                                  ---- - - - - -

                                                  a

                                                  The lazy value to statically cast.

                                                  Template Parameters:

                                                  ---- - - - - -

                                                  T

                                                  The type to which to statically cast the parameter.

                                                  Returns:

                                                  A lazy object that, when evaluated, statically casts its argument to the desired type.

                                                  -
                                                  -
                                                  - - - -
                                                  Copyright © 2007 Eric Niebler

                                                  - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                  -
                                                  -
                                                  -
                                                  -PrevUpHomeNext -
                                                  - - diff --git a/doc/html/boost/xpressive/sub_match.html b/doc/html/boost/xpressive/sub_match.html index 36c12721b0..f9c9c7b6ef 100644 --- a/doc/html/boost/xpressive/sub_match.html +++ b/doc/html/boost/xpressive/sub_match.html @@ -41,47 +41,47 @@ typedef BidiIter iterator; // construct/copy/destruct - sub_match(); - sub_match(BidiIter, BidiIter, bool = false); + sub_match(); + sub_match(BidiIter, BidiIter, bool = false); - // public member functions - string_type str() const; - operator string_type() const; - difference_type length() const; - operator bool_type() const; - bool operator!() const; - int compare(string_type const &) const; - int compare(sub_match const &) const; - int compare(value_type const *) const; + // public member functions + string_type str() const; + operator string_type() const; + difference_type length() const; + operator bool_type() const; + bool operator!() const; + int compare(string_type const &) const; + int compare(sub_match const &) const; + int compare(value_type const *) const; // public data members bool matched; // true if this sub-match participated in the full match. };
                                                  -

                                                  Description

                                                  +

                                                  Description

                                                  When the marked sub-expression denoted by an object of type sub_match<> participated in a regular expression match then member matched evaluates to true, and members first and second denote the range of characters [first,second) which formed that match. Otherwise matched is false, and members first and second contained undefined values.

                                                  If an object of type sub_match<> represents sub-expression 0 - that is to say the whole match - then member matched is always true, unless a partial match was obtained as a result of the flag match_partial being passed to a regular expression algorithm, in which case member matched is false, and members first and second represent the character range that formed the partial match.

                                                  -

                                                  +

                                                  sub_match public construct/copy/destruct

                                                    -
                                                  1. sub_match();
                                                    2. -
                                                  2. sub_match(BidiIter first, BidiIter second, bool matched_ = false);
                                                    3. +
                                                  3. sub_match();
                                                    4. +
                                                  4. sub_match(BidiIter first, BidiIter second, bool matched_ = false);
                                                  -

                                                  -sub_match public member functions

                                                  +

                                                  +sub_match public member functions

                                                    -
                                                  1. string_type str() const;
                                                    2. -
                                                  2. operator string_type() const;
                                                    3. -
                                                  3. difference_type length() const;
                                                    4. -
                                                  4. operator bool_type() const;
                                                    5. -
                                                  5. bool operator!() const;
                                                    6. +
                                                  6. string_type str() const;
                                                    7. +
                                                  7. operator string_type() const;
                                                    8. +
                                                  8. difference_type length() const;
                                                    9. +
                                                  9. operator bool_type() const;
                                                    10. +
                                                  10. bool operator!() const;
                                                  11. -
                                                    int compare(string_type const & str) const;
                                                    Performs a lexicographic string comparison.

                                                    +

                                                    int compare(string_type const & str) const;
                                                    Performs a lexicographic string comparison.

                                                    @@ -111,11 +111,11 @@
                                                  12. -
                                                    int compare(sub_match const & sub) const;
                                                    +
                                                    int compare(sub_match const & sub) const;

                                                    This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

                                                  13. -
                                                    int compare(value_type const * ptr) const;
                                                    +
                                                    int compare(value_type const * ptr) const;

                                                    This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

                                                  diff --git a/doc/html/boost/xpressive/swap_idm45506840643536.html b/doc/html/boost/xpressive/swap_idm45506840643536.html new file mode 100644 index 0000000000..3d98577b77 --- /dev/null +++ b/doc/html/boost/xpressive/swap_idm45506840643536.html @@ -0,0 +1,98 @@ + + + + +Function template swap + + + + + + + + + + + + + + + +
                                                  Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                  +
                                                  +
                                                  +PrevUpHomeNext +
                                                  +
                                                  +
                                                  +
                                                  +

                                                  Function template swap

                                                  +

                                                  boost::xpressive::swap — Swaps the contents of two basic_regex objects.

                                                  +
                                                  +

                                                  Synopsis

                                                  +
                                                  // In header: <boost/xpressive/basic_regex.hpp>
+
+
+template<typename BidiIter> 
+  void swap(basic_regex< BidiIter > & left, basic_regex< BidiIter > & right);
                                                  +
                                                  +

                                                  Description

                                                  +

                                                  +

                                                  +
                                                  + + + + + +
                                                  [Note]Note

                                                  This is a shallow swap that does not do reference tracking. If you embed a basic_regex object by reference in another regular expression and then swap its contents with another basic_regex object, the change will not be visible to the enclosing regular expression. It is done this way to ensure that swap() cannot throw.

                                                  +

                                                  + +

                                                  +
                                                  ++++ + + + + + + + + + + +

                                                  Parameters:

                                                  ++++ + + + + + + + + + + +

                                                  left

                                                  The first basic_regex object.

                                                  right

                                                  The second basic_regex object.

                                                  Throws:

                                                  		Will not throw.
                                                  +
                                                  +
                                                  + + + +
                                                  Copyright © 2007 Eric Niebler

                                                  + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

                                                  +
                                                  +
                                                  +
                                                  +PrevUpHomeNext +
                                                  + + diff --git a/doc/html/boost/xpressive/swap_idp357897008.html b/doc/html/boost/xpressive/swap_idp357897008.html deleted file mode 100644 index 27bede62f3..0000000000 --- a/doc/html/boost/xpressive/swap_idp357897008.html +++ /dev/null @@ -1,98 +0,0 @@ - - - - -Function template swap - - - - - - - - - - - - - - - -
                                                  Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                                                  -
                                                  -
                                                  -PrevUpHomeNext -
                                                  -
                                                  -
                                                  -
                                                  -

                                                  Function template swap

                                                  -

                                                  boost::xpressive::swap — Swaps the contents of two basic_regex objects.

                                                  -
                                                  -

                                                  Synopsis

                                                  -
                                                  // In header: <boost/xpressive/basic_regex.hpp>
-
-
-template<typename BidiIter> 
-  void swap(basic_regex< BidiIter > & left, basic_regex< BidiIter > & right);
                                                  -
                                                  -

                                                  Description

                                                  -

                                                  -

                                                  -
                                                  - - - - - -
                                                  [Note]Note

                                                  This is a shallow swap that does not do reference tracking. If you embed a basic_regex object by reference in another regular expression and then swap its contents with another basic_regex object, the change will not be visible to the enclosing regular expression. It is done this way to ensure that swap() cannot throw.

                                                  -

                                                  - -

                                                  -
                                                  ---- - - - - - - - - - - -

                                                  Parameters:

                                                  ---- - - - - - - - - - - -

                                                  left

                                                  The first basic_regex object.

                                                  right

                                                  The second basic_regex object.

                                                  Throws:

                                                  		Will not throw.
                                                  -
                                                  -
                                                  - - - -
                                                  Copyright © 2007 Eric Niebler

                                                  - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

                                                  -
                                                  -
                                                  -
                                                  -PrevUpHomeNext -
                                                  - - diff --git a/doc/html/boost/xpressive/unwrap_reference.html b/doc/html/boost/xpressive/unwrap_reference.html index 46e29ce17f..f579668b1f 100644 --- a/doc/html/boost/xpressive/unwrap_reference.html +++ b/doc/html/boost/xpressive/unwrap_reference.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
                                                  -PrevUpHomeNext +PrevUpHomeNext
                                                  @@ -44,7 +44,7 @@
                                                  -PrevUpHomeNext +PrevUpHomeNext
                                                  diff --git a/doc/html/boost/xpressive/upper.html b/doc/html/boost/xpressive/upper.html index c96a50333a..0f3b1aabdf 100644 --- a/doc/html/boost/xpressive/upper.html +++ b/doc/html/boost/xpressive/upper.html @@ -34,7 +34,7 @@ unspecified upper;
                                                  -

                                                  Description

                                                  +

                                                  Description

                                                  The regex traits are used to determine which characters are upper-case. To match any character that is not upper-case, use ~upper.

                                                  diff --git a/doc/html/boost/xpressive/val.html b/doc/html/boost/xpressive/val.html index 25d41b3c3a..96053dd457 100644 --- a/doc/html/boost/xpressive/val.html +++ b/doc/html/boost/xpressive/val.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                                                  -PrevUpHomeNext +PrevUpHomeNext
                                                  @@ -35,7 +35,7 @@ template<typename T> value< T > const val(T const & t);
                                                  -

                                                  Description

                                                  +

                                                  Description

                                                  @@ -60,7 +60,7 @@
                                                  -PrevUpHomeNext +PrevUpHomeNext
                                                  diff --git a/doc/html/boost/xpressive/value.html b/doc/html/boost/xpressive/value.html index 78c6ecc27f..33b1d2f1ab 100644 --- a/doc/html/boost/xpressive/value.html +++ b/doc/html/boost/xpressive/value.html @@ -37,15 +37,15 @@ public proto::extends< proto::terminal< T >::type, value< T > > { // construct/copy/destruct - value(); - explicit value(T const &); + value(); + explicit value(T const &); - // public member functions - T & get(); - T const & get() const; + // public member functions + T & get(); + T const & get() const; };
                                                  -

                                                  Description

                                                  +

                                                  Description

                                                  Below is an example that shows where value<> is useful.

                                                  sregex good_voodoo(boost::shared_ptr<int> pi)
@@ -59,22 +59,22 @@ Below is an example that shows where xpressive::val() is a function that returns a value<> object. Had val() not been used here, the operation ++*pi would have been evaluated eagerly once, instead of lazily when the regex match happens. 
                                                  
 
                                                  
-
                                                  Template Parameters
                                                  
+
                                                  Template Parameters
                                                  
 
                                                  1. 
 
                                                    typename T
                                                    
 
                                                    The type of the value to store.
                                                    
 
                                                  
 
                                                  
 
                                                  
-
                                                  
+
                                                  
 value 
         public
        construct/copy/destruct
                                                  
 
                                                    
 
                                                  1. 
-
                                                    value();
                                                    Store a default-constructed T. 
                                                    2. 
+
                                                    value();
                                                    Store a default-constructed T. 
 
                                                  2. 
-
                                                    explicit value(T const & t);
                                                    Store a copy of t. 
                                                    
+
                                                    explicit value(T const & t);
                                                    Store a copy of t. 
                                                    
 
                                                    
 
                                                    @@ -99,15 +99,15 @@ Below is an example that shows where 
-
                                                    
-value public member functions
                                                    
+
                                                    
+value public member functions
                                                    
 
                                                      
 
                                                    1. 
-
                                                      T & get();
                                                      
+
                                                      T & get();
                                                      
 
                                                      This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. 
                                                      
 
                                                      2. 
 
                                                    2. 
-
                                                      T const & get() const;
                                                      Fetch the stored value. 
                                                      3. 
+
                                                      T const & get() const;
                                                      Fetch the stored value. 
 
                                                    
 
 
diff --git a/doc/html/boost/xpressive/xdigit.html b/doc/html/boost/xpressive/xdigit.html
index ef37a26c19..82c0688618 100644
--- a/doc/html/boost/xpressive/xdigit.html
+++ b/doc/html/boost/xpressive/xdigit.html
@@ -34,7 +34,7 @@
 
 unspecified xdigit;
 
                                                    
-
                                                    Description
                                                    
+
                                                    Description
                                                    
 
                                                    The regex traits are used to determine which characters are hex digits. To match any character that is not a hex digit, use ~xdigit.
                                                    
 
                                                    
 

                                                    
-- 
cgit v1.2.3